{"meta":{"query_hash":"46938b97bdab","filters":{"topic":"Security and Verification in Computing"},"cohort_total":403,"direct_labels_cover":0,"predictions_cover":403,"exported":403,"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/46938b97bdab","api":"https://metacan.xera.ac/api/v1/cohort?topic=Security+and+Verification+in+Computing"},"results":[{"id":"W1041081938","doi":"","title":"Fusion将至 AMD Ontario APU解析","year":2010,"lang":"el","type":"article","venue":"电脑迷","topic":"Security and Verification in Computing","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":"Computer science","score_opus":0.01778399310936379,"score_gpt":0.23961848205742492,"score_spread":0.22183448894806113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1041081938","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.8220757,0.0001774896,0.100635365,0.0043041827,0.02008576,0.0003068917,0.0000050100575,0.00036029948,0.052049268],"genre_scores_gemma":[0.96646124,0.0000076034034,0.025583327,0.0010591208,0.0011287667,0.0000053895865,0.0000031143568,0.000012466444,0.005738997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836403,0.00004818316,0.00031351647,0.0005419595,0.0003498029,0.00038248848],"domain_scores_gemma":[0.9983832,0.00013093217,0.00014927049,0.001024002,0.00013550669,0.0001770728],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045950877,0.00017909787,0.00016974685,0.00008369392,0.00043223053,0.00042042555,0.0012335674,0.00019536284,0.0013650955],"category_scores_gemma":[0.00006521813,0.00018767705,0.000100933285,0.00032076862,0.000093100665,0.000297245,0.00045568336,0.00085736247,0.0016477901],"study_design_candidate":"not_applicable","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.000021680224,0.0006909819,0.023263237,0.00007915555,0.00006456506,0.000067611414,0.048921328,0.00007104013,0.010924839,0.48768905,0.062426787,0.36577973],"study_design_scores_gemma":[0.0004396592,0.000074210846,0.08094776,0.00005451056,0.0000147433275,0.000051956333,0.000079042744,0.045036133,0.0018466719,0.0052258754,0.8657425,0.0004869611],"about_ca_topic_score_codex":0.007954546,"about_ca_topic_score_gemma":0.021208407,"teacher_disagreement_score":0.8033157,"about_ca_system_score_codex":0.00006713409,"about_ca_system_score_gemma":0.0004180007,"threshold_uncertainty_score":0.9995478},"labels":[],"label_agreement":null},{"id":"W126196860","doi":"10.1007/978-0-387-73655-6_20","title":"Control Flow Based Pointcuts for Security Hardening Concerns","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Security and Verification in Computing","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Correctness; Computer science; Control flow; Programming language; Control flow graph","score_opus":0.05707957330283056,"score_gpt":0.29141339226327906,"score_spread":0.2343338189604485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126196860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0000010346878,0.0001332879,0.73187155,0.0006424082,0.0008609956,0.00047964163,0.00003573503,0.00036991423,0.26560545],"genre_scores_gemma":[0.06909859,0.000027106846,0.695058,0.018035423,0.004128106,0.00009857075,0.00020003115,0.00020628386,0.21314788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.000022198841,0.00054742687,0.0007951359,0.00042285217,0.00042100548],"domain_scores_gemma":[0.99742657,0.0008493244,0.00033761055,0.0008388313,0.0003811721,0.0001665087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080788793,0.00037196992,0.00045117937,0.00019810742,0.00026316813,0.00026082457,0.0011541646,0.00041536527,0.0003381925],"category_scores_gemma":[0.00006777864,0.00038898253,0.00033989298,0.000049203114,0.00007680381,0.00017487863,0.00011941814,0.00041077484,0.0001190428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020506077,0.000014688825,0.0000030088006,0.000057707526,0.000050839226,0.000009495772,0.00017776756,0.00020402012,0.0000056633376,0.9805797,0.008461777,0.010414832],"study_design_scores_gemma":[0.00086593267,0.00006914956,0.0000020477155,0.00009520571,0.000021551998,0.0000065625222,0.0000029050207,0.55446494,0.0001770805,0.03255375,0.41133168,0.00040919572],"about_ca_topic_score_codex":0.000012325868,"about_ca_topic_score_gemma":0.000016813547,"teacher_disagreement_score":0.94802594,"about_ca_system_score_codex":0.00011878687,"about_ca_system_score_gemma":0.00023100252,"threshold_uncertainty_score":0.99985623},"labels":[],"label_agreement":null},{"id":"W131327581","doi":"","title":"Security benchmarking using partial verification","year":2008,"lang":"en","type":"article","venue":"USENIX Security Symposium","topic":"Security and Verification in Computing","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":"Benchmarking; Computer science; Computer security; Order (exchange); Threat model; Partial order reduction; Model checking; Theoretical computer science; Business","score_opus":0.0338729842272198,"score_gpt":0.2591525270121877,"score_spread":0.22527954278496792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131327581","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.74542445,0.00020197242,0.24686499,0.0011088874,0.0027951885,0.00039175118,0.000008818685,0.00076082366,0.0024431178],"genre_scores_gemma":[0.9863042,0.00008584604,0.012388666,0.00031872684,0.0008266604,0.000014855458,0.000017412518,0.000022467671,0.000021163254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969869,0.0002560275,0.0006042285,0.0009107244,0.0006251065,0.0006170087],"domain_scores_gemma":[0.99788606,0.00014535965,0.00030870407,0.0011970903,0.00022905199,0.00023374819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005824751,0.00031101424,0.0003107264,0.0002036079,0.0009964865,0.00024119153,0.0012051358,0.00021417247,0.000039396025],"category_scores_gemma":[0.00006123156,0.00035998068,0.00017618225,0.00082316215,0.00016550091,0.001120312,0.00038032222,0.00041979377,0.000089312205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001542821,0.0026005341,0.034997217,0.00045811644,0.00033520238,0.0006483675,0.19306572,0.007277778,0.078445815,0.6649531,0.012718856,0.0043450026],"study_design_scores_gemma":[0.0006193643,0.00008814695,0.0011205192,0.00005228998,0.000021888318,0.0006086908,0.00009986889,0.9399988,0.0235146,0.0046025827,0.028504875,0.00076837477],"about_ca_topic_score_codex":0.00018412115,"about_ca_topic_score_gemma":0.00000791011,"teacher_disagreement_score":0.932721,"about_ca_system_score_codex":0.00017854186,"about_ca_system_score_gemma":0.00022017019,"threshold_uncertainty_score":0.9998852},"labels":[],"label_agreement":null},{"id":"W145643130","doi":"10.1007/978-3-642-39454-6_12","title":"Improving Tool Support for Software Reverse Engineering in a Security Context","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Defence Research and Development Canada; University of Victoria","funders":"","keywords":"Computer science; Reverse engineering; Software engineering; Context (archaeology); Software; Operating system","score_opus":0.014965923407083642,"score_gpt":0.22937143873307758,"score_spread":0.21440551532599395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145643130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00044295983,0.00016455246,0.9960443,0.00027134622,0.0017083485,0.00093005114,0.000007453939,0.00024676815,0.00018421708],"genre_scores_gemma":[0.19547485,0.000016399103,0.801589,0.0019497391,0.0006056289,0.00008513,0.000012655175,0.00005848406,0.00020811621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961571,0.000022982867,0.0007756216,0.0016064041,0.000615169,0.0008226869],"domain_scores_gemma":[0.99695057,0.000986607,0.0003543514,0.0012392577,0.00032304463,0.0001461459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012717465,0.00052461086,0.00058004184,0.0008271349,0.00020147044,0.0006438428,0.0028541062,0.00039633267,0.00003497697],"category_scores_gemma":[0.0005328066,0.0005608788,0.00016880836,0.0005493749,0.00021790087,0.00095888285,0.0010495713,0.00089634035,0.000044562083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008918846,0.000049207287,0.00015415522,0.0003325116,0.000012391953,0.000050759252,0.003108795,0.02192526,0.0000958816,0.053495266,0.00016540445,0.9206014],"study_design_scores_gemma":[0.0005539457,0.00014715009,0.00008580687,0.00041876175,0.000004749348,0.00004638113,5.6973715e-7,0.9549156,0.00052285235,0.03816094,0.004369649,0.0007735978],"about_ca_topic_score_codex":0.000083036546,"about_ca_topic_score_gemma":0.000059574973,"teacher_disagreement_score":0.9329903,"about_ca_system_score_codex":0.0004652553,"about_ca_system_score_gemma":0.0006263281,"threshold_uncertainty_score":0.9996843},"labels":[],"label_agreement":null},{"id":"W1480798218","doi":"10.1007/978-3-642-10772-6_23","title":"Method-Specific Java Access Control via RMI Proxy Objects Using Annotations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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; Java; Programming language; Proxy (statistics); Operating system; Machine learning","score_opus":0.04444871022767824,"score_gpt":0.3214490313710631,"score_spread":0.2770003211433849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480798218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00003453424,0.0008223627,0.9928073,0.0008953439,0.002046688,0.00080418313,0.0000061489823,0.00033548495,0.0022478993],"genre_scores_gemma":[0.09462536,0.000046950427,0.90105957,0.003157792,0.00096492795,0.000011671102,0.0000067646447,0.0000429088,0.000084032734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945039,0.00015199573,0.0009335674,0.0022264365,0.001267907,0.00091616256],"domain_scores_gemma":[0.9954794,0.0010854506,0.0006863931,0.0018393624,0.0006537506,0.00025564872],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001709732,0.0007011355,0.0007459314,0.0013145023,0.00080253155,0.0018984242,0.005690964,0.00044301164,0.00002430285],"category_scores_gemma":[0.00009316983,0.0007117421,0.0002137082,0.0015541607,0.0004954147,0.0015715177,0.0009785906,0.0011726823,0.000036215166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006750474,0.000051106985,0.00003395457,0.00002662288,0.00001614006,0.00005584874,0.0012482303,0.15876216,0.00045057747,0.025517037,0.000024431654,0.81380713],"study_design_scores_gemma":[0.00036022,0.00008680152,0.00014785802,0.0002647059,0.000009370613,0.00014201191,2.5793892e-7,0.85744965,0.0011578088,0.13663496,0.003012581,0.0007337557],"about_ca_topic_score_codex":0.000033364857,"about_ca_topic_score_gemma":0.00001771847,"teacher_disagreement_score":0.8130734,"about_ca_system_score_codex":0.0005037365,"about_ca_system_score_gemma":0.0008286894,"threshold_uncertainty_score":0.99968874},"labels":[],"label_agreement":null},{"id":"W1486573515","doi":"10.1007/978-3-642-33704-8_11","title":"Enforcing Information Flow Policies by a Three-Valued Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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é Laval","funders":"","keywords":"Computer science; Information flow; Flow (mathematics); Theoretical computer science; Operations research; Mathematics; Geometry","score_opus":0.016550364262869086,"score_gpt":0.24745130130732781,"score_spread":0.23090093704445874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486573515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000091628855,0.0006445661,0.99472016,0.0004726733,0.001152649,0.00028164816,0.000012746363,0.00025356613,0.0023703359],"genre_scores_gemma":[0.34677264,0.000062804706,0.6488906,0.0033272398,0.00072062906,0.00001637917,0.00007646738,0.00002998101,0.00010324892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636304,0.000035728688,0.0007935935,0.0008301812,0.0011831376,0.00079433265],"domain_scores_gemma":[0.9970522,0.00036304744,0.000555129,0.0014848796,0.0003240435,0.00022072291],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013331884,0.00050148414,0.0005878556,0.0017827848,0.00048630076,0.0011577051,0.003252361,0.00035320027,0.000042942167],"category_scores_gemma":[0.00010412548,0.0004890222,0.00025164025,0.0020884324,0.00040540463,0.0024441541,0.0011457368,0.00071904954,0.000096727876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032187195,0.000020596828,0.00023472853,0.000038016497,0.000084569234,0.0000022778088,0.004188963,0.08799261,0.000022640112,0.050456617,0.00009236389,0.8568634],"study_design_scores_gemma":[0.00014134523,0.000037602505,0.00023400325,0.00008525783,0.00005008294,0.000013639975,4.3930234e-7,0.97099715,0.00041346776,0.021724798,0.0057232925,0.00057890464],"about_ca_topic_score_codex":0.00013778979,"about_ca_topic_score_gemma":0.000071768714,"teacher_disagreement_score":0.88300455,"about_ca_system_score_codex":0.00037389982,"about_ca_system_score_gemma":0.00032357126,"threshold_uncertainty_score":0.9998792},"labels":[],"label_agreement":null},{"id":"W1491103366","doi":"","title":"Fixing races for fun and profit: how to use access(2)","year":2004,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Executor; Computer science; Probabilistic logic; Computer security; Artificial intelligence; Economics; Finance","score_opus":0.08609299613582785,"score_gpt":0.3199793802399711,"score_spread":0.23388638410414322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491103366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1510815,0.000020488811,0.83705324,0.011173724,0.00016139398,0.00022384149,6.667368e-7,0.00012329876,0.00016186853],"genre_scores_gemma":[0.7645288,0.0000027099807,0.23400328,0.0011815781,0.000050392377,0.000020695672,4.5441837e-7,0.0000030686813,0.0002089829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994069,0.000008948332,0.00008183389,0.0002674533,0.0000857479,0.0001491149],"domain_scores_gemma":[0.9994618,0.00014722068,0.000033309145,0.00022184783,0.00006763544,0.00006816986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015285406,0.00006462931,0.00006800122,0.000056336292,0.00016300814,0.0009894914,0.00043947468,0.000026234453,0.0000022320837],"category_scores_gemma":[0.0001197828,0.000055829943,0.000019260364,0.00018875331,0.000011640711,0.0010119779,0.00022062098,0.000035589892,0.0000049774344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013338753,0.000045385816,0.008626476,0.00008441376,0.00002065588,0.000002874083,0.005067766,0.0010504996,0.0016091545,0.8993966,0.0039775213,0.08010529],"study_design_scores_gemma":[0.0046284283,0.0008413198,0.11977965,0.00038775554,0.00002875703,0.00009433704,0.0009390342,0.28071445,0.23377912,0.09948916,0.2569409,0.0023770942],"about_ca_topic_score_codex":0.00003201308,"about_ca_topic_score_gemma":0.000012673812,"teacher_disagreement_score":0.79990745,"about_ca_system_score_codex":0.000015972826,"about_ca_system_score_gemma":0.000028745018,"threshold_uncertainty_score":0.95416886},"labels":[],"label_agreement":null},{"id":"W1497142724","doi":"10.1007/11554578_5","title":"Formal Methods for Smartcard Security","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Ottawa","funders":"","keywords":"Smart card; Computer security; Flexibility (engineering); Computer science; Java Card; Interoperability; Confidentiality; Reliability (semiconductor); Operating system; Embedded system; Java; Java applet","score_opus":0.03230149285297806,"score_gpt":0.32626442338569583,"score_spread":0.29396293053271777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497142724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000014490178,0.000748932,0.9896624,0.0012036694,0.003132754,0.00066542317,0.000006824586,0.00028814134,0.004277366],"genre_scores_gemma":[0.015399184,0.000038802948,0.9810588,0.0018874893,0.0013595826,0.000028038658,0.000007728063,0.000034766384,0.00018565338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580246,0.000071415336,0.00074555154,0.0017494161,0.0006477092,0.000983431],"domain_scores_gemma":[0.99582636,0.0014652432,0.00041094288,0.0016560279,0.00042257595,0.00021885232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003165153,0.000562843,0.0006223643,0.00072931696,0.00056176964,0.00071472,0.0043189097,0.0004526727,0.000021978356],"category_scores_gemma":[0.00022493015,0.00056472514,0.00028666764,0.00056179636,0.0005019623,0.0011145276,0.0015586356,0.00086779095,0.000029704712],"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.000004977261,0.000020059335,0.0000050303834,0.000040463237,0.000009778041,0.0000035711146,0.0009593831,0.0045623276,0.000037663023,0.1296011,0.000039620114,0.864716],"study_design_scores_gemma":[0.00024822602,0.000103433646,0.000015094014,0.000118693584,0.0000074609206,0.000044883425,1.4915122e-7,0.6741783,0.0017838293,0.27909866,0.043833863,0.0005673981],"about_ca_topic_score_codex":0.000007811744,"about_ca_topic_score_gemma":0.000020886066,"teacher_disagreement_score":0.8641486,"about_ca_system_score_codex":0.0003663543,"about_ca_system_score_gemma":0.00060634874,"threshold_uncertainty_score":0.9996804},"labels":[],"label_agreement":null},{"id":"W1506076603","doi":"","title":"Proceedings of the 2004 ACM workshop on Formal methods in security engineering","year":2004,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":16,"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; Formal methods; Security engineering; Software engineering; Software security assurance; Formal verification; Unified Modeling Language; Computer security; Security service; Software; Information security; Programming language","score_opus":0.02840164171959598,"score_gpt":0.3102207334582723,"score_spread":0.2818190917386763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506076603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29515773,0.000045342633,0.6976723,0.0020330064,0.00038994153,0.00018704026,2.0379142e-7,0.00013125096,0.0043831384],"genre_scores_gemma":[0.7197431,0.0000021384517,0.28005648,0.00015297366,0.000024892315,0.0000045123024,4.5278792e-8,0.0000028616323,0.000013051016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926263,0.00000905534,0.0002038982,0.00018204474,0.00015265786,0.00018970546],"domain_scores_gemma":[0.99943674,0.0001267182,0.000065659005,0.00029294493,0.000049081198,0.000028841601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000622202,0.000076974335,0.000092836235,0.00007709429,0.000051851148,0.000050779894,0.0011303965,0.000051999377,0.0000035022435],"category_scores_gemma":[0.00029496907,0.000057662866,0.000046928086,0.0006861886,0.000017085818,0.0003432922,0.00035953044,0.00020362357,0.0000024839567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032877283,0.00008089612,0.00053646765,0.00003235243,0.000004780772,3.200042e-7,0.0044585997,0.011598488,0.001414242,0.97263724,0.00007055119,0.009162782],"study_design_scores_gemma":[0.0017468128,0.00011915158,0.03997004,0.00073725614,0.0000069790426,0.00003449875,0.0007750048,0.47835588,0.3318904,0.14192152,0.0037509885,0.0006914801],"about_ca_topic_score_codex":0.000015490552,"about_ca_topic_score_gemma":0.0000026399164,"teacher_disagreement_score":0.8307157,"about_ca_system_score_codex":0.000057913418,"about_ca_system_score_gemma":0.00003297537,"threshold_uncertainty_score":0.23514235},"labels":[],"label_agreement":null},{"id":"W1528987358","doi":"10.1007/11555223_16","title":"Environmentally-Aware Security Enforcement (EASE) for Cooperative Design and Engineering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"National Research Council Canada","funders":"","keywords":"Computer science; Context (archaeology); Enforcement; Computer security; Domain (mathematical analysis); Security engineering; Security policy; Software security assurance; Work (physics); Usability; Information security; Security service; Software engineering; Engineering management; Human–computer interaction; Engineering","score_opus":0.018422593034678296,"score_gpt":0.23403320333929944,"score_spread":0.21561061030462114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528987358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00005810367,0.000476668,0.99724,0.00035857252,0.00063757534,0.0008932079,0.000007698006,0.00012207899,0.00020611171],"genre_scores_gemma":[0.3054074,0.00008157529,0.6928375,0.0009977533,0.00049549993,0.00004577313,0.00001017152,0.000033596003,0.00009070985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971669,0.000027127604,0.00045258738,0.0013016111,0.00052770704,0.00052410475],"domain_scores_gemma":[0.9980232,0.0007770513,0.000197053,0.0007235244,0.00010571761,0.00017346996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087456807,0.00046436544,0.00038674814,0.00036257124,0.0003431447,0.00048389914,0.001507468,0.00023097497,0.000022906604],"category_scores_gemma":[0.00005680034,0.00047414465,0.00008050581,0.00020618249,0.0003049302,0.00051248964,0.0008186765,0.0004620652,0.000009487894],"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.000015339358,0.000057913032,0.000009287925,0.0001085521,0.00003451726,0.000019256173,0.004428148,0.4996668,0.00024609023,0.13065656,0.00004673435,0.3647108],"study_design_scores_gemma":[0.00031584865,0.00016911067,0.000011313,0.00018142485,0.00000720279,0.00003158409,5.316786e-7,0.97852963,0.0022768483,0.013988745,0.003953379,0.0005343689],"about_ca_topic_score_codex":0.000005529284,"about_ca_topic_score_gemma":0.0000043942323,"teacher_disagreement_score":0.47886285,"about_ca_system_score_codex":0.00036955118,"about_ca_system_score_gemma":0.00022902108,"threshold_uncertainty_score":0.999771},"labels":[],"label_agreement":null},{"id":"W1535846614","doi":"10.1007/978-3-540-79980-1_28","title":"A Hybrid Approach for Safe Memory Management in C","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Instrumentation (computer programming); Compiler; C dynamic memory allocation; Static analysis; Memory management; Memory safety; Code (set theory); Memory address; Programming language; Memory protection; Operating system; Undecidable problem; Dynamic program analysis; Compile time; Embedded system; Virtual memory; Program analysis; Semiconductor memory; Algorithm; Decidability","score_opus":0.029723826577956667,"score_gpt":0.2508437584516531,"score_spread":0.2211199318736964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535846614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00004136896,0.0005413494,0.98190325,0.00032269614,0.001202168,0.0009949829,0.0000038659496,0.00014013243,0.014850199],"genre_scores_gemma":[0.043707106,0.00013713191,0.9538138,0.0014047711,0.0003938811,0.00006297044,0.00001276016,0.000032762313,0.00043484013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587774,0.00003497447,0.00066562695,0.0018879371,0.000806675,0.00072701735],"domain_scores_gemma":[0.99757713,0.0003978583,0.00027838562,0.0014651767,0.00015269987,0.00012877017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010921893,0.00047925487,0.0005110537,0.0011594075,0.00031185502,0.000324788,0.0038884378,0.00019741422,0.000005891695],"category_scores_gemma":[0.00004464185,0.0004961004,0.00015910898,0.0005736148,0.00044027957,0.00043030173,0.0012249964,0.00063001394,0.000016785207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010574199,0.00008727984,0.000009896023,0.00014226517,0.00001640447,0.00010357723,0.0013295152,0.0869715,0.0000074421328,0.04007939,0.00021488537,0.8710273],"study_design_scores_gemma":[0.0005166443,0.000073894924,0.00006241655,0.00018164395,0.0000048687293,0.000116895746,4.2631456e-7,0.94019395,0.00033878873,0.05276735,0.0051032784,0.0006398326],"about_ca_topic_score_codex":0.000012146723,"about_ca_topic_score_gemma":0.0000060320135,"teacher_disagreement_score":0.87038743,"about_ca_system_score_codex":0.00039605016,"about_ca_system_score_gemma":0.00029010535,"threshold_uncertainty_score":0.99974906},"labels":[],"label_agreement":null},{"id":"W154417217","doi":"","title":"Incremental horizontal fragmentation of database class objects","year":2003,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Fragmentation (computing); Class hierarchy; Class (philosophy); Schema (genetic algorithms); Database; Database schema; Data structure; Distributed database; Object-oriented programming; Theoretical computer science; Programming language; Database design; Artificial intelligence; Information retrieval","score_opus":0.021995860409859184,"score_gpt":0.2625073428258644,"score_spread":0.24051148241600523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154417217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30736437,0.000038693408,0.6665263,0.00006375042,0.00039105132,0.000098430406,0.0000020361042,0.00007836567,0.025436955],"genre_scores_gemma":[0.90642995,0.0000037453424,0.093365066,0.0001494871,0.000015994829,0.0000028678926,0.000005002069,0.0000023434613,0.000025560486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925613,0.00006267198,0.00018226306,0.00019021353,0.00019810806,0.00011059479],"domain_scores_gemma":[0.99949324,0.00005870408,0.00007514134,0.00029105847,0.00004249616,0.000039354654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026153322,0.000059475642,0.00006731046,0.000056495883,0.000069594156,0.000038039892,0.0002789958,0.00002303557,0.000073178555],"category_scores_gemma":[0.000038056332,0.000059620656,0.000026472737,0.00023894793,0.000021609843,0.00038649485,0.00006989221,0.000052709893,0.0000262586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024784279,0.00011240934,0.0013571908,0.000015609996,0.000010466147,0.0000019474255,0.0008520067,0.000026724938,0.029292054,0.96336365,0.0007474721,0.004217977],"study_design_scores_gemma":[0.0011090946,0.00020745918,0.0025217058,0.00003439951,0.00000788449,0.000033657278,0.0014105117,0.053094234,0.93318206,0.0039261626,0.0041307593,0.0003420562],"about_ca_topic_score_codex":0.00004338793,"about_ca_topic_score_gemma":0.000009027453,"teacher_disagreement_score":0.9594375,"about_ca_system_score_codex":0.000028989802,"about_ca_system_score_gemma":0.00004751688,"threshold_uncertainty_score":0.24312598},"labels":[],"label_agreement":null},{"id":"W1546317334","doi":"","title":"Hypervisor support for identifying covertly executing binaries","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":202,"is_retracted":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":"Rootkit; Hypervisor; Computer science; Malware; Operating system; Executable; Code (set theory); Kernel (algebra); Source code; System call; Linux kernel; Semantic gap; Embedded system; Virtualization; Programming language; Cloud computing","score_opus":0.10859370342583005,"score_gpt":0.304664452298402,"score_spread":0.19607074887257195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546317334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032151934,0.000054588585,0.96089566,0.00057939976,0.0005774695,0.00014835915,0.000001054063,0.00033621734,0.0052553085],"genre_scores_gemma":[0.8036046,0.000011597924,0.1940212,0.0008905528,0.000102549224,0.000016967866,0.0000037103189,0.0000071762856,0.0013416663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.000019507132,0.00023834562,0.00031597845,0.00014493898,0.00026026845],"domain_scores_gemma":[0.9991847,0.00021708473,0.00008071431,0.00034944998,0.000111070476,0.000056964218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027159866,0.00009359869,0.0001172716,0.00007242574,0.00060429034,0.00015632481,0.0006281845,0.000043427102,0.000031702875],"category_scores_gemma":[0.000098171746,0.00009293264,0.000074951386,0.00024454005,0.000042183565,0.0005325712,0.00017699898,0.00006482463,0.00006657071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001373811,0.00013995713,0.0049056127,0.00010244334,0.00003725923,0.000025093334,0.009507615,0.00019863022,0.002895665,0.9330353,0.02948134,0.019657342],"study_design_scores_gemma":[0.0018952151,0.00034532644,0.009504105,0.00006330006,0.000017534596,0.00063900574,0.00095041224,0.7088323,0.05357294,0.027781563,0.1951776,0.0012206682],"about_ca_topic_score_codex":0.0000232769,"about_ca_topic_score_gemma":0.0000016330354,"teacher_disagreement_score":0.90525377,"about_ca_system_score_codex":0.00002220946,"about_ca_system_score_gemma":0.00008464027,"threshold_uncertainty_score":0.46477738},"labels":[],"label_agreement":null},{"id":"W162339537","doi":"10.1007/978-3-642-22863-6_18","title":"Formalization of Entropy Measures in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":42,"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; HOL; Theoretical computer science; Information theory; Entropy (arrow of time); Automated theorem proving; Cryptography; Algorithm; Mathematics; Programming language","score_opus":0.033813773591470406,"score_gpt":0.2476253939191147,"score_spread":0.21381162032764428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162339537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023879996,0.00037985187,0.99470013,0.00013246114,0.0010717985,0.00027406611,0.0000016508914,0.00007510301,0.0031261058],"genre_scores_gemma":[0.7881124,0.00009520625,0.2110998,0.0004157545,0.00018972928,0.0000063346097,0.0000037936115,0.000020614094,0.00005637113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971242,0.000044800505,0.00069707754,0.0009339935,0.00077162276,0.0004283239],"domain_scores_gemma":[0.99790853,0.00023413468,0.0004348558,0.0010525079,0.0002866892,0.000083256666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011000056,0.0003152917,0.00041833945,0.0010287232,0.00010801876,0.00015531623,0.0027185844,0.0002615404,0.00001886572],"category_scores_gemma":[0.000114845614,0.0003127799,0.000092922855,0.0007533236,0.00039876203,0.00061450107,0.00070698536,0.00048259433,0.0000140650445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009810963,0.000065457476,0.00062190933,0.00007808512,0.000008502286,0.000021574751,0.004718386,0.020239074,0.00032143015,0.37018734,0.000010991969,0.60371745],"study_design_scores_gemma":[0.0003643595,0.0001673438,0.0009204415,0.00068625243,0.0000058970663,0.000036664198,3.9413888e-7,0.5917637,0.011734746,0.39220744,0.0014371088,0.00067567616],"about_ca_topic_score_codex":0.00005454451,"about_ca_topic_score_gemma":0.000062976906,"teacher_disagreement_score":0.7878736,"about_ca_system_score_codex":0.00017664648,"about_ca_system_score_gemma":0.00038493483,"threshold_uncertainty_score":0.9999324},"labels":[],"label_agreement":null},{"id":"W164606597","doi":"","title":"patch (1) considered harmful","year":2005,"lang":"en","type":"article","venue":"Workshop on Hot Topics in Operating Systems","topic":"Security and Verification in Computing","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 Victoria","funders":"","keywords":"Computer science; Kernel (algebra); Correctness; Programming language; Syntax; Semantics (computer science); Abstraction; Linux kernel; Simple (philosophy); Domain (mathematical analysis); Source code; Theoretical computer science; Software engineering; Operating system; Artificial intelligence","score_opus":0.050073055833842695,"score_gpt":0.30201999615444036,"score_spread":0.25194694032059767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164606597","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.45574236,0.0023069314,0.4552662,0.021994088,0.00987893,0.0016169848,0.000004542454,0.0011612804,0.052028652],"genre_scores_gemma":[0.9733783,0.00001927711,0.02358616,0.000989061,0.00078668713,0.000038775455,0.0000019948006,0.000010734014,0.0011890072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823284,0.00019557361,0.0005204904,0.0004631991,0.00027918318,0.0003087207],"domain_scores_gemma":[0.9987265,0.00032265915,0.000108514054,0.0006882257,0.00008458188,0.00006955584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006957702,0.00015944018,0.00022217428,0.000114983784,0.00021056872,0.0005649145,0.0006902261,0.00012354589,0.000014727139],"category_scores_gemma":[0.00021771502,0.00015817148,0.00004195336,0.00037157512,0.000025543572,0.00026164725,0.0001281332,0.00035547337,0.00009083203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008181677,0.00027234296,0.0064944094,0.000084155574,0.000028354949,0.000048088794,0.013035681,0.123154484,0.00025970224,0.712399,0.007194165,0.1370214],"study_design_scores_gemma":[0.00060349255,0.000039323495,0.00082183775,0.0005034911,0.0000019500824,0.00003805061,0.00071465544,0.9124498,0.00059356634,0.00023111886,0.08357846,0.0004242778],"about_ca_topic_score_codex":0.00006516549,"about_ca_topic_score_gemma":0.00006010127,"teacher_disagreement_score":0.7892953,"about_ca_system_score_codex":0.00013188561,"about_ca_system_score_gemma":0.0000665769,"threshold_uncertainty_score":0.6450046},"labels":[],"label_agreement":null},{"id":"W1652322318","doi":"10.1007/978-3-642-01187-0_22","title":"Verification of Information Flow in Agent-Based Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Security and Verification in Computing","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":"McMaster University","funders":"","keywords":"Computer science; Information flow; Atomicity; Theoretical computer science; Granularity; Satisfiability; Information system; Information exchange; Programming language; Database transaction","score_opus":0.015947480667829025,"score_gpt":0.2299055526597648,"score_spread":0.21395807199193578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1652322318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005558917,0.0004272673,0.9868854,0.0004526598,0.0004866875,0.00047426566,0.000009063566,0.00013910847,0.011069915],"genre_scores_gemma":[0.9201361,0.00012222758,0.07718631,0.0013133223,0.00015853843,0.00005473702,0.0009293908,0.000028133674,0.000071268434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735636,0.00003201397,0.0015458781,0.0002258383,0.000591627,0.0002483073],"domain_scores_gemma":[0.99692816,0.00012545566,0.0015158799,0.00052056793,0.0008708328,0.000039091858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005996409,0.00033325073,0.00042351588,0.001457011,0.00010747971,0.0005183353,0.0007333163,0.0005064493,0.00000819545],"category_scores_gemma":[0.00031851552,0.00035415922,0.00005691847,0.00089887367,0.000054174656,0.0047896416,0.00006541786,0.00044309365,0.000029304812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017332233,0.000015607417,0.000027035421,0.0011483775,0.000003164212,7.227516e-7,0.0017042644,0.31156164,0.000005496951,0.01432635,0.000010281219,0.6711797],"study_design_scores_gemma":[0.00059862726,0.000019626983,0.0008766224,0.0022104252,0.000008055644,0.0000064416854,0.000014309829,0.9678265,0.00030479414,0.0052050897,0.022479428,0.00045007808],"about_ca_topic_score_codex":0.000033929853,"about_ca_topic_score_gemma":0.000008992812,"teacher_disagreement_score":0.9200805,"about_ca_system_score_codex":0.00030499572,"about_ca_system_score_gemma":0.0005307712,"threshold_uncertainty_score":0.99989104},"labels":[],"label_agreement":null},{"id":"W173970821","doi":"10.1007/978-3-319-05302-8_6","title":"Enforcing Information Flow by Combining Static and Dynamic Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Information flow; Static analysis; Flow (mathematics); Programming language; Mathematics","score_opus":0.007448577174651696,"score_gpt":0.22870924163757742,"score_spread":0.22126066446292572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173970821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002076957,0.00018735586,0.99744993,0.00044359028,0.0006321309,0.0001996982,0.0000064805095,0.00015131022,0.0007217819],"genre_scores_gemma":[0.5959504,0.000046027355,0.40198007,0.0018308628,0.00006323078,0.000005514873,0.00004580252,0.000014330776,0.00006374024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724203,0.00004295773,0.0006562682,0.00084464013,0.0007530585,0.00046103887],"domain_scores_gemma":[0.9975998,0.0006561944,0.00046134903,0.00092895096,0.0002037314,0.00014998943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011947149,0.00037968828,0.0005138818,0.0012710657,0.00039149792,0.0011282437,0.0017058968,0.00021879497,0.00001051535],"category_scores_gemma":[0.000108996675,0.00038518378,0.0001034559,0.0010870483,0.00035271695,0.001063666,0.0007804648,0.00057285535,0.00002094141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020122322,0.0000067167302,0.000059277896,0.00006063166,0.000047373353,0.0000027894362,0.0027299272,0.1142709,0.000018240415,0.015302851,0.00002408117,0.8674752],"study_design_scores_gemma":[0.00017027954,0.000056203764,0.00007885586,0.00012569044,0.00003192684,0.000012686076,5.836934e-7,0.9744171,0.00008504871,0.023021793,0.0015843258,0.00041550095],"about_ca_topic_score_codex":0.000028780049,"about_ca_topic_score_gemma":0.000024455618,"teacher_disagreement_score":0.8670597,"about_ca_system_score_codex":0.0002100603,"about_ca_system_score_gemma":0.00018161377,"threshold_uncertainty_score":0.9999087},"labels":[],"label_agreement":null},{"id":"W17764271","doi":"10.1063/1.2759489","title":"Enforcing Security Policies on Programs","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Security and Verification in Computing","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 en Outaouais; Université Laval","funders":"","keywords":"Computer science; Automaton; Rewriting; Property (philosophy); Symbolic execution; Security policy; Programming language; Enforcement; Program analysis; Embedding; Theoretical computer science; Operator (biology); Computer security; Software","score_opus":0.14403330641402298,"score_gpt":0.3692185812553757,"score_spread":0.22518527484135273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17764271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.009112495,0.0004948917,0.9815059,0.00096418615,0.00018989171,0.00018222854,0.000004603443,0.002564235,0.0049816137],"genre_scores_gemma":[0.10131278,0.00006145131,0.89793515,0.00028965904,0.0001628098,0.00003914733,0.000014634855,0.00001135286,0.00017303477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981798,0.00028550345,0.00039125033,0.0005373712,0.00021388367,0.0003921819],"domain_scores_gemma":[0.9981115,0.0010981801,0.00015184542,0.0005373076,0.00004210257,0.000059096918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167874,0.00022920771,0.00031332034,0.0003614647,0.00015047836,0.0003594557,0.00067477324,0.00020045966,0.000006932264],"category_scores_gemma":[0.00043758607,0.00020652261,0.000075978074,0.00079529715,0.000099576755,0.00041336316,0.0003269284,0.00033525508,0.0000012406407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006160132,0.000033475353,0.0035146757,0.000010820059,0.0000029078876,0.0000050746207,0.00039276876,0.000007612575,0.000050129554,0.1451068,0.0012990462,0.8495705],"study_design_scores_gemma":[0.00052255346,0.0006502653,0.0380887,0.00024966124,0.000010606576,0.0000612253,0.000112555004,0.0007777862,0.043612655,0.81911504,0.09588951,0.0009094507],"about_ca_topic_score_codex":0.0011338104,"about_ca_topic_score_gemma":0.00007377227,"teacher_disagreement_score":0.84866107,"about_ca_system_score_codex":0.000071554714,"about_ca_system_score_gemma":0.000040260154,"threshold_uncertainty_score":0.84217477},"labels":[],"label_agreement":null},{"id":"W1831986252","doi":"","title":"Proof linking: distributed verification of java classfiles in the presence of multiple classloaders","year":2001,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"","keywords":"Computer science; Bytecode; Java; Programming language; Runtime verification; Software verification; Functional verification; Java bytecode; Formal verification; Interoperability; Java applet; Operating system; Java annotation; Software; Software development","score_opus":0.04170994106970853,"score_gpt":0.26940233696159843,"score_spread":0.2276923958918899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831986252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17764826,0.00006673773,0.8190683,0.0015211735,0.00010822427,0.0002693968,0.0000034842749,0.000041577663,0.0012728084],"genre_scores_gemma":[0.99102104,0.000016300988,0.00884823,0.000057240355,0.000018434273,0.000012188113,0.000010328692,0.0000023509683,0.0000139038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988529,0.00013147046,0.00037665004,0.00021955825,0.00027619567,0.00014319381],"domain_scores_gemma":[0.99855727,0.0005262103,0.0002054106,0.00056550256,0.00012585295,0.000019728937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005665937,0.00007253282,0.000115114584,0.00007601034,0.000051185398,0.00003434471,0.001071538,0.000057233476,0.0000063989824],"category_scores_gemma":[0.00022406079,0.00005544096,0.00004077641,0.0008068807,0.00008772693,0.00022722674,0.00008111379,0.00011439407,0.0000024300166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000849637,0.0016871012,0.24225463,0.0002847362,0.00004690283,0.000008634304,0.028634084,0.014979411,0.028580695,0.6179211,0.002935248,0.062582485],"study_design_scores_gemma":[0.00050070416,0.00007855266,0.095707715,0.000088967354,0.0000039648135,0.000009958499,0.0012772831,0.8550729,0.037979428,0.0035867721,0.0055352515,0.00015850872],"about_ca_topic_score_codex":0.000086755375,"about_ca_topic_score_gemma":0.000030058327,"teacher_disagreement_score":0.8400935,"about_ca_system_score_codex":0.00001665842,"about_ca_system_score_gemma":0.000050515348,"threshold_uncertainty_score":0.22608168},"labels":[],"label_agreement":null},{"id":"W1864670858","doi":"10.1007/978-0-85729-277-3_12","title":"Set Theory and Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Security and Verification in Computing","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":"Computer science; Foundation (evidence); Set (abstract data type); Programming language; Theoretical computer science; Software engineering; History","score_opus":0.04097215514153162,"score_gpt":0.26733906994294115,"score_spread":0.22636691480140952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864670858","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0001762548,0.00046038337,0.8691598,0.0001803427,0.0010530603,0.00019988278,0.0000027302024,0.00020139209,0.12856612],"genre_scores_gemma":[0.39004388,0.00037996817,0.50324667,0.0030065898,0.0009784801,0.00002942863,0.000010643483,0.00010023997,0.10220409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755913,0.000058314185,0.00043205486,0.0011013933,0.00047329505,0.00037578892],"domain_scores_gemma":[0.9978906,0.00041126172,0.00023660962,0.0011635625,0.00014261747,0.00015535257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022178183,0.0002826207,0.00026891878,0.0006421705,0.00036944382,0.0003612551,0.0023996015,0.00018305349,0.000073160525],"category_scores_gemma":[0.000046059522,0.00028989546,0.000054133823,0.00033365973,0.00081857987,0.0007902846,0.0015348125,0.0005040419,0.00019853837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013792263,0.0000071099494,0.000023794957,0.000007754422,0.0000033232434,0.000010718249,0.0024621186,0.00004109425,0.0000019963197,0.8922943,0.00024598368,0.10490042],"study_design_scores_gemma":[0.00016242072,0.00006401144,0.0009800823,0.00022410644,0.000005355998,0.000081603546,0.0000030405045,0.06160652,0.000029323915,0.91662145,0.019705135,0.0005169369],"about_ca_topic_score_codex":0.000007508498,"about_ca_topic_score_gemma":0.0000049710056,"teacher_disagreement_score":0.38986763,"about_ca_system_score_codex":0.000109694316,"about_ca_system_score_gemma":0.0003194127,"threshold_uncertainty_score":0.9999553},"labels":[],"label_agreement":null},{"id":"W1866373754","doi":"10.1109/cds.1998.675770","title":"Using meta-interfaces to support secure dynamic system reconfiguration","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Victoria","funders":"University of Victoria","keywords":"Computer science; Control reconfiguration; Architecture; Distributed computing; Embedded system; Systems design; Service (business); Software engineering","score_opus":0.16453549789843222,"score_gpt":0.314163197107271,"score_spread":0.14962769920883875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866373754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01658637,0.00007339694,0.9700991,0.0009399521,0.0005823604,0.00016035419,0.000001363936,0.00036950386,0.011187623],"genre_scores_gemma":[0.91515917,0.0000015898086,0.08367742,0.00032755698,0.000033552747,0.000007790098,9.332565e-7,0.00000550936,0.0007864585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989294,0.00006432697,0.00027928245,0.00035321157,0.00018602984,0.0001877538],"domain_scores_gemma":[0.99926716,0.000046524387,0.00008854053,0.00042775148,0.00008977962,0.000080265934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002696917,0.00011362325,0.00017056086,0.00010631944,0.00015901081,0.00027153696,0.00054278213,0.00004840181,0.00036649467],"category_scores_gemma":[0.000015967953,0.00009955447,0.00006951737,0.00034492437,0.000009096867,0.00043365118,0.00008831029,0.00007372708,0.00041614825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008497127,0.0002264614,0.00009796381,0.00029018024,0.000826759,0.000043248885,0.019023374,0.018922443,0.01906168,0.83078015,0.0153863635,0.09533288],"study_design_scores_gemma":[0.00005713265,0.000043398937,0.00001756257,0.000012049467,0.00003055657,0.000059020622,0.00016890127,0.99259883,0.0042788885,0.00007172176,0.0025189638,0.0001429954],"about_ca_topic_score_codex":0.000025398638,"about_ca_topic_score_gemma":0.000012941164,"teacher_disagreement_score":0.9736764,"about_ca_system_score_codex":0.00008704438,"about_ca_system_score_gemma":0.000013596356,"threshold_uncertainty_score":0.53488827},"labels":[],"label_agreement":null},{"id":"W1870633701","doi":"10.1007/978-3-642-14706-7_11","title":"Using Equivalence Relations for Corrective Enforcement of Security Policies","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Enforcement; Computer science; Equivalence (formal languages); Security policy; Computer security; A priori and a posteriori; Field (mathematics); Theoretical computer science; Discrete mathematics; Mathematics; Law; Political science","score_opus":0.04954532813948358,"score_gpt":0.3139285724215557,"score_spread":0.2643832442820721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870633701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00039270666,0.00015898535,0.9937707,0.0002058402,0.0025031136,0.0006307127,0.000021131336,0.00009093678,0.0022258498],"genre_scores_gemma":[0.49668312,0.000011595158,0.50263083,0.00027183228,0.00032253854,0.0000101353435,0.0000051099473,0.000018810479,0.000046008525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997014,0.000028592978,0.00068669394,0.0010477591,0.00070991076,0.0005130652],"domain_scores_gemma":[0.99636555,0.0010676062,0.0006440036,0.0011553981,0.00065117114,0.00011626652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010526965,0.00037441638,0.0004655434,0.0007180021,0.00046770353,0.00023189347,0.0025226707,0.00035351666,0.000027669403],"category_scores_gemma":[0.00026302523,0.00038574706,0.00017467058,0.0005821479,0.00087336154,0.00052014424,0.0009582041,0.0007539595,0.000004686621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014686109,0.000080615566,0.00012616989,0.00015694795,0.000030824056,0.000004538096,0.012674657,0.08170871,0.0019856964,0.7928109,0.000013883329,0.11039234],"study_design_scores_gemma":[0.00015883471,0.00009878359,0.000024097975,0.00025636866,0.00000968482,0.00002014628,0.0000011168325,0.65282845,0.0073977206,0.33814982,0.00071645365,0.0003385085],"about_ca_topic_score_codex":0.0001047615,"about_ca_topic_score_gemma":0.00006067335,"teacher_disagreement_score":0.5711198,"about_ca_system_score_codex":0.00029454014,"about_ca_system_score_gemma":0.00080886704,"threshold_uncertainty_score":0.99985945},"labels":[],"label_agreement":null},{"id":"W1878475345","doi":"10.1007/978-3-642-40196-1_16","title":"SAT-Based Analysis and Quantification of Information Flow in Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":46,"is_retracted":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; Information flow; Data-flow analysis; Data flow diagram; Database","score_opus":0.019598351513946476,"score_gpt":0.24359867699794685,"score_spread":0.22400032548400037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878475345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010731362,0.00010855728,0.99742645,0.00033609505,0.0003086232,0.00038270612,0.0000024443314,0.00006324279,0.00029877113],"genre_scores_gemma":[0.5496694,0.000010886999,0.4500287,0.00020772363,0.00003246188,0.0000103498,0.000027782231,0.000005277323,0.0000074223276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767053,0.000039716124,0.0007201781,0.0006674692,0.0006090784,0.00029300337],"domain_scores_gemma":[0.9979046,0.0003059406,0.0004972807,0.0009000838,0.00031452443,0.00007754963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009981518,0.00025642014,0.00041529883,0.0019563984,0.000100442805,0.00046649855,0.0013466553,0.00022133261,0.000009273207],"category_scores_gemma":[0.00008065029,0.00025102604,0.00009099822,0.0019360165,0.00038353275,0.0009834777,0.00031427474,0.00035694393,0.000015862464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025122913,0.0000254777,0.0010793689,0.00006450499,0.000013324289,0.0000010743697,0.0009706878,0.08632438,0.000025285644,0.012939807,0.0000015255503,0.89855206],"study_design_scores_gemma":[0.00015650233,0.00005330153,0.0041289083,0.00015758866,0.000013743744,0.0000022813404,3.8897312e-7,0.9791892,0.00060636736,0.015224379,0.00021452861,0.00025276715],"about_ca_topic_score_codex":0.000109226334,"about_ca_topic_score_gemma":0.000114891904,"teacher_disagreement_score":0.8982993,"about_ca_system_score_codex":0.00012256115,"about_ca_system_score_gemma":0.00025980643,"threshold_uncertainty_score":0.9999942},"labels":[],"label_agreement":null},{"id":"W1885675146","doi":"10.1007/11602897_11","title":"Admissible Interference by Typing for Cryptographic Protocols","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Correctness; Computer science; Cryptography; Interference (communication); Type (biology); Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Process (computing); Information flow; Algorithm; Programming language; Computer network; Channel (broadcasting)","score_opus":0.038866297352664746,"score_gpt":0.3025482220994188,"score_spread":0.26368192474675406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885675146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000010124699,0.00040440957,0.99074847,0.0010325571,0.0008411405,0.004796396,0.00000958248,0.00027944843,0.0018778841],"genre_scores_gemma":[0.034275126,0.000044302033,0.9598909,0.00278289,0.0010785558,0.0013221089,0.000013749191,0.00006753331,0.00052485097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960485,0.00003365858,0.0007247434,0.0018242334,0.0005838776,0.0007849711],"domain_scores_gemma":[0.9967977,0.00064360775,0.00045278226,0.001486413,0.00038779364,0.0002317294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011046567,0.00055067684,0.00052648806,0.0007849322,0.00045009915,0.0009860967,0.0047593713,0.0003765059,0.000033919718],"category_scores_gemma":[0.00016365989,0.0005507862,0.00019079742,0.0007430705,0.00047669242,0.0007296804,0.0009679867,0.00078266114,0.000028956983],"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.000014450988,0.000064338856,0.000031940785,0.00015297596,0.000015167271,0.0000041201442,0.00072903204,0.0037155312,0.00043037286,0.084835105,0.0003703917,0.90963656],"study_design_scores_gemma":[0.0005269335,0.00035482753,0.000021755124,0.001513006,0.000007324246,0.00003896077,2.633997e-7,0.74660873,0.004030116,0.18805994,0.05772131,0.0011168562],"about_ca_topic_score_codex":0.0000070818446,"about_ca_topic_score_gemma":0.000016372342,"teacher_disagreement_score":0.90851974,"about_ca_system_score_codex":0.00024407817,"about_ca_system_score_gemma":0.00065367785,"threshold_uncertainty_score":0.99969435},"labels":[],"label_agreement":null},{"id":"W188710525","doi":"10.1007/978-3-319-08608-8_3","title":"OSSM: The OLAP Security Specification Model","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Online analytical processing; Computer science; Computer security model; Dimension (graph theory); Data model (GIS); Database; Data security; Security policy; Computer security; Domain (mathematical analysis); Data mining; Data warehouse; Encryption","score_opus":0.028011354656234885,"score_gpt":0.2529050565961058,"score_spread":0.2248937019398709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188710525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006155923,0.0003012911,0.9862323,0.0028164056,0.0017605512,0.0003962731,0.0000031213392,0.00024164977,0.0081868945],"genre_scores_gemma":[0.71723586,0.00007770588,0.27648628,0.0041620014,0.0014251233,0.000019074027,0.000010591152,0.00004777453,0.0005356118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958377,0.00007487145,0.0006564386,0.0016459607,0.001163231,0.00062180124],"domain_scores_gemma":[0.99594694,0.0007365862,0.00046895596,0.002342959,0.00035486213,0.00014967094],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020415834,0.0004947309,0.00042027855,0.00045790154,0.00069122453,0.0009619279,0.005682825,0.00033756054,0.000016826085],"category_scores_gemma":[0.00012973575,0.00039565994,0.00016277345,0.0006637176,0.00082116656,0.0004347436,0.0013490099,0.001188843,0.00011747032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003606178,0.000025211175,0.000013602463,0.000032506992,0.000008745451,0.0000064282526,0.0027524058,0.104846224,0.000057266454,0.48573193,0.0002067629,0.40631533],"study_design_scores_gemma":[0.00008577934,0.000027433529,0.00002402776,0.00008442692,0.0000038543794,0.000025182106,1.7508484e-7,0.69233793,0.0004119518,0.303438,0.003224557,0.00033665966],"about_ca_topic_score_codex":0.000010315926,"about_ca_topic_score_gemma":0.000027729258,"teacher_disagreement_score":0.7171743,"about_ca_system_score_codex":0.0002978964,"about_ca_system_score_gemma":0.00050167635,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W1899118562","doi":"","title":"Computer meteorology: monitoring compute clouds","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Cloud computing; Virtualization; Computer science; Computer security; Leverage (statistics); Reputation; Cloud service provider; Service provider; Cloud computing security; Operating system; Business; Service (business)","score_opus":0.02991236084716319,"score_gpt":0.2795452425985635,"score_spread":0.2496328817514003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899118562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024258556,0.00008333911,0.96631306,0.0028140245,0.0015180345,0.0000755147,1.352255e-7,0.00071178976,0.004225517],"genre_scores_gemma":[0.63169974,0.0000054111288,0.36643562,0.0013326551,0.00046680545,0.0000011037575,5.378653e-7,0.0000028219715,0.000055281504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876297,0.000067481844,0.0002513379,0.00040919022,0.00020032472,0.00030868835],"domain_scores_gemma":[0.9990613,0.00011527168,0.0000725239,0.0005667554,0.000081941565,0.00010221353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003084491,0.00013507393,0.0001601401,0.00008884579,0.00019859054,0.00021151455,0.0010597119,0.00007492746,0.000011920879],"category_scores_gemma":[0.0000086820555,0.00012962057,0.00006955477,0.00036751828,0.000024632021,0.0003452925,0.00017464421,0.00016870147,0.00012774828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032464827,0.00009988791,0.001114122,0.000003891859,0.000017635111,0.000014650629,0.00071699056,0.0012850025,0.00053779036,0.6050076,0.0032986577,0.38790056],"study_design_scores_gemma":[0.0005278207,0.00031666414,0.04911178,0.000023431383,0.0000058635565,0.000081220045,0.00001555726,0.90177494,0.006436947,0.02366444,0.017573044,0.00046828386],"about_ca_topic_score_codex":0.000005929168,"about_ca_topic_score_gemma":1.776091e-7,"teacher_disagreement_score":0.9004899,"about_ca_system_score_codex":0.000030515648,"about_ca_system_score_gemma":0.000025942763,"threshold_uncertainty_score":0.5285773},"labels":[],"label_agreement":null},{"id":"W1913063272","doi":"10.1109/ideas.1999.787292","title":"Measuring the performance of database object horizontal fragmentation schemes","year":2003,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Fragmentation (computing); Distributed database; Schema (genetic algorithms); Horizontal and vertical; Database; Database schema; Object-based spatial database; Object (grammar); Distributed object; Database design; Spatial database; Information retrieval; Spatial analysis; Artificial intelligence; Geography; Programming language; Remote sensing","score_opus":0.03794618526332032,"score_gpt":0.2530719964010556,"score_spread":0.21512581113773527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913063272","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.68704164,0.00007641106,0.30894136,0.00006906146,0.00019337596,0.00006299575,3.0618415e-7,0.000042752923,0.0035720696],"genre_scores_gemma":[0.9599394,0.000014185949,0.039920136,0.000073064155,0.000017946562,0.00000403353,9.375517e-7,0.0000020131354,0.000028260361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993628,0.000052715182,0.00014666525,0.00014183183,0.0001965311,0.00009940066],"domain_scores_gemma":[0.9994384,0.00007570779,0.00006707674,0.00034652514,0.000053130105,0.000019139867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045187664,0.00005162983,0.000051109855,0.00003165749,0.00015234314,0.000045719607,0.00038588798,0.000014402394,0.0000218602],"category_scores_gemma":[0.000044933822,0.000037431397,0.000023018372,0.00023631177,0.000026104637,0.00038088975,0.000059856644,0.00006546888,0.0000141086775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057207385,0.00010398339,0.01252823,0.0000653029,0.000027157692,8.654594e-7,0.0025372012,0.0004951519,0.023062127,0.9363262,0.00032854543,0.02451952],"study_design_scores_gemma":[0.0003053792,0.00007524622,0.0039405315,0.000037546135,0.00000477629,0.000017921288,0.00037941465,0.19422889,0.7967489,0.0003161566,0.0037814234,0.00016381619],"about_ca_topic_score_codex":0.000013482476,"about_ca_topic_score_gemma":0.0000019380088,"teacher_disagreement_score":0.93601006,"about_ca_system_score_codex":0.000014625921,"about_ca_system_score_gemma":0.00004257843,"threshold_uncertainty_score":0.1526408},"labels":[],"label_agreement":null},{"id":"W1919735932","doi":"10.1109/tricom.1991.152879","title":"A communication protocol for a multi-level secure network","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Protocol (science); Context (archaeology); Cryptographic protocol; Communications protocol; Argument (complex analysis); Kernel (algebra); Computer security; Software; Computer security model; Theoretical computer science; Computer network; Cryptography; Programming language; Mathematics; Discrete mathematics","score_opus":0.2661555170408676,"score_gpt":0.3705606694862356,"score_spread":0.10440515244536802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919735932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000007637355,0.000011558617,0.9500739,0.0013118837,0.00005195309,0.045840666,6.769537e-7,0.00023137301,0.002470351],"genre_scores_gemma":[0.0065356484,8.08808e-7,0.8441987,0.00074477325,0.000083279745,0.1477236,0.0000013031365,0.000005829377,0.00070603145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925023,0.0000551462,0.00019456877,0.00021149273,0.00009720887,0.0001913435],"domain_scores_gemma":[0.9989749,0.00013529154,0.00009079585,0.00064718316,0.00010734265,0.00004449044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813196,0.00007808628,0.00007750704,0.00002567984,0.0002961009,0.00014491673,0.00087407354,0.000052325897,0.000066314016],"category_scores_gemma":[0.00003814503,0.00007228217,0.000047039768,0.00024609393,0.000020489628,0.00024163463,0.00015930415,0.000085623746,0.000052797695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006156817,0.00032101345,0.00018612508,0.000053535936,0.00001417583,3.5301048e-7,0.002355467,0.0006481311,0.00001786762,0.8103758,0.10781597,0.07820539],"study_design_scores_gemma":[0.00061181973,0.000025184729,0.00026607313,0.000021430704,7.595298e-7,0.0000031614243,0.000010392953,0.85184765,0.00007490516,0.002686493,0.14435577,0.00009635396],"about_ca_topic_score_codex":0.000005829529,"about_ca_topic_score_gemma":0.000009871176,"teacher_disagreement_score":0.8511995,"about_ca_system_score_codex":0.000019551188,"about_ca_system_score_gemma":0.000011475992,"threshold_uncertainty_score":0.29475814},"labels":[],"label_agreement":null},{"id":"W1922844761","doi":"10.3233/jcs-140502","title":"Modular protections against non-control data attacks","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Soundness; Memory safety; Separation logic; Compiler; Programming language; Pointer (user interface); Data type; Modular design; Artificial intelligence","score_opus":0.02096124297612106,"score_gpt":0.2637338178031622,"score_spread":0.24277257482704112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922844761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029599037,0.00008206379,0.9657651,0.0018234227,0.0021242658,0.00016480917,0.000003966809,0.00007560319,0.00036170188],"genre_scores_gemma":[0.8917044,0.000014192857,0.10547545,0.0010263327,0.0017609046,0.0000018604325,0.0000026928724,0.000009859708,0.0000043317773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977546,0.0002875782,0.0007397485,0.00040092063,0.0005205351,0.00029661783],"domain_scores_gemma":[0.9969336,0.00023991699,0.00067684054,0.0014937975,0.00045464776,0.00020124344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037348,0.00018734393,0.00037658203,0.00021622117,0.0002610116,0.0003755364,0.0034732267,0.00010332494,0.000004762317],"category_scores_gemma":[0.000109059336,0.00017238736,0.00015235622,0.00039783254,0.000051472347,0.00133165,0.0006268226,0.00060610374,0.000024300256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015715531,0.0030202032,0.0045982264,0.00046819288,0.0011480359,0.0002455293,0.012863333,0.08465616,0.0032266695,0.11230951,0.073794454,0.70351255],"study_design_scores_gemma":[0.00087389466,0.00017523296,0.0027759,0.0000690492,0.000013712716,0.00015665239,0.0000060509383,0.94925475,0.00016680994,0.0049625547,0.04135466,0.00019074156],"about_ca_topic_score_codex":0.0000064330575,"about_ca_topic_score_gemma":0.000002299177,"teacher_disagreement_score":0.8645986,"about_ca_system_score_codex":0.00005044054,"about_ca_system_score_gemma":0.00013449171,"threshold_uncertainty_score":0.7029752},"labels":[],"label_agreement":null},{"id":"W1936969208","doi":"10.1109/esem.2015.7321196","title":"Don't Call Us, We'll Call You: Characterizing Callbacks in Javascript","year":2015,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":41,"is_retracted":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":"Callback; JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Operating system; Rich Internet application","score_opus":0.05261667345722549,"score_gpt":0.270713781035217,"score_spread":0.2180971075779915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936969208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35882205,0.0006599273,0.5805269,0.016092816,0.003961221,0.0005231738,0.000004527707,0.0010034555,0.03840597],"genre_scores_gemma":[0.95623034,0.000037886683,0.038037207,0.003532988,0.00027184057,0.00001677347,0.0000075400117,0.000016603823,0.0018488286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981038,0.00011773644,0.0004314664,0.0005426564,0.00036113447,0.00044322334],"domain_scores_gemma":[0.99874765,0.00007514815,0.0001057193,0.00068747747,0.00013631303,0.00024767822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079131115,0.00018016953,0.00022135429,0.00015937437,0.000081997845,0.0002677434,0.0011332319,0.0001211547,0.000024845265],"category_scores_gemma":[0.00009646443,0.00017424271,0.000058513164,0.0004916175,0.00004030885,0.0006526052,0.00039174737,0.00028843942,0.00023594146],"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.000104615385,0.0016787207,0.15766853,0.00026442678,0.0001284744,0.00050531485,0.07488374,0.0014158151,0.015268438,0.42674983,0.1538255,0.16750659],"study_design_scores_gemma":[0.0018457525,0.00015870617,0.031162422,0.00014782493,0.000007349158,0.00010384881,0.00038575078,0.4282484,0.005170096,0.0029806204,0.52874,0.0010492182],"about_ca_topic_score_codex":0.0009500712,"about_ca_topic_score_gemma":0.00019855969,"teacher_disagreement_score":0.5974083,"about_ca_system_score_codex":0.00014293123,"about_ca_system_score_gemma":0.0001586508,"threshold_uncertainty_score":0.7105411},"labels":[],"label_agreement":null},{"id":"W1953268564","doi":"10.1109/sp.2005.2","title":"A Generic Attack on Checksumming-Based Software Tamper Resistance","year":2005,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Carleton University","funders":"","keywords":"Checksum; Computer science; Tamper resistance; x86; Software; Operating system; Embedded system; Software engineering; Computer security","score_opus":0.05401537281976637,"score_gpt":0.2869693654017309,"score_spread":0.23295399258196453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953268564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010545325,0.00011135467,0.97614706,0.0054245433,0.00020960215,0.00008548867,7.867842e-7,0.00048704678,0.006988777],"genre_scores_gemma":[0.5333807,0.0000024855888,0.4567997,0.0069051413,0.00020032721,0.000011567834,0.0000020150671,0.00000834103,0.002689712],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989219,0.000038427963,0.00016348639,0.00039701044,0.00024952536,0.00022966796],"domain_scores_gemma":[0.99900365,0.00013850581,0.000067259636,0.0006479512,0.000069264934,0.00007336028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019889449,0.00011395234,0.00009551109,0.00007243783,0.0001789191,0.00013798726,0.0007173045,0.000050954157,0.00009475802],"category_scores_gemma":[0.00006219395,0.00010603976,0.000055757064,0.0003572417,0.000026911226,0.00020381891,0.00006483176,0.00010886234,0.0004284151],"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.000063762396,0.000879844,0.002307919,0.00012427731,0.00004446714,0.000025949888,0.0024008348,0.07415057,0.00096066436,0.30840015,0.3600861,0.25055546],"study_design_scores_gemma":[0.00038134053,0.000037871603,0.001312123,0.000038203594,0.0000021512747,0.0000017697262,0.0000107200485,0.2704849,0.009007007,0.00022944223,0.7181757,0.00031875173],"about_ca_topic_score_codex":0.0000023439843,"about_ca_topic_score_gemma":0.00001987801,"teacher_disagreement_score":0.5228354,"about_ca_system_score_codex":0.000067596935,"about_ca_system_score_gemma":0.000069146496,"threshold_uncertainty_score":0.55065525},"labels":[],"label_agreement":null},{"id":"W1963742187","doi":"10.1109/tse.2011.7","title":"Reducing Unauthorized Modification of Digital Objects","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Security and Verification in Computing","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":"Carleton University","funders":"","keywords":"Rootkit; Computer science; Operating system; Computer security; Key (lock); Kernel (algebra); Overhead (engineering); File system; Malware; Embedded system","score_opus":0.039293477207764625,"score_gpt":0.23538109404666266,"score_spread":0.19608761683889803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963742187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023933487,0.000019414858,0.9744949,0.000007849789,0.0007882678,0.0000918419,0.000004651572,0.00053422933,0.00012539844],"genre_scores_gemma":[0.84241635,0.0000040911636,0.15750691,0.0000055124333,0.00001897681,0.000013114324,7.451066e-7,0.000011623593,0.000022677006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991232,0.000012221418,0.0002650904,0.00026092623,0.00017041618,0.00016810793],"domain_scores_gemma":[0.99923486,0.0001211176,0.000075008305,0.0004291426,0.00007540265,0.00006445297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011722737,0.00012057683,0.00012856316,0.00020317362,0.00008406541,0.000048452424,0.0003745895,0.00006451578,0.000011890094],"category_scores_gemma":[0.000032199263,0.00013707875,0.00008249453,0.00045969748,0.00001681891,0.0004984007,0.0000026465761,0.00016715551,0.000017739734],"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.00006830948,0.0009887305,0.00016512154,0.0003475442,0.00023280038,0.000014295042,0.031000135,0.66952133,0.01646078,0.028434807,0.000052325646,0.25271383],"study_design_scores_gemma":[0.00049400027,0.0001508076,0.0008195267,0.00017503917,0.000021099853,0.000028550872,0.0001023283,0.63114816,0.36602926,0.0004373311,0.00011103357,0.00048283092],"about_ca_topic_score_codex":0.000011147992,"about_ca_topic_score_gemma":1.801211e-7,"teacher_disagreement_score":0.8184829,"about_ca_system_score_codex":0.000041816387,"about_ca_system_score_gemma":0.000032770306,"threshold_uncertainty_score":0.5589909},"labels":[],"label_agreement":null},{"id":"W1965299231","doi":"10.1145/2000259.2000282","title":"Building components with embedded security monitors","year":2011,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Component (thermodynamics); Computer science; Reusability; Software security assurance; Component-based software engineering; Trustworthiness; Software; Software engineering; Security bug; Embedded system; Computer security; Software development; Distributed computing; Security service; Operating system; Information security","score_opus":0.047684943921137264,"score_gpt":0.2519581456334186,"score_spread":0.20427320171228136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965299231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3358863,0.0000126011,0.6509946,0.000058109392,0.00025253152,0.00007007662,1.9899872e-7,0.0003138704,0.012411699],"genre_scores_gemma":[0.74820286,9.463373e-7,0.25161758,0.00011529988,0.000033915327,0.0000034927857,3.1978334e-7,0.000004082642,0.000021531987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991038,0.00004082135,0.00014932122,0.00029869215,0.00019852632,0.00020884325],"domain_scores_gemma":[0.9992874,0.00004091376,0.00006862657,0.00044525985,0.00006999415,0.00008779682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017015224,0.000101081896,0.00009582659,0.00006258099,0.00015388105,0.00008282524,0.00074544776,0.000037731254,0.00005017546],"category_scores_gemma":[0.0000083384575,0.00008315238,0.000028212025,0.00025412146,0.00003796667,0.00038335312,0.00016232314,0.000110578,0.00005959197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017192855,0.00024102094,0.009970291,0.000017946068,0.00003811375,0.00002124414,0.011079419,0.00002963803,0.00086006516,0.9703242,0.00045976724,0.0069410843],"study_design_scores_gemma":[0.0021372903,0.00050773425,0.08797922,0.00017286172,0.000026933554,0.00021343002,0.00088866585,0.62585974,0.16034062,0.11267247,0.007426191,0.0017748408],"about_ca_topic_score_codex":0.00010607897,"about_ca_topic_score_gemma":0.0000020608563,"teacher_disagreement_score":0.85765177,"about_ca_system_score_codex":0.00001938369,"about_ca_system_score_gemma":0.000021460337,"threshold_uncertainty_score":0.33908555},"labels":[],"label_agreement":null},{"id":"W1966836780","doi":"10.1109/pst.2014.6890945","title":"Granularity based flow control","year":2014,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Granularity; Computer science; Information flow; Inference; Access control; Information security; Adaptability; Control (management); Control flow; Data mining; Distributed computing; Computer security; Artificial intelligence","score_opus":0.0098463928878799,"score_gpt":0.2145175893267296,"score_spread":0.2046711964388497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966836780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007226899,0.0000067386245,0.9876318,0.0024435397,0.00027590737,0.000048332095,2.7185249e-7,0.00026747558,0.008603266],"genre_scores_gemma":[0.8328827,1.18725346e-7,0.16367085,0.003348063,0.000058752797,0.0000027941933,6.2515375e-7,0.0000017614452,0.000034335008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935913,0.000079928344,0.00010731635,0.00019465237,0.00013083554,0.00012816342],"domain_scores_gemma":[0.99926627,0.00018431069,0.000029102675,0.00041472248,0.000052065156,0.000053525087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043634878,0.000054264096,0.00007555295,0.00003316288,0.00011153736,0.00010739918,0.00049650506,0.000031480413,0.00004165157],"category_scores_gemma":[0.00006875925,0.00004910725,0.000038749233,0.00013716357,0.000016864835,0.00012697747,0.000032405827,0.00006516373,0.000109499495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027939761,0.00006311923,0.0015833126,0.000008970308,0.0000047468748,7.8336893e-7,0.000109486704,0.002503563,0.00020711184,0.9221082,0.0020956662,0.07131224],"study_design_scores_gemma":[0.0003553806,0.000016344704,0.0019001515,0.0000023531315,0.0000010101974,0.0000010120162,9.289743e-7,0.9740795,0.00071204087,0.00564632,0.017214369,0.00007062802],"about_ca_topic_score_codex":0.000014077235,"about_ca_topic_score_gemma":0.0000024817177,"teacher_disagreement_score":0.9715759,"about_ca_system_score_codex":0.000008475943,"about_ca_system_score_gemma":0.000020507845,"threshold_uncertainty_score":0.20025356},"labels":[],"label_agreement":null},{"id":"W1970588096","doi":"10.4236/ti.2012.31003","title":"Privacy Negotiation in Socio-Technical Systems","year":2012,"lang":"en","type":"article","venue":"Technology and Investment","topic":"Security and Verification in Computing","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":"Negotiation; Sociotechnical system; Computer science; Work (physics); Internet privacy; Service provider; Service (business); World Wide Web; Computer security; Knowledge management; Business; Sociology; Marketing; Engineering","score_opus":0.024596727388750773,"score_gpt":0.26425046293530696,"score_spread":0.2396537355465562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970588096","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.86211956,0.0036382622,0.1255873,0.005176176,0.00054030603,0.00030912604,3.171852e-7,0.00064826995,0.0019807066],"genre_scores_gemma":[0.98874307,0.000022324075,0.010718687,0.00042839575,0.000033273864,0.000034862886,8.3755083e-7,0.0000024977285,0.000016073169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935645,0.000034722234,0.00016821235,0.0001638943,0.000071775634,0.00020494327],"domain_scores_gemma":[0.9995785,0.00003323847,0.000057950903,0.0002768929,0.000014019573,0.000039421837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031115187,0.00006599655,0.0000910302,0.00023050359,0.00008021553,0.000026508378,0.0002874239,0.00015665959,0.0000016567901],"category_scores_gemma":[0.00004105654,0.000063787804,0.000010573054,0.00040331433,0.00007876094,0.00026683247,0.00021052647,0.00015537796,0.0000206169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.142435e-7,0.000050084043,0.016668517,0.000006415044,0.000002088537,4.977823e-7,0.00035935632,0.0000046119826,0.00027825264,0.9808434,0.00018924623,0.0015970939],"study_design_scores_gemma":[0.0018894606,0.00037499022,0.2483783,0.00020245652,0.000018886463,0.00037654096,0.0010494484,0.08607426,0.00813779,0.5330762,0.11938535,0.0010362708],"about_ca_topic_score_codex":0.0000064825026,"about_ca_topic_score_gemma":3.940269e-7,"teacher_disagreement_score":0.4477672,"about_ca_system_score_codex":0.000063689404,"about_ca_system_score_gemma":0.00001678043,"threshold_uncertainty_score":0.2601191},"labels":[],"label_agreement":null},{"id":"W1971787401","doi":"10.1145/977091.977139","title":"Repairing return address stack for buffer overflow protection","year":2004,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":17,"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":"Canadian Institute for Theoretical Astrophysics; National Science Foundation","keywords":"Buffer overflow; Computer science; Software; Vulnerability (computing); Operating system; Branch predictor; Embedded system; Computer security; Computer network","score_opus":0.051058488468494985,"score_gpt":0.2786954852184742,"score_spread":0.22763699674997923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971787401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02172347,0.000023533905,0.9741608,0.0013395718,0.00046823052,0.00038013703,6.3197604e-7,0.00045676838,0.0014468482],"genre_scores_gemma":[0.8559493,0.0000019564438,0.1432467,0.00031564134,0.00017382108,0.000057438527,0.0000011730382,0.0000064571805,0.00024754173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991784,0.000017589724,0.00016620156,0.00031336996,0.00014299838,0.00018141884],"domain_scores_gemma":[0.99935985,0.000042063093,0.00006166308,0.00039203893,0.000100003475,0.00004439999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002828309,0.000076852615,0.00007453363,0.000050618095,0.00020070656,0.00014789574,0.0003468903,0.00005323531,0.00000964494],"category_scores_gemma":[0.000075979995,0.00007322425,0.000057248068,0.00019955878,0.0000136962635,0.00037967978,0.00008184866,0.00008775212,0.000018785797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004119696,0.00021015217,0.00021885084,0.00016300693,0.00004049006,0.0000044555973,0.004203597,0.006788616,0.0075162696,0.9144415,0.00210687,0.06426497],"study_design_scores_gemma":[0.0019180558,0.0003366664,0.0014456556,0.00013931672,0.000008035798,0.000048144586,0.00013879206,0.7300742,0.15043092,0.07056201,0.04428166,0.00061651296],"about_ca_topic_score_codex":0.000048225862,"about_ca_topic_score_gemma":0.000010102238,"teacher_disagreement_score":0.8438795,"about_ca_system_score_codex":0.000071883136,"about_ca_system_score_gemma":0.000048319234,"threshold_uncertainty_score":0.2985998},"labels":[],"label_agreement":null},{"id":"W1976635413","doi":"10.1016/j.ic.2007.07.009","title":"Execution monitoring enforcement under memory-limitation constraints","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Security and Verification in Computing","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":"Concordia University; Université Laval","funders":"","keywords":"Computer science; Enforcement; Automaton; Class (philosophy); Security policy; Computer security; Bounded function; Theoretical computer science; Distributed computing; Artificial intelligence; Law","score_opus":0.030180698315048386,"score_gpt":0.2908001041920741,"score_spread":0.2606194058770257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976635413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072674096,0.0000238309,0.92098206,0.00023544075,0.00044094998,0.00015430302,5.1219837e-7,0.00019065116,0.0052981614],"genre_scores_gemma":[0.9665322,0.000010431071,0.033037942,0.00031379474,0.000058547594,0.0000046597775,0.00002854031,0.0000023530408,0.00001155217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898404,0.000025765115,0.00042219323,0.00012536449,0.0002766741,0.00016593713],"domain_scores_gemma":[0.9992904,0.000116145704,0.0002121364,0.0001113611,0.00019665141,0.00007332521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066420506,0.00009561386,0.00007327103,0.00021250952,0.00024682205,0.000293648,0.00013284698,0.000060118895,0.00000530601],"category_scores_gemma":[0.000030192447,0.00010469298,0.000023792574,0.00027694314,0.00004258663,0.0021087623,0.000051900217,0.000087022076,0.000058122103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006971489,0.00001777502,0.0003582583,0.000025668769,0.0000100568,4.888337e-7,0.0065005235,0.011049175,0.00017070638,0.27298978,0.00011199283,0.7087586],"study_design_scores_gemma":[0.0015068412,0.00011263308,0.07207811,0.00008290101,0.000011175682,0.000064418935,0.006961862,0.8917657,0.0064961542,0.016745398,0.0036927757,0.00048203973],"about_ca_topic_score_codex":0.000013689596,"about_ca_topic_score_gemma":7.596322e-7,"teacher_disagreement_score":0.8938581,"about_ca_system_score_codex":0.00008076976,"about_ca_system_score_gemma":0.00003659328,"threshold_uncertainty_score":0.4269256},"labels":[],"label_agreement":null},{"id":"W1977716721","doi":"10.1145/1533057.1533066","title":"Efficient IRM enforcement of history-based access control policies","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enforcement; Rewriting; Computer science; Access control; Code (set theory); Computer security; Mandatory access control; Security policy; Binary code; Programming language; Binary number; Role-based access control; Political science; Law","score_opus":0.035111162953297005,"score_gpt":0.2871634771442493,"score_spread":0.25205231419095225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977716721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013840659,0.000092553186,0.96720886,0.0015112946,0.0002720001,0.00012635365,8.0569816e-7,0.00013015814,0.016817335],"genre_scores_gemma":[0.9896407,6.290606e-7,0.00687509,0.003385395,0.000029779052,0.0000028192126,7.9687163e-7,0.0000016815753,0.00006309066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991489,0.00002970481,0.00024078917,0.00017909383,0.00023994631,0.00016153199],"domain_scores_gemma":[0.99925375,0.00008084716,0.00012303384,0.0003927002,0.00009899355,0.000050663082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022104823,0.000077279976,0.000118378484,0.00010826874,0.00005229301,0.000045246434,0.0008344609,0.000027789118,0.00010503811],"category_scores_gemma":[0.000022622356,0.0000695575,0.000056909168,0.00017164895,0.00003385533,0.000070509974,0.000043980282,0.0000475165,0.0000073979827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008073101,0.00017665865,0.00020031827,0.000010926427,0.0000059473396,7.062789e-7,0.0008028872,0.06836307,0.0009842342,0.921153,0.0018838486,0.006410347],"study_design_scores_gemma":[0.0005854375,0.00010703858,0.0037229704,0.000013496855,0.0000035264413,8.719893e-7,0.00001342823,0.9752469,0.007652788,0.00066241674,0.011869385,0.00012172867],"about_ca_topic_score_codex":0.00013319102,"about_ca_topic_score_gemma":0.0000014805809,"teacher_disagreement_score":0.97580004,"about_ca_system_score_codex":0.00011601462,"about_ca_system_score_gemma":0.00010679903,"threshold_uncertainty_score":0.28364727},"labels":[],"label_agreement":null},{"id":"W1977851074","doi":"10.1108/09685220210446579","title":"Information flow analysis on role‐based access control model","year":2002,"lang":"en","type":"article","venue":"Information Management & Computer Security","topic":"Security and Verification in Computing","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 Regina","funders":"","keywords":"Computer science; Information flow; Access control; Role-based access control; Set (abstract data type); Information security; Flow (mathematics); Information system; Control (management); Order (exchange); Distributed computing; Computer security; Artificial intelligence; Mathematics; Programming language; Engineering","score_opus":0.017561127011149303,"score_gpt":0.24089537523980123,"score_spread":0.22333424822865192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977851074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001004037,0.00000934116,0.9826539,0.0012370554,0.00040779525,0.0005421282,0.000022324904,0.00061789795,0.013505477],"genre_scores_gemma":[0.92373085,0.0000130507005,0.06431844,0.01166911,0.00007192828,0.000061112354,0.000119296026,0.000005091465,0.000011098685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974899,0.00009660899,0.0008675021,0.00026568136,0.00087802194,0.00040224436],"domain_scores_gemma":[0.9979101,0.00009319453,0.0004895142,0.0010718665,0.0002916558,0.00014367001],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005532151,0.0002945493,0.00029953092,0.0013324053,0.00037293177,0.002007175,0.0018929938,0.00010626617,0.000072351424],"category_scores_gemma":[0.000013912668,0.00030953126,0.00023878581,0.0018848202,0.00003172043,0.009729646,0.0004017618,0.00024290412,0.0006014222],"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.000009474615,0.000087112676,0.00012020951,0.00005973722,0.00017781893,8.034379e-7,0.0023848831,0.77854,4.860946e-8,0.071593285,0.0047880895,0.1422385],"study_design_scores_gemma":[0.0010359377,0.00004240243,0.0014330975,0.000019199206,0.000075067124,8.141834e-7,0.000026401665,0.9700869,0.000014433195,0.0024183933,0.024518084,0.00032932055],"about_ca_topic_score_codex":0.000012740179,"about_ca_topic_score_gemma":0.0000019207446,"teacher_disagreement_score":0.9227268,"about_ca_system_score_codex":0.00013719969,"about_ca_system_score_gemma":0.000017250422,"threshold_uncertainty_score":0.9999357},"labels":[],"label_agreement":null},{"id":"W1979999931","doi":"10.1109/cloud.2013.21","title":"A Server-Side Solution to Cache-Based Side-Channel Attacks in the Cloud","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":53,"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":"Cloud computing; Side channel attack; Computer science; Cache; Server-side; Client-side; Computer security; Cloud computing security; Virtual machine; Distributed computing; Computer network; Cryptography; Operating system","score_opus":0.04051348829365457,"score_gpt":0.27003205703019295,"score_spread":0.22951856873653836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979999931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12944748,0.000023851491,0.84209216,0.023914887,0.00039994356,0.00037277528,3.077397e-7,0.00014863232,0.003599981],"genre_scores_gemma":[0.97911954,5.888441e-7,0.012786152,0.007821329,0.00011024265,0.000056040226,0.0000014972195,0.000004219621,0.00010039434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987954,0.00014671953,0.00022822226,0.00030611368,0.00024858795,0.00027493873],"domain_scores_gemma":[0.99895465,0.0002441776,0.000050555576,0.0005977697,0.00008635227,0.00006651479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439055,0.000100508456,0.00009003575,0.000090161564,0.00014992652,0.00026032858,0.0009997251,0.00005426905,0.000028891387],"category_scores_gemma":[0.00007707801,0.000076119926,0.000045178425,0.00057555654,0.000018490806,0.0002960237,0.00014260714,0.00014098693,0.0005112856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033113847,0.0012964836,0.0053393836,0.00015651285,0.00004530069,0.00003928284,0.05463287,0.07826928,0.005502635,0.6183318,0.13473317,0.101620145],"study_design_scores_gemma":[0.00033404765,0.00007184884,0.02098128,0.0000307103,0.0000018869105,0.0000077772875,0.00037102523,0.96338254,0.0022564868,0.00862406,0.0036929278,0.00024538077],"about_ca_topic_score_codex":0.0015370946,"about_ca_topic_score_gemma":0.00024052849,"teacher_disagreement_score":0.8851133,"about_ca_system_score_codex":0.000051140803,"about_ca_system_score_gemma":0.00005581346,"threshold_uncertainty_score":0.6571713},"labels":[],"label_agreement":null},{"id":"W1983109102","doi":"10.1016/j.scico.2007.04.001","title":"Reasoning about safety properties in a JVM-like environment","year":2007,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Security and Verification in Computing","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 Regina","funders":"","keywords":"Bytecode; Computer science; Programming language; Overhead (engineering); Event (particle physics); Java","score_opus":0.018036515301800955,"score_gpt":0.24792762288091727,"score_spread":0.22989110757911632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983109102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14711878,0.0002044583,0.85133106,0.0001339074,0.0004936244,0.00025848325,1.2233646e-7,0.000112632144,0.00034691227],"genre_scores_gemma":[0.6301906,0.0000065286367,0.36967805,0.00005566782,0.00005166317,0.0000044443154,2.6507897e-7,0.000004194718,0.000008571635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973377,0.000045171062,0.0005819962,0.00063001626,0.00073488604,0.000670234],"domain_scores_gemma":[0.9988597,0.00007948304,0.00022347456,0.0006033268,0.0000985133,0.00013551745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037750704,0.0001567117,0.00020537176,0.0003963156,0.0003118422,0.0002579275,0.0017170535,0.000050325805,0.000002649079],"category_scores_gemma":[0.000040562772,0.00014747208,0.00005838934,0.0013402344,0.0005310843,0.0008998191,0.000693063,0.00019225883,0.000009378742],"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.000010454385,0.00017656917,0.0036629764,0.000036459358,0.000004451532,0.000010523402,0.006002218,0.0024523046,0.0018635907,0.03707527,0.0000059606286,0.94869924],"study_design_scores_gemma":[0.00089124567,0.00034740032,0.078841016,0.0006891123,0.000005267114,0.00007797478,0.0004820938,0.8764012,0.023139847,0.00122478,0.017108072,0.00079202274],"about_ca_topic_score_codex":0.000044081782,"about_ca_topic_score_gemma":0.000005960324,"teacher_disagreement_score":0.9479072,"about_ca_system_score_codex":0.00015840534,"about_ca_system_score_gemma":0.00016061541,"threshold_uncertainty_score":0.60137373},"labels":[],"label_agreement":null},{"id":"W1987098661","doi":"10.1109/mm.2013.27","title":"Inspection-Resistant Memory Architectures","year":2013,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Security and Verification in Computing","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; Adversary; Probabilistic logic; Cryptography; Architecture; Chip; Embedded system; Computer security; Computer engineering; Computer hardware; Artificial intelligence; Telecommunications","score_opus":0.014713361848657184,"score_gpt":0.2320977084324178,"score_spread":0.21738434658376063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987098661","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.7438537,0.0002177987,0.24693553,0.0016783833,0.0014322692,0.00017826242,9.3418805e-7,0.0005811097,0.005122033],"genre_scores_gemma":[0.97283727,0.0000024212534,0.025950646,0.0007583476,0.00020046705,0.000014040271,4.3766104e-7,0.000005634338,0.00023072584],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925286,0.000039210474,0.00015271381,0.00025477938,0.00011956542,0.00018088598],"domain_scores_gemma":[0.9993357,0.000075552656,0.000056324887,0.0004115315,0.00006391121,0.000056971356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009938957,0.00008423089,0.0000769898,0.00007945885,0.00019639154,0.00019757642,0.0005774544,0.0000378172,0.000047006346],"category_scores_gemma":[0.000017137108,0.00007877111,0.00004566364,0.00021378732,0.000043297125,0.00011857354,0.0000621203,0.00012385708,0.00049165805],"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.000006199974,0.00014144149,0.00031111407,0.00003946608,0.000038630875,0.00001000178,0.006299174,0.0008264771,0.84521073,0.015134154,0.06620684,0.06577579],"study_design_scores_gemma":[0.0006842139,0.00011698143,0.028269656,0.00006214955,0.000007735373,0.000110156965,0.00020650617,0.054923873,0.8477788,0.027673902,0.03935583,0.0008102117],"about_ca_topic_score_codex":0.00021029184,"about_ca_topic_score_gemma":0.000008965024,"teacher_disagreement_score":0.2289836,"about_ca_system_score_codex":0.000029548546,"about_ca_system_score_gemma":0.000031533782,"threshold_uncertainty_score":0.63194335},"labels":[],"label_agreement":null},{"id":"W1987289444","doi":"10.1145/1321631.1321691","title":"A buffer overflow benchmark for software model checkers","year":2007,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Buffer overflow; Software; Buffer (optical fiber); Operating system; Telecommunications","score_opus":0.030860255627683207,"score_gpt":0.2862900344783689,"score_spread":0.25542977885068574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987289444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.004945528,0.000039116174,0.99028015,0.00039758836,0.00028537615,0.00015374417,0.0000013097958,0.0002644389,0.00363277],"genre_scores_gemma":[0.33225513,0.0000014154472,0.6660784,0.0010677141,0.00007473398,0.000007469962,0.0000026966532,0.000005015847,0.00050744816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990732,0.000006488755,0.00018692906,0.0002949541,0.0001607556,0.00027763596],"domain_scores_gemma":[0.99918073,0.00021324265,0.00004776713,0.00037890938,0.00009795006,0.00008142518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336025,0.00008743078,0.00008408802,0.000061782564,0.0001567214,0.0000898459,0.0005510832,0.000061060644,0.0000164899],"category_scores_gemma":[0.000086974636,0.00008380182,0.000070552946,0.00019352621,0.000019520969,0.00026056857,0.00010211379,0.00006811581,0.000016410382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022119073,0.000117984746,0.001140691,0.000044987377,0.000024279272,0.0000022605216,0.0020691631,0.0060381996,0.00046513526,0.8763534,0.027992956,0.08572886],"study_design_scores_gemma":[0.00023304982,0.000023714076,0.0005858032,0.0000067094343,0.0000020732311,0.0000033180038,0.000025690544,0.9721258,0.0027334052,0.01676002,0.007349858,0.00015053307],"about_ca_topic_score_codex":0.000009471813,"about_ca_topic_score_gemma":0.000005479632,"teacher_disagreement_score":0.96608764,"about_ca_system_score_codex":0.00003659025,"about_ca_system_score_gemma":0.00005488547,"threshold_uncertainty_score":0.3417339},"labels":[],"label_agreement":null},{"id":"W1988331803","doi":"10.1109/icsai.2012.6223219","title":"A dynamic detection method against ROP and JOP","year":2012,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"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":"State Key Laboratory of Novel Software Technology; Canadian Institute of Steel Construction","keywords":"Computer science; Computer security; Exploit; Covert; Granularity; Rootkit; Malware; Programming language","score_opus":0.017109791565311287,"score_gpt":0.2914942711591939,"score_spread":0.2743844795938826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988331803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03923526,0.0001733519,0.9571828,0.00022572925,0.00033051235,0.000041320887,7.109176e-8,0.00015594183,0.0026549604],"genre_scores_gemma":[0.76298183,0.000008045502,0.23663883,0.00028017006,0.000028858514,0.0000023851435,1.5490969e-7,0.000002030245,0.00005769542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949086,0.000056892735,0.00008952531,0.0001400114,0.00007651429,0.00014619528],"domain_scores_gemma":[0.9996286,0.00006201652,0.00003276145,0.00019003512,0.000023002893,0.000063598476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040269562,0.00005068656,0.000050609364,0.00004860815,0.00011719164,0.000075236545,0.00015678807,0.000032342134,0.000004113507],"category_scores_gemma":[0.000026009704,0.000046417394,0.000016290489,0.00017302498,0.000010449677,0.00038822432,0.0000984138,0.000064145745,0.000025171174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012133764,0.000035180616,0.0005228126,0.000011075819,0.000007862006,3.396725e-7,0.0016825072,0.000047907615,0.007823269,0.0655284,0.000043685974,0.9242957],"study_design_scores_gemma":[0.000096438256,0.000013425485,0.00772361,0.0000048557436,0.000001905047,0.000024556846,0.00006257874,0.9797287,0.0065732384,0.0011214401,0.0045404513,0.000108825356],"about_ca_topic_score_codex":0.000011523362,"about_ca_topic_score_gemma":0.0000041904127,"teacher_disagreement_score":0.9796808,"about_ca_system_score_codex":0.000019547013,"about_ca_system_score_gemma":0.00000688636,"threshold_uncertainty_score":0.18928464},"labels":[],"label_agreement":null},{"id":"W1990446864","doi":"10.1145/1867635.1867636","title":"System security, platform security and usability","year":2010,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Scalability; Trusted Computing; Usability; Computer security; Human–computer interaction; Operating system","score_opus":0.01611120448668237,"score_gpt":0.250726655924025,"score_spread":0.2346154514373426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990446864","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.8823922,0.00003022293,0.091040134,0.0006653667,0.0012246537,0.00019424838,0.0000021603416,0.0007160611,0.023734903],"genre_scores_gemma":[0.98407817,0.0000018867119,0.015627645,0.00014229669,0.00012281456,0.000006187132,9.0655664e-7,0.0000040408145,0.000016082347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988277,0.000030982534,0.0002492709,0.00044283396,0.00021725889,0.00023196953],"domain_scores_gemma":[0.9987963,0.00018068466,0.0000714103,0.0007120699,0.00009151128,0.00014801513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000778207,0.00012029916,0.00014214439,0.00005238817,0.00025263338,0.0002885767,0.0006710631,0.00011219403,0.000030011135],"category_scores_gemma":[0.00006524268,0.00010936553,0.000041349034,0.00022684984,0.00009440264,0.0005553242,0.0004316215,0.00033986178,0.000044594515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013406521,0.0000345577,0.0029340826,0.000056002857,0.000004092788,0.0000017604303,0.0017460815,6.2029386e-7,0.00021627363,0.99200827,0.0002038845,0.0027930636],"study_design_scores_gemma":[0.00064116326,0.00007504201,0.008146527,0.00003337105,0.000008166033,0.00033616138,0.00088828633,0.8083353,0.006961665,0.15927328,0.014654681,0.00064635347],"about_ca_topic_score_codex":0.000106814085,"about_ca_topic_score_gemma":0.00008698109,"teacher_disagreement_score":0.83273494,"about_ca_system_score_codex":0.000024609757,"about_ca_system_score_gemma":0.00004280056,"threshold_uncertainty_score":0.44597968},"labels":[],"label_agreement":null},{"id":"W1990656354","doi":"10.1145/1858996.1859099","title":"Model checking graph representation of precise boolean inter-procedural flow analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Control flow graph; Binary decision diagram; Theoretical computer science; Representation (politics); Graph; Data-flow analysis; Binary number; Algorithm; Mathematics; Data flow diagram; Arithmetic","score_opus":0.037400442519696354,"score_gpt":0.30069737711168226,"score_spread":0.2632969345919859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990656354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18438916,0.0000038757657,0.81307,0.00026060198,0.0001573268,0.00005280607,6.591408e-7,0.000096820775,0.0019687682],"genre_scores_gemma":[0.78725964,0.0000015710541,0.21254519,0.00007391988,0.000024864308,0.0000036008082,0.0000033672636,0.0000027235333,0.00008510646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902326,0.00002333472,0.00029603342,0.00031768568,0.00021012331,0.00012957052],"domain_scores_gemma":[0.99896795,0.00006570095,0.00014388653,0.0006026399,0.000168316,0.000051529052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026103898,0.000078612364,0.00014935639,0.00027161604,0.000078607605,0.00009340147,0.00065390737,0.000051045834,0.00003228847],"category_scores_gemma":[0.000080773636,0.000074870084,0.00014970703,0.001236683,0.000038194383,0.00043023372,0.0001560056,0.00014429244,0.0000050245158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031665582,0.00038883317,0.031882085,0.00008448042,0.0006403653,0.0000027971746,0.021842888,0.27645755,0.07378371,0.34702876,0.0018537384,0.24600312],"study_design_scores_gemma":[0.000083413586,0.000007349259,0.0019475836,0.000004425946,0.000026629446,0.0000015628451,0.00006549115,0.96310765,0.028273268,0.0063853012,0.00001369202,0.00008365007],"about_ca_topic_score_codex":0.000053369266,"about_ca_topic_score_gemma":0.0000806536,"teacher_disagreement_score":0.6866501,"about_ca_system_score_codex":0.0000072187513,"about_ca_system_score_gemma":0.000030133524,"threshold_uncertainty_score":0.30531135},"labels":[],"label_agreement":null},{"id":"W1991666422","doi":"10.1145/2462410.2462425","title":"Least-restrictive enforcement of the Chinese wall security policy","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Enforcement; Computer security; Computer science; Context (archaeology); Confidentiality; Security policy; Nash equilibrium; Law enforcement; Law and economics; Law; Political science; Economics; Mathematical economics","score_opus":0.00796767682588823,"score_gpt":0.24800419905779716,"score_spread":0.24003652223190894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991666422","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.5482561,0.000059835074,0.2749694,0.01519093,0.00075376587,0.0008842614,0.0000028927261,0.00026457864,0.15961824],"genre_scores_gemma":[0.9966536,0.000003741245,0.0022558197,0.000786249,0.00006670685,0.000011532807,4.0731803e-7,0.0000023885539,0.00021951263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999207,0.000051906965,0.00019465416,0.00017203038,0.00022024289,0.0001541351],"domain_scores_gemma":[0.99910176,0.00007436436,0.00010670754,0.00054572156,0.00012466939,0.000046762576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117456315,0.00008069031,0.00008391039,0.000057463603,0.000111550085,0.00006623726,0.000992165,0.00003149181,0.00013089107],"category_scores_gemma":[0.00007689005,0.000048919344,0.00006566551,0.00067959883,0.00004478048,0.0002711407,0.00037890527,0.000091473776,0.000055652883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.3532965e-7,0.000062690335,0.0046411464,0.000008739738,0.000011041457,8.313918e-8,0.0033541059,0.00015085764,0.0001737372,0.9850663,0.0013013395,0.0052292133],"study_design_scores_gemma":[0.0004774775,0.00007340723,0.18473262,0.000023271068,0.0000036562985,0.000008614058,0.00017626862,0.5917093,0.005554088,0.2119909,0.0049775434,0.00027282248],"about_ca_topic_score_codex":0.0031305219,"about_ca_topic_score_gemma":0.000010086379,"teacher_disagreement_score":0.7730754,"about_ca_system_score_codex":0.000037998485,"about_ca_system_score_gemma":0.00008731004,"threshold_uncertainty_score":0.47324336},"labels":[],"label_agreement":null},{"id":"W1993295335","doi":"10.1145/1352592.1352603","title":"Application-level isolation and recovery with solitude","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":49,"is_retracted":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; Isolation (microbiology); Computer security; Intrusion detection system; Process (computing); Distributed computing; Intrusion; State (computer science); File system; Namespace; Computer network; Operating system","score_opus":0.032780691242762526,"score_gpt":0.2317832041088033,"score_spread":0.19900251286604076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993295335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024825126,0.000029857041,0.9701888,0.0005684369,0.00003413697,0.000071979804,2.6574128e-7,0.00011892394,0.004162492],"genre_scores_gemma":[0.7964653,0.000017927738,0.20295617,0.00033151914,0.000029346445,0.000007464381,0.0000012229917,0.000002236669,0.00018880969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950576,0.000012397118,0.00009227881,0.00020656014,0.00009836698,0.00008461261],"domain_scores_gemma":[0.9995697,0.0000615895,0.000042161748,0.00023929072,0.00005101515,0.0000362254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008117706,0.000050266462,0.000049931514,0.000036415506,0.0001818513,0.000044677156,0.00017431942,0.000023715953,0.0000041539424],"category_scores_gemma":[0.0000075133594,0.00004274398,0.000008837067,0.00016420873,0.000030065912,0.00031811124,0.000048510727,0.0000427126,0.000021356356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026954767,0.0001832116,0.04776954,0.000032413143,0.00004231098,0.0000072062107,0.0049761836,0.0013333657,0.0016502904,0.8259996,0.0047785183,0.11320039],"study_design_scores_gemma":[0.00047316056,0.000114247,0.20136565,0.0000127108015,0.0000033614601,0.0002636712,0.00004801528,0.7792275,0.0016128384,0.008859203,0.007687142,0.00033252334],"about_ca_topic_score_codex":0.000030419069,"about_ca_topic_score_gemma":0.000004861936,"teacher_disagreement_score":0.8171404,"about_ca_system_score_codex":0.000010921663,"about_ca_system_score_gemma":0.000032552056,"threshold_uncertainty_score":0.17430489},"labels":[],"label_agreement":null},{"id":"W1996010464","doi":"10.1002/spe.440","title":"Taming access control security: extending capabilities using the views relationship","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","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":"Pontifícia Universidade Católica do Rio de Janeiro; University of Waterloo","keywords":"Abstraction; Computer science; Access control; Object (grammar); Domain (mathematical analysis); Computer security model; Control (management); Role-based access control; Security policy; Order (exchange); Computer security; Interface (matter); Distributed computing; Operating system; Artificial intelligence; Business","score_opus":0.1084530335172283,"score_gpt":0.3575995005652543,"score_spread":0.249146467048026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996010464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120439716,0.003721017,0.8709184,0.003250343,0.00052495394,0.00025631854,0.0000012877764,0.00023229785,0.000655664],"genre_scores_gemma":[0.9732473,0.00012613727,0.024713693,0.0017276168,0.00011315128,0.000036680245,2.986404e-7,0.0000073068663,0.000027802871],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841684,0.00029661652,0.00029460032,0.00041508104,0.00029632653,0.0002805637],"domain_scores_gemma":[0.9958352,0.0031601638,0.00024481723,0.00054942694,0.00013370888,0.00007671379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073007017,0.00013961937,0.000135231,0.00006196715,0.0012215512,0.00095914234,0.0008051833,0.000059756378,0.000028789986],"category_scores_gemma":[0.002850933,0.000113896334,0.000040864146,0.0004439798,0.00018181703,0.004170184,0.00026112844,0.0002881309,0.000011279353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002564505,0.00022814663,0.03297707,0.00012964732,0.00004976149,0.000035305275,0.7284672,0.00076116313,0.00017209601,0.15366204,0.00074657804,0.08274529],"study_design_scores_gemma":[0.0009658591,0.00010198963,0.0035831747,0.00023539853,0.00007498456,0.0008358561,0.056787953,0.80494124,0.0005491527,0.018433327,0.11238225,0.001108821],"about_ca_topic_score_codex":0.00009829896,"about_ca_topic_score_gemma":0.0000025144184,"teacher_disagreement_score":0.8528076,"about_ca_system_score_codex":0.000047362082,"about_ca_system_score_gemma":0.000025573352,"threshold_uncertainty_score":0.9395308},"labels":[],"label_agreement":null},{"id":"W2003857944","doi":"10.1145/1375696.1375702","title":"A compiler-based infrastructure for software-protection","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Crosslight Software (Canada)","funders":"","keywords":"Compiler; Computer science; Programming language; Suite; Reverse engineering; Software engineering; Software; Optimizing compiler; Control flow","score_opus":0.04647679259835641,"score_gpt":0.24976252910869517,"score_spread":0.20328573651033877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003857944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011346853,0.000009610925,0.9867852,0.0006047195,0.00036626254,0.00020830096,0.0000011218283,0.00042830769,0.00024962478],"genre_scores_gemma":[0.54736096,5.160446e-7,0.45182943,0.0006570001,0.00007085206,0.000024742161,0.0000021949775,0.000003392206,0.00005087734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993574,0.000020788084,0.0001329808,0.0002314748,0.00011847529,0.00013889732],"domain_scores_gemma":[0.99941635,0.000094564406,0.00005564785,0.0002914502,0.00010016404,0.00004183813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010190335,0.00007160454,0.000075386604,0.000060880517,0.0003240434,0.00004630919,0.00037242295,0.00005176176,0.000020970807],"category_scores_gemma":[0.00006351376,0.00006723687,0.0000523805,0.00022409306,0.00003010442,0.00016186222,0.00003945055,0.00007653635,0.000016410271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100316596,0.00041334055,0.007454914,0.00022368951,0.00006463462,0.000013123293,0.0043494133,0.035454713,0.0042668665,0.4231508,0.07402826,0.45047992],"study_design_scores_gemma":[0.0005468005,0.000098808785,0.0075346315,0.000007958232,0.0000014908569,0.00003125247,0.000008682979,0.9364965,0.0068410337,0.0076061157,0.040647242,0.00017949221],"about_ca_topic_score_codex":0.000010208711,"about_ca_topic_score_gemma":0.0000010576924,"teacher_disagreement_score":0.90104175,"about_ca_system_score_codex":0.000027495893,"about_ca_system_score_gemma":0.000078335914,"threshold_uncertainty_score":0.27418402},"labels":[],"label_agreement":null},{"id":"W2005292207","doi":"10.1016/j.compeleceng.2007.05.003","title":"Platform independent overall security architecture in multi-processor system-on-chip integrated circuits for use in mobile phones and handheld devices","year":2007,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Security and Verification in Computing","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":"McMaster University","funders":"","keywords":"Embedded system; Mobile device; Debugging; Architecture; Computer science; Chip; Mobile processor; Computer hardware; Engineering; Mobile technology; Operating system; Mobile Web; Telecommunications","score_opus":0.02255746602432211,"score_gpt":0.24650625495612208,"score_spread":0.22394878893179998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005292207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4093959,0.00028734343,0.5895691,0.000013895109,0.00022944767,0.00034126177,0.0000015079761,0.00015717672,0.000004362165],"genre_scores_gemma":[0.97014725,0.000009928735,0.029576732,0.00012907076,0.00006458438,0.000046851797,0.000005516325,0.000018032682,0.000002031757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980903,0.000025417969,0.00048052584,0.00059081876,0.00022633214,0.0005865932],"domain_scores_gemma":[0.9984474,0.0009949188,0.00009656817,0.00025272043,0.00006432655,0.00014405705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005897603,0.00026977554,0.0003483391,0.00061850704,0.00007969452,0.00023463789,0.0005374467,0.0001723811,2.9258902e-7],"category_scores_gemma":[0.0001113803,0.0002688597,0.000059351034,0.0009221942,0.000016050622,0.00033555066,0.0001154517,0.0005685189,0.0000012275841],"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.0002742988,0.0011442319,0.016385976,0.0018968607,0.0001353384,0.00029579483,0.015972797,0.5124522,0.0048588975,0.0489607,0.00006470883,0.3975582],"study_design_scores_gemma":[0.0011752533,0.0001373042,0.011887086,0.00029299804,0.0000028725767,0.000041111147,0.00003038254,0.9842166,0.0015098543,0.000085193955,0.00031060536,0.00031074157],"about_ca_topic_score_codex":0.00006584869,"about_ca_topic_score_gemma":0.00009647289,"teacher_disagreement_score":0.5607514,"about_ca_system_score_codex":0.00028332582,"about_ca_system_score_gemma":0.000050688894,"threshold_uncertainty_score":0.99997634},"labels":[],"label_agreement":null},{"id":"W2005694611","doi":"10.1109/ares.2010.15","title":"Classification of Buffer Overflow Vulnerability Monitors","year":2010,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Buffer overflow; Computer science; Vulnerability (computing); Computer security; Exploit; Vulnerability assessment; Code (set theory); Vulnerability management; Set (abstract data type); Operating system","score_opus":0.029003313897750318,"score_gpt":0.2912297589497877,"score_spread":0.2622264450520374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005694611","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.6344922,0.0000043500377,0.35810807,0.00044791424,0.0007796155,0.000060016635,4.2118307e-7,0.00011015856,0.005997253],"genre_scores_gemma":[0.9576989,8.105527e-7,0.042098444,0.00005028392,0.000076788354,0.0000039538227,7.892379e-7,0.0000022920385,0.00006776352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99925756,0.00003767217,0.00020952096,0.00022653941,0.00016790604,0.00010077873],"domain_scores_gemma":[0.9989245,0.00014597636,0.0000842653,0.000670693,0.00012980377,0.000044780852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003965411,0.000058168986,0.00007694119,0.000045367717,0.00007499226,0.000046111454,0.0005519034,0.00006243897,0.00006483816],"category_scores_gemma":[0.000113616865,0.000052457763,0.000039468,0.00023263229,0.00005405939,0.00024799595,0.00007820987,0.00016522608,0.000026578493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017769282,0.0001051929,0.038140293,0.000011273785,0.0000042886536,1.2387159e-7,0.00036560406,0.000013588549,0.053002622,0.88401955,0.00042169754,0.023913978],"study_design_scores_gemma":[0.00016277352,0.000028600578,0.5701824,0.0000044371845,0.0000023009004,0.0000036986369,0.000038781465,0.33231634,0.08053877,0.012189817,0.0043776883,0.00015438632],"about_ca_topic_score_codex":0.000036933427,"about_ca_topic_score_gemma":0.000007509044,"teacher_disagreement_score":0.87182975,"about_ca_system_score_codex":0.00000923824,"about_ca_system_score_gemma":0.000038154714,"threshold_uncertainty_score":0.21391654},"labels":[],"label_agreement":null},{"id":"W2007338615","doi":"10.4018/jsse.2010070102","title":"Monitoring Buffer Overflow Attacks","year":2010,"lang":"en","type":"article","venue":"International Journal of Secure Software Engineering","topic":"Security and Verification in Computing","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Buffer overflow; Computer science; Computer security; Set (abstract data type); Code (set theory); Task (project management); Computer network","score_opus":0.007770653178154565,"score_gpt":0.2504326166414459,"score_spread":0.24266196346329133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007338615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27424484,0.0001222662,0.71292186,0.00042335832,0.012122521,0.000024788767,0.0000011811766,0.00010460055,0.00003461308],"genre_scores_gemma":[0.8131769,0.000018409268,0.18504067,0.000041483683,0.0017012426,9.399146e-7,4.1830737e-7,0.000010160026,0.000009835348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987679,0.000009885358,0.00037215793,0.00014118702,0.00054940156,0.00015946092],"domain_scores_gemma":[0.998715,0.00022332615,0.00021364146,0.0001966866,0.00054769975,0.00010366599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032382412,0.00011954282,0.00012858209,0.00023148341,0.0000435923,0.00023023764,0.0014078657,0.00007986452,0.00002214853],"category_scores_gemma":[0.0005780712,0.00011953395,0.000115363415,0.00015206581,0.000012573546,0.00073754456,0.00014963002,0.0006192716,0.00000836106],"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.0001081166,0.0007654863,0.22808182,0.00018214768,0.0018203966,0.0014554906,0.015383173,0.1093465,0.19410475,0.15671805,0.004990419,0.28704363],"study_design_scores_gemma":[0.004493242,0.0003933545,0.22710367,0.0018438327,0.00007187335,0.007533275,0.00021733897,0.30812225,0.16469075,0.005209794,0.27783343,0.0024871782],"about_ca_topic_score_codex":0.000002240749,"about_ca_topic_score_gemma":3.4040423e-7,"teacher_disagreement_score":0.538932,"about_ca_system_score_codex":0.00005674145,"about_ca_system_score_gemma":0.00006386068,"threshold_uncertainty_score":0.4874453},"labels":[],"label_agreement":null},{"id":"W2014030636","doi":"10.1145/2664243.2664288","title":"Challenges and implications of verifiable builds for security-critical open-source software","year":2014,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Backdoor; Computer science; Source code; Compiler; Verifiable secret sharing; Software; Commit; Open source; Determinism; Process (computing); Obfuscation; Encryption; Simple (philosophy); Programming language; Code (set theory); Computer security; Set (abstract data type); Database","score_opus":0.05220395498826422,"score_gpt":0.319603663302359,"score_spread":0.26739970831409476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014030636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010887954,0.0004976316,0.9852259,0.0067312284,0.00009815967,0.00019777592,0.0000025150428,0.00012219191,0.0060357833],"genre_scores_gemma":[0.7198436,0.00006894057,0.2795313,0.00040126944,0.00005008204,0.000042756372,0.0000018270345,0.0000068183463,0.000053381216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991467,0.00004705288,0.00019892977,0.0003511092,0.00008249882,0.00017370924],"domain_scores_gemma":[0.99820375,0.00096055586,0.00005397284,0.0005385716,0.00016314113,0.00008000628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005134698,0.00007887759,0.00014971747,0.000043813216,0.00017286399,0.00012932626,0.000897663,0.000057803663,0.0000062287277],"category_scores_gemma":[0.00043078978,0.00007822599,0.000029342933,0.000101159836,0.00007242477,0.00033048567,0.0004406245,0.00005915954,0.0000031464485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017561778,0.000047062793,0.000058889498,0.00005627574,0.0000039946885,1.5696193e-8,0.00068043283,0.0000075577977,0.00006369001,0.90733546,0.00052067864,0.0912242],"study_design_scores_gemma":[0.0008332379,0.00032946127,0.004565789,0.000074263364,0.000013949962,0.0000266184,0.0002602119,0.14739728,0.003563101,0.5965053,0.24602509,0.00040572966],"about_ca_topic_score_codex":0.000015995092,"about_ca_topic_score_gemma":0.000007028925,"teacher_disagreement_score":0.7187548,"about_ca_system_score_codex":0.000007982157,"about_ca_system_score_gemma":0.000027923112,"threshold_uncertainty_score":0.31899634},"labels":[],"label_agreement":null},{"id":"W2015269143","doi":"10.1145/1133373.1133389","title":"Brittle systems will break - not bend","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Modular design; Daemon; Aspect-oriented programming; Implementation; Programming language; Context (archaeology); Kernel (algebra); Allocator; Code (set theory); Operating system; Software","score_opus":0.04055144020520957,"score_gpt":0.2264926895630504,"score_spread":0.18594124935784084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015269143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065614404,0.0004450388,0.91157013,0.00274676,0.0014521052,0.00012498505,0.0000019691245,0.0005707648,0.076526806],"genre_scores_gemma":[0.98752207,0.000013126672,0.00833227,0.0005694933,0.00015330648,0.0000041716266,6.408329e-7,0.0000041269045,0.0034007686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991956,0.00003239532,0.0001649477,0.00024959995,0.00018524959,0.0001722028],"domain_scores_gemma":[0.9993195,0.00008331906,0.00004643494,0.0004381033,0.00004917218,0.00006348035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014157515,0.00006874924,0.00008343768,0.00004517248,0.00012684215,0.00025492813,0.00059548503,0.000039646893,0.00015411034],"category_scores_gemma":[0.000017237744,0.00006596057,0.00003241901,0.0002242851,0.000018726387,0.00039823627,0.00011082995,0.00007144011,0.00049108895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.267483e-7,0.00007988334,0.00021332277,0.000020778183,0.00001115884,0.000007530449,0.0010355489,0.00036733595,0.00024752456,0.9284007,0.045040004,0.024575673],"study_design_scores_gemma":[0.00013059266,0.000019001212,0.00041330373,0.000013115968,0.0000013742776,0.000057790123,0.00003108625,0.85384643,0.00059505337,0.00034318806,0.14440192,0.00014712744],"about_ca_topic_score_codex":0.00011779507,"about_ca_topic_score_gemma":0.0000023904668,"teacher_disagreement_score":0.98096067,"about_ca_system_score_codex":0.000019568126,"about_ca_system_score_gemma":0.000006230949,"threshold_uncertainty_score":0.6312119},"labels":[],"label_agreement":null},{"id":"W2020742169","doi":"10.1145/1509239.1509275","title":"Enforcing security for desktop clients using authority aspects","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Computer security; Internet privacy","score_opus":0.05045628747970165,"score_gpt":0.32391075344270287,"score_spread":0.2734544659630012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020742169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073172234,0.000039030558,0.91907465,0.00042135027,0.00052165927,0.00021056063,8.5436716e-7,0.00029013187,0.0062695276],"genre_scores_gemma":[0.8250622,0.0000013164159,0.17419943,0.0005595477,0.00014065807,0.0000021601954,0.0000013203893,0.000003101651,0.000030259002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988067,0.0000367382,0.0002549801,0.0003859813,0.00019441101,0.0003211891],"domain_scores_gemma":[0.9991388,0.00011470155,0.00009992546,0.00042556823,0.00012245301,0.00009859067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005286116,0.000115316325,0.00013434631,0.000077037985,0.00037509477,0.00022611317,0.0006216328,0.00007242133,0.0000096798885],"category_scores_gemma":[0.00009829734,0.000117547585,0.00008214303,0.00033053957,0.000016523569,0.0005080432,0.0000891767,0.00011214568,0.000009737341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004120782,0.00006954845,0.0001677131,0.00001147839,0.000004906282,0.0000014131872,0.0010158287,0.0002567049,0.0005548913,0.98230183,0.00040427668,0.015207284],"study_design_scores_gemma":[0.00028145235,0.00006879219,0.0011284433,0.000017517834,0.000004170751,0.000012036639,0.00003922254,0.84562,0.007806832,0.14268595,0.0021407509,0.00019486052],"about_ca_topic_score_codex":0.000026406497,"about_ca_topic_score_gemma":0.0000021102514,"teacher_disagreement_score":0.84536326,"about_ca_system_score_codex":0.00007662309,"about_ca_system_score_gemma":0.00007112543,"threshold_uncertainty_score":0.47934514},"labels":[],"label_agreement":null},{"id":"W2022869924","doi":"10.1109/tcc.2014.2358236","title":"Preventing cache-based side-channel attacks in a cloud environment","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Cloud computing; Side channel attack; Computer science; Cache; Outsourcing; Client-side; Shared resource; Information leakage; Computer security; Distributed computing; Channel (broadcasting); Cloud computing security; Embedded system; Computer network; Operating system; Cryptography","score_opus":0.024790997299716257,"score_gpt":0.250895570407359,"score_spread":0.22610457310764273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022869924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07628868,0.000029479088,0.9200873,0.0006028741,0.0019267855,0.00026113456,0.000001657246,0.0003395869,0.00046251647],"genre_scores_gemma":[0.97302395,0.0000035259172,0.025972955,0.00059371185,0.00031078394,0.000018211958,0.0000014450441,0.000027174392,0.000048259953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970361,0.0003908317,0.00068583264,0.0008383712,0.0004443204,0.0006045712],"domain_scores_gemma":[0.997901,0.00084503595,0.00024528056,0.0008201099,0.00004248736,0.00014607866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013105148,0.00030962698,0.00031744217,0.0002876671,0.00054371427,0.00018564078,0.0009075708,0.00015055253,0.000016829224],"category_scores_gemma":[0.000023244858,0.0003591707,0.0001895221,0.0005689875,0.000062368126,0.00017211332,0.000017146638,0.00063659763,0.00011784984],"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.000011345347,0.00035096298,0.00006141736,0.000042155083,0.000017943697,0.0000059855006,0.0013827761,0.92369777,0.00034740288,0.0015141864,0.000039704588,0.072528355],"study_design_scores_gemma":[0.00081996864,0.0001129119,0.00024579954,0.00017336721,0.000009814027,0.000011918396,0.000062802,0.9863452,0.010098752,0.00086244754,0.00087153516,0.00038553387],"about_ca_topic_score_codex":0.00007577895,"about_ca_topic_score_gemma":0.000016741584,"teacher_disagreement_score":0.89673525,"about_ca_system_score_codex":0.0002086051,"about_ca_system_score_gemma":0.00006837282,"threshold_uncertainty_score":0.99988604},"labels":[],"label_agreement":null},{"id":"W2023463827","doi":"10.1142/s0218194003001317","title":"Adding Flexibility in Information Flow Control for Object-Oriented Systems Using Versions","year":2003,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Security and Verification in Computing","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 Lethbridge","funders":"","keywords":"Computer science; Information flow; Flexibility (engineering); Object (grammar); Process (computing); Distributed computing; Blocking (statistics); Confidentiality; Control (management); Enforcement; Cloning (programming); Computer security; Computer network; Programming language; Artificial intelligence","score_opus":0.013752855542731332,"score_gpt":0.2507605874164886,"score_spread":0.23700773187375726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023463827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04565721,0.00064560137,0.94994617,0.000013873438,0.0035466992,0.00010605248,0.0000070008437,0.0000659383,0.00001146151],"genre_scores_gemma":[0.8456731,0.000012579583,0.15414111,0.0000071393206,0.0001489717,0.000005425906,0.0000018756599,0.000007748604,0.0000020648886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.00002221395,0.00050978083,0.00011800604,0.00018927363,0.00017800937],"domain_scores_gemma":[0.99869215,0.00050636876,0.00015200177,0.00010439404,0.00046187377,0.000083227125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074309966,0.00012827292,0.00019045091,0.00048824772,0.00004728489,0.00014274778,0.0002951025,0.000065781715,9.53491e-7],"category_scores_gemma":[0.001583909,0.00013777928,0.000072610856,0.00023372339,0.0000073925517,0.0008876971,0.000038417653,0.00020205328,8.8656697e-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.000010915556,0.00002989495,0.0006555823,0.00008494823,0.00006183634,0.0000041705603,0.0010439461,0.9776097,0.00028078072,0.01741973,0.000019120223,0.0027794086],"study_design_scores_gemma":[0.00093533803,0.000026937427,0.00043331084,0.0003089779,0.0000070553046,0.000106132895,0.00005731639,0.9888464,0.00024685755,0.000022845234,0.008874326,0.00013450198],"about_ca_topic_score_codex":0.000003763102,"about_ca_topic_score_gemma":2.6134484e-7,"teacher_disagreement_score":0.80001587,"about_ca_system_score_codex":0.00022869691,"about_ca_system_score_gemma":0.00009644196,"threshold_uncertainty_score":0.5618476},"labels":[],"label_agreement":null},{"id":"W2024918682","doi":"10.4028/www.scientific.net/amr.998-999.1247","title":"Researches on JVMTI-Based Security Enhancement Techniques for Java Software","year":2014,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Security and Verification in Computing","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 of Emergency Physicians","funders":"","keywords":"Computer science; Software security assurance; Java; Software; Java bytecode; Hacker; Software engineering; Real time Java; Computer security; Software development; Security bug; Operating system; Information security; Java annotation; Security service","score_opus":0.09202748140257518,"score_gpt":0.41375943826264006,"score_spread":0.3217319568600649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024918682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058083765,0.000035548564,0.936701,0.0021358437,0.00042815,0.0012829249,0.000020042931,0.00045717275,0.00085552625],"genre_scores_gemma":[0.76957774,0.000023000655,0.22890778,0.00032886563,0.00024671733,0.0007389635,0.00002446167,0.000023918838,0.00012854846],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996511,0.0006546914,0.00037653267,0.00075930095,0.00090426835,0.00079421897],"domain_scores_gemma":[0.9960013,0.0019241292,0.00010012616,0.001120043,0.00070889987,0.00014551655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053080777,0.0001754029,0.00025177197,0.00031497012,0.0006147265,0.00042563913,0.0015069135,0.00011311868,0.00006126094],"category_scores_gemma":[0.0020217015,0.00016687691,0.000055321198,0.00046023974,0.00015923768,0.00032099773,0.00039189367,0.00026014246,0.000101194244],"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.0004429602,0.00044752916,0.00001605652,0.0005456352,0.000017277242,0.0000036109006,0.0005211351,0.00011113091,0.51485604,0.30414736,0.0045367535,0.17435451],"study_design_scores_gemma":[0.00038187444,0.0006586624,0.000023044964,0.00012047068,7.7582234e-7,6.436259e-7,0.000013142071,0.0033993593,0.8846738,0.049085665,0.06146735,0.0001752132],"about_ca_topic_score_codex":0.000028166354,"about_ca_topic_score_gemma":0.0000035439577,"teacher_disagreement_score":0.71149397,"about_ca_system_score_codex":0.00016327266,"about_ca_system_score_gemma":0.00015264968,"threshold_uncertainty_score":0.68050426},"labels":[],"label_agreement":null},{"id":"W2029500714","doi":"10.3182/20090610-3-it-4004.00009","title":"Design and Verification of Time-Constrained Workflows With Multi-Level Security","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Security and Verification in Computing","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":"Soundness; Workflow; Computer science; Computer security model; Security policy; Formalism (music); Workflow technology; Workflow management system; Workflow engine; Information flow; Security testing; Information security; Software engineering; Security information and event management; Database; Programming language; Computer security; Cloud computing security; Operating system","score_opus":0.028785475000508595,"score_gpt":0.2414136283963554,"score_spread":0.21262815339584681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029500714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19034395,0.00013415463,0.8078104,0.00061534246,0.000041336207,0.00031743757,0.0000014980208,0.00021870744,0.0005171854],"genre_scores_gemma":[0.6676329,0.00001164043,0.33220488,0.000072795825,0.000020450201,0.0000057687535,8.874532e-7,0.0000041855246,0.000046532547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.000015461352,0.0002479653,0.0003927211,0.00021137441,0.00020623773],"domain_scores_gemma":[0.99922484,0.000057199704,0.00020719071,0.00016803457,0.0002645001,0.00007821095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040680764,0.0001438831,0.00018300649,0.00009927388,0.00014136109,0.00015536965,0.0004239992,0.00007650503,0.000005417674],"category_scores_gemma":[0.00006647988,0.00013493859,0.000024646384,0.00040775922,0.00010229818,0.00057746255,0.000046162164,0.00011974836,0.000008398831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029026787,0.0012333859,0.011893014,0.0003286359,0.00015987358,0.0000085705215,0.050753534,0.0005550491,0.10306019,0.16003007,0.0025464343,0.669141],"study_design_scores_gemma":[0.000928517,0.00039419963,0.022912,0.00014891922,0.000017135986,0.00005363344,0.00018393873,0.94467217,0.024370778,0.005623246,0.00029934602,0.00039611536],"about_ca_topic_score_codex":0.000005501158,"about_ca_topic_score_gemma":2.552601e-7,"teacher_disagreement_score":0.9441171,"about_ca_system_score_codex":0.000021174501,"about_ca_system_score_gemma":0.000057723388,"threshold_uncertainty_score":0.5502636},"labels":[],"label_agreement":null},{"id":"W2030775397","doi":"10.1145/1519144.1519146","title":"Application-based TCP hijacking","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Computer network; TCP hole punching; Zeta-TCP; Compound TCP; Computer security; Spoofing attack; Transmission Control Protocol; Network packet","score_opus":0.014269837420052401,"score_gpt":0.2576204553440781,"score_spread":0.24335061792402574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030775397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011551873,0.000020266125,0.9791952,0.004734487,0.00007942363,0.00006067456,6.906826e-8,0.00038420432,0.014370526],"genre_scores_gemma":[0.87437654,4.761876e-7,0.121598616,0.0039195656,0.000048814665,0.000003122951,9.947095e-7,0.000001353711,0.000050533996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941033,0.000015398984,0.00011962879,0.00021201136,0.00012475747,0.00011785949],"domain_scores_gemma":[0.99937785,0.00006467871,0.00004244933,0.00042462515,0.00004864037,0.000041752646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000143615,0.00005228653,0.0000494064,0.00004735294,0.000112409056,0.000103850485,0.00055381795,0.00002615094,0.000017220289],"category_scores_gemma":[0.000015577047,0.00005091644,0.00002762043,0.00029468074,0.000008685606,0.00014258946,0.000021507623,0.000053231157,0.00012008531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.293057e-7,0.000039704588,0.00023125035,0.0000015874245,9.755026e-7,4.891999e-7,0.00014136061,0.0007943934,0.00056904566,0.8152207,0.0008657992,0.18213417],"study_design_scores_gemma":[0.00011172251,0.00001891228,0.0046314113,0.000004003047,6.538856e-7,0.0000016707891,0.0000075329344,0.9613249,0.005340751,0.013183604,0.0152703915,0.00010446482],"about_ca_topic_score_codex":0.0000061362684,"about_ca_topic_score_gemma":4.492275e-7,"teacher_disagreement_score":0.96053046,"about_ca_system_score_codex":0.00001740008,"about_ca_system_score_gemma":0.000032609194,"threshold_uncertainty_score":0.2076312},"labels":[],"label_agreement":null},{"id":"W2037659139","doi":"10.1016/j.jnca.2004.06.004","title":"An agent-based approach to security service","year":2004,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":23,"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","funders":"","keywords":"Computer science; Computer security; Security service; Authentication (law); Distributed System Security Architecture; Service (business); Interface (matter); Computer security model; Cloud computing security; Security information and event management; Information security; Cloud computing; Operating system","score_opus":0.02032854001819957,"score_gpt":0.2607101616701492,"score_spread":0.24038162165194965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037659139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010032339,0.00013696414,0.9874702,0.0017241674,0.00016830824,0.0001942385,7.874424e-7,0.000059610302,0.00021339004],"genre_scores_gemma":[0.5471463,0.000007294489,0.44894686,0.0030971158,0.0007798339,0.000014600341,0.0000020663053,0.00000523859,7.0218164e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988957,0.00005629317,0.00037183872,0.000258804,0.00021727679,0.00020010682],"domain_scores_gemma":[0.9987374,0.00005744834,0.00022363968,0.00044466622,0.00026880598,0.0002680655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041452004,0.00011614801,0.00017269472,0.00009602267,0.00026165918,0.00024252062,0.0009441327,0.000052765903,8.7365316e-7],"category_scores_gemma":[0.0000016696097,0.000111146044,0.000055595636,0.00077240466,0.000019671108,0.0002895701,0.00010814014,0.00019317002,0.000007978746],"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.000010958638,0.0006111091,0.0002330868,0.000033328924,0.000030514011,0.000002731646,0.0020400835,0.6498452,0.000042735053,0.31040573,0.0013535722,0.03539095],"study_design_scores_gemma":[0.0007730604,0.0002485004,0.0033661665,0.000055031862,0.000019053057,0.00017354418,0.0000447249,0.91626745,0.000069123496,0.037679844,0.041018162,0.0002853366],"about_ca_topic_score_codex":0.000007086534,"about_ca_topic_score_gemma":0.0000021353626,"teacher_disagreement_score":0.5385233,"about_ca_system_score_codex":0.000040332463,"about_ca_system_score_gemma":0.00010999617,"threshold_uncertainty_score":0.45324042},"labels":[],"label_agreement":null},{"id":"W2042108786","doi":"10.1145/1028976.1029010","title":"Pluggable verification modules","year":2004,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Regina","funders":"","keywords":"Bytecode; Computer science; Modular design; Extensibility; Operating system; Programming language; Java; Embedded system","score_opus":0.01995300430619532,"score_gpt":0.24109342398103858,"score_spread":0.22114041967484327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042108786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014486564,0.00003802794,0.96911895,0.0017061844,0.00021509685,0.00004665521,1.3494166e-7,0.00032209526,0.014066261],"genre_scores_gemma":[0.80385035,0.000005346568,0.19565104,0.0003186656,0.00003844549,0.0000043633568,0.0000010466852,0.0000020947853,0.0001286472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.000010292531,0.00010646103,0.00019901953,0.00011300833,0.00011321223],"domain_scores_gemma":[0.9994791,0.000017766348,0.000032581087,0.00039052474,0.000042967804,0.000037020658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119711345,0.000047806363,0.000043616445,0.00003997797,0.00011591841,0.000110764886,0.00046446352,0.000027010694,0.000018574812],"category_scores_gemma":[0.000016819817,0.00004620375,0.000021513031,0.00022991488,0.000015053583,0.0003464441,0.0000580749,0.00004594145,0.00027331166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.206974e-7,0.000024226005,0.000023149123,0.0000020032428,0.000001562853,4.479084e-7,0.00029975793,0.001836331,0.00068825623,0.98882276,0.00019688434,0.008104324],"study_design_scores_gemma":[0.0012363943,0.00009952664,0.013719799,0.000038660804,0.0000045015518,0.000048223537,0.00019386984,0.307495,0.13838774,0.46735117,0.0707577,0.0006674178],"about_ca_topic_score_codex":0.000040073886,"about_ca_topic_score_gemma":0.000002079648,"teacher_disagreement_score":0.7893638,"about_ca_system_score_codex":0.000036236954,"about_ca_system_score_gemma":0.000032926717,"threshold_uncertainty_score":0.35129595},"labels":[],"label_agreement":null},{"id":"W2042922122","doi":"10.1109/rtas.2007.10","title":"Dynamic Patching of Embedded Software","year":2007,"lang":"en","type":"article","venue":"Proceedings - Real-Time Technology and Applications Symposium","topic":"Security and Verification in Computing","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":"Bombardier (Canada)","funders":"","keywords":"Computer science; Instrumentation (computer programming); Human multitasking; Code (set theory); Dead code; Source code; Software; Embedded system; Process (computing); Binary code; Task (project management); Object code; Operating system; Programming language; Binary number; Redundant code; Code generation; Engineering; Set (abstract data type)","score_opus":0.004854768791122099,"score_gpt":0.2418184874480322,"score_spread":0.2369637186569101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042922122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18028364,0.0001642702,0.80907756,0.0016810664,0.000050088645,0.00054779503,0.0000034867555,0.0014641132,0.006728014],"genre_scores_gemma":[0.8209841,0.00010274176,0.17858437,0.00004147775,0.000026168302,0.00009368505,0.0000040391355,0.00001278268,0.00015059345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998687,0.0000038692456,0.00039528284,0.00047752162,0.00014169642,0.00029457273],"domain_scores_gemma":[0.99899143,0.00009307005,0.00027958595,0.00033614525,0.0002328801,0.00006687611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048377478,0.0001510875,0.00020336572,0.0005254773,0.0003148987,0.000051200903,0.00080040545,0.00023412523,0.0000043613604],"category_scores_gemma":[0.000036639907,0.00016095914,0.00003814487,0.0014268487,0.00021372328,0.00024995705,0.00030487357,0.00021556228,0.000023800476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063796306,0.00013040111,0.0026401167,0.00010620835,0.000024042669,7.1868163e-7,0.00081617205,0.0000046222376,0.1955758,0.7551539,0.00010639724,0.045435265],"study_design_scores_gemma":[0.0019405751,0.00058272225,0.009267984,0.00041589927,0.00014596668,0.00072740705,0.0022553082,0.12522444,0.3233449,0.5095645,0.024322897,0.0022073875],"about_ca_topic_score_codex":0.000005554068,"about_ca_topic_score_gemma":5.0402764e-7,"teacher_disagreement_score":0.6407005,"about_ca_system_score_codex":0.000035869565,"about_ca_system_score_gemma":0.000031511274,"threshold_uncertainty_score":0.6563723},"labels":[],"label_agreement":null},{"id":"W204293210","doi":"10.1007/978-3-642-19861-8_6","title":"Faster Alias Set Analysis Using Summaries","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"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":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Computer science; Pointer analysis; Aliasing; Set (abstract data type); Pointer (user interface); Programming language; Static analysis; Data mining; Algorithm; Artificial intelligence","score_opus":0.06045631422111657,"score_gpt":0.28057932595178015,"score_spread":0.22012301173066356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204293210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00030328345,0.0003711582,0.9939664,0.00019898043,0.0017147659,0.00022038809,0.000010161471,0.0001944872,0.0030203892],"genre_scores_gemma":[0.31094715,0.00004700944,0.6858016,0.0019602603,0.0007084172,0.000005841519,0.000021760181,0.00005092029,0.00045700834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956592,0.00006497001,0.0007259808,0.0018432571,0.0009671653,0.00073947693],"domain_scores_gemma":[0.9964914,0.00041059937,0.0004931699,0.0020497758,0.00035638027,0.00019871953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010968414,0.0005789224,0.0007276963,0.0018523154,0.00046565986,0.000929685,0.0041878973,0.00038792414,0.000090966154],"category_scores_gemma":[0.000071227965,0.0005660293,0.00031265084,0.0019723477,0.00079369004,0.0008281559,0.0018279259,0.0007646382,0.00005538458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018625447,0.000098198005,0.002388747,0.00014157673,0.0005127401,0.000213861,0.015253005,0.16510129,0.00014438905,0.19651611,0.00007790667,0.61953354],"study_design_scores_gemma":[0.00013574505,0.00005743036,0.0002881146,0.00014652305,0.000101127676,0.000043165634,4.610528e-7,0.883737,0.0006496666,0.11202145,0.0019858878,0.0008333736],"about_ca_topic_score_codex":0.00013132252,"about_ca_topic_score_gemma":0.00012650271,"teacher_disagreement_score":0.71863574,"about_ca_system_score_codex":0.00027683456,"about_ca_system_score_gemma":0.0004881018,"threshold_uncertainty_score":0.9996791},"labels":[],"label_agreement":null},{"id":"W2047936020","doi":"10.1016/j.mcm.2010.03.038","title":"Application of contract-based security assertion monitoring framework for telecommunications software engineering","year":2010,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Security and Verification in Computing","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Assertion; Computer science; Computer security; Software; Software security assurance; Software engineering; Telecommunications; Programming language; Information security; Security service","score_opus":0.023608510615315055,"score_gpt":0.26404266157549466,"score_spread":0.24043415096017962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047936020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.079380624,0.000035824774,0.91988504,0.00015297295,0.00014942535,0.0002289438,0.0000015332278,0.000160262,0.0000054029224],"genre_scores_gemma":[0.49591023,0.000001602542,0.5039633,0.00001533615,0.00006876077,0.000033678214,0.0000016665006,0.000005203608,2.3685627e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.000016761036,0.0003421851,0.0002492687,0.00013487022,0.0001663908],"domain_scores_gemma":[0.9979601,0.0011850096,0.00013280017,0.00050490437,0.00014557777,0.00007159698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003486054,0.000117146374,0.00018529767,0.00006585509,0.00015359564,0.00010817099,0.00046397868,0.000114782706,0.0000011518896],"category_scores_gemma":[0.00007639872,0.000119082746,0.00006472409,0.000148161,0.0000285341,0.00017308384,0.00009455939,0.000266809,0.0000017283426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029687135,0.00012928239,0.00027471434,0.00019978305,0.00001122941,9.0134805e-8,0.00077487883,0.0531091,0.00050059037,0.934634,0.0000012308021,0.010362162],"study_design_scores_gemma":[0.00011326545,0.000019388382,0.00011885103,0.000077173936,0.0000068403533,0.0000025340635,0.0000045468646,0.89285314,0.0028118338,0.103807375,0.00007341483,0.00011161183],"about_ca_topic_score_codex":0.0000040765285,"about_ca_topic_score_gemma":2.0914419e-7,"teacher_disagreement_score":0.8397441,"about_ca_system_score_codex":0.000009360458,"about_ca_system_score_gemma":0.000019371944,"threshold_uncertainty_score":0.48560536},"labels":[],"label_agreement":null},{"id":"W2049020424","doi":"10.1016/s0140-3664(00)00245-0","title":"On object initialization in the Java bytecode","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security and Verification in Computing","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é Laval","funders":"","keywords":"Computer science; Java bytecode; Serialization; Initialization; Java; Programming language; Correctness; Dataflow; Object (grammar); Java Modeling Language; Bytecode; Process (computing); Software portability; strictfp; Operating system; Java annotation; Real time Java; Artificial intelligence","score_opus":0.05286382080372038,"score_gpt":0.302949380646719,"score_spread":0.25008555984299863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049020424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010867439,0.00026258174,0.93360883,0.012783828,0.00028022722,0.00039250785,0.0000026019072,0.0003154418,0.041486543],"genre_scores_gemma":[0.9379151,0.00015318369,0.056889053,0.0048477068,0.00007896868,0.000046016477,0.000023407005,0.000007047342,0.000039523053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854434,0.00052105356,0.00030315088,0.00024945836,0.00019983298,0.00018219679],"domain_scores_gemma":[0.99612814,0.0007949454,0.00006639035,0.0029271403,0.000052112824,0.00003128427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245245,0.00011089739,0.000101688085,0.00012394792,0.00043749623,0.00028586018,0.004377282,0.000051590014,0.000046011646],"category_scores_gemma":[0.000024533038,0.00009534272,0.000050758288,0.0008261391,0.0000774498,0.00028216493,0.00028310527,0.0002896876,0.00026512597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027295016,0.00031204286,0.00011885278,0.000004024299,0.0000067284104,0.000002127401,0.0067623476,0.0040369607,0.0000038891253,0.78241885,0.0042574187,0.20207404],"study_design_scores_gemma":[0.0003111158,0.00006767768,0.007349465,0.00004929481,0.0000028809573,0.000023402812,0.000037005575,0.894286,0.000020522742,0.025667055,0.07199227,0.00019335104],"about_ca_topic_score_codex":0.000034193075,"about_ca_topic_score_gemma":0.000028757207,"teacher_disagreement_score":0.92704767,"about_ca_system_score_codex":0.000039580213,"about_ca_system_score_gemma":0.000044453132,"threshold_uncertainty_score":0.8134153},"labels":[],"label_agreement":null},{"id":"W2051053140","doi":"10.1109/hpcc.2014.131","title":"Data Interception through Broken Concurrency in Kernel Land","year":2014,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Malware; Kernel (algebra); Concurrency; Code (set theory); Synchronization (alternating current); Operating system; Configfs; Machine code; Embedded system; Linux kernel; Computer network; Programming language; Channel (broadcasting)","score_opus":0.08829328264429191,"score_gpt":0.32863046202746177,"score_spread":0.24033717938316984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051053140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025888504,0.000026002099,0.9578019,0.00058650784,0.00040839618,0.00005274871,0.0000017943107,0.00011557982,0.01511857],"genre_scores_gemma":[0.97222143,0.000012598401,0.027062092,0.00049753435,0.0000929268,0.0000017924694,0.000018260922,0.000002448552,0.000090902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991998,0.00006761762,0.0001752653,0.00032695997,0.0001053575,0.00012501577],"domain_scores_gemma":[0.99900836,0.00009900969,0.000044970853,0.0008012106,0.000023455294,0.00002300489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000388603,0.000059363007,0.00007671295,0.00003439727,0.000040507246,0.000106157,0.0012763599,0.00003463406,0.00004689789],"category_scores_gemma":[0.0000713745,0.000054755383,0.000011562404,0.00017904598,0.00002001405,0.0006997982,0.0004985759,0.00009483645,0.00015543518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037101283,0.00013123787,0.030861003,0.00002937702,0.000006715687,0.0000014674077,0.0039631883,0.00008878027,0.00016957722,0.76389456,0.011419473,0.1894309],"study_design_scores_gemma":[0.00032344606,0.000024050714,0.020148976,0.000026234458,9.750282e-7,0.000005073802,0.000038247683,0.91240644,0.000091240996,0.009348158,0.057454497,0.00013263641],"about_ca_topic_score_codex":0.00018672865,"about_ca_topic_score_gemma":0.00010480799,"teacher_disagreement_score":0.94633293,"about_ca_system_score_codex":0.000014183588,"about_ca_system_score_gemma":0.000015956815,"threshold_uncertainty_score":0.23718154},"labels":[],"label_agreement":null},{"id":"W205148524","doi":"10.1007/978-3-642-34281-3_11","title":"Quantitative Analysis of Information Flow Using Theorem Proving","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Information leakage; Computer science; Information flow; Anonymity; Leakage (economics); Theoretical computer science; Information theory; Measure (data warehouse); Automated theorem proving; Divergence (linguistics); Data mining; Computer security; Mathematics; Statistics","score_opus":0.03273897725590663,"score_gpt":0.2801080632057037,"score_spread":0.24736908594979706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205148524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00052725384,0.00032268997,0.9969517,0.00007620466,0.00084582774,0.00023793662,0.00000852459,0.0000785145,0.0009513318],"genre_scores_gemma":[0.2805972,0.000013553366,0.71902347,0.00024312378,0.000095932664,0.0000018866892,0.000010308114,0.000008922476,0.000005628582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731153,0.00005489083,0.0007515481,0.00059825444,0.0008498245,0.0004339666],"domain_scores_gemma":[0.9969591,0.0006566932,0.0007902848,0.0010106337,0.00048180795,0.00010150985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015718068,0.0003237104,0.0005625592,0.0022449505,0.00023247619,0.00034970377,0.0021018211,0.00021994872,0.00001917032],"category_scores_gemma":[0.00016894519,0.00030899374,0.00020063887,0.002189701,0.00046686106,0.001893263,0.00080004305,0.00044361473,0.00001153789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048454867,0.00001748697,0.00010971625,0.00004670553,0.00008954668,0.0000015210046,0.005531127,0.3520897,0.000083867315,0.19641812,9.647218e-7,0.44560638],"study_design_scores_gemma":[0.00007642171,0.000046910664,0.00019333063,0.00015240436,0.000075701515,0.0000060993843,0.0000011301189,0.9711329,0.000569439,0.027265549,0.00015989825,0.00032026277],"about_ca_topic_score_codex":0.00003772186,"about_ca_topic_score_gemma":0.000017535052,"teacher_disagreement_score":0.6190432,"about_ca_system_score_codex":0.00024926945,"about_ca_system_score_gemma":0.00040801245,"threshold_uncertainty_score":0.9999362},"labels":[],"label_agreement":null},{"id":"W2055548575","doi":"10.5555/2330748.2330775","title":"Understanding the impact of denial of service attacks on virtual machines","year":2012,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":43,"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":"Virtualization; Full virtualization; Application virtualization; Hardware virtualization; Computer science; Virtual machine; Hypervisor; Operating system; Service virtualization; Cloud computing; Data virtualization; Denial-of-service attack; Embedded system; The Internet","score_opus":0.14103574717535222,"score_gpt":0.3424692844536432,"score_spread":0.201433537278291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055548575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37211883,0.000016275524,0.6230464,0.00046769506,0.0002227555,0.000051328076,0.0000011424062,0.000029520348,0.0040460736],"genre_scores_gemma":[0.99824774,9.537218e-7,0.0014946716,0.00015798995,0.00008040779,5.8248776e-7,4.0110197e-7,0.0000025761478,0.00001470398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994043,0.000056882865,0.00015855696,0.000084849,0.00016309792,0.00013232576],"domain_scores_gemma":[0.9991974,0.0003144449,0.0001058642,0.00030193248,0.00004503873,0.000035282173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470962,0.0000623628,0.00008500484,0.000044227345,0.00007761575,0.000022300788,0.0005015476,0.00002781766,0.000036895915],"category_scores_gemma":[0.000025262083,0.00003710543,0.00006118726,0.00030066643,0.000027437882,0.00019499597,0.00010977713,0.000067990215,0.000009684876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018614168,0.00013590134,0.013956405,0.000012575205,0.00004087109,1.1571495e-7,0.008245343,0.004242785,0.0014959112,0.9689251,0.00073957257,0.002186769],"study_design_scores_gemma":[0.00061027234,0.00040723084,0.08094524,0.00006176861,0.000012422213,0.000019537549,0.001084267,0.8957395,0.010578498,0.010179984,0.00008483822,0.00027645033],"about_ca_topic_score_codex":0.0001740935,"about_ca_topic_score_gemma":0.0000068593195,"teacher_disagreement_score":0.9587452,"about_ca_system_score_codex":0.000039558712,"about_ca_system_score_gemma":0.000029724555,"threshold_uncertainty_score":0.15131155},"labels":[],"label_agreement":null},{"id":"W2056101307","doi":"10.1109/ssiri-c.2010.28","title":"Classification of Static Analysis-Based Buffer Overflow Detectors","year":2010,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":18,"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","keywords":"Computer science; Static analysis; Buffer overflow; Soundness; Scalability; Data mining; Inference; Source code; Program analysis; String (physics); Granularity; Machine learning; Artificial intelligence; Programming language; Database","score_opus":0.021270840231727792,"score_gpt":0.2753389764233368,"score_spread":0.254068136191609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056101307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36411086,0.0000023471457,0.63467467,0.0002304294,0.00015647033,0.000041724736,6.5224316e-7,0.00007216055,0.0007106612],"genre_scores_gemma":[0.9090598,2.806131e-7,0.09075942,0.00012434316,0.000018226034,0.000003894809,0.0000032092921,0.0000025339837,0.000028288765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991516,0.000040681294,0.00024381082,0.00023346006,0.00021631634,0.00011415828],"domain_scores_gemma":[0.9988098,0.00022346679,0.00013549026,0.00064956036,0.00013080142,0.00005087534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031175298,0.0000684761,0.0001205239,0.0002223356,0.000060846633,0.000059521397,0.00052520115,0.00004970516,0.000119775345],"category_scores_gemma":[0.000078793186,0.00006209117,0.0000874419,0.0010806996,0.000040473617,0.00015333209,0.000035446556,0.00011582272,0.000018181603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011670503,0.00037249,0.12275538,0.00005982191,0.00024028239,0.0000012950653,0.0010714895,0.0049490696,0.15022574,0.684998,0.00046304235,0.034851767],"study_design_scores_gemma":[0.00009550635,0.000015843725,0.14419821,0.000001621492,0.000022632052,2.6172515e-7,0.000011534408,0.83164185,0.022832002,0.00074390235,0.00036267145,0.000073931],"about_ca_topic_score_codex":0.000042859047,"about_ca_topic_score_gemma":0.000059166046,"teacher_disagreement_score":0.8266928,"about_ca_system_score_codex":0.000010288927,"about_ca_system_score_gemma":0.00006243206,"threshold_uncertainty_score":0.25320044},"labels":[],"label_agreement":null},{"id":"W2058755347","doi":"10.4204/eptcs.161.15","title":"A Formulation of the Potential for Communication Condition using C2KA","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Security and Verification in Computing","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covert; Computer science; Channel (broadcasting); Covert channel; Communications system; Path (computing); Theoretical computer science; Distributed computing; Computer network","score_opus":0.008343097245646705,"score_gpt":0.26167476808684015,"score_spread":0.25333167084119346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058755347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22471267,0.00001719251,0.7741082,0.00048583184,0.00015307796,0.00025870808,2.512211e-7,0.0000383806,0.00022573535],"genre_scores_gemma":[0.92056745,0.0000021805583,0.07920964,0.00014629122,0.000056831195,0.000011695451,5.291245e-7,0.0000046564005,7.3104985e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.000043666885,0.0003372047,0.00038001194,0.00039015466,0.00042670066],"domain_scores_gemma":[0.998857,0.00017000268,0.00022063171,0.00036422894,0.00034568168,0.00004246228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025435144,0.00010353711,0.00013513613,0.0001531471,0.0004602348,0.00018484535,0.0020746847,0.000055335233,0.0000017716866],"category_scores_gemma":[0.00023568851,0.00008482795,0.000062272695,0.0011231727,0.0006477663,0.00070623064,0.000469232,0.000201027,6.3318544e-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.0000056648164,0.000028236947,0.00008399124,0.000013528108,0.0000014131843,8.860317e-9,0.00035500526,0.0009863905,0.003843936,0.98939353,0.0000040051386,0.005284272],"study_design_scores_gemma":[0.000175323,0.00006131772,0.000690247,0.00003482326,0.0000023210464,0.0000075141525,0.0000054826924,0.61063904,0.009822079,0.37846842,0.00002931637,0.00006411481],"about_ca_topic_score_codex":0.0000030061422,"about_ca_topic_score_gemma":6.1327364e-7,"teacher_disagreement_score":0.6958548,"about_ca_system_score_codex":0.00018132488,"about_ca_system_score_gemma":0.00015777833,"threshold_uncertainty_score":0.3855315},"labels":[],"label_agreement":null},{"id":"W2058854006","doi":"10.1016/j.cl.2009.12.002","title":"Isolating untrusted software extensions by custom scoping rules","year":2010,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Security and Verification in Computing","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 Regina; University of Calgary","funders":"","keywords":"Computer science; Visibility; Security policy; Java; Programming language; Access control; Software; Control (management); Core (optical fiber); Architecture; Code (set theory); Operating system; Software engineering; Artificial intelligence; Set (abstract data type)","score_opus":0.009951291997882314,"score_gpt":0.26495902796880855,"score_spread":0.25500773597092624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058854006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1489589,0.0015744563,0.84318155,0.00014943955,0.004524807,0.00037425582,0.000018479412,0.001009336,0.00020875967],"genre_scores_gemma":[0.7692023,0.000004658851,0.22921044,0.0003260799,0.0011385821,0.000015210541,0.000031609405,0.00002755146,0.000043572538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976616,0.00016896696,0.0005403033,0.00073617796,0.0003934502,0.0004994981],"domain_scores_gemma":[0.9978471,0.00042743867,0.00031641655,0.0010267668,0.00019908042,0.0001832221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031674156,0.0003222732,0.00037339298,0.0001658403,0.00058781676,0.0009315241,0.0014389871,0.00021115379,0.000026724954],"category_scores_gemma":[0.000119316406,0.0002905748,0.000102173064,0.0003307892,0.00008392295,0.00043453812,0.00052845123,0.00055595656,0.000039674534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021105685,0.00020278833,0.009364974,0.0018460157,0.00035409146,0.0002567124,0.019265356,0.008696001,0.09323854,0.46362588,0.06372912,0.3393994],"study_design_scores_gemma":[0.0017716797,0.00017250511,0.014444117,0.0021545417,0.00005490942,0.0015146796,0.0009105303,0.9483365,0.007551537,0.0040753502,0.016257532,0.002756128],"about_ca_topic_score_codex":0.0002251719,"about_ca_topic_score_gemma":0.000014766375,"teacher_disagreement_score":0.93964046,"about_ca_system_score_codex":0.000031917305,"about_ca_system_score_gemma":0.00008218939,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W2060674139","doi":"10.1145/2240276.2240281","title":"Corrective Enforcement","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Flexibility (engineering); Set (abstract data type); Computer security; Property (philosophy); Programming language","score_opus":0.016544511836672434,"score_gpt":0.24211220588529916,"score_spread":0.22556769404862673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060674139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077010063,0.00003814168,0.9811885,0.00020414084,0.0012105926,0.00021637909,0.000007296268,0.00028317183,0.009150805],"genre_scores_gemma":[0.9957688,0.000014862922,0.0037834935,0.00033833634,0.000038798175,0.000035429603,0.0000045336296,0.00000237306,0.000013409918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990748,0.000062832536,0.00032543595,0.00010267365,0.0002283567,0.00020587882],"domain_scores_gemma":[0.9991148,0.00011019825,0.00012287417,0.00043276828,0.00008900622,0.00013033678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045921528,0.0001088221,0.00010854124,0.00014701404,0.00038602826,0.00016590953,0.00031434078,0.000067736684,0.000026873697],"category_scores_gemma":[0.000020657691,0.00010404302,0.000045781693,0.00024539483,0.00002073239,0.0024445392,0.000016829474,0.00014969643,0.00017437103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021982158,0.0001337918,0.0003667274,0.00021431436,0.00005024338,2.6983398e-7,0.05282685,0.0004141458,0.000006551926,0.79727376,0.00043579025,0.1482556],"study_design_scores_gemma":[0.0032203523,0.00046148727,0.0073609343,0.00038270676,0.00006792981,0.00047282455,0.029724088,0.6846369,0.0071079554,0.0041780774,0.26075438,0.0016323555],"about_ca_topic_score_codex":0.000043271422,"about_ca_topic_score_gemma":0.0000014774978,"teacher_disagreement_score":0.98806775,"about_ca_system_score_codex":0.00010221203,"about_ca_system_score_gemma":0.000025127623,"threshold_uncertainty_score":0.42427513},"labels":[],"label_agreement":null},{"id":"W2067128509","doi":"10.1007/s002530000445","title":"Microbial degradation of explosives: biotransformation versus mineralization","year":2000,"lang":"en","type":"review","venue":"Applied Microbiology and Biotechnology","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":351,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Biotechnology Research Institute","funders":"","keywords":"Biodegradation; Mineralization (soil science); Chemistry; Trinitrotoluene; Biotransformation; Phanerochaete; Microbial biodegradation; Lignin peroxidase; Environmental chemistry; Organic chemistry; Microorganism; Laccase; Bacteria; Enzyme; Nitrogen; Explosive material","score_opus":0.034804446777785304,"score_gpt":0.26962255326123075,"score_spread":0.23481810648344545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067128509","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.0001950508,0.92336726,0.07456133,0.00017090698,0.00047970482,0.00065900775,0.000041876425,0.000258558,0.00026631838],"genre_scores_gemma":[0.00029260616,0.991168,0.007896024,0.000040508716,0.000037408936,0.000034236393,0.00050421053,0.000012562215,0.000014416041],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842185,0.00008998734,0.00066624436,0.000543124,0.000032768756,0.0002460013],"domain_scores_gemma":[0.9989008,0.00014759033,0.00044691074,0.0004473549,0.000032289598,0.000025084957],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00016439597,0.00029980805,0.0007948454,0.00049547036,0.00012445332,0.000026607828,0.0007110263,0.0013850738,0.0000108592585],"category_scores_gemma":[0.000012294306,0.00027233,0.000112980364,0.0006036089,0.0003028503,0.00010499459,0.0001478114,0.00033888547,0.000032581338],"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.000013232085,0.000032976408,6.366932e-8,0.00097190926,0.00006343643,4.5339627e-7,0.00008244958,7.749116e-7,0.005569089,0.1071755,0.00011822065,0.8859719],"study_design_scores_gemma":[0.00047591576,0.00010276829,1.1938255e-7,0.0004697131,0.000117300006,0.00010223622,0.000017562217,0.000046429162,0.008974926,0.00024806752,0.98911434,0.000330624],"about_ca_topic_score_codex":0.0000056355752,"about_ca_topic_score_gemma":0.0000048995807,"teacher_disagreement_score":0.9889961,"about_ca_system_score_codex":0.00003903496,"about_ca_system_score_gemma":0.00009408306,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2073023830","doi":"10.1145/952532.952599","title":"A protection scheme for collaborative environments","year":2003,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Victoria","funders":"","keywords":"Scalability; Computer science; Usability; Access control; Scheme (mathematics); Computer security; Collaborative software; Computer security model; Distributed computing; Computer network; World Wide Web; Database; Human–computer interaction","score_opus":0.041579225073724274,"score_gpt":0.25915812744178135,"score_spread":0.21757890236805708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073023830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0018363826,0.000018892068,0.99259925,0.00028205177,0.00015402616,0.00032545842,3.534938e-7,0.000055817025,0.0047277473],"genre_scores_gemma":[0.48914137,0.0000021650653,0.5097254,0.0002231588,0.000022799444,0.00012921724,5.674342e-7,0.0000031606864,0.0007521774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999551,0.000030480422,0.00008135961,0.00017217732,0.000072980954,0.000092028575],"domain_scores_gemma":[0.99972045,0.000029457007,0.000037459846,0.00016427226,0.000023972963,0.000024412004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001695457,0.00004309965,0.000039689257,0.000023715074,0.00012829462,0.000055791817,0.00013981688,0.000025211319,0.000013737298],"category_scores_gemma":[0.000054531007,0.000041453313,0.000016505255,0.00018040293,0.000010594951,0.00017522046,0.0000169927,0.000030152882,0.000030966377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001911976,0.000043848413,0.00004399292,0.0000041447793,0.0000062950344,1.15106566e-7,0.00043184415,0.00003691963,0.004236265,0.989762,0.00045538283,0.004977259],"study_design_scores_gemma":[0.00072183344,0.00015139226,0.00028446462,0.0000074659856,0.0000019809431,0.0000060118296,0.00021202686,0.16922428,0.15022868,0.02347445,0.65544796,0.00023946169],"about_ca_topic_score_codex":0.0000011473874,"about_ca_topic_score_gemma":4.2103704e-7,"teacher_disagreement_score":0.96628755,"about_ca_system_score_codex":0.000024970279,"about_ca_system_score_gemma":0.00002778235,"threshold_uncertainty_score":0.16904171},"labels":[],"label_agreement":null},{"id":"W2081534288","doi":"10.1145/1188966.1188992","title":"Adaptiveness in well-typed Java bytecode verification","year":2006,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Bytecode; Computer science; Programming language; Java bytecode; Java; Security testing; Implementation; Operating system; Real time Java; Java annotation; Cloud computing security; Security information and event management","score_opus":0.01060783102761896,"score_gpt":0.22170835827826244,"score_spread":0.2111005272506435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081534288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06192076,0.00006684868,0.8996731,0.0007227262,0.0002678428,0.000099797886,2.1198647e-7,0.00020156291,0.037047144],"genre_scores_gemma":[0.9690167,0.000004200538,0.030307924,0.00012437005,0.000060245526,0.000008231212,0.0000036008792,0.0000037918803,0.0004709763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991665,0.00005217418,0.00021187241,0.00028084475,0.00013142511,0.00015720732],"domain_scores_gemma":[0.99943703,0.00006747144,0.000056479064,0.00037024912,0.0000464468,0.000022290847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026137105,0.00007139156,0.000077063385,0.000097140444,0.00006736726,0.000083576684,0.00048508952,0.000048029633,0.000042690863],"category_scores_gemma":[0.000011386482,0.00007374193,0.000023557941,0.0004403753,0.00001827193,0.00026427867,0.00006434787,0.00007653745,0.00019786655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058191013,0.00014410497,0.0045622704,0.0000093661065,0.0000023634475,0.000004160854,0.0003414687,0.0030313162,0.0021299294,0.9773307,0.001540799,0.0108977035],"study_design_scores_gemma":[0.00059805176,0.000031043037,0.14510524,0.000025397165,0.0000018389031,0.000009872127,0.00010019287,0.7713565,0.01901872,0.02297996,0.04040988,0.00036327724],"about_ca_topic_score_codex":0.00036982287,"about_ca_topic_score_gemma":0.000058224254,"teacher_disagreement_score":0.9543507,"about_ca_system_score_codex":0.00004441632,"about_ca_system_score_gemma":0.000037085232,"threshold_uncertainty_score":0.3007109},"labels":[],"label_agreement":null},{"id":"W2085186713","doi":"10.1088/1742-6596/256/1/012024","title":"MPI Enhancements in John the Ripper","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Security and Verification in Computing","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":"Sheridan College","funders":"","keywords":"Password; Computer science; Password cracking; Password strength; Workload; Computer security; Operating system; One-time password","score_opus":0.024098610946837726,"score_gpt":0.2666827810986613,"score_spread":0.24258417015182354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085186713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39114004,0.000045713743,0.5987219,0.0047866525,0.0022790807,0.00008590941,7.657139e-7,0.000020313875,0.0029195827],"genre_scores_gemma":[0.99206513,0.000028855891,0.0074091656,0.0001807697,0.00025915724,0.0000014267537,1.6629939e-7,0.00000273171,0.000052578285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991863,0.0000476439,0.00028581946,0.000098408,0.0002452025,0.0001366667],"domain_scores_gemma":[0.99907035,0.00007643171,0.0002798985,0.00027142384,0.0002655329,0.000036391044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041389704,0.00007636942,0.00012339717,0.00003813347,0.00010240341,0.0002184173,0.00094942853,0.000031293326,0.000023197146],"category_scores_gemma":[0.000054945118,0.000053244952,0.000049534665,0.00023180989,0.000086221226,0.0009482074,0.000106106716,0.00044062207,0.00001089319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010297318,0.000086058964,0.001213906,0.000007931279,0.000014659649,0.000005600282,0.005674614,0.000048505037,0.028180063,0.81627166,0.0002523549,0.14823435],"study_design_scores_gemma":[0.0008949361,0.00031505377,0.028545497,0.00016802325,0.000013550744,0.00014553915,0.0012489338,0.009637435,0.5515902,0.37311867,0.03386679,0.0004553618],"about_ca_topic_score_codex":0.0000066602347,"about_ca_topic_score_gemma":0.000018915634,"teacher_disagreement_score":0.6009251,"about_ca_system_score_codex":0.000011185548,"about_ca_system_score_gemma":0.00017221665,"threshold_uncertainty_score":0.21712661},"labels":[],"label_agreement":null},{"id":"W2087072724","doi":"10.1016/j.cose.2008.04.003","title":"An aspect-oriented approach for the systematic security hardening of code","year":2008,"lang":"en","type":"article","venue":"Computers & Security","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Software security assurance; Hardening (computing); Security testing; Computer security; Leverage (statistics); Security information and event management; Security service; Information security; Cloud computing security; Artificial intelligence; Operating system","score_opus":0.03443803637260593,"score_gpt":0.266494874496235,"score_spread":0.23205683812362907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087072724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034696966,0.000691336,0.96168995,0.00023292618,0.0009371381,0.0011659373,0.000014844943,0.00033785822,0.00023302744],"genre_scores_gemma":[0.9165872,0.000022091686,0.08284151,0.00021293195,0.00021702098,0.00007984801,0.000016574877,0.000016841685,0.0000059935396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971947,0.00035449833,0.0007499369,0.0007211058,0.0005383655,0.00044139024],"domain_scores_gemma":[0.9963914,0.0009781218,0.0004954001,0.0015831437,0.00039554323,0.00015639544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012988119,0.0002815424,0.0005587859,0.00012842106,0.00079774193,0.00014085915,0.0024587496,0.00011899468,0.0000027566534],"category_scores_gemma":[0.00013883664,0.00022925633,0.00025208978,0.0006438864,0.00023657709,0.00049768237,0.00034530254,0.00030934048,0.0000043600207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012099101,0.0025788762,0.0024677159,0.015296783,0.0006600659,0.000034625384,0.16103199,0.017578805,0.00047624588,0.78770214,0.010600874,0.0014508575],"study_design_scores_gemma":[0.0005385778,0.00013579121,0.00054806727,0.00024273747,0.000033338725,0.000111697525,0.00037811106,0.993974,0.0007259071,0.0025007143,0.0005278485,0.00028322986],"about_ca_topic_score_codex":0.000043269516,"about_ca_topic_score_gemma":0.000004395713,"teacher_disagreement_score":0.9763952,"about_ca_system_score_codex":0.00007145733,"about_ca_system_score_gemma":0.00011772361,"threshold_uncertainty_score":0.9348802},"labels":[],"label_agreement":null},{"id":"W2091461111","doi":"10.1145/2462476.2465577","title":"Dr. Horrible's fork bomb","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Executable; Fork (system call); Computer science; Buffer overflow; Representation (politics); Integer (computer science); Stack (abstract data type); Computer security; Operating system; Law; Political science","score_opus":0.021217505428779364,"score_gpt":0.24454613827207425,"score_spread":0.22332863284329488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091461111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008105848,0.000042000847,0.937503,0.0050272173,0.0003883943,0.000100854195,7.6951764e-8,0.000332865,0.048499785],"genre_scores_gemma":[0.9002144,0.000004227279,0.09532644,0.0018371539,0.000099026605,0.000017207947,6.063716e-7,0.0000036896015,0.0024972714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938667,0.000017964532,0.00011800533,0.00019352643,0.00011835532,0.00016550493],"domain_scores_gemma":[0.9993784,0.00006332775,0.000031268046,0.00040126368,0.00006382084,0.000061962906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001092805,0.000056057397,0.000055075634,0.000039747898,0.000108174914,0.00025482796,0.00063295296,0.00003128343,0.00030368878],"category_scores_gemma":[0.000019310735,0.000048932114,0.000029816743,0.00023371272,0.000014940389,0.00046392175,0.00014879696,0.00006160355,0.0014967661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.9409663e-7,0.000029287345,0.00067723135,0.000004503432,0.000004821475,6.4681757e-7,0.00041405944,0.000026602955,0.0002642364,0.83917373,0.09208238,0.06732232],"study_design_scores_gemma":[0.00030339826,0.00006829971,0.017839635,0.000017036276,0.0000021680705,0.000022424661,0.0001238215,0.66818035,0.0069702296,0.098692805,0.20735621,0.00042363323],"about_ca_topic_score_codex":0.00009310588,"about_ca_topic_score_gemma":0.0000016329268,"teacher_disagreement_score":0.89210856,"about_ca_system_score_codex":0.000011527034,"about_ca_system_score_gemma":0.00001997362,"threshold_uncertainty_score":0.9992807},"labels":[],"label_agreement":null},{"id":"W2092423386","doi":"10.5555/1298455.1298482","title":"Splitting interfaces: making trust between applications and operating systems configurable","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":176,"is_retracted":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; Operating system; Commodity; Interface (matter); Overhead (engineering); Routing (electronic design automation); Context (archaeology); Implementation; System call; Code (set theory); Trusted Computing; Embedded system; Limiting; Engineering; Programming language","score_opus":0.03242877942569101,"score_gpt":0.31646870791709014,"score_spread":0.28403992849139914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092423386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084928714,0.0005824117,0.8951245,0.00062622206,0.00009561392,0.00027713255,0.0000012369801,0.00027783087,0.018086338],"genre_scores_gemma":[0.97361845,0.0000022349966,0.02548334,0.000053522326,0.00021877902,0.0000333549,0.000002708959,0.000008022385,0.0005795606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990009,0.00005342627,0.0002526835,0.0003410726,0.0001323677,0.0002195325],"domain_scores_gemma":[0.9992478,0.00017614542,0.00013533002,0.0003362226,0.000066232205,0.000038286667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037048207,0.00010771554,0.000147424,0.000056202265,0.00040037555,0.0006080114,0.00040000587,0.000051562023,0.000005460622],"category_scores_gemma":[0.000018497467,0.00011171072,0.0000169284,0.00025421026,0.000037218004,0.00022606691,0.00014049582,0.00013208356,0.000023353263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000158492,0.00004899015,0.014318395,0.00027119002,0.00003762428,0.00000384085,0.0071533155,0.0050623096,0.0052253017,0.95001817,0.00081281294,0.017046476],"study_design_scores_gemma":[0.0006936435,0.00008143261,0.007520957,0.00029942763,0.000053941265,0.00008447639,0.0062058945,0.88837713,0.010864995,0.0033814674,0.0814243,0.001012322],"about_ca_topic_score_codex":0.00026531314,"about_ca_topic_score_gemma":0.0000025496042,"teacher_disagreement_score":0.9466367,"about_ca_system_score_codex":0.000034980785,"about_ca_system_score_gemma":0.000025203008,"threshold_uncertainty_score":0.58630675},"labels":[],"label_agreement":null},{"id":"W2092471675","doi":"10.1145/2593686","title":"Cloud security","year":2014,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Cloud computing; Computer security; Cloud computing security; Operating system","score_opus":0.04093434147680153,"score_gpt":0.2896691493521417,"score_spread":0.2487348078753402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092471675","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094763815,0.0019189911,0.30361104,0.52665776,0.0027377335,0.0006576134,0.0000069861094,0.00067678746,0.06896926],"genre_scores_gemma":[0.8319773,0.000025379568,0.16759957,0.00034113706,0.000028568878,0.000004695314,5.6558497e-7,0.0000023752943,0.000020387306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926007,0.00024966785,0.00018053433,0.00010988379,0.000116169576,0.000083704515],"domain_scores_gemma":[0.9572643,0.0005212607,0.00014230392,0.041951668,0.0000974433,0.000023017776],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00054725946,0.00004861159,0.0000734999,0.000027651378,0.0003030082,0.000037430156,0.055235863,0.000029599685,0.0000028094266],"category_scores_gemma":[0.005112044,0.00003889272,0.00006231479,0.00033302116,0.00014444655,0.00011255036,0.026573911,0.00014597732,0.000023559614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.1499006e-7,0.00005468174,0.00065950776,0.0000057213283,0.000005702281,4.9881606e-9,0.0011085753,0.000024140256,0.00019405833,0.9839782,0.011019708,0.0029491528],"study_design_scores_gemma":[0.00010402676,0.000013252912,0.0024702472,0.00002457534,0.0000043229434,0.0000030129743,0.00003134455,0.061832074,0.0024473243,0.81507385,0.11791685,0.000079110636],"about_ca_topic_score_codex":0.00001811129,"about_ca_topic_score_gemma":0.000006714403,"teacher_disagreement_score":0.7372135,"about_ca_system_score_codex":0.000013193683,"about_ca_system_score_gemma":0.00002625298,"threshold_uncertainty_score":0.981299},"labels":[],"label_agreement":null},{"id":"W2093406244","doi":"10.1145/1095809.1095826","title":"The taser intrusion recovery system","year":2005,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":137,"is_retracted":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; Computer security; Process (computing); Set (abstract data type); Intrusion; File system; Intrusion detection system; Operating system","score_opus":0.02358958566077081,"score_gpt":0.2759263164955433,"score_spread":0.2523367308347725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093406244","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.0032419926,0.7552236,0.20337503,0.01906827,0.006558208,0.0031624902,0.0000066913744,0.0013711746,0.007992541],"genre_scores_gemma":[0.87474793,0.048034262,0.06430658,0.006724173,0.0035567465,0.00070344243,0.000021611313,0.00007856958,0.0018266912],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730706,0.0006166727,0.0008952385,0.00045550516,0.00039805702,0.00032746047],"domain_scores_gemma":[0.9966744,0.0007393891,0.00034047657,0.0019293281,0.00022804749,0.00008832429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030650597,0.0001970988,0.00035087005,0.000033418564,0.0010416288,0.00083985185,0.0022756713,0.00006597449,0.0000058295823],"category_scores_gemma":[0.0010226103,0.00013017953,0.0001080267,0.00047407136,0.000026742207,0.00054070994,0.00053826906,0.00022379427,0.00045823058],"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.0000023398802,0.000053319738,0.00013716202,0.0066083386,0.000081885104,0.000013904224,0.00074436184,0.0025044084,0.00038763497,0.28631988,0.075234175,0.6279126],"study_design_scores_gemma":[0.00018036655,0.00005251269,0.00004225188,0.0139948735,0.000022698852,0.00029619204,0.00017334161,0.16606522,0.00018198363,0.000033931083,0.8185324,0.00042420652],"about_ca_topic_score_codex":0.00004875982,"about_ca_topic_score_gemma":0.000004361499,"teacher_disagreement_score":0.8715059,"about_ca_system_score_codex":0.00016489341,"about_ca_system_score_gemma":0.00009540448,"threshold_uncertainty_score":0.8098711},"labels":[],"label_agreement":null},{"id":"W2095191056","doi":"10.1109/hst.2008.4559063","title":"Extended abstract: An embedded flash memory vault for software Trojan protection","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Rockwell Automation (Canada)","funders":"","keywords":"Firmware; Trojan; Embedded system; Computer science; Embedded software; Vault (architecture); Software; Operating system; Buffer overflow; Booting; Flash (photography); Avionics software; Flash memory; Software system; Computer security; Component-based software engineering; Engineering","score_opus":0.06828192312980677,"score_gpt":0.28526775408325405,"score_spread":0.21698583095344728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095191056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06668201,0.000014129972,0.9298444,0.00022924945,0.0004680952,0.00048788387,0.0000014522384,0.00074123614,0.0015315587],"genre_scores_gemma":[0.6854281,0.0000030757003,0.3127215,0.00035307714,0.00024074064,0.00010647927,0.000007124624,0.000011880409,0.0011280245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998809,0.00003018854,0.0002541325,0.00044630838,0.00021410528,0.00024630027],"domain_scores_gemma":[0.9989947,0.00007949101,0.0001081975,0.00053756207,0.00017940742,0.0001006257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027261674,0.00012305811,0.000122030244,0.00008464888,0.00046853765,0.00010216273,0.0005760479,0.000089696085,0.000044894008],"category_scores_gemma":[0.000100896286,0.00012016717,0.00007589134,0.00021576427,0.000037324462,0.0007177734,0.000058736845,0.00012685085,0.00006284113],"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.00009838044,0.0011626863,0.00014262088,0.00017928607,0.00006481608,0.000026069907,0.016406031,0.0017068014,0.013630613,0.050907385,0.013347697,0.9023276],"study_design_scores_gemma":[0.0026896119,0.0008130549,0.026496405,0.000050367154,0.000014755325,0.00038213743,0.0005313876,0.80190724,0.11466074,0.024011021,0.027141755,0.001301513],"about_ca_topic_score_codex":0.000022463948,"about_ca_topic_score_gemma":0.000008015094,"teacher_disagreement_score":0.90102607,"about_ca_system_score_codex":0.00003707855,"about_ca_system_score_gemma":0.000086689695,"threshold_uncertainty_score":0.4900275},"labels":[],"label_agreement":null},{"id":"W2095443555","doi":"10.1145/363516.363523","title":"Proof linking","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Bytecode; Programming language; Code (set theory); Implementation; Modular design; Distributed computing; Java; Set (abstract data type)","score_opus":0.0799470620929626,"score_gpt":0.3050163120891167,"score_spread":0.22506924999615413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095443555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.012061008,0.00016271255,0.98655397,0.00028513517,0.00038790115,0.00006211019,0.0000010429899,0.00045620144,0.000029896806],"genre_scores_gemma":[0.101160556,0.00006330212,0.89834994,0.00021493442,0.000047212387,0.000017250199,7.8599186e-7,0.000009250524,0.00013679503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918216,0.00010239048,0.00015196332,0.00029128135,0.00007801302,0.00019419653],"domain_scores_gemma":[0.99829745,0.0011471986,0.000019940822,0.0004467955,0.000022791488,0.00006582191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004588872,0.00010813539,0.00013854745,0.00011153221,0.00014997766,0.00004133448,0.00037190825,0.0000951539,0.00004732029],"category_scores_gemma":[0.00017585729,0.000113356575,0.00004304065,0.00023358804,0.000020947795,0.00013016014,0.0000080751815,0.0002511673,0.000014811871],"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.000005437557,0.000026001931,0.000025360418,0.00002462696,0.000020331088,0.0000032114788,0.0008758584,0.042644434,0.00015178687,0.00288325,0.000008008397,0.9533317],"study_design_scores_gemma":[0.0027314343,0.0010893822,0.0076400694,0.0004951074,0.00012182226,0.0013843916,0.00013504377,0.6450867,0.063252315,0.029566208,0.24594525,0.0025522523],"about_ca_topic_score_codex":0.0000067487194,"about_ca_topic_score_gemma":5.5542296e-7,"teacher_disagreement_score":0.95077944,"about_ca_system_score_codex":0.000014845435,"about_ca_system_score_gemma":0.000016766715,"threshold_uncertainty_score":0.4622547},"labels":[],"label_agreement":null},{"id":"W2098667330","doi":"10.1007/978-1-4471-2297-5_4","title":"Separating Safety and Control Systems to Reduce Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Security and Verification in Computing","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":"McMaster University","funders":"","keywords":"Computer science; Control (management); Artificial intelligence","score_opus":0.06717427937451569,"score_gpt":0.28632068126028887,"score_spread":0.21914640188577317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098667330","genre_codex":"methods","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.000011213337,0.00097120635,0.61182475,0.0005425263,0.0007417776,0.00037892457,0.000011534271,0.00020983169,0.38530824],"genre_scores_gemma":[0.46637732,0.00018536678,0.105885215,0.004051379,0.0032085797,0.00004023593,0.000037146765,0.00011264337,0.42010212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839693,0.00004488769,0.0004715153,0.0005247871,0.00027927675,0.0002825962],"domain_scores_gemma":[0.99849826,0.00024167252,0.0002309538,0.0006544894,0.00013927252,0.00023533049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005966693,0.00025897834,0.0004038804,0.000100378966,0.0002730688,0.00029715683,0.0006188675,0.00018485887,0.000060805],"category_scores_gemma":[0.000023779852,0.00025334966,0.000060176913,0.0000438713,0.00006172019,0.0002046095,0.00030815127,0.00026387046,0.00022693121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054355382,0.000004617663,0.0000046025607,0.000034140532,0.000023464117,9.214312e-7,0.00031096482,0.00006408369,0.000027689166,0.9912287,0.0008952348,0.007400147],"study_design_scores_gemma":[0.0005127501,0.00007652628,0.00015862766,0.0003054957,0.000030182004,0.000120575816,0.00002792621,0.12731442,0.00005750747,0.0095087765,0.86099696,0.00089023757],"about_ca_topic_score_codex":0.000047383655,"about_ca_topic_score_gemma":0.0000045584698,"teacher_disagreement_score":0.9817199,"about_ca_system_score_codex":0.0000720043,"about_ca_system_score_gemma":0.000051469047,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2098769150","doi":"","title":"Redesigning secure element access control for NFC enabled android smartphones using mobile trusted computing","year":2013,"lang":"en","type":"article","venue":"International Conference on Information Society","topic":"Security and Verification in Computing","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":"Concordia University of Edmonton","funders":"","keywords":"Android (operating system); Computer science; Access control; Trusted Network Connect; Trusted Platform Module; Direct Anonymous Attestation; Trusted Computing; Near field communication; Mobile device; Payment; Computer security; Embedded system; Operating system; World Wide Web; Telecommunications","score_opus":0.05428025217324518,"score_gpt":0.32513066444948413,"score_spread":0.27085041227623896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098769150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04363928,0.000009247518,0.9512754,0.0010847688,0.000977775,0.0009114418,0.00002253267,0.00019609078,0.0018834523],"genre_scores_gemma":[0.9467863,0.000013875962,0.050660633,0.0021078654,0.00016210429,0.00015849542,0.0000718149,0.0000070481037,0.000031865096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982087,0.000051792787,0.00067215273,0.00026741077,0.0005008865,0.00029907786],"domain_scores_gemma":[0.9976042,0.00024639035,0.00054822036,0.00027434222,0.0012417923,0.000085059866],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005602213,0.00019517035,0.00019437764,0.000115730734,0.00043678467,0.001727475,0.0011347027,0.000111355774,0.00017885861],"category_scores_gemma":[0.00007037808,0.00019542029,0.00016231897,0.00024598616,0.00004177883,0.0037639418,0.00018454435,0.0001926246,0.000054997738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011740317,0.0003222876,0.0041579558,0.00027918484,0.00064825895,9.2799735e-7,0.03185058,0.12306941,0.005718711,0.67112285,0.028905192,0.13380721],"study_design_scores_gemma":[0.001200869,0.000057846562,0.00079569774,0.00008117528,0.00000585673,0.000005242163,0.00093713286,0.9891779,0.0013807928,0.0027490645,0.003382735,0.0002256939],"about_ca_topic_score_codex":0.000057693367,"about_ca_topic_score_gemma":7.8039454e-7,"teacher_disagreement_score":0.90314704,"about_ca_system_score_codex":0.00020633668,"about_ca_system_score_gemma":0.00018193459,"threshold_uncertainty_score":0.9993088},"labels":[],"label_agreement":null},{"id":"W2099064219","doi":"10.1016/j.cosrev.2012.01.001","title":"Which security policies are enforceable by runtime monitors? A survey","year":2012,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Set (abstract data type); Implementation; Computer security; Security policy; Programming language","score_opus":0.041411101487930924,"score_gpt":0.31509025236652277,"score_spread":0.27367915087859185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099064219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014862149,0.086656384,0.8879098,0.0032518243,0.004037587,0.00081900804,0.000016025151,0.00063775596,0.0018094311],"genre_scores_gemma":[0.9633228,0.007941581,0.024456663,0.0036609005,0.00051132625,0.000029441971,0.000009710158,0.000015697797,0.000051879248],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965975,0.00031026232,0.0005423416,0.000707,0.0008386983,0.0010041737],"domain_scores_gemma":[0.99694806,0.00024808574,0.00036861753,0.0014031698,0.00058029185,0.0004517913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005353291,0.00027633974,0.0004614094,0.00015901537,0.00068585225,0.0006100166,0.0035265316,0.000065709195,0.00002369617],"category_scores_gemma":[0.0002976813,0.00024865146,0.00009840626,0.0040343604,0.00024185695,0.0025590793,0.0012318676,0.00026002206,0.00031229804],"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.0000064355904,0.0016634002,0.21447127,0.004833206,0.00010730235,0.0000054299485,0.009981973,0.00016594164,0.0005469839,0.13375704,0.40028143,0.2341796],"study_design_scores_gemma":[0.00069122796,0.00023439727,0.17319551,0.006825457,0.00005793183,0.0003118172,0.00004656611,0.43959442,0.0039788866,0.0019320225,0.36996198,0.003169797],"about_ca_topic_score_codex":0.00014279303,"about_ca_topic_score_gemma":0.0000048726406,"teacher_disagreement_score":0.94846064,"about_ca_system_score_codex":0.00012910875,"about_ca_system_score_gemma":0.0002294875,"threshold_uncertainty_score":0.9999966},"labels":[],"label_agreement":null},{"id":"W2100900784","doi":"10.5555/1894483.1894524","title":"A wiki for Mizar: motivation, considerations, and initial prototype","year":2010,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Security and Verification in Computing","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 Alberta","funders":"","keywords":"Computer science; Focus (optics); Field (mathematics); Software engineering; Programming language","score_opus":0.05854665833522479,"score_gpt":0.3276158500955672,"score_spread":0.26906919176034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100900784","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.9086646,0.00006202734,0.07359529,0.012968206,0.00014837817,0.0015351408,0.000019771713,0.0003518032,0.0026547902],"genre_scores_gemma":[0.9412976,0.000009819416,0.058546916,0.0000189931,0.000025394867,0.0000049980545,0.0000042281904,0.0000044269527,0.00008763729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900925,0.000038326612,0.00014557577,0.0003231948,0.00023473322,0.00024893598],"domain_scores_gemma":[0.9985352,0.0002754353,0.0000957623,0.00041808235,0.00060883653,0.000066677414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070847844,0.00007477033,0.00013164036,0.0005120536,0.0005140603,0.000045985424,0.00056347926,0.00020008064,0.000050635867],"category_scores_gemma":[0.00080272055,0.000089661364,0.000034990615,0.00055026077,0.0004979501,0.0003098756,0.00035811006,0.00045791888,0.0000072869175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003575637,0.00013899305,0.0034858224,0.000055919998,0.000037101177,0.000032259115,0.00067002134,0.0000041384073,0.008222801,0.9667013,0.0033716308,0.017244257],"study_design_scores_gemma":[0.0055689104,0.00221805,0.019256908,0.0002219444,0.000038775856,0.00036703926,0.0048465584,0.038859382,0.0942361,0.6296361,0.20362805,0.0011221542],"about_ca_topic_score_codex":0.000082502826,"about_ca_topic_score_gemma":0.00010190328,"teacher_disagreement_score":0.3370652,"about_ca_system_score_codex":0.000016025313,"about_ca_system_score_gemma":0.00025479516,"threshold_uncertainty_score":0.39537883},"labels":[],"label_agreement":null},{"id":"W2104507782","doi":"10.22215/etd/2010-09582","title":"Security mechanisms and policy for mandatory access control in computer systems","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Access control; Security policy; Computer security; Control (management); Political science; Computer science; Public administration; Artificial intelligence","score_opus":0.015441481006183448,"score_gpt":0.3071645296156476,"score_spread":0.2917230486094642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104507782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069975015,0.00016526238,0.98630846,0.00028887222,0.004216331,0.0009946103,0.000018401899,0.00016480296,0.0008457468],"genre_scores_gemma":[0.9728701,0.000039617298,0.023641901,0.001120836,0.0013486659,0.00030727824,0.00018783653,0.000038514478,0.00044525534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832284,0.00007340116,0.00044181957,0.00064229674,0.00021785266,0.00030176624],"domain_scores_gemma":[0.9986956,0.00027382068,0.00026716013,0.00047645764,0.00018700687,0.000099945384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005733107,0.00025032452,0.00038617372,0.00040830675,0.00015940295,0.0008166503,0.0011342316,0.00043482287,0.000005077003],"category_scores_gemma":[0.00003850665,0.0002504203,0.000068845344,0.00025058596,0.00001832719,0.00045160725,0.00011060327,0.00039792474,0.0000044950557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026166896,0.00006671916,0.00005610197,0.0005552824,0.000028545908,0.0000029704738,0.0014928243,0.000117158845,0.0001571302,0.9868642,0.0009016493,0.009731248],"study_design_scores_gemma":[0.0013769139,0.00007126633,0.0014443896,0.00017190755,0.000013096969,0.0000132770665,0.000105752406,0.9501801,0.00039540103,0.041330643,0.0043755374,0.000521689],"about_ca_topic_score_codex":0.00041212322,"about_ca_topic_score_gemma":0.00043153513,"teacher_disagreement_score":0.9658726,"about_ca_system_score_codex":0.0000513247,"about_ca_system_score_gemma":0.00022663671,"threshold_uncertainty_score":0.9999948},"labels":[],"label_agreement":null},{"id":"W2105528199","doi":"10.1145/1165389.945463","title":"Implementing an untrusted operating system on trusted hardware","year":2003,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":79,"is_retracted":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; Operating system; Embedded system; Trusted Computing; Trusted Platform Module; Embedded operating system; Context (archaeology); Memory protection; Architecture; Direct Anonymous Attestation; Context switch; Computer hardware; Virtual memory; Software; Memory management; Overlay","score_opus":0.05117373143572124,"score_gpt":0.31715866549178756,"score_spread":0.2659849340560663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105528199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10016516,0.21512215,0.56206,0.0036289822,0.01712718,0.019266559,0.00008447758,0.009657275,0.0728882],"genre_scores_gemma":[0.95205146,0.00048915896,0.044705823,0.0016540327,0.0004162836,0.00035206467,0.00004210387,0.00007296955,0.0002160868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934335,0.0020863155,0.0016946354,0.0011711625,0.0007075999,0.00090682454],"domain_scores_gemma":[0.99541205,0.00049771456,0.00063020387,0.0026986862,0.0005017001,0.00025961662],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0054463097,0.00048871327,0.00087471417,0.00013642613,0.0015662907,0.0014082901,0.002244207,0.00013422842,0.0000395503],"category_scores_gemma":[0.0021999914,0.00043611307,0.00015627277,0.001113472,0.000026004382,0.00094954146,0.00038467345,0.0004289613,0.0001756185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020006148,0.00019486577,0.0016276676,0.014285702,0.00016459168,0.000086032574,0.0025301871,0.0036327506,0.0018168321,0.9389729,0.0030437796,0.033642698],"study_design_scores_gemma":[0.0026315113,0.00088227185,0.00035180856,0.07917092,0.00020674047,0.0018120774,0.0065415,0.66078085,0.0037471035,0.00007499791,0.23999922,0.003800997],"about_ca_topic_score_codex":0.00012040899,"about_ca_topic_score_gemma":0.000005945837,"teacher_disagreement_score":0.9388979,"about_ca_system_score_codex":0.0002484433,"about_ca_system_score_gemma":0.00021649619,"threshold_uncertainty_score":0.9998091},"labels":[],"label_agreement":null},{"id":"W2106712039","doi":"10.1109/ase.2008.19","title":"Automatic Inference of Frame Axioms Using Static Analysis","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Axiom; Computer science; Theoretical computer science; Pointer (user interface); Inference; Frame (networking); Static analysis; Separation logic; Set (abstract data type); Algorithm; Class (philosophy); Data mining; Programming language; Artificial intelligence; Mathematics","score_opus":0.07359833210321999,"score_gpt":0.3195067762571025,"score_spread":0.24590844415388252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106712039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42725807,0.000009309796,0.5723685,0.000037975697,0.000029976793,0.000025000398,2.5782197e-7,0.00006761232,0.00020325923],"genre_scores_gemma":[0.7745593,0.0000024748688,0.2253345,0.00007952357,0.000006454099,8.0380323e-7,5.938219e-7,0.0000015949948,0.000014724708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991099,0.000050280974,0.00029295305,0.00018766755,0.00022921417,0.00012998297],"domain_scores_gemma":[0.9990314,0.00022660504,0.00014417173,0.0004536093,0.00009957851,0.000044628774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000162596,0.00006782322,0.0001757966,0.00023072772,0.00010581945,0.00003273349,0.0005048687,0.000030661933,0.00010547711],"category_scores_gemma":[0.00007938382,0.00006300585,0.0000742531,0.0016266243,0.000058188678,0.00024351868,0.00010685584,0.00005858961,0.00001414587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039095576,0.0006921799,0.07696209,0.00026769217,0.0012105681,0.00003404456,0.046693906,0.12702149,0.0052895965,0.7058115,0.00022641204,0.03578659],"study_design_scores_gemma":[0.000052609237,0.000013042482,0.010854905,0.000010138188,0.000020416524,0.000005450245,0.00005200361,0.98664695,0.0010002211,0.0012587426,0.000009254843,0.00007625923],"about_ca_topic_score_codex":0.00017981093,"about_ca_topic_score_gemma":0.0000031126683,"teacher_disagreement_score":0.85962546,"about_ca_system_score_codex":0.000019489195,"about_ca_system_score_gemma":0.00008242885,"threshold_uncertainty_score":0.25693038},"labels":[],"label_agreement":null},{"id":"W2108026624","doi":"10.1109/hotos.1997.595180","title":"Customization lite [operating systems]","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Implementation; Extensibility; Personalization; Structuring; Block (permutation group theory); Software engineering; Operating system; Distributed computing; World Wide Web","score_opus":0.03376610035557967,"score_gpt":0.22541495621714486,"score_spread":0.1916488558615652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108026624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022207592,0.00023934606,0.9504448,0.00057029614,0.00047940962,0.00006976493,1.2078289e-7,0.00034620223,0.045629274],"genre_scores_gemma":[0.9656019,0.000010971738,0.03223054,0.00032756597,0.00011318186,0.000005043991,5.850162e-7,0.000003190368,0.0017069946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999375,0.000045676006,0.0001591202,0.00018315746,0.00012247288,0.00011460877],"domain_scores_gemma":[0.9995203,0.000054895532,0.000044097866,0.00027597413,0.000068359965,0.00003636519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000164986,0.000052098327,0.000056545075,0.000046260382,0.00016322808,0.00033706328,0.0003259306,0.00002916478,0.00006502957],"category_scores_gemma":[0.000036830086,0.000048256486,0.000017755736,0.0002817078,0.000007625133,0.00037962655,0.00006396867,0.00005219698,0.0003189501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.438199e-7,0.00006410281,0.00077136385,0.000029274663,0.000009381409,0.000003719025,0.003205413,0.012408287,0.00041600797,0.91668904,0.023929903,0.042473294],"study_design_scores_gemma":[0.00006922141,0.000006594518,0.00009285488,0.000009557201,5.560599e-7,0.000009853496,0.000027444248,0.98207814,0.00017653506,0.000040280363,0.017419882,0.00006908826],"about_ca_topic_score_codex":0.000012820691,"about_ca_topic_score_gemma":3.1553344e-7,"teacher_disagreement_score":0.9696698,"about_ca_system_score_codex":0.000018857632,"about_ca_system_score_gemma":0.0000049692044,"threshold_uncertainty_score":0.40995646},"labels":[],"label_agreement":null},{"id":"W2108048005","doi":"10.1109/icws.2009.139","title":"Behavioral Attestation for Business Processes","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Ottawa","funders":"","keywords":"Computer science; Business process; Vendor; Service-oriented architecture; Process management; Process (computing); Pledge; Trustworthiness; Business Process Execution Language; Workflow; Business process management; Service (business); Knowledge management; Software engineering; Computer security; Web service; Business; World Wide Web; Work in process; Database","score_opus":0.05125171301377426,"score_gpt":0.3257682597980475,"score_spread":0.2745165467842733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108048005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018689217,0.000018974093,0.97786975,0.002376949,0.00012000049,0.00010922414,4.0192054e-7,0.00019388288,0.0006216286],"genre_scores_gemma":[0.8285129,0.0000019402812,0.1708046,0.00051961344,0.00005187616,0.000008137134,0.000004106587,0.0000014462505,0.000095355004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958366,0.00000495732,0.000092565366,0.0001509925,0.00007365862,0.0000941627],"domain_scores_gemma":[0.99946547,0.00004908838,0.000035932237,0.00013865229,0.00029009642,0.000020766292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007411867,0.000042692966,0.00004120284,0.000032678017,0.00009640712,0.000121241275,0.000262279,0.00001922691,0.0000037009843],"category_scores_gemma":[0.000042977288,0.00004013085,0.00001127342,0.00036162586,0.0000061642872,0.00036355286,0.00001270069,0.000018657627,0.0000074940876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007407135,0.00036275727,0.0005523864,0.00006854143,0.000002484832,0.0000012310743,0.001930208,0.00032648345,0.0012475359,0.47547522,0.0047727562,0.515253],"study_design_scores_gemma":[0.0024842052,0.001042637,0.14178328,0.00014277191,0.000029654799,0.000066945766,0.0003490783,0.49806163,0.05605788,0.20777445,0.09060479,0.001602687],"about_ca_topic_score_codex":0.000004704678,"about_ca_topic_score_gemma":0.000002106515,"teacher_disagreement_score":0.8098237,"about_ca_system_score_codex":0.000009044359,"about_ca_system_score_gemma":0.00005589546,"threshold_uncertainty_score":0.16364886},"labels":[],"label_agreement":null},{"id":"W2114992698","doi":"10.1145/2382536.2382549","title":"Auditing cloud management using information flow tracking","year":2012,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Audit; Computer science; Computer security; Cloud computing security; Service provider; Cloud service provider; Service (business); Business; Accounting; Marketing","score_opus":0.03992177725457483,"score_gpt":0.26990464772487344,"score_spread":0.2299828704702986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114992698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01834204,0.000023033253,0.9613989,0.00011096266,0.0010398154,0.00007329293,1.711425e-7,0.00020414981,0.018807646],"genre_scores_gemma":[0.7117841,0.000002401652,0.28760546,0.00038996703,0.00019834985,0.0000016583047,0.0000013599406,0.0000018400178,0.00001482502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927056,0.000024997296,0.00020532325,0.0000848096,0.00017426688,0.00024005322],"domain_scores_gemma":[0.99954885,0.000034752877,0.00009320987,0.00022713459,0.000041160158,0.000054919405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545603,0.0000647852,0.00005283661,0.00008511383,0.00021234245,0.00022221851,0.0003047478,0.000026510552,0.000024205727],"category_scores_gemma":[0.000015222749,0.00006538889,0.00002833822,0.00025954755,0.000007954072,0.0027316008,0.00016249983,0.000062859355,0.00011544644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.21972e-7,0.000028576223,0.000989824,0.000037462905,0.000012636985,4.3965497e-7,0.0035927,0.0032536022,0.000030471432,0.44780767,0.0004869758,0.5437589],"study_design_scores_gemma":[0.00012982593,0.000003949204,0.002624312,0.000024890356,0.000004164873,0.000014556444,0.0002862606,0.96879,0.00092498295,0.0008995857,0.026145242,0.00015225382],"about_ca_topic_score_codex":0.000006395716,"about_ca_topic_score_gemma":1.430626e-7,"teacher_disagreement_score":0.96553636,"about_ca_system_score_codex":0.000049298178,"about_ca_system_score_gemma":0.000007671249,"threshold_uncertainty_score":0.26664817},"labels":[],"label_agreement":null},{"id":"W2115232057","doi":"10.1145/2465351.2465358","title":"Process firewalls","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Advanced Micro Devices (Canada)","funders":"Air Force Office of Scientific Research; Division of Computer and Network Systems; National Science Foundation","keywords":"Firewall (physics); Computer science; Computer security; System call; Application firewall; System administrator; Variety (cybernetics); Operating system; Access control; Stateful firewall; Network packet","score_opus":0.012489341988484823,"score_gpt":0.24584931376647826,"score_spread":0.23335997177799345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115232057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090255655,0.000024768948,0.8483515,0.0045127627,0.00023888059,0.00012364905,4.0267185e-8,0.00044113584,0.056051623],"genre_scores_gemma":[0.9766946,7.875609e-7,0.021807684,0.00095535605,0.000032823173,0.000012215111,1.662595e-7,0.0000014527342,0.00049493887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.000008954405,0.000076854754,0.00013502476,0.00008859681,0.000099155746],"domain_scores_gemma":[0.9996193,0.00003224393,0.000020719528,0.00022528204,0.00006523599,0.00003721221],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000057567973,0.000035176905,0.000033288943,0.000020618449,0.000059856182,0.00013387742,0.0004946024,0.00001731668,0.00024320168],"category_scores_gemma":[0.000015282458,0.000029682762,0.00001322764,0.00016034223,0.0000088813995,0.00041534548,0.000055653254,0.00003577816,0.0010382996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.1949958e-7,0.00009892773,0.002241259,0.00002628928,0.000009198465,0.0000013547459,0.0043292707,0.000095623174,0.0007435919,0.7814746,0.02745207,0.18352747],"study_design_scores_gemma":[0.00018000866,0.00003192596,0.015606175,0.000012544379,8.708824e-7,0.000014975567,0.00013163047,0.8594751,0.012773205,0.10065591,0.010836225,0.0002814716],"about_ca_topic_score_codex":0.000025410194,"about_ca_topic_score_gemma":3.9867214e-7,"teacher_disagreement_score":0.8864389,"about_ca_system_score_codex":0.0000051568036,"about_ca_system_score_gemma":0.000016606935,"threshold_uncertainty_score":0.9997395},"labels":[],"label_agreement":null},{"id":"W2115261982","doi":"10.1109/ares.2008.18","title":"Type and Effect Annotations for Safe Memory Access in C","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Alias; Aliasing; Programmer; Memory safety; Static analysis; Type inference; Programming language; Source code; Inference; Theoretical computer science; Data mining; Artificial intelligence; Software","score_opus":0.05872060294492728,"score_gpt":0.3323133548546027,"score_spread":0.27359275190967547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115261982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46920586,0.00011798938,0.5242024,0.0011844544,0.0003212591,0.00027389757,4.592291e-7,0.00010003306,0.00459365],"genre_scores_gemma":[0.98029715,0.000011831001,0.019131968,0.0003236103,0.000028309765,0.000012797987,0.000001208184,0.00000201321,0.0001911334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996151,0.000024070492,0.00008549639,0.00014531382,0.000048018086,0.00008202634],"domain_scores_gemma":[0.99947536,0.00030145698,0.000019930525,0.00013176397,0.000048297323,0.000023200268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015702215,0.000038440536,0.00005629405,0.000059496597,0.00010935766,0.00005019778,0.0002415009,0.000020470952,0.0000048139495],"category_scores_gemma":[0.000089404515,0.000035199104,0.00000951631,0.00031144448,0.000018882612,0.0002814148,0.00006951111,0.00003423587,0.0000060012767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001039788,0.0003445597,0.14535679,0.00031189222,0.000046288118,0.000034313234,0.01675463,0.0032683495,0.0018482759,0.54558384,0.046842642,0.23950444],"study_design_scores_gemma":[0.0016306575,0.00027320138,0.26079327,0.000030002357,0.000003872649,0.0000637929,0.000042368356,0.71171004,0.007417931,0.006470245,0.011202748,0.0003618531],"about_ca_topic_score_codex":0.000023268514,"about_ca_topic_score_gemma":0.000009000259,"teacher_disagreement_score":0.70844173,"about_ca_system_score_codex":0.000008192555,"about_ca_system_score_gemma":0.000029685774,"threshold_uncertainty_score":0.14353779},"labels":[],"label_agreement":null},{"id":"W2115353880","doi":"10.1109/csfw.1991.151583","title":"A proof of secrecy for a network security model","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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","funders":"","keywords":"Secrecy; Computer science; Argument (complex analysis); Covert; Computer security; Theoretical computer science; Covert channel; Formal proof; Channel (broadcasting); Security policy; Computer network; Mathematics; Mathematical proof; Philosophy","score_opus":0.05279950851002609,"score_gpt":0.2611858437729274,"score_spread":0.20838633526290132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115353880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002121215,0.00012469548,0.9886753,0.00054154167,0.000115628936,0.00020841535,0.0000011679559,0.000091763715,0.008120303],"genre_scores_gemma":[0.7828473,0.0000031343031,0.21659002,0.00025043145,0.00006785595,0.000018392171,5.037048e-7,0.0000030393219,0.00021932305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992928,0.000017776538,0.00019600579,0.00020528043,0.00011194877,0.00017620853],"domain_scores_gemma":[0.99934256,0.00010393337,0.000078025296,0.00033620064,0.00009846039,0.0000408265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023657532,0.00006244876,0.000104146595,0.000026889082,0.00008228685,0.000033897362,0.0004739138,0.00004057325,0.000023468414],"category_scores_gemma":[0.000030053401,0.000059173377,0.000060914837,0.00023297996,0.00001872826,0.0001657287,0.00009305732,0.000050445047,0.0000037296327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023497714,0.00009228651,0.000044496428,0.000037658836,0.000008368644,1.456855e-7,0.0018920194,0.024280641,0.000025632178,0.95175755,0.0098096235,0.012049235],"study_design_scores_gemma":[0.00013543747,0.000029265328,0.000005411107,0.000008687264,0.0000015352488,0.0000015460246,0.000006049576,0.8765169,0.00095508975,0.1208095,0.001465508,0.00006508546],"about_ca_topic_score_codex":0.000003661975,"about_ca_topic_score_gemma":0.0000024646574,"teacher_disagreement_score":0.8522363,"about_ca_system_score_codex":0.000009790915,"about_ca_system_score_gemma":0.000016199452,"threshold_uncertainty_score":0.24130203},"labels":[],"label_agreement":null},{"id":"W2116433890","doi":"10.1109/tdsc.2005.24","title":"Hardware-Assisted Circumvention of Self-Hashing Software Tamper Resistance","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Professional Communication","topic":"Security and Verification in Computing","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Computer science; Hash function; Tamper resistance; Software; Implementation; x86; Exploit; Hash table; PowerPC; Computer security; Embedded system; Operating system; Software engineering","score_opus":0.0299179685823152,"score_gpt":0.29349503608669036,"score_spread":0.26357706750437515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116433890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016522214,0.00031048912,0.9787984,0.002678687,0.0005231878,0.00025398735,0.000008866907,0.0004046969,0.0004994766],"genre_scores_gemma":[0.79151875,0.00009275802,0.20761971,0.00021283721,0.00002301179,0.00005485216,0.000009818977,0.000011489138,0.0004567604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980894,0.00041377117,0.00053940655,0.0003180118,0.00045104048,0.00018842053],"domain_scores_gemma":[0.99754965,0.00046685897,0.0003354197,0.0012683125,0.0003130966,0.00006667262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575661,0.00015075304,0.00017256406,0.00019634189,0.0007346096,0.000063740896,0.0011878328,0.00013435603,0.000049594262],"category_scores_gemma":[0.00002328592,0.00015835144,0.00012820055,0.00053800456,0.000059246482,0.0008611744,0.000015961554,0.00046865141,0.00004641172],"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.0003181083,0.007762146,0.0003178858,0.00057078747,0.00035826172,0.000002690819,0.021542894,0.021235107,0.018683141,0.14937061,0.0057306895,0.7741077],"study_design_scores_gemma":[0.0087859295,0.00051368587,0.05244039,0.0066043576,0.00030611677,0.000104559695,0.002117556,0.36504537,0.34799355,0.03150146,0.18066992,0.00391711],"about_ca_topic_score_codex":0.000010964566,"about_ca_topic_score_gemma":0.000032678123,"teacher_disagreement_score":0.7749965,"about_ca_system_score_codex":0.0001724147,"about_ca_system_score_gemma":0.00014486894,"threshold_uncertainty_score":0.6457384},"labels":[],"label_agreement":null},{"id":"W2116589549","doi":"10.1109/saso.2008.57","title":"A Framework for Self-Protecting Cryptographic Key Management","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Encryption; Key management; Cryptography; Computer security; Key (lock); Group key; Correctness; Data security","score_opus":0.04476276893711967,"score_gpt":0.277564779427706,"score_spread":0.23280201049058635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116589549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0074172476,0.000039399645,0.98599476,0.0006471224,0.00031647843,0.0003282739,1.4317067e-7,0.0006848034,0.0045717754],"genre_scores_gemma":[0.35146135,0.00001493058,0.6479716,0.00039629304,0.00006559872,0.00005019588,1.9165944e-7,0.000004089702,0.00003578407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.000030905045,0.00017021384,0.00032165326,0.0001563892,0.00022550525],"domain_scores_gemma":[0.9991844,0.00021499702,0.00006420894,0.00042805867,0.00005792324,0.000050384162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030817048,0.00008571207,0.000081542836,0.00010801473,0.00058381504,0.00008142038,0.0006057321,0.000052806277,0.000010173545],"category_scores_gemma":[0.000040069015,0.00008434741,0.000075096556,0.0005186433,0.000017811975,0.000164951,0.00014697867,0.00013093947,0.000026935604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013530463,0.00003982914,0.0001916731,0.000025406054,0.000019519788,0.000002921984,0.0013857166,0.000035855548,0.000007517866,0.99131507,0.0002750986,0.0067000263],"study_design_scores_gemma":[0.00079711224,0.00016465077,0.0059563834,0.00010126526,0.000014611723,0.0000874338,0.00040834228,0.37974805,0.0019202603,0.552971,0.057129603,0.00070131215],"about_ca_topic_score_codex":0.0000047757,"about_ca_topic_score_gemma":3.5192224e-7,"teacher_disagreement_score":0.4383441,"about_ca_system_score_codex":0.000016492715,"about_ca_system_score_gemma":0.000013604704,"threshold_uncertainty_score":0.44902924},"labels":[],"label_agreement":null},{"id":"W2118558829","doi":"10.1016/j.diin.2007.06.010","title":"Forensic memory analysis: From stack and code to execution history","year":2007,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":34,"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; Thread (computing); Call stack; Stack (abstract data type); Process (computing); Virtual memory; Operating system; Programming language; Parallel computing; Memory management; Overlay","score_opus":0.03766217992191722,"score_gpt":0.2444065722086764,"score_spread":0.20674439228675917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118558829","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.51312476,0.000109186694,0.48493513,0.0002524005,0.00020968216,0.0000647865,0.0000062304575,0.000107039945,0.001190804],"genre_scores_gemma":[0.98119247,0.0000010470162,0.017557884,0.00096684205,0.000074262454,0.0000028510472,0.000065061125,0.0000042042275,0.00013539052],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99907404,0.000017796963,0.00023139057,0.00032823303,0.00019955725,0.00014896445],"domain_scores_gemma":[0.99926984,0.00009997315,0.00009716879,0.0002858457,0.000086351334,0.00016080168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027477808,0.00008633764,0.000103017235,0.00021599086,0.000066635075,0.00018615149,0.00020584595,0.00004838851,0.0000044615317],"category_scores_gemma":[0.00010007329,0.000096632175,0.00003680096,0.0005285994,0.000067863235,0.0008779756,0.00008522354,0.000064061634,0.00004149069],"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.00006513961,0.00020204196,0.07852052,0.00006435303,0.00063093106,0.00003477987,0.055747077,0.0036891976,0.016007101,0.38895252,0.0352506,0.42083573],"study_design_scores_gemma":[0.0007353522,0.0001927247,0.42982933,0.000094888324,0.0001663305,0.000012901102,0.0010174771,0.40470642,0.03363398,0.0867823,0.04167089,0.001157415],"about_ca_topic_score_codex":0.00006171383,"about_ca_topic_score_gemma":0.000045530644,"teacher_disagreement_score":0.4680677,"about_ca_system_score_codex":0.00015496126,"about_ca_system_score_gemma":0.000041213098,"threshold_uncertainty_score":0.39405456},"labels":[],"label_agreement":null},{"id":"W2119543896","doi":"","title":"Compartmentalization architectures for protection of Internet credentials and transactions from CPU resident malware: Providing foolproof protection for critical credentials and transactions","year":2012,"lang":"en","type":"article","venue":"World Congress on Internet Security","topic":"Security and Verification in Computing","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":"Government of Canada; Department of National Defence","funders":"","keywords":"Malware; Compartmentalization (fire protection); Computer science; Computer security; The Internet; Internet privacy; Operating system","score_opus":0.050987604004236915,"score_gpt":0.30927590223148166,"score_spread":0.25828829822724475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119543896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15387636,0.00021395963,0.84149075,0.0006373951,0.0014328212,0.002105398,0.000090724134,0.00013170314,0.000020885278],"genre_scores_gemma":[0.9915295,0.0000081317785,0.0071539786,0.000071710034,0.00018410558,0.0008423621,0.000019332245,0.00002252784,0.00016833142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979446,0.0002224991,0.0006283266,0.0005858993,0.00027230856,0.00034638945],"domain_scores_gemma":[0.9985975,0.00047146663,0.00029686422,0.00028643134,0.00019628911,0.00015142105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053949264,0.00025719355,0.00035153146,0.0003150773,0.0002819375,0.00030799783,0.0002937176,0.000121607474,0.00005975491],"category_scores_gemma":[0.00011770434,0.0002704982,0.0001375987,0.0002116507,0.00017233394,0.00040936386,0.000039379334,0.00022946534,0.0000011933384],"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.009658552,0.008602706,0.006351493,0.011770754,0.003374719,0.000008533982,0.15560932,0.005663765,0.059076417,0.43608296,0.005057673,0.2987431],"study_design_scores_gemma":[0.0023250703,0.0008786664,0.0020906546,0.00088341394,0.0002196798,0.000044020602,0.00041886576,0.41326758,0.5510745,0.022500709,0.0055875224,0.000709306],"about_ca_topic_score_codex":0.0007835265,"about_ca_topic_score_gemma":0.00078034634,"teacher_disagreement_score":0.83765316,"about_ca_system_score_codex":0.000089404864,"about_ca_system_score_gemma":0.000028295233,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2119666300","doi":"10.1109/pst.2011.5971993","title":"RC4 state and its applications","year":2011,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Regina","funders":"","keywords":"Computer science; Hash function; RC4; Message authentication code; Computer network; Simple (philosophy); Overhead (engineering); Authentication (law); Distributed computing; State (computer science); Cryptographic hash function; Multicast; Cryptography; Encryption; Computer security; Stream cipher; Algorithm; Operating system","score_opus":0.05819430607149103,"score_gpt":0.2540973733616405,"score_spread":0.19590306729014947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119666300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006185914,0.000092472284,0.9582095,0.00016074402,0.0000427237,0.00007838464,2.8623208e-7,0.00010567917,0.035124283],"genre_scores_gemma":[0.94154114,0.000021969108,0.057495676,0.00029098487,0.000015068527,0.000016896565,1.988307e-7,0.0000017319431,0.0006163497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965245,0.000009616765,0.00007310649,0.00014414907,0.000046068344,0.00007460677],"domain_scores_gemma":[0.9996949,0.00002889547,0.000022677727,0.00017823021,0.000034233588,0.000041064763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082919905,0.00003288731,0.000030221874,0.00002504306,0.00007984627,0.000036382433,0.0002547241,0.000011681914,0.000042947442],"category_scores_gemma":[0.000004973356,0.000030607258,0.0000075593334,0.00011985415,0.0000101813275,0.0001658327,0.00009484294,0.000031446834,0.00016363876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.138434e-7,0.000019794546,0.00013844002,0.0000041118724,0.000002449676,3.2298783e-7,0.0015258428,0.0000013215042,0.00009343468,0.9571855,0.00016448855,0.04086397],"study_design_scores_gemma":[0.0005122372,0.00009737593,0.031402867,0.000015572543,0.0000067012584,0.00006027438,0.00017921951,0.5171059,0.045747783,0.25755405,0.14664108,0.0006769711],"about_ca_topic_score_codex":0.000007857761,"about_ca_topic_score_gemma":0.0000012585122,"teacher_disagreement_score":0.9353552,"about_ca_system_score_codex":0.0000032352448,"about_ca_system_score_gemma":0.000010303815,"threshold_uncertainty_score":0.21032998},"labels":[],"label_agreement":null},{"id":"W2121577686","doi":"10.1109/apscc.2008.169","title":"Contract-Based Security Monitors for Service Oriented Software Architecture","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Software security assurance; Security testing; Security bug; Computer security; Secure coding; Security service; Service (business); Assertion; False positive paradox; Security information and event management; Cloud computing security; Information security; Cloud computing; Operating system","score_opus":0.023534362316762772,"score_gpt":0.254146087063753,"score_spread":0.23061172474699027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121577686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063438386,0.000038849405,0.93278456,0.0021270688,0.0004888432,0.0002777912,0.000007689413,0.00056798494,0.00026883458],"genre_scores_gemma":[0.74951714,0.0000012700448,0.24730113,0.0029461903,0.00014330282,0.000033867113,0.000011761863,0.00000870848,0.00003660151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988512,0.000045425008,0.00021842444,0.00038551484,0.00021941176,0.00028001485],"domain_scores_gemma":[0.99854827,0.00045162017,0.0000911378,0.0004978394,0.00030062176,0.00011052215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016683794,0.00013906675,0.00014392105,0.000071653,0.00039905918,0.000056449557,0.00066142145,0.00008603212,0.000018709665],"category_scores_gemma":[0.000117471565,0.0001290394,0.00008244723,0.0004089231,0.000033876764,0.00017564102,0.00007394859,0.00015408469,0.000027058637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006458698,0.0038963717,0.04741729,0.0014243586,0.00040776143,0.00016921283,0.068781555,0.05716567,0.003373566,0.62930167,0.04839985,0.1390168],"study_design_scores_gemma":[0.0032251757,0.00024983313,0.008439637,0.00006947444,0.000016202499,0.00010553295,0.00011016632,0.85080695,0.023824299,0.017423814,0.09472171,0.0010072041],"about_ca_topic_score_codex":0.00008145105,"about_ca_topic_score_gemma":0.000014436959,"teacher_disagreement_score":0.79364127,"about_ca_system_score_codex":0.000030276466,"about_ca_system_score_gemma":0.00014076055,"threshold_uncertainty_score":0.5262074},"labels":[],"label_agreement":null},{"id":"W2124146130","doi":"10.1109/mcetech.2008.20","title":"Formal Modeling for Security Behavior Analysis of Computer Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Formal methods; Process calculus; Formal verification; Theoretical computer science; Formal specification; Pi calculus; Situation calculus; Computer security; Distributed computing; Software engineering; Programming language","score_opus":0.06200855546862597,"score_gpt":0.28473496215437105,"score_spread":0.2227264066857451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124146130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24310744,0.00003616785,0.7560847,0.000020957288,0.00033874993,0.00016130412,0.000004401993,0.000087764645,0.00015853795],"genre_scores_gemma":[0.9201914,0.000004303805,0.07961133,0.000048240967,0.00009035453,0.000026534637,0.000008431263,0.000003315089,0.000016077644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891776,0.000027439904,0.0003845051,0.0002637214,0.000200626,0.00020596554],"domain_scores_gemma":[0.9990762,0.00009933819,0.00011490325,0.0004127055,0.0002428603,0.000053989083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031750122,0.000087240696,0.00025210527,0.00024181051,0.00019589637,0.00004633148,0.0005379667,0.000054443826,0.0000041749104],"category_scores_gemma":[0.000007488202,0.000082874525,0.00019026136,0.00070374965,0.000023245682,0.000395269,0.00013040965,0.000054770142,0.0000019956299],"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.000010627186,0.00033344582,0.006633601,0.00008021453,0.00044884,0.000004337274,0.0055539715,0.56098866,0.000096857504,0.42185703,0.0005871598,0.0034052334],"study_design_scores_gemma":[0.00015189163,0.000033636825,0.0007033981,0.00000438378,0.00007810423,0.000008794672,0.000031749758,0.9985521,0.00012738034,0.000077839104,0.00012867668,0.00010207295],"about_ca_topic_score_codex":0.000107609885,"about_ca_topic_score_gemma":0.0000049542587,"teacher_disagreement_score":0.67708397,"about_ca_system_score_codex":0.000022371352,"about_ca_system_score_gemma":0.00003584183,"threshold_uncertainty_score":0.3379525},"labels":[],"label_agreement":null},{"id":"W2129167388","doi":"10.3217/jucs-009-11-1350","title":"An Information Flow Method to Detect Denial of Service Vulnerabilities","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Denial; Denial-of-service attack; Computer security; Computer science; Information flow; Service (business); Internet privacy; Business; Psychology; World Wide Web; Linguistics; The Internet; Philosophy; Psychoanalysis","score_opus":0.01719282039532877,"score_gpt":0.26122229576344136,"score_spread":0.2440294753681126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129167388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.021632714,0.00004806059,0.9640718,0.012872963,0.00009763034,0.00041966757,0.000018734228,0.0007197915,0.00011861692],"genre_scores_gemma":[0.36683828,0.000002333706,0.6221623,0.010823078,0.000083113366,0.0000720685,0.000006918736,0.000009338916,0.0000025717584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998087,0.00026732913,0.0005637275,0.0003423551,0.00037706818,0.00036250602],"domain_scores_gemma":[0.9981066,0.0001844456,0.00021688506,0.0008030286,0.00032331044,0.00036575532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087094866,0.00019963468,0.0002708405,0.00025123556,0.0001843723,0.00028287465,0.001429887,0.00014748696,0.000014513964],"category_scores_gemma":[0.00027635903,0.00021681546,0.00008540321,0.0012252465,0.000021110476,0.0015759271,0.00032185303,0.00025778305,0.000027331946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016384866,0.000118683034,0.0011415067,0.00025494554,0.000046333604,0.000006196305,0.029101692,0.20651783,0.028120853,0.13607167,0.0015010621,0.59695536],"study_design_scores_gemma":[0.00019907414,0.00021181937,0.0019694488,0.000017375161,0.000006385358,0.000015582948,0.00019522572,0.9293258,0.061892893,0.0024199141,0.003512525,0.00023395808],"about_ca_topic_score_codex":0.0028371632,"about_ca_topic_score_gemma":0.0003121954,"teacher_disagreement_score":0.72280794,"about_ca_system_score_codex":0.00011585441,"about_ca_system_score_gemma":0.00020558933,"threshold_uncertainty_score":0.8841478},"labels":[],"label_agreement":null},{"id":"W2129856934","doi":"10.1145/2516760.2516771","title":"Deadbolt","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Encryption; Computer science; Computer security; Android (operating system); Mobile device; Adversary; Exploit; On-the-fly encryption; Vulnerability (computing); Computer network; Operating system","score_opus":0.011971495178915291,"score_gpt":0.2126178563560371,"score_spread":0.2006463611771218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129856934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009652949,0.00001741851,0.931703,0.0019919404,0.00015934744,0.000040720905,1.2305763e-8,0.0002175165,0.05621715],"genre_scores_gemma":[0.8612398,0.0000010465211,0.1370038,0.001099075,0.000031346433,0.000005753271,1.08486084e-7,0.0000010546605,0.00061799353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996857,0.000009276811,0.0000600167,0.00010252813,0.000061216255,0.00008126239],"domain_scores_gemma":[0.9996616,0.000031932876,0.00001303816,0.00022518156,0.000036537996,0.00003166195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000048780043,0.000026401953,0.000025229287,0.000019377201,0.000049185423,0.00012833631,0.00037641622,0.000013342434,0.00025705108],"category_scores_gemma":[0.000009441513,0.000022480275,0.000012860252,0.00011319116,0.0000070424694,0.00029222318,0.0000748016,0.000028607918,0.0019029626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.8842422e-8,0.0000101886,0.00033610695,0.0000010696891,0.0000012961906,2.0366289e-7,0.0001778814,0.0000072824046,0.00030729326,0.9087558,0.011777838,0.07862504],"study_design_scores_gemma":[0.00017522683,0.000027338712,0.027568236,0.000007199097,7.3261344e-7,0.000017633463,0.000061316314,0.78465086,0.009471914,0.10713564,0.0706252,0.00025871932],"about_ca_topic_score_codex":0.000042678224,"about_ca_topic_score_gemma":4.2902207e-7,"teacher_disagreement_score":0.8515869,"about_ca_system_score_codex":0.000004812704,"about_ca_system_score_gemma":0.000008622601,"threshold_uncertainty_score":0.9988742},"labels":[],"label_agreement":null},{"id":"W2130056031","doi":"10.1109/ccece.2011.6030698","title":"A complete framework for kernel trace analysis","year":2011,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Programming language; Scripting language; TRACE (psycholinguistics); Abstraction; Kernel (algebra); Host (biology); Specification language; Theoretical computer science","score_opus":0.11005216986213451,"score_gpt":0.3025595674519842,"score_spread":0.1925073975898497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130056031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0019115072,0.000032452786,0.99335384,0.00031655206,0.0001632269,0.000092961825,0.0000021797641,0.00019053748,0.0039367517],"genre_scores_gemma":[0.46454814,9.686523e-7,0.5350768,0.0002704458,0.000020460271,0.000009020078,9.657703e-7,0.0000019830345,0.00007123175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992664,0.000022968574,0.00016524768,0.0002792143,0.00009987794,0.00016627801],"domain_scores_gemma":[0.9990912,0.00022462367,0.00006735153,0.00048691005,0.00007321767,0.000056677876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002254864,0.00006843728,0.00012266295,0.000104521394,0.00012541423,0.00007432604,0.00071280793,0.000048619397,0.000111810805],"category_scores_gemma":[0.000049801773,0.00006385764,0.0001380647,0.00073738274,0.000020172374,0.00015066656,0.000073806026,0.00006615042,0.000042858395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002192182,0.00003459864,0.00050177996,0.0000034666502,0.00007527542,3.558985e-7,0.0020878566,0.000029359862,0.000016942906,0.9927325,0.00019124751,0.0043244213],"study_design_scores_gemma":[0.00013353435,0.000046312492,0.013805718,0.000005530906,0.000062810424,0.0000020605833,0.00012289442,0.7599253,0.00048703732,0.21669817,0.008506979,0.00020363738],"about_ca_topic_score_codex":0.000040467392,"about_ca_topic_score_gemma":0.0000066843795,"teacher_disagreement_score":0.77603436,"about_ca_system_score_codex":0.0000101386195,"about_ca_system_score_gemma":0.000014927012,"threshold_uncertainty_score":0.2604039},"labels":[],"label_agreement":null},{"id":"W2135359801","doi":"10.1145/2046707.2046754","title":"Eliminating the hypervisor attack surface for a more secure cloud","year":2011,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":286,"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 British Columbia","keywords":"Hypervisor; Cloud computing; Computer science; Operating system; Virtualization; Virtual machine; Hardware virtualization; Full virtualization; Attack surface; Exploit; Software; Suite; Temporal isolation among virtual machines; Computer security; Embedded system","score_opus":0.11341633091891366,"score_gpt":0.2970785336339948,"score_spread":0.1836622027150811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135359801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10381066,0.000105985164,0.88546264,0.0031907223,0.0006264573,0.0002968894,0.0000015237136,0.00024571535,0.0062594],"genre_scores_gemma":[0.7818992,0.0000032943176,0.2163592,0.001242286,0.00013084519,0.000013287064,9.671489e-7,0.000007366098,0.00034356053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991636,0.000040880466,0.00017923975,0.00027445634,0.000117445954,0.00022435706],"domain_scores_gemma":[0.99894863,0.00028232785,0.00008277268,0.0005173863,0.00012616724,0.00004273355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046445703,0.00009542073,0.000085803586,0.000017134807,0.00032608968,0.0000962062,0.0010920767,0.000046602683,0.000032664128],"category_scores_gemma":[0.00006958232,0.0000658498,0.0000678817,0.00022310452,0.0000444773,0.00019334132,0.00019777828,0.00010175801,0.00003391015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010801134,0.000112377464,0.0005982446,0.00005199234,0.000029758829,0.0000018479616,0.041506935,0.00033182726,0.00025810383,0.9164616,0.015703429,0.024933118],"study_design_scores_gemma":[0.00031837734,0.000084542946,0.0014288443,0.000020812538,0.0000084223775,0.00001922922,0.0017825259,0.95944303,0.0056601055,0.00711576,0.023852475,0.0002658472],"about_ca_topic_score_codex":0.000032288728,"about_ca_topic_score_gemma":0.000006015529,"teacher_disagreement_score":0.9591112,"about_ca_system_score_codex":0.000012762193,"about_ca_system_score_gemma":0.00003077267,"threshold_uncertainty_score":0.2685277},"labels":[],"label_agreement":null},{"id":"W2138734937","doi":"10.1007/978-3-540-73986-9_14","title":"Synthesis of Non-interferent Distributed Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Property (philosophy); Computer science; Focus (optics); TRACE (psycholinguistics); Interference (communication); Bisimulation; Distributed computing; Theoretical computer science; Computer security; Human–computer interaction; Computer network; Channel (broadcasting)","score_opus":0.05804527178303598,"score_gpt":0.30570596162347785,"score_spread":0.24766068984044187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138734937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050613602,0.00027787688,0.8861989,0.00020082883,0.00046454166,0.00028658644,0.00002541716,0.00006324228,0.11243199],"genre_scores_gemma":[0.85786974,0.0022028936,0.13910139,0.00029550982,0.00007413421,0.000040403767,0.00007730132,0.000014323052,0.00032430663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784505,0.00003119919,0.0010965395,0.00028005143,0.00051473826,0.00023238982],"domain_scores_gemma":[0.99567467,0.00056667015,0.0006796812,0.002327586,0.00064856844,0.000102833554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017486328,0.00021102115,0.00034186293,0.0011321055,0.000310925,0.00044574108,0.004071725,0.00015114518,0.0000038432927],"category_scores_gemma":[0.000081960454,0.00021658669,0.00005829136,0.00056254596,0.00075581553,0.0032063737,0.0021727863,0.00037000616,0.000026546864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002161563,0.00002188832,0.000035087403,0.00008199692,0.000008433794,2.503279e-7,0.00103073,0.00067286694,0.0000037584982,0.8482613,0.00013895695,0.14974256],"study_design_scores_gemma":[0.00015141246,0.00003952324,0.0010035295,0.0006398664,0.000006771819,0.000021341042,0.000039747658,0.94447565,0.00009350134,0.0015747806,0.051655598,0.0002982679],"about_ca_topic_score_codex":0.000024757004,"about_ca_topic_score_gemma":0.0000031618797,"teacher_disagreement_score":0.9438028,"about_ca_system_score_codex":0.0001699606,"about_ca_system_score_gemma":0.00025265367,"threshold_uncertainty_score":0.8832149},"labels":[],"label_agreement":null},{"id":"W2139175517","doi":"","title":"Alternative Java Security Policy Model","year":2004,"lang":"en","type":"article","venue":"Corpus Université Laval (Université Laval)","topic":"Security and Verification in Computing","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":"Concordia University; Université Laval","keywords":"Java; Computer science; Delegation; Security policy; Computer security model; Context (archaeology); Authentication (law); Computer security; Access control; Java API for XML-based RPC; Real time Java; Programming language; Java annotation; Political science","score_opus":0.014280296687796706,"score_gpt":0.2182343865524674,"score_spread":0.2039540898646707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139175517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21005662,0.00037609416,0.7330066,0.009271914,0.00067376473,0.00040662914,0.000043351596,0.0010360803,0.045128964],"genre_scores_gemma":[0.9872673,0.00059551216,0.009690829,0.0005613098,0.00018883457,9.92378e-7,0.00001559757,0.000026406055,0.0016532119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975662,0.000097910284,0.00024281561,0.00087787735,0.00058483117,0.00063034083],"domain_scores_gemma":[0.9979614,0.000097109965,0.00026941914,0.0009465982,0.00034122457,0.00038422435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021807017,0.00036620547,0.0003346933,0.0006385167,0.0008622418,0.00015872289,0.002507188,0.00019596836,0.000008831123],"category_scores_gemma":[0.000043023058,0.00044902702,0.0002506102,0.0015302866,0.00014105107,0.00132279,0.0011321255,0.00044925197,0.000072405535],"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.000044351927,0.0001647224,0.000286444,0.000018955036,0.000077007135,0.0002283113,0.029708272,0.031516444,0.0031058125,0.9267258,0.00026222967,0.007861658],"study_design_scores_gemma":[0.007330662,0.00048118897,0.0015504321,0.00020685467,0.00013393573,0.0003135402,0.0026418902,0.586049,0.09424836,0.27410877,0.03076162,0.0021737134],"about_ca_topic_score_codex":0.009126454,"about_ca_topic_score_gemma":0.00087167585,"teacher_disagreement_score":0.7772107,"about_ca_system_score_codex":0.0015009952,"about_ca_system_score_gemma":0.0008916222,"threshold_uncertainty_score":0.99979615},"labels":[],"label_agreement":null},{"id":"W2139824189","doi":"10.1007/978-3-642-41071-0_10","title":"Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Mathematical proof; HOL; Entropy (arrow of time); Information leakage; Information flow; Theoretical computer science; Min entropy; Mutual information; Information theory; Algorithm; Data mining; Artificial intelligence; Entropy rate; Mathematics; Principle of maximum entropy; Programming language; Joint quantum entropy; Computer security; Statistics","score_opus":0.015551351272618717,"score_gpt":0.2389230685451928,"score_spread":0.22337171727257407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139824189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0036166846,0.00028313094,0.99421364,0.0001975783,0.0008814068,0.0003293542,0.000011631756,0.00007257486,0.00039398827],"genre_scores_gemma":[0.23474969,0.00005795375,0.7641459,0.00075892435,0.00020885233,0.000004824896,0.000025548836,0.000014568063,0.00003374371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966415,0.00004043469,0.0009343203,0.0008205787,0.0009687167,0.00059441244],"domain_scores_gemma":[0.997117,0.0003889845,0.00076010334,0.0010744305,0.0004889501,0.00017052153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357248,0.00043082,0.00069121615,0.0020625168,0.0003504925,0.00073866424,0.001954097,0.00029268774,0.000040570456],"category_scores_gemma":[0.000093999675,0.00041398988,0.00019898066,0.0015721155,0.00054012996,0.0025355325,0.0011945926,0.0004829551,0.00001615254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010109426,0.00004023677,0.00031843537,0.00012001426,0.00018846772,0.0000066293023,0.0043023014,0.22822845,0.00031024363,0.08015254,0.000024340065,0.68629825],"study_design_scores_gemma":[0.00021959281,0.00007554173,0.00053537096,0.00014157502,0.00008792791,0.00002029098,0.0000010178234,0.9848046,0.0007555327,0.012132979,0.00081172556,0.00041388464],"about_ca_topic_score_codex":0.00008325545,"about_ca_topic_score_gemma":0.000017449094,"teacher_disagreement_score":0.7565761,"about_ca_system_score_codex":0.00020705411,"about_ca_system_score_gemma":0.00030105893,"threshold_uncertainty_score":0.9998312},"labels":[],"label_agreement":null},{"id":"W2142949137","doi":"10.1007/s10817-005-0084-6","title":"Tool-Assisted Specification and Verification of Typed Low-Level Languages","year":2006,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Security and Verification in Computing","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":"Bytecode; Correctness; Computer science; Programming language; Java Card; Java bytecode; Java; Automated theorem proving; Mathematical proof; Java applet; Java annotation","score_opus":0.016383695167651317,"score_gpt":0.2659575518394582,"score_spread":0.24957385667180687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142949137","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.867323,0.0005278231,0.13080421,0.00029509512,0.00020724811,0.00005432449,0.000001546573,0.00013665138,0.00065010856],"genre_scores_gemma":[0.91401654,0.000021852478,0.085823916,0.0000142459185,0.00009369348,5.121985e-7,0.0000024448852,0.000005163167,0.000021651877],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99897814,0.000075369506,0.0004915003,0.00012349171,0.00022925925,0.000102266196],"domain_scores_gemma":[0.9986154,0.00011476016,0.00074581394,0.00020157851,0.00029234527,0.000030112093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611507,0.00007587957,0.00015883462,0.00015588514,0.000078513505,0.00008739866,0.0002788759,0.000060305112,0.000004518679],"category_scores_gemma":[0.000132959,0.00006957627,0.00004481495,0.0003408198,0.00003557441,0.00025635277,0.000033293105,0.00011040396,0.0000027907843],"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.00012465572,0.00079356815,0.013631078,0.00033097077,0.00019908628,0.000073895455,0.0049103657,0.0057344073,0.53650993,0.2331229,0.0057119112,0.19885725],"study_design_scores_gemma":[0.0006287973,0.00007730115,0.6315052,0.0003340144,0.000021365131,0.00030729698,0.0002028127,0.32935688,0.0362994,0.0006919226,0.00040539994,0.00016965334],"about_ca_topic_score_codex":0.000021672575,"about_ca_topic_score_gemma":9.560061e-7,"teacher_disagreement_score":0.6178741,"about_ca_system_score_codex":0.000037978687,"about_ca_system_score_gemma":0.000065379616,"threshold_uncertainty_score":0.2837238},"labels":[],"label_agreement":null},{"id":"W2144762056","doi":"10.1109/enabl.2000.883726","title":"Secure self-certified COTS","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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é Laval","funders":"","keywords":"Computer science; Computer security; Certification; Popularity; Code (set theory); Compiler; Programming language","score_opus":0.03394342038587156,"score_gpt":0.21805005315437093,"score_spread":0.18410663276849937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144762056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026077261,0.000277158,0.785508,0.006821517,0.0009618375,0.00015220237,4.999756e-7,0.0019994148,0.17820214],"genre_scores_gemma":[0.93930286,0.00000974365,0.058262177,0.0011891846,0.00007935697,0.0000032811124,2.5023186e-7,0.0000033967524,0.0011497277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993049,0.000028374321,0.00012840956,0.00023081727,0.00014828485,0.00015924597],"domain_scores_gemma":[0.99939567,0.00006016632,0.000035325076,0.00040284733,0.000045507928,0.000060461993],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000102037295,0.0000657919,0.000061922714,0.000040548613,0.00012513068,0.00012770756,0.0005814365,0.00004172043,0.00032642487],"category_scores_gemma":[0.000014644559,0.00006093149,0.000031963747,0.00026165394,0.000010621373,0.00014712448,0.000102983715,0.00008154261,0.00078135316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.9753876e-7,0.0001873269,0.00040994454,0.000013449932,0.0000177597,0.000008494629,0.0054565524,0.00007296354,0.00027960894,0.91130096,0.044802185,0.037450187],"study_design_scores_gemma":[0.00016423581,0.000020654306,0.00039087926,0.000004420288,0.0000016663396,0.000019482588,0.000022851355,0.89759314,0.002010352,0.0026467415,0.09697064,0.00015495872],"about_ca_topic_score_codex":0.0000045116585,"about_ca_topic_score_gemma":0.0000010296804,"teacher_disagreement_score":0.9132256,"about_ca_system_score_codex":0.00001681753,"about_ca_system_score_gemma":0.0000068749523,"threshold_uncertainty_score":0.99999666},"labels":[],"label_agreement":null},{"id":"W2145150838","doi":"10.1109/dsn.2013.6575312","title":"Seamless kernel updates","year":2013,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Reboot; Computer science; Kernel (algebra); Overhead (engineering); Operating system; Linux kernel; State (computer science); Installation; System call; Distributed computing; Rootkit; Malware; Programming language","score_opus":0.01353003289020902,"score_gpt":0.22690426499317284,"score_spread":0.21337423210296383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145150838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03555503,0.000031099542,0.92904377,0.003321343,0.00027867063,0.000076343356,8.902258e-8,0.00034134916,0.03135231],"genre_scores_gemma":[0.93009025,0.0000025138913,0.06794836,0.0011465113,0.000047393754,0.000008131362,5.763452e-7,0.0000021550316,0.00075410923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995058,0.000016433394,0.000092663984,0.00016671147,0.00009344895,0.00012489827],"domain_scores_gemma":[0.99950343,0.00004840318,0.000023971326,0.00031555718,0.00006060148,0.000048008078],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008062525,0.00004611268,0.000044319997,0.000027254398,0.00007505188,0.00023315215,0.00058215106,0.00002222385,0.00031252365],"category_scores_gemma":[0.000011205771,0.000039358332,0.000019604968,0.00015315467,0.000013570834,0.00041957732,0.00014230987,0.00004624073,0.0018074001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.2001382e-7,0.000027455055,0.0010613513,0.000003977536,0.0000042791926,5.4661183e-7,0.00038604828,0.000028180868,0.00043103643,0.92930716,0.021729866,0.047019955],"study_design_scores_gemma":[0.00019723608,0.000022063825,0.020489777,0.000009186068,0.0000012210462,0.000015350635,0.00013963906,0.8661339,0.012147478,0.06572548,0.034821544,0.00029706833],"about_ca_topic_score_codex":0.000078269855,"about_ca_topic_score_gemma":8.7277584e-7,"teacher_disagreement_score":0.89453524,"about_ca_system_score_codex":0.000007903593,"about_ca_system_score_gemma":0.000013818534,"threshold_uncertainty_score":0.9989698},"labels":[],"label_agreement":null},{"id":"W2148349940","doi":"10.1109/aiccsa.2008.4493600","title":"A novel flow-sensitive type and effect analysis for securing C code","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Alias; Static analysis; Type inference; Memory safety; Information flow; Aliasing; Source code; Abstract interpretation; Programming language; Program analysis; Static program analysis; Type safety; Type (biology); Code (set theory); Point (geometry); Interface (matter); Undecidable problem; Control flow; Theoretical computer science; Inference; Data mining; Parallel computing; Compiler; Artificial intelligence","score_opus":0.03712901564060711,"score_gpt":0.27282913786647894,"score_spread":0.23570012222587183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148349940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15038875,0.00002641341,0.84863085,0.00013341931,0.000100015204,0.000101017635,0.0000019241704,0.00009498218,0.0005226113],"genre_scores_gemma":[0.85250485,0.0000056552853,0.14719892,0.00017253833,0.000040249113,0.000004284221,0.0000027820213,0.0000028621587,0.00006786586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936295,0.000022274891,0.000110924484,0.00027786713,0.0000907698,0.00013522293],"domain_scores_gemma":[0.99920046,0.0003760591,0.000038283004,0.00021266713,0.00012362385,0.000048896276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022172452,0.00007454106,0.0001411067,0.000107539854,0.00021386199,0.000050380313,0.00016229594,0.000032617645,0.0000026591426],"category_scores_gemma":[0.00008757252,0.00006719462,0.000053369684,0.000718281,0.000028127888,0.00013198469,0.00008573884,0.000047029087,0.000005214391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042310864,0.000823737,0.09751407,0.00045422575,0.0052724644,0.00010509169,0.06554819,0.05380206,0.046224147,0.63622564,0.0057227584,0.087884516],"study_design_scores_gemma":[0.00028246347,0.000068380774,0.011219967,0.000004143997,0.000031369385,0.000030301295,0.000013178865,0.98222446,0.0054754755,0.00010020851,0.00044193093,0.00010811869],"about_ca_topic_score_codex":0.000028206512,"about_ca_topic_score_gemma":0.000014995294,"teacher_disagreement_score":0.9284224,"about_ca_system_score_codex":0.000012969036,"about_ca_system_score_gemma":0.000021519396,"threshold_uncertainty_score":0.2740117},"labels":[],"label_agreement":null},{"id":"W2149894469","doi":"10.1109/crisis.2008.4757466","title":"Verification of Workflow processes under multilevel security considerations","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Workflow; Computer science; Soundness; Correctness; Workflow management system; Workflow technology; Workflow engine; XPDL; Security policy; Software engineering; Computer security model; Mandatory access control; Consistency (knowledge bases); Access control; Database; Programming language; Computer security; Role-based access control","score_opus":0.07158515262087427,"score_gpt":0.29694370662987485,"score_spread":0.22535855400900057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149894469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009457038,0.00036225628,0.98351866,0.0012666844,0.0007546914,0.0003998776,0.000016125154,0.00037070684,0.0038539465],"genre_scores_gemma":[0.8333555,0.00027402138,0.16589724,0.00025263775,0.00009020551,0.000043827848,0.000026042091,0.000009821,0.000050702114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980057,0.00010500266,0.00062085537,0.0006959666,0.0003710257,0.00020146616],"domain_scores_gemma":[0.9969322,0.0004811022,0.00046715312,0.0011860508,0.00085719046,0.000076309676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024563246,0.00023350843,0.00031079398,0.00016902726,0.00022400737,0.00017468304,0.0008671659,0.00028293105,0.00004409723],"category_scores_gemma":[0.00034683713,0.00024592664,0.00009797399,0.0003065766,0.00012795173,0.00026975127,0.0006700964,0.00042570924,0.00002425096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009715859,0.0009764204,0.0005379226,0.001425872,0.00018099946,0.0000084889325,0.018910259,0.048198633,0.0003365737,0.9095812,0.010679558,0.009154394],"study_design_scores_gemma":[0.00037976308,0.000030393883,0.0029803398,0.0003279693,0.000022301518,0.000046568275,0.00012405378,0.5791061,0.017577834,0.39736417,0.0012995375,0.0007410062],"about_ca_topic_score_codex":0.00008415748,"about_ca_topic_score_gemma":0.000018305065,"teacher_disagreement_score":0.82389843,"about_ca_system_score_codex":0.000059673468,"about_ca_system_score_gemma":0.001021694,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W2151501142","doi":"10.1109/pacrim.1997.620426","title":"Designing meta-interfaces for object-oriented operating systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Victoria","funders":"University of Washington","keywords":"Flexibility (engineering); Computer science; Ingenuity; Overhead (engineering); Kernel (algebra); Object-oriented programming; Distributed computing; Code (set theory); Object (grammar); Embedded system; Software engineering; Operating system; Programming language","score_opus":0.11235410442755596,"score_gpt":0.2844289985131951,"score_spread":0.17207489408563914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151501142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015455681,0.00085610244,0.9916097,0.00034987525,0.00067430764,0.00027935894,7.831021e-7,0.00033326258,0.004351057],"genre_scores_gemma":[0.7323933,0.00000383588,0.2662827,0.00017812225,0.00008172489,0.00007091152,6.2910027e-7,0.000006143534,0.0009825821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890304,0.000074559466,0.00028749913,0.00034723655,0.00015534238,0.00023230382],"domain_scores_gemma":[0.99905103,0.00033604572,0.00009049733,0.0003334059,0.0001363576,0.00005268712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047270342,0.00011508839,0.00019218109,0.000062991916,0.0003247803,0.00042078158,0.00052365335,0.00003988784,0.000051281164],"category_scores_gemma":[0.00010103534,0.00009390833,0.00008319885,0.00024491473,0.000014853348,0.0004141271,0.00009415776,0.00006925835,0.00004599598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035084256,0.00018995273,0.00015415362,0.00016163537,0.00082972646,0.000005156154,0.011844092,0.01757589,0.013257725,0.92225677,0.018737713,0.014983678],"study_design_scores_gemma":[0.00015224096,0.000048566224,0.0000034715588,0.000012754305,0.000028390847,0.000010765754,0.00026009296,0.97388357,0.01850237,0.00008618006,0.006872884,0.00013868592],"about_ca_topic_score_codex":0.00002662693,"about_ca_topic_score_gemma":0.0000011379711,"teacher_disagreement_score":0.9563077,"about_ca_system_score_codex":0.000022928492,"about_ca_system_score_gemma":0.000009655858,"threshold_uncertainty_score":0.40576065},"labels":[],"label_agreement":null},{"id":"W2152039024","doi":"10.1007/11534310_106","title":"A Privacy Enhanced Role-Based Access Control Model for Enterprises","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Regina; Toronto Metropolitan University","funders":"","keywords":"Role-based access control; Computer science; Access control; Computer security; Information flow; Invocation; Argument (complex analysis); Information sensitivity; Hierarchy; Mandatory access control; Key (lock); Information privacy; Privacy software; Law","score_opus":0.028728741647433848,"score_gpt":0.28942988582738455,"score_spread":0.2607011441799507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152039024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059897728,0.00035226427,0.9948022,0.0015138662,0.001045853,0.0010362379,0.000018135483,0.00031169903,0.000859845],"genre_scores_gemma":[0.54025406,0.000013068583,0.45483342,0.004120853,0.0005588933,0.00006158208,0.000006851688,0.000035463716,0.00011582239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955128,0.000035555702,0.00076642644,0.001951787,0.0008976659,0.0008357694],"domain_scores_gemma":[0.9958835,0.0011188752,0.00054184644,0.0017498828,0.00049440045,0.00021145272],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008835713,0.0006246802,0.0006520273,0.00080790505,0.00043658828,0.0012934279,0.00704379,0.00036465607,0.000013554207],"category_scores_gemma":[0.0001893678,0.0006222374,0.00027036382,0.00045866857,0.0004283179,0.0010387629,0.0009753786,0.0006397041,0.000016611577],"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.000024534516,0.00005272249,0.000012915613,0.000046622263,0.000011851646,0.0000031325574,0.0008129952,0.60500324,0.00021485743,0.012062941,0.000019104415,0.3817351],"study_design_scores_gemma":[0.0008087071,0.00008704094,0.000014931223,0.00027481743,0.000010776922,0.00000604698,6.5667216e-8,0.90014136,0.0032422068,0.09375183,0.0010529879,0.0006092203],"about_ca_topic_score_codex":0.00000672296,"about_ca_topic_score_gemma":0.000021166128,"teacher_disagreement_score":0.54019415,"about_ca_system_score_codex":0.0003811381,"about_ca_system_score_gemma":0.0011894684,"threshold_uncertainty_score":0.99974334},"labels":[],"label_agreement":null},{"id":"W2153179003","doi":"10.1109/wcre.2006.33","title":"Insider and Ousider Threat-Sensitive SQL Injection Vulnerability Analysis in PHP","year":2006,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; SQL injection; Insider; SQL; Computer security; Information flow; Vulnerability (computing); Static analysis; Confidentiality; Code (set theory); Control flow graph; Database; Web application; Programming language; World Wide Web; Query by Example; Search engine","score_opus":0.015234376800425616,"score_gpt":0.2587161258836503,"score_spread":0.24348174908322467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153179003","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.5137138,0.000028976876,0.48151648,0.00045928563,0.00006470448,0.00006393648,3.5724207e-7,0.000087929235,0.004064577],"genre_scores_gemma":[0.9865979,0.0000023960251,0.013012616,0.0002515383,0.000041617797,0.0000035525486,0.0000023728653,0.0000023485384,0.000085690066],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989729,0.00011649522,0.00023090263,0.0004001121,0.00013327067,0.0001463494],"domain_scores_gemma":[0.9993529,0.00017837656,0.00005557348,0.00030221173,0.00008172642,0.000029231105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001813,0.000087924534,0.000150427,0.00023317084,0.00011263437,0.00012040795,0.00011565437,0.0000561284,0.000014126521],"category_scores_gemma":[0.000036409772,0.000082564984,0.000046424528,0.0012153409,0.000042272117,0.0003290138,0.000097809214,0.000112473295,0.0000067359633],"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.000013325683,0.00034281184,0.7164453,0.000018775945,0.00012125445,0.000019598825,0.0037551012,0.02971304,0.00042935042,0.22395736,0.00049258146,0.024691464],"study_design_scores_gemma":[0.00014490548,0.000014895663,0.5993641,0.0000027528463,0.000013246933,0.000008724565,0.00008290415,0.38471937,0.0008122621,0.01466887,0.000053065472,0.00011489743],"about_ca_topic_score_codex":0.0031768484,"about_ca_topic_score_gemma":0.0020235153,"teacher_disagreement_score":0.47288412,"about_ca_system_score_codex":0.000052552714,"about_ca_system_score_gemma":0.000021322696,"threshold_uncertainty_score":0.48024657},"labels":[],"label_agreement":null},{"id":"W2153576711","doi":"10.1109/iccd.2000.878353","title":"Source-level transformations for improved formal verification","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Formal verification; Formal methods; Programming language; Formal equivalence checking","score_opus":0.0722107887888603,"score_gpt":0.254952881981793,"score_spread":0.18274209319293272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153576711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007680879,0.000035505873,0.99069035,0.0030912114,0.00021341283,0.0002749243,0.0000045604347,0.00028100392,0.0046409233],"genre_scores_gemma":[0.73782617,0.000018470097,0.26019254,0.00070886494,0.0000903986,0.000075688695,0.000010955643,0.0000065898885,0.0010703022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992666,0.000013365355,0.00023140523,0.00018674471,0.00008158102,0.00022026907],"domain_scores_gemma":[0.9993828,0.00008563865,0.00005920883,0.00032326544,0.00009567739,0.000053444983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020289123,0.00007590272,0.0000699842,0.000051517778,0.00033923244,0.00014765671,0.00046902744,0.000048451297,0.000056122128],"category_scores_gemma":[0.000027571048,0.000074410775,0.00006548774,0.00021552031,0.000016040414,0.0009787262,0.00002685214,0.00005761346,0.00006959895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031187283,0.00009738488,0.000009459991,0.00002188464,0.000011525899,2.6382752e-8,0.0038315323,0.00020932071,0.0014555296,0.4574228,0.0059732543,0.5309642],"study_design_scores_gemma":[0.00029706454,0.000032589687,0.00013269953,0.0000024407705,0.0000023718048,0.00000424255,0.000049465554,0.9137678,0.0026019432,0.0014141615,0.08158877,0.000106468455],"about_ca_topic_score_codex":0.0000044967446,"about_ca_topic_score_gemma":0.0000022124086,"teacher_disagreement_score":0.9135585,"about_ca_system_score_codex":0.000022538412,"about_ca_system_score_gemma":0.000011676079,"threshold_uncertainty_score":0.30343834},"labels":[],"label_agreement":null},{"id":"W2154138597","doi":"10.1109/acsac.2006.7","title":"A Module System for Isolating Untrusted Software Extensions","year":2006,"lang":"en","type":"article","venue":"Annual Computer Security Applications Conference/Proceedings of the annual Computer Security Applications Conference","topic":"Security and Verification in Computing","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; Operating system; Programming language; Java; Software; Access control; Security policy; Software system; Isolation (microbiology); Visibility; Extensibility; Distributed computing","score_opus":0.013906646444441898,"score_gpt":0.23494457542014066,"score_spread":0.22103792897569877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154138597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01582056,0.00017032948,0.97341275,0.0019042571,0.0005666278,0.004657277,0.0009506102,0.0014047744,0.0011128209],"genre_scores_gemma":[0.78134024,0.000015577578,0.21465735,0.0003448941,0.0011771691,0.0022092797,0.00013428373,0.0000631602,0.000058067308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930278,0.00012240773,0.0021492785,0.0023592908,0.0010989918,0.0012422521],"domain_scores_gemma":[0.9871567,0.00069619494,0.0018430781,0.0021404517,0.007781789,0.0003817729],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010715694,0.0010030892,0.0011655608,0.00054112374,0.002206736,0.0012177519,0.0069903755,0.0005807507,0.0000129056325],"category_scores_gemma":[0.000047243975,0.000986101,0.00064719154,0.0027772116,0.0006758324,0.0015926248,0.0027891423,0.0010219667,0.000052568463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025405094,0.0007233927,0.00049784285,0.0005982455,0.00010620666,6.480747e-7,0.0040300856,0.00043633732,0.00028876358,0.97411233,0.005687973,0.013492747],"study_design_scores_gemma":[0.0019672073,0.00041478506,0.0025705453,0.0005955593,0.0002256554,0.00018642923,0.0023971847,0.7424348,0.003715853,0.1854065,0.057889603,0.0021958698],"about_ca_topic_score_codex":0.00029397165,"about_ca_topic_score_gemma":0.00005801996,"teacher_disagreement_score":0.7887058,"about_ca_system_score_codex":0.00026981728,"about_ca_system_score_gemma":0.00053955324,"threshold_uncertainty_score":0.9998191},"labels":[],"label_agreement":null},{"id":"W2155118775","doi":"10.5539/cis.v3n4p252","title":"Research of Dynamic Information Flow Monitoring Based on Finite State Automaton","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Security and Verification in Computing","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; Information flow; Automaton; Finite-state machine; Covert channel; State (computer science); Confidentiality; Flow (mathematics); Covert; Information security; Computer security; Real-time computing; Distributed computing; Theoretical computer science; Algorithm; Operating system","score_opus":0.026673326478743348,"score_gpt":0.3253618354530577,"score_spread":0.2986885089743143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155118775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11248739,0.0000023954506,0.8840446,0.00025039574,0.0011042937,0.00014672258,0.00000330233,0.00011409985,0.001846793],"genre_scores_gemma":[0.8827862,0.00000633767,0.116964296,0.00020646826,0.000024280918,0.0000056378426,0.000003444733,0.0000013639053,0.000001946499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981882,0.000039581013,0.00043443686,0.0001639925,0.0008976819,0.0002761265],"domain_scores_gemma":[0.998086,0.00030877432,0.00018399955,0.0005146172,0.00079061626,0.0001160323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025396626,0.000093869334,0.00009923815,0.0009775542,0.0004992492,0.00082662766,0.0009951177,0.0000455969,0.0000029241698],"category_scores_gemma":[0.00017400277,0.00008764599,0.000023782693,0.0016254976,0.00030230067,0.011835102,0.00030193944,0.00032313424,0.00004947736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000912331,0.000030482406,0.00038202017,0.00007806051,0.0000020246644,3.7503264e-7,0.007302632,0.032285474,0.00029840763,0.03478525,0.00011556419,0.9247106],"study_design_scores_gemma":[0.0001970036,0.00007508685,0.016386842,0.000038730323,3.7008095e-7,0.0000042575725,0.000038978837,0.97682095,0.0023392562,0.0003575883,0.0036469812,0.00009392959],"about_ca_topic_score_codex":0.000008246743,"about_ca_topic_score_gemma":3.0839294e-7,"teacher_disagreement_score":0.9445355,"about_ca_system_score_codex":0.000038349554,"about_ca_system_score_gemma":0.00025058835,"threshold_uncertainty_score":0.8580164},"labels":[],"label_agreement":null},{"id":"W2156299003","doi":"10.1109/pst.2008.21","title":"Model-Checking for Software Vulnerabilities Detection with Multi-Language Support","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Programming language; Compiler; Reachability; Software security assurance; Java; Software system; Software; Software engineering; Operating system; Theoretical computer science","score_opus":0.06449618258204493,"score_gpt":0.28250410735019604,"score_spread":0.21800792476815112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156299003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09868443,0.000015510754,0.900394,0.00005400287,0.00009827223,0.00016363636,0.0000012611337,0.00041327937,0.00017556125],"genre_scores_gemma":[0.5844525,0.0000010085633,0.41489846,0.00014191547,0.000028515995,0.000027361177,0.0000016179825,0.00000529511,0.0004433031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000017309927,0.00015275463,0.00030166734,0.00014218586,0.00019515242],"domain_scores_gemma":[0.999342,0.000112241156,0.000056442183,0.00032970196,0.00011288135,0.000046684887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017759086,0.000095406846,0.00009499592,0.000060593437,0.00038226772,0.000059058886,0.00029746944,0.00004321237,0.000008515776],"category_scores_gemma":[0.00005865268,0.000080843885,0.00004289859,0.00014358891,0.00004325299,0.00037214765,0.000055750883,0.00008014289,0.000006070694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021908789,0.0012513286,0.01815641,0.0006121319,0.00020060579,0.000077986966,0.23346841,0.23872352,0.01349921,0.08053153,0.0023608832,0.4108989],"study_design_scores_gemma":[0.00034766662,0.00009996839,0.00032881933,0.000006016465,0.0000021772785,0.000059046743,0.00024863932,0.9817961,0.016478727,0.0003083976,0.00017389891,0.00015057117],"about_ca_topic_score_codex":0.000034750723,"about_ca_topic_score_gemma":0.000040997296,"teacher_disagreement_score":0.74307257,"about_ca_system_score_codex":0.00003504451,"about_ca_system_score_gemma":0.00007240301,"threshold_uncertainty_score":0.3296718},"labels":[],"label_agreement":null},{"id":"W2159164536","doi":"","title":"System configuration as a privilege","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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","funders":"","keywords":"Daemon; Privilege (computing); Computer science; Permission; Operating system; Limit (mathematics); Configuration Management (ITSM); Computer network","score_opus":0.014932048986688531,"score_gpt":0.2512778040514909,"score_spread":0.23634575506480238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159164536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006900179,0.000013456843,0.85443187,0.0015634581,0.00021027314,0.00007044919,5.960949e-8,0.00046286263,0.13634738],"genre_scores_gemma":[0.9834231,6.9079255e-7,0.015415749,0.00083404256,0.00006316478,0.0000017082355,6.6480703e-7,0.000001018059,0.0002598429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994629,0.000025297168,0.00012392527,0.00016626915,0.00012495481,0.00009665672],"domain_scores_gemma":[0.9995632,0.000028320343,0.00004184877,0.00027839563,0.00004986758,0.00003832818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014214567,0.000046847428,0.000051731222,0.00003536135,0.00009328392,0.00014189366,0.00034223584,0.000023077224,0.000012987266],"category_scores_gemma":[0.000014428175,0.000042903994,0.000021132371,0.00016963604,0.000005398164,0.0002587803,0.000018710547,0.0000415344,0.00033894306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.2324768e-7,0.000009806302,0.0000055719447,0.000002478479,8.775923e-7,0.0000017215965,0.00022819005,0.000013659547,0.00045209643,0.97843665,0.00047875787,0.020369755],"study_design_scores_gemma":[0.00045227158,0.00025177133,0.009379595,0.00007209559,0.0000039917604,0.00017486002,0.0002595074,0.90268195,0.038908534,0.014817343,0.0325858,0.00041228344],"about_ca_topic_score_codex":0.0000074925183,"about_ca_topic_score_gemma":3.300813e-7,"teacher_disagreement_score":0.9765229,"about_ca_system_score_codex":0.000025551164,"about_ca_system_score_gemma":0.000028765113,"threshold_uncertainty_score":0.43565404},"labels":[],"label_agreement":null},{"id":"W2160243077","doi":"10.1016/j.entcs.2011.11.017","title":"Proving Reachability in B using Substitution Refinement","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Security and Verification in Computing","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":"Université de Sherbrooke","funders":"","keywords":"Reachability; Substitution (logic); Computer science; Statement (logic); State (computer science); Construct (python library); Property (philosophy); Programming language; Scheme (mathematics); Theoretical computer science; Mathematics; Law","score_opus":0.030907949543989392,"score_gpt":0.2734806031087783,"score_spread":0.2425726535647889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160243077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3548262,0.00004359534,0.6441636,0.00011535075,0.00022086421,0.00015507801,8.8216986e-8,0.00006706152,0.000408139],"genre_scores_gemma":[0.84082085,0.000003585978,0.159012,0.000112519905,0.000038697803,0.00000772343,2.3151586e-7,0.0000040977857,2.8344695e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712205,0.00018955195,0.00046055624,0.000878577,0.0004470848,0.0009021895],"domain_scores_gemma":[0.9987134,0.00023455433,0.000093541115,0.00076810777,0.00009384233,0.00009655248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038050725,0.00016449257,0.00018572318,0.0003560979,0.00022659423,0.00014222505,0.001848679,0.00006493833,0.000019514357],"category_scores_gemma":[0.00028205558,0.0001596062,0.000040937935,0.0019955277,0.0010950079,0.0007215817,0.0006547209,0.00042806318,0.00000826317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007100958,0.00016020956,0.0023602203,0.000007202504,9.286415e-7,0.0000055725304,0.0013045395,0.00066605996,0.00049891573,0.97167397,1.191613e-7,0.02331518],"study_design_scores_gemma":[0.00018897784,0.00010900064,0.0063402005,0.000045574652,0.0000010222869,0.000018155046,0.000004530921,0.7513274,0.007944617,0.2338304,0.00001172014,0.00017839001],"about_ca_topic_score_codex":0.00012413747,"about_ca_topic_score_gemma":0.00003625635,"teacher_disagreement_score":0.7506614,"about_ca_system_score_codex":0.00070165313,"about_ca_system_score_gemma":0.0004800561,"threshold_uncertainty_score":0.6508552},"labels":[],"label_agreement":null},{"id":"W2160717548","doi":"10.1145/1866307.1866333","title":"A control point for reducing root abuse of file-system privileges","year":2010,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; File system; Installation; Root (linguistics); Operating system; Permission; Point (geometry); Control (management); Root cause; Software; Order (exchange); Control system; Computer security; Embedded system; Engineering","score_opus":0.01110929841408713,"score_gpt":0.23682795706570195,"score_spread":0.22571865865161483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160717548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04513618,0.000009162996,0.95009315,0.00039160502,0.0007659338,0.00028440138,0.000016741005,0.00020296698,0.0030998692],"genre_scores_gemma":[0.88175946,1.4375122e-7,0.117945425,0.0000640517,0.00012341728,0.000034516153,0.0000020344153,0.0000045278657,0.000066391214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916023,0.00002362197,0.00027634684,0.0002484023,0.000128921,0.00016247349],"domain_scores_gemma":[0.9986162,0.00050341693,0.000151122,0.0005139906,0.0001626895,0.000052591724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004483739,0.00007531097,0.00014287376,0.000060547387,0.000095650066,0.0000688967,0.0005932494,0.00005482787,0.000042001036],"category_scores_gemma":[0.00012146907,0.00006665888,0.00007183785,0.00013288445,0.000026307236,0.00019345412,0.000041198156,0.00009532259,0.000010157253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008300629,0.00007665453,0.00015752514,0.000103024,0.000018964112,4.9386915e-7,0.0018193069,0.00015864639,0.01285321,0.9736174,0.00592861,0.0052578826],"study_design_scores_gemma":[0.0009652214,0.00009047727,0.0016139417,0.00009438877,0.000008119492,0.000028449494,0.00013665843,0.93867594,0.040804207,0.0011496547,0.016209746,0.0002232062],"about_ca_topic_score_codex":0.000041350697,"about_ca_topic_score_gemma":0.000015289079,"teacher_disagreement_score":0.9724677,"about_ca_system_score_codex":0.000012443746,"about_ca_system_score_gemma":0.000046114295,"threshold_uncertainty_score":0.27182704},"labels":[],"label_agreement":null},{"id":"W2162369536","doi":"","title":"Link-Time Enforcement of Confined Types for JVM Bytecode.","year":2005,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Regina","funders":"","keywords":"Bytecode; Computer science; Java; Programming language; Java bytecode; Compile time; Modular design; Operating system; Object-oriented programming; Compiler; Java annotation; Real time Java","score_opus":0.02103203578556496,"score_gpt":0.2648892162822384,"score_spread":0.24385718049667343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162369536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012578411,0.00005115084,0.9720264,0.003069045,0.00012921824,0.00016480936,0.0000018367183,0.0001119738,0.023187695],"genre_scores_gemma":[0.7450771,0.0000040491395,0.25238004,0.0005268557,0.00014411016,0.000009326702,0.0000036368237,0.0000032831751,0.0018516278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994193,0.000009819597,0.00020566909,0.00015063629,0.00009821092,0.00011638581],"domain_scores_gemma":[0.99941486,0.00012110386,0.000075114396,0.00026236713,0.0000959448,0.000030633095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020916089,0.000054997654,0.00009029626,0.00003860358,0.000052107654,0.00003201588,0.00040102613,0.000031982392,0.00032449557],"category_scores_gemma":[0.000028141454,0.000049516402,0.000044129785,0.0000977277,0.000016530419,0.0001135631,0.0000670168,0.000028520373,0.00007702818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048059505,0.000033046403,0.000009669647,0.000013581308,0.000013112563,5.4785062e-8,0.0004531565,0.00094799744,0.0011999102,0.9077185,0.0037379714,0.08586819],"study_design_scores_gemma":[0.00028896806,0.000064787775,0.00004784309,0.0000077173445,0.000002849484,0.0000010413653,0.00000812024,0.792403,0.044547122,0.00227252,0.16027096,0.0000851073],"about_ca_topic_score_codex":0.000011429202,"about_ca_topic_score_gemma":0.0000021273738,"teacher_disagreement_score":0.905446,"about_ca_system_score_codex":0.000012728257,"about_ca_system_score_gemma":0.000039134593,"threshold_uncertainty_score":0.35529992},"labels":[],"label_agreement":null},{"id":"W2163787789","doi":"10.1109/csfw.1990.128180","title":"A logic for reasoning about security","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"","keywords":"Permission; Secrecy; Obligation; Computer science; Modal logic; Security policy; Deontic logic; Set (abstract data type); Modal; Theoretical computer science; Programming language; Computer security; Law; Political science; Epistemology","score_opus":0.04691673963045595,"score_gpt":0.2754657193086458,"score_spread":0.22854897967818982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163787789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016738095,0.0002035267,0.960619,0.0015962927,0.00027113847,0.00012077181,5.696687e-7,0.0003129147,0.035202008],"genre_scores_gemma":[0.7984036,0.000012780996,0.19974366,0.001208571,0.00011067693,0.0000177707,6.6009426e-7,0.0000034777593,0.000498808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930954,0.00002085165,0.00013157542,0.0002525225,0.00009801233,0.00018748014],"domain_scores_gemma":[0.99938375,0.0001338133,0.000047708345,0.0003212146,0.00006386811,0.000049638846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021218833,0.00006468135,0.00007370236,0.000035784375,0.00018017505,0.0001404153,0.0005004061,0.000039459675,0.00009893609],"category_scores_gemma":[0.00008955345,0.000060285154,0.00005087031,0.00018764813,0.00001618789,0.00021503303,0.00008314426,0.00006187146,0.000084101215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.582304e-7,0.000030498457,0.00008121038,0.000007655347,0.0000030620924,6.4478e-7,0.0009957962,0.000015195772,0.000018385466,0.9797535,0.007433601,0.011660004],"study_design_scores_gemma":[0.00017061726,0.000029721363,0.00013991125,0.000009866245,0.0000013012364,0.000010165711,0.00003422263,0.9268803,0.0003790936,0.03914382,0.03308575,0.00011520251],"about_ca_topic_score_codex":0.0000054236652,"about_ca_topic_score_gemma":0.0000017199992,"teacher_disagreement_score":0.9406097,"about_ca_system_score_codex":0.000016667214,"about_ca_system_score_gemma":0.0000065459685,"threshold_uncertainty_score":0.24583572},"labels":[],"label_agreement":null},{"id":"W2164550874","doi":"10.1109/cmpsac.1978.810551","title":"What MININET Has Taught us about Programming Style","year":2005,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Task (project management); Blocking (statistics); Programming style; Programming language; Metaprogramming; Programming paradigm; Computer network","score_opus":0.03341698588416393,"score_gpt":0.27200723256109904,"score_spread":0.23859024667693512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164550874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05397433,0.0012312836,0.9191077,0.014988258,0.0015861669,0.0002790426,3.9098643e-7,0.000930189,0.007902682],"genre_scores_gemma":[0.6667063,0.00002910482,0.32968044,0.0017142175,0.00035498544,0.000013748095,0.0000025448185,0.000006815932,0.0014918237],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988899,0.000033381017,0.00022662,0.00034809875,0.00021818471,0.0002838019],"domain_scores_gemma":[0.99919796,0.00007657939,0.00007378299,0.00049116375,0.00007008285,0.0000904444],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026728405,0.00010619066,0.0000997136,0.00006274143,0.0002255225,0.001796507,0.00075260515,0.000053336527,0.00012918889],"category_scores_gemma":[0.000022746515,0.00009933104,0.00004831886,0.00031963654,0.000046656256,0.001457462,0.00017980079,0.00010551214,0.000285827],"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.0000014962407,0.00010324583,0.00043068628,0.000008705609,0.000010144792,0.0000034597683,0.0030865807,0.00021119615,0.0000744027,0.076573506,0.0061326423,0.91336393],"study_design_scores_gemma":[0.00018581406,0.000024745152,0.0015158223,0.000025873414,0.0000020174427,0.000019166098,0.00014807246,0.17890899,0.0018114097,0.00014868945,0.8170296,0.0001798373],"about_ca_topic_score_codex":0.000022501237,"about_ca_topic_score_gemma":0.000021720147,"teacher_disagreement_score":0.9131841,"about_ca_system_score_codex":0.000030286907,"about_ca_system_score_gemma":0.000048603204,"threshold_uncertainty_score":0.99923974},"labels":[],"label_agreement":null},{"id":"W2168705386","doi":"10.1016/j.cose.2010.11.004","title":"Extending the enforcement power of truncation monitors using static analysis","year":2010,"lang":"en","type":"article","venue":"Computers & Security","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":25,"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é Laval","funders":"","keywords":"Computer science; A priori and a posteriori; Truncation (statistics); Intuition; Enforcement; Alphabet; Static analysis; Computer security; Set (abstract data type); Range (aeronautics); Law; Programming language; Machine learning","score_opus":0.017786227151288896,"score_gpt":0.2854726528457654,"score_spread":0.2676864256944765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168705386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46443778,0.000030592502,0.53420013,0.00018812317,0.00085544185,0.00011633744,0.0000015835354,0.000059332124,0.00011067196],"genre_scores_gemma":[0.9580265,0.000004268101,0.041727986,0.00013824156,0.000085798696,0.000003996572,0.0000045699007,0.0000060236794,0.0000025910595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.00012910867,0.00045477354,0.00037608662,0.000403612,0.00025851498],"domain_scores_gemma":[0.9981117,0.00032610018,0.00035828789,0.00094087335,0.00018151931,0.00008149032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803728,0.00015671099,0.00023349756,0.0002540988,0.00031802728,0.0001832276,0.0012170852,0.00006442899,0.000031123807],"category_scores_gemma":[0.000049488066,0.00013033609,0.00018349507,0.0013503672,0.00011440263,0.0003522043,0.0003200648,0.00029344516,0.0000047947324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000215398,0.000585615,0.023320647,0.00012729765,0.0011313747,0.000009627556,0.06936303,0.052705243,0.007641443,0.8131309,0.00077477156,0.031188488],"study_design_scores_gemma":[0.00015164676,0.00002858129,0.010662569,0.00001755615,0.00007023409,0.000006109867,0.00019064853,0.9810598,0.0018052319,0.0050160815,0.00081915845,0.00017241281],"about_ca_topic_score_codex":0.00016421222,"about_ca_topic_score_gemma":0.000012647575,"teacher_disagreement_score":0.9283545,"about_ca_system_score_codex":0.00004795715,"about_ca_system_score_gemma":0.000070174836,"threshold_uncertainty_score":0.53149515},"labels":[],"label_agreement":null},{"id":"W2172358039","doi":"","title":"Turtles all the way down: research challenges in user-based attestation","year":2007,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Trustworthiness; Trusted Computing; Computer science; Turtle (robot); Dependency (UML); Computer security; Direct Anonymous Attestation; Loop (graph theory); Human–computer interaction; Internet privacy; Software engineering","score_opus":0.25550379921802824,"score_gpt":0.39776967465415985,"score_spread":0.14226587543613162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172358039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14751899,0.000909564,0.7649166,0.059122518,0.0004000042,0.0003952745,3.617479e-7,0.00025956708,0.026477145],"genre_scores_gemma":[0.9844923,0.000057687834,0.014866879,0.0004376451,0.000067093526,0.0000076286933,0.0000010716943,0.0000035570074,0.000066108274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998672,0.0001937054,0.00018738092,0.0002706943,0.00037875876,0.0002974567],"domain_scores_gemma":[0.9977569,0.0015722136,0.000034482575,0.00046851957,0.00012734628,0.00004053017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044200816,0.00006036254,0.00005595362,0.0001693244,0.00014679608,0.00011976598,0.0008023145,0.000047637448,0.000015504585],"category_scores_gemma":[0.00013018728,0.000042854783,0.000020810647,0.00048603155,0.000057361456,0.00017905347,0.000106136205,0.00023563541,0.00006960504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009703869,0.00014199743,0.0012613083,0.000022054966,0.0000048466127,0.000011042128,0.01017827,0.00089845125,0.0005125304,0.84953153,0.0014924969,0.13593578],"study_design_scores_gemma":[0.0009556377,0.00020816547,0.23046046,0.00009741576,0.0000022755564,0.000013019487,0.005414028,0.5513763,0.018747136,0.027306149,0.16494253,0.0004769206],"about_ca_topic_score_codex":0.000094076466,"about_ca_topic_score_gemma":0.00047185033,"teacher_disagreement_score":0.83697337,"about_ca_system_score_codex":0.00004990275,"about_ca_system_score_gemma":0.00004222498,"threshold_uncertainty_score":0.17475674},"labels":[],"label_agreement":null},{"id":"W2172469128","doi":"","title":"Security Hardening of Open Source Software","year":2008,"lang":"en","type":"article","venue":"˜The œopen source business resource","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"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":"Open source; Computer science; Open source software; Software; Computer security; Operating system","score_opus":0.04322804277354034,"score_gpt":0.2768294931522868,"score_spread":0.23360145037874644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172469128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084507905,0.0004826777,0.902229,0.0017448378,0.00028570814,0.0011150182,0.0000068622558,0.00045538577,0.009172564],"genre_scores_gemma":[0.97395635,0.00002337253,0.019157393,0.0016909869,0.0002834134,0.000070779584,0.00001669081,0.00007466647,0.004726333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645895,0.00043352353,0.0007784902,0.00095683784,0.0007560926,0.00061609637],"domain_scores_gemma":[0.9955881,0.00063247234,0.00071046443,0.002359676,0.0005344007,0.00017484868],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014209021,0.00037822186,0.00060851336,0.00016319499,0.0016430878,0.0012278481,0.013403365,0.00017073801,0.00008804469],"category_scores_gemma":[0.00025894766,0.00032230356,0.0001432194,0.0020896115,0.00041712957,0.0010777625,0.008836825,0.00038842548,0.000098793294],"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.0008457037,0.0027421338,0.06449794,0.0008957744,0.00073555176,0.00026174067,0.17978081,0.11594822,0.0015827379,0.029078418,0.18019336,0.4234376],"study_design_scores_gemma":[0.001136302,0.000044693625,0.011557054,0.00020954548,0.000022969574,0.00036956836,0.0007698357,0.039376415,0.00047680427,0.0009269984,0.9444476,0.00066223403],"about_ca_topic_score_codex":0.0014273195,"about_ca_topic_score_gemma":0.00003958505,"teacher_disagreement_score":0.88944846,"about_ca_system_score_codex":0.00007281384,"about_ca_system_score_gemma":0.00029121412,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W2174935658","doi":"10.1145/2150976.2150992","title":"Comprehensive kernel instrumentation via dynamic binary translation","year":2012,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":48,"is_retracted":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":"Binary translation; Computer science; sysfs; Configfs; Kernel (algebra); Instrumentation (computer programming); Operating system; Interrupt; Overhead (engineering); Linux kernel; Embedded system; Software","score_opus":0.037560473751941305,"score_gpt":0.2913144684051619,"score_spread":0.25375399465322057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174935658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15650038,0.00020344608,0.84027946,0.00049969414,0.0005591497,0.0001002589,3.5043965e-7,0.00019503503,0.0016621992],"genre_scores_gemma":[0.9122587,0.00001066068,0.08727104,0.00036585296,0.000043351665,0.0000050930803,0.000009831904,0.0000038719463,0.00003161802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.00005421176,0.00016438945,0.00015714738,0.00014970053,0.0001805339],"domain_scores_gemma":[0.99954885,0.00007032914,0.000058119418,0.00021805211,0.00004324484,0.00006142798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011324445,0.000076345816,0.00006464802,0.00007179072,0.0001252146,0.00005558757,0.0002445391,0.00004044803,0.00003495798],"category_scores_gemma":[0.0000024131718,0.00007708255,0.000033026266,0.0002538546,0.000019023564,0.00096519623,0.000043756147,0.00006769132,0.0001453412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012917901,0.0002443681,0.0037493913,0.00004379576,0.000028718447,0.0000010147431,0.008540191,0.0006068549,0.02067447,0.093960606,0.00028291825,0.8718548],"study_design_scores_gemma":[0.0003385723,0.000045523182,0.0491434,0.000007792165,0.000004113829,0.00001999191,0.0001542549,0.9397661,0.00244742,0.0018406947,0.006041452,0.00019069867],"about_ca_topic_score_codex":0.0000150937,"about_ca_topic_score_gemma":0.0000013577506,"teacher_disagreement_score":0.9391592,"about_ca_system_score_codex":0.00003824513,"about_ca_system_score_gemma":0.000013333861,"threshold_uncertainty_score":0.31433353},"labels":[],"label_agreement":null},{"id":"W2181998474","doi":"10.26443/msurj.v8i1.112","title":"Proof-carrying authorization in distributed systems with Beluga: a case study","year":2013,"lang":"en","type":"article","venue":"McGill Science Undergraduate Research Journal","topic":"Security and Verification in Computing","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":"Computer science; Mathematical proof; Programmer; Programming language; Authorization; Debugging; ENCODE; Proof of concept; Formal methods; Computer security; Operating system","score_opus":0.08863228540645554,"score_gpt":0.36788151232496347,"score_spread":0.27924922691850795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181998474","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.56238437,0.000059143284,0.4297389,0.0052364217,0.00044791825,0.0015046322,0.000002189,0.00009668195,0.00052972464],"genre_scores_gemma":[0.9970492,0.000009859865,0.002741129,0.00001413492,0.00006802659,0.00007497929,5.790637e-7,0.000009345688,0.00003273963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944549,0.00085936004,0.00052903744,0.0006922699,0.0023846198,0.0010797795],"domain_scores_gemma":[0.9967372,0.0003126679,0.00020109848,0.0005448004,0.0017353705,0.00046888887],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009197039,0.00016485462,0.00019882913,0.0011047106,0.0037225187,0.002799395,0.0017597147,0.000045780216,0.0000035336275],"category_scores_gemma":[0.00056120363,0.00012548923,0.000028741953,0.0068794703,0.0004031511,0.0031113378,0.00050020457,0.0010050576,0.00002666056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007645717,0.0055328975,0.08536963,0.00024635802,0.0001700522,0.026650041,0.018774059,0.12924561,0.008120724,0.5722541,0.0015908099,0.15196922],"study_design_scores_gemma":[0.0011563065,0.0008977267,0.0032337292,0.00020983243,0.0000040615923,0.014535286,0.010918585,0.9583638,0.000398595,0.009566529,0.0003280766,0.00038752597],"about_ca_topic_score_codex":0.0015085975,"about_ca_topic_score_gemma":0.00011862947,"teacher_disagreement_score":0.82911813,"about_ca_system_score_codex":0.00077791064,"about_ca_system_score_gemma":0.00061019656,"threshold_uncertainty_score":0.9982358},"labels":[],"label_agreement":null},{"id":"W2185999939","doi":"10.22215/etd/2011-07053","title":"Trust models for remote hosts","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.05871380196949262,"score_gpt":0.2951963343635037,"score_spread":0.23648253239401107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185999939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0006709014,0.00014487698,0.8899901,0.000051075804,0.0016750586,0.0002918993,0.0000022963957,0.00025324407,0.10692056],"genre_scores_gemma":[0.06857625,0.00010061517,0.843825,0.00063421146,0.0004921975,0.000053152726,0.00040939715,0.000060493934,0.08584871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.000016988073,0.0002654686,0.00047407823,0.00015817118,0.0002080498],"domain_scores_gemma":[0.99888736,0.00007356762,0.00018020393,0.00058593246,0.0002139263,0.000059016595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871552,0.00016778044,0.00017706932,0.00011491099,0.00015243879,0.00013594452,0.0010699156,0.00022128067,0.000027494052],"category_scores_gemma":[0.000026957927,0.00016804678,0.00012109039,0.00015354464,0.000007324616,0.00029732508,0.00004064996,0.00013634378,0.00004331402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014035163,0.000025508047,9.0341354e-7,0.00010620878,0.000020160604,6.7508773e-7,0.002857601,0.000053357795,0.000025897378,0.8388458,0.0031060302,0.15494385],"study_design_scores_gemma":[0.00016084568,0.000037110924,0.00005535076,0.00006268053,0.000009896511,0.0000021912092,0.000093415685,0.80496836,0.0021792618,0.18469824,0.00742671,0.00030595623],"about_ca_topic_score_codex":0.00008523778,"about_ca_topic_score_gemma":0.000036015397,"teacher_disagreement_score":0.80491495,"about_ca_system_score_codex":0.000021052296,"about_ca_system_score_gemma":0.00011437008,"threshold_uncertainty_score":0.6852749},"labels":[],"label_agreement":null},{"id":"W2199032704","doi":"","title":"Using admissible interference to detect denial of service vulnerabilities","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cryptographic protocol; Process calculus; Cryptographic primitive; Bisimulation; Cryptography; Nondeterministic algorithm; Theoretical computer science; Protocol (science); Property (philosophy); Denial-of-service attack; Computer security; Universal composability; Computer network","score_opus":0.03515641318705895,"score_gpt":0.2756402924700026,"score_spread":0.24048387928294365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199032704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17790791,0.0002298791,0.8196762,0.0009353383,0.00019872896,0.00029868435,0.000004543452,0.0003197475,0.00042897195],"genre_scores_gemma":[0.5810215,0.000005044139,0.4176347,0.0012143085,0.000030691797,0.000040663082,5.5454086e-7,0.000013466871,0.00003907405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788177,0.00025460412,0.00053294277,0.00050067605,0.00031061016,0.0005193826],"domain_scores_gemma":[0.9978886,0.00022036975,0.00021196326,0.001091773,0.00029989166,0.00028739244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008646323,0.00023878842,0.00030343418,0.000382824,0.00023472251,0.00020387059,0.0012457843,0.00015268421,0.000029889252],"category_scores_gemma":[0.00053666503,0.00025888227,0.00009989074,0.0013007857,0.000042725238,0.0004497623,0.00033468643,0.00027495978,0.0000116358715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009832048,0.0003325568,0.01026428,0.0002808634,0.000078502635,0.000026020907,0.007153376,0.041793223,0.15576881,0.7478428,0.0006493322,0.035711925],"study_design_scores_gemma":[0.00037960545,0.00022220553,0.0025222828,0.0001782619,0.000015868158,0.00016847822,0.00025858404,0.55823475,0.4135367,0.022059653,0.0018170557,0.0006065802],"about_ca_topic_score_codex":0.0038621556,"about_ca_topic_score_gemma":0.0009164172,"teacher_disagreement_score":0.7257831,"about_ca_system_score_codex":0.00024719877,"about_ca_system_score_gemma":0.00044278,"threshold_uncertainty_score":0.99998635},"labels":[],"label_agreement":null},{"id":"W2212590785","doi":"10.1007/978-3-662-45402-2_76","title":"Quantifying Overt Hardware Attacks: Using ART Schema","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Security and Verification in Computing","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 Victoria","funders":"","keywords":"Computer science; Schema (genetic algorithms); Embedded system; Computer security; Computer hardware; Information retrieval","score_opus":0.034319830718590634,"score_gpt":0.2616093548069421,"score_spread":0.22728952408835146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212590785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007983245,0.0016002945,0.99303824,0.00016358658,0.0006639367,0.00019734049,0.0000013604304,0.00043408154,0.0038213143],"genre_scores_gemma":[0.5406798,0.00026514535,0.45151168,0.001415516,0.0028650507,0.000029415252,0.000057170917,0.00042032567,0.0027558687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973882,0.000024670833,0.0005855085,0.00087404356,0.00047937004,0.000648214],"domain_scores_gemma":[0.99802303,0.00077972887,0.00019656247,0.0007721502,0.00009387522,0.00013467966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003224375,0.0005425549,0.0006216735,0.0005727856,0.00011340147,0.0002152106,0.0009841473,0.00066271913,0.000031705757],"category_scores_gemma":[0.0005563601,0.00059709913,0.0002140708,0.0004263129,0.000024318688,0.00015321409,0.00023432623,0.0015840384,0.000069558984],"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.000010700797,0.000031313524,0.00006274854,0.00032674716,0.00010787803,0.00009254562,0.00029772788,0.48338863,0.002550442,0.43279344,0.00020837906,0.080129445],"study_design_scores_gemma":[0.00017367762,0.000037673177,0.000013206801,0.00045893923,0.000014498669,0.00006859915,1.0051435e-7,0.9445983,0.0014494945,0.0027281616,0.049778655,0.000678663],"about_ca_topic_score_codex":0.000006814697,"about_ca_topic_score_gemma":0.0000044025187,"teacher_disagreement_score":0.54152656,"about_ca_system_score_codex":0.00039717447,"about_ca_system_score_gemma":0.000112597896,"threshold_uncertainty_score":0.99964803},"labels":[],"label_agreement":null},{"id":"W2221612124","doi":"10.1007/978-3-319-11164-3_8","title":"Robust Consistency Checking for Modern Filesystems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Computer science; Consistency (knowledge bases); File system; Metadata; Model checking; Programming language; Weak consistency; Operating system; Data consistency; Database; Strong consistency; Artificial intelligence; Mathematics","score_opus":0.050179562670788894,"score_gpt":0.2545792941610283,"score_spread":0.20439973149023943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221612124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00001970094,0.0005906534,0.99100006,0.0005741776,0.0033077747,0.00066246965,0.000007592152,0.0002819657,0.003555611],"genre_scores_gemma":[0.22715269,0.000020610358,0.7689702,0.0017474478,0.0014738146,0.000042944866,0.000013709426,0.000060089264,0.0005185312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956813,0.00004435226,0.00079527235,0.0018931408,0.0008305045,0.0007554156],"domain_scores_gemma":[0.99583286,0.0012051153,0.0005431554,0.001753223,0.00048385622,0.00018180255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016801825,0.00054372475,0.0006711845,0.00065060094,0.00058746396,0.000857778,0.0038959414,0.00041278027,0.000010034689],"category_scores_gemma":[0.00022844989,0.00054515246,0.00022813262,0.00042316227,0.0005037186,0.00036567976,0.00091442734,0.0006306095,0.000029804973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049264163,0.000023909253,0.000025465994,0.00020642372,0.000017682018,0.000011744493,0.0013613513,0.112041585,0.00008003866,0.24266963,0.00010011324,0.6434571],"study_design_scores_gemma":[0.00023893868,0.000100978534,0.000013102345,0.0005062063,0.0000068658455,0.000053153042,1.7876233e-7,0.8649258,0.00032584727,0.1290527,0.004199161,0.0005770517],"about_ca_topic_score_codex":0.000014003525,"about_ca_topic_score_gemma":0.000024675579,"teacher_disagreement_score":0.7528842,"about_ca_system_score_codex":0.00029530036,"about_ca_system_score_gemma":0.00057453266,"threshold_uncertainty_score":0.9997},"labels":[],"label_agreement":null},{"id":"W2224472688","doi":"","title":"An experience report on extracting and viewing memory events via wireshark","year":2014,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Calgary","funders":"","keywords":"Computer science; Memory map; Interleaved memory; Flat memory model; Extended memory; Memory leak; Memory refresh; Overlay; Memory protection; Memory errors; Registered memory; Operating system; Embedded system; Memory management; Computer memory; Semiconductor memory","score_opus":0.03058660228793437,"score_gpt":0.30679579808644947,"score_spread":0.2762091957985151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224472688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39183766,0.000014468051,0.60377735,0.0001612496,0.00030967357,0.0000496121,3.4028925e-8,0.00015584666,0.0036940938],"genre_scores_gemma":[0.963241,0.000001920921,0.035891905,0.00066288654,0.00011435341,0.0000063287266,7.37187e-7,0.0000049496407,0.00007592416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987948,0.00008364377,0.00024015245,0.00048266797,0.00022235255,0.00017640115],"domain_scores_gemma":[0.99891734,0.00016519366,0.00012646042,0.0006477111,0.000041997388,0.00010131487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651202,0.000093669536,0.00009646475,0.000049768743,0.000272951,0.00013267892,0.00044748306,0.000037424557,0.000017559589],"category_scores_gemma":[0.00013993225,0.00008847966,0.00002124949,0.00014037907,0.00002137693,0.00066040445,0.00010344256,0.00010622793,0.000016078735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586784,0.00034379415,0.020986794,0.000064522916,0.000017523258,0.00009045594,0.027047161,0.0006561658,0.017748153,0.05640285,0.0003056188,0.87632436],"study_design_scores_gemma":[0.00024125009,0.00012996794,0.025916085,0.00007911994,0.0000026801488,0.00042734228,0.00030576525,0.9471514,0.01547137,0.002783058,0.0070853005,0.00040665784],"about_ca_topic_score_codex":0.000031521457,"about_ca_topic_score_gemma":9.761493e-7,"teacher_disagreement_score":0.94649523,"about_ca_system_score_codex":0.000015605201,"about_ca_system_score_gemma":0.000013100858,"threshold_uncertainty_score":0.3608096},"labels":[],"label_agreement":null},{"id":"W2266339742","doi":"10.1007/978-3-319-30303-1_7","title":"Runtime Enforcement with Partial Control","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Enforcement; Set (abstract data type); Security policy; Field (mathematics); Distributed computing; Control (management); Computer security; Programming language; Artificial intelligence; Law","score_opus":0.013389206723684367,"score_gpt":0.2319555595913657,"score_spread":0.21856635286768133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266339742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022326123,0.00015180203,0.9855619,0.0012102578,0.0013329539,0.00042086781,0.000004557034,0.00021384367,0.011081503],"genre_scores_gemma":[0.73203677,0.000023590874,0.2626457,0.003202015,0.0012678155,0.000024854164,0.000002910196,0.00004647084,0.0007498747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960879,0.000036577967,0.000529561,0.0015018106,0.0011178713,0.0007262758],"domain_scores_gemma":[0.9971401,0.00051148416,0.00037115216,0.0015130668,0.0002692881,0.00019488944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085488503,0.00049684936,0.0004804818,0.00049927854,0.00034809663,0.0005570686,0.0031493471,0.00023266287,0.00008633905],"category_scores_gemma":[0.000042134398,0.0003635568,0.000104051505,0.00037385183,0.00068263494,0.0005786232,0.0006689266,0.00051699975,0.00014004433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022531529,0.00003251962,0.00009134678,0.000026354282,0.000031631025,0.00006941644,0.00069503894,0.015694106,0.00008778409,0.43595248,0.00002890813,0.54726785],"study_design_scores_gemma":[0.0016679355,0.00056167494,0.00007289561,0.00091829005,0.00002112545,0.00013805971,1.7899757e-7,0.8402685,0.0025016046,0.12532629,0.027077237,0.001446208],"about_ca_topic_score_codex":0.000009775277,"about_ca_topic_score_gemma":0.000011066303,"teacher_disagreement_score":0.8245744,"about_ca_system_score_codex":0.00028570948,"about_ca_system_score_gemma":0.0006220897,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W2267900762","doi":"","title":"Weakest Precondition Calculus, Revisited using Why3","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Security and Verification in Computing","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":"Prevention of Organ Failure","funders":"","keywords":"Precondition; Soundness; Predicate transformer semantics; Calculus (dental); Proof calculus; Structural proof theory; Computer science; Focus (optics); Natural deduction; Semantics (computer science); Mathematics; Programming language; Proof theory; Mathematical proof; Operational semantics","score_opus":0.029564748594810564,"score_gpt":0.2560062323516653,"score_spread":0.22644148375685474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267900762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027252559,0.00171247,0.9498339,0.003722379,0.0007641109,0.00047053752,0.000035403446,0.0005894217,0.015619191],"genre_scores_gemma":[0.7440167,0.00022516937,0.2539215,0.00020266483,0.00012981017,0.00004378915,0.00039502687,0.000044669232,0.0010206436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99232024,0.0047795856,0.00075183914,0.001075636,0.00053963356,0.00053306995],"domain_scores_gemma":[0.9924904,0.0010521009,0.000896195,0.0033402503,0.0019451657,0.0002759068],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061759274,0.00040483318,0.00042469124,0.00028123375,0.0006308342,0.0010474996,0.002726138,0.00041798738,0.00012364642],"category_scores_gemma":[0.0009099136,0.00047185775,0.0002534243,0.00065569923,0.00016057903,0.00059565314,0.0025112107,0.0008857822,0.000102792255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060039383,0.00090578693,0.0019366309,0.0005304106,0.00014627847,0.000006398541,0.020093048,0.0006190589,0.0040573394,0.8940425,0.002173158,0.0754834],"study_design_scores_gemma":[0.00059372274,4.2540148e-7,0.0051625087,0.0037932524,0.00008947298,0.000070020564,0.00008582613,0.91462886,0.03491568,0.011196052,0.02816449,0.0012996868],"about_ca_topic_score_codex":0.0006128834,"about_ca_topic_score_gemma":0.00009297157,"teacher_disagreement_score":0.9140098,"about_ca_system_score_codex":0.0002556175,"about_ca_system_score_gemma":0.00033848846,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W2269942371","doi":"10.1002/spe.2388","title":"SafeType: detecting type violations for type‐basedalias analysis of C","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","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 Alberta; IBM (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Computer science; Compiler; Programming language; Memory safety; Type inference; Static analysis; Benchmark (surveying); Type safety; Spec#; Context (archaeology); Java; Compile time; Database; Inference; Artificial intelligence","score_opus":0.1252414425623855,"score_gpt":0.39617073386537743,"score_spread":0.2709292913029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269942371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719953,0.00041942846,0.9212834,0.00034424927,0.00036786305,0.00009934978,0.0000018850268,0.00008872466,0.00019555523],"genre_scores_gemma":[0.7863934,0.000020422947,0.21328545,0.00024011052,0.000027888547,0.000007953855,0.0000034375605,0.0000032993323,0.000018039962],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.00005512047,0.0002042743,0.0002504371,0.00016025576,0.0001287059],"domain_scores_gemma":[0.9977893,0.0009929269,0.00019141562,0.00031505054,0.00063199934,0.00007926498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048816472,0.000069603884,0.00013220271,0.000117998075,0.00015994736,0.00007620046,0.00026096104,0.000042473515,0.0000046931978],"category_scores_gemma":[0.0046205474,0.00007006331,0.000035322068,0.0013617929,0.000041134725,0.00077593315,0.000093272865,0.0000664884,0.0000039933007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096062775,0.000801758,0.07235657,0.0001992276,0.0015457598,0.000019012694,0.39640182,0.012868491,0.004088079,0.18055196,0.0019330004,0.3282737],"study_design_scores_gemma":[0.0013830895,0.001178843,0.009324323,0.00008941935,0.0009662339,0.00007311393,0.030390603,0.780576,0.010063635,0.0055627786,0.15924361,0.0011483512],"about_ca_topic_score_codex":0.00007667886,"about_ca_topic_score_gemma":0.000006193757,"teacher_disagreement_score":0.7677075,"about_ca_system_score_codex":0.000020588059,"about_ca_system_score_gemma":0.00010861811,"threshold_uncertainty_score":0.553156},"labels":[],"label_agreement":null},{"id":"W2284208697","doi":"10.11575/prism/31375","title":"The Ployglot Computer","year":2013,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Security and Verification in Computing","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","keywords":"Computer science","score_opus":0.011940126266946465,"score_gpt":0.1859642454220909,"score_spread":0.17402411915514443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284208697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.019795755,0.00006805461,0.9726629,0.0026710632,0.00021953818,0.00010419568,1.5836974e-8,0.000093193325,0.0043852855],"genre_scores_gemma":[0.27321,0.00007537248,0.7245587,0.00038774835,0.000047207417,5.987511e-7,0.0000013189396,0.0000067019246,0.0017123334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939024,0.00005203285,0.000080501566,0.000166881,0.00016243733,0.00014788096],"domain_scores_gemma":[0.9992194,0.0001515236,0.00008485909,0.00039168843,0.000094033516,0.000058461424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000144981,0.0000572743,0.0000775644,0.00003856992,0.00038508777,0.000075815515,0.0011262215,0.000039003207,0.000034030374],"category_scores_gemma":[0.000008330837,0.00005359721,0.000055665423,0.00014930188,0.000106922,0.00037074354,0.0003567095,0.000100390345,0.00019653706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020984107,0.000031648025,0.0003048346,0.0000061816463,0.000018709507,0.0000029197895,0.0017912994,0.0000027099502,0.000078897865,0.1456452,0.014270049,0.83784544],"study_design_scores_gemma":[0.00019746418,0.000036421407,0.026147645,0.000008663478,0.000003253673,0.0000035346955,0.000030481247,0.8971543,0.00007846155,0.0059649143,0.070273444,0.000101426675],"about_ca_topic_score_codex":0.0003358363,"about_ca_topic_score_gemma":0.0000017403153,"teacher_disagreement_score":0.8971516,"about_ca_system_score_codex":0.000017549404,"about_ca_system_score_gemma":0.000031229603,"threshold_uncertainty_score":0.29618227},"labels":[],"label_agreement":null},{"id":"W2284355254","doi":"10.1145/2834050.2834100","title":"A First Step Towards Leveraging Commodity Trusted Execution Environments for Network Applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":65,"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; Anonymity; Computer security; Trusted Computing; Popularity; Protocol (science); Commoditization; Direct Anonymous Attestation; Computer network; Testbed","score_opus":0.07230726937960268,"score_gpt":0.27681062756445357,"score_spread":0.20450335818485088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284355254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058663223,0.000064625536,0.9948536,0.0012607512,0.00029880958,0.0004952388,0.000002877841,0.00018732483,0.0022501],"genre_scores_gemma":[0.63563687,0.0000064817027,0.36285,0.0006239629,0.00031866858,0.00027538577,0.000027628943,0.00000830948,0.00025266575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897254,0.000041297655,0.00021993578,0.00032563045,0.00020034914,0.00024022759],"domain_scores_gemma":[0.99912566,0.000103570004,0.00009678669,0.00050273293,0.00004827433,0.00012296153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005131813,0.00010078754,0.00010906031,0.000033768705,0.0003491733,0.0001297821,0.00061042956,0.00005604713,0.000006767303],"category_scores_gemma":[0.000023494942,0.000104108345,0.000048892314,0.00024358276,0.000029381024,0.0002724493,0.00018953317,0.000077137265,0.000041067513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000312143,0.0004058942,0.0017826444,0.00005669619,0.000062449784,0.0000010495452,0.0030972254,0.04741907,0.000032541135,0.7235562,0.073771656,0.14978334],"study_design_scores_gemma":[0.00038131324,0.000026368241,0.0009268228,0.000006761405,0.0000042959127,0.0000033302993,0.000055188164,0.62794477,0.00009773246,0.0083236275,0.36210415,0.00012562994],"about_ca_topic_score_codex":0.000036855643,"about_ca_topic_score_gemma":0.000008744285,"teacher_disagreement_score":0.7152326,"about_ca_system_score_codex":0.00012106361,"about_ca_system_score_gemma":0.000053117008,"threshold_uncertainty_score":0.42454153},"labels":[],"label_agreement":null},{"id":"W2291238432","doi":"10.1109/worldcis.2015.7359413","title":"Multiagent trust management of web services: the “asynchronous computing environment profile unification methodology” (acepum)","year":2015,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Web service; WS-Policy; Service-oriented architecture; Interoperability; SOAP; Services computing; Asynchronous communication; WS-I Basic Profile; World Wide Web; Web application security; Web development; Computer network","score_opus":0.09311230390025756,"score_gpt":0.29928498692330124,"score_spread":0.2061726830230437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291238432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04121252,0.00022160418,0.9503531,0.0008989132,0.0003553118,0.00045261908,0.0000013182404,0.00014224401,0.006362403],"genre_scores_gemma":[0.61330533,0.000028246915,0.38632593,0.00016962305,0.000033521508,0.000013931209,0.0000050096573,0.000005442318,0.000112935166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825954,0.00034395614,0.00041718542,0.00040312493,0.00034727616,0.00022893032],"domain_scores_gemma":[0.9984843,0.00018843997,0.00027494,0.00089820207,0.000072111405,0.000082010905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018275622,0.0001379037,0.00015907623,0.000060134727,0.0001667468,0.000069002206,0.0012674949,0.000055484736,0.000031779204],"category_scores_gemma":[0.000009264322,0.00010342401,0.000055188946,0.0002700801,0.00007764744,0.00015757675,0.000579495,0.00011335333,0.00010878865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002995023,0.0006971821,0.0025509323,0.0004868543,0.00028111215,0.0000108861495,0.027958201,0.034715943,0.0026245946,0.6798982,0.0012807364,0.2494654],"study_design_scores_gemma":[0.0005122571,0.0000628413,0.0041957544,0.000037984715,0.000020640218,0.000009514281,0.004129976,0.97922885,0.003734398,0.0012441745,0.0066428166,0.00018081137],"about_ca_topic_score_codex":0.00005657729,"about_ca_topic_score_gemma":0.0000022220088,"teacher_disagreement_score":0.9445129,"about_ca_system_score_codex":0.00009578677,"about_ca_system_score_gemma":0.00003809745,"threshold_uncertainty_score":0.42175087},"labels":[],"label_agreement":null},{"id":"W2293837963","doi":"10.1145/2818000.2818034","title":"Proactive Security Analysis of Changes in Virtualized Infrastructures","year":2015,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"Engineering and Physical Sciences Research Council; Horizon 2020 Framework Programme","keywords":"Computer science; Cloud computing; Computer security; Insider threat; Multitenancy; Insider; Isolation (microbiology); Cloud computing security; Elasticity (physics); Risk analysis (engineering); Business; Software","score_opus":0.035958868923261056,"score_gpt":0.29453421738462987,"score_spread":0.2585753484613688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293837963","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.6115149,0.00007324257,0.3785284,0.0006306088,0.00019740486,0.00016672723,0.000003864637,0.00011247449,0.008772356],"genre_scores_gemma":[0.98549396,0.0000027703131,0.014334348,0.0001338874,0.000013799981,0.000005099444,0.0000027694198,0.0000015455021,0.000011815436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992171,0.0000902396,0.00017162485,0.00020966398,0.00020157655,0.00010981812],"domain_scores_gemma":[0.9993447,0.00008581686,0.000096108306,0.00030359617,0.00011658849,0.000053182317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003820467,0.00006449958,0.00019187784,0.00040848515,0.000017597093,0.000032183554,0.0004315912,0.00004221269,0.000023450102],"category_scores_gemma":[0.00009594701,0.000057070607,0.000040041832,0.0018340026,0.000030548017,0.00016459923,0.0001375866,0.00006960827,0.0000017989976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047031608,0.00025740874,0.047916137,0.000022894921,0.00065895537,0.0000049376745,0.08502174,0.0053695044,0.00068646885,0.8403776,0.0008907498,0.018746568],"study_design_scores_gemma":[0.000611566,0.00008223085,0.08195966,0.000007960513,0.00005908402,0.0000015981024,0.001205051,0.86577195,0.016112467,0.033293754,0.0006823614,0.00021232407],"about_ca_topic_score_codex":0.00028187595,"about_ca_topic_score_gemma":0.0004168362,"teacher_disagreement_score":0.86040246,"about_ca_system_score_codex":0.000033241213,"about_ca_system_score_gemma":0.00005205095,"threshold_uncertainty_score":0.23272718},"labels":[],"label_agreement":null},{"id":"W23711711","doi":"10.1016/s1995-7645(13)60079-6","title":"Compatibility is not transparency: VMM detection myths and realities","year":2007,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nutrasource","funders":"","keywords":"Hypervisor; Computer science; Transparency (behavior); Ranging; Adversary; Operating system; Computer security; Embedded system; Computer hardware; Virtualization; Cloud computing","score_opus":0.0343666966614161,"score_gpt":0.27797493145575286,"score_spread":0.24360823479433677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23711711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14727977,0.000028805347,0.8448047,0.00062343624,0.0002019745,0.00006531095,0.0000010505329,0.00018641513,0.0068085557],"genre_scores_gemma":[0.9829195,0.000012572516,0.01618326,0.00075690704,0.00004414636,0.0000012917714,5.455097e-7,0.0000023331506,0.00007943267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991376,0.00003122665,0.00022408397,0.0002898202,0.00015547496,0.00016179428],"domain_scores_gemma":[0.9993532,0.00016135794,0.000045953915,0.00031663128,0.000059568378,0.00006333585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064798957,0.000073646,0.00008538907,0.000054585533,0.00017737431,0.000091675174,0.00022306341,0.000047281257,0.000017823615],"category_scores_gemma":[0.000018576395,0.0000710202,0.00002590082,0.00018618946,0.00005097698,0.00025163483,0.000041545987,0.00008443336,0.00000934038],"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.00003448734,0.000117426614,0.0051739854,0.00009549134,0.000021754411,0.00000393096,0.030162701,0.000024107376,0.0038392285,0.24347542,0.00046090886,0.7165905],"study_design_scores_gemma":[0.0008272638,0.00023043038,0.26786935,0.00003791161,0.000012228698,0.000056650573,0.0016306965,0.31105772,0.36836895,0.027148072,0.02205294,0.0007077793],"about_ca_topic_score_codex":0.00023329828,"about_ca_topic_score_gemma":0.00015472157,"teacher_disagreement_score":0.8356398,"about_ca_system_score_codex":0.000023240207,"about_ca_system_score_gemma":0.00001554037,"threshold_uncertainty_score":0.289612},"labels":[],"label_agreement":null},{"id":"W237505231","doi":"10.1007/11839569","title":"Autonomic and Trusted Computing","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Direct Anonymous Attestation; Trusted Computing; Trusted Network Connect; Autonomic computing; Trusted Platform Module; Computer security; Theoretical computer science; Operating system; Cloud computing","score_opus":0.013934736101141085,"score_gpt":0.24350230747904347,"score_spread":0.2295675713779024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W237505231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00069227826,0.0004840597,0.9919973,0.0005003993,0.0018337056,0.0003176168,0.0000025205627,0.00035896362,0.0038131687],"genre_scores_gemma":[0.26528427,0.000016096346,0.7306411,0.0018349316,0.0013480787,0.0000063111697,0.000017178623,0.00005041079,0.0008016035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597204,0.00008561849,0.00069419533,0.0018253346,0.00065483537,0.00076796784],"domain_scores_gemma":[0.9971635,0.0008504615,0.00040728983,0.0012417319,0.00017345151,0.00016361338],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012181451,0.00050828815,0.00056007935,0.0008775475,0.00049548026,0.0011178084,0.0030736984,0.00035255382,0.000004207786],"category_scores_gemma":[0.0000860626,0.0005281714,0.000094696465,0.0011273648,0.000709147,0.0005630526,0.0017951325,0.000915484,0.000024468542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028043453,0.000051947893,0.00029981733,0.00008895725,0.000011960993,0.00005248771,0.0014975165,0.072884254,0.000062940584,0.020845428,0.0007058901,0.90349597],"study_design_scores_gemma":[0.00026762008,0.00005781051,0.001114642,0.00026581655,0.000005028975,0.00009654701,1.4064477e-7,0.94507647,0.0002317978,0.048434503,0.0038490547,0.0006005768],"about_ca_topic_score_codex":0.00004916064,"about_ca_topic_score_gemma":0.000026896414,"teacher_disagreement_score":0.9028954,"about_ca_system_score_codex":0.00057302887,"about_ca_system_score_gemma":0.0011412441,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W2379601516","doi":"","title":"Buffer Overflow Attacking of Security Testing Platform in Web Application Based on Windows","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Security and Verification in Computing","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":"Buffer overflow; Computer science; Buffer (optical fiber); Computer security; Computer network; Network security; Operating system; Telecommunications","score_opus":0.022722592627576425,"score_gpt":0.27215677570399815,"score_spread":0.24943418307642173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2379601516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04311145,0.000036436548,0.95301354,0.00019772472,0.000034868594,0.0008471026,0.0000058235823,0.00022342884,0.002529653],"genre_scores_gemma":[0.7258914,9.2277253e-7,0.273434,0.00042040736,0.00011696369,0.00010796724,0.000013592671,0.000012343442,0.0000023909809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979313,0.000034599445,0.00069640094,0.0006569589,0.00030425776,0.00037649262],"domain_scores_gemma":[0.9977881,0.00074796594,0.00031666207,0.00085134414,0.00019911345,0.00009683367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095810497,0.00021316475,0.00023877065,0.00042323605,0.00019230167,0.00008832395,0.001123654,0.00013156522,0.0000032920261],"category_scores_gemma":[0.000008016486,0.00024062602,0.000081323524,0.0016620931,0.000059600003,0.00025653772,0.0002000429,0.00030940276,0.000038976454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039620187,0.0016908516,0.04623399,0.00024627242,0.000027795317,0.000006114,0.0024152126,0.02423142,0.043596014,0.16189922,0.0003556498,0.71925783],"study_design_scores_gemma":[0.0007663016,0.000055578323,0.019486504,0.000095942516,0.000005206247,0.000010467845,0.00003203223,0.935605,0.01840377,0.004149021,0.02103125,0.0003589645],"about_ca_topic_score_codex":0.00003824929,"about_ca_topic_score_gemma":0.000034619712,"teacher_disagreement_score":0.91137356,"about_ca_system_score_codex":0.00015252011,"about_ca_system_score_gemma":0.00011417145,"threshold_uncertainty_score":0.98124444},"labels":[],"label_agreement":null},{"id":"W2391397099","doi":"","title":"Analysis on Calling the Lib Function Securely","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Security and Verification in Computing","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; Buffer overflow; Programmer; Computer security; Function (biology); Programming language; Operating system","score_opus":0.008627083667854375,"score_gpt":0.22251749249037403,"score_spread":0.21389040882251967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2391397099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031499376,0.000100888836,0.9922265,0.0020032781,0.000050686725,0.0003349927,0.0000028536758,0.0003377856,0.0017931104],"genre_scores_gemma":[0.8667476,0.000004073388,0.13011362,0.0019785769,0.00064635463,0.00024153171,0.00005666838,0.000012225101,0.00019936342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987106,0.000059119055,0.00029868167,0.0005064087,0.00019860614,0.00022660493],"domain_scores_gemma":[0.9987645,0.00016865856,0.00013531625,0.0007847041,0.00010481518,0.000042005737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023748973,0.00014302146,0.00013198421,0.0002017721,0.000622628,0.00035759297,0.0010508208,0.000062510706,0.00001242987],"category_scores_gemma":[3.793516e-7,0.00011630873,0.00016302758,0.0018472711,0.000041493902,0.00014267069,0.00014767205,0.00019419767,0.00020263092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035725905,0.00024142496,0.0008701124,0.000006922202,0.00016803548,7.354932e-7,0.00036623675,0.03554067,0.0008516565,0.85162354,0.008223073,0.102104016],"study_design_scores_gemma":[0.00016226915,0.00002587064,0.01781313,0.000004552964,0.000096682365,0.000006235466,0.000012049489,0.24088463,0.0009361825,0.013529526,0.72628,0.00024888452],"about_ca_topic_score_codex":0.00006178828,"about_ca_topic_score_gemma":0.00001638839,"teacher_disagreement_score":0.86359763,"about_ca_system_score_codex":0.00004755442,"about_ca_system_score_gemma":0.00002809458,"threshold_uncertainty_score":0.47888142},"labels":[],"label_agreement":null},{"id":"W2397801177","doi":"","title":"Reasoning About an ACME Printer Case Investigation with Forensic Lucid","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Lucid dream; Computer science; USable; Programming language; Automaton; State (computer science); Event (particle physics); Natural language processing; Artificial intelligence; World Wide Web","score_opus":0.022161187339485574,"score_gpt":0.2597466741107953,"score_spread":0.2375854867713097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397801177","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.53546476,0.000010864485,0.46114573,0.00085017894,0.000068675436,0.000071281305,1.02985396e-7,0.00023658985,0.0021518185],"genre_scores_gemma":[0.78057075,4.2962387e-7,0.21783876,0.0014670587,0.00005921126,0.0000019861498,0.0000016831647,0.0000029150954,0.000057191726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919164,0.000042629166,0.00014599101,0.00031391025,0.00013884566,0.00016696313],"domain_scores_gemma":[0.99921983,0.00002869179,0.00007084895,0.00048375168,0.00009054089,0.00010634533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021811054,0.00008989438,0.0000747526,0.000059107686,0.00017253542,0.00023643952,0.00032160326,0.000036116773,0.000011191172],"category_scores_gemma":[0.00002381389,0.00007345381,0.000018190058,0.00025730263,0.000032202115,0.00071867515,0.00004233217,0.00009914695,0.000016278513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011304806,0.00007037519,0.003541247,0.00001033788,0.000011951113,0.00034196657,0.009017298,0.00054850895,0.00077093235,0.7538183,0.0006219571,0.23123586],"study_design_scores_gemma":[0.0005870809,0.000552968,0.030821204,0.00012135559,0.000008728726,0.004001134,0.0003451254,0.92190653,0.022341304,0.017693458,0.0011088789,0.0005122047],"about_ca_topic_score_codex":0.000051555926,"about_ca_topic_score_gemma":0.000037364804,"teacher_disagreement_score":0.92135805,"about_ca_system_score_codex":0.000024260875,"about_ca_system_score_gemma":0.000041368698,"threshold_uncertainty_score":0.29953593},"labels":[],"label_agreement":null},{"id":"W2403302360","doi":"10.1007/bf03219899","title":"Timed secure colored Petri net based analysis of information flow","year":2006,"lang":"fr","type":"article","venue":"Annals of Telecommunications","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; Computer security model; Information flow; Distributed computing; Graph; Theoretical computer science; State space; Confidentiality; Security analysis; State (computer science); Security policy; Computer security; Programming language; Mathematics","score_opus":0.062080671030710986,"score_gpt":0.317059079855836,"score_spread":0.254978408825125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403302360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028186688,0.008677123,0.8815746,0.06321793,0.00055788556,0.0006188484,0.00068261777,0.00016641372,0.016317934],"genre_scores_gemma":[0.834955,0.0004470321,0.16266921,0.00073959026,0.000041202544,0.000020570027,0.00087618746,0.000007920653,0.0002433008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746567,0.0004255126,0.0012348122,0.00019722551,0.00037255842,0.00030424993],"domain_scores_gemma":[0.99429977,0.0009626426,0.0011260418,0.0020079976,0.0015245811,0.00007897274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030152,0.00017919789,0.00046419186,0.0009322782,0.00028547918,0.00013011633,0.001894589,0.00018676525,0.00022462121],"category_scores_gemma":[0.00029677083,0.0002191496,0.00039085036,0.00509192,0.0002883215,0.0010243163,0.00028402839,0.00026535802,0.000038089896],"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.00003561647,0.0017237493,0.003953404,0.00026652057,0.0013327071,7.0647025e-7,0.0040983474,0.5273622,0.00016061732,0.35145742,0.052706886,0.05690177],"study_design_scores_gemma":[0.00021953633,0.000065762804,0.034306638,0.00006859398,0.0002559396,0.0000010337922,0.00007475992,0.86656684,0.0022112418,0.0014305848,0.09462292,0.00017616819],"about_ca_topic_score_codex":0.0016667597,"about_ca_topic_score_gemma":0.00033432755,"teacher_disagreement_score":0.8067683,"about_ca_system_score_codex":0.000031865075,"about_ca_system_score_gemma":0.00032249957,"threshold_uncertainty_score":0.89366615},"labels":[],"label_agreement":null},{"id":"W2427518429","doi":"","title":"Interpretation functions-based method to verify secrecy under equational theories","year":2008,"lang":"en","type":"article","venue":"International Conference on Telecommunications","topic":"Security and Verification in Computing","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é Laval","funders":"","keywords":"Secrecy; Interpretation (philosophy); Property (philosophy); Cryptographic protocol; Computer science; Cryptography; Construct (python library); Cryptographic primitive; Abstract interpretation; Protocol (science); Theoretical computer science; Function (biology); Computer security; Programming language; Epistemology","score_opus":0.10235041908613779,"score_gpt":0.3682020978810476,"score_spread":0.2658516787949098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2427518429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017443146,0.000017603219,0.9408004,0.022499302,0.0005444897,0.00020804202,0.000021552994,0.00027700805,0.033887237],"genre_scores_gemma":[0.78647906,0.00001586882,0.20976841,0.0029694217,0.00006774665,0.00013560984,0.00011791825,0.000010433999,0.0004355266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980642,0.0003231247,0.0004457031,0.00044870598,0.00050758204,0.000210676],"domain_scores_gemma":[0.99693024,0.0008526393,0.00018962662,0.0010833361,0.0008202367,0.00012393427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050953584,0.00018715799,0.0001545854,0.00041402844,0.00066093367,0.00024166271,0.0023126765,0.00008722083,0.00044204536],"category_scores_gemma":[0.00026496267,0.0002021287,0.00010085565,0.0005855454,0.00009546146,0.0004985268,0.0002744333,0.0003474753,0.0005761658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002335692,0.00015228869,0.00011900452,0.0000016055707,0.000032065374,6.4886916e-7,0.000851486,0.011635802,0.0004672709,0.9742619,0.00032183027,0.01213276],"study_design_scores_gemma":[0.00043419973,0.00014138251,0.006318642,0.00006313237,0.0000074454383,0.000029098306,0.00028850615,0.7916745,0.0017548893,0.19067623,0.0082278,0.0003841566],"about_ca_topic_score_codex":0.000053511892,"about_ca_topic_score_gemma":0.000026777341,"teacher_disagreement_score":0.7847347,"about_ca_system_score_codex":0.00020511857,"about_ca_system_score_gemma":0.00040448163,"threshold_uncertainty_score":0.8242569},"labels":[],"label_agreement":null},{"id":"W2441478892","doi":"10.1109/pst.2017.00054","title":"A Certified Core Policy Language","year":2017,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Ottawa","funders":"","keywords":"Mathematical proof; Computer science; Programming language; Correctness; Proof assistant; Certification; Semantics (computer science); Syntax; Operational semantics; Core (optical fiber); Artificial intelligence; Mathematics","score_opus":0.07985788693342072,"score_gpt":0.36237781520047047,"score_spread":0.28251992826704975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2441478892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109291725,0.000048955986,0.6086565,0.016079593,0.00067505735,0.00011778686,9.3361524e-7,0.00055424945,0.26457515],"genre_scores_gemma":[0.98308504,0.0000016983324,0.014403087,0.00072999904,0.0001790964,0.000002058307,3.839294e-7,0.0000022834713,0.0015963621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953115,0.000008013674,0.00007775633,0.00016460178,0.00009222046,0.0001262604],"domain_scores_gemma":[0.998822,0.000028032862,0.0000666256,0.001009408,0.000026810845,0.000047128782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011146416,0.000046165347,0.000050644125,0.00003982768,0.00040721963,0.0004033279,0.001298037,0.000025691537,0.000027904749],"category_scores_gemma":[0.00013844464,0.00004091375,0.000026533924,0.000055560064,0.000031534404,0.00026858368,0.00028654232,0.0000516758,0.0001624525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.7686227e-7,0.000013707303,0.00044262045,0.0000030456051,0.000003030524,0.000004939446,0.0015634614,0.0000034535965,0.0008491625,0.94157606,0.0014980541,0.054041762],"study_design_scores_gemma":[0.0012875738,0.00009064686,0.14742167,0.00005635095,0.0000057875454,0.0000847679,0.0004986178,0.6742193,0.030104596,0.07433367,0.07098548,0.0009115362],"about_ca_topic_score_codex":0.0004005459,"about_ca_topic_score_gemma":0.000014385193,"teacher_disagreement_score":0.8737933,"about_ca_system_score_codex":0.000013714178,"about_ca_system_score_gemma":0.00004469218,"threshold_uncertainty_score":0.38893002},"labels":[],"label_agreement":null},{"id":"W2464265904","doi":"10.1007/978-3-319-33630-5_24","title":"A Progress-Sensitive Flow-Sensitive Inlined Information-Flow Control Monitor","year":2016,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Flow (mathematics); Information flow; Computer science; Flow control (data); Mechanics; Physics; Computer network; Philosophy","score_opus":0.006423980228470338,"score_gpt":0.242268665320011,"score_spread":0.23584468509154066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464265904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059253718,0.0049599297,0.83458686,0.01069372,0.0006820548,0.0015978054,0.0001766845,0.0012053722,0.14603831],"genre_scores_gemma":[0.6028175,0.045800515,0.3389202,0.00643962,0.00027512579,0.0009278432,0.0010346585,0.00008916477,0.0036953955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997799,0.00007546372,0.0012175585,0.00026841532,0.0003324567,0.0003071425],"domain_scores_gemma":[0.9961519,0.00038321543,0.0012078623,0.001355075,0.0008274704,0.00007445067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004753701,0.000374505,0.00046681747,0.0012618973,0.00033409524,0.00023707039,0.0012403114,0.0006448348,0.000011440708],"category_scores_gemma":[0.00020477748,0.00036077292,0.00007289581,0.00031095772,0.00060476223,0.0057755304,0.00056762027,0.0007494703,0.00022469858],"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.000019297348,0.000007764958,0.000017265871,0.000028442026,0.000015469734,6.4474744e-7,0.00079116295,0.000072168485,4.014421e-7,0.51417947,0.000046443725,0.48482147],"study_design_scores_gemma":[0.0020763017,0.00012584409,0.0000990356,0.0007721574,0.000017394546,0.00007389707,0.0005126613,0.12626271,0.00017346788,0.14540859,0.7236901,0.000787858],"about_ca_topic_score_codex":0.0000023794744,"about_ca_topic_score_gemma":0.000008724928,"teacher_disagreement_score":0.72364366,"about_ca_system_score_codex":0.00019575382,"about_ca_system_score_gemma":0.00013313921,"threshold_uncertainty_score":0.9998844},"labels":[],"label_agreement":null},{"id":"W2470754857","doi":"10.1016/j.tcs.2016.06.022","title":"Mitigating covert channels based on analysis of the potential for communication","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Covert; Covert channel; Computer science; Concurrency; Channel (broadcasting); Limiting; Communications system; Order (exchange); Distributed computing; Theoretical computer science; Computer network; Engineering","score_opus":0.013632418037605558,"score_gpt":0.263277827929747,"score_spread":0.24964540989214146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470754857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03205543,0.0000048160036,0.9627221,0.004296208,0.0004137458,0.00017700493,0.000004824164,0.00005599795,0.00026986422],"genre_scores_gemma":[0.91166884,7.558449e-7,0.087528385,0.00074601325,0.00004031218,0.000008820447,6.2685984e-7,0.0000032814512,0.0000029801859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828523,0.0001700993,0.000293288,0.00042599507,0.00055066496,0.00027469816],"domain_scores_gemma":[0.99691755,0.0011832825,0.00017685618,0.0013419403,0.0003021353,0.00007821123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017486153,0.000103489976,0.0001756655,0.00021840268,0.0005405553,0.00015987577,0.0031455732,0.000038072478,0.000012355984],"category_scores_gemma":[0.00027171883,0.000059659276,0.00017855507,0.0019699235,0.0015689412,0.0002446397,0.0005347779,0.00007339061,0.0000033064352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006432041,0.00004051268,0.00007341075,0.0000034924935,0.00001378723,7.937141e-8,0.00015892934,0.010270118,0.001255008,0.9728511,0.000017325425,0.015309819],"study_design_scores_gemma":[0.00019913986,0.0000704228,0.0018664987,0.00005672456,0.000026062737,6.851149e-7,0.0000026948287,0.935801,0.0131127965,0.048745528,0.000026767979,0.00009166199],"about_ca_topic_score_codex":0.0000020280247,"about_ca_topic_score_gemma":2.4850212e-7,"teacher_disagreement_score":0.9255309,"about_ca_system_score_codex":0.00005006446,"about_ca_system_score_gemma":0.00009900917,"threshold_uncertainty_score":0.584531},"labels":[],"label_agreement":null},{"id":"W2483070843","doi":"10.4018/978-1-61350-501-4.ch004","title":"Self-Protecting Access Control","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Security and Verification in Computing","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":"Computer security; Collusion; Access control; Computer science; Enforcement; Relation (database); Key (lock); Cryptography; Control (management); Internet privacy; Business; Law; Political science","score_opus":0.040956477235015804,"score_gpt":0.26854717451750815,"score_spread":0.22759069728249234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483070843","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.000007151435,0.00017438445,0.22654901,0.000048549922,0.00092760683,0.00036901078,0.000010496815,0.0007388547,0.7711749],"genre_scores_gemma":[0.92249256,0.000011300111,0.04013981,0.0035696647,0.0018609718,0.000082473765,0.0000022757342,0.000109738736,0.031731185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979228,0.000050873543,0.00046759853,0.0007784896,0.00038685882,0.00039341883],"domain_scores_gemma":[0.9980239,0.000095505784,0.00046853177,0.0010458744,0.00020307805,0.0001630737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003524924,0.000395964,0.00039952784,0.00008026426,0.0003341472,0.0005099124,0.002561907,0.00040749053,0.000027363461],"category_scores_gemma":[0.000032184595,0.0004207591,0.00021240122,0.0000359194,0.00005214353,0.00021301013,0.0006398093,0.00057227,0.00030643734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050728963,0.0000074797285,0.0000075747084,0.000036124326,0.00006912238,0.00002404089,0.00019101491,0.0000027604704,0.0000015587493,0.98513985,0.00028752242,0.014227853],"study_design_scores_gemma":[0.00048266922,0.00006714962,0.000035763427,0.00018594782,0.00004562542,0.00009471462,0.0000027064548,0.0036874237,0.000096513475,0.9149746,0.07961731,0.00070961495],"about_ca_topic_score_codex":0.00006399149,"about_ca_topic_score_gemma":0.00000799902,"teacher_disagreement_score":0.9224854,"about_ca_system_score_codex":0.00019626955,"about_ca_system_score_gemma":0.00023049234,"threshold_uncertainty_score":0.9998244},"labels":[],"label_agreement":null},{"id":"W2507754895","doi":"10.4018/978-1-59140-766-9.ch014","title":"Security, Privacy, and Trust for Pervasive Computing Applications","year":2016,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Security and Verification in Computing","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","funders":"","keywords":"Ubiquitous computing; Context-aware pervasive systems; Computer science; End-user computing; Computer security; Autonomic computing; Mobile computing; Information privacy; Utility computing; Cloud computing security; Cloud computing; Computer network; Human–computer interaction","score_opus":0.024818772316222485,"score_gpt":0.2712713654128402,"score_spread":0.2464525930966177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507754895","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.000025932812,0.00039757753,0.46847433,0.0003489683,0.00028133643,0.00082128326,0.00009873645,0.00026048414,0.5292914],"genre_scores_gemma":[0.77531004,0.00009274488,0.15355909,0.004472146,0.00566761,0.0004875317,0.00003669747,0.00024215433,0.06013198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797785,0.00001869626,0.00045626354,0.00089918147,0.0002791051,0.00036891832],"domain_scores_gemma":[0.9980378,0.00025633583,0.0003858296,0.00087418867,0.0002648275,0.0001809888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022309094,0.00037525373,0.0003875718,0.000074243275,0.00042987763,0.0003025422,0.0012004714,0.0003300411,0.0000047320723],"category_scores_gemma":[0.000026537255,0.00036457853,0.00017966956,0.000028623845,0.00014801513,0.00010391684,0.0008188171,0.00020322199,0.00005264177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036659558,0.000006640023,0.000011326633,0.00006917098,0.000038761988,0.0000019112292,0.00024812907,8.3923965e-7,0.0000047498925,0.953494,0.0006690322,0.045451783],"study_design_scores_gemma":[0.00035484575,0.000048635102,0.000016175403,0.00017680525,0.00002637109,0.000056455032,0.000007877336,0.002790021,0.000032414187,0.8000938,0.19597283,0.00042374342],"about_ca_topic_score_codex":0.0000053578883,"about_ca_topic_score_gemma":0.000003982623,"teacher_disagreement_score":0.7752841,"about_ca_system_score_codex":0.0001636582,"about_ca_system_score_gemma":0.00019919072,"threshold_uncertainty_score":0.9998806},"labels":[],"label_agreement":null},{"id":"W2511487335","doi":"10.20533/ijisr.2042.4639.2014.0045","title":"An Alternate Secure Element Access Control for NFC Enabled Android Smartphones","year":2014,"lang":"en","type":"article","venue":"International Journal for Information Security Research","topic":"Security and Verification in Computing","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 of Edmonton","funders":"","keywords":"Android (operating system); Computer security; Access control; Computer science; Internet privacy; Element (criminal law); Operating system; Embedded system","score_opus":0.0628974945744109,"score_gpt":0.431829961823228,"score_spread":0.3689324672488171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511487335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022965604,0.00003335386,0.96561706,0.006342893,0.0030777566,0.00083007,0.00008796309,0.00010025361,0.0009450631],"genre_scores_gemma":[0.9881914,0.000059459246,0.0089011965,0.0012398442,0.0012641683,0.00018270727,0.00011383927,0.00001170314,0.000035669815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996484,0.00027330386,0.0008466706,0.00027564153,0.0015663945,0.000554022],"domain_scores_gemma":[0.99310964,0.00085097004,0.0004341895,0.00040771056,0.004929615,0.00026789022],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006724674,0.0001702365,0.00020628411,0.0007698515,0.0008736227,0.0042763995,0.0038066632,0.000111823945,0.00003660333],"category_scores_gemma":[0.0008533842,0.00016159454,0.00014513433,0.00031722465,0.0000630853,0.007078055,0.00026571532,0.00048754798,0.00003959791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069964776,0.00029741452,0.0010059151,0.00011430753,0.0002331873,0.0000027315318,0.006807072,0.005045624,0.0004686544,0.85438526,0.019934332,0.111005835],"study_design_scores_gemma":[0.002719915,0.00035837878,0.00041386095,0.00004526388,0.0000043691116,0.00008167365,0.00014298857,0.662387,0.0016776092,0.098260984,0.2337242,0.00018372247],"about_ca_topic_score_codex":0.000036782123,"about_ca_topic_score_gemma":0.000014908926,"teacher_disagreement_score":0.9652258,"about_ca_system_score_codex":0.00024514965,"about_ca_system_score_gemma":0.00026164245,"threshold_uncertainty_score":0.99675727},"labels":[],"label_agreement":null},{"id":"W2515891506","doi":"10.1109/sp.2016.43","title":"Talos: Neutralizing Vulnerabilities with Security Workarounds for Rapid Response","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":43,"is_retracted":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":"Workaround; Computer science; Vulnerability (computing); Computer security; Exploit; Code (set theory); Software; Secure coding; Operating system; Software security assurance; Information security; Security service; Programming language","score_opus":0.03620936681950668,"score_gpt":0.2853534543307426,"score_spread":0.24914408751123593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515891506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03804164,0.00027812683,0.949207,0.0066555534,0.0013075069,0.0007767658,0.000027989334,0.0007714149,0.0029340237],"genre_scores_gemma":[0.90427935,0.00002231823,0.093615845,0.0005782506,0.00044730332,0.0002896082,0.000011871148,0.00003123738,0.0007242445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710166,0.0004009091,0.00049263146,0.0011417413,0.0003495495,0.00051351916],"domain_scores_gemma":[0.9955405,0.0019468805,0.00030772324,0.0017205845,0.00034534885,0.0001389639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001996436,0.00038791145,0.00041197057,0.00020361097,0.0003739091,0.0007619083,0.001884365,0.0003003562,0.000035732126],"category_scores_gemma":[0.00020793792,0.00028895013,0.00020327729,0.00021095252,0.00015701931,0.0004262509,0.0010597818,0.00047491785,0.000013987132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012224484,0.00024276672,0.00041656598,0.00076756545,0.0002313396,0.00001271413,0.014461781,0.0007508607,0.00027121083,0.9528128,0.009284471,0.019525487],"study_design_scores_gemma":[0.0025719577,0.000919739,0.001136628,0.0018740621,0.00006397066,0.00008709424,0.0009813064,0.12932177,0.008182529,0.72856337,0.123325095,0.0029724601],"about_ca_topic_score_codex":0.00003091928,"about_ca_topic_score_gemma":0.000012215627,"teacher_disagreement_score":0.8662377,"about_ca_system_score_codex":0.0001721259,"about_ca_system_score_gemma":0.000467994,"threshold_uncertainty_score":0.99995625},"labels":[],"label_agreement":null},{"id":"W2516285842","doi":"10.1145/2976749.2978372","title":"Hypnoguard","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Encryption; Password; Plaintext; On-the-fly encryption; Computer security; Disk encryption; Embedded system; Operating system; Computer network; Computer hardware","score_opus":0.017993125305422544,"score_gpt":0.22954379163976799,"score_spread":0.21155066633434544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516285842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034330017,0.000009807181,0.96307033,0.0048914566,0.00020904986,0.000015365456,8.987165e-8,0.0002176758,0.02815319],"genre_scores_gemma":[0.9377007,0.0000031150328,0.06047044,0.0005236825,0.000047042362,0.0000013873183,3.341045e-8,0.0000011603423,0.0012524783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996659,0.0000111058625,0.000058371097,0.00011811743,0.00006712054,0.00007939039],"domain_scores_gemma":[0.9996106,0.0000719768,0.000014271566,0.0002544912,0.000021956026,0.000026708092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087724366,0.00002603286,0.000025581336,0.000020016598,0.000038017628,0.00003244157,0.0003739798,0.000012633556,0.000072233765],"category_scores_gemma":[0.000021216461,0.00001504154,0.000015366335,0.00008500505,0.000010605918,0.00018816558,0.00007222621,0.000012342009,0.0005317811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.5116606e-7,0.000004932217,0.00023200094,3.7094597e-7,9.4740176e-7,4.583923e-7,0.000050138213,2.4037678e-7,0.0011370553,0.83377796,0.0034926212,0.1613031],"study_design_scores_gemma":[0.00081207644,0.0000794979,0.015189042,0.000041692438,0.0000017352404,0.0000469632,0.000025983092,0.02264071,0.094827704,0.17484084,0.6909923,0.0005014245],"about_ca_topic_score_codex":0.0000023902298,"about_ca_topic_score_gemma":4.12347e-7,"teacher_disagreement_score":0.93426764,"about_ca_system_score_codex":0.000008406291,"about_ca_system_score_gemma":0.0000117627,"threshold_uncertainty_score":0.6835148},"labels":[],"label_agreement":null},{"id":"W2517131833","doi":"","title":"Block-safe Information Flow Control","year":2016,"lang":"en","type":"article","venue":"eCommons (Cornell University)","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"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; Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Information flow; Computer science; Mathematics","score_opus":0.01933333792207979,"score_gpt":0.17626797271336322,"score_spread":0.15693463479128344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517131833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018236605,0.000006113777,0.9611325,0.0010938551,0.0003717034,0.00009615405,0.0000090786025,0.00024126875,0.018812696],"genre_scores_gemma":[0.9953574,0.000009517073,0.003875496,0.00025828645,0.00004139692,3.3306358e-7,0.0000015126782,0.0000027494682,0.00045332225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992961,0.00007276789,0.00014441842,0.00019722417,0.00008327689,0.00020619178],"domain_scores_gemma":[0.9990102,0.00019172196,0.00010659613,0.000495719,0.000097834396,0.000097906595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016678676,0.00009407049,0.00010232687,0.00020232206,0.00019651267,0.000075063035,0.0008482157,0.000062871746,0.000056822744],"category_scores_gemma":[0.000039894447,0.000086283646,0.00006623475,0.0004342561,0.000043346496,0.0014882102,0.00016604397,0.00007985493,0.0006899526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005387742,0.00014123738,0.0069028693,0.000019352081,0.00007974016,0.0000409857,0.0011328245,0.009212799,0.00020953223,0.85366654,0.009752734,0.11878749],"study_design_scores_gemma":[0.0033696992,0.00010792936,0.009499198,0.000057110705,0.000022344031,0.00002855414,0.00011462425,0.5742741,0.0008944899,0.00889401,0.40214097,0.0005969282],"about_ca_topic_score_codex":0.000012885405,"about_ca_topic_score_gemma":0.000009440848,"teacher_disagreement_score":0.97712076,"about_ca_system_score_codex":0.000095173775,"about_ca_system_score_gemma":0.00005238844,"threshold_uncertainty_score":0.8868175},"labels":[],"label_agreement":null},{"id":"W2517913729","doi":"10.1109/csf.2016.24","title":"Runtime Verification of k-Safety Hyperproperties in HyperLTL","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":62,"is_retracted":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; TRACE (psycholinguistics); Runtime verification; Temporal logic; Information flow; Programming language; Service (business); Theoretical computer science; Distributed computing; Formal verification","score_opus":0.014518616816118692,"score_gpt":0.21421109943296338,"score_spread":0.1996924826168447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517913729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12787345,0.000087748136,0.85376304,0.003309077,0.00024084808,0.000114781025,8.9841507e-7,0.00013231055,0.014477808],"genre_scores_gemma":[0.9747644,0.000021022055,0.02481893,0.00009921792,0.0000173467,0.0000035438668,3.3077725e-7,0.0000027196336,0.00027248284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992378,0.000042132575,0.00028348845,0.00019819012,0.00012581926,0.00011260196],"domain_scores_gemma":[0.99935865,0.00009306129,0.00006793423,0.0003959593,0.00006202265,0.000022364175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030765592,0.00005527384,0.00009213394,0.00008268175,0.000033029606,0.00001716395,0.00047615243,0.00003377322,0.000051305837],"category_scores_gemma":[0.000053670687,0.000035713794,0.000024970283,0.00024985775,0.000040950352,0.00032380223,0.00008081773,0.000030261392,0.000070041184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020818616,0.00012674827,0.0075273127,0.000014925087,0.0000072994303,9.215474e-7,0.0014421939,0.00004244242,0.075911924,0.65326345,0.00042448065,0.26121747],"study_design_scores_gemma":[0.003128265,0.0002925325,0.26529387,0.00036339942,0.000007893051,0.00003035255,0.00041577857,0.13541101,0.4704617,0.021999069,0.10153085,0.0010652858],"about_ca_topic_score_codex":0.000039642404,"about_ca_topic_score_gemma":0.0000040675704,"teacher_disagreement_score":0.8468909,"about_ca_system_score_codex":0.00002916319,"about_ca_system_score_gemma":0.000038487142,"threshold_uncertainty_score":0.14563663},"labels":[],"label_agreement":null},{"id":"W2529698697","doi":"10.1109/rtcsa.2016.45","title":"Static Transformation of Power Consumption for Software Attestation","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Embedded system; Software; Cryptography; Checksum; Side channel attack; Power consumption; Compiler; Operating system; Power (physics); Computer security","score_opus":0.03619734627496445,"score_gpt":0.28560808233498225,"score_spread":0.2494107360600178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529698697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042399157,0.0000056129315,0.955886,0.0012133128,0.00012435846,0.00016608859,0.0000053230315,0.000091490474,0.000108656495],"genre_scores_gemma":[0.84390455,0.0000039341103,0.15591727,0.00011930683,0.0000056599542,0.000012270579,0.000002782162,0.000002118531,0.000032077107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994953,0.000019453355,0.00019877979,0.000106271094,0.00010005988,0.00008008824],"domain_scores_gemma":[0.99926734,0.00035577477,0.00008579111,0.0001418869,0.00012924537,0.000019935012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020111758,0.00004155516,0.000055092412,0.00005265729,0.000045113804,0.000019616113,0.00015218591,0.000022862412,0.00003156535],"category_scores_gemma":[0.00006895715,0.000029878518,0.000028049792,0.000070611604,0.000019247424,0.0005035016,0.000009084433,0.000012085143,0.000019211615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001396084,0.000053849377,0.0014754583,0.000114239636,0.000010992303,7.138789e-8,0.0034956955,0.000054479784,0.006287739,0.75629455,0.00090178224,0.23129717],"study_design_scores_gemma":[0.0074704005,0.0011027388,0.07949111,0.0006006507,0.000038085425,0.00002441657,0.00048215833,0.325431,0.32015336,0.24239287,0.021653986,0.001159236],"about_ca_topic_score_codex":0.0000018524906,"about_ca_topic_score_gemma":0.0000010600007,"teacher_disagreement_score":0.80150545,"about_ca_system_score_codex":0.000018038058,"about_ca_system_score_gemma":0.000022524635,"threshold_uncertainty_score":0.12184106},"labels":[],"label_agreement":null},{"id":"W2532501240","doi":"10.1109/wcre.2005.36","title":"Enhancing Security Using Legality Assertions","year":2006,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Buffer overflow; Computer science; Heap (data structure); Pointer (user interface); Programming language; Program transformation; Symbolic execution; Memory safety; Call stack; Merge (version control); Source code; Code (set theory); Operating system; Stack (abstract data type); Parallel computing; Compiler; Software; Computer hardware; Set (abstract data type)","score_opus":0.02575467299715035,"score_gpt":0.2816419736852728,"score_spread":0.25588730068812243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532501240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18883318,0.000029169754,0.7999821,0.0003278511,0.00026198875,0.000045882796,3.2732618e-7,0.000276132,0.010243385],"genre_scores_gemma":[0.89682317,3.8910866e-7,0.10279632,0.00016314279,0.00012681808,0.0000015935843,0.0000011711777,0.000002909813,0.00008451001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990861,0.000055910456,0.0002307208,0.00026596923,0.00016572633,0.00019560514],"domain_scores_gemma":[0.99935377,0.00006685337,0.000065244225,0.0003923318,0.00008312654,0.00003864862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034262586,0.000075922726,0.00008044145,0.00005419842,0.00029110388,0.00021873145,0.00040340223,0.000043273063,0.000029643894],"category_scores_gemma":[0.000022696442,0.00007794347,0.00004911933,0.0003694155,0.000020951144,0.00052074547,0.00012245,0.00009958369,0.000032226413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.416675e-7,0.00007385746,0.0013767796,0.000008266664,0.0000033456206,0.0000019101408,0.00023635794,0.0005649256,0.009843069,0.98716885,0.00033710786,0.00038509758],"study_design_scores_gemma":[0.00014930451,0.00001033018,0.006774855,0.00001649797,0.0000042067877,0.000025969464,0.000052385698,0.85572195,0.06591727,0.065508224,0.0055526397,0.0002663483],"about_ca_topic_score_codex":0.0009767984,"about_ca_topic_score_gemma":0.0001466451,"teacher_disagreement_score":0.9216606,"about_ca_system_score_codex":0.000053318192,"about_ca_system_score_gemma":0.000060569364,"threshold_uncertainty_score":0.31784427},"labels":[],"label_agreement":null},{"id":"W2559798902","doi":"10.1145/2991079.2991089","title":"LMP","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Computer science; Overhead (engineering); Computer security; Memory protection; Security community; Information hiding; Memory management; Operating system; Virtual memory; Artificial intelligence; Overlay","score_opus":0.01779015681102057,"score_gpt":0.23209688786530414,"score_spread":0.21430673105428355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559798902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026706867,0.000007799594,0.96470326,0.0046676286,0.00018383235,0.00001254012,4.558664e-8,0.00018075539,0.02757345],"genre_scores_gemma":[0.9498626,0.0000024004862,0.04820014,0.00051390764,0.000039997278,0.000001054293,1.9408697e-8,9.082179e-7,0.0013789837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997173,0.000009079533,0.0000489469,0.00010152372,0.00005583958,0.00006728869],"domain_scores_gemma":[0.99966586,0.000060551145,0.000011944195,0.00022027362,0.000018494064,0.00002286675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076650904,0.000021373247,0.0000206201,0.00001636664,0.000033872508,0.000028421384,0.00032936296,0.000010639072,0.00006398112],"category_scores_gemma":[0.000016939779,0.000012235415,0.000011930962,0.00007467138,0.000008804113,0.00016735263,0.00006619154,0.00001033247,0.000469383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.723431e-8,0.000004029028,0.00018819855,2.9485238e-7,6.5572226e-7,3.0713133e-7,0.000043960223,1.9768967e-7,0.0009076969,0.87388325,0.002179189,0.12279212],"study_design_scores_gemma":[0.00070078264,0.00006432253,0.014313688,0.00003659526,0.0000012743662,0.000035449917,0.00002080844,0.033148896,0.1053351,0.16619565,0.67971396,0.00043346552],"about_ca_topic_score_codex":0.0000017578811,"about_ca_topic_score_gemma":3.0742405e-7,"teacher_disagreement_score":0.9471919,"about_ca_system_score_codex":0.0000067352526,"about_ca_system_score_gemma":0.000009566956,"threshold_uncertainty_score":0.60331255},"labels":[],"label_agreement":null},{"id":"W2559919425","doi":"10.1145/2991079.2991085","title":"Formal security analysis of smart embedded systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rewriting; Internet of Things; Embedded system; Computer security; Model checking; Set (abstract data type); Smart meter; State (computer science); Formal methods; Formal verification; Smart grid; Software engineering; Programming language","score_opus":0.019480429084631695,"score_gpt":0.2568146676216766,"score_spread":0.2373342385370449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559919425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07578359,0.000034023218,0.9185461,0.00019635342,0.00026585988,0.0000531089,0.0000027263422,0.000110513596,0.005007732],"genre_scores_gemma":[0.9967075,0.000004372179,0.0030474332,0.000047985082,0.000023742541,0.0000034665975,6.341556e-7,0.000001749073,0.0001631315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906963,0.000068193694,0.0002795687,0.00020852541,0.00020379464,0.0001703146],"domain_scores_gemma":[0.9989541,0.00021541759,0.00012346974,0.0005301967,0.00012466311,0.00005216372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005806112,0.000063974105,0.00017832991,0.00020715105,0.00005964232,0.00004815048,0.0005668358,0.000040066065,0.000053761723],"category_scores_gemma":[0.00004259755,0.000041887368,0.00010681083,0.00091223017,0.00002817814,0.00044453208,0.0001490876,0.000029394916,0.000018764884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042489255,0.000055007535,0.005379226,0.00001766393,0.000290059,9.423031e-7,0.0012727748,0.00017088345,0.0007648207,0.9830077,0.0005820054,0.008454653],"study_design_scores_gemma":[0.00026874768,0.000047404676,0.0059796143,0.000023805436,0.00007966175,0.0000036918336,0.000115555515,0.98292536,0.0058658677,0.0016102002,0.002897504,0.000182603],"about_ca_topic_score_codex":0.000051774732,"about_ca_topic_score_gemma":0.000010698227,"teacher_disagreement_score":0.98275447,"about_ca_system_score_codex":0.00001930026,"about_ca_system_score_gemma":0.000026230182,"threshold_uncertainty_score":0.17081173},"labels":[],"label_agreement":null},{"id":"W2567571920","doi":"10.1109/ares.2016.27","title":"IFCaaS: Information Flow Control as a Service for Cloud Security","year":2016,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Software as a service; Computer science; Cloud computing; Computer security; Cloud computing security; Service-oriented architecture; Security controls; Leverage (statistics); Web service; Software; World Wide Web; Control (management); Software development","score_opus":0.011360370899830902,"score_gpt":0.23928243494423576,"score_spread":0.22792206404440485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567571920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034746863,0.000009165732,0.9793091,0.012757701,0.00062693626,0.00028622113,0.000008569708,0.0002848438,0.0032427958],"genre_scores_gemma":[0.95393497,0.000003976571,0.036504425,0.009208208,0.00021371225,0.00004972089,0.0000036125994,0.0000036669053,0.00007771442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.000031340358,0.0002441918,0.00016723096,0.00016148297,0.00019889863],"domain_scores_gemma":[0.99881446,0.0003395651,0.00009830983,0.00037572725,0.00030108492,0.000070821836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038757344,0.000086177795,0.000095573894,0.000054122225,0.00014278409,0.00015530393,0.00058388273,0.000060154165,0.000048678125],"category_scores_gemma":[0.00013961706,0.00006075466,0.00004921734,0.00019715031,0.000012410585,0.0013929346,0.000077578705,0.00004010167,0.00046918116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002776733,0.000035084453,0.00006253584,0.000041603,0.000018761395,2.503929e-7,0.0028892385,0.0000642964,0.00014822681,0.8785678,0.008922472,0.10922193],"study_design_scores_gemma":[0.0018134727,0.000067757464,0.00016572849,0.000030394642,0.000004622798,0.000010194332,0.000070126254,0.67274815,0.0019421933,0.057182204,0.26575452,0.00021062705],"about_ca_topic_score_codex":0.000030173858,"about_ca_topic_score_gemma":0.000008968087,"teacher_disagreement_score":0.95046026,"about_ca_system_score_codex":0.000034470177,"about_ca_system_score_gemma":0.00007016207,"threshold_uncertainty_score":0.6030531},"labels":[],"label_agreement":null},{"id":"W2580529968","doi":"10.1109/eurosp.2017.30","title":"Reasoning about Probabilistic Defense Mechanisms against Remote Attacks","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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; University of Toronto","funders":"","keywords":"Probabilistic logic; Exploit; Computer security; Computer science; Cryptography; Artificial intelligence","score_opus":0.04279975042247994,"score_gpt":0.2997853363203754,"score_spread":0.25698558589789544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580529968","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.002256564,0.0002156351,0.9441929,0.0008291178,0.002792957,0.00047949824,0.000004750328,0.0008363056,0.048392314],"genre_scores_gemma":[0.37988472,0.00009563176,0.6177879,0.0006657631,0.0003304875,0.00001999585,0.000026507767,0.000032959062,0.0011560421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690664,0.00016036164,0.00054513075,0.001380384,0.00050764583,0.00049982197],"domain_scores_gemma":[0.99487793,0.0001836118,0.0006995619,0.0037246223,0.00032317673,0.00019106721],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011628871,0.00040982966,0.00044308565,0.0001438035,0.0007218619,0.0016510048,0.004095348,0.00044500586,0.000020614209],"category_scores_gemma":[0.0007014287,0.0004132068,0.00022884167,0.000113016,0.000090121874,0.00025747242,0.0039049007,0.00094758096,0.00012687604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060293733,0.000064682645,0.000022240974,0.0003151403,0.000068675734,0.0000575324,0.0016425204,0.0067229127,0.00010687021,0.87296706,0.0018446342,0.11618167],"study_design_scores_gemma":[0.00014964867,0.00001803877,0.00018832079,0.00060732936,0.0000134094325,0.000019962323,0.000014912798,0.7683423,0.00026770908,0.22619668,0.0036344572,0.00054722565],"about_ca_topic_score_codex":0.0001353853,"about_ca_topic_score_gemma":0.000020788775,"teacher_disagreement_score":0.7616194,"about_ca_system_score_codex":0.0001599855,"about_ca_system_score_gemma":0.0004091226,"threshold_uncertainty_score":0.999832},"labels":[],"label_agreement":null},{"id":"W2593225823","doi":"10.1109/ic2e.2017.16","title":"Dark Shadows: User-Level Guest/Host Linux Process Shadowing","year":2017,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Science North","funders":"","keywords":"Virtualization; Host (biology); Computer science; Shadow (psychology); Process (computing); Operating system; Virtual machine; Cloud computing","score_opus":0.07289187826368095,"score_gpt":0.3271804883640894,"score_spread":0.2542886101004085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593225823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067133896,0.00007730403,0.85068554,0.0048468537,0.002982244,0.00029543994,0.000004263,0.00075286836,0.073221624],"genre_scores_gemma":[0.9573111,0.000005888853,0.040446404,0.000778858,0.00044260404,0.000012884181,0.000001794679,0.000010885506,0.0009896059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984466,0.000030452173,0.0002831342,0.0005588082,0.00033546842,0.00034555988],"domain_scores_gemma":[0.9977762,0.0000916291,0.00021433794,0.0016026164,0.00018868192,0.00012651285],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00048379527,0.00016203368,0.0001636906,0.00007087826,0.0012137344,0.001426966,0.0033562344,0.00008931721,0.000033376757],"category_scores_gemma":[0.00028793773,0.00015336556,0.00006853239,0.00013996611,0.00007669675,0.0015143539,0.00059761025,0.0001994952,0.00023396433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019483361,0.00050482084,0.056435518,0.00025736762,0.0001073398,0.00007687486,0.013494419,0.00019955779,0.0023437776,0.8291334,0.02150953,0.07591794],"study_design_scores_gemma":[0.0026060084,0.00024825157,0.29073298,0.0006804492,0.000036929832,0.00016163566,0.001070509,0.53317213,0.04156612,0.03523152,0.09157083,0.0029226295],"about_ca_topic_score_codex":0.00011104304,"about_ca_topic_score_gemma":0.000024037032,"teacher_disagreement_score":0.8901772,"about_ca_system_score_codex":0.000029132985,"about_ca_system_score_gemma":0.00011582891,"threshold_uncertainty_score":0.99960965},"labels":[],"label_agreement":null},{"id":"W2599927475","doi":"10.1109/saner.2017.7884625","title":"Computing counter-examples for privilege protection losses using security models","year":2017,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Privilege (computing); Computer science; Computer security","score_opus":0.15726621549723246,"score_gpt":0.3346804236864197,"score_spread":0.17741420818918724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599927475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09303979,0.00002226328,0.90398127,0.00038135325,0.0006262086,0.00047356146,0.0000031680734,0.00024947213,0.0012229325],"genre_scores_gemma":[0.8522518,0.0000021591584,0.14736667,0.000102474085,0.00023512307,0.000011378029,0.0000012496221,0.000008639085,0.00002046812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.00003781294,0.0002742097,0.00046932657,0.00020242044,0.0002971756],"domain_scores_gemma":[0.9983459,0.00011135415,0.00032800966,0.0009161677,0.00023636776,0.00006216975],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005209471,0.0001421559,0.00016357566,0.00006392917,0.001755976,0.0011062552,0.0012210213,0.00007837121,0.0000041923136],"category_scores_gemma":[0.000119732074,0.00014196792,0.00008084084,0.00007324429,0.000073377225,0.001401381,0.00040499566,0.000118278855,0.000004585837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001653147,0.00016214298,0.00066332024,0.00021100118,0.00004293181,0.000002422558,0.0033912393,0.010986073,0.001998208,0.95257795,0.00029407395,0.029654099],"study_design_scores_gemma":[0.00024196612,0.000030129675,0.00023174984,0.000050192564,0.0000040363007,0.0000148680665,0.00004157268,0.9465621,0.003434771,0.04781243,0.0013954558,0.00018074422],"about_ca_topic_score_codex":0.00035360074,"about_ca_topic_score_gemma":0.000032485634,"teacher_disagreement_score":0.935576,"about_ca_system_score_codex":0.00006331384,"about_ca_system_score_gemma":0.00007989803,"threshold_uncertainty_score":0.9999307},"labels":[],"label_agreement":null},{"id":"W2603022255","doi":"10.1007/978-3-662-54580-5_5","title":"Rewriting-Based Runtime Verification for Alternation-Free HyperLTL","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":42,"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","funders":"","keywords":"Computer science; Rewriting; TRACE (psycholinguistics); Alternation (linguistics); Programming language; Runtime verification; Theoretical computer science; Temporal logic; Information flow; Formal verification","score_opus":0.031596157245524385,"score_gpt":0.278020581336785,"score_spread":0.24642442409126059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603022255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000028957917,0.00022793077,0.9894514,0.0029256495,0.002558595,0.0006838582,0.000017603727,0.00025342303,0.0038525783],"genre_scores_gemma":[0.11451554,0.000019184508,0.88151354,0.002036121,0.0013660211,0.000052584393,0.000044344833,0.000054711858,0.00039793862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959538,0.00003153942,0.0007072762,0.001758857,0.00094884366,0.0005996793],"domain_scores_gemma":[0.9939411,0.00083197956,0.00082951953,0.0035981904,0.0006502039,0.00014899037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016671387,0.00047284862,0.00046070977,0.0007080988,0.0009844216,0.0014108686,0.007849478,0.0003430765,0.000014696588],"category_scores_gemma":[0.0006166637,0.00050612947,0.00019466285,0.00021135365,0.00055972347,0.00076705765,0.0008676068,0.000548019,0.000037916707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581383,0.00006948595,0.000058432288,0.000115639516,0.000018803925,0.00001728209,0.00058497844,0.029452508,0.00025561193,0.1796764,0.00035999014,0.78937507],"study_design_scores_gemma":[0.0005177349,0.00009998244,0.0001105757,0.0002864772,0.0000082474035,0.000014217795,1.0148753e-7,0.8072386,0.002083523,0.17480113,0.014279207,0.0005602233],"about_ca_topic_score_codex":0.000024036686,"about_ca_topic_score_gemma":0.000033159446,"teacher_disagreement_score":0.78881484,"about_ca_system_score_codex":0.00032414243,"about_ca_system_score_gemma":0.0007962771,"threshold_uncertainty_score":0.99973905},"labels":[],"label_agreement":null},{"id":"W2618644177","doi":"10.1145/2626401.2626414","title":"File systems deserve verification too!","year":2014,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Security and Verification in Computing","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":"Computer science; Correctness; Modular design; Component (thermodynamics); Implementation; File system; Programming language; Set (abstract data type); Operating system","score_opus":0.036823634394412295,"score_gpt":0.2816071645961751,"score_spread":0.24478353020176277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618644177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026705475,0.20108777,0.7693848,0.0031936015,0.00617589,0.0037305166,0.000046662244,0.0013116598,0.01239857],"genre_scores_gemma":[0.93180436,0.0065433364,0.052555244,0.0031664686,0.0018243898,0.0016278666,0.00028414206,0.00009568666,0.0020984837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671614,0.00087883923,0.000963971,0.0006639032,0.00042906802,0.00034809302],"domain_scores_gemma":[0.9957362,0.00096534105,0.0004472967,0.0023787825,0.00034061118,0.00013179531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024346362,0.00024813393,0.0005353972,0.00006235433,0.00043628833,0.00081711006,0.0022117565,0.00010020767,0.000062498606],"category_scores_gemma":[0.0030038278,0.00022168201,0.000103037055,0.00056124036,0.00002704926,0.0006072915,0.00032941124,0.00020844123,0.0006245107],"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.0000019918368,0.00019094943,0.000965391,0.023970995,0.00013425369,0.000009509415,0.0015309678,0.0061049764,0.0018506402,0.58295864,0.30874,0.07354167],"study_design_scores_gemma":[0.00021168847,0.00007133449,0.00029411382,0.011001024,0.000025401518,0.00014210392,0.00007335689,0.4701252,0.00010605011,0.000058875416,0.5172871,0.0006037503],"about_ca_topic_score_codex":0.00020780855,"about_ca_topic_score_gemma":0.0000013635779,"teacher_disagreement_score":0.92913383,"about_ca_system_score_codex":0.00008721339,"about_ca_system_score_gemma":0.000084354135,"threshold_uncertainty_score":0.903993},"labels":[],"label_agreement":null},{"id":"W2672744731","doi":"","title":"Toward preventing stack overflow using kernel properties","year":2015,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Bishop's University","funders":"","keywords":"Buffer overflow; Computer science; Kernel (algebra); Stack (abstract data type); Call stack; Code (set theory); Operating system; System call; Linux kernel; Source code; Programming language; Set (abstract data type); Mathematics","score_opus":0.21852113299802936,"score_gpt":0.3014739347040249,"score_spread":0.08295280170599553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2672744731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20507966,0.00017232174,0.78886306,0.00034567743,0.00049394224,0.000095140815,1.5170487e-7,0.00026156448,0.004688496],"genre_scores_gemma":[0.8803354,0.0000014463462,0.118957214,0.00021824842,0.00011121074,0.0000020871612,2.7547492e-7,0.0000051184134,0.00036901055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903077,0.000055681136,0.00019350507,0.0002587278,0.0002537293,0.00020757227],"domain_scores_gemma":[0.9993373,0.000021611675,0.00007124852,0.0003431671,0.00013304032,0.000093626055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043074257,0.000086008215,0.00009178061,0.000045715016,0.00009865967,0.00026914163,0.0005582775,0.00003590745,0.0000095994665],"category_scores_gemma":[0.000090326226,0.00007404963,0.00003543259,0.0002219265,0.000023109022,0.00060518715,0.0003095312,0.00008088215,0.000055235465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054323125,0.00084680633,0.019555766,0.00045516447,0.00019047178,0.000059313723,0.09254568,0.0432124,0.021149414,0.70665985,0.015768288,0.09950251],"study_design_scores_gemma":[0.00018750028,0.000022061633,0.00013968885,0.000034093355,0.0000024478575,0.00002127436,0.00033194368,0.98582816,0.0082479855,0.0023949503,0.0026301905,0.00015972696],"about_ca_topic_score_codex":0.00007163301,"about_ca_topic_score_gemma":0.0000014214087,"teacher_disagreement_score":0.94261575,"about_ca_system_score_codex":0.00005762672,"about_ca_system_score_gemma":0.00013886078,"threshold_uncertainty_score":0.30196565},"labels":[],"label_agreement":null},{"id":"W2696905313","doi":"10.1145/2984639","title":"Non-interference in Partial Order Models","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Undecidable problem; Decidability; Equivalence (formal languages); Automaton; Computer science; Concurrency; Theoretical computer science; Formalism (music); Bounded function; Cellular automaton; Mathematics; Discrete mathematics; Algorithm; Programming language","score_opus":0.039676435289105506,"score_gpt":0.2761719093572023,"score_spread":0.23649547406809682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2696905313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02309718,0.000037084566,0.97291136,0.00069062976,0.0019368575,0.00028793918,0.0000027809913,0.00036786814,0.00066832337],"genre_scores_gemma":[0.97954327,0.0000102951835,0.020016726,0.00012620262,0.00011822205,0.000030430043,5.608214e-7,0.000017718008,0.00013660357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761313,0.00017931267,0.0006454452,0.00074211427,0.0003209086,0.00049911346],"domain_scores_gemma":[0.9975912,0.0005649057,0.00017520842,0.0013910615,0.00015915152,0.0001184585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392195,0.00024448687,0.00030124042,0.00029870396,0.00025517476,0.00022175605,0.001672473,0.0001333598,0.000010787824],"category_scores_gemma":[0.00004448523,0.00019914046,0.000089805,0.00082571246,0.000051783976,0.0005520412,0.000049170496,0.00026566663,0.00013235094],"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.00007234562,0.0007138386,0.00032760005,0.00012457356,0.00011094163,0.00003910702,0.013435684,0.6693613,0.002584318,0.07493329,0.00030878087,0.23798822],"study_design_scores_gemma":[0.00082599913,0.000092558585,0.00008028567,0.0004945014,0.000004523181,0.000036039597,0.00019881414,0.9938637,0.0016966363,0.002177034,0.00020265846,0.00032727164],"about_ca_topic_score_codex":0.00011450203,"about_ca_topic_score_gemma":0.00000945465,"teacher_disagreement_score":0.95644605,"about_ca_system_score_codex":0.00016129971,"about_ca_system_score_gemma":0.00010757824,"threshold_uncertainty_score":0.81207126},"labels":[],"label_agreement":null},{"id":"W2735497888","doi":"10.1561/1000000052","title":"Secure Processors Part II: Intel SGX Security Analysis and MIT Sanctum Architecture","year":2017,"lang":"en","type":"article","venue":"Foundations and Trends® in Electronic Design Automation","topic":"Security and Verification in Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Guard (computer science); Software; Isolation (microbiology); State (computer science); Computer security; Trusted Computing; Overhead (engineering); Security analysis; System software; Computation; Software engineering; Operating system; Programming language","score_opus":0.020228285361119053,"score_gpt":0.2873282454876661,"score_spread":0.2670999601265471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735497888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11028016,0.00038483663,0.8858442,0.00232303,0.00012430748,0.00018629646,0.0000036988035,0.0001884921,0.00066497334],"genre_scores_gemma":[0.99013597,0.00007652636,0.0094854925,0.0000508486,0.000048419643,0.000046742927,0.000041732623,0.000007153518,0.00010709332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985061,0.00012876822,0.0003139643,0.00051167206,0.00019373243,0.0003457182],"domain_scores_gemma":[0.9988486,0.00014012132,0.00030279026,0.000561772,0.00008045035,0.00006624457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373614,0.00017588183,0.00021961458,0.00062284135,0.0011995143,0.00074487965,0.0004643015,0.000099941746,0.000035469337],"category_scores_gemma":[0.00013514605,0.00017544105,0.000056388933,0.0008914844,0.00010160851,0.00085388497,0.00015243083,0.00028181027,0.0000031638872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026613956,0.0002903174,0.004637064,0.0000675876,0.00043494647,0.000004338113,0.013410641,0.003510217,0.00010260237,0.33067688,0.00040319262,0.6464356],"study_design_scores_gemma":[0.00047890266,0.00012497671,0.04625271,0.00003443708,0.00010999658,0.00001661084,0.00003871346,0.87853426,0.00023274969,0.07054478,0.00333826,0.0002936205],"about_ca_topic_score_codex":0.000079056736,"about_ca_topic_score_gemma":0.00061891926,"teacher_disagreement_score":0.8798558,"about_ca_system_score_codex":0.000093870076,"about_ca_system_score_gemma":0.00009777848,"threshold_uncertainty_score":0.92258155},"labels":[],"label_agreement":null},{"id":"W2745277239","doi":"10.1109/qrs.2017.32","title":"Intersert: Assertions on Distributed Process Interaction Sessions","year":2017,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Toolchain; Computer science; Thread (computing); Distributed computing; Control flow; Overhead (engineering); Process (computing); Process calculus; Implementation; Programming language; Software","score_opus":0.05962246823097484,"score_gpt":0.3769821108237323,"score_spread":0.31735964259275745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745277239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070843644,0.0000017776366,0.89927036,0.0063983505,0.0011345153,0.0000874185,0.000002415526,0.00028762946,0.021973861],"genre_scores_gemma":[0.99691135,0.0000012655047,0.0025393795,0.00027399327,0.00006143538,0.000012522184,0.0000061272904,0.0000031598463,0.00019078258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.000024051384,0.0001399723,0.00025266243,0.0001307042,0.00013019989],"domain_scores_gemma":[0.99882627,0.00007237955,0.00013883211,0.0008001665,0.0001002022,0.00006214741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011548272,0.00007556071,0.00006704162,0.000050486047,0.00094035227,0.0006056985,0.0010457401,0.00003826673,0.000043528322],"category_scores_gemma":[0.00020687874,0.00006430184,0.000039537004,0.00008304695,0.000027499753,0.0008604101,0.00015769363,0.00014894264,0.00014669697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026784151,0.00070591876,0.005571901,0.000033272485,0.00004723116,0.000011844412,0.0028820625,0.001216864,0.0011591004,0.90494275,0.011075276,0.07232697],"study_design_scores_gemma":[0.00054499303,0.00014727195,0.068345375,0.00025613877,0.000008412489,0.000028745495,0.0007965624,0.8747526,0.022154031,0.013999552,0.018492252,0.00047408493],"about_ca_topic_score_codex":0.000023261438,"about_ca_topic_score_gemma":0.0000126112145,"teacher_disagreement_score":0.9260677,"about_ca_system_score_codex":0.00003569508,"about_ca_system_score_gemma":0.000033615914,"threshold_uncertainty_score":0.7232524},"labels":[],"label_agreement":null},{"id":"W2761352457","doi":"10.1145/3133923","title":"IDE <sup> <i>al</i> </sup> : efficient and precise alias-aware dataflow analysis","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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 Alberta","funders":"Heinz Nixdorf Stiftung","keywords":"Alias; Computer science; Dataflow; Programming language; Ideal (ethics); Aliasing; Static analysis; Parallel computing; Theoretical computer science; Algorithm; Data mining; Artificial intelligence","score_opus":0.020931023519955325,"score_gpt":0.29329843884934265,"score_spread":0.2723674153293873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761352457","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.9880183,0.00033903067,0.0032465265,0.006749373,0.00013393213,0.00043699448,0.000010543303,0.00023251727,0.0008327912],"genre_scores_gemma":[0.9666904,0.000016641723,0.032892965,0.00021665423,0.000058646696,0.000022424996,0.0000020196092,0.000010654011,0.000089564564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841535,0.000013920001,0.0002771937,0.0005522715,0.0004373616,0.00030389355],"domain_scores_gemma":[0.9974558,0.00013041624,0.00049171026,0.0016458698,0.00019034327,0.00008587761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076132227,0.00018130323,0.00025654698,0.00014516039,0.0007125096,0.0009203937,0.005162028,0.00006367209,0.000003592243],"category_scores_gemma":[0.0015570911,0.00013482047,0.00014360878,0.00044453543,0.0001774495,0.0003488264,0.0025866935,0.00019639265,0.0000038410794],"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.00009036226,0.00090127887,0.14964873,0.00075679517,0.0011129322,0.000011396184,0.02835312,0.00205506,0.003997458,0.04710152,0.008159851,0.7578115],"study_design_scores_gemma":[0.0029662328,0.0006865439,0.12955388,0.0015219863,0.0015039863,0.000103602346,0.008570826,0.67513406,0.12475704,0.0063674534,0.046306632,0.0025277776],"about_ca_topic_score_codex":0.00007592818,"about_ca_topic_score_gemma":0.0000028726008,"teacher_disagreement_score":0.7552837,"about_ca_system_score_codex":0.000023139975,"about_ca_system_score_gemma":0.000018494942,"threshold_uncertainty_score":0.95924187},"labels":[],"label_agreement":null},{"id":"W2762867759","doi":"10.1145/3513005","title":"Computation on Encrypted Data Using Dataflow Authentication","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Privacy and Security","topic":"Security and Verification in Computing","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; Dataflow; Compiler; Cloud computing; Homomorphic encryption; Cryptography; Bytecode; Ciphertext; Computer network; Operating system; Computer security; Java","score_opus":0.1088790691157661,"score_gpt":0.330036887447403,"score_spread":0.2211578183316369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762867759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13821253,0.00003740941,0.8589627,0.0018035612,0.00046310632,0.00019894232,0.00009033483,0.00017113874,0.000060240658],"genre_scores_gemma":[0.9645699,0.000020379986,0.034761477,0.00047392864,0.000030168829,0.000013511164,0.00011474851,0.000008264553,0.0000075879348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982736,0.00024681966,0.00026563954,0.0006559297,0.00037032246,0.00018767774],"domain_scores_gemma":[0.9976565,0.00031951495,0.00011579206,0.0017895616,0.00004337545,0.00007520584],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057704886,0.00013507293,0.00012483905,0.00017466614,0.0013110859,0.00016251525,0.0018296439,0.000041769512,0.00005705416],"category_scores_gemma":[0.00006806646,0.00015524357,0.00003325443,0.0005120457,0.00004417521,0.0006634478,0.00027119854,0.0004068448,0.000010519726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036283812,0.005282708,0.00038889135,0.00022380102,0.00033826783,0.000039438037,0.047763564,0.0802488,0.0033344403,0.18694974,0.0019502175,0.6731173],"study_design_scores_gemma":[0.00040547244,0.00011575453,0.00052867713,0.00001335292,0.000019012907,0.000033669327,0.00017380822,0.96933913,0.00041420068,0.023703024,0.005050175,0.00020369492],"about_ca_topic_score_codex":0.00004742198,"about_ca_topic_score_gemma":0.0000025721304,"teacher_disagreement_score":0.88909036,"about_ca_system_score_codex":0.000075713026,"about_ca_system_score_gemma":0.00006858184,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W2791711315","doi":"10.4018/ijdst.2018040103","title":"Evaluating the Java Native Interface (JNI)","year":2018,"lang":"en","type":"article","venue":"International Journal of Distributed Systems and Technologies","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Computer science; Java; Programming language; Python (programming language); Real time Java; Generics in Java; Java annotation; Interoperability; Java applet; Interface (matter); Application programming interface; World Wide Web; Operating system","score_opus":0.06304671864767626,"score_gpt":0.37279060362083205,"score_spread":0.3097438849731558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791711315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18524851,0.0016183375,0.80320233,0.007093253,0.0023998565,0.00008916307,0.000013285089,0.00014253137,0.00019275934],"genre_scores_gemma":[0.9959503,0.000053173186,0.0037588484,0.000028297787,0.00018697247,0.0000030065553,8.7941197e-7,0.0000025971128,0.00001594673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885136,0.00007010145,0.00040987952,0.00013763877,0.0004201258,0.000110881156],"domain_scores_gemma":[0.9978262,0.00025790106,0.0005295056,0.00020234531,0.0011662384,0.000017802264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622135,0.00008474842,0.00012616241,0.0001244805,0.0001578135,0.00037859502,0.0015639814,0.00006387867,0.0000021087865],"category_scores_gemma":[0.0007904768,0.00005405204,0.000039999108,0.0002181878,0.00020457772,0.00032186531,0.00038034611,0.00021642225,0.0000041138683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008793688,0.00014879945,0.0026903742,0.000029015457,0.0007608453,0.000043216256,0.0043185577,0.0011669325,0.006896697,0.61565423,0.0066124243,0.36159095],"study_design_scores_gemma":[0.002388961,0.002753572,0.0073074987,0.0013374467,0.000060399903,0.0038715277,0.022815894,0.781908,0.04012588,0.07181561,0.06484752,0.0007677019],"about_ca_topic_score_codex":0.000013982163,"about_ca_topic_score_gemma":9.769691e-7,"teacher_disagreement_score":0.8107018,"about_ca_system_score_codex":0.00006772475,"about_ca_system_score_gemma":0.000053593536,"threshold_uncertainty_score":0.36508006},"labels":[],"label_agreement":null},{"id":"W2797835509","doi":"10.1016/j.cose.2018.01.017","title":"If-transpiler: Inlining of hybrid flow-sensitive security monitor for JavaScript","year":2018,"lang":"en","type":"article","venue":"Computers & Security","topic":"Security and Verification in Computing","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 Victoria","funders":"","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Compiler; Source code; Web application; Computer security; Programming language; Rich Internet application; Operating system","score_opus":0.019626182010947298,"score_gpt":0.26642535161458086,"score_spread":0.24679916960363357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797835509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20407687,0.00012858026,0.7903736,0.0005078505,0.0036464927,0.0005092204,0.000058373163,0.0003375319,0.0003614817],"genre_scores_gemma":[0.8881795,0.000013601857,0.10995513,0.0005302031,0.0012473443,0.000021326614,0.000024337287,0.000022702843,0.0000058954856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697477,0.0001979957,0.0007751702,0.00096127595,0.00045240502,0.00063838594],"domain_scores_gemma":[0.9967958,0.00063464185,0.00039334066,0.001053671,0.00089558924,0.00022699923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009359094,0.0003628461,0.00054985395,0.00021390001,0.0005818746,0.00025187168,0.0015637554,0.00012326156,0.000009369237],"category_scores_gemma":[0.0001279283,0.00040440325,0.00032047543,0.0005466111,0.00045656634,0.00062482746,0.00045220598,0.00033621458,0.000022753862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086750794,0.0034631323,0.0032281813,0.0018565299,0.0013537238,0.0001624728,0.24888657,0.0030298685,0.005059098,0.33948386,0.11050176,0.2821073],"study_design_scores_gemma":[0.0010352578,0.00043814635,0.0004937504,0.00017541114,0.000028092123,0.0000374882,0.00015542803,0.9359667,0.02779898,0.019773366,0.013587161,0.0005102293],"about_ca_topic_score_codex":0.00006012912,"about_ca_topic_score_gemma":0.000009243522,"teacher_disagreement_score":0.93293685,"about_ca_system_score_codex":0.000086449494,"about_ca_system_score_gemma":0.00016574103,"threshold_uncertainty_score":0.9998408},"labels":[],"label_agreement":null},{"id":"W2802705557","doi":"10.5539/nct.v3n1p6","title":"A Robust Authentication Scheme for Client-Server Architecture With Provable Security Analysis","year":2018,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Security and Verification in Computing","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; Internet Authentication Service; Authentication (law); Authentication server; Distributed System Security Architecture; Client–server model; Maintainability; Operating system; Virtualization; Computer security; Server; Computer network; Network Access Control; Software engineering; Cloud computing security; Cloud computing","score_opus":0.023431317508079082,"score_gpt":0.24523977686574364,"score_spread":0.22180845935766455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802705557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053596247,0.001124325,0.93868995,0.0046340115,0.00004039843,0.00040540262,0.0000015885794,0.0010807232,0.00042733116],"genre_scores_gemma":[0.70768803,0.00012083905,0.29193866,0.00007716284,0.000025061205,0.000101519276,0.000014374171,0.0000047434546,0.00002960306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.000060085746,0.00021780972,0.0003624714,0.00013109596,0.00024139628],"domain_scores_gemma":[0.9977892,0.00017279213,0.00020097198,0.0015680537,0.00024380127,0.000025190078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045988607,0.00012651221,0.00017325862,0.00015325322,0.00068031426,0.00020712946,0.0012636614,0.00012944941,0.0000035156652],"category_scores_gemma":[0.000056593,0.00010698888,0.00004385841,0.0012753485,0.0003288337,0.0002262417,0.0004899731,0.0001905423,0.0000036430915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050427334,0.00013846108,0.008752173,0.000042763742,0.0003615902,1.8102998e-7,0.002718101,0.0020820561,0.000077860226,0.9087483,0.0014091147,0.075618945],"study_design_scores_gemma":[0.0005701695,0.00037733442,0.0054190285,0.00008009287,0.00015367786,0.000008338576,0.0008022089,0.7591882,0.0013434917,0.20547004,0.026136572,0.00045087782],"about_ca_topic_score_codex":0.000012836688,"about_ca_topic_score_gemma":0.00007944861,"teacher_disagreement_score":0.7571061,"about_ca_system_score_codex":0.000022787763,"about_ca_system_score_gemma":0.000027665117,"threshold_uncertainty_score":0.5232496},"labels":[],"label_agreement":null},{"id":"W2894402816","doi":"10.1145/3322431.3325098","title":"Brokering Policies and Execution Monitors for IoT Middleware","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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; Canada Research Chairs","keywords":"MQTT; Computer science; Cloud computing; Computer security; Middleware (distributed applications); Event (particle physics); Modular design; Information flow; Architecture; Access control; Scheme (mathematics); Message broker; Internet of Things; Computer network; Distributed computing; Operating system","score_opus":0.04610948359060213,"score_gpt":0.2947614515573813,"score_spread":0.24865196796677919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894402816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06247534,0.00040668543,0.9315032,0.0009802565,0.0027868426,0.0004506601,0.0000055293413,0.0002971325,0.0010943864],"genre_scores_gemma":[0.86781013,0.00004410661,0.13095595,0.000209656,0.00037720255,0.000044836936,0.000009807874,0.000012240145,0.000536079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887484,0.000025985626,0.0002291336,0.00051658094,0.00014203203,0.0002114156],"domain_scores_gemma":[0.9989509,0.00016273648,0.0001371048,0.00058364315,0.00011034661,0.000055263976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021114558,0.00017014152,0.00019125588,0.0001233485,0.00014792554,0.00048474394,0.00066068437,0.00018841024,0.000001895181],"category_scores_gemma":[0.000042125223,0.00017328643,0.000077506505,0.00008708141,0.000028832052,0.00009551279,0.0011330904,0.00020078068,0.000008619836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019947498,0.00012696967,0.006768224,0.002499069,0.00016025688,0.0000017700706,0.014552657,0.030283118,0.0008262942,0.84157765,0.009426374,0.09375765],"study_design_scores_gemma":[0.00028384768,0.000053041796,0.0033316882,0.0002757498,0.000013261652,0.00000990013,0.0002511266,0.9531225,0.0051468974,0.024134135,0.012801899,0.00057594397],"about_ca_topic_score_codex":0.00015570951,"about_ca_topic_score_gemma":0.0000029008775,"teacher_disagreement_score":0.9228394,"about_ca_system_score_codex":0.000050257575,"about_ca_system_score_gemma":0.000093259034,"threshold_uncertainty_score":0.70664155},"labels":[],"label_agreement":null},{"id":"W2896578234","doi":"10.1145/3268935.3268936","title":"Pearl-TEE","year":2018,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Overhead (engineering); Isolation (microbiology); Mobile device; Embedded system; Code (set theory); Operating system; Cover (algebra); Pearl; Key (lock); Programming language; Engineering","score_opus":0.020705912994380498,"score_gpt":0.2636799030396373,"score_spread":0.2429739900452568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896578234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076744426,0.000009280881,0.8412964,0.00095361075,0.00038449749,0.000018970755,3.465368e-8,0.0002159374,0.14944686],"genre_scores_gemma":[0.8899755,5.720588e-7,0.10786825,0.0009097389,0.00021396209,8.095618e-7,1.06304455e-7,0.0000013510785,0.0010297387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961084,0.000012973641,0.000064369066,0.00013765361,0.00008057173,0.000093576076],"domain_scores_gemma":[0.99958193,0.000026595766,0.000016087293,0.00028906317,0.000056929606,0.000029392724],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011775006,0.000030229769,0.000028462327,0.000024530109,0.00010352446,0.00008762704,0.0004498797,0.00001587346,0.00013435392],"category_scores_gemma":[0.000016720176,0.000026981492,0.000014299717,0.00016775826,0.000029642539,0.00015808694,0.00010942132,0.000029536146,0.000977393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.2826907e-7,0.000011900088,0.0001953126,0.0000010092293,0.0000017681633,5.368289e-7,0.00077798933,6.57245e-7,0.00025496594,0.9576254,0.008707519,0.032422617],"study_design_scores_gemma":[0.0002973361,0.00016614897,0.010452208,0.000012528746,0.0000017377341,0.000036359594,0.000121692974,0.54098696,0.020391537,0.049492292,0.3776873,0.00035393235],"about_ca_topic_score_codex":0.000015376969,"about_ca_topic_score_gemma":0.000002415721,"teacher_disagreement_score":0.9081331,"about_ca_system_score_codex":0.0000058789533,"about_ca_system_score_gemma":0.000015884218,"threshold_uncertainty_score":0.99980044},"labels":[],"label_agreement":null},{"id":"W2900842017","doi":"10.1109/secdev.2018.00009","title":"BP: Formal Proofs, the Fine Print and Side Effects","year":2018,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematical proof; Computer science; Scrutiny; Formal methods; Popularity; Computer security; Software deployment; Cryptography; Software security assurance; Software; Formal description; Software engineering; Programming language; Information security; Mathematics; Security service; Law; Political science","score_opus":0.01259701020947337,"score_gpt":0.2437260636163908,"score_spread":0.23112905340691742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900842017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078507006,0.00005794338,0.90265906,0.0030705673,0.0003030768,0.00017478809,6.401311e-8,0.00013939803,0.01508809],"genre_scores_gemma":[0.97725683,0.000001430559,0.021566238,0.00086675957,0.00014688176,0.0000069492585,1.2470012e-7,0.0000018216791,0.0001529853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994952,0.000029455316,0.000083875464,0.00015581194,0.00009245442,0.00014322436],"domain_scores_gemma":[0.99945503,0.00014262056,0.000029604496,0.0002977681,0.00004301351,0.000031959677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028445298,0.000050875493,0.00004436856,0.000017104387,0.00024022764,0.00013127984,0.00036658306,0.000019797111,0.0000041356607],"category_scores_gemma":[0.0000430266,0.000030939642,0.000013329873,0.00011904538,0.00006485782,0.00021890822,0.00030527703,0.00005888212,0.000041366762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023157622,0.000019134699,0.00022030399,0.000018299912,0.0000060831703,0.0000010768907,0.001962483,0.0000033886442,0.00049624714,0.69565433,0.0007304351,0.30088592],"study_design_scores_gemma":[0.0006251172,0.0004130639,0.051321495,0.000049909533,0.0000065498725,0.00009108796,0.000053036525,0.7525064,0.094493166,0.023430366,0.07667064,0.00033922298],"about_ca_topic_score_codex":0.00001160099,"about_ca_topic_score_gemma":0.000012712011,"teacher_disagreement_score":0.8987498,"about_ca_system_score_codex":0.000005838622,"about_ca_system_score_gemma":0.000016372922,"threshold_uncertainty_score":0.18476611},"labels":[],"label_agreement":null},{"id":"W2902856285","doi":"10.1145/3274694.3274695","title":"MemCloak","year":2018,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Obfuscation; Memory protection; Overhead (engineering); Address space; Embedded system; Memory management; Operating system; Extended memory; Distributed computing; Computer security; Semiconductor memory","score_opus":0.02080617668239372,"score_gpt":0.26597832234270397,"score_spread":0.24517214566031026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902856285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045418553,0.000007669213,0.87134206,0.0010252704,0.00035720522,0.000015436783,2.6647756e-8,0.00020636218,0.12250411],"genre_scores_gemma":[0.8815083,5.6573697e-7,0.11692566,0.0010098527,0.00016953479,7.2750123e-7,7.751972e-8,9.844022e-7,0.00038431495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967146,0.000010185517,0.000055656183,0.00011785406,0.00006667635,0.0000781668],"domain_scores_gemma":[0.9996283,0.000023366578,0.000013741077,0.0002589406,0.000050175247,0.000025463154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010389538,0.000025262083,0.0000240537,0.000020861296,0.00008721711,0.0000668747,0.00040967792,0.000013323856,0.00011285482],"category_scores_gemma":[0.000014060208,0.000022198888,0.000011567781,0.00015993197,0.000024564546,0.00014073883,0.00009006105,0.000022262786,0.00076364714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.801976e-7,0.000006711201,0.00013527881,4.809476e-7,0.0000011180686,2.5840848e-7,0.00033699273,4.0929774e-7,0.00019084306,0.96888274,0.005659977,0.02478502],"study_design_scores_gemma":[0.00019120766,0.00007665698,0.005568959,0.0000064087135,0.000001064193,0.000022365251,0.000046290945,0.34746403,0.04984145,0.052995335,0.543556,0.00023029001],"about_ca_topic_score_codex":0.0000070010788,"about_ca_topic_score_gemma":0.0000015713766,"teacher_disagreement_score":0.9158874,"about_ca_system_score_codex":0.0000053459753,"about_ca_system_score_gemma":0.000012675656,"threshold_uncertainty_score":0.98153937},"labels":[],"label_agreement":null},{"id":"W2904756193","doi":"10.1145/3229061","title":"Type-Driven Gradual Security with References","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Programming language; Static analysis; Code refactoring; Simple (philosophy); Type (biology); Type safety; Type inference; Code (set theory); Theoretical computer science; Artificial intelligence; Software","score_opus":0.03285374123396055,"score_gpt":0.30095392533094545,"score_spread":0.2681001840969849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904756193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22942358,0.0005475999,0.76693696,0.0006402492,0.00076950353,0.00039173104,0.0000040054915,0.000554927,0.00073143037],"genre_scores_gemma":[0.9817774,0.000019298026,0.017904859,0.00004983889,0.0001107162,0.000022091845,0.000001960648,0.000007038209,0.00010678738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904287,0.00007173103,0.00015628304,0.00032848577,0.00019680266,0.00020382056],"domain_scores_gemma":[0.9991377,0.0000976254,0.0000685247,0.0004987299,0.00012091482,0.00007648346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019618179,0.00011717602,0.00012883743,0.00007814665,0.00036937976,0.0003401041,0.00042401833,0.000059252612,0.000005896615],"category_scores_gemma":[0.000014582165,0.00008967645,0.000023206687,0.0003483213,0.00010012149,0.00019167391,0.000013003847,0.0001399617,0.000017220511],"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.00008364217,0.00041052295,0.0019187257,0.00025027193,0.00023058533,0.000043804102,0.03271397,0.00022384782,0.0002579484,0.05837304,0.0002403135,0.90525335],"study_design_scores_gemma":[0.0074387677,0.021713749,0.00945573,0.0033651213,0.00044418572,0.0031525716,0.07668066,0.42847306,0.012928854,0.0072672525,0.42265046,0.006429603],"about_ca_topic_score_codex":0.00024630717,"about_ca_topic_score_gemma":0.00008810745,"teacher_disagreement_score":0.89882374,"about_ca_system_score_codex":0.00001481306,"about_ca_system_score_gemma":0.000028034885,"threshold_uncertainty_score":0.36568993},"labels":[],"label_agreement":null},{"id":"W2910626258","doi":"","title":"Vulnerability-Aware Architecture for a Tactical, Mobile Cloud.","year":2012,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Defence Research and Development Canada","funders":"","keywords":"Computer security; Cloud computing; Computer science; Vulnerability (computing); Identification (biology); Domain (mathematical analysis); Architecture; Situation awareness; State (computer science); Human–computer interaction; Engineering; Geography; Operating system","score_opus":0.032434369335157996,"score_gpt":0.31489585646772744,"score_spread":0.28246148713256947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910626258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012111431,0.000083529,0.9838766,0.0009990558,0.0008634143,0.0003101513,0.0000020349898,0.00026708803,0.0014867091],"genre_scores_gemma":[0.86060256,0.0000011693786,0.13790339,0.00075598527,0.0004920035,0.00010190172,0.000002385869,0.0000057523966,0.00013484011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905384,0.00005727165,0.00016804399,0.0002491783,0.00013359914,0.00033809803],"domain_scores_gemma":[0.9987368,0.00050037185,0.000043685686,0.0005143134,0.00007107085,0.00013373498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767648,0.00009367955,0.000103781895,0.000039555795,0.0002042264,0.00010208539,0.00050457526,0.00006057284,0.00005809087],"category_scores_gemma":[0.0000971859,0.00007903151,0.00007498314,0.00019418987,0.000032832726,0.00028256324,0.00013117562,0.00013336414,0.000049679347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013783757,0.0004720274,0.0012774458,0.000087489716,0.000024218754,3.893626e-7,0.0050726626,0.000457741,0.00041608608,0.8704127,0.014689537,0.10707591],"study_design_scores_gemma":[0.0005619873,0.00021210448,0.0008607507,0.000015284095,0.000010692353,0.00004618643,0.00025674855,0.1339475,0.009628615,0.026468446,0.8274754,0.00051622896],"about_ca_topic_score_codex":0.000007409702,"about_ca_topic_score_gemma":0.0000013512368,"teacher_disagreement_score":0.84849113,"about_ca_system_score_codex":0.000029999657,"about_ca_system_score_gemma":0.000030622756,"threshold_uncertainty_score":0.32228115},"labels":[],"label_agreement":null},{"id":"W2914627611","doi":"10.4018/ijsssp.2018070102","title":"Evaluation of Dynamic Analysis Tools for Software Security","year":2018,"lang":"en","type":"article","venue":"International Journal of Systems and Software Security and Protection","topic":"Security and Verification in Computing","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":"Ontario Tech University","funders":"","keywords":"Computer science; Memory safety; Software security assurance; Secure coding; Security testing; Buffer overflow; Computer security; Software deployment; Software engineering; Application security; Software; Operating system; Security information and event management; Security service; Information security; Cloud computing security","score_opus":0.04488731710815079,"score_gpt":0.3208924890578673,"score_spread":0.2760051719497165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914627611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29073262,0.0008682138,0.7068177,0.00017200768,0.0010683803,0.00028784276,0.000019603664,0.000022471388,0.000011195073],"genre_scores_gemma":[0.99265796,0.00007635531,0.0068951515,0.00002289246,0.00031715728,0.00001830324,0.0000046771765,0.0000046134032,0.0000029091298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802953,0.00022512297,0.0005908793,0.00022916227,0.00081729365,0.0001080256],"domain_scores_gemma":[0.9947938,0.000241977,0.00077031954,0.00015499697,0.0039751953,0.00006373739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034908461,0.00010985534,0.0002610179,0.00038590742,0.00016875508,0.00032116318,0.00033090226,0.000109691995,0.0000058470127],"category_scores_gemma":[0.001086277,0.000102467806,0.00012776811,0.00030675245,0.000079426085,0.00090264843,0.00007641327,0.00014487152,4.43986e-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.00042094433,0.00042187198,0.003909165,0.0005648434,0.00409424,0.000006244357,0.027794443,0.0014402656,0.0011703104,0.018624885,0.000119095595,0.94143367],"study_design_scores_gemma":[0.0022901269,0.0009851182,0.01186742,0.00047651134,0.000720582,0.0003886618,0.00096056453,0.9028762,0.0013089598,0.07477542,0.002962974,0.000387475],"about_ca_topic_score_codex":0.0001148163,"about_ca_topic_score_gemma":0.00004662995,"teacher_disagreement_score":0.94104624,"about_ca_system_score_codex":0.00010129824,"about_ca_system_score_gemma":0.000120349076,"threshold_uncertainty_score":0.4178516},"labels":[],"label_agreement":null},{"id":"W2946012514","doi":"10.1145/3316781.3317897","title":"Revisiting the ARM Debug Facility for OS Kernel Security","year":2019,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Debugging; Linux kernel; Embedded system; Spec#; Kernel (algebra); Operating system; ARM architecture; Overhead (engineering); Software; Software security assurance; Programming language; Cloud computing; Cloud computing security","score_opus":0.02519338034374301,"score_gpt":0.26767797966374807,"score_spread":0.24248459932000505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946012514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081709325,0.00007793352,0.90396476,0.004358873,0.0004971089,0.00048442322,0.000004633803,0.00025986673,0.008643097],"genre_scores_gemma":[0.9878462,0.0000030770823,0.0106583685,0.00096869364,0.00015189772,0.000016323515,0.0000025479972,0.000002697931,0.00035019306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.000063206135,0.00021306932,0.00035026832,0.00016476195,0.00022046747],"domain_scores_gemma":[0.9985479,0.00052071665,0.00008414184,0.00069593114,0.00010998701,0.000041298117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092597556,0.00008881816,0.00010715844,0.000020078187,0.0002314002,0.00020222514,0.000905261,0.000042148265,0.000081317026],"category_scores_gemma":[0.00011715286,0.00006288959,0.00008732288,0.00018038077,0.00002314406,0.00023315541,0.00020734657,0.0001228289,0.00021065742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008377191,0.00005013779,0.0064917435,0.0001293226,0.000022242393,4.760026e-7,0.0037732192,0.00016420541,0.0002535942,0.8722721,0.0018253494,0.115009256],"study_design_scores_gemma":[0.00042124372,0.00004189705,0.003998129,0.000027828795,0.0000048973807,0.000010681477,0.00032455355,0.84981495,0.0024800263,0.036231816,0.10635507,0.0002889132],"about_ca_topic_score_codex":0.000025600531,"about_ca_topic_score_gemma":0.0000016522021,"teacher_disagreement_score":0.9061369,"about_ca_system_score_codex":0.000025301177,"about_ca_system_score_gemma":0.00003860753,"threshold_uncertainty_score":0.27076453},"labels":[],"label_agreement":null},{"id":"W2950759382","doi":"10.3934/amc.2019034","title":"Critical perspectives on provable security: Fifteen years of \"another look\" papers","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Security and Verification in Computing","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 Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Provable security; Subject (documents); Calculus (dental); Computer science; Cryptography; Algorithm; Library science","score_opus":0.019055851549277723,"score_gpt":0.320767214288058,"score_spread":0.30171136273878024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950759382","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.20846343,0.020949852,0.15261415,0.006958826,0.00063418737,0.0023803413,0.000038575607,0.00038634508,0.6075743],"genre_scores_gemma":[0.8329687,0.00065853546,0.16627742,0.000034525896,0.0000044848134,0.000013595305,8.7023625e-7,0.0000066727384,0.000035170564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990426,0.00007945512,0.00037178939,0.00016899496,0.00021341864,0.00012374419],"domain_scores_gemma":[0.9962076,0.0015833494,0.00018812284,0.0018711061,0.00013069101,0.000019135274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747374,0.000077889126,0.00020765432,0.00011903997,0.000040285184,0.000021033657,0.0016832052,0.000042522035,0.000026247742],"category_scores_gemma":[0.00037050317,0.00008413107,0.000053768144,0.0003459532,0.00021955314,0.00036770612,0.00030197977,0.00016502893,0.000020647729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002054865,0.00040909316,0.00023318517,0.00011062016,0.0000068365644,1.1515347e-7,0.013377059,0.00022812854,0.00029989413,0.982984,0.0000074119557,0.002341607],"study_design_scores_gemma":[0.00084562396,0.00033759893,0.0013309248,0.0013104058,0.000017969465,0.000006781737,0.017064992,0.15420566,0.004858367,0.8020216,0.017499372,0.0005006624],"about_ca_topic_score_codex":0.000005375098,"about_ca_topic_score_gemma":0.0000076151573,"teacher_disagreement_score":0.6245053,"about_ca_system_score_codex":0.000026954369,"about_ca_system_score_gemma":0.000041690088,"threshold_uncertainty_score":0.34307656},"labels":[],"label_agreement":null},{"id":"W2950853166","doi":"10.60882/cispa.32789769","title":"ZeroTrace : Oblivious Memory Primitives from Intel SGX","year":2017,"lang":"en","type":"preprint","venue":"CISPA Helmholtz Center","topic":"Security and Verification in Computing","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; Parallel computing","score_opus":0.04965186963499763,"score_gpt":0.29805373602265983,"score_spread":0.2484018663876622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950853166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11921982,0.0025819072,0.83523387,0.00401685,0.015129541,0.0010159706,0.00019511915,0.0010325761,0.021574356],"genre_scores_gemma":[0.96981645,0.0002759718,0.026288198,0.001144306,0.0011866385,0.00007299163,0.0001258731,0.000051055096,0.0010384965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963362,0.00022417831,0.000617592,0.0016473118,0.0005759879,0.00059868715],"domain_scores_gemma":[0.9946795,0.00035467683,0.0007406345,0.0037071542,0.00027651608,0.00024149276],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005070608,0.0005396146,0.00058596267,0.0002088357,0.00048387685,0.001588674,0.005326949,0.0005080412,0.00011073618],"category_scores_gemma":[0.00033492895,0.00057034293,0.00035102936,0.00009573916,0.00021925218,0.0005499486,0.0052563595,0.0014186883,0.0004761118],"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.00016263043,0.0030846444,0.019161748,0.0012227254,0.0013989839,0.000711518,0.061994497,0.001972322,0.0020906993,0.04004346,0.07673394,0.79142284],"study_design_scores_gemma":[0.006761794,0.00032849566,0.1454554,0.010171803,0.00029634967,0.00019131503,0.0009871842,0.35235897,0.033185225,0.13714162,0.30365092,0.009470914],"about_ca_topic_score_codex":0.00020323017,"about_ca_topic_score_gemma":0.00001974937,"teacher_disagreement_score":0.85059667,"about_ca_system_score_codex":0.00016965068,"about_ca_system_score_gemma":0.0002516906,"threshold_uncertainty_score":0.9996748},"labels":[],"label_agreement":null},{"id":"W2951545071","doi":"10.14279/tuj.eceasst.70.979","title":"Verification of Information Flow Properties under Rational Observation","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Security and Verification in Computing","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":"Decidability; Information flow; Mathematical proof; PSPACE; TRACE (psycholinguistics); Completeness (order theory); Theoretical computer science; Computer science; Anonymity; Class (philosophy); Regular language; Discrete mathematics; Mathematics; Programming language; Automaton; Algorithm; Computational complexity theory; Artificial intelligence; Computer security; Linguistics","score_opus":0.022124430372046436,"score_gpt":0.21957493481283416,"score_spread":0.1974505044407877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951545071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044901628,0.00007390215,0.9502536,0.003646126,0.00016196008,0.0002896178,0.0000035878727,0.00038051163,0.00028906233],"genre_scores_gemma":[0.71373075,0.00001456641,0.28483415,0.0012007535,0.00005772035,0.00008727217,0.000032715096,0.000006803344,0.000035296154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985086,0.0001333042,0.00052761467,0.00021688026,0.00038004742,0.00023356277],"domain_scores_gemma":[0.9984585,0.000091989605,0.00035407083,0.0006772325,0.00033877828,0.0000794483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008402097,0.00014528612,0.00016000953,0.0002598649,0.00020793866,0.0002195618,0.00065383734,0.00013523277,0.000006970886],"category_scores_gemma":[0.00026616035,0.00014694553,0.00006783884,0.0005400499,0.000051586325,0.0018412989,0.00011638653,0.00015399455,0.00002022219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020010015,0.000087036315,0.0025509682,0.00005409827,0.000014512207,1.1873229e-7,0.001063904,0.052777555,0.008467367,0.85953397,0.00059128134,0.07483915],"study_design_scores_gemma":[0.00019792824,0.000047033136,0.043223213,0.000030497325,0.0000043598898,0.000006942307,0.0000430754,0.9224075,0.02239436,0.008197664,0.0032894893,0.00015789995],"about_ca_topic_score_codex":0.0005119713,"about_ca_topic_score_gemma":0.000049971844,"teacher_disagreement_score":0.86963,"about_ca_system_score_codex":0.00015546037,"about_ca_system_score_gemma":0.00016966292,"threshold_uncertainty_score":0.5992265},"labels":[],"label_agreement":null},{"id":"W2951992158","doi":"10.48550/arxiv.1508.06525","title":"Runtime Enforcement With Partial Control","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Security and Verification in Computing","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 à Chicoutimi","funders":"","keywords":"Computer science; Enforcement; Set (abstract data type); Security policy; Control (management); Field (mathematics); Distributed computing; Computer security; Programming language; Artificial intelligence; Political science","score_opus":0.08277611120474027,"score_gpt":0.1900630448945227,"score_spread":0.10728693368978243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951992158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044332113,0.000036342684,0.9479915,0.00013674465,0.0005504514,0.00029464322,0.000006920593,0.00029298823,0.006358309],"genre_scores_gemma":[0.99694157,0.000012075762,0.0022030396,0.00018171151,0.0001387926,0.0000014407669,0.0000102141,0.000010627854,0.0005005461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836284,0.00011813765,0.00018322306,0.0008749059,0.00014273982,0.00031817006],"domain_scores_gemma":[0.99806,0.00007033535,0.00026652834,0.0011445232,0.00026184382,0.000196767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036260358,0.0002490287,0.00027248793,0.00013387663,0.00015686562,0.00018092639,0.0016291413,0.00017309992,0.000041830128],"category_scores_gemma":[0.00001732343,0.0002595279,0.00009873794,0.0003384509,0.0000910907,0.00027185646,0.00092746294,0.00041211426,0.0001372478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005429073,0.00007835187,0.0012853898,0.000028977938,0.00011436389,0.00011402711,0.00049703603,0.4627025,0.000004010636,0.5340319,0.0007590498,0.00033002856],"study_design_scores_gemma":[0.0010543751,0.0000906383,0.0001249894,0.000055818902,0.00005345567,0.000005338797,0.000051110717,0.97779363,0.00007325534,0.013235262,0.007075532,0.00038661642],"about_ca_topic_score_codex":0.00012959051,"about_ca_topic_score_gemma":0.000008840983,"teacher_disagreement_score":0.9526094,"about_ca_system_score_codex":0.0001987784,"about_ca_system_score_gemma":0.0003806823,"threshold_uncertainty_score":0.9999857},"labels":[],"label_agreement":null},{"id":"W2956989962","doi":"10.1093/oso/9780190908645.001.0001","title":"Cross-Domain Deterrence","year":2019,"lang":"en","type":"book","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":62,"is_retracted":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; Global Affairs Canada","funders":"","keywords":"Deterrence (psychology); Domain (mathematical analysis); Political science; Computer science; Psychology; Criminology; Mathematics; Mathematical analysis","score_opus":0.026040226189842506,"score_gpt":0.2805152282491508,"score_spread":0.2544750020593083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956989962","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.000013302442,0.00010037611,0.435375,0.000079455276,0.0010543552,0.00009608139,0.0000010043323,0.00020329894,0.56307715],"genre_scores_gemma":[0.0005932651,0.0000104533365,0.04768259,0.0007165271,0.0002561565,0.00000453158,0.000010850596,0.00001386325,0.9507118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849623,0.000027136732,0.0002931119,0.00061615923,0.0003266379,0.00024074316],"domain_scores_gemma":[0.9982762,0.0001805352,0.00018212502,0.0011947161,0.00009916842,0.000067291934],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027967565,0.00020280137,0.00021286275,0.000099413555,0.00010738262,0.0004778207,0.0021332705,0.00024153992,0.0002767174],"category_scores_gemma":[0.000016763523,0.00019906618,0.00011358174,0.00009353795,0.00005920419,0.00027727595,0.0005202199,0.00032544602,0.0028193195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.4583036e-7,0.00001073704,0.00005975916,0.000036440702,0.00001224619,0.000006690519,0.00027581575,0.000024373043,0.000006110291,0.9313087,0.054289877,0.013968431],"study_design_scores_gemma":[0.00012039389,0.000028992701,0.00011315731,0.000074629614,0.0000019161391,0.000020554922,0.0000017954807,0.012305233,0.00005235479,0.058768462,0.9281403,0.00037220278],"about_ca_topic_score_codex":0.000003518668,"about_ca_topic_score_gemma":0.0000018619762,"teacher_disagreement_score":0.8738504,"about_ca_system_score_codex":0.00010839861,"about_ca_system_score_gemma":0.00044028196,"threshold_uncertainty_score":0.9979571},"labels":[],"label_agreement":null},{"id":"W2962297646","doi":"10.1007/978-3-030-25540-4_11","title":"Automated Hypersafety Verification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":40,"is_retracted":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; Correctness; Counterexample; Reduction (mathematics); Key (lock); Property (philosophy); Programming language; Set (abstract data type); Product (mathematics); Formal verification; Theoretical computer science; Class (philosophy); Functional verification; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Operating system","score_opus":0.020870248694305135,"score_gpt":0.25515217431887843,"score_spread":0.23428192562457328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962297646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00007623535,0.00028778604,0.98497146,0.0009842984,0.00316939,0.00041076538,0.0000037653415,0.0009776755,0.009118633],"genre_scores_gemma":[0.40154886,0.000087770146,0.59416926,0.0025223466,0.00073776394,0.000010324421,0.000026097694,0.00006821845,0.00082936377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960549,0.000045665325,0.000616637,0.0017337314,0.00095949124,0.00058960734],"domain_scores_gemma":[0.99649996,0.00048208845,0.00040576834,0.002148655,0.00032097186,0.0001425344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010239626,0.00047081884,0.00046545002,0.0007467853,0.00030227323,0.00059418584,0.0039249766,0.00040099854,0.00003138935],"category_scores_gemma":[0.000100361765,0.00047849363,0.00013407141,0.00078959524,0.0004076652,0.0006951223,0.0009544639,0.0007720168,0.00042496467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008006532,0.000055112785,0.00007667283,0.00009106864,0.000021511996,0.000031804946,0.0015917135,0.0677839,0.0004965915,0.24617213,0.00015392272,0.6835176],"study_design_scores_gemma":[0.00020602615,0.00006991073,0.0003489684,0.00022029603,0.000005094853,0.00004713226,1.6635113e-7,0.9640194,0.0008099612,0.027994798,0.0056947544,0.00058347324],"about_ca_topic_score_codex":0.0000151113,"about_ca_topic_score_gemma":0.000008078745,"teacher_disagreement_score":0.8962355,"about_ca_system_score_codex":0.00043548143,"about_ca_system_score_gemma":0.00092630606,"threshold_uncertainty_score":0.99976665},"labels":[],"label_agreement":null},{"id":"W2968172377","doi":"10.1145/3343737.3343739","title":"Using Inputs and Context to Verify User Intentions in Internet Services","year":2019,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"","keywords":"Hypervisor; Computer science; Context (archaeology); Malware; Computer security; The Internet; Service (business); World Wide Web; Server; Operating system; Virtualization; Cloud computing","score_opus":0.03325638221385967,"score_gpt":0.28573795413434655,"score_spread":0.25248157192048687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968172377","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.7257665,0.000027630365,0.27170593,0.0005170441,0.00027125463,0.00010157601,1.8551802e-7,0.00004701105,0.0015628593],"genre_scores_gemma":[0.9718054,0.0000016940802,0.026347078,0.0016460972,0.000012194217,0.0000020161276,3.9293582e-7,0.0000028968238,0.00018221556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936044,0.000026923186,0.0001490524,0.0002444904,0.00009730401,0.00012181618],"domain_scores_gemma":[0.99960834,0.00004053803,0.00003056025,0.00022597398,0.000046008638,0.000048561942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015468303,0.00006162632,0.0000831488,0.00011575848,0.000025026853,0.0001672065,0.00035297303,0.000033600812,0.00003472821],"category_scores_gemma":[0.000007417243,0.000060401504,0.000014701617,0.00025899798,0.000009064911,0.00035375266,0.0003327412,0.000074481504,0.0000941248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016349033,0.00013835735,0.19147965,0.00013183412,0.000026097567,0.0000063391626,0.018656358,0.0006512399,0.010923771,0.7419652,0.00035812386,0.035646666],"study_design_scores_gemma":[0.0004984332,0.00006497928,0.043804444,0.00022023209,0.000002132323,0.000019864847,0.00079755357,0.9321487,0.0037485536,0.00096048065,0.017454583,0.0002800441],"about_ca_topic_score_codex":0.0004127677,"about_ca_topic_score_gemma":0.00022182953,"teacher_disagreement_score":0.93149745,"about_ca_system_score_codex":0.000025093475,"about_ca_system_score_gemma":0.000015909434,"threshold_uncertainty_score":0.24631019},"labels":[],"label_agreement":null},{"id":"W2970909215","doi":"","title":"MIN()imum Failure: EMFI Attacks against USB Stacks.","year":2019,"lang":"en","type":"article","venue":"USENIX Security Symposium","topic":"Security and Verification in Computing","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":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; USB; Operating system; Embedded system; Computer security; Software","score_opus":0.0068395370419115425,"score_gpt":0.22122141988764804,"score_spread":0.2143818828457365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970909215","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.89475137,0.00037992504,0.04924159,0.016003598,0.007108265,0.0013297213,0.00003972615,0.0017861935,0.029359635],"genre_scores_gemma":[0.9902601,0.00004920321,0.0068452354,0.0015554941,0.0004046401,0.000019339293,0.000031507752,0.000037477887,0.00079697435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99650073,0.00020883468,0.00062091567,0.0011346875,0.0007323817,0.00080244156],"domain_scores_gemma":[0.9970215,0.00025297643,0.0002877722,0.0018885726,0.00025796436,0.00029123557],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005946879,0.00040813882,0.00042544032,0.00023157243,0.00031017454,0.0006467472,0.002144281,0.00028071244,0.00011350519],"category_scores_gemma":[0.000051631145,0.0004368325,0.00023858414,0.00081877253,0.00008933039,0.0011091917,0.0007213721,0.00056950405,0.001833169],"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.000112992995,0.002283139,0.029850263,0.0009838546,0.00045867817,0.00028296033,0.092617735,0.002546665,0.059618548,0.6529221,0.14841613,0.009906913],"study_design_scores_gemma":[0.002030555,0.0003255277,0.00092358975,0.0001817694,0.000029865441,0.000099478,0.00042210857,0.22549787,0.017866166,0.0075414623,0.743254,0.0018275795],"about_ca_topic_score_codex":0.00005572497,"about_ca_topic_score_gemma":0.00003279977,"teacher_disagreement_score":0.6453807,"about_ca_system_score_codex":0.000146976,"about_ca_system_score_gemma":0.00017911328,"threshold_uncertainty_score":0.9998084},"labels":[],"label_agreement":null},{"id":"W2972497427","doi":"10.2478/popets-2020-0002","title":"Computation on Encrypted Data using Dataflow Authentication","year":2020,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Security and Verification in Computing","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; Dataflow; Encryption; Homomorphic encryption; Cryptography; Computer security; Cloud computing; Operating system","score_opus":0.15019177083410817,"score_gpt":0.3276208922622208,"score_spread":0.17742912142811262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972497427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22567368,0.000043291027,0.75843734,0.010876912,0.00019739654,0.0003035574,0.0000056962117,0.004205298,0.00025682838],"genre_scores_gemma":[0.8034985,0.000016297641,0.19590472,0.00047969274,0.000058998066,0.000008223135,0.000017857803,0.00001394841,0.0000017570817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978075,0.000013496391,0.0004003199,0.0010388312,0.0004228677,0.0003169939],"domain_scores_gemma":[0.9984735,0.00015044244,0.00032580757,0.00082446815,0.00016896038,0.00005678686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041517502,0.00022312385,0.00020818021,0.00022862466,0.00031883302,0.00041714194,0.0038194156,0.0001459537,0.0000023259524],"category_scores_gemma":[0.0024225092,0.00022372257,0.000031014115,0.0010997531,0.000074389616,0.0011284542,0.0019354667,0.00039942216,0.00007859163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007825466,0.0003812849,0.0007176491,0.0003901723,0.000090842856,0.000008000688,0.0083337035,0.001167684,0.26053795,0.4612384,0.005972592,0.26108342],"study_design_scores_gemma":[0.0001944584,0.00015013415,0.000148155,0.00013379462,0.000009283475,0.000005508687,0.00043507785,0.84998274,0.13833052,0.009029743,0.0013146459,0.0002659673],"about_ca_topic_score_codex":0.000003622353,"about_ca_topic_score_gemma":1.0715431e-7,"teacher_disagreement_score":0.848815,"about_ca_system_score_codex":0.00008905585,"about_ca_system_score_gemma":0.000055152053,"threshold_uncertainty_score":0.9123142},"labels":[],"label_agreement":null},{"id":"W2984656466","doi":"10.1109/issre.2019.00052","title":"MPro: Combining Static and Symbolic Analysis for Scalable Testing of Smart Contract","year":2019,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Waterloo","funders":"","keywords":"Executable; Scalability; Symbolic execution; Dependency (UML); Symbolic data analysis; Vulnerability (computing); Smart contract; Scale (ratio); Smart grid","score_opus":0.03448189769276498,"score_gpt":0.2702764084565434,"score_spread":0.2357945107637784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984656466","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.501701,0.00003746489,0.49678266,0.000090408575,0.000063781794,0.00014515659,0.0000010063391,0.000049640967,0.0011288918],"genre_scores_gemma":[0.8849907,0.000001482008,0.11479581,0.00012244245,0.0000067202764,0.000005132283,0.0000011441514,0.0000028122035,0.000073740775],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.000025887135,0.00023760942,0.00023147311,0.00010735403,0.00015062561],"domain_scores_gemma":[0.9984217,0.0010008662,0.00013345711,0.00026560613,0.00013781543,0.00004055028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046752425,0.00006417445,0.00020452047,0.00012041856,0.0000722694,0.00008970894,0.00024063185,0.00002608735,0.0000140466345],"category_scores_gemma":[0.00013373028,0.000060399252,0.00004406116,0.0006436602,0.000020084402,0.0001966636,0.0000732586,0.00004486096,0.000004728016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012164038,0.00012956231,0.67761993,0.00030565678,0.00036629956,5.6461613e-7,0.002188228,0.0038283032,0.0044376794,0.28350648,0.00010338308,0.02750174],"study_design_scores_gemma":[0.00029960764,0.00008126141,0.026417306,0.000021049596,0.000032540087,0.0000014456707,0.000063756546,0.969636,0.0019407418,0.0013299445,0.00009320022,0.00008311601],"about_ca_topic_score_codex":0.00010507468,"about_ca_topic_score_gemma":0.0000044401495,"teacher_disagreement_score":0.96580774,"about_ca_system_score_codex":0.000007957337,"about_ca_system_score_gemma":0.000032649958,"threshold_uncertainty_score":0.24630101},"labels":[],"label_agreement":null},{"id":"W2989044540","doi":"10.1145/3342559.3365335","title":"Toward scaling hardware security module for emerging cloud services","year":2019,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Scalability; Computer science; Microservices; Cloud computing; Key management; Computer security; Cryptography; Cloud computing security; Hardware security module; Workload; Software deployment; Cryptographic primitive; Key (lock); Security service; Distributed computing; Computer network; Cryptographic protocol; Operating system; Information security","score_opus":0.024202340239375723,"score_gpt":0.2685783752501091,"score_spread":0.24437603501073335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989044540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16774169,0.00011676701,0.8242278,0.0013375035,0.0017526068,0.00031235145,0.0000031557545,0.00042582085,0.0040823217],"genre_scores_gemma":[0.9448281,0.000004757688,0.05403874,0.0006543177,0.00024277807,0.0000126913965,0.000006063288,0.0000086386735,0.00020392651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881345,0.000028522163,0.000229401,0.0004480542,0.00019661838,0.0002839332],"domain_scores_gemma":[0.99908537,0.0001159779,0.00008897922,0.0005041138,0.00013612115,0.00006945663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003720192,0.00011788963,0.00014663814,0.000062283514,0.00016429959,0.00024348656,0.00093690964,0.00006242491,0.000059270005],"category_scores_gemma":[0.000012397547,0.00011567502,0.00009111939,0.00023535024,0.000009600835,0.00049432967,0.00026070775,0.00009655856,0.0001394011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013697192,0.00009985462,0.0049108127,0.0007105436,0.00004494674,0.0000017004892,0.011699275,0.002819904,0.0005318393,0.958427,0.0015881164,0.01915227],"study_design_scores_gemma":[0.00030295615,0.000025305066,0.0003156924,0.000043154163,0.0000030871988,0.0000043777013,0.0004908298,0.9509486,0.0037178772,0.015910827,0.028022267,0.00021503436],"about_ca_topic_score_codex":0.000052329862,"about_ca_topic_score_gemma":0.00000384866,"teacher_disagreement_score":0.9481287,"about_ca_system_score_codex":0.000026769041,"about_ca_system_score_gemma":0.000028859336,"threshold_uncertainty_score":0.47170907},"labels":[],"label_agreement":null},{"id":"W2990403016","doi":"10.1145/3385412.3385982","title":"Securing smart contract with runtime validation","year":2020,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":59,"is_retracted":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":"Overhead (engineering); Source code; Compiler; Solidity; Benchmark (surveying); Protocol (science); Code (set theory); Spec#","score_opus":0.0259987955944887,"score_gpt":0.227119602889423,"score_spread":0.2011208072949343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990403016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050279394,0.000015870328,0.9356786,0.0045785196,0.00007747682,0.000081428734,2.1416902e-7,0.00034807104,0.008940398],"genre_scores_gemma":[0.9571461,0.000001590419,0.041022915,0.0017204714,0.00007434795,0.0000025974919,0.0000014736257,0.000003642363,0.00002685799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935573,0.000024502244,0.00011622852,0.0002327783,0.0001527058,0.00011805447],"domain_scores_gemma":[0.9995809,0.00005669206,0.00005146731,0.00018397627,0.000051886283,0.00007507376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105408115,0.00006417493,0.000070189715,0.000020194191,0.00009361072,0.00017907903,0.0003539279,0.0000215346,0.000059580165],"category_scores_gemma":[0.00002181408,0.00005402994,0.000018987894,0.0002457152,0.000011724773,0.0004017219,0.000070125294,0.000076755576,0.0001313042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032960677,0.00011045894,0.011587388,0.00007128979,0.000064543456,0.00002750766,0.011143289,0.002350559,0.0042249653,0.93622667,0.0026699693,0.031490423],"study_design_scores_gemma":[0.0006411766,0.00015380696,0.005032027,0.000024989595,0.0000064893584,0.000020275078,0.00007570184,0.92949414,0.046785545,0.0008561212,0.016590072,0.0003196524],"about_ca_topic_score_codex":0.000014873048,"about_ca_topic_score_gemma":9.312149e-7,"teacher_disagreement_score":0.9353705,"about_ca_system_score_codex":0.000009481976,"about_ca_system_score_gemma":0.000029531699,"threshold_uncertainty_score":0.2203277},"labels":[],"label_agreement":null},{"id":"W2995005108","doi":"10.1109/iemcon.2019.8936228","title":"Inherited Vulnerabilities: Javascript Engine V4 secure coding compared to Googles V8","year":2019,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Surrey Memorial Hospital; British Columbia Institute of Technology; Kwantlen Polytechnic University","funders":"","keywords":"JavaScript; Interpreter; Computer science; Secure coding; Coding (social sciences); Computer security; World Wide Web; Programming language; Information security; Software security assurance","score_opus":0.020393314004066347,"score_gpt":0.24872381835697654,"score_spread":0.2283305043529102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995005108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34548303,0.00007830245,0.6390818,0.001982426,0.0013334365,0.00037357496,0.0000034776415,0.0006998422,0.010964109],"genre_scores_gemma":[0.93284535,0.0000031647992,0.06398004,0.0016904189,0.00011170298,0.000013301452,0.000005723831,0.000011027838,0.0013392578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841607,0.000085640546,0.0003344671,0.00052404933,0.00029278293,0.00034698413],"domain_scores_gemma":[0.9985851,0.00025122485,0.00006519157,0.00079658633,0.00015093552,0.0001509675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040137232,0.00017136446,0.00023421632,0.00014479579,0.00014967826,0.00029394685,0.0010042824,0.00006922204,0.00031187737],"category_scores_gemma":[0.00008200704,0.00016722232,0.00006840059,0.00064726354,0.000022599059,0.0003962396,0.0003140505,0.00018354648,0.0006168415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030355,0.00029998072,0.008180217,0.0002542985,0.000092299684,0.000008927334,0.03320137,0.012987242,0.014872865,0.86796993,0.045586094,0.016516423],"study_design_scores_gemma":[0.000740539,0.00013044303,0.0040760078,0.000118818876,0.0000048089155,0.000021075031,0.0016288667,0.8289718,0.0067650545,0.0022082028,0.15465175,0.00068263593],"about_ca_topic_score_codex":0.00009724099,"about_ca_topic_score_gemma":0.000013286086,"teacher_disagreement_score":0.8657617,"about_ca_system_score_codex":0.00007175256,"about_ca_system_score_gemma":0.000050610055,"threshold_uncertainty_score":0.79284555},"labels":[],"label_agreement":null},{"id":"W2995623611","doi":"10.1145/3371081","title":"Reductions for safety proofs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Correctness; Computer science; Programming language; Class (philosophy); Context (archaeology); Soundness; Commutative property; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.015745069634750638,"score_gpt":0.2756575389875628,"score_spread":0.25991246935281215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995623611","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.93692315,0.00051605894,0.011624966,0.031150091,0.0021932994,0.0042585214,0.000009834858,0.0010879791,0.012236083],"genre_scores_gemma":[0.8338829,0.0000029234832,0.16516574,0.00014337484,0.00010814889,0.000063768355,8.365601e-7,0.000010375153,0.0006219343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991101,0.0000049795085,0.00019746031,0.00028604167,0.00019947885,0.00020193984],"domain_scores_gemma":[0.9988986,0.00012022764,0.0002092102,0.00054758263,0.00019487322,0.00002948506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041194883,0.00009438387,0.000117730124,0.000060343595,0.00016965631,0.00012181158,0.0023003416,0.000047301666,0.0000026714335],"category_scores_gemma":[0.0007902417,0.000069273614,0.00010270055,0.00036265468,0.00004084179,0.00021520781,0.00048540457,0.00011620467,0.0000065730187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049497336,0.00024181514,0.004547678,0.00043374195,0.000060773447,1.0870604e-7,0.0058196094,0.00004007748,0.015512869,0.6712234,0.0038989028,0.29817152],"study_design_scores_gemma":[0.002468249,0.0013572555,0.011299426,0.001160348,0.00008440717,0.00008079493,0.007074194,0.00969699,0.5680558,0.08350742,0.31395355,0.0012615285],"about_ca_topic_score_codex":0.0000050351246,"about_ca_topic_score_gemma":3.0022963e-7,"teacher_disagreement_score":0.587716,"about_ca_system_score_codex":0.000027445585,"about_ca_system_score_gemma":0.00002367404,"threshold_uncertainty_score":0.42746454},"labels":[],"label_agreement":null},{"id":"W2999961398","doi":"10.1145/2007477.1952702","title":"Patch auditing in infrastructure as a service clouds","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Computer science; Cloud computing; Hypervisor; Virtualization; Operating system; Overhead (engineering); Leverage (statistics); Software; Binary translation; Audit; Distributed computing; Computer security","score_opus":0.04106271506474883,"score_gpt":0.26092756814074175,"score_spread":0.2198648530759929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999961398","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.9803231,0.00006010671,0.008569394,0.00096846285,0.0005970206,0.000111842695,0.00000182304,0.0002117756,0.009156504],"genre_scores_gemma":[0.94903237,0.0000039276874,0.049231127,0.001584716,0.00011898773,0.000005528413,0.0000030602862,0.000006868434,0.000013398408],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99885106,0.00007110134,0.00025359172,0.0003547747,0.00019273645,0.00027674905],"domain_scores_gemma":[0.9986952,0.00028568174,0.00016046446,0.0007166039,0.000072179304,0.00006986668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550148,0.00012748723,0.0001322561,0.00009264355,0.000115929346,0.000114786584,0.0018151868,0.00008921886,0.00009832242],"category_scores_gemma":[0.00025997267,0.00012607327,0.000025703053,0.0005817976,0.000020671243,0.00047364912,0.00046624543,0.00022908032,0.00017075721],"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.00007519846,0.00033515354,0.35225445,0.00037785035,0.0000827123,0.00028852187,0.20861515,0.0015852038,0.0012752317,0.29387084,0.0025227426,0.13871692],"study_design_scores_gemma":[0.0014127207,0.00023256717,0.62045395,0.00036016505,0.000023431367,0.00012450264,0.0034907958,0.21579498,0.009507809,0.13536856,0.011896487,0.0013340167],"about_ca_topic_score_codex":0.0010591607,"about_ca_topic_score_gemma":0.00023736729,"teacher_disagreement_score":0.26819953,"about_ca_system_score_codex":0.000025745117,"about_ca_system_score_gemma":0.00006281793,"threshold_uncertainty_score":0.5141119},"labels":[],"label_agreement":null},{"id":"W3003638206","doi":"10.1145/2858965.2814272","title":"Static analysis of event-driven Node.js JavaScript applications","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Computer science; JavaScript; Event (particle physics); Asynchronous communication; Callback; Suite; Node (physics); Programming language; False positive paradox; Operating system; Computer network; Artificial intelligence","score_opus":0.06467412276819863,"score_gpt":0.3154442103194611,"score_spread":0.2507700875512625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003638206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04107443,0.00018874592,0.95563626,0.001146225,0.00021798047,0.00018812391,0.00001970367,0.000141383,0.001387155],"genre_scores_gemma":[0.93448746,0.0000051110505,0.065076746,0.00029330657,0.00004465982,0.000020590543,0.00002914519,0.000004602815,0.00003834837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987579,0.00008371214,0.00034053338,0.0003109075,0.0003328243,0.00017413442],"domain_scores_gemma":[0.99791193,0.00039048606,0.00026604134,0.0011095646,0.00020455086,0.00011742336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035966843,0.000099989484,0.00022376473,0.00026875496,0.00008435727,0.00009510845,0.0015891534,0.00004422149,0.000015382646],"category_scores_gemma":[0.00019826912,0.00009830991,0.00008557984,0.0014308052,0.00004872773,0.0003131249,0.00025804352,0.000081423954,0.00006235818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046018806,0.00142263,0.13335803,0.00028589097,0.0038713526,0.000019997851,0.05043469,0.33147854,0.0021781316,0.3756104,0.016647946,0.08464635],"study_design_scores_gemma":[0.00032644966,0.00006425692,0.014258908,0.000018727875,0.0003858276,0.0000019858765,0.0005494297,0.9634152,0.0010714823,0.0038854983,0.015748693,0.00027353497],"about_ca_topic_score_codex":0.0001258889,"about_ca_topic_score_gemma":0.000039607094,"teacher_disagreement_score":0.89341307,"about_ca_system_score_codex":0.000029446253,"about_ca_system_score_gemma":0.00008455559,"threshold_uncertainty_score":0.40089616},"labels":[],"label_agreement":null},{"id":"W3004332927","doi":"10.1109/cjece.2019.2949934","title":"On-Chip CMOS Self-Decoupling Battery Cell System for Security Protection","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"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 Guelph","funders":"University of Guelph","keywords":"CMOS; Decoupling (probability); Chip; Notation; Electrical engineering; Battery (electricity); Computer science; Mathematics; Topology (electrical circuits); Power (physics); Arithmetic; Engineering; Physics; Quantum mechanics","score_opus":0.01141399058122998,"score_gpt":0.17250174284069364,"score_spread":0.16108775225946365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004332927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064193636,0.0002243498,0.9341917,0.00066391757,0.0004994815,0.00013838055,9.478297e-7,0.00006985234,0.00001773111],"genre_scores_gemma":[0.9806154,0.0000025642187,0.018417358,0.00033757486,0.00061258476,0.000004047373,2.8774124e-7,0.000009575063,6.085214e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991024,0.000019238974,0.00029374936,0.00019933684,0.00011164955,0.00027360546],"domain_scores_gemma":[0.99899393,0.00017663806,0.0001129995,0.000094714786,0.000107838365,0.0005138654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019218892,0.00012332028,0.00018856257,0.00017237493,0.00014216856,0.00020431011,0.00035041966,0.00006222511,7.6134035e-7],"category_scores_gemma":[0.000042156822,0.00012290265,0.00007756707,0.00031723818,0.0000056169306,0.00016667285,0.000019910894,0.0003105868,0.0000018502863],"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.0001406447,0.00025600116,0.0013007816,0.0035452822,0.00053273956,0.0006448918,0.017997397,0.53454363,0.0029573473,0.3033669,0.008029603,0.1266848],"study_design_scores_gemma":[0.0002883412,0.0003526024,0.00013857444,0.000057672598,0.0000070921915,0.00010851924,0.00000492723,0.9960062,0.00094797194,0.00015172789,0.0017990244,0.00013734943],"about_ca_topic_score_codex":0.000025286572,"about_ca_topic_score_gemma":0.0000029721639,"teacher_disagreement_score":0.9164218,"about_ca_system_score_codex":0.00011202451,"about_ca_system_score_gemma":0.00018734275,"threshold_uncertainty_score":0.5011825},"labels":[],"label_agreement":null},{"id":"W3004436970","doi":"10.1145/1357010.1352603","title":"Application-level isolation and recovery with solitude","year":2008,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Security and Verification in Computing","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":"Computer science; Isolation (microbiology); Solitude; Process (computing); Intrusion detection system; Computer security; Overhead (engineering); File system; Operating system; Embedded system","score_opus":0.05075274199746783,"score_gpt":0.2748786609693119,"score_spread":0.22412591897184408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004436970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004888666,0.05511667,0.9368496,0.0011331184,0.00018771179,0.0009240798,0.000002232823,0.00019924274,0.00069871254],"genre_scores_gemma":[0.84087855,0.014486981,0.14215389,0.0016690146,0.00023541292,0.00029310238,0.000015888132,0.000023119848,0.00024404346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848866,0.00016378723,0.0004699564,0.00045211441,0.00024414583,0.00018134042],"domain_scores_gemma":[0.99830014,0.000250898,0.0002313826,0.0009432079,0.00020095878,0.00007339113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066536776,0.00015419343,0.00030237518,0.000041065934,0.00046227835,0.00017157196,0.00063990627,0.00004786656,0.000002374426],"category_scores_gemma":[0.0002822008,0.00012584416,0.000031327647,0.0003790379,0.000036214933,0.00052243663,0.00016716366,0.00012484592,0.000039511844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026494183,0.00069461035,0.0855336,0.036670964,0.0006539794,0.00012595742,0.015950516,0.011537257,0.0069611096,0.34596384,0.049146973,0.4467347],"study_design_scores_gemma":[0.0018517912,0.00068903225,0.027680442,0.027357839,0.00012885284,0.006095851,0.00025827854,0.8056238,0.0004914834,0.0007205824,0.12608941,0.0030125952],"about_ca_topic_score_codex":0.000094739626,"about_ca_topic_score_gemma":0.0000025510537,"teacher_disagreement_score":0.8359899,"about_ca_system_score_codex":0.000036587466,"about_ca_system_score_gemma":0.000095436684,"threshold_uncertainty_score":0.5131776},"labels":[],"label_agreement":null},{"id":"W3004569951","doi":"10.4018/978-1-7998-2253-0.ch013","title":"Cyber Security Aspects of Virtualization in Cloud Computing Environments","year":2020,"lang":"en","type":"book-chapter","venue":"Advances in information security, privacy, and ethics book series","topic":"Security and Verification in Computing","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 Windsor","funders":"","keywords":"Virtualization; Computer security; Cloud computing; Computer science; Cybercrime; Virtual machine; Cloud computing security; The Internet; World Wide Web; Operating system","score_opus":0.021831600725091316,"score_gpt":0.27210484598738843,"score_spread":0.2502732452622971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004569951","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.0007971665,0.01767867,0.2984965,0.0058585126,0.0031541898,0.0021209668,0.00011584839,0.00044246487,0.67133564],"genre_scores_gemma":[0.9264628,0.061145782,0.006370929,0.0043864124,0.00038727222,0.000026070004,0.0003551987,0.000067346016,0.0007981506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968999,0.00012840639,0.0014394653,0.0004788535,0.00075843476,0.00029493967],"domain_scores_gemma":[0.9976293,0.0004984565,0.0010681525,0.00055759324,0.00014053266,0.00010597988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010056687,0.00041778525,0.0005923674,0.0004073349,0.00020915536,0.00019355632,0.0008795911,0.0006143603,0.000020988582],"category_scores_gemma":[0.00036679208,0.00049345306,0.00008286895,0.00021533444,0.00037438967,0.0071369475,0.0010202226,0.0015361395,0.000023765231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021242442,0.000019485915,0.00011056535,0.0005686438,0.000011529574,0.0000038987123,0.051009983,0.00057723507,0.0000017154938,0.94551915,0.00004735641,0.0021091653],"study_design_scores_gemma":[0.00055945833,0.00010813982,0.00012386005,0.00071812025,0.000009335413,0.000017901377,0.00047903214,0.017966755,0.00023906027,0.5271247,0.45209476,0.0005588734],"about_ca_topic_score_codex":0.000018886314,"about_ca_topic_score_gemma":0.00006406343,"teacher_disagreement_score":0.9256657,"about_ca_system_score_codex":0.0001422889,"about_ca_system_score_gemma":0.00019562131,"threshold_uncertainty_score":0.9997517},"labels":[],"label_agreement":null},{"id":"W3005298591","doi":"10.1145/2817817.2731196","title":"Exploring VM Introspection","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Computer science; Consistency (knowledge bases); Consistency model; Introspection; Set (abstract data type); Variety (cybernetics); Overhead (engineering); Cache coherence; Context (archaeology); Distributed computing; Artificial intelligence; Cache; Operating system; CPU cache; Data consistency; Programming language","score_opus":0.34020168751679947,"score_gpt":0.3039877899886589,"score_spread":0.03621389752814058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005298591","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.6678224,0.00022328258,0.31404752,0.003952689,0.0045774938,0.00013892353,0.0000010546604,0.0009286194,0.008307995],"genre_scores_gemma":[0.96137905,0.0000073086135,0.03799093,0.00019797019,0.00037600182,0.0000089123705,0.0000017855966,0.000004460568,0.000033596465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991951,0.000039633273,0.00014268789,0.0002444178,0.00021453478,0.00016360258],"domain_scores_gemma":[0.9990087,0.00016057359,0.00007674609,0.00057959417,0.00007760901,0.00009676447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000329577,0.00007542503,0.000079443795,0.000070774826,0.00010925117,0.00021445808,0.0009383919,0.000025940093,0.0000059838426],"category_scores_gemma":[0.00036995494,0.000074531315,0.00002172986,0.00027455564,0.000018298819,0.0010971286,0.00025531012,0.00009943867,0.00022526977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004103818,0.0002658517,0.025036575,0.000071418806,0.00007339346,0.00005355849,0.04167055,0.0067020734,0.0012970066,0.69098616,0.0126226535,0.22117971],"study_design_scores_gemma":[0.0027518636,0.0007903054,0.07529084,0.00018699918,0.00004680172,0.00014177787,0.004562058,0.5352979,0.03643082,0.09384818,0.2486,0.002052499],"about_ca_topic_score_codex":0.00006298092,"about_ca_topic_score_gemma":0.000008484879,"teacher_disagreement_score":0.597138,"about_ca_system_score_codex":0.000040527993,"about_ca_system_score_gemma":0.000032987897,"threshold_uncertainty_score":0.3039299},"labels":[],"label_agreement":null},{"id":"W3008874958","doi":"10.1109/mm.2020.2974217","title":"The AMD “Zen 2” Processor","year":2020,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Security and Verification in Computing","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Scalability; Cache; Multi-core processor; Modular design; Operating system; Embedded system; Flexibility (engineering); CPU cache; Microarchitecture; Efficient energy use; Computer architecture; Floating-point unit; Mobile processor; Workstation; Parallel computing; Mobile device; Computer hardware; Floating point; Mobile Web; Mobile technology","score_opus":0.03420267875181875,"score_gpt":0.2520401742089486,"score_spread":0.21783749545712983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008874958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061803944,0.0007888118,0.87225986,0.0592506,0.0013767414,0.00022808275,0.0000017174758,0.00050894,0.0037813233],"genre_scores_gemma":[0.98370075,0.000019908306,0.010751869,0.004959471,0.00037288963,0.000007706653,3.9053697e-7,0.0000060509733,0.00018094826],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999417,0.000026330925,0.0001152923,0.00019548333,0.00010148643,0.00014437725],"domain_scores_gemma":[0.99951506,0.00009506905,0.000049947812,0.0002368949,0.00004938158,0.000053656433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012488104,0.00005529548,0.000049991067,0.000008427593,0.00026184952,0.00022645794,0.0009788342,0.000022807966,0.0000035582095],"category_scores_gemma":[0.000041921598,0.000041027717,0.000028831455,0.00023595897,0.00003062097,0.00011528425,0.00008267976,0.00009790905,0.00023062377],"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.000034750574,0.00012397859,0.00089103566,0.00013710713,0.00007871833,0.000029415261,0.03666783,0.00041584522,0.22838657,0.12797923,0.3346977,0.27055782],"study_design_scores_gemma":[0.00024133123,0.000047655918,0.00040796335,0.00001303426,0.000003231758,0.000013904906,0.00009900123,0.073980205,0.1991938,0.002423271,0.723358,0.00021863519],"about_ca_topic_score_codex":0.000003279589,"about_ca_topic_score_gemma":8.5525744e-7,"teacher_disagreement_score":0.9218968,"about_ca_system_score_codex":0.000009073963,"about_ca_system_score_gemma":0.000041801835,"threshold_uncertainty_score":0.2964279},"labels":[],"label_agreement":null},{"id":"W3012412103","doi":"10.1145/3378424","title":"Asia's surging interest in binary analysis","year":2020,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Security and Verification in Computing","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":"","keywords":"Citation; Computer science; Library science; World Wide Web; Advertising; Operations research; Business; Engineering","score_opus":0.17676829199498215,"score_gpt":0.327558180639628,"score_spread":0.15078988864464585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012412103","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29921374,0.0014356845,0.039313886,0.6553229,0.00016872498,0.00025966467,0.00000441337,0.00017230088,0.0041086827],"genre_scores_gemma":[0.9195467,0.00004321854,0.080068,0.00032262018,0.0000067683322,0.000004266959,0.0000020398502,0.000002168348,0.000004205074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992679,0.00020865192,0.00024166229,0.00013468106,0.00006868908,0.00007843984],"domain_scores_gemma":[0.98305404,0.00039061462,0.00013603995,0.016339518,0.000052108535,0.000027673992],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00029340544,0.00004893236,0.000115637384,0.00010969091,0.00012576548,0.000038442868,0.034171484,0.0000230281,0.000004286574],"category_scores_gemma":[0.002538841,0.00004251694,0.000098854754,0.0022338016,0.000081794526,0.0001422939,0.021681326,0.00017382343,0.000007943226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011798633,0.0005091381,0.17359935,0.000061552644,0.0004204199,0.0000017273607,0.023987202,0.010187718,0.0038757732,0.75942975,0.010521329,0.01739424],"study_design_scores_gemma":[0.00023581318,0.000021067368,0.13310546,0.000058938724,0.000056679095,0.0000017129025,0.00054328085,0.8238989,0.001941392,0.03221573,0.007741205,0.00017982762],"about_ca_topic_score_codex":0.000041164552,"about_ca_topic_score_gemma":0.000042435204,"teacher_disagreement_score":0.81371117,"about_ca_system_score_codex":0.000018447956,"about_ca_system_score_gemma":0.00003165464,"threshold_uncertainty_score":0.98623115},"labels":[],"label_agreement":null},{"id":"W3027389364","doi":"10.17760/d20328773","title":"Defending in-process memory abuse with mitigation and testing","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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; Attack surface; Computer security; Address space; Memory errors; Memory safety; Context (archaeology); Memory protection; Process (computing); Software; Memory management; Programming language; Operating system; Flat memory model; Psychology","score_opus":0.018401595386163802,"score_gpt":0.26763741396950197,"score_spread":0.24923581858333815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027389364","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.96287805,0.00013452787,0.021213673,0.000025990903,0.000369503,0.00022620134,3.389929e-7,0.00015095479,0.015000776],"genre_scores_gemma":[0.9715855,0.000008273356,0.027670067,0.00006876491,0.000039210958,0.000014883373,0.000033365886,0.000014047085,0.0005658857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988714,0.000027986456,0.00023252094,0.000472726,0.00022256114,0.00017282562],"domain_scores_gemma":[0.9991194,0.00023139121,0.00020328493,0.00026162146,0.00014455113,0.000039748575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020508053,0.00015991759,0.0001675464,0.00021924595,0.00010397778,0.00022106797,0.0003596033,0.0001188041,0.0000044141793],"category_scores_gemma":[0.00005764849,0.00014940616,0.000014400129,0.00052305777,0.000012238306,0.0004429103,0.000018808272,0.00023513111,0.000011270708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013322299,0.00033057653,0.08229886,0.0065493365,0.00014551418,0.00009779826,0.25628254,0.00871275,0.003929606,0.13251264,0.00016050618,0.50884664],"study_design_scores_gemma":[0.0017853915,0.00021184757,0.087367035,0.0039272457,0.000043306623,0.000110953704,0.018948717,0.86013114,0.019262034,0.00609626,0.00011701896,0.001999035],"about_ca_topic_score_codex":0.00004514156,"about_ca_topic_score_gemma":0.000077304634,"teacher_disagreement_score":0.8514184,"about_ca_system_score_codex":0.000032987005,"about_ca_system_score_gemma":0.00011560031,"threshold_uncertainty_score":0.6092606},"labels":[],"label_agreement":null},{"id":"W3028966272","doi":"","title":"Salus: A System for Server-Aided Secure Function Evaluation.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","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":"","keywords":"Computer science; Server; Implementation; Set (abstract data type); Function (biology); Cloud computing; Representation (politics); Work (physics); Focus (optics); Distributed computing; Operating system; Software engineering; Programming language","score_opus":0.052561129804363366,"score_gpt":0.30472040432627984,"score_spread":0.25215927452191644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028966272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016124748,0.00062559725,0.97007513,0.001002555,0.0076120477,0.0020761495,0.000044159326,0.0006430576,0.0017965577],"genre_scores_gemma":[0.56895334,0.000012266489,0.42864278,0.00021700382,0.000860978,0.0010833502,0.00019602005,0.00003243733,0.0000018161495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957483,0.0008886601,0.00081175065,0.0013237922,0.0005474728,0.00068002153],"domain_scores_gemma":[0.9957123,0.0008771957,0.0007952811,0.0018194983,0.0005938988,0.0002018583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023670536,0.0004687889,0.0006230076,0.00032237472,0.00041828668,0.00021258139,0.0018198014,0.00053403765,0.00004093385],"category_scores_gemma":[0.00029985845,0.00050123397,0.00038768063,0.00020951638,0.00013251664,0.00025343808,0.0022163934,0.0009451629,0.00020995761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050957082,0.00008845448,0.0004803452,0.00048867275,0.00019916917,0.0000019901252,0.0038609246,0.0036627317,0.00013279235,0.980966,0.00085162866,0.009216352],"study_design_scores_gemma":[0.00076369185,0.00006641769,0.0041314755,0.00023867695,0.00016942556,0.00005741177,0.0002767448,0.3362223,0.00037484165,0.6536074,0.0035543288,0.00053730316],"about_ca_topic_score_codex":0.000036218953,"about_ca_topic_score_gemma":0.000028254906,"teacher_disagreement_score":0.5528286,"about_ca_system_score_codex":0.0003481032,"about_ca_system_score_gemma":0.0005680732,"threshold_uncertainty_score":0.99974394},"labels":[],"label_agreement":null},{"id":"W3035401658","doi":"10.1109/msec.2020.2994827","title":"Is Hardware More Secure Than Software?","year":2020,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Security and Verification in Computing","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; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software; Embedded system; Computer hardware; Operating system","score_opus":0.04259706255952684,"score_gpt":0.28245573398932783,"score_spread":0.239858671429801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035401658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2168125,0.00082192436,0.73001766,0.047777355,0.0014997954,0.00048055686,0.00003736482,0.0018488077,0.00070401584],"genre_scores_gemma":[0.9625981,0.000056177323,0.024382286,0.012210144,0.0006702487,0.0000145366075,0.000010248892,0.000027414335,0.00003085972],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973711,0.00010652358,0.00043278775,0.00095171836,0.0006133092,0.00052459526],"domain_scores_gemma":[0.99788874,0.00014245903,0.00019908443,0.0011710426,0.00020221015,0.0003964718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023051555,0.0003134827,0.00031994726,0.00008006164,0.0003511716,0.000508561,0.0028137343,0.00017813279,0.00010116089],"category_scores_gemma":[0.0002447098,0.00033634467,0.00022416931,0.00082293653,0.0000833852,0.0010117497,0.0006763563,0.00056614407,0.0004732241],"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.000095760945,0.00074531295,0.015700517,0.0008619905,0.00034866558,0.00030144118,0.50581706,0.00035820054,0.0018945127,0.054386172,0.34382758,0.07566282],"study_design_scores_gemma":[0.0026902293,0.0004243273,0.0064137992,0.00039613433,0.000068583395,0.00013611557,0.00096710207,0.26657242,0.06514059,0.05214438,0.60224754,0.002798786],"about_ca_topic_score_codex":0.000036539644,"about_ca_topic_score_gemma":0.0000021264211,"teacher_disagreement_score":0.7457856,"about_ca_system_score_codex":0.000054453503,"about_ca_system_score_gemma":0.00016162451,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W3037660916","doi":"10.1017/s0960129513000637","title":"Quantifying opacity","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":44,"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":"Opacity; Predicate (mathematical logic); Probabilistic logic; Random variable; Observable; Computer science; Computation; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.046015791376332896,"score_gpt":0.3060719185987094,"score_spread":0.26005612722237653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037660916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056348927,0.000013322775,0.94104373,0.00041585206,0.0006664817,0.00010422128,1.7132746e-7,0.00018600815,0.0012212858],"genre_scores_gemma":[0.615448,4.0244623e-7,0.38412082,0.00034334944,0.00008007384,0.0000026792532,1.1587839e-7,0.0000032107957,0.0000013500174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767584,0.00009697289,0.0003918337,0.00069072,0.000649655,0.0004950088],"domain_scores_gemma":[0.9983058,0.00042997717,0.00010145789,0.000919621,0.00008781463,0.00015533708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017577843,0.00016377875,0.00021898009,0.00024265362,0.00032913729,0.0006402568,0.0027575141,0.000046157165,0.000019262996],"category_scores_gemma":[0.00033466818,0.00013962007,0.000049324226,0.0012556734,0.00039478482,0.00066291296,0.00086561893,0.00022809167,0.000045366804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.3775974e-7,0.000024958323,0.00064732734,0.000020775295,7.8799286e-7,0.0000023180382,0.00061118376,0.0010582942,0.0001729647,0.9004303,0.000023942974,0.09700651],"study_design_scores_gemma":[0.00010763246,0.000014865548,0.006516864,0.00002438925,5.0379924e-7,0.000036221616,0.000003057551,0.6918923,0.00091024576,0.30018732,0.0001702024,0.00013637367],"about_ca_topic_score_codex":0.0000057268417,"about_ca_topic_score_gemma":0.0000019929876,"teacher_disagreement_score":0.69083405,"about_ca_system_score_codex":0.0000714999,"about_ca_system_score_gemma":0.00006587472,"threshold_uncertainty_score":0.6174011},"labels":[],"label_agreement":null},{"id":"W3047501977","doi":"10.1016/j.automatica.2020.109172","title":"Synthesis of sensor deception attacks at the supervisory layer of Cyber–Physical Systems","year":2020,"lang":"en","type":"preprint","venue":"Automatica","topic":"Security and Verification in Computing","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 Toronto","funders":"National Science Foundation","keywords":"Supervisor; Deception; Supervisory control; Context (archaeology); Cyber-physical system; Computer science; Computer security; Class (philosophy); Security controls; Control (management); Event (particle physics); Artificial intelligence; Psychology","score_opus":0.06866852878900963,"score_gpt":0.28990567266021783,"score_spread":0.2212371438712082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047501977","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.8092165,0.00033124854,0.1820485,0.0036212313,0.0011621419,0.0007721596,0.000048785387,0.00040708834,0.002392325],"genre_scores_gemma":[0.9921405,0.00001909328,0.007527914,0.00005781499,0.00014754657,0.000051369672,0.0000060056104,0.000014629003,0.000035155364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785995,0.000368973,0.0006202358,0.00045100247,0.00052007416,0.0001797435],"domain_scores_gemma":[0.9965429,0.0013836367,0.0005473857,0.0012960852,0.00016809549,0.000061939994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043170614,0.0002052602,0.00052201457,0.00006492255,0.00010315276,0.00008252188,0.0013981371,0.0001609282,0.00001999132],"category_scores_gemma":[0.00026844395,0.0001593497,0.00023399534,0.00023511097,0.00013570747,0.00007704301,0.001493182,0.00028638772,0.00009747831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010013,0.0023115526,0.0031497478,0.026343629,0.002568388,0.00003851686,0.13624354,0.07556647,0.07707829,0.54459465,0.028831853,0.10317323],"study_design_scores_gemma":[0.00007039297,0.000026737183,0.0030433403,0.000548784,0.00006002804,0.000008313286,0.0002024576,0.9765518,0.01711632,0.0017070083,0.00045775037,0.00020709599],"about_ca_topic_score_codex":0.00007152942,"about_ca_topic_score_gemma":0.0000016176235,"teacher_disagreement_score":0.9009853,"about_ca_system_score_codex":0.00006301926,"about_ca_system_score_gemma":0.000111261055,"threshold_uncertainty_score":0.6498092},"labels":[],"label_agreement":null},{"id":"W3047610905","doi":"10.1109/csf49147.2020.00024","title":"PASAPTO: Policy-aware Security and Performance Trade-off Analysis--Computation on Encrypted Data with Restricted Leakage","year":2020,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Dataflow; Bytecode; Information leakage; Encryption; Plaintext; Cloud computing; Outsourcing; Cryptography; Java; Security policy; Security analysis; Decision tree; Information flow; Data flow diagram; Computation; Data mining; Parallel computing; Algorithm; Computer network; Operating system; Database; Computer security","score_opus":0.04049684402394724,"score_gpt":0.2787001619254661,"score_spread":0.23820331790151886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047610905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3101203,0.000041032916,0.67793286,0.009976507,0.00004316734,0.00019670368,0.000015598696,0.00044494812,0.0012288466],"genre_scores_gemma":[0.98734725,0.000043910215,0.010538964,0.0018406846,0.00011275454,0.0000030302097,0.000100299265,0.000007576402,0.0000055624855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982245,0.00010537844,0.0002788372,0.0007829483,0.00037022072,0.00023809467],"domain_scores_gemma":[0.9987015,0.00017088572,0.00014499732,0.0007449254,0.000056709658,0.00018097005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016933301,0.00017660212,0.00022532188,0.00022263292,0.00024839974,0.0002676915,0.0010303663,0.00006605293,0.000008646056],"category_scores_gemma":[0.000062155836,0.00015006396,0.00003048921,0.0028930772,0.000053760083,0.00071898766,0.0003276212,0.00023434596,0.000012287379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007862376,0.0011749952,0.09544483,0.00066125306,0.0023716497,0.00014194568,0.059970383,0.065836124,0.00057559024,0.18011266,0.015567402,0.57735693],"study_design_scores_gemma":[0.00034259987,0.00022551561,0.048333943,0.000012356437,0.000036653324,0.000005815723,0.000104120154,0.949551,0.00020230096,0.00010962256,0.0008757186,0.00020039539],"about_ca_topic_score_codex":0.000061657156,"about_ca_topic_score_gemma":0.00001406468,"teacher_disagreement_score":0.88371485,"about_ca_system_score_codex":0.000027164497,"about_ca_system_score_gemma":0.000107904256,"threshold_uncertainty_score":0.61194307},"labels":[],"label_agreement":null},{"id":"W3081866196","doi":"10.2478/popets-2020-0049","title":"Mitigator: Privacy policy compliance using trusted hardware","year":2020,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Security and Verification in Computing","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; Trusted computing base; Computer security; Compliance (psychology); Privacy policy; Overhead (engineering); Privacy by Design; Software; Information privacy; Access control; Operating system; Cloud computing; Cloud computing security","score_opus":0.08761931710838279,"score_gpt":0.3088340749691185,"score_spread":0.22121475786073574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081866196","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.5204141,0.00034288285,0.41225883,0.05075686,0.0003400243,0.0006956873,0.000006532998,0.013715859,0.0014691926],"genre_scores_gemma":[0.84213644,0.000035860427,0.1562179,0.0013924605,0.00015143972,0.000025955223,0.0000012269873,0.000028006261,0.000010704038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724346,0.000014011062,0.00054791087,0.0010498922,0.00047827003,0.00066645],"domain_scores_gemma":[0.9984215,0.00011130011,0.00040876865,0.00062341406,0.00029763675,0.0001373918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025294142,0.00037540367,0.00039711143,0.00035848832,0.00049331394,0.0005285385,0.003753097,0.00024549814,0.0000045676525],"category_scores_gemma":[0.0035466293,0.00038546103,0.00011333026,0.002181493,0.00016471167,0.0009198538,0.0018485124,0.00064879813,0.000084171385],"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.00004988614,0.00019173254,0.002959517,0.0007652763,0.000092925446,0.000018891065,0.012484167,0.00017395396,0.2862466,0.6082029,0.0034201576,0.08539404],"study_design_scores_gemma":[0.00060285674,0.0002868478,0.00041444905,0.0006118651,0.000013838711,0.000050109873,0.0014245752,0.21910885,0.73186624,0.028111685,0.016583554,0.000925137],"about_ca_topic_score_codex":0.000011778816,"about_ca_topic_score_gemma":1.18060164e-7,"teacher_disagreement_score":0.5800912,"about_ca_system_score_codex":0.00024119024,"about_ca_system_score_gemma":0.0001730588,"threshold_uncertainty_score":0.99985975},"labels":[],"label_agreement":null},{"id":"W3082489414","doi":"10.1007/978-3-030-66172-4_6","title":"ArchiveSafe: Mass-Leakage-Resistant Storage from Proof-of-Work","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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; Vector Institute; University of Waterloo; McMaster University","funders":"","keywords":"Encryption; Computer science; Computer security; On-the-fly encryption; File system; Information leakage; Filesystem-level encryption; Cryptography; Adversary; Disk encryption; Client-side encryption; Confidentiality; Operating system","score_opus":0.02762596131567758,"score_gpt":0.265626939566902,"score_spread":0.2380009782512244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082489414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011438864,0.00055782724,0.98011965,0.0033932023,0.0036094466,0.0005546495,0.000018742961,0.0002491926,0.000058442834],"genre_scores_gemma":[0.53113985,0.0000055914015,0.4680206,0.00045671393,0.00034213264,0.000013097826,0.0000085717,0.000013075616,3.5819986e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944807,0.00028279392,0.0009186091,0.0023804738,0.0012232605,0.00071410823],"domain_scores_gemma":[0.9953165,0.0011486078,0.0006691402,0.0023692048,0.00022911746,0.00026741935],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009963588,0.00053516816,0.0007368257,0.0005211791,0.00026223942,0.0007732575,0.0076311184,0.00028506847,0.000009399456],"category_scores_gemma":[0.00041154353,0.0005319845,0.00021160756,0.0026509678,0.00068946974,0.00041767105,0.0051748976,0.0016361882,0.000011290404],"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.00004607968,0.00017892472,0.0009584189,0.00024967795,0.000040536648,0.000108652814,0.0111933015,0.54595494,0.0052943323,0.0044419123,0.00004448348,0.43148875],"study_design_scores_gemma":[0.00021037768,0.00008459995,0.0034365966,0.0005388067,0.000007714226,0.0000027742635,0.000001133341,0.8253658,0.02500394,0.1446801,0.0001305802,0.0005376052],"about_ca_topic_score_codex":0.00011342482,"about_ca_topic_score_gemma":0.000013731714,"teacher_disagreement_score":0.519701,"about_ca_system_score_codex":0.00022251756,"about_ca_system_score_gemma":0.0010931591,"threshold_uncertainty_score":0.9997132},"labels":[],"label_agreement":null},{"id":"W3094250247","doi":"10.1145/3382494.3422165","title":"On the use of C# Unsafe Code Context","year":2020,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Calgary; Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security; Context (archaeology); Memory safety; Dead code; Interoperability; Pointer (user interface); Unreachable code; Secure coding; Programming language; Redundant code; Database; Operating system; Software; Code generation; Software security assurance; Computer hardware; Information security","score_opus":0.21536925591301742,"score_gpt":0.2712843684701323,"score_spread":0.0559151125571149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094250247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02007258,0.000009447837,0.943691,0.03397002,0.00009769873,0.00006789548,0.000001064019,0.000081910825,0.0020083447],"genre_scores_gemma":[0.976747,0.0000015894198,0.007179697,0.015993085,0.000018553648,9.988819e-7,1.7297438e-7,0.0000014850257,0.000057428133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995688,0.000040767045,0.000105766245,0.00011824766,0.00010797291,0.00005840277],"domain_scores_gemma":[0.99910414,0.0005366047,0.000043700486,0.00024697892,0.000038930644,0.000029632982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007804441,0.00003548146,0.000049573933,0.000009015305,0.00005024627,0.00005423245,0.00046092537,0.000013827849,0.000059618098],"category_scores_gemma":[0.00015639665,0.00002278565,0.000025169635,0.00016565794,0.000024501787,0.0000972033,0.0000824134,0.00005779688,0.00007109355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000198492,0.000009379389,0.00003197077,0.0000018144423,0.000002971994,2.9115282e-7,0.00097052165,0.00026479762,0.000108583576,0.9798405,0.013823649,0.004943504],"study_design_scores_gemma":[0.00012257231,0.00007741579,0.00034588834,0.000010590127,0.0000012243269,9.454915e-7,0.000088712804,0.872675,0.011064203,0.0029110778,0.11262576,0.00007663511],"about_ca_topic_score_codex":0.000013805893,"about_ca_topic_score_gemma":0.0000017066155,"teacher_disagreement_score":0.9769294,"about_ca_system_score_codex":0.000003344477,"about_ca_system_score_gemma":0.000015962263,"threshold_uncertainty_score":0.09291719},"labels":[],"label_agreement":null},{"id":"W3105067267","doi":"","title":"Combining behavioural types with security analysis","year":2015,"lang":"en","type":"article","venue":"IMT Institutional Repository (IMT School for Advanced Studies Lucca)","topic":"Security and Verification in Computing","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":"Google (Canada)","funders":"European Cooperation in Science and Technology","keywords":"Correctness; Computer science; Trustworthiness; Enforcement; Computer security; Data science; Risk analysis (engineering); Business; Programming language; Political science","score_opus":0.061458698688423824,"score_gpt":0.3238499101042825,"score_spread":0.26239121141585864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105067267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41573906,0.004034157,0.5713828,0.0006809865,0.002835878,0.0006556885,0.000021204245,0.00055386464,0.004096314],"genre_scores_gemma":[0.9487177,0.000019919838,0.050528716,0.00015815959,0.00018596332,0.00015760565,0.000020840678,0.000009741662,0.00020133411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978156,0.00007364668,0.00046026302,0.00066499773,0.000612449,0.0003730313],"domain_scores_gemma":[0.99753726,0.00022206281,0.00027474615,0.0005650622,0.0011326901,0.000268176],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003634701,0.00026166864,0.00041724,0.00021875396,0.0013191585,0.00018447805,0.0006551991,0.000074321484,0.0000012400637],"category_scores_gemma":[0.0004111741,0.00023157736,0.00017727587,0.00096661446,0.00028592916,0.0010763772,0.00024551747,0.00024523187,0.000011748599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080445316,0.0009140834,0.1098286,0.0002241163,0.0058730273,0.0002910412,0.010929783,0.25755984,0.0014713045,0.60459393,0.0030480577,0.0044617434],"study_design_scores_gemma":[0.029368766,0.0063494043,0.13481195,0.0015067144,0.0053154803,0.0022686992,0.019768791,0.5037426,0.040397875,0.12083331,0.12631844,0.009317974],"about_ca_topic_score_codex":0.000032809283,"about_ca_topic_score_gemma":0.000029912015,"teacher_disagreement_score":0.53297865,"about_ca_system_score_codex":0.000457051,"about_ca_system_score_gemma":0.00046509958,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W3118144132","doi":"10.1145/3412841.3442001","title":"SecureJS compiler","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"Agence Nationale de la Recherche; European Commission; Canadian Institute of Steel Construction","keywords":"Computer science; Compiler; Isolation (microbiology); JavaScript; Implementation; Node (physics); Enforcement; Operating system; Computer security; Programming language; Engineering; Political science","score_opus":0.03657557528912132,"score_gpt":0.2747830683854917,"score_spread":0.2382074930963704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118144132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064092344,0.00039243777,0.96094114,0.0016928435,0.0027413717,0.00010630809,0.000001263765,0.0004935607,0.027221844],"genre_scores_gemma":[0.7473743,0.00003586016,0.25032622,0.0015635262,0.0002580849,0.000014658024,0.000029752558,0.000009015023,0.00038856347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998521,0.00008703976,0.00026618678,0.0006648222,0.00026507664,0.00019589237],"domain_scores_gemma":[0.9982493,0.00008580404,0.00012158636,0.0012910754,0.00017575074,0.00007651353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023061721,0.00016812215,0.00021012964,0.00007014792,0.00009760796,0.00078390056,0.001641335,0.00020236024,0.00019068152],"category_scores_gemma":[0.000027782442,0.00017363786,0.00013062106,0.00019333279,0.000023434275,0.00013982938,0.0031656795,0.0005531519,0.000085361135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012924924,0.00021728322,0.00056859147,0.00023397584,0.000106681764,0.000058547153,0.005711504,0.00269003,0.00010831566,0.9394353,0.019914731,0.030953763],"study_design_scores_gemma":[0.00025147962,0.000019165545,0.003593333,0.00024807864,0.000012975441,0.000049774986,0.00021319912,0.9073173,0.0031170037,0.027957134,0.05620281,0.0010177947],"about_ca_topic_score_codex":0.0000417912,"about_ca_topic_score_gemma":0.0000066549924,"teacher_disagreement_score":0.91147816,"about_ca_system_score_codex":0.000041603875,"about_ca_system_score_gemma":0.00022117935,"threshold_uncertainty_score":0.7559171},"labels":[],"label_agreement":null},{"id":"W3126782213","doi":"10.1109/iotsms52051.2020.9340206","title":"AppArmor For Health Data Access Control: Assessing Risks and Benefits","year":2020,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Sherbrooke","funders":"","keywords":"Mandatory access control; Computer science; Computer security; Access control; Confidentiality; Isolation (microbiology); Linux kernel; Enforcement; Operating system; Role-based access control","score_opus":0.45798435478649185,"score_gpt":0.4481778072533808,"score_spread":0.009806547533111054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126782213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020739492,0.00038371453,0.9582567,0.03855645,0.00013238413,0.00021265252,0.000016640517,0.00016533225,0.00020213092],"genre_scores_gemma":[0.87061316,0.000026396681,0.114351034,0.014827349,0.00015570955,0.000005912902,0.000012977753,0.000004816195,0.0000026618902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902487,0.000040007282,0.00019833668,0.0004527067,0.000108313994,0.0001757799],"domain_scores_gemma":[0.9990036,0.0002598645,0.00011081202,0.0004388956,0.000046454297,0.00014039835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044085545,0.00007153405,0.00013741526,0.000021288977,0.00024100045,0.0007779883,0.0013504894,0.000024339977,0.0000032623157],"category_scores_gemma":[0.000121336205,0.00006696363,0.000014231732,0.00016446148,0.000016447644,0.0010969035,0.000583636,0.00006861744,0.000002623673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018027391,0.0000666622,0.0044115814,0.0002344862,0.000040921062,0.0000011079919,0.0014273723,0.0012000372,0.00004823968,0.24479744,0.023616206,0.7241379],"study_design_scores_gemma":[0.0004654681,0.00003330661,0.0053011766,0.000011965779,0.0000026005903,0.0000023432156,0.000026092752,0.9829004,0.00007683479,0.0005222662,0.0105645815,0.00009295728],"about_ca_topic_score_codex":0.000044082317,"about_ca_topic_score_gemma":0.0000046894015,"teacher_disagreement_score":0.98170036,"about_ca_system_score_codex":0.000007768779,"about_ca_system_score_gemma":0.00008970058,"threshold_uncertainty_score":0.7502159},"labels":[],"label_agreement":null},{"id":"W3128430109","doi":"10.1145/3436817","title":"Information Integrity","year":2021,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Security and Verification in Computing","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; Data integrity; Standardization; Terminology; Computer security; Information flow; Trustworthiness; Promotion (chess); Risk analysis (engineering); Business","score_opus":0.11818712693276488,"score_gpt":0.3682330644045224,"score_spread":0.2500459374717575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128430109","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":[9.827178e-7,0.55001676,0.44753706,0.00004510893,0.0014683243,0.00016867604,0.0000051420893,0.00033460418,0.0004233324],"genre_scores_gemma":[0.000047140533,0.9414036,0.057719994,0.00015301327,0.00032971683,0.00000914754,0.0002879278,0.00002098646,0.0000284303],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99462384,0.0027293765,0.001199561,0.0005264977,0.00045808626,0.00046263216],"domain_scores_gemma":[0.99374366,0.002430606,0.0008551582,0.0024545386,0.00039053915,0.00012548489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055061034,0.0004587397,0.0013513982,0.0003208532,0.0003512581,0.0010215814,0.004239992,0.00041685443,0.000016876758],"category_scores_gemma":[0.0024041764,0.00044342273,0.00049948104,0.0016088526,0.00004417979,0.00080254144,0.0027141296,0.0012301791,0.0004455366],"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.6776047e-8,0.000019862116,0.000006893825,0.0016377054,0.000044423174,0.0000038040087,0.00029679542,0.0000066863063,4.3252415e-9,0.0111735985,0.0013989909,0.9854112],"study_design_scores_gemma":[0.000067725574,0.000012464272,0.000039387058,0.0047954386,0.000035266556,0.00008953377,0.000016719145,0.0043271785,5.044724e-7,0.0003037457,0.98982257,0.00048949156],"about_ca_topic_score_codex":0.000067567846,"about_ca_topic_score_gemma":0.000002351623,"teacher_disagreement_score":0.9884235,"about_ca_system_score_codex":0.0001811701,"about_ca_system_score_gemma":0.00073991343,"threshold_uncertainty_score":0.99980175},"labels":[],"label_agreement":null},{"id":"W3137191745","doi":"10.1145/3422337.3447834","title":"The Cost of OSCORE and EDHOC for Constrained Devices","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"Microsoft (Canada)","funders":"","keywords":"Firmware; Computer science; Encryption; Microcontroller; Exploit; Authenticated encryption; Embedded system; Computer security; Protocol (science); Payload (computing); Computer network; Buffer overflow; The Internet; Operating system","score_opus":0.04584853241781261,"score_gpt":0.303427552405985,"score_spread":0.2575790199881724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137191745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055367784,0.0009173988,0.9872759,0.004038253,0.00068638806,0.00037439883,0.000005988139,0.00005212109,0.0011127504],"genre_scores_gemma":[0.8723587,0.000115589115,0.12704615,0.00024748372,0.000071160575,0.000045119825,0.000008789262,0.000004160687,0.00010284879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992074,0.000038111564,0.00023586159,0.00030027915,0.000106549734,0.00011182939],"domain_scores_gemma":[0.9983558,0.00075037533,0.00017996595,0.00047107358,0.00021108854,0.00003170844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038743962,0.000089858746,0.00014595212,0.000022621802,0.00015988918,0.00034830696,0.0006945914,0.00008167983,0.0000039861397],"category_scores_gemma":[0.00009969379,0.0000661879,0.000058113175,0.00007081688,0.00010378878,0.000055955104,0.00076855323,0.00012734286,3.3043457e-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.000006640701,0.000044614204,0.0006222863,0.0004977739,0.000100184174,0.0000012502679,0.0020546801,0.00019658289,0.00013950965,0.77205485,0.0017282305,0.22255339],"study_design_scores_gemma":[0.0005473453,0.000060603168,0.00279421,0.00040093262,0.000030369873,0.000022431073,0.0015739555,0.91255933,0.0062093036,0.02461995,0.050715934,0.0004656245],"about_ca_topic_score_codex":0.000018178487,"about_ca_topic_score_gemma":0.00004958329,"teacher_disagreement_score":0.91236275,"about_ca_system_score_codex":0.000008678451,"about_ca_system_score_gemma":0.00017901321,"threshold_uncertainty_score":0.33587322},"labels":[],"label_agreement":null},{"id":"W3139383966","doi":"10.1145/3259532","title":"Session details: Secure and safety-critical vs. insecure, non safety-critical embedded systems: Do they require completely different design approaches?","year":2004,"lang":"en","type":"article","venue":"International Conference on Hardware/Software Codesign and System Synthesis","topic":"Security and Verification in Computing","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":"Session (web analytics); Life-critical system; Computer science; Critical system; Computer security; Critical design; Embedded system; Engineering; Software engineering; Operating system; Software","score_opus":0.10395616366280536,"score_gpt":0.29632485022531285,"score_spread":0.1923686865625075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139383966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024061545,0.0004191888,0.99039423,0.0024952453,0.0012804541,0.0008093868,0.00015077958,0.0005237058,0.0015208287],"genre_scores_gemma":[0.9728293,0.00017694569,0.026281193,0.00017289096,0.00022744066,0.0002167972,0.000020498937,0.00004825334,0.00002671285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942033,0.0012207245,0.0011884598,0.0015032659,0.0012264951,0.0006577114],"domain_scores_gemma":[0.99312675,0.0045201,0.00033340792,0.00085217477,0.00068622554,0.0004813302],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017302682,0.0006913925,0.000928278,0.0003831078,0.0008204878,0.0015950296,0.001484939,0.00039752625,0.0000387786],"category_scores_gemma":[0.0019681929,0.00059944653,0.00016490191,0.00022030385,0.00031154204,0.0009847744,0.00042757628,0.00055104616,0.000052120147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044587062,0.00024976744,0.00023979154,0.0007004454,0.00012992656,0.00009550756,0.0022137172,0.0007657207,0.00033388924,0.98486394,0.00008336825,0.009878088],"study_design_scores_gemma":[0.003985046,0.0013271711,0.0033735102,0.019543104,0.0002652257,0.0017958786,0.0063288226,0.91092235,0.003976535,0.04352711,0.0013240811,0.0036311569],"about_ca_topic_score_codex":0.00005316891,"about_ca_topic_score_gemma":0.0000077843615,"teacher_disagreement_score":0.9704231,"about_ca_system_score_codex":0.0004805395,"about_ca_system_score_gemma":0.00027119502,"threshold_uncertainty_score":0.9996457},"labels":[],"label_agreement":null},{"id":"W3140837477","doi":"10.1145/945445.945463","title":"Implementing an untrusted operating system on trusted hardware","year":2003,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":154,"is_retracted":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; Operating system; Trusted Computing; Embedded system; Embedded operating system; Context (archaeology); Trusted Platform Module; Memory protection; Architecture; Direct Anonymous Attestation; Tamper resistance; Context switch; Hardware architecture; Computer hardware; Memory management; Virtual memory; Software; Computer security; Overlay","score_opus":0.035080689566609355,"score_gpt":0.2828035630620673,"score_spread":0.2477228734954579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140837477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10200866,0.000019742049,0.8125779,0.00018317842,0.000747311,0.00026390186,0.0000014145542,0.0010679057,0.08312996],"genre_scores_gemma":[0.92252916,3.1463676e-7,0.076840706,0.00038425144,0.00006843411,0.000010149517,0.000003842436,0.000009084354,0.00015404099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982965,0.00023873849,0.00034018932,0.00045997876,0.00024860818,0.00041599086],"domain_scores_gemma":[0.9989493,0.000101153215,0.000103143044,0.000627953,0.00011263792,0.0001058292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215352,0.00013648499,0.00013484899,0.00009313197,0.00063776464,0.00047545644,0.0005914911,0.00005101568,0.00007565634],"category_scores_gemma":[0.00008232819,0.00012668253,0.00004038683,0.0004347341,0.000010475378,0.00044751866,0.000097165575,0.00012874212,0.00007535603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.5475103e-7,0.000029989498,0.00045170888,0.000018036893,0.000007368885,0.00000445313,0.0006838064,0.00039132693,0.00035609805,0.99157333,0.00013811779,0.006345107],"study_design_scores_gemma":[0.0007459216,0.00015696487,0.0008818105,0.00009773779,0.0000060832162,0.00006917857,0.0036666188,0.9538741,0.02078802,0.0002987818,0.018951237,0.0004635425],"about_ca_topic_score_codex":0.0000317013,"about_ca_topic_score_gemma":0.000008278311,"teacher_disagreement_score":0.99127454,"about_ca_system_score_codex":0.00007511018,"about_ca_system_score_gemma":0.000057701338,"threshold_uncertainty_score":0.5165964},"labels":[],"label_agreement":null},{"id":"W3148780436","doi":"10.1109/icas49788.2021.9551155","title":"On Securing Cloud-Hosted Cyber-Physical Systems Using Trusted Execution Environments","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"Testbed; Cloud computing; Computer science; Software deployment; Computer security; Guard (computer science); Cyber-physical system; Trusted Computing; Architecture; Cloud computing security; State (computer science); Access control; Software; Computer network; Operating system","score_opus":0.039049816626962476,"score_gpt":0.27650992481181635,"score_spread":0.23746010818485389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148780436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4584963,0.00010685384,0.5364595,0.00005721489,0.0032652796,0.00031671,0.0000031975528,0.00024749746,0.0010473969],"genre_scores_gemma":[0.9909667,0.000014746911,0.008059564,0.00012548923,0.0006080253,0.000028289563,0.000045898232,0.000028335726,0.0001229704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967354,0.0003450406,0.00053371955,0.0012621183,0.0007106162,0.00041311764],"domain_scores_gemma":[0.99765646,0.00021111095,0.00040281846,0.0015189514,0.00006460039,0.00014604005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003422014,0.00040676718,0.00047634472,0.00017564902,0.00028005624,0.00089223956,0.0012031319,0.000339193,0.000015198406],"category_scores_gemma":[0.00004909619,0.00043500232,0.000215266,0.00031257592,0.00004535963,0.00025823363,0.0018650967,0.00082260295,0.000052534157],"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.000031322543,0.0012522086,0.00015098442,0.00062625314,0.0003891736,0.00014361227,0.011238106,0.62360775,0.009720828,0.34660754,0.0004339962,0.0057981918],"study_design_scores_gemma":[0.00024494083,0.00003218648,0.00024669842,0.0004963859,0.000023326193,0.00002403738,0.00020450239,0.99280846,0.0040626195,0.0010289936,0.00033516306,0.000492698],"about_ca_topic_score_codex":0.00021968834,"about_ca_topic_score_gemma":0.0000013907082,"teacher_disagreement_score":0.53247035,"about_ca_system_score_codex":0.00045429956,"about_ca_system_score_gemma":0.00014144642,"threshold_uncertainty_score":0.99981016},"labels":[],"label_agreement":null},{"id":"W3154844554","doi":"10.1145/3445814.3446761","title":"In-fat pointer: hardware-assisted tagged-pointer spatial memory safety defense with subobject granularity protection","year":2021,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":25,"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":"Computer science; Pointer (user interface); Memory safety; Pointer analysis; Memory protection; Programming language; Granularity; Operating system; Static analysis; Memory management; Software; Computer hardware; Virtual memory; Overlay","score_opus":0.018798849623376912,"score_gpt":0.23393952989131703,"score_spread":0.21514068026794012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154844554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0598102,0.00003840369,0.9300219,0.0032127502,0.000746098,0.00033739107,0.0000024040946,0.00028036995,0.0055504763],"genre_scores_gemma":[0.9773315,0.000005216778,0.02092397,0.0009814292,0.00012878004,0.000026970469,0.000008336486,0.000013598873,0.00058017985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978505,0.00031767922,0.00042548182,0.000716246,0.00035382554,0.00033628978],"domain_scores_gemma":[0.99866205,0.00009205887,0.00013261534,0.00075287896,0.00026588503,0.000094532305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004746962,0.00020525149,0.00024891694,0.00014933446,0.00021753002,0.00026514777,0.00046904982,0.00010642412,0.0001861094],"category_scores_gemma":[0.00009802109,0.00018469269,0.000105204614,0.00072072924,0.000058261947,0.00059467246,0.00026532085,0.0003948892,0.00006481648],"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.004910456,0.008126985,0.029104348,0.0017148122,0.0009780093,0.005976379,0.053976838,0.004157297,0.05322081,0.27173957,0.013677726,0.55241674],"study_design_scores_gemma":[0.017704329,0.0011361582,0.15348476,0.0010167679,0.00007737555,0.0041030226,0.0015770878,0.44329366,0.33887187,0.009614347,0.025933454,0.0031871651],"about_ca_topic_score_codex":0.0010433311,"about_ca_topic_score_gemma":0.0024376689,"teacher_disagreement_score":0.9175213,"about_ca_system_score_codex":0.00015651686,"about_ca_system_score_gemma":0.00015965,"threshold_uncertainty_score":0.75315493},"labels":[],"label_agreement":null},{"id":"W3166670331","doi":"10.1145/3458336.3465291","title":"The last CPU","year":2021,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Initialization; Computer science; Embedded system; Focus (optics); Scaling; Process (computing); Central processing unit; Operating system; Computer hardware","score_opus":0.020993872500104274,"score_gpt":0.25243900110894896,"score_spread":0.2314451286088447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166670331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002275343,0.00019348158,0.929202,0.007552776,0.00056912337,0.0000157164,4.96961e-8,0.00012095184,0.060070515],"genre_scores_gemma":[0.9414086,0.000037621117,0.053047784,0.002015487,0.00013379869,0.0000031005686,4.6547993e-7,0.0000024107087,0.0033507403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964666,0.000026631738,0.00006105199,0.00010555023,0.00007955757,0.000080560356],"domain_scores_gemma":[0.9994331,0.00015310464,0.00001361921,0.0003250521,0.00005601055,0.000019087624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012606854,0.000022957047,0.000020990357,0.000005042776,0.00023071685,0.00022470627,0.00037097282,0.000010411181,0.000019033594],"category_scores_gemma":[0.000042108935,0.000015504032,0.000017812972,0.00018125685,0.000012737004,0.000075663265,0.00014477975,0.000040897066,0.00012360193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.555491e-8,0.000005589311,0.00008388265,4.996566e-7,0.000001707846,0.00000194722,0.0001353069,0.0000085119045,0.000097823104,0.958704,0.0042417194,0.03671897],"study_design_scores_gemma":[0.000083811945,0.00000655271,0.0035572054,0.0000039257343,6.6888197e-7,0.000036016852,0.00015878177,0.08843778,0.014426182,0.019846484,0.87335396,0.00008862466],"about_ca_topic_score_codex":0.0000017483278,"about_ca_topic_score_gemma":0.000009179835,"teacher_disagreement_score":0.9391332,"about_ca_system_score_codex":0.0000052276523,"about_ca_system_score_gemma":0.000039230308,"threshold_uncertainty_score":0.21668477},"labels":[],"label_agreement":null},{"id":"W3169087451","doi":"10.1109/formalise52586.2021.00010","title":"Runtime Verification Under Access Restrictions","year":2021,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Stateful firewall; Computer science; Scalability; TRACE (psycholinguistics); Runtime verification; Distributed computing; Lift (data mining); Proxy (statistics); Programming language; Formal verification; Database; Data mining; Computer network; Machine learning; Network packet","score_opus":0.06109271942735424,"score_gpt":0.3202235700132118,"score_spread":0.25913085058585755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169087451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058493693,0.00006136243,0.9589725,0.005171373,0.0004737639,0.000036289195,3.0347508e-7,0.00026986742,0.029165173],"genre_scores_gemma":[0.94591373,0.000032696928,0.051167294,0.0012641122,0.00009555949,0.000008103538,0.000006261615,0.000004124693,0.001508095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992816,0.00004517561,0.00014139865,0.00027732173,0.00013898319,0.00011555289],"domain_scores_gemma":[0.999132,0.00007848239,0.00004249884,0.0005533793,0.00014930751,0.00004437848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010281696,0.00005223042,0.000052386284,0.00005215037,0.00020468683,0.0004203997,0.00056678284,0.000036800124,0.00012905255],"category_scores_gemma":[0.000038079477,0.000055192628,0.00003198566,0.0007854592,0.000013757584,0.0005878519,0.00020045615,0.00007557163,0.0001660317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.2700575e-7,0.000053909003,0.00048779824,0.0000027505812,0.0000067562164,0.0000021914757,0.00010754496,0.00049232005,0.0008650721,0.9884192,0.003754836,0.005807339],"study_design_scores_gemma":[0.00063696207,0.00003284322,0.21342608,0.00003215096,0.000016546564,0.0001277725,0.0003632111,0.4385674,0.07221279,0.10411654,0.16975015,0.00071755407],"about_ca_topic_score_codex":0.00002530695,"about_ca_topic_score_gemma":0.0000056227104,"teacher_disagreement_score":0.9400644,"about_ca_system_score_codex":0.000029304983,"about_ca_system_score_gemma":0.000114471244,"threshold_uncertainty_score":0.4053924},"labels":[],"label_agreement":null},{"id":"W3171352515","doi":"10.1145/3458336.3465273","title":"mmapx","year":2021,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"VMware","keywords":"Computer science; System on a chip; Embedded system; Computer architecture","score_opus":0.01965136784796265,"score_gpt":0.24419131190146431,"score_spread":0.22453994405350167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171352515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021472292,0.00005882872,0.9200099,0.0024888657,0.00026295087,0.000007641273,3.7366654e-8,0.00013754361,0.07488699],"genre_scores_gemma":[0.75685185,0.0000049847886,0.2389794,0.0019908322,0.00006036216,9.866852e-7,5.860357e-7,0.0000013443963,0.0021096454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968576,0.000014886195,0.000052604853,0.0001209683,0.0000632854,0.0000625109],"domain_scores_gemma":[0.9996325,0.000033801523,0.000009623056,0.00025396986,0.000047648184,0.000022507582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058010133,0.000021190293,0.000025455016,0.000010284703,0.00004816675,0.000082867446,0.00021834717,0.000011917768,0.00010204118],"category_scores_gemma":[0.000021960737,0.00002075891,0.000016015667,0.00018274058,0.000004590873,0.000107356784,0.00010035739,0.000028955303,0.00017461163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.1597556e-8,0.000010263683,0.0001139244,0.0000010668535,0.00000121689,0.0000058108867,0.00013188164,0.0000083773875,0.00037482296,0.9782636,0.002467173,0.018621827],"study_design_scores_gemma":[0.000256541,0.000014969996,0.006034994,0.000010820046,0.0000015555681,0.0001298263,0.00012272123,0.2735035,0.12554255,0.06356258,0.5305445,0.0002753781],"about_ca_topic_score_codex":0.000001906995,"about_ca_topic_score_gemma":9.375189e-7,"teacher_disagreement_score":0.91470104,"about_ca_system_score_codex":0.000004935949,"about_ca_system_score_gemma":0.000035184727,"threshold_uncertainty_score":0.22443376},"labels":[],"label_agreement":null},{"id":"W3172592804","doi":"10.3929/ethz-b-000489720","title":"Formally Validating a Practical Verification Condition Generator (extended version)","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Correctness; Soundness; Computer science; Programming language; Generator (circuit theory); Certificate; Implementation; Transformation (genetics); Control flow; Debugging; Theoretical computer science","score_opus":0.10011609469311487,"score_gpt":0.23745765397629137,"score_spread":0.13734155928317648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172592804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26880622,0.000030202955,0.72848344,0.00028988763,0.00090454,0.00019405158,0.00000890434,0.00028149638,0.0010012524],"genre_scores_gemma":[0.9659409,0.00007615459,0.033205003,0.00024395194,0.00016826499,0.00000240477,0.00020781827,0.000015456531,0.00014004215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975788,0.00033412763,0.00033090913,0.0012301508,0.0001851023,0.0003408893],"domain_scores_gemma":[0.9973136,0.00021303663,0.00049812504,0.0013123851,0.00048437278,0.00017844098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049520866,0.00027947407,0.00027722976,0.00019596699,0.00043235562,0.00052847003,0.001096815,0.00035449705,0.00009381349],"category_scores_gemma":[0.00019873105,0.00036809844,0.0002034238,0.00064337254,0.00007491846,0.0012050011,0.0013906601,0.00072444224,0.00012224854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048943326,0.00046228134,0.00063898065,0.00024119047,0.00021232694,0.00051459763,0.0015480182,0.07832704,0.001903561,0.912336,0.0017049616,0.0020621147],"study_design_scores_gemma":[0.00048039175,0.00004336301,0.0011821155,0.00011957581,0.00006912054,0.00003268711,0.00041948818,0.9848179,0.0035456554,0.0073207654,0.0014387743,0.00053011434],"about_ca_topic_score_codex":0.000038008468,"about_ca_topic_score_gemma":0.0000062606155,"teacher_disagreement_score":0.9064909,"about_ca_system_score_codex":0.0003096294,"about_ca_system_score_gemma":0.00062921754,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null},{"id":"W3198309584","doi":"10.1145/3462699","title":"Exploitation Techniques for Data-oriented Attacks with Existing and Potential Defense Approaches","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Privacy and Security","topic":"Security and Verification in Computing","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 Waterloo","funders":"National Science Foundation","keywords":"Exploit; Computer science; Control flow; Computer security; Data flow diagram; Block (permutation group theory); Data integrity; Control (management); Overhead (engineering); Database; Programming language; Artificial intelligence","score_opus":0.11587804780819375,"score_gpt":0.3080470435231725,"score_spread":0.19216899571497878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198309584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055552803,0.00011316783,0.942263,0.0015075846,0.00008442837,0.00021362696,0.000024426758,0.00016570723,0.00007525958],"genre_scores_gemma":[0.7046783,0.000059572034,0.2950462,0.000109335895,0.000026933498,0.000031208932,0.000032626704,0.000006267002,0.0000095430805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998852,0.000075509364,0.00018945665,0.0005755949,0.00014387594,0.00016352485],"domain_scores_gemma":[0.9985986,0.0002743536,0.000072601775,0.000869751,0.000115147355,0.00006958535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030708977,0.00012557112,0.00013128306,0.00006386767,0.0005287542,0.0001889396,0.00040442855,0.00006962837,0.0000025589893],"category_scores_gemma":[0.00010889758,0.00012215842,0.000026155594,0.00022513405,0.000067578294,0.0006604669,0.00007375423,0.00017349946,4.4509596e-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.00027759292,0.0010319954,0.0004580552,0.0005319896,0.00023066739,0.00003506485,0.02144171,0.00020984915,0.00088652753,0.1447,0.00020963608,0.82998693],"study_design_scores_gemma":[0.0031675277,0.00081294175,0.0018074407,0.00031548072,0.00020369345,0.0006928348,0.004194813,0.812504,0.04481542,0.106173545,0.023907876,0.001404451],"about_ca_topic_score_codex":0.000009251987,"about_ca_topic_score_gemma":0.00001257018,"teacher_disagreement_score":0.82858247,"about_ca_system_score_codex":0.00001339016,"about_ca_system_score_gemma":0.000045541412,"threshold_uncertainty_score":0.4981476},"labels":[],"label_agreement":null},{"id":"W3212030079","doi":"","title":"Iron: Functional Encryption using Intel SGX","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","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":"","keywords":"Computer science; Guard (computer science); Cryptographic primitive; Cryptography; Encryption; Context (archaeology); Theoretical computer science; Functional encryption; Construct (python library); Cryptographic protocol; Computer security; Programming language; Ciphertext","score_opus":0.05872375147886557,"score_gpt":0.2922273820116055,"score_spread":0.2335036305327399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212030079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.03699733,0.00011752238,0.9525559,0.0016206646,0.004719831,0.00034195132,0.00001962554,0.00038824315,0.0032389492],"genre_scores_gemma":[0.32049435,0.000045944445,0.67794085,0.0004302252,0.0009512287,0.000066047585,0.00003884578,0.000027884404,0.000004634087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965539,0.00046038083,0.000669151,0.0013802891,0.00037503758,0.00056123786],"domain_scores_gemma":[0.9968308,0.0008157306,0.0005493065,0.0014392056,0.00019538093,0.0001695815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005481455,0.00042872323,0.00046987552,0.00039346688,0.00033589272,0.00016960228,0.0017165187,0.0004313045,0.0001759181],"category_scores_gemma":[0.00024775765,0.00040898353,0.00028455284,0.00015713875,0.00037333713,0.00023134689,0.004146776,0.0011556316,0.00043090887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024248997,0.00006825323,0.0013609289,0.000053384032,0.00006200206,0.000018062161,0.0012824232,0.002569875,0.002252909,0.9811967,0.00037482046,0.010736379],"study_design_scores_gemma":[0.00028420083,0.00002947863,0.0054183956,0.00017050919,0.000018767167,0.00011028877,0.000037289057,0.112315275,0.00077441905,0.8783542,0.0020245535,0.00046260675],"about_ca_topic_score_codex":0.000025531368,"about_ca_topic_score_gemma":0.000007374972,"teacher_disagreement_score":0.28349704,"about_ca_system_score_codex":0.00022870624,"about_ca_system_score_gemma":0.00043318068,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W4205564474","doi":"10.22215/etd/2021-14675","title":"A Practical, Lightweight, and Flexible Confinement Framework in eBPF","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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","funders":"","keywords":"Successor cardinal; Flexibility (engineering); Overhead (engineering); Computer science; Space (punctuation); Computer security; Operating system; Management; Mathematics; Economics","score_opus":0.03743815466523952,"score_gpt":0.3465189236588283,"score_spread":0.3090807689935888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205564474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.015047234,0.0022335663,0.8527428,0.007405348,0.0031744489,0.00056937593,0.0000017202498,0.00038813008,0.118437365],"genre_scores_gemma":[0.111526996,0.0009921405,0.8688638,0.0021217994,0.00035365752,0.00011118411,0.00019713581,0.000035721165,0.015797574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998539,0.00006947223,0.00034944105,0.00057095446,0.00026400172,0.00020714481],"domain_scores_gemma":[0.99883723,0.00036146914,0.00014835029,0.00046321165,0.00011655161,0.00007321168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002516452,0.0001727371,0.00023554884,0.00015283508,0.00009982816,0.00042136962,0.0003237538,0.00027183973,0.0002464868],"category_scores_gemma":[0.00018692257,0.00017313714,0.00004038951,0.0004475533,0.000014280228,0.0001839841,0.000100193916,0.0004730958,0.000028800963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005628035,0.00010964042,0.00007533042,0.00010975791,0.000017785986,0.000030394955,0.0028010872,0.0000024421963,0.000052981282,0.98561,0.0036182904,0.007566682],"study_design_scores_gemma":[0.0022230253,0.0004629737,0.017363306,0.0052463077,0.00011274872,0.00018300832,0.014445667,0.1513042,0.057270724,0.19586803,0.5512232,0.0042967782],"about_ca_topic_score_codex":0.00006403623,"about_ca_topic_score_gemma":0.00011024537,"teacher_disagreement_score":0.78974193,"about_ca_system_score_codex":0.000032149866,"about_ca_system_score_gemma":0.00027473955,"threshold_uncertainty_score":0.70603275},"labels":[],"label_agreement":null},{"id":"W4205726858","doi":"10.1109/msp.2014.36","title":"Table of contents","year":2014,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Security and Verification in Computing","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":"Regional Municipality of Niagara","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.026542978903211615,"score_gpt":0.2627548521789878,"score_spread":0.2362118732757762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205726858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3376107,0.000115649374,0.6538201,0.0008609291,0.0012379396,0.00015719235,0.0000026895118,0.00021961893,0.00597522],"genre_scores_gemma":[0.9906736,0.000010544959,0.008766979,0.00036708062,0.00012365049,0.000004275691,0.0000014804142,0.000006462862,0.000045949226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.000104030005,0.00032156377,0.00032895835,0.00028446526,0.00024853626],"domain_scores_gemma":[0.9985171,0.00016812385,0.00018470484,0.00087216747,0.00016981809,0.00008811573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045250703,0.00011373162,0.00019976847,0.000074211166,0.00011013504,0.000080400845,0.0013978808,0.000066821194,0.000018451114],"category_scores_gemma":[0.000186508,0.000118277654,0.00006957003,0.00035456513,0.000057134755,0.00037006187,0.00023089153,0.00014922315,0.00006627198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022458848,0.00070920633,0.0070266724,0.0002287099,0.000079612895,0.0000053261147,0.0152393,0.00020054421,0.015770817,0.8990832,0.015702575,0.045931593],"study_design_scores_gemma":[0.0018973377,0.00028925925,0.0067335316,0.00017574386,0.00001974824,0.000032447566,0.000080096856,0.34758738,0.24977815,0.15843622,0.23416448,0.0008056258],"about_ca_topic_score_codex":0.00007904488,"about_ca_topic_score_gemma":0.0000029298485,"teacher_disagreement_score":0.74064696,"about_ca_system_score_codex":0.000015713853,"about_ca_system_score_gemma":0.0000364179,"threshold_uncertainty_score":0.48232228},"labels":[],"label_agreement":null},{"id":"W4206098832","doi":"10.4018/978-1-7998-8954-0.ch080","title":"Cyber Security Aspects of Virtualization in Cloud Computing Environments","year":2021,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Security and Verification in Computing","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 Windsor","funders":"","keywords":"Virtualization; Computer security; Cloud computing; Computer science; Cybercrime; Virtual machine; Cloud computing security; The Internet; World Wide Web; Operating system","score_opus":0.018644503793307936,"score_gpt":0.24679972312218507,"score_spread":0.22815521932887714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206098832","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.0007968685,0.00040499034,0.12983419,0.00004052643,0.0009919413,0.00024372294,0.000018233924,0.0000840572,0.8675855],"genre_scores_gemma":[0.9948649,0.000010659778,0.002197797,0.00029691536,0.00024677138,0.0000021967303,0.000011354902,0.000022862861,0.0023465392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765354,0.00007762594,0.00071316713,0.0007214119,0.0005461388,0.00028812466],"domain_scores_gemma":[0.998439,0.00009083747,0.0005220202,0.00078842643,0.00006763492,0.00009207565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028853907,0.000324051,0.00047338108,0.00010089693,0.00008613656,0.000098838966,0.00083817734,0.00035590524,0.000019428575],"category_scores_gemma":[0.000032729058,0.00039763455,0.00015530986,0.000076917655,0.000087413646,0.00009214074,0.0006485402,0.00033111303,0.000036862544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029038545,0.000027573264,0.000049743558,0.00003700264,0.000028141016,0.00003781656,0.00052806176,0.00023394963,0.000023869758,0.99591845,0.000095026975,0.0030174716],"study_design_scores_gemma":[0.0007837188,0.00008465588,0.00038071795,0.0010114253,0.00003191201,0.0000660704,0.000044933575,0.028526297,0.0010867271,0.94824314,0.018829156,0.0009112687],"about_ca_topic_score_codex":0.000051946787,"about_ca_topic_score_gemma":0.000040811487,"teacher_disagreement_score":0.994068,"about_ca_system_score_codex":0.00031507993,"about_ca_system_score_gemma":0.00018979982,"threshold_uncertainty_score":0.99984753},"labels":[],"label_agreement":null},{"id":"W4206348988","doi":"10.1109/isias.2007.4299780","title":"Team Edit Automata for Testing Security Property","year":2007,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Automaton; Pointer (user interface); Component (thermodynamics); Software security assurance; Theoretical computer science; Programming language; Software; Information security; Computer security; Artificial intelligence; Security service","score_opus":0.0505951989509701,"score_gpt":0.2926016659998486,"score_spread":0.24200646704887852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206348988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030079442,0.000014160454,0.95495474,0.00070235564,0.00073020294,0.00026648876,8.5336194e-7,0.000769892,0.039553367],"genre_scores_gemma":[0.5642528,4.813393e-7,0.43417513,0.0006147474,0.00047735585,0.000010924124,0.0000016556619,0.000006489799,0.00046041602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988992,0.00001608995,0.00024888726,0.00033835904,0.00018306548,0.0003143898],"domain_scores_gemma":[0.99869806,0.0005034361,0.00007841119,0.0004444144,0.00019110928,0.000084600644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294622,0.00009235717,0.000092979375,0.000059412647,0.00026043536,0.00015243905,0.0007533547,0.00005601814,0.0000067841793],"category_scores_gemma":[0.00042838336,0.00006596099,0.000039680195,0.00037134477,0.00002582172,0.00033873448,0.00019071602,0.000097076234,0.000032318734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015598345,0.000394106,0.0026695963,0.00014403708,0.000024127106,0.00000615607,0.0034768847,0.00007039791,0.0020564778,0.4281007,0.08139972,0.48164222],"study_design_scores_gemma":[0.00033689916,0.00009296206,0.0011816205,0.000022952596,0.0000025530285,0.00002617668,0.000072497896,0.8492694,0.006235297,0.011301334,0.13123001,0.00022828995],"about_ca_topic_score_codex":0.000042961852,"about_ca_topic_score_gemma":0.000008663434,"teacher_disagreement_score":0.849199,"about_ca_system_score_codex":0.000035815316,"about_ca_system_score_gemma":0.000066584,"threshold_uncertainty_score":0.2689811},"labels":[],"label_agreement":null},{"id":"W4210328082","doi":"10.1145/3503921.3503922","title":"Reversing and Fuzzing the Google Titan M Chip","year":2021,"lang":"en","type":"article","venue":"Reversing and Offensive-Oriented Trends Symposium","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":13,"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":"Government of Canada","keywords":"Fuzz testing; Computer science; Computer security; Attack surface; Titan (rocket family); Chip; Embedded system; Reversing; Operating system; Software; Engineering; Telecommunications","score_opus":0.012726137959121895,"score_gpt":0.2291365505778812,"score_spread":0.21641041261875932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210328082","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.54397446,0.026199838,0.16806334,0.15238056,0.013194227,0.0006157936,0.00003902128,0.0014968748,0.09403588],"genre_scores_gemma":[0.9809203,0.00046537243,0.015655575,0.0013421075,0.00025948987,0.0000026540113,0.000014414695,0.000018331188,0.0013217359],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998461,0.00017210035,0.00023084843,0.0005718672,0.00023443435,0.0003297181],"domain_scores_gemma":[0.9988465,0.00023739816,0.00011911616,0.0004877614,0.0001781355,0.00013111446],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028392236,0.00018150812,0.00020517244,0.00011911862,0.0013016947,0.00030989066,0.00023289451,0.00008267905,0.0000070405817],"category_scores_gemma":[0.00007270458,0.00016109121,0.00006979764,0.000688546,0.00013665747,0.00029776007,0.00031290422,0.0002575617,0.0000054632924],"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.00011725232,0.00047953305,0.0111019565,0.0005220449,0.0005527183,0.0005983798,0.05968705,0.00029937108,0.06573286,0.39678523,0.034982737,0.42914087],"study_design_scores_gemma":[0.003757894,0.00034588572,0.023974597,0.0014746262,0.00030874508,0.0030748833,0.008336384,0.10704913,0.025369875,0.0021128363,0.8222726,0.0019225281],"about_ca_topic_score_codex":0.00005106178,"about_ca_topic_score_gemma":0.000009596466,"teacher_disagreement_score":0.78728986,"about_ca_system_score_codex":0.00005816779,"about_ca_system_score_gemma":0.000045031375,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W4214849268","doi":"10.1145/3494516","title":"Buddy Stacks: Protecting Return Addresses with Efficient Thread-Local Storage and Runtime Re-Randomization","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Security and Verification in Computing","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":"Huawei Technologies (Canada)","funders":"Australian Research Council","keywords":"Computer science; Thread (computing); Pointer (user interface); Operating system; Call stack; Embedded system; Parallel computing; Computer hardware; Stack (abstract data type)","score_opus":0.05372739604091537,"score_gpt":0.2789406530306056,"score_spread":0.22521325698969025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214849268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06653862,0.00027009804,0.9320357,0.00021261552,0.00032426877,0.0002375391,0.000005587478,0.00037247813,0.0000031021982],"genre_scores_gemma":[0.52332664,0.000016696269,0.476453,0.000061104074,0.000019631763,0.00009321471,0.000002051136,0.0000133592375,0.000014313608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985611,0.00042953293,0.00019558391,0.0004231086,0.00017358379,0.00021708783],"domain_scores_gemma":[0.9971611,0.0022562628,0.00007562983,0.00038765892,0.000050044477,0.00006931094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012795711,0.00015252356,0.00022155773,0.00019931357,0.00065155234,0.0000577461,0.0002719907,0.000060067643,0.00001271449],"category_scores_gemma":[0.00045063964,0.00014851602,0.000030641142,0.00040182925,0.000049722355,0.00010017768,0.00004749133,0.0005064754,4.5115337e-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.000116876436,0.00005619855,0.000056362755,0.000063879444,0.000048649526,0.000008492492,0.0041828095,0.9457206,0.0002680463,0.00094696635,0.000005173549,0.048525915],"study_design_scores_gemma":[0.003562158,0.0010509221,0.0010338046,0.0001224417,0.00008738776,0.00061293534,0.0018926273,0.9806956,0.006602874,0.0006631816,0.002894398,0.0007816533],"about_ca_topic_score_codex":0.000027775737,"about_ca_topic_score_gemma":0.000002694204,"teacher_disagreement_score":0.456788,"about_ca_system_score_codex":0.000047918995,"about_ca_system_score_gemma":0.000037860733,"threshold_uncertainty_score":0.60563076},"labels":[],"label_agreement":null},{"id":"W4220834208","doi":"10.1145/3508398.3511507","title":"A TOCTOU Attack on DICE Attestation","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"Microsoft (Canada)","funders":"","keywords":"Firmware; Computer science; Malware; Dice; Reboot; Embedded system; Operating system; Microcontroller; Computer security; Computer hardware","score_opus":0.10956518141745848,"score_gpt":0.3529937583568521,"score_spread":0.24342857693939363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220834208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015900563,0.00005794445,0.91434866,0.0046598143,0.002878957,0.00039393033,0.000007442037,0.0007666413,0.06098606],"genre_scores_gemma":[0.86520654,0.000039786562,0.12416058,0.006275282,0.0004675738,0.00024167604,0.00011553031,0.000030079229,0.0034629446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827707,0.00013513619,0.00026974847,0.0006988023,0.00043642754,0.00018279752],"domain_scores_gemma":[0.99830085,0.0002841244,0.00019402141,0.001093053,0.00006931949,0.000058624923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003799193,0.00016621136,0.00014883853,0.00013496212,0.00022501065,0.00031158337,0.0015699568,0.0000929395,0.00047886706],"category_scores_gemma":[0.00006199462,0.00017768964,0.000089537134,0.00025299104,0.000016521646,0.000114425224,0.001930931,0.00062808086,0.00020953422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001134247,0.00031282744,0.00042992915,0.00015522007,0.0000504193,0.000022394024,0.004750968,0.068613544,0.000028515004,0.8233718,0.04769557,0.05455743],"study_design_scores_gemma":[0.00024624594,0.00014244035,0.0042839227,0.00008125933,0.000008517451,0.000008107408,0.00011874721,0.828314,0.0002894057,0.017761331,0.14808697,0.0006590266],"about_ca_topic_score_codex":0.000048321195,"about_ca_topic_score_gemma":0.0000031719046,"teacher_disagreement_score":0.849306,"about_ca_system_score_codex":0.00013990955,"about_ca_system_score_gemma":0.00013778407,"threshold_uncertainty_score":0.72459733},"labels":[],"label_agreement":null},{"id":"W4223911053","doi":"10.1145/3563943","title":"Towards Porting Operating Systems with Program Synthesis","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Security and Verification in Computing","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 British Columbia","funders":"U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Eidgenössische Technische Hochschule Zürich; U.S. Department of Defense","keywords":"Computer science; Toolchain; Porting; Software portability; Scalability; Programming language; Code generation; Abstract machine; Program synthesis; Operating system; Embedded system; Computer architecture; Software engineering; Software","score_opus":0.024968235120783455,"score_gpt":0.28987154523197606,"score_spread":0.2649033101111926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223911053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06666599,0.0021133542,0.9257687,0.00068931346,0.00093649124,0.0016919074,0.000015721831,0.001471865,0.00064668234],"genre_scores_gemma":[0.95832187,0.0000090280555,0.039928433,0.000039736642,0.000066262015,0.0014793661,0.0000036586762,0.00002120157,0.00013041477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801534,0.00024163988,0.00039254042,0.0005169584,0.00046919467,0.00036435225],"domain_scores_gemma":[0.99871385,0.00022597678,0.00019867094,0.00068064075,0.0000757868,0.00010507987],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088849897,0.00019262124,0.00025352917,0.00015031606,0.001368303,0.0009440561,0.0006892503,0.000047295176,0.000008047994],"category_scores_gemma":[0.000044791625,0.00016561875,0.00005766567,0.00055664626,0.00003946963,0.00024004429,0.000050594466,0.000325768,0.0000022596168],"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.000009592301,0.0002603686,0.00024979448,0.00020922933,0.00009711281,0.000060543134,0.0041647404,0.019582825,0.00006372642,0.0053906767,0.000016009837,0.96989536],"study_design_scores_gemma":[0.0012008414,0.0023898608,0.0005315032,0.00075095304,0.00014759743,0.0027511732,0.08104095,0.8509525,0.0007510486,0.000048221493,0.057774443,0.0016608802],"about_ca_topic_score_codex":0.0006996883,"about_ca_topic_score_gemma":0.0000067396945,"teacher_disagreement_score":0.9682345,"about_ca_system_score_codex":0.000075806776,"about_ca_system_score_gemma":0.00006561698,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W4224259412","doi":"10.14722/ndss.2024.24105","title":"BliMe: Verifiably Secure Outsourced Computation with Hardware-Enforced Taint Tracking","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Amazon Web Services","keywords":"Computer science; Encryption; Embedded system; Cryptography; Overhead (engineering); Operating system; Computer security; Computer network","score_opus":0.026362553618327237,"score_gpt":0.27573513972137126,"score_spread":0.24937258610304402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224259412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016784422,0.00038109758,0.96486235,0.002083855,0.002000985,0.0006423256,0.000012247783,0.0020829947,0.0111497175],"genre_scores_gemma":[0.9061956,0.000015680745,0.091994986,0.0005532272,0.00037084267,0.000057896716,0.000087658744,0.00005490816,0.00066924264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648803,0.000114647366,0.0006556509,0.0014667297,0.0007686928,0.0005062526],"domain_scores_gemma":[0.99773526,0.00018475209,0.0003672429,0.0011183642,0.00041110828,0.00018326372],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006139453,0.0005383913,0.00049001124,0.0004037808,0.00027848125,0.0022399789,0.0016437271,0.00040382927,0.00004547954],"category_scores_gemma":[0.00004455299,0.00047483278,0.00021290267,0.00072208093,0.00008278841,0.00028252212,0.002156405,0.0015387255,0.00020849651],"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.00006658917,0.00020296125,0.00013710845,0.0021618519,0.0006821343,0.00015921773,0.03117799,0.45553392,0.0006224423,0.37322402,0.011682108,0.124349646],"study_design_scores_gemma":[0.00025865628,0.000086390486,0.00016767938,0.00064602145,0.000050718918,0.000056076828,0.00035220425,0.9705395,0.0017840528,0.020345133,0.004924471,0.0007890799],"about_ca_topic_score_codex":0.00012080589,"about_ca_topic_score_gemma":0.000011713124,"teacher_disagreement_score":0.88941115,"about_ca_system_score_codex":0.0002303934,"about_ca_system_score_gemma":0.0005044583,"threshold_uncertainty_score":0.99977034},"labels":[],"label_agreement":null},{"id":"W4225538569","doi":"10.1145/3510457.3513050","title":"Towards build verifiability for Java-based systems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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":"York University; Huawei Technologies (Canada)","funders":"","keywords":"Java; Computer science; Software engineering; Process (computing); Open source; Software; Software system; Programming language","score_opus":0.05388924791237165,"score_gpt":0.31272970174922077,"score_spread":0.2588404538368491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225538569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019243162,0.00024402497,0.98307073,0.0015295938,0.006576214,0.0011738642,0.000059214733,0.0007095525,0.004712511],"genre_scores_gemma":[0.76921684,0.0000060470143,0.22774865,0.0007455047,0.00043020892,0.0012854034,0.00012055147,0.00002838835,0.0004184407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.00021610707,0.0005356464,0.0011020746,0.0004805454,0.00032891246],"domain_scores_gemma":[0.9969455,0.00038798995,0.000286371,0.0020377126,0.00023816053,0.00010424873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016268791,0.00025971947,0.00036525144,0.00012988877,0.00033420126,0.0005658393,0.0028096414,0.00020457717,0.00011393395],"category_scores_gemma":[0.00017755086,0.00027185373,0.00026985904,0.00024508915,0.000041456562,0.000103549624,0.0018684722,0.0005208989,0.000010391932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035262066,0.00045648048,0.0007856819,0.002465842,0.00010455513,0.0000050939016,0.0010346303,0.16907136,0.000049387174,0.79778016,0.014312947,0.013898588],"study_design_scores_gemma":[0.0002216568,0.00005419723,0.0002973222,0.00003455586,0.0000085437205,0.0000015449988,0.000038972354,0.89432937,0.0003633707,0.0070847715,0.097214736,0.00035095107],"about_ca_topic_score_codex":0.00050283584,"about_ca_topic_score_gemma":0.0000031030931,"teacher_disagreement_score":0.79069537,"about_ca_system_score_codex":0.00030843052,"about_ca_system_score_gemma":0.00081284373,"threshold_uncertainty_score":0.99997336},"labels":[],"label_agreement":null},{"id":"W4226074176","doi":"10.1007/978-3-030-99253-8_19","title":"Complete and tractable machine-independent characterizations of second-order polytime","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Order (exchange); Completeness (order theory); Polynomial; Algorithm; Computer science; Type (biology); Characterization (materials science); Discrete mathematics; Artificial intelligence; Mathematics; Physics; Finance","score_opus":0.019633193197427727,"score_gpt":0.23999419098161007,"score_spread":0.22036099778418233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226074176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004439143,0.0005005251,0.9932363,0.0007300679,0.0011383989,0.00033347757,0.00006429798,0.00010300535,0.003449997],"genre_scores_gemma":[0.6397709,0.00014768669,0.35625952,0.0023958595,0.00037325858,0.000023816792,0.00008214375,0.000071522714,0.0008752906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967908,0.00005585305,0.0006547647,0.0012100266,0.00084314257,0.0004453866],"domain_scores_gemma":[0.99756825,0.0004741665,0.0005043228,0.0010975703,0.00021626765,0.00013944105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037705,0.0003829324,0.0005139643,0.00075381575,0.0004604453,0.0003215256,0.0023412572,0.00017258868,0.00043260262],"category_scores_gemma":[0.000056689412,0.0004057625,0.000087354274,0.00072504097,0.00043096862,0.0006526328,0.0016756477,0.00081340596,0.00000981335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022014518,0.00023695502,0.00053824316,0.0003129582,0.00008174943,0.00009129034,0.0069187935,0.024212118,0.0066005685,0.42283177,0.000039927974,0.5381136],"study_design_scores_gemma":[0.00050534954,0.00022293624,0.0016622443,0.00019089748,0.000014877941,0.00024104599,8.420602e-7,0.9296972,0.0009741268,0.045168538,0.020394769,0.0009271645],"about_ca_topic_score_codex":0.000045544308,"about_ca_topic_score_gemma":0.00004678767,"teacher_disagreement_score":0.9054851,"about_ca_system_score_codex":0.00015550636,"about_ca_system_score_gemma":0.00045974873,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W4229515876","doi":"10.1145/2954679.2872395","title":"LDX","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Overhead (engineering); Determinism; Causality (physics); Event (particle physics); Scheme (mathematics); Programming language","score_opus":0.03440186732557786,"score_gpt":0.26521696658363564,"score_spread":0.23081509925805777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229515876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20937411,0.0002514186,0.75235724,0.022133783,0.0018223784,0.00013718216,0.0000046068876,0.000805602,0.013113687],"genre_scores_gemma":[0.9680399,0.000007196099,0.031070432,0.0005000223,0.00015285419,0.0000027302399,4.4786097e-7,0.0000034497205,0.00022298175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992897,0.00003506433,0.0001223628,0.00023713325,0.000146873,0.00016890121],"domain_scores_gemma":[0.99850607,0.0005953008,0.00006694276,0.00074039854,0.0000368876,0.000054399625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018284774,0.00006645279,0.00006640901,0.00004417444,0.00009843583,0.00009809792,0.0014462017,0.000033987177,0.00005349959],"category_scores_gemma":[0.0002818503,0.000044243,0.000025298428,0.0001381745,0.000029530956,0.00041051718,0.00026575665,0.000039493312,0.00055602856],"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.000007603376,0.00007572403,0.011111113,0.000023001756,0.000027693455,0.000020967349,0.0019644955,0.000023253104,0.0067689563,0.5301059,0.011765395,0.43810588],"study_design_scores_gemma":[0.0021788913,0.00035166086,0.09829841,0.0003496491,0.000026398819,0.000077113866,0.00019125573,0.025784057,0.069828585,0.1342942,0.6669495,0.0016702486],"about_ca_topic_score_codex":0.000010544075,"about_ca_topic_score_gemma":0.0000036565364,"teacher_disagreement_score":0.75866574,"about_ca_system_score_codex":0.0000130904245,"about_ca_system_score_gemma":0.00002239803,"threshold_uncertainty_score":0.7146808},"labels":[],"label_agreement":null},{"id":"W4230181058","doi":"10.1007/978-1-4419-6655-1_1","title":"Introduction","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in information security","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.006337780090653601,"score_gpt":0.23590711724055943,"score_spread":0.22956933714990582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230181058","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.000016799622,0.0007266392,0.21107344,0.0017020458,0.0046225376,0.00033145407,0.000013320571,0.00034212542,0.7811716],"genre_scores_gemma":[0.21162754,0.04483896,0.55839396,0.01773384,0.030750303,0.000587196,0.003865171,0.00036214254,0.13184085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984041,0.00001561396,0.00069069484,0.00029797346,0.0003885239,0.00020312566],"domain_scores_gemma":[0.9983388,0.00008529046,0.00053792476,0.0007625281,0.00021540774,0.000060041333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045051865,0.00023340771,0.0002366104,0.00037568685,0.00013504607,0.00019913797,0.0008297297,0.00035638304,0.00021957146],"category_scores_gemma":[0.00009711353,0.00026044677,0.00007524428,0.00013270321,0.00008528963,0.006421188,0.0002123584,0.0010020952,0.00064336794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028494162,0.000006016195,0.0000033874855,0.000048970567,0.0000026363236,6.425607e-7,0.0010770607,0.0000640305,0.000001207508,0.9482731,0.0007227591,0.049797326],"study_design_scores_gemma":[0.00011387712,0.000013113203,0.000011505951,0.000030056213,0.0000017174378,0.000013555247,0.000010240269,0.0032127316,0.00008672283,0.22685991,0.76942927,0.00021730983],"about_ca_topic_score_codex":0.0000037878478,"about_ca_topic_score_gemma":0.000022629347,"teacher_disagreement_score":0.7687065,"about_ca_system_score_codex":0.00010646756,"about_ca_system_score_gemma":0.00007912338,"threshold_uncertainty_score":0.9999848},"labels":[],"label_agreement":null},{"id":"W4230924300","doi":"10.1145/2189750.2150992","title":"Comprehensive kernel instrumentation via dynamic binary translation","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Security and Verification in Computing","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; Department of Biotechnology, Ministry of Science and Technology, India","keywords":"Binary translation; Computer science; sysfs; Configfs; Kernel (algebra); Instrumentation (computer programming); Operating system; Interrupt; Overhead (engineering); Linux kernel; Embedded system; Software","score_opus":0.028220689346858643,"score_gpt":0.28492613481261053,"score_spread":0.2567054454657519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230924300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13303423,0.00044974382,0.86142683,0.002674471,0.0014088706,0.0004068493,0.0000027968097,0.00041008438,0.00018614088],"genre_scores_gemma":[0.6309662,0.000018973364,0.36721408,0.0013070868,0.00041010705,0.000019288165,0.00003797936,0.000018522749,0.000007754128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973809,0.00035767778,0.0004775369,0.0006007604,0.0005187301,0.0006643962],"domain_scores_gemma":[0.99762,0.0006314983,0.00018538455,0.0012014338,0.00010624692,0.0002554717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028094868,0.00032886135,0.00027643683,0.00032292845,0.00034145633,0.00019093555,0.0016641391,0.00012976716,0.000019363037],"category_scores_gemma":[0.000020802037,0.0003248059,0.00015437487,0.00067164435,0.00009063095,0.00079475105,0.0006166124,0.00048650487,0.000107304215],"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.000024636272,0.00014140044,0.0011335583,0.000049474453,0.000043670363,0.0000040237815,0.009011337,0.004183526,0.004338292,0.0015339868,0.00029314193,0.979243],"study_design_scores_gemma":[0.0019039027,0.00053386565,0.06350434,0.00009763139,0.000030511736,0.00032476033,0.0000896253,0.8525058,0.0021975073,0.017997963,0.059668545,0.0011455213],"about_ca_topic_score_codex":0.000042733725,"about_ca_topic_score_gemma":0.000011258386,"teacher_disagreement_score":0.97809744,"about_ca_system_score_codex":0.00009902814,"about_ca_system_score_gemma":0.000059492733,"threshold_uncertainty_score":0.9999204},"labels":[],"label_agreement":null},{"id":"W4232571550","doi":"10.1145/1041685.1029900","title":"Automating comprehensive safety analysis of concurrent programs using verisoft and TXL","year":2004,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Security and Verification in Computing","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":"Instrumentation (computer programming); Computer science; Flexibility (engineering); Programming language; Static analysis; Software; Program analysis; Static program analysis; Code (set theory); Program transformation; Software engineering; Dynamic program analysis; Source code; Software development; Set (abstract data type)","score_opus":0.03670120704736915,"score_gpt":0.2736429971604598,"score_spread":0.23694179011309066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232571550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49391806,0.00043773677,0.5049901,0.000032461157,0.000166623,0.000091286645,0.0000052566256,0.00035829053,2.1101476e-7],"genre_scores_gemma":[0.7022119,0.000011182679,0.2976972,0.000024297196,0.000025696707,0.0000041122103,0.000014604351,0.000010784068,1.8428143e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99855965,0.000024472984,0.00045052197,0.00040759463,0.0002636621,0.0002941163],"domain_scores_gemma":[0.9918214,0.007105793,0.00020059307,0.0005982286,0.0001726239,0.00010136558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017453774,0.00021430424,0.00040100337,0.00030268892,0.00014658461,0.00010926563,0.0006273009,0.0000842647,0.0000032106175],"category_scores_gemma":[0.007880689,0.00023397885,0.00012807676,0.0013523954,0.000056164346,0.0002904339,0.0004205841,0.00016915427,0.0000014170469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007455286,0.00021106814,0.33140352,0.0006137838,0.0011358928,0.000017123966,0.0082227895,0.49404937,0.007339045,0.015786752,0.0000023901962,0.1412108],"study_design_scores_gemma":[0.0009402334,0.00014333581,0.5255171,0.0005650618,0.00040373753,0.000037096826,0.000077676086,0.46455318,0.006442757,0.00014812977,0.00031321892,0.00085847505],"about_ca_topic_score_codex":0.00008060099,"about_ca_topic_score_gemma":0.000002354259,"teacher_disagreement_score":0.20829388,"about_ca_system_score_codex":0.000079576435,"about_ca_system_score_gemma":0.000058554113,"threshold_uncertainty_score":0.95413804},"labels":[],"label_agreement":null},{"id":"W4234904854","doi":"10.1007/978-90-481-3662-9_73","title":"The Authentication Framework within the Java Data Security Framework (JDSF): Design and Implementation Refinement","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Security and Verification in Computing","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Authentication (law); Data integrity; Java; Confidentiality; SQL; Computer security; Database; Programming language","score_opus":0.0630082822329513,"score_gpt":0.328584167160877,"score_spread":0.2655758849279257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234904854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000009908812,0.0010360463,0.96949494,0.0171904,0.00072001,0.0009240187,0.000011431153,0.00018328027,0.010429955],"genre_scores_gemma":[0.039781127,0.0028232576,0.9231984,0.0077645546,0.0015958913,0.00010145051,0.00029676728,0.00009706712,0.024341466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972611,0.0001777874,0.0007090368,0.0009055384,0.0006566286,0.000289929],"domain_scores_gemma":[0.99399346,0.0017795147,0.00065204914,0.003329716,0.00015904514,0.00008620363],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027368672,0.00033558963,0.00021679416,0.000066921595,0.0012094532,0.0010761515,0.0032189977,0.00031616984,0.000086409025],"category_scores_gemma":[0.00018281233,0.0002143828,0.000056085824,0.00012608858,0.0001678724,0.00033059344,0.0010300098,0.00086748926,0.000052919542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004745053,0.000009883455,0.000002319111,0.0000083886725,0.00004124585,7.435453e-7,0.0021106582,0.000013796134,0.0000011004705,0.9252419,0.004125694,0.068439566],"study_design_scores_gemma":[0.00007919429,0.000056329864,0.00006725469,0.00012254388,0.000044162356,0.000009661829,0.00015330983,0.058780037,0.000034904326,0.8322486,0.10812844,0.00027551732],"about_ca_topic_score_codex":0.000026767157,"about_ca_topic_score_gemma":0.00002613171,"teacher_disagreement_score":0.10400275,"about_ca_system_score_codex":0.00007427601,"about_ca_system_score_gemma":0.0001654984,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W4235270001","doi":"10.1145/2248487.2150992","title":"Comprehensive kernel instrumentation via dynamic binary translation","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Computer science; Binary translation; sysfs; Configfs; Kernel (algebra); Instrumentation (computer programming); Operating system; Interrupt; Overhead (engineering); Call stack; Address space; Linux kernel; Embedded system; Stack (abstract data type); Software","score_opus":0.04684233178849168,"score_gpt":0.2998771654583499,"score_spread":0.25303483366985824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235270001","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.74058354,0.000755694,0.25546256,0.0010264689,0.0011664508,0.00017903297,0.0000031645475,0.00024924058,0.00057384354],"genre_scores_gemma":[0.9407584,0.00001549071,0.05873254,0.00033861297,0.000098651035,0.000006381239,0.00003305938,0.000006683304,0.000010160179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.000090601534,0.00021410406,0.00022125413,0.00021321484,0.00024730756],"domain_scores_gemma":[0.9989437,0.00034300785,0.0001347721,0.00045126723,0.000048584836,0.00007869882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016347399,0.00011498898,0.00010233355,0.00009477766,0.00018492555,0.000102352744,0.00066566234,0.000060949933,0.00002145042],"category_scores_gemma":[0.000022698569,0.00011860015,0.000037400743,0.000264875,0.000032451437,0.0012570593,0.00010677128,0.00010810177,0.00015705991],"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.000064872496,0.00047574163,0.025796112,0.00022853218,0.000109599,0.000007922796,0.033171717,0.0029917022,0.028148754,0.021952821,0.00048327402,0.88656896],"study_design_scores_gemma":[0.00087572075,0.00017142794,0.21328527,0.00005225919,0.000031783213,0.00003614987,0.00060431054,0.76507324,0.003990671,0.00338978,0.0119079705,0.0005813953],"about_ca_topic_score_codex":0.000030332123,"about_ca_topic_score_gemma":0.000005055139,"teacher_disagreement_score":0.8859876,"about_ca_system_score_codex":0.00003562174,"about_ca_system_score_gemma":0.000017634768,"threshold_uncertainty_score":0.48363736},"labels":[],"label_agreement":null},{"id":"W4239027988","doi":"10.1145/1035292.1029010","title":"Pluggable verification modules","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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":"Computer science; Bytecode; Modular design; Programming language; Java; Extensibility; Operating system; Embedded system","score_opus":0.03169006507966655,"score_gpt":0.26264096082002336,"score_spread":0.23095089574035682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239027988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3624208,0.00034558514,0.6255103,0.0050219162,0.0009380792,0.00017376029,0.0000034182365,0.0006451525,0.0049410015],"genre_scores_gemma":[0.8831007,0.000010930511,0.116378635,0.0003379737,0.00011436054,0.000007079382,0.000007144376,0.0000052390446,0.000037936094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905825,0.00002834555,0.00018018234,0.00032769205,0.00020398265,0.00020156686],"domain_scores_gemma":[0.998702,0.00014669166,0.00010675313,0.0009232089,0.0000588594,0.00006248039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020794645,0.00009633082,0.00009174352,0.00007010397,0.0002093896,0.00022688716,0.0014535496,0.000054349126,0.000014957292],"category_scores_gemma":[0.00017732475,0.000096255615,0.000031937318,0.00028369896,0.000033941673,0.00060245965,0.0001782556,0.000095570154,0.0003120218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008874538,0.0001806337,0.0009936972,0.000050394257,0.000027604816,0.000012722431,0.005053045,0.020653348,0.004003212,0.93476105,0.0010106793,0.033244718],"study_design_scores_gemma":[0.0034638015,0.000462739,0.092488654,0.00030988676,0.000054651802,0.00009805636,0.0010257808,0.22162649,0.14362557,0.4176059,0.11694562,0.002292861],"about_ca_topic_score_codex":0.000093773306,"about_ca_topic_score_gemma":0.000010818229,"teacher_disagreement_score":0.5206799,"about_ca_system_score_codex":0.00004110895,"about_ca_system_score_gemma":0.00004736704,"threshold_uncertainty_score":0.40105128},"labels":[],"label_agreement":null},{"id":"W4241329895","doi":"10.22215/etd/2012-07056","title":"Towards a theory of software diversity for security","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Diversity (politics); Computer science; Political science; Law","score_opus":0.034912665238466103,"score_gpt":0.28181128671332367,"score_spread":0.24689862147485758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241329895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016551727,0.00039002695,0.972063,0.00003470576,0.001896216,0.00034547705,0.000023467732,0.00020528492,0.008490106],"genre_scores_gemma":[0.9255579,0.000014573333,0.07225104,0.00009274199,0.00017728427,0.000022154682,0.00019227043,0.000012757165,0.0016792695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.0000552014,0.00023641359,0.00029291536,0.0002469106,0.00019676685],"domain_scores_gemma":[0.9986553,0.00026220217,0.00026847736,0.00044575578,0.00030651377,0.00006172205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004317,0.0001475416,0.00022953941,0.00009952619,0.00024832934,0.00003455944,0.0010960461,0.00021025914,0.000069299174],"category_scores_gemma":[0.00015544156,0.00014590731,0.00017661262,0.00016608596,0.000020471003,0.00024068408,0.00029501176,0.00013776576,0.000008679558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042229152,0.00012870147,0.00044943616,0.0005796824,0.0000646881,2.6628823e-7,0.01927919,0.0000020997552,0.000023673263,0.9004389,0.0015296078,0.0774615],"study_design_scores_gemma":[0.0010912542,0.00021423517,0.04421965,0.00032221994,0.00020103727,0.000005760236,0.0031651733,0.006159172,0.019307183,0.9119567,0.0119394595,0.0014181545],"about_ca_topic_score_codex":0.000053377393,"about_ca_topic_score_gemma":0.000023742778,"teacher_disagreement_score":0.9090062,"about_ca_system_score_codex":0.000031228516,"about_ca_system_score_gemma":0.00011937993,"threshold_uncertainty_score":0.59499276},"labels":[],"label_agreement":null},{"id":"W4245120523","doi":"10.32920/ryerson.14645904.v1","title":"Hardware Assisted Security Platform","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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; Embedded system; Exploit; Software; Buffer overflow; Vulnerability (computing); Hardware security module; Software security assurance; Security analysis; Cryptography; Computer security; Computer hardware; Operating system; Security service; Information security","score_opus":0.05705392081649299,"score_gpt":0.28850139910008415,"score_spread":0.23144747828359116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245120523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034,0.00046157037,0.9384942,0.0013754213,0.0034486419,0.0002234292,0.0000065630743,0.0009987453,0.03465145],"genre_scores_gemma":[0.8751212,0.000042942545,0.12320736,0.00085001544,0.00026634042,0.00002780732,0.000087375636,0.0000137922325,0.00038315752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978969,0.000067335,0.00040736498,0.00091690343,0.0004185866,0.00029291777],"domain_scores_gemma":[0.997567,0.0001211672,0.0002148905,0.0016765192,0.00029382916,0.00012661083],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036747422,0.0002556373,0.0003176368,0.0001066896,0.00018291586,0.0011759377,0.0020240564,0.0003605791,0.00019120902],"category_scores_gemma":[0.000085252825,0.00026576212,0.00021832621,0.00031019474,0.000031439915,0.0003272159,0.0037673493,0.0008443702,0.00006080973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009213625,0.0008169585,0.0010749091,0.0012355399,0.00043132278,0.0002989357,0.020437568,0.0014488498,0.00020212989,0.77063155,0.032282736,0.17113027],"study_design_scores_gemma":[0.000543984,0.000039086593,0.008449312,0.00059211836,0.000034705958,0.00015901054,0.00068552775,0.88313884,0.0060631274,0.05468215,0.04380407,0.0018080503],"about_ca_topic_score_codex":0.000117795345,"about_ca_topic_score_gemma":0.000036636568,"teacher_disagreement_score":0.88169,"about_ca_system_score_codex":0.00011290838,"about_ca_system_score_gemma":0.0003978386,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4247760966","doi":"10.1109/icse.1998.671109","title":"Techniques for trusted software engineering","year":2002,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"","keywords":"Computer science; Software engineering; Trusted Platform Module; Software construction; Computer security; Software development; Software; Trusted Computing; Operating system","score_opus":0.030776470686896863,"score_gpt":0.2340056820900963,"score_spread":0.20322921140319944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247760966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0004089258,0.000043674107,0.9970867,0.00035556545,0.00013329645,0.00010547079,3.5995376e-7,0.0010476522,0.0008183418],"genre_scores_gemma":[0.16951212,0.0000031089442,0.82985175,0.00025925736,0.00006663131,0.000025900175,4.763978e-7,0.0000042551346,0.0002765171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995778,0.000004181696,0.000095201336,0.00014677903,0.000059570415,0.00011641909],"domain_scores_gemma":[0.99957496,0.00011924312,0.000020515618,0.00021638296,0.000040919607,0.00002795835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082977254,0.00004980721,0.00005064133,0.000048129496,0.000061433566,0.00007192993,0.0003410551,0.000031288117,0.000032256004],"category_scores_gemma":[0.00009078258,0.00004891954,0.000031146257,0.00015098593,0.0000044139524,0.00016345116,0.000046433874,0.000037435435,0.000016089312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.801396e-7,0.000073488634,0.00023940169,0.000059021528,0.0000140569555,0.0000016083037,0.0010730093,0.00020007347,0.000778641,0.59822226,0.021016113,0.37832132],"study_design_scores_gemma":[0.00007478625,0.000025803936,0.00009887694,0.000009848868,9.4085703e-7,0.0000062389254,0.000004603249,0.90710646,0.013875606,0.0006192996,0.078062326,0.00011518746],"about_ca_topic_score_codex":0.0000015678944,"about_ca_topic_score_gemma":1.4359246e-7,"teacher_disagreement_score":0.9069064,"about_ca_system_score_codex":0.00001266876,"about_ca_system_score_gemma":0.000002984644,"threshold_uncertainty_score":0.1994881},"labels":[],"label_agreement":null},{"id":"W4249463296","doi":"10.1145/2775054.2694380","title":"Protecting Data on Smartphones and Tablets from Memory Attacks","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","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; University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Dram; Code (set theory); Class (philosophy); Operating system; Memory protection; Computer hardware; Physical address; Memory management; Semiconductor memory; Virtual memory; Programming language","score_opus":0.17160734725140128,"score_gpt":0.3224399001503169,"score_spread":0.15083255289891564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249463296","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.9435481,0.00080799,0.0450578,0.005467496,0.0015710966,0.00034183273,0.000037243823,0.00045734557,0.0027110912],"genre_scores_gemma":[0.94968,0.0000044992435,0.049379826,0.000530398,0.00032203685,0.000005007096,0.000029085499,0.000007467425,0.00004169979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987176,0.000119222736,0.00017583884,0.0005407303,0.00025640338,0.00019020257],"domain_scores_gemma":[0.99717337,0.0009181791,0.00013196905,0.0016100714,0.000051891442,0.00011452792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161425,0.00011664779,0.00012915974,0.000052925792,0.00020722947,0.00033791192,0.0020357722,0.000057120695,0.000007583916],"category_scores_gemma":[0.0011939429,0.00010734496,0.0000100533125,0.00016113523,0.000036866935,0.00068929,0.0011949784,0.00019720988,0.00008456827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024041405,0.00068240036,0.036804784,0.00029109733,0.00032032712,0.0002376586,0.07283261,0.003911156,0.004978475,0.0135537,0.07407238,0.792075],"study_design_scores_gemma":[0.0025046081,0.0004793045,0.02595702,0.00043531152,0.00005590691,0.000053253378,0.003396417,0.8554562,0.01667294,0.017731635,0.075751394,0.0015060502],"about_ca_topic_score_codex":0.00046305492,"about_ca_topic_score_gemma":0.00005348134,"teacher_disagreement_score":0.851545,"about_ca_system_score_codex":0.000014694692,"about_ca_system_score_gemma":0.00005291418,"threshold_uncertainty_score":0.43774003},"labels":[],"label_agreement":null},{"id":"W4249681596","doi":"10.1145/2980024.2872395","title":"LDX","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Overhead (engineering); Compiler; Causality (physics); Determinism; Event (particle physics); Scheme (mathematics); Inference; Real-time computing; Distributed computing; Programming language; Artificial intelligence","score_opus":0.019196138216210405,"score_gpt":0.25284261516505774,"score_spread":0.23364647694884733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249681596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.010745957,0.00007137332,0.9633856,0.022805644,0.0010639488,0.00020479324,0.0000023013417,0.0006448597,0.0010755473],"genre_scores_gemma":[0.43822706,0.000019975483,0.55648124,0.0037722986,0.0012649602,0.000022004706,0.0000020048751,0.000023844716,0.00018664739],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975178,0.00021715689,0.00037394842,0.0008284527,0.00047241183,0.000590211],"domain_scores_gemma":[0.99611336,0.0011791501,0.00012101592,0.0022418823,0.00010895879,0.00023563037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034765658,0.00026845426,0.00024539515,0.00023053354,0.00023577204,0.00021644309,0.0038523877,0.000098176955,0.000045284763],"category_scores_gemma":[0.00018937656,0.0001800402,0.00015242469,0.0004866522,0.00011084164,0.00031773062,0.0017682133,0.00027137558,0.0003041897],"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.0000069400903,0.00004381314,0.0006457744,0.000009919101,0.00002231174,0.000016502516,0.0010810302,0.00012745637,0.0019850999,0.030825924,0.0064467555,0.95878845],"study_design_scores_gemma":[0.0023332196,0.0005703567,0.012237692,0.00027385674,0.00001285258,0.00041655105,0.000011985235,0.023050709,0.010524827,0.25831178,0.690796,0.0014601398],"about_ca_topic_score_codex":0.000020595799,"about_ca_topic_score_gemma":0.000012135243,"teacher_disagreement_score":0.9573283,"about_ca_system_score_codex":0.000057892343,"about_ca_system_score_gemma":0.00009958944,"threshold_uncertainty_score":0.73418266},"labels":[],"label_agreement":null},{"id":"W4253243307","doi":"10.32920/ryerson.14645904","title":"Hardware Assisted Security Platform","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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; Embedded system; Exploit; Software; Vulnerability (computing); Buffer overflow; Hardware security module; Software security assurance; Cryptography; Computer security; Operating system; Security service; Information security","score_opus":0.05705392081649299,"score_gpt":0.28850139910008415,"score_spread":0.23144747828359116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253243307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034,0.00046157037,0.9384942,0.0013754213,0.0034486419,0.0002234292,0.0000065630743,0.0009987453,0.03465145],"genre_scores_gemma":[0.8751212,0.000042942545,0.12320736,0.00085001544,0.00026634042,0.00002780732,0.000087375636,0.0000137922325,0.00038315752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978969,0.000067335,0.00040736498,0.00091690343,0.0004185866,0.00029291777],"domain_scores_gemma":[0.997567,0.0001211672,0.0002148905,0.0016765192,0.00029382916,0.00012661083],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036747422,0.0002556373,0.0003176368,0.0001066896,0.00018291586,0.0011759377,0.0020240564,0.0003605791,0.00019120902],"category_scores_gemma":[0.000085252825,0.00026576212,0.00021832621,0.00031019474,0.000031439915,0.0003272159,0.0037673493,0.0008443702,0.00006080973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009213625,0.0008169585,0.0010749091,0.0012355399,0.00043132278,0.0002989357,0.020437568,0.0014488498,0.00020212989,0.77063155,0.032282736,0.17113027],"study_design_scores_gemma":[0.000543984,0.000039086593,0.008449312,0.00059211836,0.000034705958,0.00015901054,0.00068552775,0.88313884,0.0060631274,0.05468215,0.04380407,0.0018080503],"about_ca_topic_score_codex":0.000117795345,"about_ca_topic_score_gemma":0.000036636568,"teacher_disagreement_score":0.88169,"about_ca_system_score_codex":0.00011290838,"about_ca_system_score_gemma":0.0003978386,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4253753479","doi":"10.1145/2786763.2694380","title":"Protecting Data on Smartphones and Tablets from Memory Attacks","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Security and Verification in Computing","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 Toronto; University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Dram; Computer hardware; Code (set theory); Class (philosophy); Memory protection; Mobile device; Operating system; Computer security; Computer data storage; Registered memory; Extended memory","score_opus":0.09310083894900183,"score_gpt":0.30397310208659034,"score_spread":0.2108722631375885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253753479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.08937079,0.00028647078,0.8985042,0.009055445,0.0013089728,0.0004923698,0.00001744143,0.00047475478,0.00048956904],"genre_scores_gemma":[0.37420624,0.000010456035,0.6200593,0.0036415579,0.0019122552,0.000025888252,0.00006508804,0.000035517656,0.000043691634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663347,0.000474711,0.00040304827,0.0013600957,0.0006204095,0.0005082358],"domain_scores_gemma":[0.9941381,0.0015116615,0.00017687753,0.0036980258,0.000115348266,0.00035996333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009936597,0.0003359258,0.0003397937,0.00020021833,0.00036441255,0.00053720817,0.0044670627,0.000122043275,0.000006745133],"category_scores_gemma":[0.00065708626,0.0003004567,0.0000481922,0.0004313795,0.00010486761,0.0004438486,0.005133929,0.0008425711,0.000057950223],"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.00004724409,0.00010735792,0.0008239019,0.000030849285,0.0000638472,0.000046755973,0.010883707,0.0036891152,0.0004106388,0.00068945653,0.013318597,0.9698885],"study_design_scores_gemma":[0.0031688467,0.0008746231,0.006436525,0.00038396206,0.000030730713,0.00027693703,0.00025022475,0.76423585,0.0034845388,0.061144486,0.15809819,0.0016150688],"about_ca_topic_score_codex":0.00048256695,"about_ca_topic_score_gemma":0.000091917194,"teacher_disagreement_score":0.96827346,"about_ca_system_score_codex":0.000046582376,"about_ca_system_score_gemma":0.00016285678,"threshold_uncertainty_score":0.99994475},"labels":[],"label_agreement":null},{"id":"W4255311137","doi":"10.1109/mspec.2019.8651915","title":"Contributors","year":2019,"lang":"en","type":"article","venue":"IEEE Spectrum","topic":"Security and Verification in Computing","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 Standards Association","funders":"","keywords":"Computer science; Engineering","score_opus":0.00783130582733446,"score_gpt":0.2214516508183227,"score_spread":0.21362034499098823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255311137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3864948,0.00008923656,0.5762874,0.00451501,0.0054921512,0.00020691523,0.0000014168884,0.0005235153,0.026389584],"genre_scores_gemma":[0.9967044,0.0000027219148,0.00219399,0.00043896536,0.00014208844,0.0000010347162,4.7793986e-7,0.000003608442,0.00051268894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930197,0.000022372422,0.00011118429,0.00022802435,0.00013807716,0.00019834939],"domain_scores_gemma":[0.99938947,0.000059379472,0.000046821457,0.00044116008,0.000018511191,0.00004463917],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015557795,0.00006216681,0.000082139035,0.000045852208,0.00005737184,0.000100245285,0.00055858307,0.000033071665,0.00008465157],"category_scores_gemma":[0.000009194531,0.000061724284,0.00003958098,0.00021862407,0.00001114479,0.00018492994,0.00004996326,0.000091786205,0.0016846122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029276675,0.000039280934,0.0051087183,0.000008701595,0.000013160747,0.000006049894,0.00046507025,0.00021879977,0.0024976796,0.9848496,0.003437714,0.0033523322],"study_design_scores_gemma":[0.0017318564,0.00032085337,0.028134169,0.00005645031,0.000007172276,0.000088681285,0.000067559384,0.382192,0.2013349,0.10291491,0.28213555,0.0010159144],"about_ca_topic_score_codex":0.000014137339,"about_ca_topic_score_gemma":0.0000015878733,"teacher_disagreement_score":0.88193464,"about_ca_system_score_codex":0.00003161545,"about_ca_system_score_gemma":0.00003180254,"threshold_uncertainty_score":0.9990927},"labels":[],"label_agreement":null},{"id":"W4255411440","doi":"10.1145/1095810.1095826","title":"The taser intrusion recovery system","year":2005,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Process (computing); Computer security; Intrusion; Set (abstract data type); Intrusion detection system; File system; Operating system","score_opus":0.011422028983629266,"score_gpt":0.22488085013583095,"score_spread":0.2134588211522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255411440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063694003,0.00016437862,0.95411307,0.0059342454,0.00082921254,0.00007402308,1.963141e-7,0.0003530018,0.032162454],"genre_scores_gemma":[0.9612188,0.000016218417,0.036936883,0.0006709487,0.00028019628,0.0000048159886,3.9630086e-7,0.0000025815605,0.000869214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994479,0.000040922412,0.0001314077,0.0001408142,0.000122005054,0.00011695649],"domain_scores_gemma":[0.9993337,0.00016165983,0.000041393152,0.00039755332,0.0000367075,0.000029029885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037105478,0.00004273962,0.000037104695,0.000018409004,0.00034759173,0.00021899716,0.0005858326,0.000022988756,0.000009697909],"category_scores_gemma":[0.000020762536,0.00002711766,0.000025957435,0.00014482111,0.000012902179,0.00023017422,0.00014689456,0.000057259353,0.00033790842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013155221,0.0000074507875,0.000018217426,0.00000307409,0.000002773948,4.4557393e-7,0.0001440451,0.0002297007,0.00004989204,0.73962224,0.010180701,0.24974014],"study_design_scores_gemma":[0.00008671431,0.000015576008,0.00028750798,0.000014793799,9.842512e-7,0.000018909288,0.00011352389,0.5723046,0.0023297803,0.00090079685,0.4238344,0.000092371054],"about_ca_topic_score_codex":0.000009020927,"about_ca_topic_score_gemma":0.000006582642,"teacher_disagreement_score":0.95484936,"about_ca_system_score_codex":0.00004482004,"about_ca_system_score_gemma":0.000019964458,"threshold_uncertainty_score":0.4343242},"labels":[],"label_agreement":null},{"id":"W4256441423","doi":"10.4018/978-1-4666-1580-9.ch008","title":"Monitoring Buffer Overflow Attacks","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Security and Verification in Computing","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","funders":"","keywords":"Buffer overflow; Computer science; Computer security; Code (set theory); Set (abstract data type); Task (project management); Engineering; Operating system; Systems engineering","score_opus":0.04014330989878924,"score_gpt":0.27719322757799963,"score_spread":0.2370499176792104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256441423","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.000105925916,0.0018229495,0.037154324,0.000068132285,0.0036743735,0.00019271237,0.000013287636,0.00046717294,0.9565011],"genre_scores_gemma":[0.8644605,0.000056082732,0.032566816,0.0008408603,0.0067346664,0.000028835637,0.0000035809526,0.000107525906,0.0952011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979001,0.000023055069,0.00040672958,0.0006344188,0.0005427568,0.00049290113],"domain_scores_gemma":[0.9981424,0.00007138494,0.0002636225,0.0011503362,0.00013655979,0.0002356563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020329078,0.00041727416,0.00035604596,0.00006523046,0.00021257691,0.00029123542,0.0013741691,0.00044305922,0.000029808978],"category_scores_gemma":[0.000014453097,0.0004530509,0.00022195872,0.000029872608,0.000061405604,0.00018901087,0.0005969159,0.0004346862,0.0007190993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025530087,0.0000070386945,0.00014434438,0.000020887952,0.000039263105,0.000012450365,0.00012933929,0.000004142975,0.000009170057,0.95174813,0.0008789296,0.047003735],"study_design_scores_gemma":[0.0005179149,0.000089337576,0.0009140155,0.00080407155,0.00008247854,0.0001777085,0.000010180593,0.0013103572,0.00086863764,0.5712061,0.42220277,0.0018164102],"about_ca_topic_score_codex":0.00002316183,"about_ca_topic_score_gemma":0.0000017921436,"teacher_disagreement_score":0.8643546,"about_ca_system_score_codex":0.00029496138,"about_ca_system_score_gemma":0.00013656853,"threshold_uncertainty_score":0.9997921},"labels":[],"label_agreement":null},{"id":"W4281916312","doi":"10.1145/3470496.3527421","title":"Hydra","year":2022,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":48,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dram; Computer science; Scalability; Static random-access memory; Universal memory; Metadata; Dynamic random-access memory; Memory controller; Random access memory; CAS latency; Embedded system; Parallel computing; Computer hardware; Operating system; Memory management; Semiconductor memory","score_opus":0.014980024262180914,"score_gpt":0.22012030025424212,"score_spread":0.2051402759920612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281916312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006380949,0.000027740389,0.9298518,0.0025209787,0.00045017467,0.000027794968,1.6099426e-7,0.00025176388,0.060488652],"genre_scores_gemma":[0.9728751,2.9965403e-7,0.024937835,0.0014669929,0.000020290336,0.000007258319,3.5531102e-7,0.0000010254449,0.0006908261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996435,0.000026374399,0.00004964904,0.00010538083,0.00011197525,0.00006313477],"domain_scores_gemma":[0.9997267,0.000026544078,0.000014425367,0.00020886275,0.0000073356873,0.000016103579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393733,0.000019375437,0.00002068663,0.000024712619,0.00023822456,0.000036191817,0.00051641476,0.0000033550477,0.00031985823],"category_scores_gemma":[0.000004285149,0.000020404043,0.000013878106,0.00019962854,0.0000039428255,0.00007952058,0.0003540362,0.00005520095,0.00004721059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.8801065e-7,0.000015768162,0.000086683154,4.1371302e-7,9.741684e-7,0.0000014269016,0.0004162911,0.0004203953,0.00007141508,0.9794175,0.005637287,0.013931673],"study_design_scores_gemma":[0.00009116808,0.000030973897,0.00061084057,3.0517052e-7,3.5079594e-7,0.00002821171,0.00010712819,0.48459178,0.00071848015,0.018932695,0.49479526,0.00009280954],"about_ca_topic_score_codex":0.000007337075,"about_ca_topic_score_gemma":1.597638e-7,"teacher_disagreement_score":0.96649414,"about_ca_system_score_codex":0.000015462172,"about_ca_system_score_gemma":0.000015838792,"threshold_uncertainty_score":0.35022232},"labels":[],"label_agreement":null},{"id":"W4285120933","doi":"10.1007/978-3-030-97899-0_4","title":"Object State","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Security and Verification in Computing","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":"Computer science","score_opus":0.03056472580667212,"score_gpt":0.24100949163503618,"score_spread":0.21044476582836408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285120933","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.0000011453551,0.00016560881,0.15048036,0.00029040166,0.0007347208,0.000082732586,0.000003780626,0.0003286143,0.8479126],"genre_scores_gemma":[0.0006112289,0.000114550974,0.014812674,0.0010449485,0.00011122106,0.000006372913,0.000011886309,0.000021180605,0.98326594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988827,0.000014545264,0.00021508796,0.0004232819,0.00031877097,0.00014559588],"domain_scores_gemma":[0.9989796,0.00009331415,0.00013085165,0.00070297025,0.000042493793,0.000050731625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019956203,0.00015266587,0.00014852575,0.00011422543,0.00017664906,0.00012359665,0.0010985938,0.000058382924,0.0032644772],"category_scores_gemma":[0.0000061031024,0.00016042026,0.00009518326,0.000042600124,0.000021577172,0.00014145143,0.0006328549,0.00033819405,0.00043546702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.5773803e-7,0.0000033457939,5.459522e-7,0.000005549331,0.000011735026,0.000010486225,0.00018113511,0.000028257897,9.236882e-7,0.97241545,0.0064289276,0.020913178],"study_design_scores_gemma":[0.00004270715,0.000023770423,0.0000046507125,0.000007630371,0.0000020914788,0.000013225344,0.0000016185196,0.003428773,0.000017474165,0.10924684,0.88701266,0.00019855515],"about_ca_topic_score_codex":0.00001529116,"about_ca_topic_score_gemma":0.0000029269477,"teacher_disagreement_score":0.88058376,"about_ca_system_score_codex":0.00006993452,"about_ca_system_score_gemma":0.000110268586,"threshold_uncertainty_score":0.9976467},"labels":[],"label_agreement":null},{"id":"W4287577078","doi":"10.1007/978-3-031-02063-6_11","title":"Application-Aware Reliability and Security: The Trusted Illiac Experience","year":2022,"lang":"en","type":"book-chapter","venue":"Springer series in reliability engineering","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Computer security; Reliability (semiconductor); Physics","score_opus":0.008924028098407245,"score_gpt":0.21521947634160607,"score_spread":0.20629544824319881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287577078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11086287,0.01217173,0.6870988,0.021794857,0.017945385,0.014579933,0.00027800628,0.00845809,0.12681034],"genre_scores_gemma":[0.9772269,0.0011936132,0.015181332,0.00030275667,0.00039817728,0.00092046126,0.00003439493,0.00015832712,0.0045840377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967739,0.000064604064,0.00081877393,0.0013370066,0.00056039856,0.0004453466],"domain_scores_gemma":[0.9964469,0.00054280466,0.00024456286,0.0025113362,0.00013273605,0.00012166025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011893731,0.00050047936,0.0005009564,0.00017782654,0.0003610726,0.00020428601,0.0017626177,0.0002829977,0.00009423316],"category_scores_gemma":[0.00030623536,0.00048812357,0.00014223937,0.00031764898,0.00027999608,0.00061810954,0.0016670553,0.001348686,0.0000094994575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024882305,0.0000611126,0.001304512,0.0006533073,0.000032906562,0.000015843243,0.010426006,0.028242446,0.00004115341,0.9523082,0.00008870262,0.006800925],"study_design_scores_gemma":[0.00024455372,0.000069814356,0.0020574988,0.00016436166,0.000017616332,0.000044108547,0.00021502034,0.2716516,0.00014313894,0.026531734,0.697756,0.0011045791],"about_ca_topic_score_codex":0.000090915426,"about_ca_topic_score_gemma":0.000013815895,"teacher_disagreement_score":0.9257765,"about_ca_system_score_codex":0.00042274946,"about_ca_system_score_gemma":0.00010393707,"threshold_uncertainty_score":0.99975705},"labels":[],"label_agreement":null},{"id":"W4291972620","doi":"10.1145/3556977","title":"Practical Software-Based Shadow Stacks on x86-64","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Security and Verification in Computing","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":"Huawei Technologies (Canada)","funders":"Australian Research Council; University of New South Wales","keywords":"Computer science; x86; Spec#; Operating system; Call stack; Software; Backward compatibility; Embedded system; Stack (abstract data type); Programming language","score_opus":0.027011251141305884,"score_gpt":0.27515192098975494,"score_spread":0.24814066984844907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291972620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00038999887,0.000017365337,0.9882745,0.0102446135,0.0002797441,0.00021638264,0.000030211102,0.00032830343,0.00021885184],"genre_scores_gemma":[0.379411,0.000013880585,0.61677027,0.003549727,0.000033897755,0.00008821255,0.000026749658,0.000017641836,0.00008860476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985396,0.00020081954,0.00020205302,0.00047429043,0.00037862835,0.00020457405],"domain_scores_gemma":[0.9986079,0.0005150656,0.00009064021,0.0006517742,0.000044888184,0.00008974057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022753439,0.00015664876,0.00012126978,0.00023433554,0.0009908056,0.00014481167,0.00045974334,0.000056005065,0.00017588784],"category_scores_gemma":[0.00006938157,0.00016224373,0.00006390316,0.0005171357,0.000041685216,0.0001465543,0.0000308054,0.0005362894,0.000006037098],"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.00006317598,0.00019777486,0.000007786506,0.000007219961,0.000011888819,0.0000038696853,0.00044234298,0.9348261,0.000012103851,0.0023397817,0.00014023852,0.06194777],"study_design_scores_gemma":[0.00065109436,0.0005304509,0.000056571505,0.000016032885,0.00001831443,0.000046456225,0.000062540304,0.9868726,0.00059391337,0.0027910029,0.008093988,0.00026704447],"about_ca_topic_score_codex":0.000007932453,"about_ca_topic_score_gemma":0.000007230142,"teacher_disagreement_score":0.37902102,"about_ca_system_score_codex":0.00006392041,"about_ca_system_score_gemma":0.00011061762,"threshold_uncertainty_score":0.76205754},"labels":[],"label_agreement":null},{"id":"W4293235851","doi":"10.1145/3517193","title":"Bash in the Wild: Language Usage, Code Smells, and Bugs","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Security and Verification in Computing","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","keywords":"Computer science; Scripting language; Programming language; Unix; Software","score_opus":0.07204278200437231,"score_gpt":0.31282443255324427,"score_spread":0.24078165054887196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293235851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06888196,0.00040884773,0.9294396,0.00073578075,0.0003156258,0.00007553064,0.000006088084,0.00012831685,0.000008261048],"genre_scores_gemma":[0.50178844,0.00005806246,0.4974373,0.00061037514,0.000019931244,0.000045055545,0.0000013829682,0.0000068718773,0.000032574488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.0003799972,0.00012840753,0.0002489331,0.0001013373,0.00015895665],"domain_scores_gemma":[0.9970285,0.0025327613,0.00002471541,0.00037360398,0.000008372011,0.00003202425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012664534,0.000087657376,0.000118098855,0.00014747572,0.00022924198,0.00003496426,0.00044210593,0.000038634775,0.000011980784],"category_scores_gemma":[0.00024480402,0.000081282466,0.000024639206,0.00032288127,0.000024536821,0.00007170132,0.000036753674,0.00039299877,8.614764e-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.000036280395,0.00023958711,0.00090840744,0.000118388925,0.00007375808,0.00007921386,0.0624819,0.17395517,0.0013389149,0.019237734,0.00018749763,0.74134314],"study_design_scores_gemma":[0.0049730195,0.0017228835,0.047114708,0.00014977962,0.00014953065,0.0040587666,0.014257102,0.7029016,0.007670799,0.012204571,0.20218197,0.0026152716],"about_ca_topic_score_codex":0.000039140174,"about_ca_topic_score_gemma":0.000007432993,"teacher_disagreement_score":0.73872787,"about_ca_system_score_codex":0.000018315372,"about_ca_system_score_gemma":0.00001539804,"threshold_uncertainty_score":0.3314603},"labels":[],"label_agreement":null},{"id":"W4295290086","doi":"10.1145/3563037","title":"Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Privacy and Security","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":18,"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":"Agence Nationale de la Recherche; European Commission; Canadian Institute of Steel Construction","keywords":"Computer science; Erasure; Compiler; Constant (computer programming); Cryptography; Erasure code; Theoretical computer science; Binary number; Pointer (user interface); Programming language; Algorithm; Arithmetic; Decoding methods; Computer hardware; Mathematics","score_opus":0.019717759830781927,"score_gpt":0.25991028505996705,"score_spread":0.24019252522918513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295290086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30053315,0.0002933951,0.69095886,0.0057626483,0.00012812944,0.0014027179,0.00031819195,0.00047071007,0.0001321857],"genre_scores_gemma":[0.98070353,0.00005803662,0.01749451,0.0010187518,0.000036151956,0.00060534885,0.000023559487,0.000023762877,0.00003633843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981046,0.00015053002,0.00030499697,0.00078936596,0.00030880183,0.00034172751],"domain_scores_gemma":[0.9980506,0.00046898372,0.00010338767,0.0010148674,0.00012081966,0.00024136368],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004896691,0.00023958033,0.00027492899,0.0002634588,0.0017470028,0.00018123967,0.0008720731,0.000076447825,0.000046289948],"category_scores_gemma":[0.000029120813,0.00024558028,0.00007604578,0.000889473,0.000113615104,0.00032244535,0.00013678597,0.00043474807,0.00000781718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023261863,0.007299461,0.003259598,0.0012116559,0.0015439525,0.000077440694,0.17561737,0.011752013,0.0092785545,0.5768863,0.0049486784,0.2057988],"study_design_scores_gemma":[0.008057814,0.005063071,0.005667364,0.00019152675,0.00045586276,0.0009360627,0.0038873467,0.31165838,0.0037464437,0.24787034,0.40855694,0.0039088563],"about_ca_topic_score_codex":0.00004348612,"about_ca_topic_score_gemma":0.000023835193,"teacher_disagreement_score":0.6801704,"about_ca_system_score_codex":0.000064554195,"about_ca_system_score_gemma":0.0001154697,"threshold_uncertainty_score":0.99999964},"labels":[],"label_agreement":null},{"id":"W4295974633","doi":"10.1561/1000000051","title":"Secure Processors Part I: Background, Taxonomy for Secure Enclaves and Intel SGX Architecture","year":2017,"lang":"en","type":"article","venue":"Foundations and Trends® in Electronic Design Automation","topic":"Security and Verification in Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Architecture; Computer science; Computer security; Operating system; History","score_opus":0.06422840979328397,"score_gpt":0.31093188217477175,"score_spread":0.24670347238148777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295974633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013708139,0.00031865286,0.982868,0.0019215695,0.00015861946,0.00044588526,0.000004436827,0.00013445472,0.00044023865],"genre_scores_gemma":[0.94618,0.000069061,0.053061068,0.000063213476,0.000094878094,0.0003188478,0.0000444863,0.000011018714,0.00015746256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867177,0.00008168257,0.00028934292,0.00047034526,0.0001308148,0.00035603443],"domain_scores_gemma":[0.998901,0.00024851988,0.00028328507,0.00042224434,0.00008714193,0.000057783942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627374,0.00017568903,0.00017056543,0.00028132464,0.000930572,0.0009430055,0.00043902308,0.000104148545,0.000014753663],"category_scores_gemma":[0.00011040986,0.00017586596,0.000037533435,0.0002446703,0.000097325166,0.0009997059,0.000087063876,0.00021418996,0.0000031001885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002063451,0.00008711423,0.000279109,0.0000700047,0.00003840469,7.778307e-7,0.002339041,0.0007105275,0.000081336104,0.41338682,0.00046940648,0.58251685],"study_design_scores_gemma":[0.0012217959,0.00026944344,0.0069155465,0.00009904708,0.00002618086,0.000040939285,0.00016342949,0.8344386,0.00032446635,0.10661074,0.04944905,0.00044071334],"about_ca_topic_score_codex":0.000022067377,"about_ca_topic_score_gemma":0.00017126524,"teacher_disagreement_score":0.9324718,"about_ca_system_score_codex":0.000094809606,"about_ca_system_score_gemma":0.00013511583,"threshold_uncertainty_score":0.90934235},"labels":[],"label_agreement":null},{"id":"W4299648619","doi":"","title":"Proving reachability in B using substitution refinement","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Security and Verification in Computing","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 Sherbrooke","funders":"","keywords":"Reachability; Substitution (logic); Computer science; Theoretical computer science; Programming language","score_opus":0.018740596765073652,"score_gpt":0.24064481399845916,"score_spread":0.22190421723338552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299648619","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.51013386,0.000042092415,0.4799879,0.0026344205,0.00020022319,0.00015219138,9.776153e-7,0.00014059606,0.006707741],"genre_scores_gemma":[0.7899987,0.000007566055,0.2097412,0.00005039482,0.000014312775,0.000011577481,0.000008671191,0.0000064673377,0.00016110262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710494,0.001420394,0.00039634004,0.00053516135,0.0002755132,0.00026767148],"domain_scores_gemma":[0.996918,0.00060854683,0.00020943239,0.0014829889,0.0006871679,0.00009383308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006306466,0.000132963,0.00013913293,0.00015383368,0.00033043255,0.0002844468,0.0010675071,0.000099547055,0.000029634335],"category_scores_gemma":[0.0012920885,0.00014778449,0.000059184917,0.00065326324,0.00012758074,0.00042122474,0.00040610545,0.00038995247,0.000013954366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023237603,0.00044956594,0.009167373,0.000031469663,0.000005140399,0.0000022511936,0.0057167136,0.00010220661,0.038103774,0.8926524,0.000024641417,0.053742137],"study_design_scores_gemma":[0.00068603776,4.941077e-7,0.035738856,0.0004024868,0.0000066214766,0.000029118377,0.00008218075,0.82491845,0.115793504,0.009801786,0.012081908,0.00045856828],"about_ca_topic_score_codex":0.0012715288,"about_ca_topic_score_gemma":0.0019930825,"teacher_disagreement_score":0.8828506,"about_ca_system_score_codex":0.000099462006,"about_ca_system_score_gemma":0.00018696368,"threshold_uncertainty_score":0.60264766},"labels":[],"label_agreement":null},{"id":"W4308083593","doi":"10.1109/micro56248.2022.00022","title":"AQUA: Scalable Rowhammer Mitigation by Quarantining Aggressor Rows at Runtime","year":2022,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":46,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Row; Static random-access memory; Scalability; Indirection; Overhead (engineering); Swap (finance); Computer science; Engineering; Dram; Computer hardware; Operating system","score_opus":0.010114047632451328,"score_gpt":0.22297538023347807,"score_spread":0.21286133260102674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308083593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40132904,0.0009900879,0.5484968,0.007897001,0.0018448933,0.00040128766,0.000012055492,0.0010138729,0.038014997],"genre_scores_gemma":[0.975116,0.0000060291136,0.01722275,0.0014683453,0.0000662891,0.000043526466,0.000031646592,0.000011621536,0.006033781],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984513,0.00013227916,0.00026968334,0.0004367441,0.00042364927,0.0002863431],"domain_scores_gemma":[0.9991623,0.00012724061,0.00015723119,0.00044022858,0.000047187837,0.000065805296],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005500216,0.000110213834,0.000120248296,0.00007614695,0.0010173309,0.00015888899,0.0007883555,0.00003212425,0.0010547685],"category_scores_gemma":[0.00002468224,0.00012061108,0.000059072227,0.000521852,0.000026650589,0.0003728849,0.0006706842,0.00017077159,0.00025528052],"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.00003298196,0.00047851485,0.0068443664,0.00004367777,0.00008046539,0.000020973222,0.010008474,0.0065623946,0.020822648,0.20981428,0.6933948,0.05189644],"study_design_scores_gemma":[0.00051472033,0.00007647788,0.00061833335,0.0000126990835,0.000005519291,0.00003887171,0.00022666421,0.671489,0.019475123,0.0008867101,0.30628917,0.0003667033],"about_ca_topic_score_codex":0.00009867522,"about_ca_topic_score_gemma":0.0000047043827,"teacher_disagreement_score":0.66492665,"about_ca_system_score_codex":0.00009321014,"about_ca_system_score_gemma":0.000037556412,"threshold_uncertainty_score":0.9998584},"labels":[],"label_agreement":null},{"id":"W4316662528","doi":"10.1007/978-3-031-24950-1_13","title":"Sound Symbolic Execution via Abstract Interpretation and Its Application to Security","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"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":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); Canadian Institute of Steel Construction","keywords":"Soundness; Abstract interpretation; Computer science; Correctness; Symbolic execution; Interpretation (philosophy); Context (archaeology); Theoretical computer science; Static analysis; Symbolic data analysis; Programming language; Software","score_opus":0.018415415957030272,"score_gpt":0.2699051008504644,"score_spread":0.2514896848934341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316662528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015285253,0.00017617935,0.9943203,0.0008324225,0.0012641412,0.00064705755,0.000004670528,0.00035291776,0.0008737947],"genre_scores_gemma":[0.9729305,0.0000332515,0.025683008,0.00086905155,0.00035641243,0.000030219104,0.000011506521,0.000029151468,0.00005691459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966973,0.000028886858,0.00054688484,0.0015409234,0.0007251061,0.00046091393],"domain_scores_gemma":[0.9978775,0.00046356427,0.00029959448,0.0008736986,0.00028279395,0.00020289187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001055261,0.00038984042,0.00035408826,0.00086394744,0.0003385438,0.00054569624,0.0017398273,0.0002953448,0.00000471132],"category_scores_gemma":[0.00012515455,0.0004219945,0.0000714788,0.00086348207,0.00017796055,0.0006478811,0.00095970463,0.0006042645,0.00018179107],"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.000011815917,0.000035505254,0.00003534556,0.00013573239,0.000014927701,0.000015308839,0.0072059813,0.030013295,0.00092147087,0.13792688,0.00001885553,0.8236649],"study_design_scores_gemma":[0.0000819174,0.000054549382,0.0004762099,0.00017456994,0.0000043013315,0.000026400407,4.1461013e-7,0.7209056,0.00072211673,0.27695468,0.00022037346,0.00037886828],"about_ca_topic_score_codex":0.000025181298,"about_ca_topic_score_gemma":0.000062830695,"teacher_disagreement_score":0.971402,"about_ca_system_score_codex":0.00026264915,"about_ca_system_score_gemma":0.00016604924,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W4317935365","doi":"10.1145/3582077","title":"Implementing Data Exfiltration Defense in Situ: A Survey of Countermeasures and Human Involvement","year":2023,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Security and Verification in Computing","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 Toronto","funders":"Mitacs","keywords":"Computer science; Computer security; Scope (computer science); Domain (mathematical analysis); Work (physics); Risk analysis (engineering); Data science","score_opus":0.35569105085676284,"score_gpt":0.42697607322361614,"score_spread":0.0712850223668533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317935365","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.0032611177,0.90399355,0.08994602,0.000021688127,0.00083864963,0.001265476,0.00019095844,0.0003802907,0.00010228054],"genre_scores_gemma":[0.08383629,0.9004829,0.011579397,0.0000470986,0.0002542801,0.000025226314,0.0036339653,0.00012219009,0.00001863157],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9911584,0.0044075865,0.0018963641,0.0013273848,0.0005647273,0.00064550654],"domain_scores_gemma":[0.9913444,0.004036159,0.0013029522,0.0029868782,0.00024944154,0.00008015959],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.031907763,0.00043144103,0.0013680041,0.00052205386,0.00033136614,0.00035825177,0.0042401804,0.00020010106,0.000001772412],"category_scores_gemma":[0.0019655207,0.0004500954,0.000099744495,0.0016139504,0.00008248203,0.00033070758,0.0062460103,0.0004647979,0.000009775271],"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":[8.2463197e-7,0.00010665387,0.011270789,0.00795228,0.00015677488,0.000013383688,0.00077111035,0.000016078076,0.0000046081764,0.0022340773,0.00030022734,0.9771732],"study_design_scores_gemma":[0.0032592716,0.0005491585,0.59607726,0.08601576,0.0006243631,0.00015207358,0.00038034262,0.08857514,0.00003198518,0.0034997722,0.21403846,0.0067964327],"about_ca_topic_score_codex":0.004363732,"about_ca_topic_score_gemma":0.0085468525,"teacher_disagreement_score":0.97037673,"about_ca_system_score_codex":0.000097283264,"about_ca_system_score_gemma":0.00033666455,"threshold_uncertainty_score":0.9997951},"labels":[],"label_agreement":null},{"id":"W4318541608","doi":"10.1145/3575693.3575740","title":"Compilation Consistency Modulo Debug Information","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Waterloo","funders":"","keywords":"Computer science; Debugger; Debugging; Compiler; Background debug mode interface; Programming language; Consistency (knowledge bases); Kernel (algebra); Operating system; Artificial intelligence; Mathematics","score_opus":0.02617515102354573,"score_gpt":0.25110433532508536,"score_spread":0.22492918430153963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318541608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068183085,0.0000056083704,0.96213895,0.0018185395,0.00044769133,0.00008073757,0.0000017615205,0.0010614498,0.027626973],"genre_scores_gemma":[0.9703904,0.0000061958767,0.028516501,0.0007934555,0.00003466335,0.0000067076357,0.000040201696,0.0000018482909,0.00021002669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994184,0.000021498405,0.00018418171,0.00009982565,0.00015805302,0.00011808206],"domain_scores_gemma":[0.99948925,0.00007768816,0.00005571121,0.00025540465,0.000088575885,0.00003336263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023255816,0.000047604575,0.000049547027,0.00012995562,0.00016091373,0.00016021532,0.00029395556,0.000029367058,0.000019213925],"category_scores_gemma":[0.00004715577,0.00004669638,0.00002389482,0.0006625278,0.000013763168,0.0011072721,0.000100432946,0.000045980145,0.001382361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.9956294e-7,0.00000818029,0.001030434,0.000010886787,0.0000039644087,5.3420297e-7,0.001227572,0.001430124,0.00006528452,0.93501925,0.017275576,0.04392741],"study_design_scores_gemma":[0.000106887004,0.0000094078505,0.025022684,0.000004781492,6.951717e-7,0.000003669785,0.00007582677,0.9437181,0.0003737611,0.0076477877,0.022955045,0.0000813825],"about_ca_topic_score_codex":0.000008460498,"about_ca_topic_score_gemma":0.0000011225127,"teacher_disagreement_score":0.9635721,"about_ca_system_score_codex":0.00001641885,"about_ca_system_score_gemma":0.000029803059,"threshold_uncertainty_score":0.9993952},"labels":[],"label_agreement":null},{"id":"W4320150968","doi":"10.55708/js0201002","title":"CAPEF: Context-Aware Policy Enforcement Framework for Android Applications","year":2022,"lang":"en","type":"article","venue":"Journal of Engineering Research and Sciences","topic":"Security and Verification in Computing","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é du Québec à Trois-Rivières; École de Technologie Supérieure","funders":"","keywords":"Android (operating system); Enforcement; Android application; Context (archaeology); Humanities; Computer science; Engineering; Political science; Computer security; Library science; Art; Geography; Operating system; Law; Archaeology","score_opus":0.09571246542057794,"score_gpt":0.3946582497562336,"score_spread":0.29894578433565566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320150968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012156818,0.0009167849,0.98387444,0.0026270703,0.00015944474,0.00015572265,0.0000025773177,0.0000143760135,0.00009274364],"genre_scores_gemma":[0.9556921,0.000053560794,0.043904737,0.00007204978,0.00020883579,0.000040530824,2.0447882e-7,0.0000023727587,0.000025608142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880004,0.000033414788,0.00020338094,0.0001404432,0.00057353714,0.0002491749],"domain_scores_gemma":[0.9987578,0.00072791264,0.000083328734,0.00012049567,0.0001999632,0.00011050003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025735935,0.000047261794,0.0000881178,0.00041650268,0.0008375646,0.00022414683,0.0008667619,0.000015972533,0.000008240863],"category_scores_gemma":[0.00027074708,0.000041912088,0.000033712247,0.00092858385,0.00008864294,0.00022430059,0.0002251473,0.00029675697,4.4044788e-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.0000041059698,0.000029379244,0.000120989156,0.000017214878,0.0000069789353,0.0000013663957,0.000724086,0.009586985,0.00020317257,0.9783679,0.00026933412,0.0106684575],"study_design_scores_gemma":[0.000545657,0.002127314,0.00069205073,0.00007994746,0.000003193335,0.00025128806,0.0029608142,0.6392796,0.001650754,0.1501198,0.20203426,0.00025529464],"about_ca_topic_score_codex":0.000011710786,"about_ca_topic_score_gemma":2.5886982e-7,"teacher_disagreement_score":0.94353527,"about_ca_system_score_codex":0.00007100285,"about_ca_system_score_gemma":0.00026853476,"threshold_uncertainty_score":0.64419544},"labels":[],"label_agreement":null},{"id":"W4321093054","doi":"10.1007/s10664-022-10267-7","title":"Vulnerability management in Linux distributions","year":2023,"lang":"en","type":"article","venue":"Empirical Software Engineering","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Vulnerability (computing); Vulnerability management; Computer science; Revenue; Software; Computer security; Linux kernel; Secure coding; Open source; Upstream (networking); Vulnerability assessment; Operating system; Business; Software security assurance; Telecommunications; Accounting; Information security","score_opus":0.037604282998133204,"score_gpt":0.30874347030439714,"score_spread":0.27113918730626396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321093054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115291916,0.000026381394,0.8822191,0.0006946233,0.00037974888,0.00009361474,0.0000021925384,0.0012282496,0.000064180174],"genre_scores_gemma":[0.93824476,0.000008094835,0.061493836,0.00008043456,0.00006552161,0.000043650944,0.000013224371,0.000007828374,0.000042640873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99899036,0.000024650886,0.0002139831,0.00030889243,0.00016818382,0.00029394688],"domain_scores_gemma":[0.99922824,0.0002952197,0.000019127681,0.0003634793,0.000020933967,0.000072970564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003584366,0.00009428723,0.00010037258,0.00014208352,0.000080549806,0.000068088055,0.00044575383,0.000048575796,0.000008079214],"category_scores_gemma":[0.0002931904,0.000102300175,0.000046391022,0.0015960647,0.000010665273,0.00015158515,0.0002862357,0.00018880914,0.00012880687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007349639,0.0004537321,0.27415764,0.00040963225,0.00008948837,0.0003272883,0.003453212,0.46423155,0.0000718148,0.12976421,0.013923831,0.11311023],"study_design_scores_gemma":[0.00018196317,0.000010854001,0.5056603,0.000030660958,0.0000018498519,0.000003532489,0.0000115316,0.46872875,0.00009947048,0.002251256,0.022802634,0.00021718713],"about_ca_topic_score_codex":0.0000046841737,"about_ca_topic_score_gemma":9.4711334e-7,"teacher_disagreement_score":0.82295287,"about_ca_system_score_codex":0.000104633335,"about_ca_system_score_gemma":0.00001378234,"threshold_uncertainty_score":0.417168},"labels":[],"label_agreement":null},{"id":"W4328028926","doi":"10.1109/qrs57517.2022.00011","title":"A Taxonomy of Software Flaws Leading to Buffer Overflows","year":2022,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Cégep de l'Outaouais","funders":"","keywords":"Buffer overflow; Computer science; Taxonomy (biology); Vulnerability (computing); Security bug; Vulnerability management; Software; Code (set theory); Software security assurance; Secure coding; Vulnerability assessment; Class (philosophy); Software engineering; Computer security; Programming language; Artificial intelligence; Information security","score_opus":0.043939630106959046,"score_gpt":0.25434838794859,"score_spread":0.21040875784163093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328028926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024239069,0.000032656993,0.9706551,0.00048645554,0.0003859832,0.00015934957,0.0000014925422,0.00014722273,0.0038926986],"genre_scores_gemma":[0.8170309,2.8286817e-7,0.18138054,0.0010058307,0.000032760046,0.00006000113,6.4995567e-7,0.0000036432668,0.00048540902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991627,0.000047524332,0.00017864305,0.0002495043,0.00021536187,0.00014629429],"domain_scores_gemma":[0.99935144,0.00008900699,0.00005681412,0.0004084778,0.00004097586,0.000053295404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028410606,0.000060257236,0.00010143606,0.00009497629,0.00019995353,0.00004179023,0.00079241354,0.0000126037585,0.00023376152],"category_scores_gemma":[0.00004398952,0.000065348926,0.000045645735,0.00046171522,0.000009435775,0.00013779398,0.00068110396,0.0000940975,0.000044782963],"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.000016809297,0.00025403,0.0077824118,0.00005563604,0.00003895671,0.000009790339,0.006380461,0.022771468,0.0031484517,0.77958983,0.043300264,0.13665192],"study_design_scores_gemma":[0.00044138968,0.00028812033,0.0018724843,0.000024775745,0.0000052374626,0.000034213175,0.000492092,0.13529116,0.012080983,0.0031338723,0.84583664,0.0004990233],"about_ca_topic_score_codex":0.000037591446,"about_ca_topic_score_gemma":0.0000023302887,"teacher_disagreement_score":0.80253637,"about_ca_system_score_codex":0.000049330534,"about_ca_system_score_gemma":0.000050228715,"threshold_uncertainty_score":0.26648518},"labels":[],"label_agreement":null},{"id":"W4366123941","doi":"10.1007/s12243-023-00952-z","title":"A modular pipeline for enforcement of security properties at runtime","year":2023,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Security and Verification in Computing","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é du Québec en Outaouais; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Modular design; Enforcement; Pipeline (software); Construct (python library); Security policy; Runtime verification; Task (project management); Automaton; Event (particle physics); Call stack; Distributed computing; Computer security; Programming language; Formal verification; Theoretical computer science; Engineering","score_opus":0.16554425452344418,"score_gpt":0.3531951088800926,"score_spread":0.1876508543566484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366123941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4495398,0.004184348,0.47500163,0.05620033,0.0004900259,0.0026675516,0.00019888867,0.0010615273,0.01065588],"genre_scores_gemma":[0.9823561,0.0004284716,0.016693244,0.00017954588,0.000015934227,0.00007564434,0.000043194126,0.0000064526917,0.00020144331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989925,0.000067143184,0.00044218104,0.00015988949,0.00016011305,0.00017820013],"domain_scores_gemma":[0.99772686,0.0002302721,0.00024739132,0.0013070164,0.00045082913,0.000037637066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000683579,0.00007897056,0.00016869641,0.00014541054,0.00023377157,0.00001973968,0.0014267103,0.00004063978,0.000016309868],"category_scores_gemma":[0.00018954453,0.000078259036,0.000114989954,0.0005671518,0.0000813003,0.0001690422,0.00066116126,0.000063902204,0.00001806569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056819226,0.0010289223,0.00066147785,0.0006163486,0.0002489883,3.7458858e-7,0.026025046,0.013317742,0.026580516,0.8565937,0.044762418,0.030107608],"study_design_scores_gemma":[0.00023716304,0.000079588455,0.0006550186,0.000073559284,0.0000081706885,0.0000013367694,0.00018379187,0.82134056,0.11137957,0.014883839,0.051004406,0.00015300131],"about_ca_topic_score_codex":0.00006952426,"about_ca_topic_score_gemma":0.000013904656,"teacher_disagreement_score":0.8417099,"about_ca_system_score_codex":0.000011004746,"about_ca_system_score_gemma":0.000052743046,"threshold_uncertainty_score":0.3191311},"labels":[],"label_agreement":null},{"id":"W4367853350","doi":"10.5539/cis.v16n2p51","title":"Automation-Based User Input Sql Injection Detection and Prevention Framework","year":2023,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Security and Verification in Computing","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":"Chemistry; Physics; Medicine","score_opus":0.017224937151440606,"score_gpt":0.27502568686010104,"score_spread":0.2578007497086604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367853350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112753406,0.000008658152,0.88533705,0.0003356751,0.0007417902,0.00014851049,5.4113343e-7,0.00047725675,0.00019713004],"genre_scores_gemma":[0.9366827,0.000016388844,0.062575094,0.0006273831,0.000070637645,0.000014029972,0.000004256253,0.0000023242108,0.000007200228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988357,0.000038666753,0.00029692875,0.0002510681,0.00037728716,0.00020035853],"domain_scores_gemma":[0.9991355,0.00013541842,0.0001527738,0.00026770047,0.00021684276,0.000091763904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071219,0.0000976937,0.00008321749,0.0006317972,0.0006970459,0.00096867525,0.0003424492,0.00006414248,0.0000025543375],"category_scores_gemma":[0.000113990805,0.00009805121,0.000021455282,0.0022146534,0.00013432465,0.008052077,0.00023010386,0.00011932357,0.000059435024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050797685,0.000015485984,0.0012961008,0.000073728595,0.0000045428174,3.4791478e-7,0.005641834,0.0100259315,0.00025168262,0.10533509,0.00026305503,0.8770871],"study_design_scores_gemma":[0.00014989736,0.00007548093,0.07225827,0.000036101286,0.0000014147815,0.000012257121,0.000046894085,0.9204768,0.000685257,0.0038659172,0.002276164,0.00011557505],"about_ca_topic_score_codex":0.0000059902422,"about_ca_topic_score_gemma":7.4071744e-7,"teacher_disagreement_score":0.9104508,"about_ca_system_score_codex":0.000044250286,"about_ca_system_score_gemma":0.00010013295,"threshold_uncertainty_score":0.9340958},"labels":[],"label_agreement":null},{"id":"W4377023325","doi":"10.1007/s10207-023-00702-1","title":"Analysis of OSPU security effect and data assembly verification under semi-network OS architecture","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Computer security model; Security service; Data security; Distributed System Security Architecture; Security testing; Computer security; Enterprise information security architecture; Cloud computing security; Security information and event management; Information security; Operating system; Encryption; Cloud computing","score_opus":0.0185723678339966,"score_gpt":0.3108662369331934,"score_spread":0.29229386909919675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377023325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43917924,0.00012210323,0.5560527,0.0024086747,0.0013725314,0.00016085294,0.00009401474,0.00009341892,0.00051648135],"genre_scores_gemma":[0.99675167,0.00014274137,0.0024037778,0.00027759463,0.00019279073,0.0000020546547,0.00022334738,0.000003868887,0.000002175641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751353,0.00018647914,0.0009863548,0.00019198982,0.0009472001,0.00017443133],"domain_scores_gemma":[0.9966222,0.0006146848,0.0012387406,0.00057807536,0.0008510827,0.00009523966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027068711,0.00014182214,0.00032237545,0.0009225724,0.00010099053,0.0002989153,0.001996261,0.00010253639,0.000015468975],"category_scores_gemma":[0.00044630753,0.00013049736,0.00014165817,0.0016578438,0.000058887315,0.0026071165,0.00056961057,0.00031803493,0.000012910317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068780844,0.00042933895,0.051255528,0.0004560535,0.010415137,0.000046247384,0.05236921,0.31401134,0.0008096796,0.36551878,0.025930552,0.17807034],"study_design_scores_gemma":[0.0008400105,0.00011225373,0.07108193,0.00010658015,0.00020087586,0.000086180975,0.0002582635,0.9037547,0.0006467183,0.012044005,0.010630231,0.00023826495],"about_ca_topic_score_codex":0.000026175301,"about_ca_topic_score_gemma":0.000010504378,"teacher_disagreement_score":0.5897433,"about_ca_system_score_codex":0.00006741631,"about_ca_system_score_gemma":0.00011031929,"threshold_uncertainty_score":0.5321528},"labels":[],"label_agreement":null},{"id":"W4381611547","doi":"10.1145/3593856.3595899","title":"Beyond isolation: OS verification as a foundation for correct applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Correctness; Isolation (microbiology); File system; Operating system; Software system; Software; Distributed computing; Software engineering; Programming language","score_opus":0.03280637670240246,"score_gpt":0.3097435233755303,"score_spread":0.27693714667312785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381611547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009171347,0.000011682776,0.98392886,0.002829125,0.0004872178,0.00071063655,0.0000017700752,0.0008974722,0.01021611],"genre_scores_gemma":[0.8391522,0.000026934822,0.15414827,0.0010845799,0.0004947462,0.0015053595,0.0002970681,0.000020378578,0.0032704405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.00002907259,0.00024421,0.00038347367,0.00017200525,0.00017990336],"domain_scores_gemma":[0.9988016,0.00031115755,0.00011054685,0.00051858276,0.00020505757,0.000053043754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040903533,0.00008684345,0.00008033047,0.0001553586,0.00042609006,0.00023542698,0.00049162953,0.000057020447,0.000046581317],"category_scores_gemma":[0.000079574806,0.00009481156,0.00005413079,0.0011004142,0.000021965894,0.00046018677,0.00006722971,0.00005551018,0.0012848974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034606937,0.000025816467,0.000074595686,0.000013932965,0.0000068215595,9.394766e-8,0.0005279221,0.00029987784,0.0009926718,0.8878099,0.005767634,0.1044773],"study_design_scores_gemma":[0.0002538546,0.0000470078,0.0010816179,0.0000051248003,0.0000052183873,0.0000054848474,0.0001136085,0.73456997,0.0021457267,0.09265962,0.16893545,0.00017729834],"about_ca_topic_score_codex":0.0000106972,"about_ca_topic_score_gemma":0.000003234991,"teacher_disagreement_score":0.8382351,"about_ca_system_score_codex":0.000046550897,"about_ca_system_score_gemma":0.000086646374,"threshold_uncertainty_score":0.9994927},"labels":[],"label_agreement":null},{"id":"W4381611581","doi":"10.1145/3593856.3595895","title":"Why write address translation OS code yourself when you can synthesize it?","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Virtual memory; Cornerstone; Address space; Memory protection; Physical address; Isolation (microbiology); Logical address; Memory address; Translation (biology); Memory management; Operating system; Computer architecture; Embedded system; Parallel computing; Programming language; Semiconductor memory","score_opus":0.08460651280310628,"score_gpt":0.2953172965785621,"score_spread":0.21071078377545582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381611581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083376095,0.00009208918,0.9051969,0.06784513,0.0010437864,0.00034385145,0.000018593119,0.0019942098,0.015127812],"genre_scores_gemma":[0.94397277,0.000050723473,0.047270555,0.0066827973,0.00031853237,0.00004206389,0.000028500088,0.000026731059,0.0016073212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985819,0.00009818717,0.00026555613,0.00042297004,0.00032466455,0.0003067178],"domain_scores_gemma":[0.9988877,0.00032245967,0.00007152127,0.000541258,0.00008044529,0.00009658521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049203786,0.00012710756,0.00013226143,0.00015015328,0.0002410333,0.00024172256,0.00084077514,0.00007838938,0.0001257861],"category_scores_gemma":[0.000049991577,0.00012717667,0.00006709247,0.0006011966,0.000033955923,0.00034047273,0.00008889936,0.0001276424,0.00019958173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027343262,0.00024583412,0.0016406827,0.00016464894,0.00013240718,0.00005709687,0.064657465,0.0037295409,0.00452074,0.22973879,0.33376953,0.36131594],"study_design_scores_gemma":[0.00041739392,0.000039128157,0.0015838235,0.00007347726,0.000013138156,0.000015031291,0.00057558506,0.77033705,0.005984268,0.0065541486,0.21395977,0.00044721007],"about_ca_topic_score_codex":0.00018441398,"about_ca_topic_score_gemma":0.00018531327,"teacher_disagreement_score":0.93563515,"about_ca_system_score_codex":0.000026762724,"about_ca_system_score_gemma":0.000052659158,"threshold_uncertainty_score":0.5186114},"labels":[],"label_agreement":null},{"id":"W4381611647","doi":"10.1145/3593856.3595915","title":"Metal: An Open Architecture for Developing Processor Features","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Microcode; Computer science; Microarchitecture; Computer architecture; Embedded system; Operating system; Architecture","score_opus":0.09033143210357811,"score_gpt":0.36335166473184566,"score_spread":0.2730202326282676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381611647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.004101054,0.00001811894,0.98544025,0.0071834545,0.00025476055,0.0004149771,0.0000016250855,0.0006596697,0.0019260828],"genre_scores_gemma":[0.17028436,0.000003259745,0.82502526,0.002459222,0.00015202009,0.00015795382,0.000029131268,0.00001489448,0.0018738875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991688,0.00002818582,0.00012334184,0.0003529851,0.00011829915,0.00020837758],"domain_scores_gemma":[0.9993611,0.00013278531,0.000045986762,0.00033071593,0.00008498462,0.000044451284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042819884,0.00008044492,0.00009762803,0.000089070854,0.00026539736,0.0005253213,0.0018908118,0.0000391279,0.0000034461798],"category_scores_gemma":[0.00008286305,0.00006687851,0.000023428769,0.00064787123,0.000012440168,0.00045850352,0.00047406802,0.000067352754,0.00002228372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060862812,0.00002096487,0.000022451006,0.000050311482,0.0000166949,0.0000014816276,0.00277075,0.00039550287,0.00065534515,0.8779488,0.0077959527,0.11031562],"study_design_scores_gemma":[0.0010127231,0.00025888102,0.008140401,0.000078629215,0.000011060954,0.000049602353,0.0005381328,0.23723377,0.050059617,0.40583572,0.2958376,0.00094384653],"about_ca_topic_score_codex":0.000017002307,"about_ca_topic_score_gemma":0.000032966032,"teacher_disagreement_score":0.4721131,"about_ca_system_score_codex":0.000011984168,"about_ca_system_score_gemma":0.00010156055,"threshold_uncertainty_score":0.50656855},"labels":[],"label_agreement":null},{"id":"W4383221427","doi":"10.1145/3579856.3595799","title":"Cage4Deno: A Fine-Grained Sandbox for Deno Subprocesses","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"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":"RWTH Aachen University; University of Chinese Academy of Sciences; Southwest University; Nanjing University of Science and Technology; Universität zu Lübeck; University of Surrey; Huazhong University of Science and Technology; Griffith University; Deakin University; Nanyang Technological University; Nanjing University; Commonwealth Scientific and Industrial Research Organisation; European Commission; Sungkyunkwan University; University College London; York University; University of Wollongong; Worcester Polytechnic Institute; University of Technology Sydney; Chinese Academy of Sciences; Purdue University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Sandbox (software development); JavaScript; Computer science; TypeScript; Operating system; Certificate; Database; Programming language; Computer security","score_opus":0.04442058161616083,"score_gpt":0.30192309311707066,"score_spread":0.25750251150090986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383221427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015690178,0.000064631655,0.9771081,0.0032454748,0.00039797515,0.00017885292,0.0000022521153,0.0015059767,0.0018065143],"genre_scores_gemma":[0.9538826,0.000011241835,0.043640606,0.0005573252,0.00018122802,0.000063762054,0.000010825649,0.000009657414,0.0016427642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915427,0.000014508088,0.00015966641,0.00029273727,0.00013762341,0.0002412032],"domain_scores_gemma":[0.99911124,0.00035705633,0.000044666223,0.0003180466,0.000114985014,0.000054034215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030388703,0.000080168706,0.000091535076,0.00010333635,0.00021710746,0.00017269104,0.00065348786,0.00003880587,0.000015989675],"category_scores_gemma":[0.00018498895,0.00007285516,0.000049872695,0.0008133661,0.000017891007,0.0002044828,0.00013013462,0.000044768534,0.00016787126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101858805,0.000060878436,0.0006102679,0.00016217375,0.000026835725,0.000008632286,0.0032226278,0.0003945263,0.0015956699,0.8072209,0.15150107,0.035186265],"study_design_scores_gemma":[0.000621534,0.000087642155,0.001972602,0.000027083432,0.0000053354684,0.000011935814,0.00015923931,0.85866296,0.009959237,0.04325189,0.08490433,0.00033617948],"about_ca_topic_score_codex":0.000016433265,"about_ca_topic_score_gemma":0.000015112305,"teacher_disagreement_score":0.9381924,"about_ca_system_score_codex":0.000012024123,"about_ca_system_score_gemma":0.00006446226,"threshold_uncertainty_score":0.29709473},"labels":[],"label_agreement":null},{"id":"W4383221474","doi":"10.1145/3579856.3592831","title":"POSTER: Leveraging eBPF to enhance sandboxing of WebAssembly runtimes","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":11,"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 Chinese Academy of Sciences; Nanjing University; RWTH Aachen University; Southwest University; Nanjing University of Science and Technology; Universität zu Lübeck; Universidad Politécnica de Madrid; Ohio State University; University of Surrey; Griffith University; University of Adelaide; Deakin University; Nanyang Technological University; Commonwealth Scientific and Industrial Research Organisation; Sungkyunkwan University; Purdue University; University College London; University of Wollongong; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Università degli studi di Bergamo; Worcester Polytechnic Institute; University of Queensland; University of Washington; University of Technology Sydney; Washington University in St. Louis; Huazhong University of Science and Technology; European Commission; Georgia Institute of Technology; Chinese Academy of Sciences","keywords":"Computer science; Operating system; Overhead (engineering); Software deployment; Interface (matter); Code (set theory); Granularity; Standardization; Database; Programming language","score_opus":0.025628336401771146,"score_gpt":0.3071736003784758,"score_spread":0.28154526397670465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383221474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31315356,0.00003615703,0.67567354,0.002633133,0.00046327646,0.000104144114,5.2763966e-7,0.00049241696,0.007443223],"genre_scores_gemma":[0.9723115,0.00000538707,0.026433313,0.00057273725,0.00004907183,0.000004627471,8.140865e-7,0.0000053574345,0.00061722373],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900717,0.000032062962,0.00023488962,0.000301716,0.00019995375,0.00022423115],"domain_scores_gemma":[0.9991983,0.00017448323,0.000064065236,0.0004213132,0.00008091059,0.00006092047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040297591,0.00007986254,0.00011944845,0.00018064653,0.0001130501,0.000095731775,0.0006979794,0.000026773061,0.000022908915],"category_scores_gemma":[0.000058623416,0.00007992441,0.00004345858,0.001001194,0.000011747681,0.00024075303,0.00037349208,0.000060329057,0.0002875313],"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.000020970067,0.00017230828,0.009925041,0.0002475994,0.00009396499,0.00003335778,0.04063118,0.0044811186,0.26621464,0.16936404,0.039422654,0.46939313],"study_design_scores_gemma":[0.00020201685,0.00008345629,0.020505257,0.00020045467,0.0000045167026,0.000011299764,0.0003880517,0.15076111,0.813706,0.003131291,0.01052694,0.00047964146],"about_ca_topic_score_codex":0.000034586934,"about_ca_topic_score_gemma":0.0000023835817,"teacher_disagreement_score":0.65915793,"about_ca_system_score_codex":0.000015431226,"about_ca_system_score_gemma":0.000035868223,"threshold_uncertainty_score":0.36957288},"labels":[],"label_agreement":null},{"id":"W4383825528","doi":"10.2139/ssrn.4505659","title":"Mv-Checker: A Software Tool for Multi-Valued Model Checking Intelligent Applications with Trust and Commitment","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Security and Verification in Computing","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 Alberta; Concordia University","funders":"","keywords":"Model checking; Computer science; Software engineering; Software; Programming language","score_opus":0.07099441257538841,"score_gpt":0.3191975911587179,"score_spread":0.24820317858332946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383825528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0033451787,0.0016333162,0.9927394,0.00056628935,0.00021296057,0.0011938482,0.000014125732,0.00028571583,0.000009164371],"genre_scores_gemma":[0.1413799,0.0040487526,0.8521846,0.0002355326,0.0004373047,0.0009856543,0.000048552145,0.000092116745,0.00058759045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967339,0.00007238515,0.0005604227,0.00076322723,0.0003665229,0.0015035166],"domain_scores_gemma":[0.9982618,0.00009140587,0.00051841774,0.00071989064,0.00028999706,0.00011847291],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020589523,0.0003470529,0.00035949706,0.00021590084,0.0006833209,0.0005235058,0.0013510721,0.00020471196,8.452188e-7],"category_scores_gemma":[0.000065694745,0.00032179756,0.00017028149,0.00023616469,0.00006631718,0.00017622764,0.0007334157,0.0024503781,0.000006778282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042831307,0.00022177048,0.0006048551,0.00019317349,0.00048274169,0.0000018221584,0.0022127125,0.052660357,0.000011941013,0.8724563,0.00009079303,0.07102067],"study_design_scores_gemma":[0.0005248043,0.000101816964,0.000066731016,0.00011702153,0.00005341148,0.00010298316,0.00029798527,0.8000496,0.00006772682,0.19779854,0.00046641618,0.00035293665],"about_ca_topic_score_codex":0.000022467591,"about_ca_topic_score_gemma":0.00009260098,"teacher_disagreement_score":0.74738926,"about_ca_system_score_codex":0.0010285426,"about_ca_system_score_gemma":0.0026630177,"threshold_uncertainty_score":0.9999234},"labels":[],"label_agreement":null},{"id":"W4384302865","doi":"10.1109/icse48619.2023.00087","title":"AChecker: Statically Detecting Smart Contract Access Control Vulnerabilities","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":63,"is_retracted":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":"Smart contract; Access control; Computer science; Computer security; Consistency (knowledge bases); Solidity; Permission; Control flow; Physical access; Control (management); Security analysis; Role-based access control; Blockchain; Artificial intelligence; Programming language","score_opus":0.04749461741768342,"score_gpt":0.3178266684592295,"score_spread":0.2703320510415461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384302865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11553499,0.000021372252,0.87507576,0.0027514596,0.000546089,0.00019100444,0.0000022194765,0.0013336434,0.0045434423],"genre_scores_gemma":[0.9889224,0.000005491186,0.009474301,0.001220843,0.00009075419,0.00002875297,0.0000018171861,0.000008494517,0.00024715008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984493,0.00014312589,0.00034299996,0.0003872949,0.00028572738,0.00039152204],"domain_scores_gemma":[0.99761814,0.0015636343,0.00008684437,0.00048624098,0.00014270641,0.00010245884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866266,0.00012397683,0.00017368697,0.0001228942,0.00031945773,0.0006859266,0.0010967276,0.000057408244,0.00008708148],"category_scores_gemma":[0.0005950823,0.00011354285,0.000067275425,0.0006439817,0.00005232694,0.00076966634,0.00024759315,0.00019513295,0.00024744187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033099823,0.00015042927,0.02201506,0.0001495152,0.00012592477,0.000047455513,0.006123705,0.0036742345,0.002431093,0.76901394,0.0047260793,0.19150944],"study_design_scores_gemma":[0.0006038436,0.000047833055,0.01577922,0.000018110559,0.0000049298765,0.00000992738,0.00020866422,0.9634521,0.0027650902,0.013929233,0.0029340712,0.00024699507],"about_ca_topic_score_codex":0.00010616182,"about_ca_topic_score_gemma":0.000023080442,"teacher_disagreement_score":0.95977783,"about_ca_system_score_codex":0.000033781394,"about_ca_system_score_gemma":0.00008092737,"threshold_uncertainty_score":0.66144055},"labels":[],"label_agreement":null},{"id":"W4385152117","doi":"10.1109/lca.2023.3297875","title":"The Mirage of Breaking MIRAGE: Analyzing the Modeling Pitfalls in Emerging “Attacks” on MIRAGE","year":2023,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","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; Set (abstract data type); Vulnerability (computing); Computer security; Initialization; Work (physics); Cache; Programming language; Parallel computing; Engineering","score_opus":0.01986649166833357,"score_gpt":0.264111562793635,"score_spread":0.24424507112530144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385152117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35749894,0.00007255517,0.629658,0.011236107,0.0010654483,0.0002187744,0.0000013515663,0.00020065373,0.000048162223],"genre_scores_gemma":[0.98193675,0.000019140454,0.012621859,0.0048942156,0.00046519458,0.000020497018,0.0000030934907,0.000030347745,0.000008923316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688333,0.0004497195,0.0006867441,0.0007024228,0.00055729627,0.0007204822],"domain_scores_gemma":[0.9969316,0.0014391531,0.00026055667,0.0012409178,0.000057109755,0.00007062492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640413,0.00032334647,0.00030981834,0.00046482348,0.0006743745,0.0003700344,0.002632977,0.00007791496,0.0000015545951],"category_scores_gemma":[0.000045183442,0.00022289637,0.00022807925,0.0018394014,0.00012495575,0.00017178654,0.00047666056,0.0008668107,0.000022828435],"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.000009954242,0.000011528568,0.00014205814,0.0000306358,0.000035667646,0.000035902416,0.0067864056,0.9504722,0.0025310644,0.0011862754,0.00110322,0.0376551],"study_design_scores_gemma":[0.00027960382,0.000031780255,0.0010334452,0.00018934466,0.000006243148,0.000019081375,0.000040637195,0.9947914,0.0006902985,0.0010858845,0.0015618632,0.00027042057],"about_ca_topic_score_codex":0.00010359653,"about_ca_topic_score_gemma":0.00004322168,"teacher_disagreement_score":0.62443775,"about_ca_system_score_codex":0.00012915293,"about_ca_system_score_gemma":0.00006168028,"threshold_uncertainty_score":0.908945},"labels":[],"label_agreement":null},{"id":"W4385688937","doi":"10.1109/dsn58367.2023.00022","title":"PT-Guard: Integrity-Protected Page Tables to Defend Against Breakthrough Rowhammer Attacks","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Guard (computer science); Dram; Computer science; Byte; Operating system; Checksum; Embedded system; Computer security; Computer network; Computer hardware","score_opus":0.05349715077273294,"score_gpt":0.30194437068943797,"score_spread":0.24844721991670504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385688937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11405207,0.000049757837,0.8536154,0.008562966,0.0011158235,0.00047822305,0.000009340243,0.0022298645,0.019886538],"genre_scores_gemma":[0.87287396,0.000036529713,0.11821049,0.005154829,0.0003356699,0.00009307891,0.000035398534,0.000033071177,0.0032269657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979464,0.00011469141,0.00035980207,0.0006713049,0.00037915338,0.0005286617],"domain_scores_gemma":[0.99844116,0.00023636626,0.000078429905,0.0008956188,0.00017019657,0.0001782296],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061449956,0.00020415282,0.00020951482,0.00024142493,0.00034297723,0.000394829,0.0013132537,0.00012348083,0.00010356422],"category_scores_gemma":[0.00022414392,0.00019039316,0.0000909257,0.0022483722,0.000039713777,0.0004541636,0.00070288975,0.00034797366,0.0019452249],"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.000028004413,0.0003025221,0.0020176098,0.00014529824,0.00013952734,0.00013261793,0.015049941,0.0040536686,0.015589222,0.35984126,0.28071672,0.3219836],"study_design_scores_gemma":[0.00096361997,0.00018472724,0.009331851,0.00019880352,0.000012030446,0.00003969024,0.0014311359,0.4560548,0.021704873,0.008460685,0.5001407,0.0014770468],"about_ca_topic_score_codex":0.00023615702,"about_ca_topic_score_gemma":0.00006638909,"teacher_disagreement_score":0.7588219,"about_ca_system_score_codex":0.0000608753,"about_ca_system_score_gemma":0.00008431877,"threshold_uncertainty_score":0.99883187},"labels":[],"label_agreement":null},{"id":"W4385993975","doi":"10.1145/3609021.3609301","title":"Unleashing Unprivileged eBPF Potential with Dynamic Sandboxing","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Exploit; Overhead (engineering); Kernel (algebra); Scope (computer science); Linux kernel; Operating system; Software; System call; Computer security; Programming language","score_opus":0.00930250154796204,"score_gpt":0.23419994227116142,"score_spread":0.2248974407231994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385993975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1195194,0.000015423346,0.8749541,0.0013017781,0.00036500103,0.00007186925,3.302332e-7,0.0011017573,0.0026703135],"genre_scores_gemma":[0.9643327,0.0000061868186,0.034988336,0.00021899136,0.00005318576,0.0000046917457,0.000003610242,0.000008273115,0.000384009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.000042026786,0.00015002051,0.00034258727,0.00026267677,0.00027492538],"domain_scores_gemma":[0.99934137,0.00008210488,0.000054558637,0.0004074101,0.00004984611,0.00006469846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003157593,0.000095608804,0.00009118652,0.00013443886,0.000278018,0.00027337397,0.0006525733,0.00003763542,0.000022318982],"category_scores_gemma":[0.000021010244,0.00008117177,0.00003476368,0.0009143395,0.000026692722,0.0003890343,0.00022450238,0.00012820477,0.00023080889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039829185,0.00018341017,0.004119512,0.0001382365,0.00016961612,0.00037904494,0.009800344,0.058005407,0.021860607,0.6852758,0.0065370994,0.21349108],"study_design_scores_gemma":[0.00024234327,0.000026986834,0.005477022,0.000030345722,0.0000029607436,0.000029382298,0.00016062448,0.9900894,0.00086884,0.0019334151,0.00096204795,0.00017659728],"about_ca_topic_score_codex":0.000018597046,"about_ca_topic_score_gemma":0.0000117410145,"teacher_disagreement_score":0.932084,"about_ca_system_score_codex":0.000028396917,"about_ca_system_score_gemma":0.000048349695,"threshold_uncertainty_score":0.33100885},"labels":[],"label_agreement":null},{"id":"W4386875494","doi":"10.48550/arxiv.2309.09291","title":"OSmosis: No more Déjà vu in OS isolation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Isolation (microbiology); Computer science; Abstraction; Attack surface; Distributed computing; Operating system; Embedded system; Resource (disambiguation); Software; Software engineering; Computer network","score_opus":0.12302059527170854,"score_gpt":0.21558236685704568,"score_spread":0.09256177158533714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386875494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20121942,0.000042689695,0.79385465,0.00046553876,0.0016906189,0.0003108675,0.0000070181504,0.0006404074,0.0017687895],"genre_scores_gemma":[0.99549246,0.000087986795,0.0029370019,0.00014035346,0.00012763211,0.0000018425651,0.000020707792,0.000016643586,0.0011753974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811053,0.00013643017,0.00026157836,0.0010739163,0.000108562585,0.00030895328],"domain_scores_gemma":[0.99822545,0.00016486256,0.000240258,0.0011105364,0.00016639651,0.00009251093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037722298,0.00023028006,0.00024246705,0.0004175148,0.00013908959,0.00015071259,0.0017576367,0.00029760625,0.00002149671],"category_scores_gemma":[0.00007801208,0.00030423224,0.00013409575,0.0010530804,0.000056001085,0.0003690246,0.0015672008,0.00062081736,0.000502843],"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.00003526415,0.00020838965,0.027009794,0.00024944654,0.0000872969,0.0003417517,0.003318103,0.6826401,0.00006355638,0.2815033,0.0032586234,0.0012843928],"study_design_scores_gemma":[0.00026118298,0.000016479458,0.013345648,0.00015322058,0.000011592571,0.0000013101173,0.00008876784,0.95956635,0.000033713048,0.025477655,0.00071405363,0.0003300351],"about_ca_topic_score_codex":0.00030476248,"about_ca_topic_score_gemma":0.000048030543,"teacher_disagreement_score":0.794273,"about_ca_system_score_codex":0.000241363,"about_ca_system_score_gemma":0.00016173355,"threshold_uncertainty_score":0.999941},"labels":[],"label_agreement":null},{"id":"W4387298350","doi":"10.1145/3607199.3607212","title":"MIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds Checking","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Padding; Pointer (user interface); Compression (physics); Data compression; Pointer analysis; Parallel computing; Overhead (engineering); Theoretical computer science; Algorithm; Programming language; Computer hardware; Static analysis; Computer security","score_opus":0.05485408248253466,"score_gpt":0.32785355683813977,"score_spread":0.2729994743556051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387298350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023906076,0.0000315603,0.9661497,0.0017558791,0.0011399642,0.00027515474,0.0000027808603,0.0010234665,0.0057154037],"genre_scores_gemma":[0.9752274,0.000006505124,0.022260927,0.0006821327,0.00023332275,0.000052250816,0.000014900526,0.000013886188,0.0015086868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985946,0.000051943807,0.0002702299,0.00048273668,0.00020843645,0.0003920457],"domain_scores_gemma":[0.99884975,0.00036249106,0.00011144019,0.00041414448,0.00018740862,0.000074790536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042354476,0.00014229036,0.00015524615,0.0001604537,0.00052305526,0.0005186975,0.0008033749,0.0000761701,0.000020543028],"category_scores_gemma":[0.000092354116,0.00013045323,0.00010010593,0.0008247463,0.000037717986,0.00053031585,0.00033250733,0.00013932494,0.0001296611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009278946,0.00024955889,0.0016834734,0.00021019991,0.0001669916,0.000014599846,0.01932749,0.0021307326,0.024801284,0.59014034,0.28709215,0.07409043],"study_design_scores_gemma":[0.0006230116,0.00007795359,0.002027039,0.000055473727,0.000004570413,0.000007880546,0.00018387027,0.9058754,0.024459751,0.017378202,0.049025223,0.00028163713],"about_ca_topic_score_codex":0.000021306725,"about_ca_topic_score_gemma":0.000007207962,"teacher_disagreement_score":0.9513213,"about_ca_system_score_codex":0.000060604343,"about_ca_system_score_gemma":0.000054674863,"threshold_uncertainty_score":0.5319729},"labels":[],"label_agreement":null},{"id":"W4387609111","doi":"10.1109/comst.2023.3323640","title":"A Survey on X.509 Public-Key Infrastructure, Certificate Revocation, and Their Modern Implementation on Blockchain and Ledger Technologies","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":48,"is_retracted":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 Natural Science Foundation of China; Science and Technology Foundation of Shenzhen City","keywords":"Revocation list; Computer security; Public key certificate; Public key infrastructure; Computer science; Certificate authority; Root certificate; Revocation; Public-key cryptography; The Internet; Certificate; Encryption; World Wide Web; Overhead (engineering)","score_opus":0.18791055662839357,"score_gpt":0.3534768931076378,"score_spread":0.16556633647924424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387609111","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.7292074,0.0018121607,0.22453469,0.032617047,0.0041105943,0.0022714383,0.0004692802,0.004335428,0.0006419811],"genre_scores_gemma":[0.99645627,0.0006836863,0.002272867,0.00012617272,0.000085456464,0.00012877793,0.00018681286,0.000022145567,0.000037819573],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9955838,0.0025493216,0.00062565255,0.0006235665,0.0002657045,0.0003519784],"domain_scores_gemma":[0.9929316,0.0033470609,0.00034331426,0.0028650789,0.0004298472,0.000083069055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0070087574,0.00026646844,0.00030679087,0.00049780525,0.0009330826,0.0005406375,0.0019405356,0.00017105561,0.000003433106],"category_scores_gemma":[0.0011884805,0.0002472974,0.000041974334,0.001492089,0.0003028543,0.00028640864,0.0007088692,0.00032677499,0.00003693324],"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.00002421672,0.00029890204,0.018819936,0.00005277544,0.00020902476,0.000001162456,0.0111467065,0.0006496995,0.0075252065,0.2295114,0.01686542,0.71489555],"study_design_scores_gemma":[0.0017400503,0.0003550125,0.6455389,0.0001473149,0.000026068026,0.000012748376,0.0016923783,0.18442212,0.015485336,0.110813044,0.038243774,0.0015232309],"about_ca_topic_score_codex":0.00021151248,"about_ca_topic_score_gemma":0.0003715283,"teacher_disagreement_score":0.71337235,"about_ca_system_score_codex":0.000089288435,"about_ca_system_score_gemma":0.00012769726,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W4387647264","doi":"10.1145/3623759.3624545","title":"Synthesizing Device Drivers with Ghost Writer","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Universitas Brawijaya","keywords":"Toolchain; Computer science; Process (computing); Kernel (algebra); Set (abstract data type); Interface (matter); Embedded system; Netlist; Input device; Operating system; Computer hardware; Programming language; Software","score_opus":0.029833743955919367,"score_gpt":0.25075795539027357,"score_spread":0.2209242114343542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387647264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10717718,0.000015972728,0.85835767,0.0041451496,0.00029687062,0.000111590474,4.651909e-7,0.0016005641,0.028294526],"genre_scores_gemma":[0.9476657,0.0000044383564,0.051010553,0.0007852244,0.00004637095,0.0000046029604,9.718395e-7,0.0000054641614,0.00047665444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992913,0.000024039657,0.0000913542,0.00024295421,0.00016620707,0.00018411574],"domain_scores_gemma":[0.99934983,0.00018183846,0.000031120664,0.000343614,0.000045813842,0.000047772588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019282872,0.000065215056,0.00006140732,0.00008929448,0.00015635624,0.00016336588,0.0005326122,0.000024340045,0.0000268654],"category_scores_gemma":[0.000019776004,0.000053269665,0.000019898256,0.00073542964,0.000021612941,0.00030001346,0.00013190748,0.00006391568,0.0006016538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008726494,0.00007225442,0.018006124,0.00007007345,0.00007062239,0.000118889795,0.009839973,0.0016383695,0.0017716901,0.83274657,0.016391696,0.119265035],"study_design_scores_gemma":[0.00049793127,0.00010050873,0.035003837,0.00014266864,0.00001018786,0.000059067628,0.0014809138,0.84878826,0.012302,0.00227283,0.098638445,0.0007033412],"about_ca_topic_score_codex":0.000015268772,"about_ca_topic_score_gemma":0.000005378923,"teacher_disagreement_score":0.8471499,"about_ca_system_score_codex":0.000015076772,"about_ca_system_score_gemma":0.000027112008,"threshold_uncertainty_score":0.7733244},"labels":[],"label_agreement":null},{"id":"W4387667119","doi":"10.1145/3622850","title":"Quantifying and Mitigating Cache Side Channel Leakage with Differential Set","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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":"Cache; Computer science; Side channel attack; Cache invalidation; Abstraction; Smart Cache; Information leakage; Cache algorithms; CPU cache; Parallel computing; Embedded system; Computer network; Cryptography; Computer security","score_opus":0.047971520637576086,"score_gpt":0.2967396356833562,"score_spread":0.2487681150457801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387667119","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.9962668,0.000081871236,0.0006626892,0.0020882278,0.00009948943,0.00022063473,0.0000013991475,0.0003866754,0.00019221558],"genre_scores_gemma":[0.9850317,0.000007747962,0.014725243,0.00007868789,0.00007364782,0.00002401472,0.0000014390156,0.000014496477,0.00004297262],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988377,0.000012362623,0.0001880562,0.00035149397,0.00031481864,0.00029558726],"domain_scores_gemma":[0.99909896,0.0001784517,0.00022247338,0.00035406023,0.00009533775,0.000050713323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039097745,0.00014372425,0.00015467116,0.00010788554,0.00030946874,0.00028747882,0.0014253878,0.0000506399,8.055035e-7],"category_scores_gemma":[0.0006397832,0.00009854764,0.00004757403,0.00066201936,0.00009673953,0.00022144394,0.0009602661,0.00020093418,0.000003102766],"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.00011650705,0.00035189555,0.086139925,0.0028917897,0.00037731294,0.000031426098,0.13477868,0.00019749186,0.13312246,0.15698345,0.0022133437,0.48279572],"study_design_scores_gemma":[0.0029467768,0.0012089178,0.11563031,0.0041035176,0.00016249689,0.00026960598,0.050061952,0.087667264,0.7208683,0.013065942,0.0018884878,0.002126442],"about_ca_topic_score_codex":0.000031200976,"about_ca_topic_score_gemma":0.0000035984067,"teacher_disagreement_score":0.58774585,"about_ca_system_score_codex":0.00001300614,"about_ca_system_score_gemma":0.000013366171,"threshold_uncertainty_score":0.40186563},"labels":[],"label_agreement":null},{"id":"W4387674275","doi":"10.1145/3622842","title":"Building Dynamic System Call Sandbox with Partial Order Analysis","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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":"National Natural Science Foundation of China","keywords":"Sandbox (software development); Computer science; System call; Attack surface; Static analysis; Call graph; Code (set theory); Program analysis; Server; Point (geometry); Order (exchange); Computer security; Operating system; Set (abstract data type); Programming language","score_opus":0.012058470131274613,"score_gpt":0.27636362275916954,"score_spread":0.26430515262789495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674275","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.9706865,0.00009754855,0.025416892,0.001879683,0.00016999558,0.0003521512,0.000002076839,0.0010651621,0.0003300075],"genre_scores_gemma":[0.9152662,0.0000024209792,0.08454209,0.000042495823,0.000041664614,0.000035472025,0.0000012270515,0.0000119655115,0.00005643057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856734,0.000014356222,0.00024689408,0.00040526316,0.00044146436,0.00032469683],"domain_scores_gemma":[0.99872404,0.00012378214,0.00027923044,0.0006079886,0.0002115534,0.000053407886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059223454,0.00014808224,0.0002227697,0.00026617857,0.00024313423,0.0002531369,0.0024253305,0.00005658324,0.0000012327316],"category_scores_gemma":[0.00041950902,0.00009899714,0.00011446694,0.0037606715,0.00006509759,0.00018245597,0.00071952265,0.00016118695,0.0000072047255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000161895,0.00046124138,0.091233276,0.0021432647,0.0027270203,0.000038659713,0.026094716,0.007614688,0.01949032,0.5509314,0.0017743491,0.29732922],"study_design_scores_gemma":[0.0017427732,0.00071845757,0.03551841,0.0017754479,0.0011145857,0.00010018121,0.010365797,0.8572815,0.07972651,0.0025486513,0.0074613793,0.0016463237],"about_ca_topic_score_codex":0.000041211846,"about_ca_topic_score_gemma":0.0000033838626,"teacher_disagreement_score":0.8496668,"about_ca_system_score_codex":0.00004966551,"about_ca_system_score_gemma":0.000024407087,"threshold_uncertainty_score":0.45069075},"labels":[],"label_agreement":null},{"id":"W4388041063","doi":"10.1145/3620678.3624789","title":"Cryonics","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Operating system; Locality; Context (archaeology); Cloud computing; Function (biology); Snapshot (computer storage); Server; Computer security","score_opus":0.033727217662457135,"score_gpt":0.2736942786136473,"score_spread":0.2399670609511902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388041063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007879879,0.000011438926,0.9548842,0.002813431,0.00043177127,0.000023927172,7.577573e-8,0.0012489856,0.032706317],"genre_scores_gemma":[0.9480011,0.000011596985,0.04871536,0.00091544725,0.00006448286,0.0000032429698,0.0000010249935,0.000002675528,0.002285104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996688,0.000008573502,0.000053573614,0.000104292965,0.00007496853,0.00008981759],"domain_scores_gemma":[0.9996769,0.000051130224,0.000010375102,0.00022267981,0.00001732346,0.000021634442],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013930254,0.000022389197,0.000023151491,0.00004025688,0.000064105116,0.00006289785,0.0003665763,0.000013127033,0.00001963424],"category_scores_gemma":[0.000018024437,0.000020850084,0.000014160601,0.0005084891,0.000005562288,0.00010658321,0.00011950368,0.000028612625,0.001367045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.066762e-8,0.0000032389396,0.00010352266,0.0000012677035,9.837639e-7,0.0000015382657,0.00023197285,0.00008889622,0.00005972362,0.9655478,0.014535244,0.019425767],"study_design_scores_gemma":[0.000053681324,0.0000072426856,0.0037398518,0.000002040819,2.571635e-7,0.000003332448,0.00002826536,0.8439906,0.0010419138,0.027226279,0.123835795,0.0000707083],"about_ca_topic_score_codex":0.0000025832553,"about_ca_topic_score_gemma":3.7880557e-7,"teacher_disagreement_score":0.9401212,"about_ca_system_score_codex":0.000004773361,"about_ca_system_score_gemma":0.000013902958,"threshold_uncertainty_score":0.9994105},"labels":[],"label_agreement":null},{"id":"W4388430707","doi":"10.1049/icp.2023.2614","title":"Towards designing systems to preserve peace by putting a cost on war","year":2023,"lang":"en","type":"article","venue":"IET conference proceedings.","topic":"Security and Verification in Computing","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":"Peace Arch Hospital","funders":"","keywords":"Prosperity; Boom; Restructuring; Compensation (psychology); Architecture; Computer science; Point (geometry); Computer security; Economic system; Economics; Engineering; Political science; Law; Economic growth","score_opus":0.06613592255358802,"score_gpt":0.2958118719388588,"score_spread":0.22967594938527075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388430707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09257424,0.00021181328,0.8721128,0.0078845825,0.0018310797,0.0017826682,0.000018562294,0.0032902528,0.020293975],"genre_scores_gemma":[0.98644227,0.000030459867,0.012274221,0.00037727627,0.00017997967,0.00019625883,0.0000062827426,0.000020891766,0.00047237013],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975852,0.00003265848,0.0003728947,0.0007928655,0.00059957465,0.00061680604],"domain_scores_gemma":[0.9986478,0.0001203388,0.00017902363,0.00029995636,0.0005028631,0.00025001747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933091,0.00023897008,0.00024908443,0.00021593092,0.00037879532,0.0009775353,0.0016217553,0.000112418165,0.000008817712],"category_scores_gemma":[0.00049430714,0.00024238009,0.0000532012,0.0013686708,0.00003179459,0.0005903755,0.0004832559,0.00029710683,0.00040428786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042239142,0.00019735724,0.0027855646,0.0006073493,0.000087513974,0.000026107828,0.054575022,0.0016028045,0.032662947,0.37723807,0.43892232,0.091252714],"study_design_scores_gemma":[0.0004269772,0.0003184937,0.00084045366,0.0007404534,0.000008874018,0.000020580695,0.0027786752,0.9104802,0.023825925,0.0016286301,0.058222864,0.0007078638],"about_ca_topic_score_codex":0.00007102155,"about_ca_topic_score_gemma":6.606684e-7,"teacher_disagreement_score":0.90887743,"about_ca_system_score_codex":0.000097390555,"about_ca_system_score_gemma":0.00012548213,"threshold_uncertainty_score":0.98839736},"labels":[],"label_agreement":null},{"id":"W4389041826","doi":"10.1109/isncc58260.2023.10323980","title":"Still Computers Networking is Less Secure Than It should be, Causes and Solution","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer science; Domain (mathematical analysis); Computer security; Secure communication; Focus (optics); Secure transmission; Security domain; Transmission (telecommunications); Point (geometry); Communications protocol; Physical security; Computer network; Telecommunications; Encryption","score_opus":0.13413062401042614,"score_gpt":0.3134596793380581,"score_spread":0.17932905532763194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389041826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070986405,0.00014468818,0.90254945,0.022384817,0.0018130811,0.00015820017,0.0000026954035,0.0009750294,0.0009856113],"genre_scores_gemma":[0.9848961,0.00011028247,0.010053544,0.004340667,0.0002980136,0.000005150752,0.0000065401714,0.000009290433,0.00028041436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987569,0.00005267853,0.00019883331,0.00042985333,0.00024542547,0.00031634528],"domain_scores_gemma":[0.9992231,0.00021850057,0.00007235382,0.00034019753,0.000058483885,0.000087359374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034311254,0.00012894525,0.00012824296,0.00011781323,0.00023273157,0.0003016396,0.00047535822,0.00008211754,0.000007279054],"category_scores_gemma":[0.000011256088,0.00012676172,0.0000404123,0.00068349804,0.00004922637,0.0003292109,0.0004481472,0.0001451581,0.000025656165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014176472,0.00011662735,0.016268887,0.00019379817,0.00014901764,0.000058330774,0.05492127,0.0056861592,0.00048546676,0.37846196,0.36127603,0.1823683],"study_design_scores_gemma":[0.00015673063,0.000024188777,0.003907722,0.00004905798,0.0000043693663,0.00001442727,0.00025953053,0.9325766,0.00029239611,0.0014102892,0.061097756,0.00020694552],"about_ca_topic_score_codex":0.00012099081,"about_ca_topic_score_gemma":0.00006390073,"teacher_disagreement_score":0.92689043,"about_ca_system_score_codex":0.000023446451,"about_ca_system_score_gemma":0.000029126826,"threshold_uncertainty_score":0.5169193},"labels":[],"label_agreement":null},{"id":"W4389628447","doi":"10.1145/3626787","title":"GuaNary: Efficient Buffer Overflow Detection In Virtualized Clouds Using Intel EPT-based Sub-Page Write Protection Support","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Security and Verification in Computing","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":"Engineering and Physical Sciences Research Council; Universitas Brawijaya; Agence Nationale de la Recherche; Microsoft Research","keywords":"Computer science; Buffer overflow; Operating system; Allocator; Virtualization; Guard (computer science); Hypervisor; Memory footprint; Hardware virtualization; Memory leak; Virtual machine; Embedded system; Cloud computing; Memory management; Overlay","score_opus":0.06688120345663011,"score_gpt":0.2732601271727245,"score_spread":0.2063789237160944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389628447","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.94963086,0.00004786121,0.04920523,0.00017054028,0.00036185223,0.0004311326,0.000001344353,0.00011206772,0.00003914245],"genre_scores_gemma":[0.9990855,0.00000309284,0.0008187855,0.000025400223,0.000042470056,0.00000942818,0.0000010480363,0.00001069732,0.0000036049692],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.00010085356,0.00083959784,0.0004935647,0.0011100675,0.0002737127],"domain_scores_gemma":[0.9978665,0.000121524885,0.00085530936,0.0004863984,0.00062013866,0.000050105336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047421283,0.000201584,0.0005234417,0.0010715061,0.0002441928,0.00015512084,0.0010923076,0.00008987921,6.535605e-7],"category_scores_gemma":[0.00077148806,0.00016916305,0.0002380308,0.0042825816,0.00005943516,0.00011822405,0.00040543705,0.00019952051,0.0000011634254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012634083,0.00032675758,0.036575902,0.00088100426,0.0007251086,9.646793e-7,0.0035056733,0.36729312,0.5813302,0.0026192875,0.00006172554,0.0065539237],"study_design_scores_gemma":[0.00040529054,0.00009602207,0.017158365,0.0004843513,0.00014644186,0.0000014507644,0.00025807676,0.9300313,0.051181328,0.00007184485,0.000011420419,0.00015409049],"about_ca_topic_score_codex":0.00014983327,"about_ca_topic_score_gemma":0.0000063370117,"teacher_disagreement_score":0.5627382,"about_ca_system_score_codex":0.000191557,"about_ca_system_score_gemma":0.00004862153,"threshold_uncertainty_score":0.6898269},"labels":[],"label_agreement":null},{"id":"W4390604789","doi":"10.1145/3632922","title":"Indexed Types for a Statically Safe WebAssembly","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Benchmark (surveying); Compile time; Parallel computing; Suite; Overhead (engineering); Memory safety; Programming language; Spec#; Binary number; Optimizing compiler; Arithmetic; Mathematics","score_opus":0.021009526633197807,"score_gpt":0.3041145624493795,"score_spread":0.2831050358161817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604789","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.73194313,0.005189543,0.13969158,0.09712461,0.0035396714,0.0044432576,0.000030936026,0.0037840628,0.014253202],"genre_scores_gemma":[0.81066614,0.0000049695277,0.1887102,0.00020893253,0.00010284846,0.000060152972,6.957656e-7,0.000012803802,0.000233251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990176,0.000006003345,0.00020655915,0.0003021602,0.00024649527,0.00022118216],"domain_scores_gemma":[0.99902105,0.0003414663,0.000094012445,0.0003474402,0.00015814183,0.000037883707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050527294,0.00010888801,0.000120190896,0.0000871582,0.00012031038,0.00039267738,0.0020204296,0.00005173847,0.0000035047285],"category_scores_gemma":[0.0013394871,0.00007576877,0.000100830366,0.000447564,0.000049234655,0.00021328042,0.00045873973,0.00013608499,0.000008041161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016543017,0.00007588021,0.0002707567,0.0005416894,0.000054920118,8.8855e-7,0.0038741417,0.0000057045295,0.0063618636,0.6732872,0.0036135172,0.31189686],"study_design_scores_gemma":[0.0013196485,0.0015002253,0.0040622805,0.0031848813,0.0001794665,0.000079837046,0.0036602137,0.068297625,0.4091784,0.26046905,0.2466651,0.0014032627],"about_ca_topic_score_codex":0.00000538976,"about_ca_topic_score_gemma":6.250129e-7,"teacher_disagreement_score":0.41281816,"about_ca_system_score_codex":0.000025314808,"about_ca_system_score_gemma":0.000044502143,"threshold_uncertainty_score":0.3786597},"labels":[],"label_agreement":null},{"id":"W4391420895","doi":"10.1109/host55342.2024.10545398","title":"Data-Oblivious ML Accelerators Using Hardware Security Extensions","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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; Confidentiality; Overhead (engineering); Field-programmable gate array; Embedded system; Cryptography; Side channel attack; Homomorphic encryption; Operating system; Computer security","score_opus":0.1720966076992857,"score_gpt":0.36567787628213333,"score_spread":0.19358126858284763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391420895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044786315,0.0032343087,0.92394173,0.002904488,0.013818825,0.000751464,0.00041018377,0.0031217074,0.007030948],"genre_scores_gemma":[0.8498461,0.00010443006,0.1476264,0.0009774507,0.00096368714,0.000016566426,0.00021987811,0.00005244842,0.00019299028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962328,0.00015127931,0.00061228144,0.0020038101,0.0005507192,0.00044910482],"domain_scores_gemma":[0.99440414,0.0001764174,0.00022159462,0.0047262893,0.0002725298,0.00019904118],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008089821,0.00041516084,0.00041752378,0.00031362346,0.00035349152,0.0018687313,0.0053682663,0.00039296423,0.000099338584],"category_scores_gemma":[0.00013786134,0.00040420072,0.00015970615,0.0006459647,0.000068492394,0.00042062777,0.026958132,0.001580954,0.00025290513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009752202,0.00067750906,0.00034824142,0.00224983,0.00071119115,0.00059890165,0.011743214,0.011428645,0.0005000089,0.68326783,0.24271904,0.045745816],"study_design_scores_gemma":[0.00006013514,0.000007448843,0.0000485861,0.00028350842,0.00004183496,0.00005317021,0.00006973194,0.91743004,0.00021587507,0.06327576,0.018007282,0.0005066073],"about_ca_topic_score_codex":0.00029637924,"about_ca_topic_score_gemma":0.000042260806,"teacher_disagreement_score":0.9060014,"about_ca_system_score_codex":0.00013854682,"about_ca_system_score_gemma":0.00074717484,"threshold_uncertainty_score":0.999841},"labels":[],"label_agreement":null},{"id":"W4391560673","doi":"10.18260/1-2--41731","title":"Mini-projects based Cybersecurity Modules for an Operating System Course using xv6","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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; Air Force Research Laboratory; National Science Foundation; University of Toledo; National Aeronautics and Space Administration; U.S. Department of Energy","keywords":"Course (navigation); Computer science; Computer security; Operating system; Software engineering; Engineering; Aerospace engineering","score_opus":0.085314149976753,"score_gpt":0.3354238141336449,"score_spread":0.2501096641568919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391560673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06296627,0.00016971857,0.9331629,0.00023640707,0.0011796011,0.00034210287,0.0000066360667,0.0008984714,0.0010378665],"genre_scores_gemma":[0.6807711,2.897849e-7,0.31883675,0.0001383763,0.00020397198,0.000018126471,0.0000045074703,0.000010459204,0.000016397225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856097,0.000091705755,0.00028015455,0.0005790309,0.00020814962,0.0002799677],"domain_scores_gemma":[0.9989892,0.00023659942,0.00004983611,0.0004966084,0.00013287712,0.00009485631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076311297,0.00014726861,0.00014910982,0.00009987131,0.00037522372,0.0009257608,0.00057974167,0.00007579424,0.000006433727],"category_scores_gemma":[0.000033007313,0.0001372061,0.000080749895,0.00036794326,0.000028059962,0.00072181335,0.00008664757,0.00010717679,0.000010928239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045448146,0.00012769665,0.00010815855,0.000811324,0.00003898796,0.00001868083,0.004670671,0.013183314,0.0038288296,0.95883584,0.0008664836,0.017505478],"study_design_scores_gemma":[0.00014506238,0.000054352982,0.000036811227,0.0001849433,0.000011453016,0.000021329042,0.00079958135,0.9937651,0.004014451,0.00020737674,0.0005661677,0.000193369],"about_ca_topic_score_codex":0.00013862104,"about_ca_topic_score_gemma":0.000016466984,"teacher_disagreement_score":0.98058176,"about_ca_system_score_codex":0.000092540104,"about_ca_system_score_gemma":0.0002463541,"threshold_uncertainty_score":0.89271325},"labels":[],"label_agreement":null},{"id":"W4392194197","doi":"10.5539/cis.v17n1p9","title":"On Preventing and Mitigating Cache Based Side-Channel Attacks on AES System in Virtualized Environments","year":2024,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Security and Verification in Computing","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":"Shaqra University","keywords":"Computer science; Cache; Side channel attack; Channel (broadcasting); Embedded system; Computer security; Operating system; Computer network; Cryptography","score_opus":0.01686180266431363,"score_gpt":0.25604557844286613,"score_spread":0.2391837757785525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392194197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18770565,0.000054758395,0.80956596,0.00025344934,0.00055635377,0.00018639395,0.000001652506,0.00013493093,0.0015408124],"genre_scores_gemma":[0.99050605,0.000006688113,0.008680995,0.00075579726,0.000031801766,0.000009270304,0.0000020766781,0.0000026300725,0.000004676787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986487,0.000051186224,0.000358072,0.00032728296,0.00039845577,0.00021628292],"domain_scores_gemma":[0.99926776,0.00030231383,0.00009211224,0.00022744281,0.000025214493,0.00008513768],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011996751,0.00012034771,0.0001111257,0.00042308916,0.00031744732,0.0010427705,0.00037783667,0.000038212173,9.780176e-7],"category_scores_gemma":[0.000051590832,0.00010928307,0.000021469623,0.0006031042,0.00011802743,0.0034696953,0.0002136962,0.00014655244,0.000027907308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012769353,0.00005597873,0.0003510045,0.00051242334,0.000009148667,0.000009550309,0.018832924,0.03581609,0.00041450717,0.5659885,0.00018062288,0.3778165],"study_design_scores_gemma":[0.00022874934,0.000069816495,0.0030152642,0.0004706832,0.0000010351503,0.000010774118,0.00011433329,0.9941167,0.0008570291,0.00028848197,0.00070192816,0.0001251661],"about_ca_topic_score_codex":0.0000057164452,"about_ca_topic_score_gemma":2.0088976e-7,"teacher_disagreement_score":0.95830065,"about_ca_system_score_codex":0.000083922874,"about_ca_system_score_gemma":0.00005896881,"threshold_uncertainty_score":0.9999942},"labels":[],"label_agreement":null},{"id":"W4393651954","doi":"10.5281/zenodo.5225650","title":"Copilot CWE Scenarios Dataset","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Security and Verification in Computing","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","score_opus":0.058175341872964935,"score_gpt":0.27617137323830265,"score_spread":0.2179960313653377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393651954","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.000005778238,0.00020260933,0.02035147,0.00083843124,0.00054976344,0.00030240626,0.9749937,0.00065733975,0.0020984712],"genre_scores_gemma":[0.000082204526,0.000254879,0.0012283537,0.00072814664,0.0003388551,4.5717872e-8,0.9968063,0.00047111564,0.00009008766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968003,0.00060715294,0.0004304485,0.0010003361,0.0006744901,0.00048724274],"domain_scores_gemma":[0.99649084,0.00006741921,0.00026767343,0.0023072877,0.00061959564,0.00024721186],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00089933636,0.00027109002,0.00027654995,0.00032360147,0.002753111,0.003345214,0.005615898,0.00018453016,0.008781776],"category_scores_gemma":[0.00083068275,0.00031365576,0.000074324416,0.000996368,0.00013746039,0.00043769955,0.0059985663,0.0007591938,0.01739315],"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.0000053198155,0.00014093831,3.4624502e-8,0.000114650225,0.00003723623,0.00004926467,0.00011415871,0.000020367146,0.000034083518,0.0014367613,0.98615664,0.011890515],"study_design_scores_gemma":[0.00024899936,0.00009363358,0.000007603797,0.00008279996,0.000015273283,0.00022132912,0.00003342556,0.0009037186,0.00004274082,0.00007419838,0.9979458,0.00033050243],"about_ca_topic_score_codex":0.000047637328,"about_ca_topic_score_gemma":7.7827804e-7,"teacher_disagreement_score":0.02181258,"about_ca_system_score_codex":0.0001783757,"about_ca_system_score_gemma":0.00002308288,"threshold_uncertainty_score":0.9999316},"labels":[],"label_agreement":null},{"id":"W4393656429","doi":"10.1109/aiccsa59173.2023.10479230","title":"Design and Development of Policy Enforcement for the Privacy by Design Framework","year":2023,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Ontario Tech University","funders":"","keywords":"Enforcement; Computer science; Computer security; Development (topology); Law enforcement; Information privacy; Privacy by Design; Internet privacy; Process management; Business; Political science; Law; Mathematics","score_opus":0.09988092373293589,"score_gpt":0.3294455317335659,"score_spread":0.22956460800063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393656429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00023655551,0.00006488449,0.9974844,0.0015651027,0.00007881092,0.00041079038,2.464531e-7,0.000099988916,0.000059211707],"genre_scores_gemma":[0.16078469,0.00002469601,0.8386617,0.0003248502,0.000026020607,0.000062338026,8.0215375e-7,0.0000038092421,0.0001110983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992869,0.000038691236,0.0001968844,0.00017034856,0.00014011358,0.00016708479],"domain_scores_gemma":[0.9978802,0.0017143915,0.00006578853,0.00026155254,0.000044517365,0.000033552235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085965294,0.00006599406,0.000069845766,0.00005889068,0.00024661035,0.00007344343,0.0005365309,0.00003367465,0.0000065969134],"category_scores_gemma":[0.00015299008,0.00004682188,0.000014298473,0.00036227712,0.00002564665,0.00007551477,0.00019500448,0.000042282474,0.0000092477585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012349683,0.000034960827,0.000022413338,0.000036662073,0.000050212697,1.6103012e-7,0.022780625,0.0056788865,0.0009091859,0.6784844,0.014601201,0.27738896],"study_design_scores_gemma":[0.00022413279,0.000064964865,0.00016065997,0.000024695619,0.000002877443,0.0000011392656,0.0002535921,0.87874365,0.053741314,0.02533683,0.041300666,0.00014550217],"about_ca_topic_score_codex":0.00000829251,"about_ca_topic_score_gemma":6.922515e-8,"teacher_disagreement_score":0.87306476,"about_ca_system_score_codex":0.000021987253,"about_ca_system_score_gemma":0.00016404603,"threshold_uncertainty_score":0.19093409},"labels":[],"label_agreement":null},{"id":"W4394999111","doi":"10.1145/3620665.3640416","title":"Cornucopia Reloaded: Load Barriers for CHERI Heap Temporal Safety","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Microsoft (Canada)","funders":"Innovate UK; Defense Advanced Research Projects Agency","keywords":"Heap (data structure); Computer science; Memory safety; Architecture; Software; Computer security; Embedded system; Operating system; Programming language; History","score_opus":0.021890819620466767,"score_gpt":0.2813063041764237,"score_spread":0.259415484555957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394999111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012559266,0.00039937216,0.981092,0.0055506364,0.0018602648,0.00022414395,0.0000046329455,0.00081392215,0.008799119],"genre_scores_gemma":[0.8589915,0.000020769992,0.13555415,0.0015918374,0.0003510586,0.00003299969,0.000007536463,0.000017282777,0.0034328746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988262,0.000028103834,0.00025381896,0.00044381546,0.00020264764,0.0002454088],"domain_scores_gemma":[0.9991465,0.00020456527,0.00003166892,0.0004010626,0.00008457462,0.00013163286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348717,0.00011297014,0.000115547715,0.00005212017,0.00020516885,0.00034541806,0.0005900189,0.00007313501,0.00012665648],"category_scores_gemma":[0.00009040483,0.00010332598,0.00009395158,0.00037358256,0.00003697014,0.00035540902,0.00011865511,0.00012600704,0.00013449877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015726839,0.000016745527,0.00019022086,0.0001194184,0.00003353959,0.0000073859214,0.0024870404,0.00008337869,0.00035861254,0.89637506,0.054566085,0.04574681],"study_design_scores_gemma":[0.00018122808,0.000050673993,0.00013168283,0.000043362706,0.0000036048295,0.0000123737545,0.00008396504,0.40318218,0.0014309352,0.0075114677,0.58718127,0.00018725637],"about_ca_topic_score_codex":0.000042028892,"about_ca_topic_score_gemma":0.0000074617606,"teacher_disagreement_score":0.88886356,"about_ca_system_score_codex":0.00011331002,"about_ca_system_score_gemma":0.0003628039,"threshold_uncertainty_score":0.42135113},"labels":[],"label_agreement":null},{"id":"W4395116903","doi":"10.1007/978-3-031-57537-2_24","title":"Hardening Systems Against Data Corruption Attacks at Design Time","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Computer science; Hardening (computing); Computer security; Composite material; Materials science","score_opus":0.06717173230116774,"score_gpt":0.2851707081747515,"score_spread":0.21799897587358374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395116903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000024284947,0.0022318873,0.9861047,0.00047836723,0.005910324,0.00055815117,0.000021928212,0.0005567272,0.004113592],"genre_scores_gemma":[0.08417285,0.00032873542,0.89688426,0.002404746,0.004333538,0.00003667154,0.00027515728,0.00022228579,0.0113417255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942895,0.00008455363,0.00078645133,0.0027722965,0.0013431406,0.00072405353],"domain_scores_gemma":[0.9946461,0.0009823156,0.00040420436,0.0035119895,0.00025439195,0.00020103824],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025763323,0.00060758373,0.00057893654,0.0008234403,0.0005399087,0.0019660532,0.007582592,0.00042949052,0.000023781999],"category_scores_gemma":[0.00012770269,0.0005956208,0.00010464987,0.000767694,0.00045827116,0.0009653481,0.0060183643,0.0010104666,0.0010575501],"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.00001425969,0.000041645097,0.000017826707,0.00029088874,0.000064030784,0.0003529497,0.0019969656,0.5694364,0.00080043054,0.032729093,0.0019948734,0.39226067],"study_design_scores_gemma":[0.00011689737,0.00006101489,0.0000061228657,0.0009951191,0.0000132239875,0.00014460413,1.888603e-7,0.97490776,0.00020923918,0.010764141,0.012134372,0.0006473232],"about_ca_topic_score_codex":0.000011463089,"about_ca_topic_score_gemma":0.0000056962454,"teacher_disagreement_score":0.40547138,"about_ca_system_score_codex":0.00073173374,"about_ca_system_score_gemma":0.00053366186,"threshold_uncertainty_score":0.9997202},"labels":[],"label_agreement":null},{"id":"W4395674906","doi":"10.3390/fi16050148","title":"HSM4SSL: Leveraging HSMs for Enhanced Intra-Domain Security","year":2024,"lang":"en","type":"article","venue":"Future Internet","topic":"Security and Verification in Computing","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transport Layer Security; Computer security; Authentication (law); Cryptography; Domain (mathematical analysis); Cryptographic protocol; Security service; Key management; Security domain; Information security; Encryption","score_opus":0.013638667979313467,"score_gpt":0.26395511826280926,"score_spread":0.2503164502834958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395674906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026184728,0.0011648205,0.9585179,0.0040612887,0.007169665,0.00024370293,0.0000068540394,0.0006259118,0.002025098],"genre_scores_gemma":[0.9568287,0.000013205321,0.03953774,0.0008427978,0.0022740276,0.000052694068,0.000013559332,0.00001728058,0.00041999365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986488,0.000048704187,0.00026619283,0.00055728736,0.00018056048,0.00029845387],"domain_scores_gemma":[0.9992233,0.00018333152,0.0000524962,0.00039473257,0.00007054983,0.000075617005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039401732,0.0001644282,0.00014846255,0.00010858003,0.000082565966,0.00054118177,0.00089121767,0.00009769233,0.000059638172],"category_scores_gemma":[0.000028241227,0.00015522898,0.00012369145,0.00029758803,0.000028097807,0.00036850665,0.00017719588,0.00026822777,0.00010787846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013848119,0.00004309013,0.0000120552895,0.00018177408,0.00006441583,0.000017145807,0.02657855,0.000021060028,0.0029983118,0.8403135,0.092875056,0.036881197],"study_design_scores_gemma":[0.00027469808,0.000088570174,0.00006376441,0.00019700827,0.000007645327,0.00005945865,0.00035332885,0.1606291,0.033000056,0.08742355,0.7175377,0.0003651063],"about_ca_topic_score_codex":0.00001180951,"about_ca_topic_score_gemma":0.000007581059,"teacher_disagreement_score":0.930644,"about_ca_system_score_codex":0.0000750065,"about_ca_system_score_gemma":0.0000586552,"threshold_uncertainty_score":0.6330054},"labels":[],"label_agreement":null},{"id":"W4396980827","doi":"10.1109/isqed60706.2024.10528770","title":"Automated Assertion Checker Generator and Information Flow Tracking for Security Verification","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Assertion; Computer science; Information flow; Generator (circuit theory); Formal verification; Computer security; Programming language; Power (physics)","score_opus":0.0196052131536083,"score_gpt":0.2766176961567687,"score_spread":0.2570124830031604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396980827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0416396,0.00014767094,0.9544711,0.00092113344,0.00062077586,0.00022321983,0.0000039930837,0.0016004972,0.00037199564],"genre_scores_gemma":[0.92542356,0.000023249777,0.07407669,0.00028537572,0.00009492785,0.000038343478,0.0000415162,0.000004516593,0.000011839875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992844,0.000024605395,0.00023253117,0.00021039836,0.00012194309,0.00012613951],"domain_scores_gemma":[0.9995338,0.000064217544,0.000044311135,0.00018684902,0.00012757634,0.000043250548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040886962,0.00008183329,0.00006700965,0.00010965833,0.00016272295,0.00084999274,0.00016123502,0.00007092381,0.0000059460654],"category_scores_gemma":[0.00005206662,0.00007877146,0.000031503296,0.00030068637,0.000012517937,0.0030690997,0.00003613945,0.00006679534,0.000027884142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058878595,0.000026051985,0.000048798247,0.00024671992,0.000022863142,4.5442636e-7,0.005327684,0.0004521601,0.0021344323,0.7228555,0.0044999737,0.26437944],"study_design_scores_gemma":[0.00010453697,0.00001651721,0.0008635917,0.000020439085,0.0000040099785,0.000006298077,0.000030169702,0.95429707,0.006302079,0.0021484774,0.03610536,0.000101452504],"about_ca_topic_score_codex":0.0000057113643,"about_ca_topic_score_gemma":0.0000013196818,"teacher_disagreement_score":0.9538449,"about_ca_system_score_codex":0.000041014482,"about_ca_system_score_gemma":0.000051670224,"threshold_uncertainty_score":0.81964993},"labels":[],"label_agreement":null},{"id":"W4399584967","doi":"10.1145/3672392","title":"A Survey of Hardware Improvements to Secure Program Execution","year":2024,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Security and Verification in Computing","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 Toronto; Carleton University","funders":"","keywords":"Computer science; Hardware security module; Hardware compatibility list; Firmware; Software security assurance; Hardware architecture; Computer security; Correctness; Computer hardware; Embedded system; Covert channel; Software; Cloud computing security; Security service; Security information and event management; Cryptography; Operating system; Information security; Cloud computing; Programming language","score_opus":0.12187724987032461,"score_gpt":0.40189432171320166,"score_spread":0.28001707184287705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399584967","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.000041850708,0.8006198,0.19370896,0.00003964535,0.0028591582,0.0016708572,0.000110665394,0.0008400709,0.00010900059],"genre_scores_gemma":[0.0038073931,0.8955255,0.098171085,0.00014302366,0.00067071576,0.00019949948,0.00101842,0.000223204,0.0002411582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99278,0.0027760458,0.0015761473,0.0014935004,0.0006964934,0.0006777849],"domain_scores_gemma":[0.9944539,0.0013961659,0.00081847113,0.0025202075,0.000593487,0.00021777395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008523838,0.0006826334,0.0017389945,0.0005799846,0.00020691547,0.00054525037,0.0047016325,0.0003921372,0.000005412587],"category_scores_gemma":[0.0015587965,0.00062272593,0.00048786364,0.0036217286,0.000055490505,0.00017497328,0.0035957883,0.0007707003,0.0002510637],"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":[5.474383e-7,0.00010900409,0.00004727475,0.006827118,0.00015243642,0.0000072139846,0.00032910364,0.000012827266,2.215875e-7,0.0006202149,0.0022941006,0.98959994],"study_design_scores_gemma":[0.00025002728,0.00047538267,0.0027121508,0.026119057,0.00033419215,0.000041966825,0.000014750197,0.023897974,0.00000836037,0.00039456386,0.9439974,0.0017541845],"about_ca_topic_score_codex":0.0006090726,"about_ca_topic_score_gemma":0.00006294746,"teacher_disagreement_score":0.9878458,"about_ca_system_score_codex":0.0002026871,"about_ca_system_score_gemma":0.00061726186,"threshold_uncertainty_score":0.9996224},"labels":[],"label_agreement":null},{"id":"W4399688124","doi":"10.1145/3673660.3655056","title":"GuaNary: Efficient Buffer Overflow Detection In Virtualized Clouds Using Intel EPT-based Sub-Page Write Protection Support","year":2024,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Security and Verification in Computing","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":"McGill University","funders":"Universitas Brawijaya","keywords":"Computer science; Buffer overflow; Operating system; Allocator; Virtualization; Hypervisor; Memory footprint; Guard (computer science); Cloud computing; Hardware virtualization; Virtual machine; Memory leak; Embedded system; Memory management; Overlay","score_opus":0.10368549912278802,"score_gpt":0.3533868651650222,"score_spread":0.2497013660422342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399688124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3580003,0.02288841,0.6140864,0.0005140298,0.0019771552,0.0020834683,0.0000024779624,0.00032536263,0.00012238577],"genre_scores_gemma":[0.9866807,0.0047828634,0.0075193266,0.0006096392,0.000110694586,0.00024019832,0.000021324619,0.00002464246,0.000010635812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960299,0.0005425795,0.00097640645,0.00077989313,0.0012980972,0.00037309297],"domain_scores_gemma":[0.99768776,0.00038402635,0.00029616494,0.0010433672,0.00050237624,0.0000862864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00869954,0.0002784324,0.00037426813,0.0012091595,0.00025421684,0.00030686756,0.0008059758,0.000142446,0.00011670387],"category_scores_gemma":[0.0022981053,0.00027544214,0.00016353224,0.008108389,0.00003984279,0.0007570505,0.00020857363,0.00048782778,0.00017297531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001528495,0.00012073295,0.0002834301,0.0024106747,0.000019338997,0.000004582418,0.0002739431,0.027070023,0.0024189225,0.0003725837,0.00014261075,0.96686786],"study_design_scores_gemma":[0.0004050403,0.0001644263,0.001386525,0.002488515,0.000061332685,0.000022249385,0.0000076183837,0.9859713,0.0056167534,0.00009121333,0.0034737098,0.0003113517],"about_ca_topic_score_codex":0.000024429455,"about_ca_topic_score_gemma":0.000004141959,"teacher_disagreement_score":0.96655655,"about_ca_system_score_codex":0.0008430557,"about_ca_system_score_gemma":0.00050323847,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W4399851487","doi":"10.1145/3656448","title":"Compiling Probabilistic Programs for Variable Elimination with Information Flow","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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":"Variable (mathematics); Probabilistic logic; Computer science; Information flow; Programming language; Mathematics; Artificial intelligence; Philosophy","score_opus":0.016204014095643433,"score_gpt":0.2575482061316535,"score_spread":0.2413441920360101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18736868,0.0008983251,0.7793546,0.015062545,0.0016746181,0.007566137,0.000019251782,0.0035980097,0.0044578603],"genre_scores_gemma":[0.578083,0.0000014103653,0.42158198,0.00006566839,0.000063854786,0.00015411989,0.000007365151,0.000009113544,0.000033534936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989817,0.000005939689,0.00024955338,0.0002392528,0.00030435307,0.0002191921],"domain_scores_gemma":[0.99894506,0.00017575039,0.00016343337,0.000324065,0.00036019488,0.000031476386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006067763,0.00012581433,0.000116576746,0.00010843423,0.00018069963,0.00071950327,0.0013538415,0.00005250336,9.879585e-7],"category_scores_gemma":[0.0007845773,0.000083882245,0.00005733016,0.00069569144,0.00005480764,0.0008522913,0.00025254424,0.00013715489,0.000002888624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024802503,0.000084682484,0.00018461696,0.0013813776,0.000036478657,1.850539e-7,0.0049385345,0.00034176107,0.00030735604,0.3605733,0.0004035883,0.63172334],"study_design_scores_gemma":[0.00094366015,0.0012914177,0.00065348594,0.003669866,0.0001283365,0.00006746029,0.0030214905,0.8335244,0.03077466,0.059100874,0.066064626,0.00075974426],"about_ca_topic_score_codex":0.0000068474633,"about_ca_topic_score_gemma":5.0731995e-7,"teacher_disagreement_score":0.83318263,"about_ca_system_score_codex":0.00004936343,"about_ca_system_score_gemma":0.000052303134,"threshold_uncertainty_score":0.6938187},"labels":[],"label_agreement":null},{"id":"W4399851533","doi":"10.1145/3656438","title":"Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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 British Columbia","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Trustworthiness; Computer science; Programming language; Software engineering; Natural language processing; Computer security","score_opus":0.0193190425675604,"score_gpt":0.33013030580165775,"score_spread":0.31081126323409736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851533","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.98063654,0.0007402101,0.0047246697,0.0028134643,0.00074651104,0.0011763315,0.0000066453263,0.0077174306,0.0014382224],"genre_scores_gemma":[0.8267823,0.000008878698,0.17280585,0.00007661713,0.00013187392,0.00013220428,0.000013175606,0.000024472289,0.000024622752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982083,0.000031635882,0.0004418622,0.00052578514,0.0004446272,0.00034779185],"domain_scores_gemma":[0.9986918,0.00009427252,0.00022275049,0.0007177406,0.00018310695,0.00009030371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008109552,0.00022174885,0.00019239816,0.0002143999,0.0002799135,0.00090400595,0.0028117907,0.00011337081,0.0000057580983],"category_scores_gemma":[0.000551713,0.00017340222,0.00014877782,0.0011194649,0.00011122436,0.0011137248,0.00038819353,0.00032623607,0.000008959906],"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.000012975259,0.00017421096,0.0002843539,0.00040179578,0.000052207182,0.0000025906274,0.041864716,0.00003113389,0.008138883,0.025893774,0.00024002843,0.92290336],"study_design_scores_gemma":[0.00096714904,0.0014768231,0.008463183,0.0021526688,0.0001753772,0.000080547994,0.01829193,0.7225583,0.22112787,0.009041154,0.01430519,0.001359803],"about_ca_topic_score_codex":0.000055992685,"about_ca_topic_score_gemma":0.0000047951057,"teacher_disagreement_score":0.92154354,"about_ca_system_score_codex":0.00006429774,"about_ca_system_score_gemma":0.0000800054,"threshold_uncertainty_score":0.871735},"labels":[],"label_agreement":null},{"id":"W4399889523","doi":"10.1145/3661814.3662100","title":"Declassification Policy for Program Complexity Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Theoretical computer science","score_opus":0.10370642738586525,"score_gpt":0.3979294828647192,"score_spread":0.29422305547885397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399889523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090615806,0.00008100627,0.98693645,0.0068648807,0.00016963332,0.00023858756,0.0000025821782,0.0010759574,0.0037247692],"genre_scores_gemma":[0.67305726,0.0000035276887,0.32629,0.0001747259,0.00013316843,0.00007349078,0.000015803047,0.0000031810146,0.00024882884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.000023430382,0.00016771538,0.0003317818,0.00011632474,0.00015437293],"domain_scores_gemma":[0.999326,0.00014738733,0.000027622797,0.00036959097,0.000079320984,0.00005009917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002676534,0.000065032,0.00008809631,0.00032272987,0.0001320562,0.00053459493,0.0004514712,0.000033786317,0.000014266858],"category_scores_gemma":[0.000040639414,0.00005835702,0.00013703325,0.0022877073,0.00003366941,0.00023486011,0.00005854113,0.000047997262,0.000035245394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.5123525e-7,0.000028584125,0.000051214414,0.000015168551,0.00006298163,1.513937e-7,0.0002119845,0.000048106245,0.000029641906,0.8505392,0.0007480452,0.14826444],"study_design_scores_gemma":[0.000032592467,0.000020592668,0.002016086,0.0000032330197,0.000024993158,0.0000012132308,0.000013843581,0.8918503,0.00025704305,0.035487596,0.07021952,0.000073017116],"about_ca_topic_score_codex":0.000051906594,"about_ca_topic_score_gemma":0.000016050659,"teacher_disagreement_score":0.8918022,"about_ca_system_score_codex":0.000051165865,"about_ca_system_score_gemma":0.000093627175,"threshold_uncertainty_score":0.51551116},"labels":[],"label_agreement":null},{"id":"W4400065514","doi":"10.1016/j.cose.2024.103971","title":"Detecting command injection vulnerabilities in Linux-based embedded firmware with LLM-based taint analysis of library functions","year":2024,"lang":"en","type":"article","venue":"Computers & Security","topic":"Security and Verification in Computing","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":"Carleton University","funders":"","keywords":"Firmware; Computer science; Taint checking; Operating system; Embedded system; Software","score_opus":0.01266985832429048,"score_gpt":0.2408840868425788,"score_spread":0.22821422851828832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400065514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3469951,0.00025812333,0.6509009,0.0005327797,0.00038960975,0.00019495652,0.000015273266,0.00054495,0.00016833274],"genre_scores_gemma":[0.9818613,0.000002071736,0.017677981,0.00025964392,0.00008462745,0.000027857894,0.000060237508,0.000017493787,0.000008793381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771935,0.0003387717,0.0005622767,0.0007169079,0.00034292103,0.00031979688],"domain_scores_gemma":[0.99762625,0.0012413646,0.00016718684,0.00074931094,0.00011743281,0.00009847385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541398,0.00025824152,0.00043687693,0.001248974,0.00023408904,0.00043415354,0.00064957363,0.00011982603,0.0000314],"category_scores_gemma":[0.000047581834,0.00024287587,0.0002389772,0.004594671,0.00013437751,0.0006824512,0.00016885121,0.00049294706,0.000004088874],"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.00011101485,0.0006767782,0.025581902,0.00077099534,0.0005671656,0.000058796744,0.0135204205,0.926952,0.000054424454,0.0111527955,0.0012398438,0.019313848],"study_design_scores_gemma":[0.0003626939,0.00027907788,0.0055610733,0.0002682577,0.00009631995,0.000004882478,0.00036093907,0.99046016,0.00086456747,0.00078955025,0.0006799907,0.00027247457],"about_ca_topic_score_codex":0.00017884081,"about_ca_topic_score_gemma":0.00024090735,"teacher_disagreement_score":0.6348662,"about_ca_system_score_codex":0.00011964809,"about_ca_system_score_gemma":0.0003268826,"threshold_uncertainty_score":0.9904191},"labels":[],"label_agreement":null},{"id":"W4400484650","doi":"10.1145/3663529.3663849","title":"Rethinking Software Engineering in the Era of Foundation Models: A Curated Catalogue of Challenges in the Development of Trustworthy FMware","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"York University; Huawei Technologies (Canada); Queen's University","funders":"","keywords":"Trustworthiness; Foundation (evidence); Computer science; Software engineering; Software development; Software; Data science; Computer security; History; Programming language; Archaeology","score_opus":0.09938154788201323,"score_gpt":0.27596787661412264,"score_spread":0.17658632873210942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29730648,0.0011832528,0.70025647,0.0007398867,0.000111856185,0.00019087645,8.4727765e-7,0.000055010136,0.00015531805],"genre_scores_gemma":[0.95537776,0.000053501288,0.0445171,0.000018934903,0.000009105058,0.0000125010765,0.0000074552404,0.000003111901,5.441437e-7],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990124,0.000079120924,0.0004069627,0.00016462941,0.0002411027,0.00009576108],"domain_scores_gemma":[0.99908555,0.0005005392,0.000076687,0.00026908558,0.000061614344,0.000006547892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013577102,0.00006959253,0.00011039234,0.00012028294,0.000028499944,0.000034367862,0.00064356625,0.000041240703,0.0000014464821],"category_scores_gemma":[0.00007430737,0.00004599694,0.000025898278,0.0006616632,0.000017530041,0.00025989703,0.0000751733,0.00018924577,5.146793e-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.000003575588,0.00008088582,0.0002483605,0.00054541236,0.000018582141,0.000002919727,0.47873804,0.041348834,0.00007039758,0.3606243,0.000009400091,0.11830928],"study_design_scores_gemma":[0.00011171366,0.000021803095,0.003914707,0.0005149752,0.0000023609175,0.0000049948967,0.0020700833,0.9837919,0.0011776085,0.00819727,0.000109142304,0.00008344432],"about_ca_topic_score_codex":0.00006257118,"about_ca_topic_score_gemma":0.00020661106,"teacher_disagreement_score":0.9424431,"about_ca_system_score_codex":0.000024592946,"about_ca_system_score_gemma":0.00011467925,"threshold_uncertainty_score":0.18757008},"labels":[],"label_agreement":null},{"id":"W4400577081","doi":"10.5220/0012714800003767","title":"LAMA: Leakage Abuse Attacks Against Microsoft Always Encrypted","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Computer security; Encryption; Computer science; Leakage (economics); Internet privacy","score_opus":0.015686659012149877,"score_gpt":0.2583831054657835,"score_spread":0.24269644645363364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400577081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049037173,0.00074582756,0.91986823,0.0014882532,0.0014982098,0.00011990968,0.0000022135562,0.0017302865,0.025509913],"genre_scores_gemma":[0.94835484,0.00009742284,0.047783248,0.0018132685,0.0002566793,0.000009224211,0.000008158021,0.000015896152,0.0016612586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873847,0.000041825013,0.00024171526,0.00049973617,0.00020119105,0.0002770528],"domain_scores_gemma":[0.99906963,0.0002033732,0.00003086822,0.0005504297,0.0000603196,0.00008536012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002916306,0.00013560397,0.000110987625,0.00012111813,0.00016962983,0.0006931203,0.0008520701,0.000077127756,0.00007248695],"category_scores_gemma":[0.000023965833,0.00012427334,0.00008372006,0.0006263531,0.000042327327,0.0004798802,0.00015796233,0.00020306221,0.0010265195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033472213,0.00012282164,0.0002710102,0.00015082193,0.00006814806,0.00015810803,0.01165872,0.0002983567,0.024233552,0.7851182,0.07276132,0.10515559],"study_design_scores_gemma":[0.00023125419,0.00003604627,0.0005714944,0.00012121729,0.0000061890773,0.000041036343,0.000113726666,0.5618569,0.02001145,0.0026451303,0.4139098,0.00045570394],"about_ca_topic_score_codex":0.000012491692,"about_ca_topic_score_gemma":0.000004753438,"teacher_disagreement_score":0.8993177,"about_ca_system_score_codex":0.000043031374,"about_ca_system_score_gemma":0.00007021589,"threshold_uncertainty_score":0.99975127},"labels":[],"label_agreement":null},{"id":"W4400905308","doi":"10.1109/tnse.2024.3432836","title":"LURK-T: Limited Use of Remote Keys With Added Trust in TLS 1.3","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Security and Verification in Computing","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.02142975175309364,"score_gpt":0.2212832210649008,"score_spread":0.19985346931180717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400905308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08045271,0.00009784849,0.91850305,0.00013180703,0.0005319753,0.00007901228,8.0474166e-7,0.00015352736,0.000049293347],"genre_scores_gemma":[0.9385703,0.00006927324,0.061259314,0.000042322557,0.000032278895,0.0000032443882,1.09498366e-7,0.0000064867927,0.000016623426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.000010500025,0.00017448385,0.00032782022,0.00026023292,0.00026070693],"domain_scores_gemma":[0.999439,0.0001633436,0.000020598667,0.0002519645,0.00005484335,0.00007025028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004160586,0.000100419646,0.0001070963,0.00032400084,0.00012066514,0.00023412041,0.00028031997,0.00003652361,0.0000027037865],"category_scores_gemma":[0.000009051467,0.000090645044,0.000022149896,0.0027205579,0.000087506174,0.0007734815,0.0000040557866,0.00020183595,0.0000018721918],"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.0000051514276,0.000014801819,0.000014231151,0.00003427951,0.0000068986,0.00000816465,0.0006627056,0.93551034,0.0011982721,0.0027983652,0.000025065483,0.059721705],"study_design_scores_gemma":[0.00007868083,0.0000515478,0.00045543213,0.00028609883,0.0000036999704,0.000017944809,0.000011975094,0.9950979,0.0027820892,0.00003704403,0.0010661838,0.00011144561],"about_ca_topic_score_codex":0.00003289281,"about_ca_topic_score_gemma":0.000010713527,"teacher_disagreement_score":0.85811764,"about_ca_system_score_codex":0.000044813387,"about_ca_system_score_gemma":0.00009886067,"threshold_uncertainty_score":0.36963978},"labels":[],"label_agreement":null},{"id":"W4401211773","doi":"10.1109/isca59077.2024.00087","title":"PrIDE: Achieving Secure Rowhammer Mitigation with Low-Cost In-DRAM Trackers","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Dram; Pride; Computer science; BitTorrent tracker; Computer security; Computer network; Computer hardware; Artificial intelligence","score_opus":0.01034302849183613,"score_gpt":0.2527210853787298,"score_spread":0.24237805688689365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17018044,0.00018846868,0.8202558,0.003892505,0.0004567427,0.00023800578,7.1898734e-7,0.00044216382,0.0043451623],"genre_scores_gemma":[0.9756326,0.000008475878,0.023682922,0.0004335807,0.0000874886,0.000016823742,0.000004066409,0.000009177579,0.0001248856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890864,0.0000423075,0.0002039256,0.0004064031,0.00022000878,0.00021870085],"domain_scores_gemma":[0.99943614,0.00013802455,0.000033574233,0.00029110382,0.00004195773,0.000059172133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030442624,0.00011551591,0.00009414477,0.00014580965,0.00008516633,0.00047534288,0.00038550232,0.000056645145,0.000030365296],"category_scores_gemma":[0.000021015452,0.00009321333,0.000034993776,0.00082530983,0.000030405761,0.0008050326,0.000063336964,0.00022929358,0.00008584188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001512698,0.0001617072,0.014003572,0.00034669426,0.00005327593,0.000135289,0.016792325,0.0043944963,0.0012048874,0.7296965,0.004046078,0.22915001],"study_design_scores_gemma":[0.0003931725,0.000055516375,0.017911391,0.0006192742,0.000007983886,0.000074453994,0.0004091394,0.95230997,0.0063354736,0.0023556645,0.019044857,0.00048311922],"about_ca_topic_score_codex":0.000026900247,"about_ca_topic_score_gemma":0.00004722089,"teacher_disagreement_score":0.94791543,"about_ca_system_score_codex":0.000064341126,"about_ca_system_score_gemma":0.0001020899,"threshold_uncertainty_score":0.45837423},"labels":[],"label_agreement":null},{"id":"W4402064934","doi":"10.1016/b978-0-443-13223-0.00033-3","title":"Security Metrics: An Introduction and Literature Review","year":2013,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Security and Verification in Computing","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":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.015025918062199373,"score_gpt":0.24680762950994378,"score_spread":0.2317817114477444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402064934","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.000006036886,0.17512573,0.0011254647,0.0020334309,0.0012843364,0.00082341995,0.000009426971,0.00029089238,0.81930125],"genre_scores_gemma":[0.00016652494,0.061315224,0.014885427,0.003646388,0.003216143,0.000059576887,0.00008881567,0.0000717072,0.9165502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979052,0.000087303495,0.00048415954,0.0009242042,0.0003683841,0.0002307597],"domain_scores_gemma":[0.99774784,0.00006473778,0.00036199455,0.0012927342,0.00035152055,0.0001811716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006429136,0.0003716866,0.00048206843,0.00025800298,0.00018447918,0.0004699398,0.00080502935,0.00031866634,0.000097898956],"category_scores_gemma":[0.000060887432,0.00035172453,0.000120145785,0.000092317794,0.00008068246,0.00044287232,0.00033038858,0.0007479308,0.000108035165],"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":[5.122167e-7,0.0000051579104,2.6467288e-7,0.00067116594,0.00001829469,0.0000072014636,0.00037477433,6.579053e-8,0.0000016693305,0.20333606,0.0026856922,0.79289913],"study_design_scores_gemma":[0.0000666253,0.00004935148,0.0000027255792,0.0018090958,0.000035523743,0.00014840523,0.0000017565317,0.0005524579,0.000010194464,0.036335353,0.9606159,0.0003726462],"about_ca_topic_score_codex":2.4986326e-7,"about_ca_topic_score_gemma":0.0000010129498,"teacher_disagreement_score":0.95793015,"about_ca_system_score_codex":0.00005735359,"about_ca_system_score_gemma":0.00005862693,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W4402288699","doi":"10.1109/sp54263.2024.00078","title":"Certifying Zero-Knowledge Circuits with Refinement Types","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"","keywords":"Zero-knowledge proof; Computer science; Zero (linguistics); Electronic circuit; Algorithm; Electrical engineering; Engineering; Cryptography","score_opus":0.047032836730268895,"score_gpt":0.28775881248646606,"score_spread":0.24072597575619717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402288699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024688628,0.0010780746,0.92266697,0.0011136049,0.00054767565,0.00006027456,2.0959703e-7,0.0006259644,0.07143835],"genre_scores_gemma":[0.9843305,0.000011184067,0.013879424,0.00018212527,0.000082440274,0.0000075040157,8.1483466e-7,0.0000062887384,0.0014997242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928755,0.00001959536,0.00011743744,0.000299196,0.00012546944,0.00015073777],"domain_scores_gemma":[0.9995223,0.00008095116,0.000015179727,0.00028846253,0.000048466412,0.000044618486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017469398,0.000075898366,0.000061997016,0.000076897624,0.000101560145,0.00031992566,0.00036612098,0.000024551866,0.000058759062],"category_scores_gemma":[0.000007931661,0.000056910434,0.000022936754,0.00044137667,0.000016036085,0.00021986518,0.00010223286,0.000088338296,0.00037672874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.812473e-7,0.000035131605,0.0001309618,0.00007638258,0.000026650889,0.000012685456,0.0024449902,0.00010890152,0.0003574852,0.78410816,0.0067511415,0.2059468],"study_design_scores_gemma":[0.00022999146,0.00013760396,0.0008531009,0.0003323256,0.00001438484,0.000075519274,0.00008315012,0.5609438,0.007902327,0.008096423,0.42086366,0.00046771392],"about_ca_topic_score_codex":0.000010072034,"about_ca_topic_score_gemma":0.0000062127856,"teacher_disagreement_score":0.98186165,"about_ca_system_score_codex":0.000034182292,"about_ca_system_score_gemma":0.000074738746,"threshold_uncertainty_score":0.48422113},"labels":[],"label_agreement":null},{"id":"W4402705716","doi":"10.1145/3658644.3690255","title":"AutoPatch: Automated Generation of Hotpatches for Real-Time Embedded Devices","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reboot; Embedded system; Compiler; Overhead (engineering); Software; Embedded software; State (computer science); Vulnerability (computing); Operating system; Computer security; Programming language","score_opus":0.06944360564436415,"score_gpt":0.3251459770016748,"score_spread":0.25570237135731066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402705716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16262852,0.00043478434,0.818477,0.0023725051,0.0037488576,0.0012598133,0.000059144775,0.005833367,0.005186042],"genre_scores_gemma":[0.6071264,0.000032259748,0.39123034,0.00011182228,0.00042582906,0.000117345306,0.0001281479,0.000025624193,0.00080218643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980848,0.00008109363,0.00061192206,0.00074495125,0.0002624699,0.00021476521],"domain_scores_gemma":[0.99824214,0.00020335293,0.0003408548,0.00084546045,0.00030767737,0.000060540584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006546432,0.00023685808,0.0003553381,0.00019875748,0.00009069812,0.0003871006,0.0010612595,0.0003042662,0.000025182917],"category_scores_gemma":[0.000056274068,0.00022654743,0.00018704018,0.0002709976,0.000032703563,0.00011393435,0.0011252707,0.00022439336,0.00005667939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003051672,0.0005276264,0.00013950563,0.0077995686,0.0007744403,0.000013862956,0.030048218,0.039264545,0.112095825,0.6082511,0.14620039,0.054854408],"study_design_scores_gemma":[0.00008425916,0.000031609987,0.00010064257,0.00014950216,0.000026215457,0.0000024152037,0.00001954451,0.955328,0.02569234,0.017927114,0.00040239294,0.00023598243],"about_ca_topic_score_codex":0.00015759745,"about_ca_topic_score_gemma":0.000016973332,"teacher_disagreement_score":0.9160634,"about_ca_system_score_codex":0.00005995824,"about_ca_system_score_gemma":0.0003507639,"threshold_uncertainty_score":0.9238336},"labels":[],"label_agreement":null},{"id":"W4403024154","doi":"10.1109/lad62341.2024.10691745","title":"Toward Hardware Security Benchmarking of LLMs","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Benchmarking; Computer science; Computer security; Business","score_opus":0.033683457291255235,"score_gpt":0.27397166188679456,"score_spread":0.24028820459553932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403024154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013055288,0.0006754609,0.959574,0.0011242293,0.0013725657,0.00006714136,0.0000017611641,0.0004475026,0.023682067],"genre_scores_gemma":[0.97450006,0.000015740863,0.025152838,0.000120896766,0.00012351382,0.0000023824664,0.0000014319443,0.0000035189316,0.000079627454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919176,0.000027593333,0.000192192,0.00027006748,0.0001865755,0.00013179329],"domain_scores_gemma":[0.9994525,0.00012526575,0.000029667277,0.00029805224,0.000054658285,0.00003989798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028509522,0.00006858993,0.00008976746,0.000084395804,0.000047238234,0.00016273353,0.00052968925,0.000039752347,0.000113295784],"category_scores_gemma":[0.000019506188,0.0000622074,0.000066658395,0.00042202265,0.0000246977,0.00030049702,0.00019299204,0.00010696835,0.000044061682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.5946557e-7,0.000020205256,0.00014561172,0.00013266614,0.000014756528,0.000009296517,0.0048849755,0.000041485873,0.00016954583,0.94805175,0.0036187891,0.04291023],"study_design_scores_gemma":[0.00009740623,0.000044706732,0.0005157006,0.0001423655,0.0000048946335,0.000027954171,0.00012150091,0.9014097,0.010698444,0.03602431,0.050721616,0.00019143162],"about_ca_topic_score_codex":0.000030461286,"about_ca_topic_score_gemma":0.0000016620443,"teacher_disagreement_score":0.96144474,"about_ca_system_score_codex":0.000019097439,"about_ca_system_score_gemma":0.000058597998,"threshold_uncertainty_score":0.25367442},"labels":[],"label_agreement":null},{"id":"W4403228960","doi":"10.1007/978-3-031-73709-1_25","title":"Preventing Out-of-Gas Exceptions by Typing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Typing; Programming language; Speech recognition","score_opus":0.02754851199876612,"score_gpt":0.2765610006695691,"score_spread":0.249012488670803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403228960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000104690866,0.0014483967,0.98662484,0.00077007816,0.0040795044,0.0002458273,0.0000073450833,0.00023075026,0.006488598],"genre_scores_gemma":[0.3573014,0.0001954081,0.6365456,0.0010598447,0.0015334853,0.000020313073,0.000021062204,0.000098993674,0.0032238853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968038,0.000028035707,0.00068911706,0.0013332324,0.0006459534,0.0004998568],"domain_scores_gemma":[0.997727,0.00045798084,0.0003499326,0.0011432589,0.00020807437,0.00011375677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912165,0.00038531542,0.00041703982,0.0006535937,0.0002571609,0.0005270042,0.0028724435,0.00026340527,0.000029552735],"category_scores_gemma":[0.00008246562,0.00039077856,0.0001722277,0.0006598946,0.000471784,0.0004642228,0.0014197289,0.0008357868,0.0001046828],"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.0000020843258,0.000049587812,0.00003533558,0.00023725443,0.00003275741,0.000019617359,0.004074372,0.008764609,0.0012426683,0.1955245,0.00029322546,0.789724],"study_design_scores_gemma":[0.00011822922,0.00007727183,0.000013780262,0.0013090152,0.000014610981,0.000026416623,6.209157e-7,0.6164071,0.002570371,0.36685085,0.011982865,0.0006288943],"about_ca_topic_score_codex":0.0000123738655,"about_ca_topic_score_gemma":0.000012452569,"teacher_disagreement_score":0.7890951,"about_ca_system_score_codex":0.00019466241,"about_ca_system_score_gemma":0.00033442865,"threshold_uncertainty_score":0.9998544},"labels":[],"label_agreement":null},{"id":"W4403793655","doi":"10.1007/978-3-031-75872-0_11","title":"Generating Secure Workflow Designs from Requirements Goal Models Using Patterns","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Regina; York University","funders":"","keywords":"Computer science; Workflow; Software engineering; Workflow management system; Database","score_opus":0.08167502105696985,"score_gpt":0.29414893852014123,"score_spread":0.2124739174631714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403793655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.001166892,0.001197495,0.9913688,0.0002810424,0.0046606823,0.00037996695,0.000025116855,0.00034853,0.0005715188],"genre_scores_gemma":[0.26602304,0.000037874077,0.73084444,0.0012058822,0.0016837826,0.000007898771,0.000018642611,0.00006590562,0.00011253095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944273,0.00006180554,0.0008672813,0.0024453374,0.0013465513,0.0008516988],"domain_scores_gemma":[0.99704343,0.0004409352,0.00038446995,0.0016578177,0.00025103896,0.00022233705],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093174254,0.00071986363,0.0005851565,0.00073794735,0.0005351538,0.0019220351,0.0038127326,0.00046733525,0.000033578053],"category_scores_gemma":[0.000038560014,0.00072647084,0.00020164516,0.0007319412,0.0002967844,0.0011750644,0.0021270365,0.0012452422,0.000040865696],"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.0000034979707,0.00002838238,0.000058160407,0.00006680817,0.000041925578,0.00013456545,0.003036822,0.7484438,0.0008015318,0.034759838,0.000016654221,0.21260802],"study_design_scores_gemma":[0.000110886554,0.00003429857,0.000005415189,0.0009801424,0.000014003192,0.000024130244,4.2099452e-7,0.72707087,0.0005724498,0.27051055,0.00011181516,0.00056504423],"about_ca_topic_score_codex":0.00012594629,"about_ca_topic_score_gemma":0.00006681191,"teacher_disagreement_score":0.26485613,"about_ca_system_score_codex":0.00062589307,"about_ca_system_score_gemma":0.0006018582,"threshold_uncertainty_score":0.99951863},"labels":[],"label_agreement":null},{"id":"W4403920025","doi":"10.1109/secdev61143.2024.00011","title":"BliMe Linter","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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","score_opus":0.016411646303508352,"score_gpt":0.26916495519230926,"score_spread":0.25275330888880093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403920025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011480056,0.0003228104,0.9463573,0.0031581316,0.00088455365,0.000018237404,8.258082e-8,0.00063576776,0.047475122],"genre_scores_gemma":[0.9563314,0.0000066635444,0.039910443,0.0007674665,0.00013457374,0.0000017553729,2.7157373e-7,0.0000024166625,0.0028450142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964607,0.000008258632,0.0000629186,0.00014928992,0.00006319472,0.00007026409],"domain_scores_gemma":[0.9997261,0.00005517875,0.000004210214,0.0001791012,0.000013445859,0.000021944674],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009953301,0.000029672658,0.000024166851,0.00004552143,0.000028993123,0.00030121018,0.00030212358,0.000015448562,0.00013598758],"category_scores_gemma":[0.0000058028822,0.000024337221,0.000024652889,0.00020416985,0.0000069444136,0.00019992524,0.00008348588,0.000052652227,0.0011008976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.193238e-8,0.0000044117246,0.000009304303,0.0000054066513,0.0000033696513,0.0000026342993,0.00046215157,0.00000376472,0.0001519873,0.88196915,0.012569623,0.10481809],"study_design_scores_gemma":[0.000011757606,0.000008017797,0.00009774509,0.000014303197,6.397547e-7,0.000014185152,0.0000101036185,0.6382793,0.002560844,0.011798685,0.34714487,0.000059543454],"about_ca_topic_score_codex":0.0000039724064,"about_ca_topic_score_gemma":3.9926584e-7,"teacher_disagreement_score":0.9551834,"about_ca_system_score_codex":0.000007753192,"about_ca_system_score_gemma":0.00001735807,"threshold_uncertainty_score":0.9996769},"labels":[],"label_agreement":null},{"id":"W4404515181","doi":"10.1145/3689938.3694781","title":"SafeBPF: Hardware-assisted Defense-in-depth for eBPF Kernel Extensions","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Universitas Brawijaya","keywords":"Kernel (algebra); Computer science; Computer hardware; Mathematics","score_opus":0.05384627339178922,"score_gpt":0.3112699545219131,"score_spread":0.25742368113012387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404515181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036360268,0.00052106415,0.9792893,0.0033175817,0.0013359871,0.0002443688,0.0000033429362,0.0007027272,0.010949621],"genre_scores_gemma":[0.8808903,0.000015001626,0.11650012,0.0007815381,0.00011937684,0.000041650055,0.0000053554286,0.000013332105,0.001633302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875295,0.000036190468,0.00027138068,0.00050017424,0.00016061105,0.00027871042],"domain_scores_gemma":[0.99889827,0.00046023756,0.000029155082,0.0004537554,0.00008353804,0.00007506579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036815,0.00011607766,0.00013180746,0.00017149825,0.00013401477,0.00031393179,0.0005222446,0.00006789664,0.000031408043],"category_scores_gemma":[0.00009126635,0.00010555428,0.00010908705,0.0005767918,0.000024131261,0.00027594625,0.00014195584,0.00013122441,0.00014900904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004620807,0.00006617812,0.00018920399,0.00006146847,0.00001662431,0.000028218792,0.001050216,0.00012145746,0.0005018132,0.8924599,0.016482873,0.08901742],"study_design_scores_gemma":[0.00034393425,0.00005258553,0.01208199,0.00015354568,0.000008939249,0.000069293594,0.00012875778,0.8421365,0.0009820709,0.021413956,0.12229861,0.00032981375],"about_ca_topic_score_codex":0.000044910197,"about_ca_topic_score_gemma":0.000057464553,"teacher_disagreement_score":0.8772543,"about_ca_system_score_codex":0.00005627924,"about_ca_system_score_gemma":0.000108663706,"threshold_uncertainty_score":0.43043786},"labels":[],"label_agreement":null},{"id":"W4405184268","doi":"10.1145/3658644.3670363","title":"<scp>SeMalloc:</scp> Semantics-Informed Memory Allocator","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Universitas Brawijaya","keywords":"Allocator; Computer science; Heap (data structure); Exploit; C dynamic memory allocation; Memory protection; Thread (computing); Memory safety; Call stack; Operating system; Distributed computing; Parallel computing; Memory management; Programming language; Computer security; Stack (abstract data type); Virtual memory; Overlay","score_opus":0.020899389206755385,"score_gpt":0.26950065186853617,"score_spread":0.2486012626617808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405184268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019057393,0.00075986196,0.88422716,0.0023727112,0.0025312176,0.00017936381,0.0000011826563,0.0018969141,0.088974215],"genre_scores_gemma":[0.93428725,0.000056558558,0.052711166,0.0016227927,0.00035935955,0.00001697343,0.0000049720074,0.000018311131,0.0109226005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.000030043298,0.00029385212,0.00043038224,0.0003221596,0.0003383572],"domain_scores_gemma":[0.99856377,0.00061112863,0.000040882333,0.0005839763,0.000070318994,0.00012993845],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036884242,0.00015048239,0.00013404887,0.00016645779,0.00015042348,0.0006932068,0.000982325,0.000084378364,0.000043071544],"category_scores_gemma":[0.0001534252,0.00013451681,0.00009682124,0.0006176752,0.000043534063,0.00065410626,0.00028736162,0.00019196092,0.0012912753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0989185e-7,0.000039434624,0.00008159907,0.00018295199,0.00004867165,0.000042315773,0.00488223,0.00013757683,0.00046920023,0.8696228,0.105194755,0.019298136],"study_design_scores_gemma":[0.00012172663,0.000034909586,0.0003343723,0.000085063875,0.000008342288,0.000058970003,0.00040170518,0.6189745,0.009412785,0.0042980025,0.36615163,0.00011801259],"about_ca_topic_score_codex":0.000022444065,"about_ca_topic_score_gemma":0.0000068890913,"teacher_disagreement_score":0.91522986,"about_ca_system_score_codex":0.000055851655,"about_ca_system_score_gemma":0.00025838014,"threshold_uncertainty_score":0.9994863},"labels":[],"label_agreement":null},{"id":"W4405601139","doi":"10.1109/icsme58944.2024.00014","title":"An Empirical Study of Automatic Program Repair Techniques for Injection Vulnerabilities","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Huawei Technologies (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Empirical research; Reliability engineering; Engineering; Statistics; Mathematics","score_opus":0.04568936453882959,"score_gpt":0.39151961182293993,"score_spread":0.3458302472841103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405601139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36197862,0.000029525305,0.6284968,0.00015986893,0.0002635368,0.0009931017,4.5761166e-7,0.007673817,0.00040426146],"genre_scores_gemma":[0.747083,2.561658e-7,0.252566,0.000027904536,0.00005189875,0.00022758033,7.5962686e-7,0.0000041695425,0.0000384397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999107,0.00008777794,0.00026740678,0.0002964609,0.0001400572,0.00010127888],"domain_scores_gemma":[0.9992507,0.00021143192,0.000032863198,0.000384303,0.00009363463,0.000027053151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006948,0.00006761646,0.00010064585,0.00011740007,0.00008876854,0.0001593543,0.0002816548,0.000038599625,0.0000059228732],"category_scores_gemma":[0.000044958233,0.000056283494,0.00005551574,0.00037366556,0.000024233545,0.000359116,0.00004944437,0.000068221765,0.0000013519708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074423638,0.0034447808,0.0042634755,0.00073981984,0.00007402786,0.0000023684988,0.03714902,0.00018377906,0.00013235155,0.077694006,0.0054377937,0.8708711],"study_design_scores_gemma":[0.00005071064,0.002282775,0.00091815606,0.000025575218,0.0000056545587,0.0000059110976,0.0011592138,0.9885281,0.0008314856,0.0044662505,0.0016500938,0.00007611682],"about_ca_topic_score_codex":0.00004760206,"about_ca_topic_score_gemma":0.000012632298,"teacher_disagreement_score":0.98834425,"about_ca_system_score_codex":0.000027983628,"about_ca_system_score_gemma":0.000049413025,"threshold_uncertainty_score":0.22951743},"labels":[],"label_agreement":null},{"id":"W4407564937","doi":"10.3390/e27020202","title":"SAluMC: Thwarting Side-Channel Attacks via Random Number Injection in RISC-V","year":2025,"lang":"en","type":"article","venue":"Entropy","topic":"Security and Verification in Computing","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 Victoria; New York Institute of Technology","funders":"","keywords":"Computer science; Side channel attack; Embedded system; Cache; Microarchitecture; Software; Timing attack; Channel (broadcasting); Computer hardware; Computer network; Cryptography; Computer security; Operating system","score_opus":0.01149871167667506,"score_gpt":0.276479255521842,"score_spread":0.26498054384516695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407564937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06704826,0.00008589437,0.9236017,0.0010309335,0.0012899986,0.00015411669,2.994135e-7,0.0001926235,0.006596178],"genre_scores_gemma":[0.9929877,0.0000060218517,0.0060586864,0.00049258885,0.00012615597,0.00001676797,0.0000015800294,0.0000049807904,0.00030550646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.00013719745,0.00032488725,0.00034096162,0.00015859006,0.00025189205],"domain_scores_gemma":[0.9992492,0.00022584623,0.00009831449,0.0003360833,0.000053794112,0.000036736976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048434373,0.00010614531,0.00015094226,0.00012165927,0.00016602936,0.00013780007,0.00040130073,0.0000688866,0.000028464077],"category_scores_gemma":[0.00014214059,0.00011112765,0.00006238499,0.0006587792,0.00002309658,0.00028420307,0.00016536191,0.00021223121,0.00018789513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029755032,0.0008861492,0.10235111,0.0002139129,0.00016882204,0.00007273174,0.017343221,0.04187439,0.009376214,0.6729843,0.02408148,0.13035013],"study_design_scores_gemma":[0.0024760056,0.00002911118,0.012575982,0.00011559408,0.000007088753,0.000018833442,0.00014761799,0.9237367,0.0069518513,0.04731856,0.006347216,0.00027542296],"about_ca_topic_score_codex":0.00013912591,"about_ca_topic_score_gemma":0.000018806797,"teacher_disagreement_score":0.92593944,"about_ca_system_score_codex":0.00008520991,"about_ca_system_score_gemma":0.000047512913,"threshold_uncertainty_score":0.45316538},"labels":[],"label_agreement":null},{"id":"W4408164120","doi":"10.1109/lca.2025.3547262","title":"DPWatch: A Framework for Hardware-Based Differential Privacy Guarantees","year":2025,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","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; Differential privacy; Computer security; Embedded system; Computer hardware; Computer network; Computer architecture; Data mining","score_opus":0.0166352827419804,"score_gpt":0.26978453681913733,"score_spread":0.25314925407715694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408164120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.015428863,0.000034792676,0.9382545,0.040738646,0.004388866,0.0005516007,0.00000765233,0.000568442,0.000026675292],"genre_scores_gemma":[0.42156863,6.933453e-7,0.55407566,0.0234902,0.0007609689,0.00006858917,0.000008185882,0.000016401631,0.000010688767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774814,0.000142987,0.00041604313,0.0008455899,0.00029495324,0.0005522726],"domain_scores_gemma":[0.99749,0.0011093542,0.0001445802,0.0010970578,0.00007003437,0.00008900836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018016879,0.00033841617,0.00034410588,0.000361992,0.00039218695,0.00048433317,0.002135648,0.00014194705,0.000006063939],"category_scores_gemma":[0.000046971323,0.00032192055,0.00030858483,0.00056370447,0.0001055075,0.00012709392,0.00025073337,0.0004884094,0.000010559934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030330083,0.0006418211,0.00071986596,0.00094684603,0.0005422161,0.000054086642,0.008768341,0.14382704,0.013309372,0.47904664,0.079557784,0.27228266],"study_design_scores_gemma":[0.0017766728,0.00013385384,0.0014141188,0.00053130114,0.000038806276,0.000014415949,0.000004714888,0.8521911,0.010613864,0.09229077,0.04020945,0.00078093517],"about_ca_topic_score_codex":0.0000071578997,"about_ca_topic_score_gemma":0.0000014857682,"teacher_disagreement_score":0.70836407,"about_ca_system_score_codex":0.00008519127,"about_ca_system_score_gemma":0.000091056565,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W4408591548","doi":"10.1007/s11424-025-4263-8","title":"A Two-Pronged Approach to Security of Discrete-Event Systems","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Science and Complexity","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Computer science; Event (particle physics); Computer security; Physics","score_opus":0.05195687794860957,"score_gpt":0.31361482332659124,"score_spread":0.26165794537798165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408591548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28916007,0.0011943667,0.69984007,0.000596324,0.0021242404,0.0004341183,0.0000037312564,0.000029531544,0.0066175633],"genre_scores_gemma":[0.99341977,0.000007823462,0.006374136,0.00007173565,0.0000933325,0.0000057535044,1.327827e-7,0.000002278184,0.000025038682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744886,0.00017342588,0.0008254308,0.00033234796,0.0009476717,0.000272242],"domain_scores_gemma":[0.9975798,0.00010700768,0.0005955623,0.00047147315,0.001047479,0.00019865278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004655911,0.0001269988,0.0004197889,0.00044720338,0.00035146828,0.00044514507,0.0016897132,0.00003724066,4.0440327e-7],"category_scores_gemma":[0.0002022418,0.000101700316,0.0000701933,0.0016873839,0.0003860439,0.00066625804,0.00041427778,0.00019511346,0.0000011758423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016803455,0.0001565848,0.0012759102,0.00029997583,0.000026587675,0.0000023258601,0.0027604727,0.0025845526,0.0017955552,0.98985827,0.00052066846,0.00070227333],"study_design_scores_gemma":[0.000993036,0.00035184162,0.011975122,0.0010489458,0.000027734864,0.00039191142,0.0051213303,0.96448874,0.0012741386,0.010843452,0.0031226797,0.00036103875],"about_ca_topic_score_codex":0.00023883789,"about_ca_topic_score_gemma":0.000002470834,"teacher_disagreement_score":0.9790148,"about_ca_system_score_codex":0.00014034208,"about_ca_system_score_gemma":0.00052464684,"threshold_uncertainty_score":0.4292544},"labels":[],"label_agreement":null},{"id":"W4408903106","doi":"10.1145/3676641.3711998","title":"<i>Velosiraptor</i> : Code Synthesis for Memory Translation","year":2025,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"","keywords":"Computer science; Programming language; Translation (biology); Parallel computing","score_opus":0.03925621224727617,"score_gpt":0.2908344221348566,"score_spread":0.25157820988758045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408903106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005666215,0.0000950604,0.97040457,0.004459893,0.00040555553,0.00016485469,0.0000017123783,0.00022826824,0.023673456],"genre_scores_gemma":[0.6714557,0.00000870888,0.3259942,0.0016609149,0.000054539105,0.00007768568,0.0000015243073,0.0000040267505,0.000742722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940133,0.000025454148,0.00015578356,0.00022534149,0.00007568108,0.00011639727],"domain_scores_gemma":[0.99899584,0.00061534735,0.000030053729,0.00027812427,0.00005932045,0.000021296932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027791143,0.000059097994,0.0000764898,0.00007520648,0.00015183934,0.0000853654,0.0004350109,0.000041162082,0.00001081702],"category_scores_gemma":[0.00006008262,0.000058543486,0.00005428697,0.0002636187,0.000014293514,0.00017938916,0.00002942111,0.0000356201,0.000009240559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052724513,0.000035883073,0.000037820028,0.000038845817,0.000015830063,1.266468e-7,0.00040210082,0.00012060756,0.0010896161,0.5918109,0.005458791,0.4009842],"study_design_scores_gemma":[0.00034337206,0.000017243561,0.00035394786,0.000046782607,0.000014245411,0.0000012472882,0.00007684845,0.7442338,0.11700757,0.023264606,0.11443531,0.0002050425],"about_ca_topic_score_codex":0.0000059037206,"about_ca_topic_score_gemma":0.0000047690746,"teacher_disagreement_score":0.7441132,"about_ca_system_score_codex":0.000016984219,"about_ca_system_score_gemma":0.00005301961,"threshold_uncertainty_score":0.23873341},"labels":[],"label_agreement":null},{"id":"W4408903410","doi":"10.1145/3676641.3716247","title":"AMuLeT: Automated Design-Time Testing of Secure Speculation Countermeasures","year":2025,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University; University of Toronto","funders":"","keywords":"Speculation; Computer science; Computer security; Embedded system; Business","score_opus":0.03382593537516035,"score_gpt":0.27656978921330466,"score_spread":0.2427438538381443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408903410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010903721,0.000039964438,0.97790164,0.0002756532,0.00015954829,0.00012621228,4.6797228e-7,0.00080031523,0.009792475],"genre_scores_gemma":[0.80415857,5.039854e-7,0.19549073,0.00017513103,0.000016309255,0.0000023319533,0.0000010148484,0.0000025891177,0.0001528275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991459,0.000080955455,0.00025854332,0.00021727163,0.0001733297,0.00012397916],"domain_scores_gemma":[0.998979,0.000339557,0.00011057238,0.00031457903,0.0002347243,0.00002158814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000412377,0.00007898752,0.00011348451,0.00011962674,0.00010261267,0.000085459236,0.00045439164,0.00004971471,0.000017916731],"category_scores_gemma":[0.00021567743,0.0000767908,0.00002916674,0.00073279487,0.000028882092,0.00018842329,0.0000962573,0.000059351663,0.000026788075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002976512,0.00039679007,0.010405193,0.00029692322,0.00017037951,0.000011285838,0.0028035725,0.09158265,0.14526816,0.6654077,0.034689795,0.048937745],"study_design_scores_gemma":[0.00012444565,0.000017286358,0.0072035682,0.00006704714,0.0000035229373,0.0000025443132,0.000008393757,0.9736837,0.01624542,0.0022077304,0.00036339232,0.00007294344],"about_ca_topic_score_codex":0.000021334978,"about_ca_topic_score_gemma":6.0217246e-7,"teacher_disagreement_score":0.88210106,"about_ca_system_score_codex":0.00003098606,"about_ca_system_score_gemma":0.000098683544,"threshold_uncertainty_score":0.3131438},"labels":[],"label_agreement":null},{"id":"W4409253307","doi":"10.1007/978-3-031-87719-3_4","title":"Reusable Formal Model Libraries for Specifying and Analyzing Security Objectives in Event-B","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Formal methods; Software engineering; Programming language","score_opus":0.022661788239533055,"score_gpt":0.2662824902534406,"score_spread":0.24362070201390754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409253307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00035348753,0.001216558,0.9944654,0.00051049236,0.00070391415,0.00051266793,0.0000077566265,0.00011335527,0.0021163728],"genre_scores_gemma":[0.3470997,0.000111706424,0.6516612,0.0006253951,0.00025242488,0.00002251211,0.000005813979,0.000019959562,0.00020130083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968169,0.000034261193,0.00061423366,0.0014362776,0.00041310894,0.00068525906],"domain_scores_gemma":[0.9976649,0.0009553603,0.00026190287,0.0008413019,0.00017396495,0.00010254284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001272245,0.0004130968,0.0005233206,0.0010655833,0.0004800677,0.00090152613,0.0020322322,0.0002894673,0.000002540904],"category_scores_gemma":[0.0002063496,0.00043238414,0.00010976849,0.00074791274,0.0004026017,0.0018213765,0.0017175872,0.00071044185,0.0000011844797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022932043,0.00004137469,0.0003384815,0.00027417313,0.000016796512,0.000012287811,0.005765209,0.1431004,0.000043251654,0.53680515,0.00003542433,0.3135445],"study_design_scores_gemma":[0.00019605759,0.000044548575,0.00004291847,0.00036658547,0.00000340396,0.000006618025,0.0000010048832,0.63973427,0.00041887196,0.35871553,0.00018529313,0.00028490796],"about_ca_topic_score_codex":0.000017374425,"about_ca_topic_score_gemma":0.00007707583,"teacher_disagreement_score":0.49663386,"about_ca_system_score_codex":0.0002339371,"about_ca_system_score_gemma":0.0007391291,"threshold_uncertainty_score":0.9998128},"labels":[],"label_agreement":null},{"id":"W4409362569","doi":"10.1609/aaai.v39i24.34717","title":"CodeHalu: Investigating Code Hallucinations in LLMs via Execution-based Verification","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Security and Verification in Computing","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 Alberta; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Code (set theory); Computer science; Programming language; Psychology","score_opus":0.07942367299217998,"score_gpt":0.320831477344202,"score_spread":0.241407804352022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201076,0.000037287893,0.8241848,0.018269993,0.0007707653,0.0007085774,0.0000049534983,0.00020550725,0.013807373],"genre_scores_gemma":[0.9886951,0.000006682264,0.010625902,0.000519666,0.000022694325,0.000051856143,0.0000013242346,0.0000059111967,0.0000708645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998147,0.00003971496,0.0006886079,0.00050646,0.0003589953,0.00025918562],"domain_scores_gemma":[0.99826306,0.00023976289,0.00038913148,0.00037466272,0.00068173005,0.00005165415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008103742,0.00017238063,0.00019672149,0.00030737568,0.00030138218,0.00023637393,0.0017740559,0.000104192295,0.000015548],"category_scores_gemma":[0.0008604208,0.00015890082,0.00007551725,0.0017652947,0.0002518792,0.00034777963,0.0001870627,0.00033143206,0.000025969472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008787762,0.00013239664,0.0009152325,0.000042889882,0.000004521387,8.76229e-8,0.00088553585,0.0013379008,0.025949059,0.94621706,0.000062035004,0.024444496],"study_design_scores_gemma":[0.000029922263,0.000027227527,0.0015354258,0.00029268832,0.0000040186146,4.479178e-7,0.00021477675,0.5737259,0.26321998,0.16076937,0.000068441,0.00011182104],"about_ca_topic_score_codex":0.000087572604,"about_ca_topic_score_gemma":0.00003690324,"teacher_disagreement_score":0.84668434,"about_ca_system_score_codex":0.00011917907,"about_ca_system_score_gemma":0.00026176844,"threshold_uncertainty_score":0.6479787},"labels":[],"label_agreement":null},{"id":"W4409640889","doi":"10.1109/pedes61459.2024.10961832","title":"Vulnerability Analysis of Torque Controlled PMSM Drives Against Sophisticated Data Integrity Attacks","year":2024,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Lakehead University","funders":"","keywords":"Vulnerability (computing); Torque; Computer science; Data integrity; Vulnerability assessment; Reliability engineering; Computer security; Engineering","score_opus":0.08419326099239052,"score_gpt":0.36344301816683433,"score_spread":0.2792497571744438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409640889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029744584,0.00036901477,0.96324944,0.0018864685,0.00051456434,0.00019107791,0.00004143502,0.00040996505,0.0035934316],"genre_scores_gemma":[0.9788192,0.000022713391,0.020734057,0.00017635651,0.00005609706,0.0000071166787,0.00008500809,0.000004426185,0.00009506095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795806,0.00023162129,0.0005889948,0.00075571676,0.00028145986,0.00018411608],"domain_scores_gemma":[0.99647284,0.0011996363,0.000106436106,0.0019438138,0.00019765373,0.00007961281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015510548,0.00013883204,0.00048485605,0.00031934018,0.000101820275,0.00024724816,0.0019491279,0.00008720691,0.00010756133],"category_scores_gemma":[0.0006354178,0.00011120131,0.00018232576,0.0019976152,0.00012396228,0.00046326884,0.0006377045,0.0002912663,0.000022722306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006479706,0.00057859987,0.004949148,0.00019972037,0.004172757,0.00002161955,0.0026528514,0.0025993695,0.002318244,0.92370296,0.005496714,0.05324325],"study_design_scores_gemma":[0.00026253005,0.000014813005,0.0026743214,0.000018270512,0.00018733532,6.3503074e-7,0.000035280133,0.9931569,0.0003167619,0.0017101531,0.0014971845,0.00012582334],"about_ca_topic_score_codex":0.00009024646,"about_ca_topic_score_gemma":0.000048181577,"teacher_disagreement_score":0.99055755,"about_ca_system_score_codex":0.00005001063,"about_ca_system_score_gemma":0.00015544484,"threshold_uncertainty_score":0.4534658},"labels":[],"label_agreement":null},{"id":"W4409807054","doi":"10.1007/978-3-031-89350-6_5","title":"Detecting Information Disclosure Vulnerability in Software Architectures Using Alloy","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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é du Québec en Outaouais","funders":"","keywords":"Computer science; Vulnerability (computing); Software; Vulnerability assessment; Software engineering; Computer security; Programming language","score_opus":0.020673496044233318,"score_gpt":0.2676906002831827,"score_spread":0.24701710423894938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409807054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.0034295428,0.00021042224,0.9930667,0.00034216614,0.0016281124,0.00048745127,0.000005269992,0.00024154264,0.00058876397],"genre_scores_gemma":[0.42374304,0.0000068764466,0.57490766,0.001045159,0.00023950887,0.00000944793,0.0000065539784,0.000015655312,0.000026110269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996134,0.00010562647,0.00096343464,0.0012288574,0.0008832004,0.000684878],"domain_scores_gemma":[0.9966372,0.0011080555,0.00044761976,0.0014087342,0.0002818012,0.00011653665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017815015,0.0005241334,0.00053753064,0.0015677254,0.0004621649,0.0009863683,0.00301882,0.00040872823,0.000008516395],"category_scores_gemma":[0.0008052076,0.0005224553,0.00014534724,0.0013211913,0.00040992533,0.0011911937,0.0015898808,0.0015291211,0.000007543779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006091613,0.000019117908,0.00071683864,0.00013199671,0.0000064536443,0.0000113216865,0.0020047247,0.3119765,0.00003687791,0.0050004637,0.0000031606785,0.6800865],"study_design_scores_gemma":[0.00024570854,0.00004680751,0.00084793445,0.00077268755,0.000005125698,0.000036666388,9.606061e-7,0.88728404,0.00069519685,0.10913199,0.00033728092,0.0005956167],"about_ca_topic_score_codex":0.000113202404,"about_ca_topic_score_gemma":0.00017579399,"teacher_disagreement_score":0.67949086,"about_ca_system_score_codex":0.00063913106,"about_ca_system_score_gemma":0.00097013963,"threshold_uncertainty_score":0.9997227},"labels":[],"label_agreement":null},{"id":"W4411025433","doi":"10.1561/3300000044","title":"Security Analysis and Formal Verification on Blockchain and its Applications","year":2025,"lang":"en","type":"article","venue":"Foundations and Trends® in Privacy and Security","topic":"Security and Verification in Computing","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":"123 Certification (Canada)","funders":"","keywords":"Blockchain; Computer science; Computer security","score_opus":0.017205859428054002,"score_gpt":0.2956661101107213,"score_spread":0.2784602506826673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411025433","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.89998037,0.001261892,0.0920252,0.0039516254,0.00009152083,0.0003081048,0.000028106153,0.00010754824,0.0022456616],"genre_scores_gemma":[0.99802786,0.00040811955,0.0012131978,0.0001684693,0.000023319772,0.000067537476,0.00003895302,0.0000032241342,0.0000493238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987125,0.00008962996,0.0003168818,0.00056257285,0.00011473272,0.00020370337],"domain_scores_gemma":[0.9991261,0.0002519687,0.00009939414,0.0003675923,0.00006596361,0.000088986424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044558244,0.0001549178,0.00021011973,0.00071729836,0.0006341807,0.000311015,0.00021233055,0.00009661031,0.000009014576],"category_scores_gemma":[0.000057086683,0.00016295857,0.00003528121,0.0016070288,0.0000955006,0.00037284745,0.00027373582,0.00020844697,0.0000012257506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010539926,0.00014431647,0.007404582,0.000050572165,0.00007353071,7.248377e-7,0.0032192238,0.000022692344,0.000017854676,0.9051002,0.00002884406,0.08392692],"study_design_scores_gemma":[0.0010691435,0.00007599146,0.27521375,0.000047179594,0.00014855328,0.000012428101,0.00026251853,0.5883901,0.00017892415,0.118307576,0.01588414,0.00040968612],"about_ca_topic_score_codex":0.00006812064,"about_ca_topic_score_gemma":0.0001435941,"teacher_disagreement_score":0.78679264,"about_ca_system_score_codex":0.00002577307,"about_ca_system_score_gemma":0.00002391474,"threshold_uncertainty_score":0.6645258},"labels":[],"label_agreement":null},{"id":"W4412373339","doi":"10.56553/popets-2025-0119","title":"TEEMS: A Trusted Execution Environment based Metadata-protected Messaging System","year":2025,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Security and Verification in Computing","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":"Metadata; Computer science; Direct Anonymous Attestation; World Wide Web; Database; Operating system; Trusted Computing","score_opus":0.013734760227144436,"score_gpt":0.2346445729714238,"score_spread":0.22090981274427937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412373339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056315377,0.00026187344,0.92797214,0.0036753276,0.00024085747,0.0006537798,0.0000017083487,0.008549205,0.0023297106],"genre_scores_gemma":[0.8814055,0.000012890808,0.1181394,0.00009973824,0.0000121133135,0.00023211575,0.0000021048133,0.00001261708,0.000083575986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99760795,0.000024431154,0.00053122954,0.0009328357,0.00041676636,0.00048679436],"domain_scores_gemma":[0.9985492,0.00015887394,0.00032132884,0.0008051429,0.00013070152,0.000034740042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000806456,0.00031022786,0.00033125744,0.00074781285,0.00049215904,0.00056901766,0.0022330685,0.00024066215,0.0000020877894],"category_scores_gemma":[0.00082275015,0.00029811356,0.00008505164,0.0013692188,0.00010212429,0.00080249633,0.0009293522,0.0004843099,0.00002607152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028075594,0.0001388836,0.00021107068,0.00055995816,0.00007246077,0.000004711578,0.00046020217,0.00018862812,0.08586684,0.88511366,0.0007680943,0.026587414],"study_design_scores_gemma":[0.00050717173,0.00010296529,0.00024219163,0.0009653451,0.000030850668,0.000007525296,0.0014122751,0.17920224,0.79951835,0.007693731,0.009883199,0.00043415843],"about_ca_topic_score_codex":0.000010525737,"about_ca_topic_score_gemma":1.8748487e-7,"teacher_disagreement_score":0.87741995,"about_ca_system_score_codex":0.00048444746,"about_ca_system_score_gemma":0.00008090931,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W4412446034","doi":"10.1109/noms57970.2025.11073595","title":"KPI Assurance and LLMs for Intent-Based Management","year":2025,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Business; Computer science","score_opus":0.01473343769186554,"score_gpt":0.2729411794568949,"score_spread":0.25820774176502936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412446034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091663754,0.00008752396,0.98360443,0.0040678806,0.00029809098,0.00015890246,3.3032984e-7,0.00010653256,0.010759695],"genre_scores_gemma":[0.6742298,0.000009082764,0.32172814,0.0026557257,0.000012040737,0.000034570145,8.207446e-7,0.0000016274147,0.0013281668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995452,0.0000102977565,0.00009586842,0.00020110694,0.000052726897,0.00009477128],"domain_scores_gemma":[0.99957305,0.0001298357,0.000021071657,0.00021868301,0.000039491882,0.00001787742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016024517,0.000045219014,0.000050790855,0.000058032412,0.00009328058,0.000103485654,0.00029006097,0.000016243765,0.000003063134],"category_scores_gemma":[0.000016622429,0.000042394633,0.000020594833,0.00016888538,0.000015485703,0.000076758966,0.000087746215,0.000024637233,0.000003645246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026371195,0.000018418914,0.00022847895,0.00006135547,0.000007777282,3.2969106e-7,0.00003754107,0.000068259644,0.000027573644,0.8836921,0.004127072,0.111728474],"study_design_scores_gemma":[0.0006336852,0.000025269033,0.005116689,0.00009636665,0.000005555881,5.4443177e-7,0.00006172217,0.91996986,0.0029947613,0.016620131,0.054354746,0.00012065156],"about_ca_topic_score_codex":0.0000036957474,"about_ca_topic_score_gemma":0.0000020064933,"teacher_disagreement_score":0.9199016,"about_ca_system_score_codex":0.00001076188,"about_ca_system_score_gemma":0.000012993221,"threshold_uncertainty_score":0.17288029},"labels":[],"label_agreement":null},{"id":"W4413188892","doi":"10.4018/979-8-3373-6481-0.ch005","title":"TrustChain","year":2025,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"Security and Verification in Computing","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":"Sault College","funders":"","keywords":"Computer science","score_opus":0.02133274103448612,"score_gpt":0.2825555520013507,"score_spread":0.26122281096686456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413188892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8237577e-7,0.023157189,0.81942165,0.0014481473,0.0006396365,0.00016935312,0.00000640673,0.00009565458,0.15506175],"genre_scores_gemma":[0.0025331173,0.066654764,0.6297513,0.0029220395,0.00032972585,0.000029872068,0.00008789134,0.000051024967,0.2976402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981981,0.000026023634,0.000601972,0.00063599186,0.00030736646,0.0002305362],"domain_scores_gemma":[0.99856615,0.0006092963,0.00023117638,0.00033374896,0.00019426087,0.000065393724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019589318,0.00032405226,0.00036006773,0.00031704814,0.00020626256,0.00016309184,0.0006818662,0.0002023447,0.000028960074],"category_scores_gemma":[0.00004397302,0.0003507271,0.00007460421,0.0001291978,0.00026780128,0.0013479767,0.00035953103,0.00042476194,0.00002514449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004357258,0.000008529747,0.000006371137,0.000063066254,0.000009737121,0.0000102453105,0.00015556031,0.29424563,6.0158e-8,0.66838074,0.00009922759,0.03701649],"study_design_scores_gemma":[0.000041126972,0.000049196322,0.0000065356303,0.0003662467,0.0000062597683,0.000024983943,0.000024038534,0.14551799,0.000013395762,0.693198,0.16044232,0.00030990609],"about_ca_topic_score_codex":0.0000023712444,"about_ca_topic_score_gemma":0.0000151113745,"teacher_disagreement_score":0.18967032,"about_ca_system_score_codex":0.000076871416,"about_ca_system_score_gemma":0.00019655384,"threshold_uncertainty_score":0.9998945},"labels":[],"label_agreement":null},{"id":"W4413237123","doi":"10.1007/978-3-031-93254-0_7","title":"svRDMA: Securing an RDMA Network in Virtualization Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Security and Verification in Computing","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 New Brunswick","funders":"","keywords":"Remote direct memory access; Operating system; Virtualization; Computer science; Cloud computing","score_opus":0.020428709455318047,"score_gpt":0.2415544171235899,"score_spread":0.22112570766827186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.00019110469,0.00030207323,0.9966375,0.00038735603,0.00061542453,0.000396734,0.000012680547,0.000051844512,0.0014052427],"genre_scores_gemma":[0.025104532,0.0001427436,0.97419995,0.00024173537,0.00017194463,0.00002094755,0.000043483837,0.000012101386,0.00006255752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866736,0.000021078855,0.0006579961,0.00020250428,0.00022209848,0.00022895096],"domain_scores_gemma":[0.9985849,0.0002682456,0.0004085688,0.00064513896,0.00005611512,0.000037011017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050369446,0.00023266228,0.00029434546,0.0002239591,0.00074312807,0.00021941651,0.0020528077,0.00020832288,5.900445e-7],"category_scores_gemma":[0.000041694337,0.0002181628,0.0001063737,0.00032480902,0.00020385181,0.0005106907,0.000865718,0.00036268285,3.479929e-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":[6.083029e-7,0.000009931101,0.000008403284,0.000067156696,0.000017466045,3.8467096e-8,0.0011505376,0.7789554,0.000002095554,0.209936,0.000021651953,0.009830753],"study_design_scores_gemma":[0.00016084868,0.00003423223,0.0001194634,0.00028925104,0.000014567974,0.0000030379392,0.0000035172113,0.97893083,0.000037088783,0.0030720022,0.017098797,0.0002363852],"about_ca_topic_score_codex":0.000018557104,"about_ca_topic_score_gemma":0.000058007496,"teacher_disagreement_score":0.20686398,"about_ca_system_score_codex":0.00009366335,"about_ca_system_score_gemma":0.00013213683,"threshold_uncertainty_score":0.88964206},"labels":[],"label_agreement":null},{"id":"W4414199074","doi":"10.1109/dac63849.2025.11132094","title":"RAP-Track: Efficient Control Flow Attestation via Parallel Tracking in Commodity MCUs","year":2025,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"TRACE (psycholinguistics); Control flow; Context (archaeology); Control (management); Flow control (data); Instrumentation (computer programming); Code (set theory); Flow (mathematics); Commodity; Track (disk drive)","score_opus":0.016857128028932255,"score_gpt":0.27869809025513287,"score_spread":0.2618409622262006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414199074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040489208,0.00007089343,0.95426524,0.0023367277,0.00049735326,0.00022894103,0.0000011942936,0.00019299886,0.0019174309],"genre_scores_gemma":[0.95789015,0.0000025563054,0.040879235,0.0011416791,0.00002712019,0.000015989912,0.000003612487,0.0000030438182,0.000036596433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987158,0.00014115055,0.0003522109,0.00035874845,0.00018674089,0.00024534203],"domain_scores_gemma":[0.9988466,0.0005321529,0.000078822195,0.00040222495,0.00009825867,0.0000419798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065330253,0.000112616784,0.0001594464,0.00017043207,0.00016723928,0.0001725172,0.00057297567,0.00006525101,0.000015396643],"category_scores_gemma":[0.000091689246,0.00011342759,0.000052215793,0.00060897623,0.000032737113,0.00019800253,0.000078127756,0.00018662126,0.000031959156],"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.00003572429,0.00062702503,0.012661978,0.00006525812,0.00002964269,0.000014740462,0.0028515456,0.47239447,0.0006620242,0.27184626,0.0017460774,0.23706526],"study_design_scores_gemma":[0.0008110343,0.000012789829,0.03502426,0.00002988286,0.000002615986,0.0000021882513,0.000031174804,0.95951563,0.00048320435,0.0034438944,0.0005271676,0.00011617335],"about_ca_topic_score_codex":0.00006922476,"about_ca_topic_score_gemma":0.00004692038,"teacher_disagreement_score":0.91740096,"about_ca_system_score_codex":0.000080769365,"about_ca_system_score_gemma":0.00006864695,"threshold_uncertainty_score":0.46254426},"labels":[],"label_agreement":null},{"id":"W4414736153","doi":"10.1145/3731569.3764844","title":"CHERIoT RTOS: An OS for Fine-Grained Memory-Safe Compartments on Low-Cost Embedded Devices","year":2025,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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 British Columbia","funders":"Air Force Research Laboratory; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Defense Advanced Research Projects Agency; UK Research and Innovation; Innovate UK; Google","keywords":"Troubleshooting; Key (lock); Current (fluid); Microcontroller; Subject (documents)","score_opus":0.0380296302801077,"score_gpt":0.33767293620548483,"score_spread":0.29964330592537713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414736153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07275901,0.000037681908,0.90334696,0.0039450536,0.0012509575,0.0010286777,0.000007977731,0.00049517205,0.017128505],"genre_scores_gemma":[0.9410282,0.0000013994761,0.05270633,0.004244392,0.000116548516,0.000111158566,0.000028099905,0.000008437912,0.0017554518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857,0.00007070145,0.00033155293,0.0005334071,0.00019367882,0.0003006467],"domain_scores_gemma":[0.9986381,0.00030374117,0.00010492667,0.00072173285,0.00013814858,0.00009334317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036889012,0.00017328173,0.00020434932,0.00012227308,0.00031974982,0.00028713618,0.0010659724,0.00007162133,0.000056347417],"category_scores_gemma":[0.00007581973,0.00016082409,0.00008020921,0.00042107538,0.000032224572,0.00031606018,0.00013371669,0.000102621925,0.000064219705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019480273,0.0017111173,0.0011660284,0.0003451332,0.00019494112,0.000006681422,0.0053623095,0.0033328582,0.0020568504,0.717851,0.05515546,0.21262284],"study_design_scores_gemma":[0.002230032,0.00020075907,0.005455179,0.00013941198,0.000015680935,0.000001934272,0.00030311465,0.9040416,0.029671244,0.0048351754,0.052629188,0.0004767089],"about_ca_topic_score_codex":0.000020816376,"about_ca_topic_score_gemma":0.000054837303,"teacher_disagreement_score":0.90070873,"about_ca_system_score_codex":0.000052482304,"about_ca_system_score_gemma":0.00009510593,"threshold_uncertainty_score":0.65582156},"labels":[],"label_agreement":null},{"id":"W4414912948","doi":"10.1007/978-3-032-07106-4_9","title":"Abstracting Concolic Execution for Soft Contract Verification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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é du Québec à Montréal","funders":"","keywords":"Concolic testing; Symbolic execution; Rendering (computer graphics); Benchmark (surveying); Static analysis; Symbolic data analysis; Code coverage; Program analysis","score_opus":0.025613513048347004,"score_gpt":0.2855329825402949,"score_spread":0.2599194694919479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414912948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000052113308,0.000344999,0.9904089,0.0012171778,0.0028966228,0.0008221665,0.000009668372,0.0002650408,0.0039832992],"genre_scores_gemma":[0.41931665,0.000051097253,0.5764754,0.0023300492,0.0010904542,0.00006779235,0.000035343626,0.00003602588,0.00059720466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652034,0.000033311546,0.00073994114,0.0015208927,0.00060465845,0.0005808813],"domain_scores_gemma":[0.99577963,0.001766779,0.0005859397,0.0012217249,0.000527937,0.00011801306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013924652,0.00042841857,0.0004694389,0.0006839056,0.0005567326,0.00073740527,0.0025177863,0.0004107437,0.000009900028],"category_scores_gemma":[0.00041806023,0.00046281205,0.00017055376,0.0005329567,0.00033220154,0.0007031381,0.00043239613,0.0006842352,0.000018458917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009630251,0.000030850857,0.000015988227,0.00008570004,0.0000126462555,0.0000054493075,0.0006308083,0.010925665,0.0003259534,0.14865619,0.00009202714,0.8392091],"study_design_scores_gemma":[0.00038220765,0.000089204616,0.00016829548,0.00046457438,0.000012644463,0.000023291897,3.8708714e-7,0.89061457,0.002631389,0.09086337,0.014196686,0.0005534116],"about_ca_topic_score_codex":0.000031345484,"about_ca_topic_score_gemma":0.000022963584,"teacher_disagreement_score":0.87968886,"about_ca_system_score_codex":0.00051685324,"about_ca_system_score_gemma":0.0010332452,"threshold_uncertainty_score":0.9997824},"labels":[],"label_agreement":null},{"id":"W4415281380","doi":"10.1145/3768725.3768728","title":"MAGNET: Memory Tagging with Efficient Tag Prediction","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Identification (biology); Noise (video); Pattern recognition (psychology); Key (lock)","score_opus":0.009152397977757598,"score_gpt":0.22894132526636787,"score_spread":0.21978892728861027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415281380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018629141,0.00065432827,0.8790697,0.0039980984,0.002920401,0.00043133448,0.0000032316755,0.00041923395,0.09387454],"genre_scores_gemma":[0.97325337,0.00002932793,0.019182377,0.001982301,0.00021039974,0.000020732814,0.0000030347487,0.000011244543,0.0053072264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726003,0.00014685669,0.00057214504,0.0009822149,0.0005114826,0.0005272437],"domain_scores_gemma":[0.9981657,0.00019962582,0.00018989432,0.0010323476,0.00028307163,0.00012934432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007580315,0.0002918325,0.00025094431,0.00035313828,0.00079185853,0.0006349628,0.0009792551,0.00014099567,0.00030675472],"category_scores_gemma":[0.000050137114,0.00027013881,0.00008705634,0.0017928132,0.00018227952,0.00029013888,0.00043311145,0.00037343145,0.000104941035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010159735,0.0008500099,0.0016057569,0.00044967292,0.00018560806,0.00002843754,0.0075918334,0.16794409,0.0006809255,0.50677055,0.01310614,0.30068538],"study_design_scores_gemma":[0.0006922702,0.00015382977,0.002980139,0.00035422092,0.000037506874,0.000018936162,0.00054523494,0.98114884,0.0029415893,0.00024244802,0.010618123,0.00026687345],"about_ca_topic_score_codex":0.00007497795,"about_ca_topic_score_gemma":0.0000061147557,"teacher_disagreement_score":0.95462424,"about_ca_system_score_codex":0.00016476294,"about_ca_system_score_gemma":0.00044529545,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4416234927","doi":"10.1007/978-3-032-10466-3_34","title":"Federated Learning via TEE-Based Dual-Branch Architecture and Interaction-Aware Pruning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Pruning; Federated learning; Feature (linguistics); Architecture; Cryptography; Scheme (mathematics); Artificial neural network; Cryptographic primitive","score_opus":0.013708168853213725,"score_gpt":0.2532038482222261,"score_spread":0.23949567936901237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025083523,0.00037883996,0.9936522,0.0013773566,0.0016842436,0.00036121003,0.000002119566,0.00038544057,0.0019077483],"genre_scores_gemma":[0.78136903,0.0000306513,0.21487576,0.0025905457,0.00050256436,0.000016374266,0.000021041798,0.00004397384,0.0005500361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961849,0.00011189975,0.000607652,0.0017688392,0.0007133038,0.00061343244],"domain_scores_gemma":[0.9970594,0.00131543,0.00039120569,0.0007192986,0.00034794165,0.00016674343],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082758785,0.00059081276,0.00053936476,0.0011704786,0.0009822006,0.0013521988,0.0013429873,0.0003869482,0.000019621839],"category_scores_gemma":[0.00019593397,0.0005932786,0.0001145809,0.00095683284,0.00045791443,0.00047665925,0.0010357286,0.0020108472,0.000012264674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009983712,0.000022160366,0.000111662004,0.000115052906,0.000016526496,0.000036459307,0.00084856414,0.11849048,0.00020877089,0.0037790053,0.000017795728,0.87634355],"study_design_scores_gemma":[0.00030896414,0.00011204411,0.00007951488,0.0010076626,0.000008864912,0.0000898461,6.240416e-7,0.97234225,0.0013734257,0.019543653,0.004508432,0.0006247112],"about_ca_topic_score_codex":0.000038665225,"about_ca_topic_score_gemma":0.00005249916,"teacher_disagreement_score":0.87571883,"about_ca_system_score_codex":0.000260617,"about_ca_system_score_gemma":0.0006900049,"threshold_uncertainty_score":0.9996845},"labels":[],"label_agreement":null},{"id":"W4416548966","doi":"10.1145/3719027.3765169","title":"BLACKOUT: Data-Oblivious Computation with Blinded Capabilities","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Blackout; Compiler; Field-programmable gate array; Computation; Key (lock); Realization (probability); Scheme (mathematics); Microarchitecture","score_opus":0.06796266827388137,"score_gpt":0.3287676044544343,"score_spread":0.26080493618055295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416548966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015404782,0.00054407545,0.94950485,0.0052138353,0.0016717733,0.0005800551,0.000018866638,0.00040360482,0.026658146],"genre_scores_gemma":[0.93203914,0.000042335094,0.06393363,0.0014988472,0.00015572942,0.000010167543,0.000048007412,0.000014152269,0.0022579955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960697,0.0003072202,0.0008407742,0.0015823505,0.00061629806,0.00058362895],"domain_scores_gemma":[0.9954878,0.00082094193,0.0002921126,0.0026443019,0.00061491446,0.00013990056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011603459,0.00039358495,0.00042824767,0.00040582175,0.0007153302,0.001447095,0.0030547248,0.00018490406,0.000117476426],"category_scores_gemma":[0.00017200688,0.00036525034,0.0000657143,0.0020851262,0.00046549572,0.0013782271,0.0015419459,0.00043441314,0.00014127539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013807346,0.0008767909,0.0025761202,0.00059493305,0.00038130098,0.000019621753,0.010680317,0.012634347,0.000029847895,0.67819524,0.02155656,0.27231687],"study_design_scores_gemma":[0.0011275582,0.00015590801,0.0024977354,0.00026361068,0.000057416713,0.000018263736,0.0011237989,0.97776586,0.00030724306,0.00825698,0.007961766,0.0004638492],"about_ca_topic_score_codex":0.00034492198,"about_ca_topic_score_gemma":0.00016937082,"teacher_disagreement_score":0.9651315,"about_ca_system_score_codex":0.00013580798,"about_ca_system_score_gemma":0.0010944,"threshold_uncertainty_score":0.99987996},"labels":[],"label_agreement":null},{"id":"W4416676950","doi":"10.1109/prdc67299.2025.00027","title":"A Self-Synchronizing Cyber Deception Framework via Infrastructure as Code Reflection","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Nexen (Canada)","funders":"","keywords":"Exploit; Deception; Honeypot; Scalability; Blueprint; Code (set theory); Resilience (materials science); Pipeline (software)","score_opus":0.014200809025711745,"score_gpt":0.30318353256894637,"score_spread":0.2889827235432346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416676950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012473809,0.00068694697,0.95083076,0.0033044203,0.0064560436,0.00046148073,0.0000012945447,0.0008215507,0.024963722],"genre_scores_gemma":[0.70687485,0.00022381778,0.2885785,0.003015109,0.0005257016,0.000019083038,0.0000041295393,0.00001721704,0.00074156164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962718,0.0003375864,0.0008751546,0.0012823425,0.00054586417,0.0006872446],"domain_scores_gemma":[0.99732494,0.00042360998,0.00036657954,0.0012480096,0.00046048473,0.00017636099],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007091483,0.00044863072,0.0003727488,0.00045033454,0.0014889154,0.0011401488,0.0012325324,0.0007645678,0.0007562524],"category_scores_gemma":[0.00027973714,0.00049797865,0.00019942512,0.0029825803,0.000109258006,0.0009296295,0.00064544304,0.0011998911,0.00046297853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038848324,0.00023666747,0.0012021875,0.0002787426,0.00020440837,0.0000066706357,0.009802153,0.0028002188,0.0009315581,0.67694324,0.004472792,0.3030825],"study_design_scores_gemma":[0.0003760017,0.00011667207,0.0024935724,0.00043859915,0.00006320517,0.000052040254,0.00022225146,0.7866501,0.0034570582,0.1451797,0.060441356,0.0005094005],"about_ca_topic_score_codex":0.00010842786,"about_ca_topic_score_gemma":0.000034133966,"teacher_disagreement_score":0.7838499,"about_ca_system_score_codex":0.00094027,"about_ca_system_score_gemma":0.000683197,"threshold_uncertainty_score":0.99989676},"labels":[],"label_agreement":null},{"id":"W4416749786","doi":"10.1109/lca.2025.3638260","title":"Another Mirage of Breaking MIRAGE: Debunking Occupancy-Based Side-Channel Attacks on Fully Associative Randomized Caches","year":2025,"lang":"","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","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":"Cache; Randomized algorithm; Encryption; Timing attack; Cache algorithms; CPU cache","score_opus":0.01681514997980252,"score_gpt":0.26429327359365,"score_spread":0.2474781236138475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416749786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068307884,0.000387507,0.90598255,0.016445348,0.0062651807,0.0016668692,0.000038585193,0.00034083732,0.0005652194],"genre_scores_gemma":[0.8920857,0.0000085641805,0.06074968,0.046003327,0.0009346666,0.0000699029,0.0000141937135,0.00007882128,0.000055163542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99000394,0.0030088546,0.002146793,0.0021592653,0.0012625236,0.0014186262],"domain_scores_gemma":[0.9884693,0.0072549563,0.0018282498,0.0018567054,0.00040287533,0.000187939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025762804,0.0012699135,0.0023561132,0.0014400712,0.00084044004,0.0007120662,0.0030280324,0.00051338103,0.000021430482],"category_scores_gemma":[0.00030418154,0.0012505208,0.0014594642,0.0020011736,0.00085687905,0.00028884312,0.0005632288,0.0018792861,0.000026800783],"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.011032893,0.000654042,0.00041860933,0.0013450007,0.0023404222,0.00020289389,0.035363857,0.8268615,0.007230693,0.0032961192,0.007675996,0.10357798],"study_design_scores_gemma":[0.04504921,0.00024604454,0.0009741277,0.0036834746,0.00028596632,0.000019221103,0.000034176803,0.9256391,0.019131517,0.0024337214,0.0010940407,0.0014093809],"about_ca_topic_score_codex":0.00023632646,"about_ca_topic_score_gemma":0.000031409927,"teacher_disagreement_score":0.8452329,"about_ca_system_score_codex":0.00067085284,"about_ca_system_score_gemma":0.0006922849,"threshold_uncertainty_score":0.99899447},"labels":[],"label_agreement":null},{"id":"W4416830641","doi":"10.1007/978-3-032-12408-1_17","title":"Hacking Twine as a System: Implications of Extending State-Based Tracking Elements and Application Packaging for HTML-Based IDNs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Hacker; Tracking (education); History of computing; Tracking system","score_opus":0.020069018424960738,"score_gpt":0.2895862105223878,"score_spread":0.2695171920974271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025251196,0.0002708428,0.9964063,0.00089547934,0.00048241107,0.0010998355,0.000024144203,0.00020047578,0.00036795664],"genre_scores_gemma":[0.653852,0.000005452391,0.3453501,0.0005726821,0.000097340875,0.00006848348,0.00001965195,0.000020345884,0.000013981214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965616,0.000043874734,0.0009159418,0.0014269552,0.0005439374,0.0005076843],"domain_scores_gemma":[0.99600977,0.0013257763,0.00079616596,0.0012044649,0.00054687884,0.000116921045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014650568,0.000406052,0.00051228376,0.0010705963,0.00055118394,0.00046651746,0.001843029,0.00017825846,0.0000016492496],"category_scores_gemma":[0.00016420652,0.00043763575,0.00012655927,0.0008194242,0.00031854495,0.0003547917,0.0004103972,0.0003634447,0.0000016986484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013420804,0.00005167414,0.0006757141,0.00092729856,0.000022221326,0.0000028596264,0.00057371036,0.070466526,0.0019014056,0.12411809,0.0000077682225,0.8012393],"study_design_scores_gemma":[0.0004645431,0.000079568905,0.00036546672,0.0014182874,0.000019921421,0.0000079623605,0.000001061902,0.9583941,0.0054316707,0.033037335,0.00038721657,0.00039284353],"about_ca_topic_score_codex":0.000030304856,"about_ca_topic_score_gemma":0.000021741518,"teacher_disagreement_score":0.8879276,"about_ca_system_score_codex":0.0003901435,"about_ca_system_score_gemma":0.00076743256,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W4416915401","doi":"10.1007/s11704-024-40143-0","title":"DMCGuard: risky perils and fine-grained control on IoT multiple device management channels","year":2025,"lang":"en","type":"article","venue":"Frontiers of Computer Science","topic":"Security and Verification in Computing","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":"Innovation Cluster (Canada)","funders":"","keywords":"Access control; Internet of Things; Software deployment; Control (management); Authorization; Trust management (information system); Authentication (law); Channel (broadcasting)","score_opus":0.009119575519636007,"score_gpt":0.24060496748328375,"score_spread":0.23148539196364773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416915401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027288543,0.00036963547,0.9667681,0.00158693,0.002773644,0.00033750822,0.0000023975601,0.00012019344,0.00075307634],"genre_scores_gemma":[0.74100864,0.0000091100355,0.257966,0.00087363395,0.000055297336,0.00001115187,4.2593385e-7,0.0000034797538,0.000072229355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793315,0.0000709571,0.00035472034,0.00076337415,0.0004781926,0.00039961847],"domain_scores_gemma":[0.99857265,0.00016610986,0.00016937879,0.0007751304,0.00019907799,0.00011766026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092122937,0.00018847757,0.00028225026,0.0005286776,0.00042464977,0.0003238658,0.0019220071,0.00004875895,0.0000010193753],"category_scores_gemma":[0.000058978854,0.00018398328,0.00006555627,0.0012739187,0.00039821785,0.00033884178,0.00056564616,0.00013060943,0.0000048164534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009968201,0.00040498958,0.010617474,0.00021614792,0.00017352279,0.000022858601,0.0036603315,0.021178287,0.0005817672,0.3072437,0.023362204,0.632439],"study_design_scores_gemma":[0.0010361425,0.00012082055,0.01411175,0.000095366864,0.0000102256245,0.0000030461676,0.000045025758,0.97165704,0.0017112147,0.0026180358,0.008378355,0.00021296738],"about_ca_topic_score_codex":0.000014502598,"about_ca_topic_score_gemma":0.0000012341734,"teacher_disagreement_score":0.9504788,"about_ca_system_score_codex":0.0000615799,"about_ca_system_score_gemma":0.0000972169,"threshold_uncertainty_score":0.750262},"labels":[],"label_agreement":null},{"id":"W4416961717","doi":"10.1109/pst65910.2025.11268879","title":"Houdini: Benchmarking Container Security Confinement","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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","funders":"","keywords":"Container (type theory); Benchmarking; Benchmark (surveying); Suite; Cloud computing","score_opus":0.014619388874706459,"score_gpt":0.28023295593855585,"score_spread":0.26561356706384937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416961717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041930927,0.000970803,0.72406965,0.008408286,0.0059192623,0.00047205485,0.0000036688293,0.00023820045,0.25572497],"genre_scores_gemma":[0.9822018,0.00015514878,0.008362824,0.0057891943,0.00040306052,0.000022230017,0.000005581117,0.000008755185,0.0030513704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964031,0.00024977082,0.0009919341,0.0011507039,0.00048199305,0.000722496],"domain_scores_gemma":[0.99739397,0.00047645796,0.0002768255,0.0012435449,0.00043430945,0.0001749037],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001279782,0.00039518677,0.00044442937,0.00031029867,0.00078543235,0.00092375866,0.0016320744,0.00022572793,0.0016392007],"category_scores_gemma":[0.00012750881,0.00042169835,0.00021913511,0.0014087085,0.00019163093,0.00035936333,0.0011480738,0.00050108135,0.00013885119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001210531,0.00021288465,0.0011602361,0.00010478321,0.00010934256,0.000008359089,0.0018056368,0.00009062185,0.0000608412,0.8903789,0.02104358,0.08501272],"study_design_scores_gemma":[0.0010138638,0.00011507438,0.002583565,0.0003352707,0.000044913726,0.0000067461406,0.00036732657,0.7217578,0.0022052296,0.017449852,0.2535826,0.00053771527],"about_ca_topic_score_codex":0.00029940595,"about_ca_topic_score_gemma":0.000046206096,"teacher_disagreement_score":0.97800875,"about_ca_system_score_codex":0.00019171818,"about_ca_system_score_gemma":0.0005623879,"threshold_uncertainty_score":0.9998235},"labels":[],"label_agreement":null},{"id":"W4416966104","doi":"10.1016/j.iot.2025.101843","title":"Multi-hypervisor-based authorization and DoS attack mitigation framework using LC-WTRNN technique","year":2025,"lang":"en","type":"article","venue":"Internet of Things","topic":"Security and Verification in Computing","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":"Sumitomo Precision Products (Canada)","funders":"","keywords":"Cloud computing; Encryption; Scalability; Hash function; Reduction (mathematics); Cryptography; Virtual machine; Server","score_opus":0.03595816455559625,"score_gpt":0.32279378452526375,"score_spread":0.2868356199696675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416966104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07280424,0.00008064907,0.9257678,0.00057539175,0.00034271332,0.00017595665,4.928308e-7,0.00013006927,0.00012269546],"genre_scores_gemma":[0.58046633,0.0000014750626,0.41912094,0.00035921103,0.000012126543,0.0000054286365,0.000001522613,0.000003422573,0.000029544348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911577,0.00006961673,0.00028871745,0.00029068624,0.00012076421,0.0001144734],"domain_scores_gemma":[0.9992118,0.00016816315,0.00017798512,0.00027424164,0.00013786662,0.000029975035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036186373,0.000099988654,0.00013255398,0.00017438512,0.000070934264,0.00012969093,0.00046658155,0.00013710889,0.0000061303963],"category_scores_gemma":[0.00020074268,0.00010818851,0.000040840907,0.0003708298,0.00005873508,0.0003626721,0.00017475378,0.00017672767,0.0000018156708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052239386,0.00046797772,0.022276143,0.0010611784,0.0001233083,0.000007349389,0.01940667,0.0036676554,0.14010298,0.75179034,0.00093518954,0.060108975],"study_design_scores_gemma":[0.00014572768,0.000023581293,0.0007769386,0.000568249,0.000007024267,0.00000266359,0.000027688822,0.9204403,0.072254755,0.005269737,0.00038422397,0.00009909209],"about_ca_topic_score_codex":0.000100932084,"about_ca_topic_score_gemma":8.73556e-7,"teacher_disagreement_score":0.91677266,"about_ca_system_score_codex":0.000046031386,"about_ca_system_score_gemma":0.000052311734,"threshold_uncertainty_score":0.44117996},"labels":[],"label_agreement":null},{"id":"W4417299470","doi":"10.48550/arxiv.2505.10111","title":"When Mitigations Backfire: Timing Channel Attacks and Defense for PRAC-Based RowHammer Mitigations","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Security and Verification in Computing","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 Canada","keywords":"Dram; Exploit; Channel (broadcasting); Queue; Overhead (engineering); Side channel attack","score_opus":0.10429080216614414,"score_gpt":0.3221425846385595,"score_spread":0.21785178247241535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417299470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0849598,0.00054331817,0.89628124,0.014483043,0.0014671,0.0009894376,0.000111705056,0.0003720093,0.00079235015],"genre_scores_gemma":[0.8358398,0.00004577526,0.15906239,0.0029611792,0.00044637607,0.00059365435,0.0002704399,0.000030643616,0.00074971997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763,0.00013345246,0.0005542723,0.0010480433,0.00023134421,0.00040287507],"domain_scores_gemma":[0.99691784,0.0010038548,0.00037765905,0.0011273655,0.0004153637,0.000157929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052918005,0.0003378652,0.00033948716,0.00024225736,0.0007110794,0.00036229147,0.0009796032,0.00033079684,0.000013015738],"category_scores_gemma":[0.00045163446,0.00039512652,0.00019922458,0.00030143594,0.00012693345,0.00029129625,0.0007935307,0.00051963894,0.00002501216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014312811,0.0023169203,0.2630381,0.0086691985,0.0020542222,0.00006114293,0.06816238,0.08745164,0.001583614,0.37081555,0.14256546,0.053138662],"study_design_scores_gemma":[0.001217967,0.00007377396,0.023865987,0.0012432312,0.00018112508,0.000008521893,0.00023178977,0.9096564,0.0037021618,0.03333937,0.025242878,0.0012367641],"about_ca_topic_score_codex":0.00006956263,"about_ca_topic_score_gemma":0.00002582308,"teacher_disagreement_score":0.82220477,"about_ca_system_score_codex":0.000096218304,"about_ca_system_score_gemma":0.0005415015,"threshold_uncertainty_score":0.99985003},"labels":[],"label_agreement":null},{"id":"W4417403186","doi":"10.1109/pact65351.2025.00032","title":"FLASH: An Abstract Machine for Modelling Fully Homomorphic Encryption Accelerators","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Simon Fraser University","funders":"","keywords":"Homomorphic encryption; Construct (python library); Encryption; Functional encryption; Code (set theory); Obfuscation; Computation; Key (lock)","score_opus":0.07021389657889134,"score_gpt":0.3162206753169134,"score_spread":0.24600677873802207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417403186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03590258,0.0006851138,0.9534407,0.0015695441,0.0028446752,0.0007933635,0.000016149694,0.00049816526,0.0042496645],"genre_scores_gemma":[0.8875705,0.00012536667,0.109979,0.0008615232,0.00033787786,0.000049184237,0.000020074782,0.000026880649,0.0010295933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965708,0.000105974825,0.0010322126,0.0012422329,0.00037542146,0.00067335204],"domain_scores_gemma":[0.9973638,0.00039748798,0.00032414493,0.0011425646,0.00055102026,0.00022098483],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013665577,0.00041544007,0.00039648404,0.000419406,0.0011305776,0.0013949845,0.0016872826,0.00031193058,0.00019096318],"category_scores_gemma":[0.000062807325,0.00045641878,0.00023364199,0.0010032927,0.00009944841,0.0015190394,0.00026473182,0.00045029927,0.000112664035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009199224,0.0006540959,0.00024576057,0.00036380003,0.00010325491,0.000003833592,0.0019030889,0.1628323,0.0014148948,0.62263644,0.0011509558,0.20859957],"study_design_scores_gemma":[0.00067784754,0.0001575832,0.0002840805,0.00012776902,0.000035995858,0.0000046924492,0.000080011814,0.9654713,0.0038348008,0.021992685,0.0068873186,0.00044586117],"about_ca_topic_score_codex":0.0001351417,"about_ca_topic_score_gemma":0.000031620228,"teacher_disagreement_score":0.85166794,"about_ca_system_score_codex":0.00014490039,"about_ca_system_score_gemma":0.00048841245,"threshold_uncertainty_score":0.99978876},"labels":[],"label_agreement":null},{"id":"W6893952865","doi":"10.5281/zenodo.5993087","title":"Leptomantispa Hoffman 2002","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Security and Verification in Computing","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":"Seta; Genus; Spermatheca; Dorsum; Type species; Taxonomy (biology)","score_opus":0.04341161658155123,"score_gpt":0.258235153182125,"score_spread":0.21482353660057374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893952865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01216322,0.00006596987,0.69680834,0.0018200154,0.0004942629,0.00026386272,0.000017015345,0.002486336,0.28588095],"genre_scores_gemma":[0.99023634,0.000021476715,0.0070715663,0.00047543694,0.00051568204,1.7845776e-8,0.000086304084,0.00048610364,0.0011070815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855494,0.00019615986,0.00019261749,0.00043286348,0.00030286718,0.00032055963],"domain_scores_gemma":[0.9985261,0.000021317988,0.00008653143,0.00068800076,0.00054582866,0.00013224412],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058875006,0.000099744226,0.00008787572,0.00017318704,0.0026704986,0.0012183902,0.002159707,0.000046743557,0.006429549],"category_scores_gemma":[0.00024609442,0.00011039146,0.000036609366,0.0007288856,0.00017363702,0.00044363312,0.001473595,0.00016481317,0.021807563],"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.000010532866,0.00012278052,0.000005256929,0.000022273169,0.000023988518,0.000008823041,0.0029650403,0.000010069961,0.0028153537,0.21146388,0.49804765,0.28450435],"study_design_scores_gemma":[0.0001965673,0.00014851074,0.00060300657,0.000014288325,0.0000022074983,0.0000924097,0.00005346053,0.011581811,0.0018328862,0.00067000533,0.98466206,0.00014281167],"about_ca_topic_score_codex":0.0000064013143,"about_ca_topic_score_gemma":1.1682327e-7,"teacher_disagreement_score":0.9780731,"about_ca_system_score_codex":0.000059688766,"about_ca_system_score_gemma":0.0000032545647,"threshold_uncertainty_score":0.99981844},"labels":[],"label_agreement":null},{"id":"W6925091955","doi":"10.1594/pangaea.967369","title":"Nutrient and trace metal data distribution from water samples of HEINCKE cruise HE586","year":2024,"lang":"en","type":"dataset","venue":"Publishing Network for Geoscientific and Environmental Data (PANGAEA) (Alfred Wegener Institute for Polar and Marine Research)","topic":"Security and Verification in Computing","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":"Nutrient; Trace metal; Trace element; CTD; Cruise; Spectrum analyzer","score_opus":0.10254982127110923,"score_gpt":0.30588419365836034,"score_spread":0.2033343723872511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925091955","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.0015990452,0.0065388107,0.043676715,0.00073336955,0.001892671,0.00091391243,0.9445976,0.00004202773,0.0000058360397],"genre_scores_gemma":[0.0028603477,0.0031973869,0.007817205,0.000038789447,0.00075252325,0.000053392887,0.9851379,0.000028060576,0.0001144312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953995,0.00017603317,0.0006610257,0.0021023832,0.00079342054,0.00086766854],"domain_scores_gemma":[0.9961013,0.00050351187,0.00019484467,0.0027865993,0.000060357106,0.00035339547],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0042957207,0.00040605842,0.00050985545,0.00022751105,0.0012697434,0.0030161077,0.0035521677,0.00031274543,0.00002310255],"category_scores_gemma":[0.00042508653,0.00034411036,0.00008613017,0.0003136428,0.00094607944,0.0036237354,0.012604167,0.0006483094,0.000008246942],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000049108035,0.00014094576,0.000066502456,0.00039258593,0.00015787974,0.0000040345235,0.00008707501,0.000022075965,0.00007584708,0.0018502929,0.984531,0.012622691],"study_design_scores_gemma":[0.0004665845,0.000084706466,0.00021378441,0.00011738774,0.00016913477,0.000015424557,0.00007487495,0.02380754,0.00010591894,0.003380275,0.9711883,0.000376077],"about_ca_topic_score_codex":0.2133084,"about_ca_topic_score_gemma":0.0376766,"teacher_disagreement_score":0.1756318,"about_ca_system_score_codex":0.00008920846,"about_ca_system_score_gemma":0.00009787822,"threshold_uncertainty_score":0.9999011},"labels":[],"label_agreement":null},{"id":"W6929312140","doi":"10.48550/arxiv.1105.0919","title":"WR 110: A Single Wolf-Rayet Star With Corotating Interaction Regions In Its Wind?","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Security and Verification in Computing","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; Université de Montréal","funders":"","keywords":"Amplitude; Rotation period; Stars; Rotation (mathematics); Stellar rotation; Solar rotation; Orbital period; Star (game theory); Shock (circulatory)","score_opus":0.15641325242117216,"score_gpt":0.20723205355135724,"score_spread":0.05081880113018508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929312140","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.59052914,0.000030592837,0.40450263,0.00009326975,0.00052811333,0.00030048963,0.000003214443,0.00025107377,0.003761438],"genre_scores_gemma":[0.993719,0.00003418441,0.0057890587,0.00009199657,0.00006604104,0.0000013355876,0.000010813541,0.000017828954,0.00026978005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997978,0.00019637795,0.0002769646,0.0010898164,0.000106943466,0.00035193673],"domain_scores_gemma":[0.998072,0.00017810472,0.00046251915,0.0009502217,0.00021405715,0.00012307095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027654722,0.00028503643,0.0002861945,0.00041702794,0.00019420871,0.00016368197,0.0013650978,0.00021576292,0.00002734343],"category_scores_gemma":[0.000053476775,0.00033331552,0.000097581564,0.0008486524,0.00007447096,0.00071223767,0.0009822329,0.0008393977,0.000057522873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002802523,0.001171085,0.011327511,0.00036741974,0.00023841085,0.0010538668,0.018917292,0.38622972,0.0004151434,0.5772987,0.0003862778,0.0023143012],"study_design_scores_gemma":[0.001108865,0.00027557352,0.004416127,0.0011446762,0.00005969016,0.000045008026,0.0013701125,0.9619337,0.0010674424,0.026510162,0.00096285524,0.0011058301],"about_ca_topic_score_codex":0.00039794264,"about_ca_topic_score_gemma":0.00024101337,"teacher_disagreement_score":0.5757039,"about_ca_system_score_codex":0.0003476855,"about_ca_system_score_gemma":0.00019945459,"threshold_uncertainty_score":0.9999119},"labels":[],"label_agreement":null},{"id":"W6976223792","doi":"10.6068/dp14baa3c962f28","title":"Most Recent Data (1996). Statistics Canada. CANSIM: Ethnic Diversity and Immigration - Immigrants and Nonpermanent Residents | Country: Canada | Province: British Columbia | Table: Immigrant population as a proportion of total population and proportion of immigrants who arrived from 1981 to 1996 | Variable: Immigrant population | Units: %, 1996. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-092.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Security and Verification in Computing","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":"Immigration; Census; Population; Socioeconomic status; Population statistics; Official statistics; Ethnic group; Demographic statistics","score_opus":0.024067621192401092,"score_gpt":0.24491014838901792,"score_spread":0.22084252719661684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976223792","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.006756677,0.0016249588,0.00034562804,0.000010782262,0.0005635402,0.00178803,0.9888346,0.0000669169,0.000008862048],"genre_scores_gemma":[0.027600508,0.0011117272,0.0009646249,0.0001013394,0.00010383695,0.000013080781,0.969916,0.00007599156,0.000112903006],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936777,0.0004723615,0.0015782778,0.0018597144,0.001887343,0.00052461],"domain_scores_gemma":[0.9944248,0.0002331022,0.00192627,0.0024570827,0.0005311404,0.00042757712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010808697,0.0005241528,0.0009983036,0.00014562355,0.00052205526,0.00043782755,0.0015176341,0.00042523438,0.0000824199],"category_scores_gemma":[0.00034155668,0.0006637636,5.0069445e-7,0.00064451544,0.00012939239,0.0011272861,0.0022941914,0.0004639457,0.0000015935864],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00013456051,0.000097299075,0.007511452,0.00064539403,0.00014239768,0.00006923273,0.00004504652,0.000041334402,0.000026489992,0.0001238762,0.98759574,0.0035671748],"study_design_scores_gemma":[0.0013597821,0.000224035,0.10480252,0.0004692888,0.00043678994,0.00017489809,0.0003132971,0.09831827,3.72567e-7,0.000005669523,0.7928132,0.0010819011],"about_ca_topic_score_codex":0.99998367,"about_ca_topic_score_gemma":0.9998286,"teacher_disagreement_score":0.19478257,"about_ca_system_score_codex":0.00027572515,"about_ca_system_score_gemma":0.0032409322,"threshold_uncertainty_score":0.99958134},"labels":[],"label_agreement":null},{"id":"W6989922581","doi":"","title":"Compiler-Based Approach to Enhance BliMe Hardware Usability","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Security and Verification in Computing","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":"Usability; Software; Code (set theory); Source code; Transformation (genetics); Usability goals; Taint checking","score_opus":0.022869599644559802,"score_gpt":0.24522207854064534,"score_spread":0.22235247889608553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989922581","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.94709563,0.00004769544,0.0462852,0.0017145358,0.0013675854,0.0007580882,0.00004974055,0.00076670793,0.0019147923],"genre_scores_gemma":[0.42646277,0.000033041724,0.21807967,0.00025427394,0.00019198716,0.0000074528007,0.0014085104,0.00008868043,0.3534736],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978797,0.00012967337,0.00021102541,0.0009139016,0.00050734443,0.00035834467],"domain_scores_gemma":[0.99800617,0.00012819101,0.0002889592,0.0010474564,0.0003548844,0.00017436368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003930874,0.00027062165,0.00044111497,0.00038833576,0.00041790048,0.00009152131,0.0020894408,0.00027215746,0.000034376088],"category_scores_gemma":[0.000043436128,0.00034774365,0.00021312678,0.0009795737,0.00007029744,0.0002718148,0.00023138474,0.00032997466,0.00031526614],"study_design_candidate":"qualitative","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.00044950095,0.0016697606,0.0009774052,0.004023787,0.00037054584,0.00004296874,0.85414165,0.009773634,0.006617844,0.013620153,0.037109125,0.07120363],"study_design_scores_gemma":[0.002284902,0.0011564937,0.078861,0.002440919,0.0003786583,0.000008939462,0.32691297,0.4886182,0.06069939,0.0029338356,0.029750034,0.005954669],"about_ca_topic_score_codex":0.0068907635,"about_ca_topic_score_gemma":0.003428866,"teacher_disagreement_score":0.52722865,"about_ca_system_score_codex":0.0001254216,"about_ca_system_score_gemma":0.00020375426,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W6999680838","doi":"","title":"Dataflow analysis of the [pi]-calculus","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Security and Verification in Computing","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":"Dataflow; Context (archaeology); Computation; Abstract interpretation; Data-flow analysis; Information flow; Data flow diagram; Order (exchange)","score_opus":0.020562385751996107,"score_gpt":0.25635505763233857,"score_spread":0.23579267188034247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999680838","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.9306246,0.0005928317,0.0003803854,0.00011492503,0.005892529,0.0009836747,0.0011798085,0.0005826279,0.059648633],"genre_scores_gemma":[0.9939672,0.00006625335,0.0036452631,0.00029079826,0.00003898517,0.000036182955,0.0005128409,0.00005388935,0.0013886311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954371,0.00038825258,0.0011203217,0.0012840031,0.0012181918,0.0005521351],"domain_scores_gemma":[0.99501896,0.00029860568,0.001156,0.0027937698,0.0005416048,0.0001910681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010527555,0.00054988294,0.0008378232,0.0007413126,0.0011724152,0.00018724432,0.0045761224,0.00057095976,0.00009388223],"category_scores_gemma":[0.0005987447,0.0004885522,0.0008955678,0.004707668,0.00007862086,0.00082317885,0.0005753165,0.0012220911,0.00008635452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024917617,0.00026972734,0.000063464366,0.00021184677,0.0013766375,0.000012363359,0.00007131745,0.0024545002,0.004436384,0.9064103,0.000007068125,0.08466149],"study_design_scores_gemma":[0.0042387955,0.00044561794,0.07961173,0.0030541103,0.01066693,0.00006458542,0.001097973,0.07111532,0.46890005,0.18359368,0.1694283,0.0077829035],"about_ca_topic_score_codex":0.00042081304,"about_ca_topic_score_gemma":0.00096753455,"teacher_disagreement_score":0.7228166,"about_ca_system_score_codex":0.00048369588,"about_ca_system_score_gemma":0.00017246693,"threshold_uncertainty_score":0.99975663},"labels":[],"label_agreement":null},{"id":"W7015143202","doi":"","title":"Security Wrapper Technology for COTS Software Products","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Security and Verification in Computing","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":"Software; Product (mathematics); Component (thermodynamics); Software system; Key (lock)","score_opus":0.021971373333544566,"score_gpt":0.2612619900965837,"score_spread":0.23929061676303912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015143202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041876707,0.00015676235,0.9385182,0.014718142,0.0006763121,0.0003679757,0.0000025742006,0.0008068019,0.0028764752],"genre_scores_gemma":[0.80087155,0.00001340609,0.1982641,0.0004261159,0.00016520087,0.00005012879,0.0000028074717,0.0000074093437,0.00019926332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903774,0.000018983543,0.00015348269,0.0003951579,0.0001266424,0.0002679627],"domain_scores_gemma":[0.9990475,0.00007925222,0.0000626801,0.0005677559,0.00020097953,0.00004179091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022141068,0.00009013216,0.00010775223,0.000110403795,0.00019522916,0.00006748771,0.0007410416,0.000089585345,0.000028058104],"category_scores_gemma":[0.00026274976,0.00009192585,0.000033302495,0.00063136336,0.000052745043,0.0001848404,0.00015219605,0.00011759332,0.000057723424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015597887,0.00021580438,0.0035066316,0.00007802306,0.000023382247,0.000011155953,0.001400263,0.000030674088,0.006403703,0.75319606,0.0378692,0.19724949],"study_design_scores_gemma":[0.0005213717,0.00011788322,0.0005211762,0.00003033256,0.000005389313,0.00009965261,0.000056830493,0.03190825,0.02089049,0.4051265,0.54038715,0.00033496952],"about_ca_topic_score_codex":0.0000010663535,"about_ca_topic_score_gemma":0.0000010600404,"teacher_disagreement_score":0.7589949,"about_ca_system_score_codex":0.000024515668,"about_ca_system_score_gemma":0.00006289499,"threshold_uncertainty_score":0.37486276},"labels":[],"label_agreement":null},{"id":"W7018859081","doi":"","title":"Efficient Memory Allocator for Restricting Use-After-Free Exploitations","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Security and Verification in Computing","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":"Allocator; Heap (data structure); C dynamic memory allocation; Memory leak; Block (permutation group theory); Memory management; Offset (computer science)","score_opus":0.021187100080498275,"score_gpt":0.22780883550232123,"score_spread":0.20662173542182294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018859081","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.966999,0.00032225525,0.028313192,0.0013436947,0.0019208416,0.0005509942,0.00005256539,0.00033593446,0.00016151194],"genre_scores_gemma":[0.38123795,0.000090544774,0.32211742,0.00010396381,0.00033427347,0.000023768236,0.00055975106,0.00011523661,0.2954171],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844384,0.000055974724,0.00021289126,0.0006468492,0.00034500347,0.000295425],"domain_scores_gemma":[0.9981658,0.00028722512,0.00026762873,0.0008269365,0.00035187064,0.000100540834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025743127,0.00023061321,0.00028676385,0.00047808833,0.00035589247,0.00017530122,0.0013385125,0.00022766483,0.000015529653],"category_scores_gemma":[0.000111864276,0.00029001138,0.00025114647,0.00051971735,0.000047487152,0.0002788372,0.00023768096,0.0002580358,0.000050377246],"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.000228578,0.0003044263,0.000092583454,0.0023573476,0.0003774269,0.000092323746,0.9178004,0.007913393,0.0017231157,0.041773517,0.016224803,0.011112069],"study_design_scores_gemma":[0.0019075451,0.00039444037,0.003985429,0.0020332686,0.000542301,0.00001281508,0.39111814,0.58348083,0.003464706,0.004942738,0.006299831,0.0018179722],"about_ca_topic_score_codex":0.0034411694,"about_ca_topic_score_gemma":0.0036444706,"teacher_disagreement_score":0.5857611,"about_ca_system_score_codex":0.000113165006,"about_ca_system_score_gemma":0.00019153782,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W7024212963","doi":"","title":"/R E P E A T -- Advisory - Boralex will Release its 2020 Fourth Quarter Financial Results on February 25/","year":2021,"lang":"en","type":"other","venue":"","topic":"Security and Verification in Computing","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); Financial plan; Financial stability; Revenue","score_opus":0.02126089548265401,"score_gpt":0.2530269046821463,"score_spread":0.23176600919949228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024212963","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.000052995303,0.0015484227,0.10542785,0.0052427948,0.0031031587,0.00046045473,0.00006452489,0.0009942844,0.8831055],"genre_scores_gemma":[0.008284566,0.0005988817,0.057272587,0.010018088,0.0049099857,0.0000643367,0.00027954526,0.00033569595,0.9182363],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971703,0.00019278796,0.00048225062,0.0012126279,0.0005096047,0.0004323806],"domain_scores_gemma":[0.99781066,0.00016676799,0.00035042543,0.0013810961,0.00010181308,0.00018924984],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025846588,0.00040227378,0.00040169284,0.00023525035,0.00014117098,0.00022396719,0.0012724086,0.0004345057,0.0010086496],"category_scores_gemma":[0.00023969456,0.00039934122,0.00018963043,0.0006003117,0.00004023403,0.0001686682,0.00028902933,0.0005429624,0.0006217671],"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.000016729744,0.0001140292,0.000004597493,0.000061114966,0.000019010884,0.00010052144,0.00023312759,0.00001820154,0.0000064929636,0.028465124,0.9652193,0.005741727],"study_design_scores_gemma":[0.0007944138,0.00016519775,0.000594154,0.00062127586,0.000009520889,0.000019846724,0.000020669017,0.015451612,0.000073637566,0.00038848372,0.9811784,0.0006827738],"about_ca_topic_score_codex":0.00021161114,"about_ca_topic_score_gemma":0.00013079304,"teacher_disagreement_score":0.04815526,"about_ca_system_score_codex":0.000055519133,"about_ca_system_score_gemma":0.0003726265,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W7025520897","doi":"","title":"The Weight of Things: Inheritance and Gender in Alice Munro's Short Fiction","year":2025,"lang":"en","type":"article","venue":"W&M Publish (College of William & Mary)","topic":"Security and Verification in Computing","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":"Inheritance (genetic algorithm); Alice (programming language); Identity (music); Presentation (obstetrics); Dynamics (music)","score_opus":0.01609971866958793,"score_gpt":0.24937085173722634,"score_spread":0.23327113306763841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025520897","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.21527016,0.015971461,0.29435864,0.02004744,0.009591957,0.0026527257,0.000061925195,0.00061833445,0.44142735],"genre_scores_gemma":[0.9896927,0.00024676239,0.009242702,0.00033409297,0.000045915152,0.000021396952,0.0000017268386,0.000006533734,0.00040820386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852395,0.00011527454,0.0005047984,0.00035667807,0.00027900832,0.00022031323],"domain_scores_gemma":[0.998639,0.00035075154,0.0001550684,0.0005942601,0.00022082805,0.000040122068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092663144,0.00012452384,0.0002084391,0.00019941281,0.00021238331,0.00015335031,0.0009580005,0.00010154452,0.0000047526364],"category_scores_gemma":[0.00019521326,0.000108126296,0.000054268156,0.0012813894,0.00019277014,0.001253716,0.00033322079,0.00020173681,2.1772324e-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.000041436368,0.00025448416,0.021015625,0.0002705274,0.000087807806,0.0000066502594,0.0041543907,0.00008442943,0.00073330355,0.85092574,0.09942021,0.023005368],"study_design_scores_gemma":[0.0013709887,0.00012393523,0.23238847,0.00042425143,0.000032485063,0.000016729919,0.0011609017,0.11582724,0.0040678177,0.06329834,0.58068174,0.0006070967],"about_ca_topic_score_codex":0.00007895267,"about_ca_topic_score_gemma":0.000034343146,"teacher_disagreement_score":0.7876274,"about_ca_system_score_codex":0.000050240375,"about_ca_system_score_gemma":0.00015364145,"threshold_uncertainty_score":0.44092622},"labels":[],"label_agreement":null},{"id":"W7033123821","doi":"","title":"Prise en charge des arrêts cardio-respiratoires (analyse prospective de la chaîne de survie sur le territoire du SMUR de Rouen ; à propos de 405 cas)","year":2000,"lang":"fr","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"Security and Verification in Computing","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":"Nova scotia; Congenital disease; Electrodiagnosis","score_opus":0.019745098998188586,"score_gpt":0.26597719151942945,"score_spread":0.24623209252124087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033123821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019182332,0.00042322342,0.8334117,0.0017109023,0.000587968,0.0070221773,0.00013459165,0.00090530084,0.13662183],"genre_scores_gemma":[0.5535424,0.0017069492,0.3979788,0.0033338612,0.0013443943,0.006567687,0.00035034603,0.0003820448,0.034793504],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99250656,0.002435291,0.0013888589,0.0011013248,0.0009425901,0.0016253784],"domain_scores_gemma":[0.99558157,0.0004219458,0.0010350777,0.0015521233,0.0007355994,0.0006737147],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012698021,0.0008957766,0.0008884163,0.0011253736,0.0016497867,0.003996066,0.0029916533,0.0012154252,0.00049774844],"category_scores_gemma":[0.0015145439,0.0009843027,0.00045620368,0.0018123183,0.0010871937,0.0047510914,0.0006504603,0.0014998877,0.0002509982],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027266765,0.0017770263,0.050526116,0.005072569,0.0008243378,0.00081204745,0.21410996,0.02588493,0.013816893,0.16079912,0.062057868,0.46404648],"study_design_scores_gemma":[0.0011372996,0.00009202305,0.00843366,0.0029288742,0.000109583656,0.0011737172,0.00031250386,0.11963791,0.08062092,0.0030975984,0.78091216,0.0015437267],"about_ca_topic_score_codex":0.007927593,"about_ca_topic_score_gemma":0.0019067294,"teacher_disagreement_score":0.7188543,"about_ca_system_score_codex":0.0034115629,"about_ca_system_score_gemma":0.009102392,"threshold_uncertainty_score":0.99964994},"labels":[],"label_agreement":null},{"id":"W7034307947","doi":"","title":"Tariff threats cast a shadow over US reliance on Canada for the majority of its oil imports","year":2024,"lang":"en","type":"other","venue":"","topic":"Security and Verification in Computing","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":"Shadow (psychology); Tariff; Government (linguistics); Production (economics); Productivity","score_opus":0.026380850618364524,"score_gpt":0.2731768377950243,"score_spread":0.24679598717665974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034307947","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.000058613772,0.015204867,0.057547227,0.004415372,0.011578102,0.0008069355,0.00031022992,0.0005133176,0.9095653],"genre_scores_gemma":[0.012900784,0.00048322036,0.0068212184,0.001954759,0.0008364062,0.000034495326,0.000011407475,0.00018217259,0.9767755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985712,0.000020423075,0.0002647839,0.0005399573,0.00036905432,0.00023454332],"domain_scores_gemma":[0.99857193,0.00021489877,0.00021978148,0.0008828981,0.000055236993,0.000055258046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002107933,0.00021473804,0.00023418393,0.00007580796,0.00007335636,0.00008907835,0.00096161274,0.00014782324,0.00024664783],"category_scores_gemma":[0.000036441263,0.00015047089,0.00009532902,0.00027902477,0.000031257205,0.00003959806,0.00016823284,0.00022683122,0.000025792235],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000030527015,0.000019828123,0.000018778665,0.00028705355,0.000054418113,0.000010993703,0.00011496669,0.000026805887,0.0000026624102,0.078569815,0.91267926,0.008212386],"study_design_scores_gemma":[0.00013230719,0.00003130989,0.00015407514,0.00044296807,0.000020648733,0.000010728549,0.000014450716,0.024388097,0.00013811968,0.0010078698,0.97339606,0.00026333955],"about_ca_topic_score_codex":0.29194504,"about_ca_topic_score_gemma":0.37329963,"teacher_disagreement_score":0.08135458,"about_ca_system_score_codex":0.00009039526,"about_ca_system_score_gemma":0.0005485493,"threshold_uncertainty_score":0.71277},"labels":[],"label_agreement":null},{"id":"W7034482771","doi":"","title":"Translating climate change: Anthropology and the travelling idea of climate change","year":2018,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Security and Verification in Computing","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":"Climate change; Cold winter; Reading (process); Extreme Cold; Cold weather; Cold climate","score_opus":0.06688385317287482,"score_gpt":0.3003067981065169,"score_spread":0.23342294493364207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034482771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37715364,0.00048210766,0.552962,0.01698771,0.00043165614,0.0020738938,0.00029496185,0.0002458959,0.04936813],"genre_scores_gemma":[0.96748495,0.007411758,0.024879683,0.000056500947,0.000111232584,4.3216323e-7,0.000009998639,0.000011219284,0.000034204888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971828,0.000767234,0.00020792888,0.0005621535,0.00050825457,0.0007716615],"domain_scores_gemma":[0.99776316,0.0007656281,0.0002739202,0.0006110277,0.00040792316,0.00017833637],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0019516964,0.00017995106,0.00039706007,0.0006251563,0.0019495074,0.00004456994,0.0019033857,0.00011362935,0.000050244256],"category_scores_gemma":[0.00005114159,0.00019188765,0.00015921051,0.0011135496,0.0039171325,0.0008736536,0.0015336493,0.00049641187,0.0000044447033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010839058,0.0001448935,0.006881288,0.00030036154,0.000098832905,0.000058781854,0.08667327,0.0000079556385,0.00040831917,0.7350731,0.000054429915,0.16921489],"study_design_scores_gemma":[0.014139844,0.0031064604,0.06696742,0.0011223071,0.00020142655,0.0001153466,0.10865666,0.67637134,0.0007961068,0.03480288,0.09228225,0.0014379579],"about_ca_topic_score_codex":0.0010715805,"about_ca_topic_score_gemma":0.00074878876,"teacher_disagreement_score":0.7002702,"about_ca_system_score_codex":0.000059132344,"about_ca_system_score_gemma":0.00009071479,"threshold_uncertainty_score":0.99934983},"labels":[],"label_agreement":null},{"id":"W7036431961","doi":"","title":"Canada – Ontario Province – Niagara Falls – The Clifton Hotel","year":2013,"lang":"en","type":"article","venue":"Digital USD (University of San Diego)","topic":"Security and Verification in Computing","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":"Work (physics); Tourism; Government (linguistics); Placemaking","score_opus":0.01012132635666114,"score_gpt":0.15908634254129053,"score_spread":0.1489650161846294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036431961","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.91478163,0.000042120908,0.052453134,0.001297827,0.00026628256,0.00030418095,0.000016505966,0.00008314596,0.030755194],"genre_scores_gemma":[0.9963411,0.0000014191484,0.0013097996,0.00023783186,0.000016144048,1.9758662e-7,0.0000064936376,0.0000032163832,0.002083805],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99915606,0.000018203762,0.00010374448,0.00025077726,0.00026898747,0.00020224784],"domain_scores_gemma":[0.99912226,0.000112605485,0.00012464747,0.00044492402,0.00011077824,0.00008480262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006256985,0.00009678573,0.0001168134,0.000036840884,0.00025020423,0.00017406383,0.001257504,0.000037716192,0.00011270795],"category_scores_gemma":[0.000014563986,0.00009378112,0.000058468075,0.00018349846,0.00010812559,0.0011303676,0.0003467001,0.00013331747,0.000057240883],"study_design_candidate":"not_applicable","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.00005157367,0.00059980416,0.056972105,0.00016832097,0.00029741906,0.00017720263,0.03455976,0.0007096054,0.00028254162,0.14030948,0.38667026,0.37920192],"study_design_scores_gemma":[0.0009185835,0.00020732719,0.55789113,0.00012845368,0.00002713892,0.000036012658,0.0045561194,0.027050158,0.0002444529,0.0066679637,0.40129396,0.0009786771],"about_ca_topic_score_codex":0.7313233,"about_ca_topic_score_gemma":0.8786857,"teacher_disagreement_score":0.50091904,"about_ca_system_score_codex":0.00017567149,"about_ca_system_score_gemma":0.0007507684,"threshold_uncertainty_score":0.38242832},"labels":[],"label_agreement":null},{"id":"W7036871867","doi":"","title":"Composition élémentaire de sols archéologiques (île Saint-Bernard, Québec, Canada) analysés par ICP-AES et comparaisons inter sous-opérations.","year":2017,"lang":"fr","type":"other","venue":"EspaceINRS (National Institute for Scientific Research (Canada))","topic":"Security and Verification in Computing","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":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Triacetin; Emperipolesis; Demotion","score_opus":0.09099935092972215,"score_gpt":0.36081185353451944,"score_spread":0.2698125026047973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036871867","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057924506,0.002003603,0.45132086,0.46491465,0.01436,0.003994568,0.0039869193,0.00021687844,0.053410057],"genre_scores_gemma":[0.8353481,0.00012483235,0.023177225,0.0025151167,0.0012707135,0.0006063831,0.002638504,0.00014412504,0.13417499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98970026,0.0012025923,0.0009678575,0.0019440885,0.0044897296,0.0016954513],"domain_scores_gemma":[0.99121773,0.0016794541,0.00090625964,0.0016439204,0.0037622273,0.00079040165],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061173164,0.000677603,0.0007493854,0.0007955417,0.0066997935,0.0033678017,0.004084912,0.00034831997,0.0005014433],"category_scores_gemma":[0.0022765358,0.000735838,0.0002575951,0.0009835617,0.0023677938,0.0010688687,0.0009106224,0.0014673125,0.0000311391],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00004262835,0.00018854158,0.0010176826,0.00016094155,0.00026612234,0.000058113106,0.00043974628,0.015309212,0.00023807242,0.27705786,0.70208853,0.0031325673],"study_design_scores_gemma":[0.00044229126,0.00006671536,0.0025790723,0.0004539928,0.000026861373,0.000033776265,0.0001569025,0.16524372,0.00087643607,0.001170036,0.82832766,0.0006225349],"about_ca_topic_score_codex":0.99639285,"about_ca_topic_score_gemma":0.99998534,"teacher_disagreement_score":0.8295557,"about_ca_system_score_codex":0.011513371,"about_ca_system_score_gemma":0.10826314,"threshold_uncertainty_score":0.9995093},"labels":[],"label_agreement":null},{"id":"W7037098341","doi":"","title":"Diana Containerships Inc. Reports Financial Results for the First Quarter Ended March 31, 2017","year":2017,"lang":"en","type":"other","venue":"","topic":"Security and Verification in Computing","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); Financial management","score_opus":0.049318694790043215,"score_gpt":0.288548505915234,"score_spread":0.2392298111251908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037098341","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.0000013150283,0.00045531034,0.2599013,0.009729004,0.0034278717,0.0009876055,0.00004378735,0.00032896345,0.7251249],"genre_scores_gemma":[0.007079369,0.00012801818,0.017706353,0.0018341574,0.0036727046,0.00028730885,0.000092632,0.000111571826,0.9690879],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998095,0.000040130803,0.00040523103,0.0007754659,0.00029942993,0.00038477324],"domain_scores_gemma":[0.99581933,0.00055580115,0.0008198756,0.0026165643,0.00011105078,0.0000773902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010636717,0.00026738713,0.00029906046,0.00013237605,0.00070510554,0.0004707724,0.0020626793,0.00032818108,0.000017647471],"category_scores_gemma":[0.0005957167,0.00019540747,0.00014797747,0.00008144397,0.00012039289,0.0001280015,0.0002897483,0.00028073546,0.00005731377],"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.000013465672,0.000016215672,0.000010180149,0.0000337906,0.00002402291,0.00002524572,0.00022325123,0.0000015109264,3.3204398e-7,0.015860023,0.98165643,0.0021355585],"study_design_scores_gemma":[0.00039112536,0.00004223292,0.00033428322,0.00011333464,0.000011648309,0.000031840962,0.000010906984,0.006169383,0.000008405133,0.0010346108,0.9915679,0.00028432155],"about_ca_topic_score_codex":0.0005229236,"about_ca_topic_score_gemma":0.0021198553,"teacher_disagreement_score":0.24396302,"about_ca_system_score_codex":0.00004530738,"about_ca_system_score_gemma":0.00029550723,"threshold_uncertainty_score":0.79684854},"labels":[],"label_agreement":null},{"id":"W7037117483","doi":"","title":"Decreasing internalized ageism: development, feasibility, and effectiveness of a process-based intervention","year":2024,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Security and Verification in Computing","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 Manitoba","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Intervention (counseling); Psychological intervention; Session (web analytics); Older people; Affect (linguistics); Attribution","score_opus":0.025128774977065532,"score_gpt":0.27400697524901646,"score_spread":0.24887820027195093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037117483","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.88448626,0.0004464473,0.11401343,0.000031438183,0.00032785928,0.00027449965,0.0000025832578,0.00008128865,0.00033620838],"genre_scores_gemma":[0.988844,0.000015624822,0.011004572,0.0000030761028,0.000009120496,8.087691e-7,0.00005689029,0.000010675666,0.00005526948],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99876684,0.00019532714,0.00018447606,0.00045282135,0.0002744979,0.0001260266],"domain_scores_gemma":[0.9988696,0.00017215552,0.00037765058,0.00026263637,0.0002658004,0.000052152645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005947678,0.00016975592,0.00032314652,0.00034568875,0.00012415153,0.00006407931,0.00060350884,0.00015129376,0.0000025212669],"category_scores_gemma":[0.00005303174,0.00022037543,0.00012904938,0.0003606047,0.000063663596,0.0002519538,0.00014620708,0.00020257781,0.000005142361],"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.007569492,0.00424856,0.41156307,0.21207388,0.0031410959,0.00038328202,0.09063276,0.0007452364,0.0143605415,0.07570702,0.0004998215,0.17907527],"study_design_scores_gemma":[0.0036644135,0.00037056796,0.8370074,0.02035238,0.00031253463,0.000017781633,0.02130425,0.07112687,0.03512491,0.00898856,0.0007138184,0.0010164892],"about_ca_topic_score_codex":0.00046539246,"about_ca_topic_score_gemma":0.012340285,"teacher_disagreement_score":0.42544436,"about_ca_system_score_codex":0.00013407477,"about_ca_system_score_gemma":0.00019877362,"threshold_uncertainty_score":0.8986649},"labels":[],"label_agreement":null},{"id":"W7037497199","doi":"","title":"The Effects of Video Quality on Online Video Lectures","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Security and Verification in Computing","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":"Social Sciences and Humanities Research Council of Canada","keywords":"Online video; Quality (philosophy); Video recording; Affect (linguistics); Video quality; Compromise; Online learning","score_opus":0.016349164710744442,"score_gpt":0.25432040576716214,"score_spread":0.2379712410564177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037497199","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.99545187,0.00020209521,0.00074000424,0.0013785362,0.0016096147,0.00027728028,0.000012390725,0.00016405353,0.00016418209],"genre_scores_gemma":[0.6602522,0.0010388289,0.006622323,0.00017486603,0.00025431058,0.0000022314998,0.000473581,0.0000683152,0.3311133],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99842334,0.00022347651,0.00021526903,0.00042792945,0.0004745279,0.00023543803],"domain_scores_gemma":[0.9971629,0.0012208254,0.0005376157,0.00078291213,0.00023579379,0.00005994873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003960879,0.00019762825,0.00035222058,0.00020437552,0.0004124265,0.000045739936,0.0015672513,0.00021425694,0.000005526508],"category_scores_gemma":[0.00023424944,0.00018254716,0.00021354845,0.00046655996,0.00009675018,0.00013286756,0.00016196568,0.00031884355,0.000030607713],"study_design_candidate":"qualitative","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.00076715776,0.00081979606,0.0005024263,0.0053990483,0.00087322365,0.0000834815,0.68359846,0.00080444233,0.019847129,0.10862229,0.019209454,0.15947308],"study_design_scores_gemma":[0.0066014444,0.0033957947,0.42034256,0.007379796,0.0006356065,0.000009330941,0.29693404,0.029525772,0.18435855,0.028007457,0.018739078,0.0040705656],"about_ca_topic_score_codex":0.011509692,"about_ca_topic_score_gemma":0.017679492,"teacher_disagreement_score":0.41984013,"about_ca_system_score_codex":0.000052462216,"about_ca_system_score_gemma":0.0001057881,"threshold_uncertainty_score":0.9950727},"labels":[],"label_agreement":null},{"id":"W7039059938","doi":"","title":"La gestion de la visibilité de l'orientation sexuelle des personnes LGBQP dans les milieux de la famille d'origine, de la santé et du travail : une analyse de classes latentes","year":2023,"lang":"fr","type":"other","venue":"Archipelago (University of Quebec in Montreal)","topic":"Security and Verification in Computing","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":"Sexology; Context (archaeology); Poison control; Sexual behavior","score_opus":0.013225158314947418,"score_gpt":0.25677376665984736,"score_spread":0.24354860834489994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039059938","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.74980605,0.00048098937,0.23816115,0.0002085176,0.00005473705,0.00016430854,0.000030399615,0.00017973421,0.010914146],"genre_scores_gemma":[0.93025875,0.0031656078,0.060045175,0.000046575962,0.00008019414,0.0000034548607,0.00002995931,0.00008346181,0.0062868414],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9934291,0.0046853195,0.00031065568,0.00067682,0.00029085463,0.0006072145],"domain_scores_gemma":[0.99336034,0.0055402163,0.0003346709,0.00044907734,0.00009837582,0.00021729866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00295489,0.0003738283,0.00044782335,0.0005581527,0.00049102306,0.0001747933,0.0009231789,0.00063123077,0.00006394333],"category_scores_gemma":[0.0005101242,0.00048481033,0.0002453402,0.00094203633,0.0013428209,0.0003651179,0.00022429561,0.000784144,0.000014752406],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001078566,0.00050508,0.2520664,0.00032097637,0.0001675334,0.00040987658,0.45896995,0.02246171,0.0013423495,0.023192845,0.00044262616,0.2400128],"study_design_scores_gemma":[0.000708727,0.000062965926,0.673267,0.00048577908,0.00012591961,0.00009463171,0.0925726,0.22068213,0.00008313934,0.010722642,0.0008622199,0.00033227098],"about_ca_topic_score_codex":0.61543924,"about_ca_topic_score_gemma":0.8078466,"teacher_disagreement_score":0.42120057,"about_ca_system_score_codex":0.00084800477,"about_ca_system_score_gemma":0.00083836314,"threshold_uncertainty_score":0.9997603},"labels":[],"label_agreement":null},{"id":"W7071055531","doi":"","title":"Redundancy, resilience, security key to systems integration","year":2003,"lang":"en","type":"article","venue":"NPARC","topic":"Security and Verification in Computing","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":"Key (lock); System integration; Data security; Security information and event management; Security service","score_opus":0.017466200580460386,"score_gpt":0.25722402501572517,"score_spread":0.23975782443526478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071055531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034258623,0.000058585454,0.78209394,0.00073741906,0.0013496899,0.0002321775,0.0000010895106,0.00023279132,0.1810357],"genre_scores_gemma":[0.9516988,0.000003978316,0.047436014,0.00025020764,0.000069504735,0.0000206562,7.2331613e-7,0.0000045376314,0.0005155936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988216,0.00010542463,0.0002290354,0.00036125057,0.00026379974,0.00021885733],"domain_scores_gemma":[0.99914634,0.00007893639,0.0000684222,0.00044969402,0.00014137868,0.00011524426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737815,0.00009446872,0.000106474465,0.00009765804,0.00018958941,0.00029605845,0.0005756135,0.000053849522,0.000031033942],"category_scores_gemma":[0.00020719408,0.00009310128,0.00003219195,0.00062205567,0.00002222007,0.00031269333,0.0000667234,0.00012784523,0.00020307551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013420774,0.00002586189,0.00008044655,0.0000072777143,0.000002149802,0.0000013269622,0.0017162538,0.00013088081,0.0042495313,0.9804308,0.009573286,0.0037808528],"study_design_scores_gemma":[0.00052121654,0.00025693292,0.0016172619,0.00024151763,0.00000797667,0.00011877885,0.0010380908,0.27146086,0.05518814,0.20693575,0.46171838,0.000895088],"about_ca_topic_score_codex":0.000012357157,"about_ca_topic_score_gemma":0.000003102094,"teacher_disagreement_score":0.9174402,"about_ca_system_score_codex":0.000060413662,"about_ca_system_score_gemma":0.000064058266,"threshold_uncertainty_score":0.379656},"labels":[],"label_agreement":null},{"id":"W7071094282","doi":"","title":"\"The Reception of Peter Singerâs Theories in France\"","year":2008,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Security and Verification in Computing","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":"Human life; Term (time); Poverty","score_opus":0.01519030673963116,"score_gpt":0.21407465421957894,"score_spread":0.1988843474799478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071094282","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.94634944,0.00072917994,0.033866104,0.0017521905,0.0005111807,0.00023833627,0.00007736682,0.00036232645,0.016113872],"genre_scores_gemma":[0.99579996,0.00005342774,0.003506172,0.0002273909,0.00007442797,0.000008143076,0.00001794394,0.000013351934,0.00029917285],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865484,0.00009678276,0.0004213186,0.00028608588,0.00027816172,0.00026283515],"domain_scores_gemma":[0.9988809,0.0003820965,0.00015075911,0.00047671938,0.000039837694,0.00006966204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026431275,0.00013192391,0.00014366252,0.0000990605,0.0002493093,0.0005501637,0.0009452061,0.000072983945,0.00002339286],"category_scores_gemma":[0.00021311814,0.000105244166,0.000083470855,0.0006555438,0.00018583365,0.0032387439,0.00023583988,0.00026871762,0.00025036067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008957806,0.0004585029,0.45425013,0.00008306753,0.000046748104,0.00004743691,0.001758687,0.00014033883,0.00046049478,0.4429183,0.0026876351,0.09705906],"study_design_scores_gemma":[0.0011322387,0.00019909668,0.16900356,0.00025883596,0.0000049858927,0.00009840044,0.00009202107,0.0071434197,0.014369384,0.28863093,0.5181705,0.0008966328],"about_ca_topic_score_codex":0.0000011878512,"about_ca_topic_score_gemma":2.3108798e-7,"teacher_disagreement_score":0.51548284,"about_ca_system_score_codex":0.000014606637,"about_ca_system_score_gemma":0.00007580792,"threshold_uncertainty_score":0.53052413},"labels":[],"label_agreement":null},{"id":"W7095544741","doi":"","title":"Original signé par Frédéric Painchaud","year":2008,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Java; Confidentiality; Verisimilitude; Documentation","score_opus":0.03601499288264004,"score_gpt":0.24292396052528073,"score_spread":0.2069089676426407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095544741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029636841,0.00008436302,0.95334375,0.00089816813,0.00034541436,0.000052230476,2.1472732e-7,0.00037490358,0.015264121],"genre_scores_gemma":[0.92452645,0.000015591386,0.07405632,0.000832577,0.00013014539,0.000003893704,6.5077586e-7,0.0000032006672,0.00043115192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991931,0.000041778367,0.00014177819,0.00025198967,0.00018407185,0.00018733928],"domain_scores_gemma":[0.9993716,0.0000846884,0.000041869986,0.0003809073,0.00004995465,0.00007098911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001805763,0.0000746232,0.00007604914,0.000055732635,0.00027515116,0.00005058595,0.0004770797,0.000034523648,0.00011366654],"category_scores_gemma":[0.000020957752,0.00006771893,0.000038895098,0.00034926445,0.00005324066,0.00024776073,0.000098479846,0.00008787689,0.00049457984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030698245,0.00014917355,0.008206672,0.000011549597,0.000016037882,0.00009931505,0.0026700872,0.00037565565,0.00040717112,0.9177503,0.054839943,0.015471042],"study_design_scores_gemma":[0.0005160775,0.00013300584,0.016580615,0.00001431998,0.0000032380663,0.00051079685,0.000053281765,0.49145827,0.008294227,0.016844442,0.46499884,0.00059288554],"about_ca_topic_score_codex":0.000023798342,"about_ca_topic_score_gemma":8.137922e-7,"teacher_disagreement_score":0.90090585,"about_ca_system_score_codex":0.000018298551,"about_ca_system_score_gemma":0.00006409192,"threshold_uncertainty_score":0.6356988},"labels":[],"label_agreement":null},{"id":"W7096769244","doi":"","title":"Authentication and Performance Issues On A Large Scale Samba Service","year":2000,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Cache; Authentication (law); Password; Group Policy; Internet Authentication Service; Server; Service (business)","score_opus":0.01551120269384398,"score_gpt":0.2561019635297214,"score_spread":0.24059076083587744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096769244","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.95821714,0.00005583858,0.024891278,0.0057373527,0.000075179196,0.00007432351,5.067376e-7,0.00019689265,0.010751464],"genre_scores_gemma":[0.98184144,0.000051391733,0.014271186,0.0020138158,0.000046991267,0.000004253489,0.000001503646,0.0000027745184,0.0017666351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942887,0.000020613797,0.0000977951,0.00021283259,0.00011405865,0.00012586087],"domain_scores_gemma":[0.99959093,0.000022275533,0.000020298137,0.0002929915,0.00003476749,0.000038746246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016393744,0.000057062087,0.000051144492,0.000030690982,0.0001650673,0.00010781652,0.00026627048,0.000027199076,0.0001858135],"category_scores_gemma":[0.0000031355303,0.000052153715,0.000009731934,0.00021051046,0.00000976836,0.00027100832,0.000042591877,0.00005265208,0.000394088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033096443,0.00046287128,0.0060632867,0.00012554014,0.000017559601,0.0000013183745,0.032990947,0.00023214173,0.00044232202,0.28738442,0.004078233,0.66816825],"study_design_scores_gemma":[0.00018744626,0.00005627598,0.043623943,0.000026610482,0.0000017154618,0.000006856166,0.00006319006,0.90658516,0.0017571585,0.0008320146,0.04673438,0.00012523068],"about_ca_topic_score_codex":0.000015413974,"about_ca_topic_score_gemma":0.0000055322644,"teacher_disagreement_score":0.90635306,"about_ca_system_score_codex":0.0000080269,"about_ca_system_score_gemma":0.000008521931,"threshold_uncertainty_score":0.50653356},"labels":[],"label_agreement":null},{"id":"W7097738928","doi":"","title":"The Price of Safety: Evaluating IOMMU Performance","year":2007,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Hypervisor; Virtualization; Isolation (microbiology); Set (abstract data type); Memory protection; Temporal isolation among virtual machines; Virtual machine; Throughput; Hardware virtualization","score_opus":0.03697219076915499,"score_gpt":0.31832413702275425,"score_spread":0.28135194625359927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097738928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11960552,0.0001045529,0.84099954,0.0004200793,0.00027247096,0.0000703895,5.2153055e-8,0.00006815496,0.038459264],"genre_scores_gemma":[0.93818855,0.000019592413,0.061396953,0.00013154635,0.00004194781,8.67475e-7,1.3608467e-7,0.0000019109393,0.00021850827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991671,0.000032396136,0.0002628297,0.000120203855,0.00024878792,0.00016867937],"domain_scores_gemma":[0.9986942,0.0006276192,0.00011440694,0.00041140916,0.00012629182,0.000026061987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029591315,0.000044962184,0.00005137697,0.000028979819,0.00033358077,0.000045791596,0.0007539474,0.000020515388,0.000008242302],"category_scores_gemma":[0.00010550026,0.00003089257,0.000023758634,0.00035556796,0.00003768901,0.00015715523,0.00015778866,0.0000766246,0.000018061086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010386317,0.000021680036,0.0013864161,0.000013759043,0.000007673341,2.4767624e-7,0.0015438169,0.00030795767,0.0011162481,0.38208693,0.00014735872,0.61335754],"study_design_scores_gemma":[0.00021284005,0.000098076736,0.04440832,0.000026208712,0.000002051344,0.000010868085,0.00022419509,0.9071471,0.030924033,0.00116482,0.015654178,0.00012727395],"about_ca_topic_score_codex":0.000007471405,"about_ca_topic_score_gemma":0.0000023890234,"teacher_disagreement_score":0.9068392,"about_ca_system_score_codex":0.000019035217,"about_ca_system_score_gemma":0.000041059928,"threshold_uncertainty_score":0.25656673},"labels":[],"label_agreement":null},{"id":"W7100653991","doi":"","title":"Universityof Toronto","year":2009,"lang":"en","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Upper and lower bounds; Context (archaeology); Vulnerability (computing); Government (linguistics)","score_opus":0.01133875460112934,"score_gpt":0.23292846460098723,"score_spread":0.2215897099998579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100653991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017276596,0.000036782112,0.8088747,0.0014549168,0.000098148994,0.000016705644,2.8548707e-8,0.00018674097,0.18760426],"genre_scores_gemma":[0.9420146,0.000004696587,0.056064703,0.0011804273,0.00002825676,5.1488882e-8,1.6665575e-7,4.188329e-7,0.00070672075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997124,0.00000888743,0.000040720803,0.00010440203,0.00006334794,0.000070251306],"domain_scores_gemma":[0.9997223,0.000012596592,0.000012715394,0.00020164819,0.000021258333,0.00002947913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053740783,0.000026685395,0.00002739278,0.000009003232,0.000064739324,0.000043142016,0.00038758063,0.000014320956,0.00006166852],"category_scores_gemma":[0.000003542227,0.000026358994,0.000015322245,0.00006879067,0.0000039719257,0.00037194203,0.000034798806,0.000019166673,0.00003031307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.5707834e-7,0.000012499083,0.000020878679,2.1368936e-7,6.892741e-7,9.306656e-7,0.00028761112,0.000009687491,0.000076702476,0.9528218,0.0021123365,0.0446564],"study_design_scores_gemma":[0.0008081348,0.000350721,0.04300602,0.000017033852,0.0000049529585,0.000037456175,0.00070041383,0.4685906,0.007887578,0.085017286,0.39286458,0.00071521726],"about_ca_topic_score_codex":0.00004130423,"about_ca_topic_score_gemma":0.000010553985,"teacher_disagreement_score":0.9402869,"about_ca_system_score_codex":0.000037730715,"about_ca_system_score_gemma":0.000011414132,"threshold_uncertainty_score":0.107488856},"labels":[],"label_agreement":null},{"id":"W7105453402","doi":"10.1007/978-981-96-7273-8_34","title":"Binary Slice-Level Vulnerability Detection with xLSTM-Based Models: Enhancing Long-Term Semantic Capture","year":2025,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Security and Verification in Computing","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":"123 Certification (Canada)","funders":"","keywords":"Binary number; Vulnerability (computing); Binary code; Coding (social sciences); Software; Code (set theory); Source code; Architecture","score_opus":0.04186393200168131,"score_gpt":0.24741105922694295,"score_spread":0.20554712722526164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105453402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054581175,0.0015882317,0.9819296,0.0007079547,0.00086791645,0.000824425,0.00001903551,0.0021070826,0.0064976406],"genre_scores_gemma":[0.98727936,0.000069859256,0.004745181,0.00008113481,0.00006846836,0.00010816978,0.000044193275,0.000028028624,0.0075756125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753636,0.000037855036,0.0008151906,0.0009456802,0.00037897757,0.00028595235],"domain_scores_gemma":[0.9970161,0.0001759368,0.00065263594,0.0012013131,0.0009326302,0.000021434651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068829325,0.00045101217,0.00051346567,0.001038058,0.0005336829,0.00036250486,0.00072035094,0.00075796404,0.0000016085618],"category_scores_gemma":[0.00008623836,0.0003975174,0.00005363064,0.00089795986,0.0002158967,0.0004274296,0.0003090756,0.00072457816,0.0000034030563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001547133,0.00003484116,0.00072072976,0.001600859,0.00011469826,0.000014918998,0.00018529735,0.0006804679,0.00043181365,0.9674285,0.0002293105,0.028543115],"study_design_scores_gemma":[0.0031711755,0.001289215,0.0064405217,0.018142536,0.00035297085,0.0005128314,0.0015609134,0.70751226,0.016877098,0.21655074,0.02125099,0.0063387286],"about_ca_topic_score_codex":0.00010453206,"about_ca_topic_score_gemma":0.00012224757,"teacher_disagreement_score":0.98182124,"about_ca_system_score_codex":0.00017180717,"about_ca_system_score_gemma":0.00026286702,"threshold_uncertainty_score":0.99984765},"labels":[],"label_agreement":null},{"id":"W7117729492","doi":"10.1109/wincom65874.2025.11313411","title":"A Flexible Architecture for Securing Transactions and Data Flows in Smart Home IoT","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software deployment; Eavesdropping; Overhead (engineering); Architecture; Cryptographic protocol; Wireless; Database transaction; Internet of Things","score_opus":0.04778425292727593,"score_gpt":0.31919305226927275,"score_spread":0.2714087993419968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117729492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009010215,0.0012899917,0.980655,0.005785866,0.0013064301,0.00068367645,0.000050639355,0.00013307143,0.0010850772],"genre_scores_gemma":[0.8341618,0.00012831869,0.1636469,0.0008576346,0.00011118359,0.000049434228,0.000015105448,0.000013339273,0.0010162466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749523,0.000098436336,0.00056389975,0.0011917626,0.00016733744,0.00048334847],"domain_scores_gemma":[0.99767643,0.00060508994,0.000078322555,0.0014627489,0.00007259299,0.00010478886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008882833,0.0002458479,0.00031085894,0.00047297578,0.00050281733,0.00053128344,0.0016698184,0.00016305954,0.000041634412],"category_scores_gemma":[0.000059858037,0.00026846144,0.00006722291,0.0012146338,0.00008273421,0.00036967272,0.00042629888,0.0004292515,0.0000050844747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009692804,0.00040067238,0.00039147606,0.0010038884,0.00012271192,0.000003958193,0.0105945505,0.013471,0.00035510858,0.075456925,0.00076738093,0.8973354],"study_design_scores_gemma":[0.0009670555,0.000048676164,0.000732901,0.00027964462,0.00002524006,0.000012633358,0.00023200175,0.9535662,0.0007172545,0.010583806,0.032547295,0.0002872844],"about_ca_topic_score_codex":0.00021902639,"about_ca_topic_score_gemma":0.0008716619,"teacher_disagreement_score":0.9400952,"about_ca_system_score_codex":0.0000547342,"about_ca_system_score_gemma":0.00030723936,"threshold_uncertainty_score":0.99997675},"labels":[],"label_agreement":null},{"id":"W7118158402","doi":"10.1145/3731599.3787546","title":"10.1145/3731599.3787546","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Security and Verification in Computing","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":"Session (web analytics); Session key; Key (lock); Supercomputer","score_opus":0.009265382487454173,"score_gpt":0.19082689903566802,"score_spread":0.18156151654821384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118158402","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.0006239662,0.000036046567,0.0023145797,0.00096486625,0.000010860338,0.00010024599,0.0000012464168,0.0003694839,0.9955787],"genre_scores_gemma":[0.0013897801,2.1087031e-7,0.0069449237,0.00027163143,0.00012173358,0.0000073236906,0.0000021029243,0.000007083934,0.9912552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910885,0.000039056977,0.00015756079,0.00029379144,0.00017853695,0.00022222685],"domain_scores_gemma":[0.9992227,0.00006544959,0.00002697782,0.0005267379,0.00004365341,0.00011448937],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018599354,0.000091949114,0.000095490715,0.000060709634,0.0001336768,0.00014572368,0.00082362286,0.000040526036,0.9091377],"category_scores_gemma":[0.000022034244,0.00009749272,0.000040517643,0.000388399,0.000017135597,0.00020290689,0.00010031674,0.00007895476,0.9637924],"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.0000047186168,0.000029357201,1.7746376e-7,0.000002255115,0.0000043187856,0.0000025068164,0.00009645154,0.00023577928,0.00003396411,0.0003596013,0.064584784,0.93464607],"study_design_scores_gemma":[0.000085435946,0.00004529407,0.00004840551,0.000008209813,0.0000015370099,0.0000100176185,3.9448622e-7,0.024760645,0.00013979943,0.00007199815,0.97469807,0.00013022168],"about_ca_topic_score_codex":0.000009333229,"about_ca_topic_score_gemma":2.9629712e-8,"teacher_disagreement_score":0.93451583,"about_ca_system_score_codex":0.00002334179,"about_ca_system_score_gemma":0.000029422077,"threshold_uncertainty_score":0.3975638},"labels":[],"label_agreement":null},{"id":"W7124920585","doi":"10.1109/cloudcom67567.2025.11331540","title":"A Threat-Oriented Study of API Security Challenges in CI/CD Pipelines","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"IBM (Canada); Western University","funders":"","keywords":"Workflow; Security bug; Credential; Pipeline (software); Pipeline transport; Dependency (UML); DevOps; Software; Threat model; Confusion","score_opus":0.06290319266304673,"score_gpt":0.3222554423474637,"score_spread":0.259352249684417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124920585","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.8624282,0.013158297,0.08916624,0.0056914417,0.0033751382,0.0018199062,0.0000057239677,0.00024663724,0.024108406],"genre_scores_gemma":[0.9968492,0.0013426449,0.0013268192,0.00014428177,0.000096875316,0.000032768978,0.0000011222804,0.000009010463,0.00019732144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995795,0.00053726253,0.0014012012,0.001221082,0.0005423462,0.0005030806],"domain_scores_gemma":[0.9969788,0.00053959823,0.00034781502,0.0015166175,0.0005224316,0.00009468899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015174941,0.00036556617,0.00067833863,0.00067383004,0.00021354009,0.00011576278,0.0015344844,0.00020444376,0.00007112037],"category_scores_gemma":[0.00025590003,0.00037532198,0.00012617552,0.0024610339,0.00013088045,0.00036513136,0.0010759602,0.00046594266,0.000021544192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014502337,0.014924005,0.04246748,0.0008180423,0.00023072452,0.000032968346,0.13906883,0.0005905903,0.00006238972,0.6137821,0.0005369282,0.18734092],"study_design_scores_gemma":[0.006450402,0.001298629,0.07593671,0.0011404224,0.00008929203,0.000009134897,0.062649935,0.81756246,0.0016004683,0.027356239,0.0049015223,0.0010047863],"about_ca_topic_score_codex":0.00071686954,"about_ca_topic_score_gemma":0.001494566,"teacher_disagreement_score":0.81697184,"about_ca_system_score_codex":0.000087396016,"about_ca_system_score_gemma":0.000277384,"threshold_uncertainty_score":0.9998699},"labels":[],"label_agreement":null},{"id":"W7125587271","doi":"10.1109/cascon66301.2025.00125","title":"Framework for Source Code Compliance Analysis","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Orthopaedic Research Foundation","keywords":"XACML; Backup; Source code; NIST; Pipeline (software); Code (set theory); Abstract syntax tree; Access control; Parsing","score_opus":0.0871659696137754,"score_gpt":0.3724129070477502,"score_spread":0.2852469374339748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125587271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034239233,0.00090019417,0.98096436,0.00909767,0.001733106,0.0004364888,0.000013648238,0.00024445445,0.0062676733],"genre_scores_gemma":[0.5454085,0.00003313797,0.44231477,0.0036710694,0.00015002543,0.000033010925,0.0000051311636,0.0000074496056,0.008376889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971589,0.00012128813,0.0007377237,0.0011218986,0.00027998135,0.0005802345],"domain_scores_gemma":[0.9956659,0.0019080616,0.00028115476,0.0015638017,0.000451689,0.00012939544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007800661,0.00027914692,0.000535518,0.0004695719,0.0009165074,0.000850878,0.002116388,0.0002612188,0.00018577545],"category_scores_gemma":[0.0004218972,0.00031212406,0.0005466699,0.0055943765,0.00015291545,0.0002350845,0.00048613,0.00034216838,0.0000761708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014417936,0.00012610912,0.0014663253,0.00011913362,0.0007507938,3.415861e-7,0.0009496732,0.010225131,0.0000047705166,0.9192625,0.0039980216,0.06308278],"study_design_scores_gemma":[0.00021293186,0.000029590597,0.0015286277,0.0001598811,0.00036278382,4.997289e-7,0.00015689015,0.853978,0.00035444973,0.07251866,0.07041945,0.00027828183],"about_ca_topic_score_codex":0.00004225277,"about_ca_topic_score_gemma":0.00003912406,"teacher_disagreement_score":0.8467438,"about_ca_system_score_codex":0.00009463761,"about_ca_system_score_gemma":0.00021531286,"threshold_uncertainty_score":0.99993306},"labels":[],"label_agreement":null},{"id":"W7125604082","doi":"10.1109/cascon66301.2025.00041","title":"Survey on Kubernetes Misconfiguration Vulnerabilities and Best Practices","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Best practice; Container (type theory); Orchestration; Set (abstract data type); Root cause; Mainstream; Data breach; Security bug; Vulnerability (computing)","score_opus":0.09632792803865485,"score_gpt":0.3515863306268055,"score_spread":0.25525840258815063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125604082","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.39479896,0.006555534,0.29612395,0.024665413,0.006391364,0.0011958878,0.00003161118,0.00034701236,0.26989025],"genre_scores_gemma":[0.98268723,0.00030039568,0.001971617,0.001041669,0.000108289285,0.000009690856,0.00000890854,0.0000057281027,0.013866486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972271,0.0008143823,0.0005353119,0.00084078155,0.00028633873,0.00029612024],"domain_scores_gemma":[0.9939795,0.004428396,0.0004737531,0.0006804919,0.00035343503,0.000084403124],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019038813,0.00024467497,0.0002452811,0.00019549945,0.00064284843,0.0016298046,0.000568735,0.00015377563,0.00012989124],"category_scores_gemma":[0.0027248706,0.00024243494,0.000044059878,0.00061402714,0.00021290583,0.0008096211,0.0002191419,0.00033046756,0.0000802469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058350655,0.0005499268,0.013110886,0.00020509055,0.000093188355,0.0000018495831,0.003679664,0.00032856324,0.00014034977,0.7648267,0.0061236173,0.2108818],"study_design_scores_gemma":[0.0007504089,0.0007230404,0.11701553,0.00051488704,0.000047248206,0.0000055405812,0.0013981406,0.83436936,0.006985023,0.009837533,0.02763698,0.0007163147],"about_ca_topic_score_codex":0.0039698817,"about_ca_topic_score_gemma":0.0007288721,"teacher_disagreement_score":0.83404076,"about_ca_system_score_codex":0.00005250416,"about_ca_system_score_gemma":0.00028181728,"threshold_uncertainty_score":0.9994066},"labels":[],"label_agreement":null},{"id":"W7125609422","doi":"10.1109/cascon66301.2025.00044","title":"Securing LLM-Generated Embedded Firmware Through AI Agent-Driven Validation and Patching","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Firmware; Buffer overflow; Vulnerability (computing); Process (computing); Implementation; Software; Security testing; Software security assurance","score_opus":0.029870576210871455,"score_gpt":0.30735849672496307,"score_spread":0.2774879205140916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125609422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13881949,0.0010097433,0.8480006,0.00384305,0.0019933449,0.00043490142,0.00000612399,0.00033318115,0.005559572],"genre_scores_gemma":[0.96451765,0.00029637522,0.031068536,0.0029574262,0.00022567347,0.00001708838,0.000024978182,0.00001733709,0.00087494147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965518,0.0003741098,0.00085937703,0.0012308343,0.0004020539,0.00058183126],"domain_scores_gemma":[0.99807227,0.00028359002,0.00027819962,0.00086174416,0.00037398137,0.00013022815],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005361465,0.00041137476,0.0003924746,0.00021977152,0.0012724351,0.0016521123,0.000896996,0.00026343364,0.0001754471],"category_scores_gemma":[0.0001398283,0.0004552267,0.00011969549,0.0013736007,0.00010986249,0.0015791649,0.0009757109,0.00052018865,0.00004882966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005856425,0.0008075756,0.005773654,0.0011293782,0.00052657805,0.00003683167,0.066252984,0.03329413,0.0071254163,0.6743281,0.010676831,0.19998997],"study_design_scores_gemma":[0.0007821966,0.00006865169,0.0008769353,0.00044331164,0.00004991598,0.00001237647,0.0008534855,0.9528849,0.03025432,0.0070527964,0.0061951783,0.00052594574],"about_ca_topic_score_codex":0.0002091867,"about_ca_topic_score_gemma":0.000019517773,"teacher_disagreement_score":0.9195908,"about_ca_system_score_codex":0.00013766062,"about_ca_system_score_gemma":0.00030772592,"threshold_uncertainty_score":0.99978995},"labels":[],"label_agreement":null},{"id":"W7126220716","doi":"10.1109/raid67961.2025.00034","title":"SyzGrapher: Resource-Centric Graph-Based Kernel Fuzzing","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"Fuzz testing; Exploit; Kernel (algebra); Code (set theory); System call; Call stack; Dependency (UML); Linux kernel","score_opus":0.018735581246547083,"score_gpt":0.2607275642574595,"score_spread":0.24199198301091243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126220716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004146352,0.0033385514,0.9096194,0.006006705,0.0024780426,0.00051754824,0.000002894688,0.00057764974,0.07331289],"genre_scores_gemma":[0.96490514,0.0000868731,0.024641747,0.0075195935,0.00019822636,0.000024500756,0.0000052697415,0.000020591739,0.0025980528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954641,0.00044508048,0.0010427001,0.0014260295,0.00064604415,0.00097605115],"domain_scores_gemma":[0.99647987,0.00082893576,0.00033463782,0.0017799273,0.00031778094,0.0002588638],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012807995,0.00046719407,0.00045047275,0.0011127704,0.0011910474,0.0011963991,0.0025801768,0.0003126526,0.00032421935],"category_scores_gemma":[0.000205345,0.0005146942,0.00044533695,0.007115395,0.00026795449,0.00037056833,0.0006246236,0.0006235921,0.00017840082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056689558,0.0007745772,0.0078271795,0.00037869508,0.00017378714,0.000027274527,0.0012167922,0.005927233,0.00013230571,0.74877036,0.036448706,0.19826643],"study_design_scores_gemma":[0.0014149933,0.00008312871,0.003598161,0.0005026482,0.00006413604,0.00000494014,0.00028702623,0.86239576,0.0023447461,0.008464734,0.120168105,0.00067160913],"about_ca_topic_score_codex":0.000107579974,"about_ca_topic_score_gemma":0.000009819318,"teacher_disagreement_score":0.9607588,"about_ca_system_score_codex":0.00014995277,"about_ca_system_score_gemma":0.0006637021,"threshold_uncertainty_score":0.99984044},"labels":[],"label_agreement":null},{"id":"W7127655228","doi":"10.1145/3785520.3785526","title":"A Defence-Oriented Study of API Security in CI/CD Pipelines","year":2025,"lang":"","type":"article","venue":"","topic":"Security and Verification in Computing","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":"IBM (Canada); Western University","funders":"","keywords":"Credential; Pipeline transport; Software deployment; Cloud computing; Access control; Pipeline (software); Key (lock); Enforcement; Resilience (materials science)","score_opus":0.022200817950677444,"score_gpt":0.3030030928324804,"score_spread":0.2808022748818029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127655228","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.77523017,0.00057062204,0.21396185,0.00072144123,0.0019240945,0.0008918591,0.0000032266084,0.00010187213,0.006594854],"genre_scores_gemma":[0.9966141,0.000051331772,0.0026034045,0.00029904343,0.00006764849,0.000024487546,0.0000012481487,0.000006582996,0.0003321367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959316,0.00048852107,0.0015116124,0.0010404408,0.0005424732,0.00048530338],"domain_scores_gemma":[0.9972373,0.00048231703,0.0003574133,0.0012849515,0.0005432494,0.00009473365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013531543,0.0003107808,0.0005625682,0.00067145,0.00023264097,0.00016105156,0.0016095587,0.00016563282,0.000105875464],"category_scores_gemma":[0.00038706211,0.00032711084,0.000119856624,0.004487968,0.00014285857,0.000372093,0.0010567264,0.00045988598,0.000027463635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002097591,0.01914678,0.31229573,0.00072598935,0.00022384519,0.00004770659,0.13584939,0.0025496855,0.00027379338,0.46208748,0.0026278258,0.06396201],"study_design_scores_gemma":[0.0033583369,0.0005336188,0.038510893,0.0005107187,0.00004375265,0.000004391628,0.016978586,0.926217,0.001629722,0.009437719,0.0022437966,0.00053147547],"about_ca_topic_score_codex":0.0013931469,"about_ca_topic_score_gemma":0.00095351966,"teacher_disagreement_score":0.9236673,"about_ca_system_score_codex":0.000093648356,"about_ca_system_score_gemma":0.00039665657,"threshold_uncertainty_score":0.9999181},"labels":[],"label_agreement":null},{"id":"W7132882458","doi":"","title":"Evaluating Control-flow Integrity with Syscall Reachability Analysis","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Security and Verification in Computing","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 Toronto; Government of Ontario","keywords":"Reachability; Exploit; Set (abstract data type); Limiting; Harm; Order (exchange); Static analysis","score_opus":0.06459822235712755,"score_gpt":0.424865962012267,"score_spread":0.3602677396551395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132882458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31769136,0.0009256559,0.67253953,0.0012742872,0.0016013752,0.0013434606,0.000033865716,0.00038822542,0.004202218],"genre_scores_gemma":[0.9323282,0.000034059907,0.063617125,0.00027336268,0.00022953203,0.00024213186,0.00054019823,0.000052056006,0.0026832786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901231,0.0025128347,0.0013436732,0.0026922957,0.002411303,0.00091677165],"domain_scores_gemma":[0.9916187,0.0018927611,0.0018645684,0.002864497,0.0014102404,0.00034923782],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0067310883,0.0008749926,0.0015447858,0.00077637023,0.0018714021,0.00083999144,0.0026694525,0.00045907387,0.0026744674],"category_scores_gemma":[0.0011263045,0.0008853252,0.0007858509,0.0057057547,0.00020020705,0.00045689364,0.00037318023,0.0030050548,0.00005312094],"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.002334716,0.0023222363,0.019903103,0.0016283164,0.009774221,0.00008414552,0.30804497,0.43551064,0.0009275448,0.019933065,0.00035320863,0.19918382],"study_design_scores_gemma":[0.0010810933,0.0007068334,0.016843745,0.00013962068,0.0023799562,0.000012404371,0.012513223,0.96419495,0.00011060312,0.0003095905,0.000732419,0.00097557536],"about_ca_topic_score_codex":0.0037923178,"about_ca_topic_score_gemma":0.0009270397,"teacher_disagreement_score":0.6146369,"about_ca_system_score_codex":0.00079232774,"about_ca_system_score_gemma":0.0013731454,"threshold_uncertainty_score":0.99942803},"labels":[],"label_agreement":null},{"id":"W7133012572","doi":"","title":"Lessons Learned in Hardware-Assisted Operating System Security","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Security and Verification in Computing","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":"Software security assurance; Guard (computer science); Software; Hardware security module; Hardware compatibility list; Suite; Computer security model; Variety (cybernetics); Security through obscurity; Security testing","score_opus":0.10993653915269158,"score_gpt":0.40176932234845014,"score_spread":0.29183278319575856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133012572","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.862809,0.0024730577,0.06462268,0.0108186,0.025123613,0.003634174,0.000046686295,0.0042657517,0.026206447],"genre_scores_gemma":[0.9880022,0.00017436415,0.003632038,0.00008746535,0.00042395398,0.00015684594,0.00027784635,0.00011823773,0.007127062],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929319,0.001019263,0.0015440243,0.0022391707,0.0010978453,0.0011677823],"domain_scores_gemma":[0.9955763,0.00081120565,0.0010483857,0.0016747842,0.0005881947,0.00030109545],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002519683,0.00082955364,0.0011127546,0.0008057592,0.0011636888,0.0015008285,0.0024154002,0.00089291605,0.00005983246],"category_scores_gemma":[0.0007054526,0.0010208559,0.00033024984,0.0035810373,0.000085096406,0.00049513386,0.0005332621,0.0019007965,0.0009562031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012790516,0.0007038416,0.0011005277,0.0072230594,0.00030172613,0.0006627244,0.66440403,0.009115992,0.003839751,0.24039635,0.0020109434,0.07011313],"study_design_scores_gemma":[0.0011596326,0.000110038396,0.0098932525,0.005503064,0.00006245251,0.000047013426,0.12275209,0.8551294,0.0017382235,0.0005052553,0.0015605701,0.0015389875],"about_ca_topic_score_codex":0.0036215137,"about_ca_topic_score_gemma":0.0015188388,"teacher_disagreement_score":0.8460134,"about_ca_system_score_codex":0.00078429724,"about_ca_system_score_gemma":0.0010555428,"threshold_uncertainty_score":0.99982166},"labels":[],"label_agreement":null},{"id":"W7143442891","doi":"10.70675/61b168fdz7819z4ff2za37fzfa17c66f68a9","title":"Modélisation et analyse de la sécurité dans un système de stockage pair-à-pair","year":2013,"lang":"","type":"dissertation","venue":"","topic":"Security and Verification in Computing","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":"Nova scotia; Qualitative analysis; TypeScript","score_opus":0.018451948580965574,"score_gpt":0.2877851833086371,"score_spread":0.26933323472767157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7143442891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27932984,0.00046929994,0.71225065,0.0003324187,0.0007209869,0.00066286046,0.000011260818,0.00045620842,0.005766485],"genre_scores_gemma":[0.9470631,0.00009486888,0.048248746,0.0007726288,0.00029216998,0.00019547682,0.0003742637,0.00007417507,0.0028846024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927444,0.002315533,0.0014742805,0.0015909616,0.0008620989,0.0010127386],"domain_scores_gemma":[0.9948276,0.001291695,0.0011984607,0.001584705,0.0006048813,0.00049260637],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039613345,0.00081508607,0.0007553057,0.00057932234,0.000972128,0.001861981,0.00233352,0.0011216997,0.0004778799],"category_scores_gemma":[0.00047176602,0.000924891,0.0004926475,0.0014756693,0.00017116655,0.001301288,0.00025893445,0.0012539861,0.0002919351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004894348,0.0010616027,0.012724382,0.0009073771,0.00054444047,0.00005854258,0.13196473,0.043294743,0.0060679973,0.783959,0.002266872,0.01710137],"study_design_scores_gemma":[0.0005049046,0.000111838635,0.033032943,0.0003722736,0.0001328592,0.0000684798,0.003945009,0.9324375,0.0119915735,0.01595026,0.00046253004,0.0009898434],"about_ca_topic_score_codex":0.0033293387,"about_ca_topic_score_gemma":0.000115439136,"teacher_disagreement_score":0.88914275,"about_ca_system_score_codex":0.0006212745,"about_ca_system_score_gemma":0.0013633124,"threshold_uncertainty_score":0.99932015},"labels":[],"label_agreement":null},{"id":"W7149212896","doi":"","title":"Hudson-delaware","year":2002,"lang":"","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Security and Verification in Computing","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":"Waterfowl; Buteo; White (mutation); Front (military); Predation; Cape; Shot (pellet)","score_opus":0.03558903390556922,"score_gpt":0.18904260938467526,"score_spread":0.15345357547910604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7149212896","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.66443086,0.0008142483,0.283269,0.0015318035,0.0026446336,0.0009031895,0.0023794374,0.0005842439,0.04344258],"genre_scores_gemma":[0.9925674,0.00011287234,0.004038529,0.00004030676,0.0002171942,7.180349e-8,0.000069229434,0.000046189056,0.002908192],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460995,0.00023611166,0.0007325605,0.0016605037,0.0015554068,0.0012054482],"domain_scores_gemma":[0.9937824,0.00037050535,0.0015562787,0.0023374956,0.0011191978,0.00083410833],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004713143,0.0008524046,0.0014176226,0.0010253398,0.0021266988,0.00032487744,0.0054228567,0.0006763893,0.001176107],"category_scores_gemma":[0.000114641785,0.0013444481,0.00118231,0.0027527383,0.0022415037,0.0035509039,0.0029263096,0.001138177,0.00087216776],"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.0016516179,0.0026177354,0.11196737,0.0020579763,0.0029695672,0.0014269516,0.71650726,0.004967841,0.00012806195,0.074674904,0.018110916,0.062919796],"study_design_scores_gemma":[0.015718704,0.0025008942,0.038792074,0.002509395,0.001535965,0.000120458775,0.4144149,0.42937103,0.00029276154,0.0017258448,0.086274296,0.0067436625],"about_ca_topic_score_codex":0.00037308855,"about_ca_topic_score_gemma":0.00006282664,"teacher_disagreement_score":0.4244032,"about_ca_system_score_codex":0.00031346947,"about_ca_system_score_gemma":0.00030925896,"threshold_uncertainty_score":0.9999583},"labels":[],"label_agreement":null},{"id":"W7149216586","doi":"","title":"Hudson-delaware","year":2000,"lang":"","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Security and Verification in Computing","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":"Front (military); Cape; Cold front; Storm; Pelagic zone; Demise; Flood myth","score_opus":0.02227789601049852,"score_gpt":0.19116569248788157,"score_spread":0.16888779647738306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7149216586","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.8405569,0.0003557239,0.11011641,0.0008541682,0.0013400234,0.0007009337,0.0020905468,0.00044277695,0.04354251],"genre_scores_gemma":[0.99139607,0.000112725276,0.003810465,0.000043182972,0.0002135284,7.246542e-8,0.00011952568,0.000045914046,0.00425851],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99463785,0.00024572475,0.00073556195,0.0016809813,0.0014994806,0.0012004087],"domain_scores_gemma":[0.9944761,0.00032198676,0.001142429,0.0023171064,0.0009156127,0.00082678325],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052744406,0.00085091015,0.0014163314,0.0008199905,0.0021303073,0.00032154826,0.005434942,0.00067231536,0.0021417188],"category_scores_gemma":[0.000062788204,0.0013387854,0.0011745807,0.0026361006,0.0022581264,0.0035410128,0.0018309254,0.0010962941,0.0010052192],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049715247,0.0024328157,0.09727719,0.0019632122,0.003210497,0.001448277,0.6248169,0.01178868,0.00010904154,0.05454642,0.009587316,0.1878481],"study_design_scores_gemma":[0.022094723,0.0034191527,0.094143994,0.0036274125,0.0021070924,0.00016283966,0.44450197,0.22678806,0.00041011366,0.0033199308,0.19019134,0.009233365],"about_ca_topic_score_codex":0.00063236745,"about_ca_topic_score_gemma":0.00007984618,"teacher_disagreement_score":0.21499938,"about_ca_system_score_codex":0.0002914294,"about_ca_system_score_gemma":0.000693619,"threshold_uncertainty_score":0.9999461},"labels":[],"label_agreement":null},{"id":"W7149221684","doi":"","title":"Hudson-delaware","year":2007,"lang":"","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Security and Verification in Computing","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":"Breeding pair; Nest (protein structural motif); Ornithology; Sound (geography); Feather","score_opus":0.025766658113258362,"score_gpt":0.20434562550980687,"score_spread":0.1785789673965485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7149221684","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.5189012,0.00024226209,0.45736665,0.00041543946,0.0016952698,0.00050543906,0.00096453296,0.00030302734,0.019606145],"genre_scores_gemma":[0.9913657,0.000041737974,0.0067097642,0.00003850674,0.0002610103,3.5239328e-8,0.00009810984,0.000045816287,0.001439358],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99428254,0.00017108745,0.0008450518,0.0016286526,0.0016596621,0.0014130013],"domain_scores_gemma":[0.99321246,0.0005436562,0.0017171134,0.0022077824,0.0013613154,0.0009576896],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011776339,0.0008427025,0.0013829833,0.0012536838,0.0020689636,0.00026847926,0.0053015463,0.0007445229,0.00034329752],"category_scores_gemma":[0.00013136618,0.0013309747,0.0011545296,0.0030220093,0.002333987,0.003217097,0.003053698,0.0011948844,0.0003912701],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047107525,0.0020481094,0.20735018,0.001977783,0.0028161998,0.0020415592,0.5846693,0.0030411072,0.0002823859,0.11754068,0.005267025,0.06825494],"study_design_scores_gemma":[0.015558055,0.002493653,0.14986855,0.002488477,0.0014442344,0.00012252158,0.68553483,0.06650306,0.00093460345,0.0024156808,0.06599752,0.0066388175],"about_ca_topic_score_codex":0.00056130724,"about_ca_topic_score_gemma":0.00018187216,"teacher_disagreement_score":0.4724644,"about_ca_system_score_codex":0.00038986866,"about_ca_system_score_gemma":0.0006876035,"threshold_uncertainty_score":0.9992302},"labels":[],"label_agreement":null},{"id":"W79658127","doi":"10.1007/978-3-642-28920-0_8","title":"SCADA Protocol Vulnerabilities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":25,"is_retracted":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":"Modbus; IEC 61850; Computer science; SCADA; Industrial control system; Communications protocol; Process (computing); Protocol (science); Leverage (statistics); Computer network; Computer security; Embedded system; Control (management); Automation; Engineering; Operating system","score_opus":0.02959246066746436,"score_gpt":0.28162131223090847,"score_spread":0.2520288515634441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79658127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.000011884288,0.00016292257,0.9777729,0.0005804194,0.0016781455,0.011966241,0.000002330202,0.00031728827,0.007507895],"genre_scores_gemma":[0.061061107,0.000015691498,0.9239325,0.0031704537,0.0032536907,0.0074379058,0.0000064661986,0.000096919866,0.0010252664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957204,0.00006525838,0.000699611,0.0014963316,0.0011408606,0.00087754935],"domain_scores_gemma":[0.9964532,0.00066671317,0.0003836515,0.0019481919,0.0003087094,0.00023953097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016063538,0.0005611326,0.0005007076,0.0006949844,0.00047128007,0.0007617894,0.0042578597,0.0003722594,0.00009052584],"category_scores_gemma":[0.00013010952,0.00052421784,0.00015182998,0.00060734135,0.0008862287,0.0010519465,0.0016436409,0.0010649373,0.00013702568],"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.0000051256507,0.000053243828,0.00010067427,0.00012064896,0.000008804348,0.0000151826225,0.0017459627,0.005598634,0.00004495582,0.1699501,0.00006454589,0.82229215],"study_design_scores_gemma":[0.0005949247,0.0002285968,0.00024750808,0.00071388687,0.000008826175,0.0001671409,5.708724e-7,0.47797984,0.0037889446,0.4447698,0.069736406,0.001763539],"about_ca_topic_score_codex":0.000025841488,"about_ca_topic_score_gemma":0.000019078368,"teacher_disagreement_score":0.82052857,"about_ca_system_score_codex":0.0003941232,"about_ca_system_score_gemma":0.00066801,"threshold_uncertainty_score":0.99972093},"labels":[],"label_agreement":null},{"id":"W840673086","doi":"10.1007/s10703-015-0232-5","title":"Evaluation of anonymity and confidentiality protocols using theorem proving","year":2015,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Anonymity; Information leakage; Computer science; Computer security; Confidentiality; Encryption; Cryptography; Universal composability; Gas meter prover; Theoretical computer science; Cryptographic protocol; Mathematics","score_opus":0.39019389647315583,"score_gpt":0.4831668037191479,"score_spread":0.09297290724599205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W840673086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_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.013925485,0.000071327195,0.97902423,0.000004521162,0.00020479955,0.0060615274,4.4252903e-7,0.000054482585,0.0006531739],"genre_scores_gemma":[0.45419157,7.1038585e-8,0.54540175,0.0000034309762,0.000021280308,0.00037840445,1.0020189e-7,0.0000028070306,6.0820724e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99247813,0.0058734426,0.000556318,0.00027294652,0.0006252807,0.00019388864],"domain_scores_gemma":[0.9982587,0.00035065567,0.0003639928,0.0003840536,0.0005779286,0.00006465305],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.057518326,0.00009793654,0.00023262909,0.00012119773,0.00008020803,0.00011067854,0.00038452641,0.00007778753,0.0000011069554],"category_scores_gemma":[0.0007928067,0.000092016715,0.000027107277,0.00034785128,0.000048524304,0.0007481566,0.00016880779,0.000094487244,6.8942586e-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.00015436373,0.00020441932,0.004323073,0.0013807138,0.00006866829,0.0000033511344,0.028376693,0.028138371,0.01890471,0.39673647,0.000020948048,0.5216882],"study_design_scores_gemma":[0.0005868978,0.000060506678,0.00048448268,0.00022359412,0.000013847773,0.000028867309,0.0006876397,0.9631548,0.027471127,0.007175801,0.000012147597,0.00010027258],"about_ca_topic_score_codex":0.00010303994,"about_ca_topic_score_gemma":0.0000014035376,"teacher_disagreement_score":0.93501645,"about_ca_system_score_codex":0.00019909798,"about_ca_system_score_gemma":0.0003895486,"threshold_uncertainty_score":0.97048324},"labels":[],"label_agreement":null}]}