{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05549091,0.002228336,0.09736341,0.0061125006,0.001050781,0.00044506614,0.0026783443,0.005813735,0.8288169],"genre_scores_gemma":[0.48048973,0.0014402405,0.15467694,0.0008292672,0.00019929469,0.00039130927,0.0024680814,0.0007322824,0.3587729],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854124,0.00014714939,0.00005791145,0.00021643302,0.0008150955,0.0002221201],"domain_scores_gemma":[0.9986248,0.000074811076,0.000047898404,0.00018600357,0.00092535286,0.00014122149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010314422,0.000609643,0.0003137609,0.0009768533,0.0027678695,0.0026837755,0.0011630545,0.0008925693,0.042669933],"category_scores_gemma":[0.0022687605,0.0004264897,0.00039078936,0.0014277365,0.0011594334,0.0023703487,0.002183076,0.0014045428,0.010122597],"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.000932979,0.000108516935,0.0068340925,0.0002610072,0.00006283594,0.0001991798,0.0012035462,0.00684047,0.029061483,0.17217243,0.19081376,0.59150976],"study_design_scores_gemma":[0.00012616893,0.00019752551,0.008584378,0.00009754091,0.00006663006,0.0002559849,0.00064227526,0.021707978,0.03463708,0.023961391,0.9096125,0.000110643494],"about_ca_topic_score_codex":0.22234628,"about_ca_topic_score_gemma":0.26091897,"teacher_disagreement_score":0.22234628,"about_ca_system_score_codex":0.0074490216,"about_ca_system_score_gemma":0.011381001,"threshold_uncertainty_score":0.44210416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033161372,0.00061456644,0.99175656,0.00014443902,0.00005600971,0.00014678876,0.000029288094,0.0008602726,0.0030759475],"genre_scores_gemma":[0.06792037,0.000992035,0.92373586,0.00026814247,0.00007788923,0.00030747234,0.00018360588,0.000566854,0.005947742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975656,0.0004030661,0.00016937664,0.00037785165,0.0013355147,0.00014863072],"domain_scores_gemma":[0.9979856,0.0011321773,0.00014941326,0.0003190579,0.00034025914,0.00007349271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021168846,0.0014857245,0.00059743185,0.0018451771,0.0006218131,0.0017094112,0.0018301072,0.0020600087,0.0041934354],"category_scores_gemma":[0.0045928713,0.0007233435,0.0013457546,0.0010361874,0.0020618504,0.0027003838,0.0017053158,0.003459604,0.0007667172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000142926,0.00008672548,0.00062958826,0.000897509,0.00005934011,0.0006075815,0.0010044274,0.028456373,0.022444705,0.52741164,0.0053606667,0.41289845],"study_design_scores_gemma":[0.00017888204,0.0002599967,0.0007190052,0.0007616714,0.00016268254,0.0022652384,0.0002273369,0.1759572,0.048984222,0.53641087,0.23395796,0.000114905735],"about_ca_topic_score_codex":0.0010659219,"about_ca_topic_score_gemma":0.0012441284,"teacher_disagreement_score":0.0041934354,"about_ca_system_score_codex":0.0010038911,"about_ca_system_score_gemma":0.000956385,"threshold_uncertainty_score":0.01402843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42966032,0.0012615902,0.51902646,0.0015217203,0.00026947117,0.00032487183,0.0017435849,0.011455336,0.034736656],"genre_scores_gemma":[0.926348,0.00012200848,0.07100588,0.00007692256,0.0000189927,0.00013060309,0.0009336507,0.00034405757,0.001019892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9843121,0.0073717833,0.0009092877,0.001249151,0.0050865132,0.0010711096],"domain_scores_gemma":[0.94278896,0.026525978,0.0022216854,0.019982122,0.00766926,0.00081197126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009396859,0.0009441116,0.0011521237,0.002271828,0.0012611012,0.0030591674,0.0021227095,0.0014017946,0.007287145],"category_scores_gemma":[0.05951023,0.00065055606,0.0011144329,0.0020619987,0.0021857708,0.00566248,0.0034740765,0.0016888662,0.0009793306],"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.00088473,0.00029079177,0.019221505,0.000765077,0.0002847598,0.0002854884,0.00050577207,0.65384245,0.010236763,0.14554784,0.0067956885,0.1613392],"study_design_scores_gemma":[0.000044755914,0.0002646939,0.0015590936,0.00006212114,0.000043160464,0.000094814626,0.00009402707,0.93140686,0.008287731,0.05496858,0.0031420994,0.00003207609],"about_ca_topic_score_codex":0.0031774244,"about_ca_topic_score_gemma":0.004379479,"teacher_disagreement_score":0.009396859,"about_ca_system_score_codex":0.0018701401,"about_ca_system_score_gemma":0.0035363669,"threshold_uncertainty_score":0.04969597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030978605,0.00057617034,0.92946374,0.00037042695,0.00010460909,0.00018805606,0.00015871137,0.033526275,0.0046335487],"genre_scores_gemma":[0.194572,0.00046533355,0.79429924,0.0002840366,0.00004700101,0.00011293337,0.0008656469,0.005108331,0.004245453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925403,0.0019327725,0.0008305461,0.0009978279,0.0029356503,0.0007629752],"domain_scores_gemma":[0.97114146,0.011840997,0.0012400663,0.012041812,0.003352625,0.00038297806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046808473,0.0021296407,0.0010611877,0.0016982759,0.0006775609,0.0034996702,0.004183827,0.0022414897,0.007059205],"category_scores_gemma":[0.0285262,0.0014565055,0.0018006653,0.0014603601,0.0007994442,0.00797409,0.004554498,0.0048447866,0.0042047626],"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.000557711,0.00091686065,0.005233971,0.0010387198,0.00018403558,0.00088825444,0.0012375393,0.024722215,0.09130659,0.029653369,0.012451408,0.8318093],"study_design_scores_gemma":[0.00030078486,0.0007635821,0.002655606,0.000853828,0.0006096761,0.0020461741,0.0007239841,0.5302035,0.26989192,0.07701969,0.1146441,0.000287101],"about_ca_topic_score_codex":0.0011907121,"about_ca_topic_score_gemma":0.0019628513,"teacher_disagreement_score":0.007059205,"about_ca_system_score_codex":0.00049398857,"about_ca_system_score_gemma":0.0018860499,"threshold_uncertainty_score":0.024754941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072100274,0.0001833069,0.92348844,0.00013060846,0.00013923619,0.00013622316,0.00018590843,0.050046306,0.018479854],"genre_scores_gemma":[0.37154955,0.0006673041,0.52792865,0.0005071586,0.0002681839,0.0005571163,0.0017868768,0.0248404,0.071894795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996543,0.0006059554,0.00031956952,0.000568427,0.0015163478,0.00044673152],"domain_scores_gemma":[0.9933009,0.0018417743,0.00035416588,0.003755772,0.0005584118,0.00018889629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037567322,0.0011303885,0.0010885476,0.0011363345,0.0009952921,0.0039758296,0.002657684,0.0013773424,0.011188692],"category_scores_gemma":[0.007214572,0.0013142294,0.0011753539,0.0010294052,0.0019314289,0.0059222314,0.0031910464,0.0036028584,0.0067672413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008250498,0.0003268514,0.0019746074,0.0007414056,0.000084754996,0.00058408314,0.002242983,0.0070864633,0.05855854,0.44117507,0.030514807,0.45588535],"study_design_scores_gemma":[0.00024114262,0.00022757103,0.0018682807,0.00043169374,0.000271178,0.0010820618,0.00022233221,0.14245884,0.2750117,0.23653877,0.3413558,0.00029059543],"about_ca_topic_score_codex":0.0014552625,"about_ca_topic_score_gemma":0.0017592794,"teacher_disagreement_score":0.011188692,"about_ca_system_score_codex":0.0011856164,"about_ca_system_score_gemma":0.001430171,"threshold_uncertainty_score":0.03742987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067527555,0.000042207237,0.9904218,0.00015380114,0.000021527414,0.000035684192,0.00003682845,0.00031774837,0.0022176176],"genre_scores_gemma":[0.3789269,0.00020381415,0.6166591,0.00015609994,0.000058712976,0.00012351571,0.00016897803,0.00025495994,0.0034478223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970643,0.0009143709,0.00024539884,0.00042799336,0.0010146303,0.00033327608],"domain_scores_gemma":[0.9956116,0.0028123825,0.00026963282,0.00075595814,0.00040618714,0.00014426117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037660005,0.0007446606,0.00085383735,0.0014922766,0.00093542057,0.0040183845,0.0017786404,0.001048271,0.003003983],"category_scores_gemma":[0.00803359,0.00068994187,0.0029297823,0.0012805174,0.0030449964,0.0048890044,0.002932844,0.003709795,0.0005597635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000128837,0.000060126495,0.00043439752,0.000095923475,0.00005996261,0.00011036303,0.00026283396,0.077117145,0.0056417133,0.8640202,0.000922389,0.05114615],"study_design_scores_gemma":[0.000018340046,0.00001864827,0.00006361734,0.000033149663,0.00003088071,0.0000280369,0.000033989294,0.4219676,0.0036346796,0.5724506,0.0016994113,0.000021099038],"about_ca_topic_score_codex":0.0020782582,"about_ca_topic_score_gemma":0.0014771101,"teacher_disagreement_score":0.0040183845,"about_ca_system_score_codex":0.0023320275,"about_ca_system_score_gemma":0.0020255782,"threshold_uncertainty_score":0.019916773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18506415,0.00045358753,0.77543694,0.007774999,0.0003383769,0.00031295672,0.00020478065,0.0065806797,0.023833513],"genre_scores_gemma":[0.8559534,0.00018090174,0.13331483,0.00063169765,0.0000934184,0.000248724,0.00008815329,0.0016045298,0.007884238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99234337,0.0030125142,0.0003604182,0.0012970922,0.0015157359,0.0014708386],"domain_scores_gemma":[0.9716106,0.014001842,0.0019031239,0.010108195,0.0015010234,0.00087530666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007606118,0.000628405,0.00092687615,0.0006671539,0.0024462128,0.0034390795,0.002261043,0.0024962542,0.008136746],"category_scores_gemma":[0.04845902,0.0008998553,0.0015548184,0.00060074334,0.007910221,0.016383372,0.006756308,0.00363528,0.0013793001],"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.0015049896,0.00027038515,0.007556447,0.0002689309,0.00017111935,0.0005880388,0.0028521253,0.043259658,0.017331587,0.7489696,0.014574324,0.16265287],"study_design_scores_gemma":[0.00016227794,0.00019110368,0.0010950315,0.000122001824,0.0001458765,0.00040890195,0.0005613278,0.14563364,0.036013566,0.79067004,0.024834624,0.00016160721],"about_ca_topic_score_codex":0.0031766633,"about_ca_topic_score_gemma":0.0027369875,"teacher_disagreement_score":0.008136746,"about_ca_system_score_codex":0.0015331849,"about_ca_system_score_gemma":0.0029294468,"threshold_uncertainty_score":0.040225506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013259419,0.0048134862,0.9598413,0.0010731628,0.00036554853,0.00006372134,0.000093514886,0.0010390395,0.031384356],"genre_scores_gemma":[0.16384637,0.009983233,0.7297074,0.00085236,0.000915357,0.00051664707,0.0005784002,0.0010001409,0.09260003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821943,0.0005754685,0.00013725083,0.00022839312,0.00072059705,0.000118810945],"domain_scores_gemma":[0.9983204,0.001015666,0.000064297994,0.00038974968,0.00017354533,0.000036334226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019108824,0.0013458957,0.00077784684,0.0012041889,0.00090948876,0.0027867681,0.0018815134,0.0016276985,0.016119406],"category_scores_gemma":[0.0035615258,0.0010725412,0.0012863151,0.00091581745,0.003887099,0.0057313116,0.0015832757,0.0040069995,0.004718918],"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.000015367645,0.000026886411,0.000046748697,0.00020923659,0.000012061271,0.000039535054,0.0002754983,0.0031021908,0.0009542079,0.9159336,0.00690987,0.07247484],"study_design_scores_gemma":[0.000019892277,0.000012645011,0.000034507793,0.00014302497,0.000010584434,0.00008191378,0.000044600267,0.00940888,0.0011712421,0.9101997,0.07885947,0.000013457952],"about_ca_topic_score_codex":0.0010581979,"about_ca_topic_score_gemma":0.0011511637,"teacher_disagreement_score":0.016119406,"about_ca_system_score_codex":0.0019449781,"about_ca_system_score_gemma":0.0010396463,"threshold_uncertainty_score":0.05392474},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029630503,0.09668311,0.7080156,0.048016094,0.04076725,0.00066316634,0.0011325537,0.0027494046,0.09900977],"genre_scores_gemma":[0.04867495,0.1161277,0.5701179,0.010772824,0.02540683,0.0018102234,0.006757957,0.0035667808,0.21676488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98933744,0.004905007,0.0011383299,0.0013543925,0.0027973645,0.00046738755],"domain_scores_gemma":[0.9809368,0.011742022,0.00041198957,0.002317839,0.0036485777,0.00094276085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018502938,0.0024033699,0.002691055,0.0026930931,0.0019468692,0.00931876,0.0032183283,0.0039110603,0.039124947],"category_scores_gemma":[0.023357501,0.0016935322,0.0032532813,0.0021844795,0.004888557,0.008605405,0.003928109,0.0107256565,0.012708347],"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.00025333214,0.00027423442,0.00088441296,0.001085553,0.0001994255,0.00038656176,0.0018821954,0.004827773,0.0024079522,0.26401058,0.35993367,0.36385432],"study_design_scores_gemma":[0.000048721755,0.00005405416,0.00031680684,0.0008187018,0.000050278944,0.00039689743,0.00015419965,0.004822185,0.00057491654,0.095008105,0.8977026,0.00005257157],"about_ca_topic_score_codex":0.0054452834,"about_ca_topic_score_gemma":0.004714906,"teacher_disagreement_score":0.039124947,"about_ca_system_score_codex":0.004773528,"about_ca_system_score_gemma":0.0054471535,"threshold_uncertainty_score":0.13088596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008881416,0.00014279541,0.9789686,0.00015929509,0.000031883603,0.00007756599,0.000018598641,0.0011593878,0.010560414],"genre_scores_gemma":[0.301073,0.00029225525,0.68587387,0.00014651757,0.000036766272,0.00021944735,0.00007902606,0.00031176212,0.011967356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836296,0.0004361942,0.000094021416,0.00025798933,0.0006879193,0.0001609366],"domain_scores_gemma":[0.99770653,0.00062373275,0.00019630749,0.0012219135,0.0001808847,0.000070527414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328763,0.00070364814,0.0005395655,0.00054932735,0.0007781238,0.0013256946,0.0014074778,0.00100338,0.0033615846],"category_scores_gemma":[0.003579488,0.00063084165,0.0008276697,0.00037661384,0.0015987692,0.0022220502,0.0044527403,0.0021270472,0.0006898653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012212049,0.0002471754,0.0013341083,0.0002791583,0.00006755592,0.00033552485,0.0007837353,0.0787355,0.027840717,0.63017476,0.0035849863,0.25649464],"study_design_scores_gemma":[0.00007110101,0.00020758822,0.0007859633,0.00013656139,0.00011764471,0.0005814743,0.00022521372,0.4082046,0.049724314,0.47259355,0.06726695,0.000085022286],"about_ca_topic_score_codex":0.0006395723,"about_ca_topic_score_gemma":0.0018456338,"teacher_disagreement_score":0.0033615846,"about_ca_system_score_codex":0.00047616806,"about_ca_system_score_gemma":0.0011424011,"threshold_uncertainty_score":0.011245608},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010951747,0.00031711,0.9758185,0.0002538511,0.000108665605,0.0000960087,0.0000921324,0.0029723877,0.009389532],"genre_scores_gemma":[0.27792484,0.0004087428,0.6961015,0.00050870056,0.0001323099,0.0003711413,0.0003483924,0.0012184525,0.022985993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00023651744,0.00010968235,0.00028298877,0.0007510927,0.00023985654],"domain_scores_gemma":[0.99826354,0.00044399026,0.000059976253,0.0008710533,0.0002917079,0.00006973907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009103262,0.0008127917,0.0006323475,0.001151019,0.0013694507,0.0023546494,0.0032054451,0.0012845217,0.008349333],"category_scores_gemma":[0.002377264,0.0006356303,0.0011595195,0.0013418883,0.0017930553,0.0037704685,0.0036426852,0.0020864527,0.0017386301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044622255,0.00013638337,0.0007706326,0.00038260903,0.000104875355,0.000303986,0.00068853924,0.04439449,0.02615741,0.5962731,0.013204003,0.3171377],"study_design_scores_gemma":[0.00008717061,0.00017748046,0.00030859132,0.000089671696,0.0001443036,0.00035953833,0.00015676366,0.38417062,0.040660385,0.52809376,0.04566607,0.000085707434],"about_ca_topic_score_codex":0.002728734,"about_ca_topic_score_gemma":0.0037883862,"teacher_disagreement_score":0.008349333,"about_ca_system_score_codex":0.0010197816,"about_ca_system_score_gemma":0.001642324,"threshold_uncertainty_score":0.027931273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32724702,0.0009805134,0.65006036,0.00032768887,0.00015636963,0.00054132077,0.0005706453,0.009130403,0.0109856855],"genre_scores_gemma":[0.7449081,0.00025999456,0.24632849,0.00019184854,0.0000905241,0.00020431248,0.0016659087,0.000695689,0.0056552617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985158,0.00021415263,0.00014077566,0.0003122286,0.0005860212,0.00023104466],"domain_scores_gemma":[0.9915835,0.0019407495,0.00067414995,0.004176038,0.0014225269,0.00020310645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013459047,0.00043369248,0.00046208,0.001059687,0.0006601372,0.0010622779,0.0018397508,0.0004447181,0.0030734525],"category_scores_gemma":[0.006178193,0.0004038544,0.00057156,0.0011875271,0.0008765812,0.0024389534,0.002939102,0.000703261,0.0006394382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010389459,0.00051233673,0.01782345,0.00035325554,0.00012196274,0.0009305046,0.0020427126,0.02263543,0.06122008,0.020345917,0.009167651,0.86380774],"study_design_scores_gemma":[0.00046487432,0.0014377855,0.024546355,0.0003553971,0.0005240401,0.0037023851,0.0016497613,0.39145592,0.39800736,0.051032096,0.12660667,0.0002172618],"about_ca_topic_score_codex":0.0025074028,"about_ca_topic_score_gemma":0.0021017052,"teacher_disagreement_score":0.0030734525,"about_ca_system_score_codex":0.0006453601,"about_ca_system_score_gemma":0.00082203303,"threshold_uncertainty_score":0.010281742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.560579,0.0005406282,0.3342478,0.00032207998,0.00009737644,0.0002905593,0.00052115816,0.09335621,0.010045226],"genre_scores_gemma":[0.9301316,0.00011911253,0.06627819,0.00007998469,0.00001977352,0.000060491162,0.0004943944,0.000725884,0.0020905875],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846554,0.00031255127,0.0001251272,0.0003248513,0.0005935898,0.00017842432],"domain_scores_gemma":[0.9923046,0.0021243533,0.0010798186,0.0032234034,0.0010292442,0.00023855621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103751,0.0005607535,0.00040270822,0.0011834889,0.00041696744,0.0015796165,0.0016988824,0.0006827169,0.0031269852],"category_scores_gemma":[0.0074566547,0.0006274296,0.0002848162,0.00043624933,0.00085285876,0.0031802382,0.0019804658,0.0009993602,0.0008035984],"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.005201413,0.0004512924,0.06402536,0.00070212677,0.00027688773,0.0015803655,0.002151282,0.017060256,0.40678346,0.024016697,0.009705792,0.4680451],"study_design_scores_gemma":[0.00016502861,0.0006148557,0.01847357,0.00014146643,0.00012706802,0.0012761,0.00022331417,0.3495001,0.6008346,0.009717742,0.018815579,0.00011049689],"about_ca_topic_score_codex":0.0006738057,"about_ca_topic_score_gemma":0.0008502225,"teacher_disagreement_score":0.0031269852,"about_ca_system_score_codex":0.0005217002,"about_ca_system_score_gemma":0.00073016057,"threshold_uncertainty_score":0.010460794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03412612,0.0012027612,0.8993258,0.0013019703,0.00033992945,0.000055728935,0.00029096275,0.0005270589,0.06282974],"genre_scores_gemma":[0.8511967,0.0010867153,0.12776433,0.0004881584,0.0008728397,0.00019332752,0.00041257756,0.0005056718,0.017479733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856645,0.0004357064,0.00012931887,0.00020552108,0.0004918984,0.00017116666],"domain_scores_gemma":[0.9973048,0.0015870527,0.00017567021,0.00045770998,0.0003330727,0.00014154105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018899802,0.0006678645,0.0006850701,0.0018915001,0.0010186723,0.003015127,0.0012047258,0.0007941849,0.00605036],"category_scores_gemma":[0.0036710505,0.00054044387,0.0013054768,0.0010707158,0.0042376253,0.0064384807,0.0023991445,0.0034589563,0.0006902615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069939847,0.00000674213,0.00004123609,0.000016312511,0.0000033465142,0.000015966818,0.00007947555,0.0009720193,0.00027117316,0.9958378,0.00027197297,0.0024769844],"study_design_scores_gemma":[0.0000055914593,0.000008289941,0.00007583313,0.0000136278195,0.0000046580785,0.000029103807,0.00002295653,0.0064878617,0.00047675148,0.99037313,0.002494583,0.000007639311],"about_ca_topic_score_codex":0.0004893151,"about_ca_topic_score_gemma":0.0006435515,"teacher_disagreement_score":0.00605036,"about_ca_system_score_codex":0.0017329637,"about_ca_system_score_gemma":0.00067420275,"threshold_uncertainty_score":0.020240426},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25054756,0.002167569,0.24637343,0.01231692,0.005822128,0.0010741288,0.0053473744,0.045534868,0.430816],"genre_scores_gemma":[0.76902235,0.0010188991,0.05996164,0.007477099,0.0012122238,0.00046281563,0.0044436636,0.014461725,0.14193964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964071,0.00046367882,0.00027615717,0.00095650915,0.001199491,0.0006970242],"domain_scores_gemma":[0.9899301,0.0027001565,0.0009053392,0.003970468,0.0019245798,0.00056931714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019878668,0.00085288315,0.0006951043,0.00101809,0.0022105156,0.0026872032,0.001661174,0.002796848,0.033101074],"category_scores_gemma":[0.01446676,0.0005314575,0.0007699784,0.0008649547,0.0024734878,0.005903268,0.0040521496,0.0023056276,0.008782604],"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.0013453574,0.00038054638,0.037849184,0.0013551245,0.0002231119,0.006954187,0.006122891,0.004663766,0.027094984,0.3391382,0.28272864,0.292144],"study_design_scores_gemma":[0.00009455041,0.00033306575,0.009857248,0.00031402527,0.00022015371,0.0059945867,0.0018852119,0.007550581,0.021198118,0.14332658,0.8090976,0.00012820198],"about_ca_topic_score_codex":0.0027787837,"about_ca_topic_score_gemma":0.0023679987,"teacher_disagreement_score":0.033101074,"about_ca_system_score_codex":0.0012371711,"about_ca_system_score_gemma":0.0014797462,"threshold_uncertainty_score":0.110734165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03994554,0.000300367,0.9513488,0.0006070822,0.00013665676,0.00022419305,0.00023105396,0.0023458279,0.0048606033],"genre_scores_gemma":[0.77720606,0.0004282238,0.21687385,0.0002666589,0.00014595936,0.00027703794,0.00053066213,0.00033542505,0.0039361757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906989,0.003317509,0.00075684977,0.0011519997,0.0032049345,0.00086977525],"domain_scores_gemma":[0.9681407,0.023349633,0.0013399902,0.003989888,0.0028328283,0.0003469937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00703824,0.0009177681,0.0012770583,0.0014932182,0.0013078531,0.004319638,0.002518011,0.0021726089,0.003499753],"category_scores_gemma":[0.029964862,0.0011283724,0.0023056024,0.00081560994,0.003990278,0.007190836,0.0029369032,0.002981224,0.00071836484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013069232,0.00030891065,0.0037902053,0.00096781296,0.00022166975,0.00088445615,0.0012971003,0.17229247,0.018740807,0.6464341,0.00451345,0.1492421],"study_design_scores_gemma":[0.00015818457,0.00013635088,0.00059157616,0.00016774276,0.00009323184,0.00017046397,0.00009672913,0.5764581,0.032545265,0.3842187,0.0053083114,0.000055478886],"about_ca_topic_score_codex":0.0032463756,"about_ca_topic_score_gemma":0.0015537019,"teacher_disagreement_score":0.00703824,"about_ca_system_score_codex":0.0018729672,"about_ca_system_score_gemma":0.002842315,"threshold_uncertainty_score":0.037222207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004602123,0.00013202951,0.9875823,0.00017043836,0.00006275455,0.0000741369,0.000052158786,0.0037358447,0.0035883011],"genre_scores_gemma":[0.2843974,0.00047664414,0.7052707,0.00035139316,0.00021291275,0.00022282399,0.00039992706,0.0024994453,0.0061687627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055696,0.0018970468,0.0005884202,0.0012641576,0.004893577,0.00079975696],"domain_scores_gemma":[0.98479176,0.0068944436,0.00085069356,0.0056005693,0.001669838,0.00019267606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006087453,0.001768356,0.0017162494,0.0031617878,0.0013173467,0.0040693395,0.0035813642,0.0014951797,0.004139952],"category_scores_gemma":[0.014945443,0.0017249074,0.0025270912,0.0021077562,0.004285312,0.008099244,0.0054088417,0.004626801,0.0014571325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003402044,0.0003424596,0.0017863233,0.00050510216,0.00019806682,0.00026330134,0.00041125104,0.17386745,0.03240494,0.35517526,0.0075289253,0.42717677],"study_design_scores_gemma":[0.000042609317,0.0000663466,0.00021891676,0.000091751135,0.000118172444,0.000110673944,0.000039229442,0.6894721,0.03124793,0.26941943,0.009112135,0.000060770875],"about_ca_topic_score_codex":0.002608457,"about_ca_topic_score_gemma":0.0032482322,"teacher_disagreement_score":0.006087453,"about_ca_system_score_codex":0.0016903712,"about_ca_system_score_gemma":0.0043128426,"threshold_uncertainty_score":0.0321939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20347355,0.0012236557,0.6525859,0.014718347,0.0007359775,0.0013717492,0.0010257944,0.021529092,0.10333592],"genre_scores_gemma":[0.8759864,0.00082921446,0.10276083,0.004015276,0.00048154348,0.0010807711,0.00068335404,0.0014639283,0.012698645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97023296,0.011310629,0.0029517235,0.0036527857,0.008503675,0.0033481685],"domain_scores_gemma":[0.8697612,0.05503166,0.00940793,0.052329574,0.0106016155,0.0028678956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03197404,0.0008782838,0.0011515756,0.0023249693,0.002669444,0.0076146135,0.0035510308,0.003967249,0.005575218],"category_scores_gemma":[0.096633725,0.001168612,0.00085666764,0.0014719989,0.0062706512,0.012526822,0.007890621,0.005209494,0.0018991288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005017547,0.00024005948,0.0071462826,0.00028407492,0.00008347208,0.0003844675,0.0020944562,0.02171776,0.0076701357,0.8530461,0.012840327,0.09399108],"study_design_scores_gemma":[0.00021433207,0.00025655812,0.0028431548,0.00089582265,0.00012561,0.00033261796,0.0011770639,0.13452832,0.037788287,0.6403045,0.18136966,0.00016408245],"about_ca_topic_score_codex":0.0036887778,"about_ca_topic_score_gemma":0.0025336805,"teacher_disagreement_score":0.03197404,"about_ca_system_score_codex":0.003709462,"about_ca_system_score_gemma":0.01060444,"threshold_uncertainty_score":0.16909689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026354484,0.000056007917,0.96508884,0.00028612334,0.000074833464,0.00010553531,0.000038533894,0.0048129424,0.0031826098],"genre_scores_gemma":[0.60229325,0.00011693107,0.38993537,0.00022937285,0.00008563774,0.00017871108,0.00020221948,0.0008918752,0.0060666394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928241,0.0027274552,0.000445642,0.0013697606,0.0020982753,0.00053483824],"domain_scores_gemma":[0.9763697,0.0096658785,0.0016532404,0.009976112,0.001737748,0.0005974073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008875108,0.00050884404,0.00070295844,0.00090245827,0.0016191409,0.0032932644,0.0027634297,0.002114201,0.0037202395],"category_scores_gemma":[0.01846013,0.0006209269,0.0007070808,0.00058819994,0.0027840992,0.008150534,0.006319935,0.0023546796,0.0014420047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011767762,0.00051343534,0.008527276,0.00047054762,0.000090737674,0.0017388302,0.003287931,0.05828161,0.08568094,0.30090806,0.008867704,0.53045624],"study_design_scores_gemma":[0.00046626886,0.00047229335,0.0015441123,0.00016868992,0.000119375065,0.0014878026,0.0005388603,0.5113506,0.28123608,0.15611215,0.046354562,0.00014929456],"about_ca_topic_score_codex":0.0010798008,"about_ca_topic_score_gemma":0.0008437531,"teacher_disagreement_score":0.008875108,"about_ca_system_score_codex":0.0011579319,"about_ca_system_score_gemma":0.0029450045,"threshold_uncertainty_score":0.04693657},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025885983,0.07397754,0.048821867,0.0062964936,0.002024276,0.00004739551,0.00040877247,0.00015824591,0.8656769],"genre_scores_gemma":[0.18838799,0.073058344,0.036636803,0.0045190714,0.006710963,0.000428761,0.001585603,0.0004713242,0.6882011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939775,0.00017813587,0.000032744287,0.00012199672,0.00022917925,0.000040092713],"domain_scores_gemma":[0.9996344,0.00021658796,0.000013763025,0.0000614906,0.000054668868,0.000019089672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143844,0.0009691609,0.0009393705,0.0026012831,0.0019490978,0.0045606615,0.00090271235,0.0011238514,0.027965719],"category_scores_gemma":[0.0012051758,0.00048301727,0.0005828342,0.0045143655,0.0060930587,0.0064166826,0.0013377399,0.003597959,0.00795952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020608131,0.0000043014243,0.000016547394,0.00005193506,0.0000024842109,0.000009525997,0.00020888651,0.00013453662,0.00006119253,0.96965975,0.016519219,0.013329681],"study_design_scores_gemma":[0.000002772544,0.000004863438,0.00006962464,0.000077734,0.0000034175412,0.000047154666,0.00008805234,0.0002028953,0.00006383957,0.7985476,0.20088793,0.000004112595],"about_ca_topic_score_codex":0.0018070793,"about_ca_topic_score_gemma":0.002154727,"teacher_disagreement_score":0.027965719,"about_ca_system_score_codex":0.0031459974,"about_ca_system_score_gemma":0.0011327264,"threshold_uncertainty_score":0.093554676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030598605,0.0004014873,0.9435684,0.0005893889,0.00018046834,0.00016725936,0.00008506741,0.016337708,0.008071683],"genre_scores_gemma":[0.46560013,0.0005235383,0.522694,0.0005840892,0.00024968205,0.00050609105,0.0003756769,0.0030144847,0.0064523895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780136,0.0007397942,0.00033994464,0.0002663616,0.00057713146,0.0002754379],"domain_scores_gemma":[0.9923193,0.0020622315,0.0006994836,0.0038613244,0.0006746386,0.00038299017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005191843,0.00078290666,0.000613917,0.0012084444,0.0009993531,0.004304102,0.0027261802,0.0013875233,0.0033567476],"category_scores_gemma":[0.009267077,0.0012672318,0.00092395005,0.0006608772,0.002073948,0.008582163,0.0038901244,0.002724888,0.0013147045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015851627,0.00034466072,0.008631014,0.00087915314,0.00036270116,0.0015215058,0.0047193784,0.04165104,0.08224814,0.59653765,0.016009126,0.24551037],"study_design_scores_gemma":[0.00046623102,0.00051824696,0.0015415794,0.00035923655,0.0003824491,0.0011393819,0.00040118964,0.40086827,0.10410568,0.28140658,0.2086054,0.00020568499],"about_ca_topic_score_codex":0.0006481752,"about_ca_topic_score_gemma":0.0010175422,"teacher_disagreement_score":0.005191843,"about_ca_system_score_codex":0.0010918841,"about_ca_system_score_gemma":0.0013011767,"threshold_uncertainty_score":0.027457416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075672385,0.00010029227,0.98450524,0.0002174269,0.00012796625,0.00008798541,0.000036698104,0.0032172236,0.004139825],"genre_scores_gemma":[0.35775107,0.0002244593,0.63586986,0.0003379052,0.00016724042,0.00016557632,0.00024421915,0.0012911508,0.003948489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9860399,0.004515917,0.0011524768,0.0020180827,0.0052092746,0.0010643695],"domain_scores_gemma":[0.96760565,0.016644359,0.001564871,0.0107884295,0.0030414902,0.00035510774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009180087,0.0011948922,0.0010281604,0.0022731037,0.0012380907,0.002646494,0.002614584,0.0018386906,0.0061286483],"category_scores_gemma":[0.0380695,0.001045357,0.0018724333,0.00088674104,0.003827446,0.008185494,0.0040408745,0.0048783333,0.0012626065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044096523,0.00037508234,0.0011799874,0.00039563412,0.00011294346,0.00049373234,0.0009365534,0.04201306,0.019744385,0.57576185,0.0058640786,0.35268182],"study_design_scores_gemma":[0.00010803251,0.0001745169,0.00042396228,0.00012950134,0.00015001588,0.0003359333,0.00012846023,0.28682327,0.04319836,0.6517305,0.01671487,0.00008259498],"about_ca_topic_score_codex":0.0016230883,"about_ca_topic_score_gemma":0.0017247037,"teacher_disagreement_score":0.009180087,"about_ca_system_score_codex":0.0012763275,"about_ca_system_score_gemma":0.0020166412,"threshold_uncertainty_score":0.048549533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072696996,0.0005679623,0.9811859,0.00066497974,0.000088069006,0.000064579195,0.0002616076,0.0007848831,0.0091122985],"genre_scores_gemma":[0.3916881,0.0014677494,0.5911247,0.0006780622,0.00039812442,0.00037232463,0.0013160208,0.00096524396,0.01198976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927591,0.0031343244,0.0004132882,0.0010381882,0.0020655708,0.0005894792],"domain_scores_gemma":[0.98489714,0.011497248,0.0004257121,0.002045601,0.0009890303,0.00014532461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514355,0.0016627888,0.0014973155,0.0032889019,0.0013102532,0.004485243,0.0039904052,0.0017345292,0.010848464],"category_scores_gemma":[0.019485341,0.0017587595,0.0045935432,0.0033099947,0.004997414,0.011760047,0.0037128842,0.0058723213,0.001458332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009831733,0.000058624042,0.0005073408,0.00031761764,0.00007873169,0.000052508873,0.00021874318,0.05531577,0.002372375,0.87910676,0.0030224998,0.05885075],"study_design_scores_gemma":[0.000011570364,0.000019544226,0.00021864513,0.0000795987,0.00004708396,0.00003697774,0.00003228949,0.17843562,0.0035450966,0.81426686,0.0032821351,0.000024635914],"about_ca_topic_score_codex":0.0030642762,"about_ca_topic_score_gemma":0.003622644,"teacher_disagreement_score":0.010848464,"about_ca_system_score_codex":0.0035629796,"about_ca_system_score_gemma":0.0025087008,"threshold_uncertainty_score":0.03629172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027015459,0.0017383302,0.84160644,0.0010835824,0.00054882764,0.00015827292,0.0001492522,0.0012409538,0.12645882],"genre_scores_gemma":[0.7511081,0.00281095,0.18263125,0.0007501941,0.0009772851,0.0007441921,0.00055513653,0.0013542391,0.05906863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922167,0.002927272,0.0007279541,0.00084213505,0.0023649973,0.00092091376],"domain_scores_gemma":[0.98686475,0.0071777822,0.0005553973,0.00405565,0.0008991303,0.00044729558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041731643,0.0016415094,0.0018095339,0.002081966,0.0035860126,0.00765354,0.0025782883,0.0028642484,0.007058576],"category_scores_gemma":[0.013416094,0.0017856802,0.002341637,0.003575335,0.007677534,0.0130407335,0.006070909,0.008445851,0.0030242286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003345695,0.000022984583,0.00007814992,0.000052867337,0.000005902456,0.00006366093,0.00041109545,0.0010119396,0.0005420168,0.98775804,0.00092111446,0.009098758],"study_design_scores_gemma":[0.000009365643,0.0000104432365,0.000017121672,0.000022442488,0.00000914096,0.000063133535,0.00003380819,0.003030694,0.00075473223,0.9915577,0.0044806437,0.000010787584],"about_ca_topic_score_codex":0.00049415673,"about_ca_topic_score_gemma":0.0003730251,"teacher_disagreement_score":0.00765354,"about_ca_system_score_codex":0.002209117,"about_ca_system_score_gemma":0.0015202948,"threshold_uncertainty_score":0.023613334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037970329,0.00035479103,0.9599237,0.0011097587,0.00015572569,0.00023669342,0.0028536427,0.007626162,0.023942482],"genre_scores_gemma":[0.14204286,0.0019070166,0.79084146,0.0016047315,0.0002002597,0.0012010463,0.012287938,0.0039908946,0.045923766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980615,0.0004869762,0.00021150004,0.0002353195,0.00081815623,0.00018646399],"domain_scores_gemma":[0.9985669,0.0004107426,0.00013303886,0.0005304514,0.00027829007,0.00008056089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021803374,0.0012562686,0.0005373957,0.001317562,0.0007261176,0.0042433375,0.0022714,0.0014946011,0.010896288],"category_scores_gemma":[0.0040117525,0.001025187,0.0013577576,0.0013334639,0.0014988654,0.004925875,0.0027375473,0.0029677586,0.005387178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013971244,0.00005990424,0.00045000008,0.00043221825,0.000030578944,0.0002459006,0.0003864919,0.023174252,0.00588543,0.8671429,0.02838493,0.07366759],"study_design_scores_gemma":[0.00006889955,0.00007770053,0.00025845994,0.0003578754,0.000054817792,0.00047196238,0.00019477325,0.11361932,0.014716187,0.46117303,0.40893263,0.00007444448],"about_ca_topic_score_codex":0.0041387803,"about_ca_topic_score_gemma":0.004929118,"teacher_disagreement_score":0.010896288,"about_ca_system_score_codex":0.0014403269,"about_ca_system_score_gemma":0.0030035218,"threshold_uncertainty_score":0.036451757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4279283,0.011784579,0.46213886,0.008364191,0.0012711042,0.0006415152,0.0049209623,0.01862069,0.06432973],"genre_scores_gemma":[0.9415139,0.0016150068,0.05278803,0.00018333134,0.0002927415,0.0000434216,0.0010724993,0.00022367144,0.00226751],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985524,0.0003615277,0.00007872846,0.00028042265,0.00061361835,0.00011332519],"domain_scores_gemma":[0.99745685,0.0005751641,0.0005355852,0.00047689985,0.0007393685,0.00021616624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536947,0.00063148927,0.00045996005,0.0011831963,0.0006507253,0.002321206,0.0008827548,0.0008190411,0.0011148242],"category_scores_gemma":[0.005453905,0.00034264964,0.00018647879,0.0019288163,0.0007222246,0.0025319108,0.0010208479,0.0010116585,0.0005090148],"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.00062884024,0.0002443284,0.19835098,0.00088262616,0.00020825816,0.00069103227,0.0007065334,0.19013709,0.031658217,0.035762712,0.045875072,0.4948543],"study_design_scores_gemma":[0.00006839381,0.0002299825,0.09078834,0.00015004403,0.000099349316,0.0008195713,0.00044115033,0.74492854,0.043968543,0.037168775,0.081203856,0.00013354079],"about_ca_topic_score_codex":0.009061149,"about_ca_topic_score_gemma":0.006541945,"teacher_disagreement_score":0.009061149,"about_ca_system_score_codex":0.0012309438,"about_ca_system_score_gemma":0.0011349602,"threshold_uncertainty_score":0.018016815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659722,0.0009581535,0.02883131,0.00010474093,0.000048855745,0.00016144314,0.00035205382,0.00096380815,0.0026073835],"genre_scores_gemma":[0.98103434,0.00022426773,0.017382616,0.00002620949,0.000017963137,0.00007575113,0.00052252656,0.000063654974,0.00065258326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98923457,0.0020603708,0.0014578217,0.0011268331,0.00494145,0.0011790543],"domain_scores_gemma":[0.9466194,0.023126837,0.005686018,0.014161646,0.00910496,0.0013011404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071099307,0.00070580875,0.00081574096,0.0024482205,0.0009141894,0.0013495461,0.0015316155,0.0012902208,0.0010694962],"category_scores_gemma":[0.035500094,0.00035644032,0.00035899528,0.0033866083,0.0009012265,0.0036967604,0.0013185386,0.0007887991,0.00045888842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009659485,0.0021097069,0.08773342,0.00079041306,0.0006990454,0.0002909161,0.0009998096,0.21085785,0.21497124,0.010370889,0.004301206,0.45721596],"study_design_scores_gemma":[0.0003614732,0.009162639,0.06392289,0.00009273622,0.00037419418,0.0014589116,0.0006705353,0.48360485,0.42801255,0.005797352,0.006290563,0.00025139464],"about_ca_topic_score_codex":0.0013469389,"about_ca_topic_score_gemma":0.00065974885,"teacher_disagreement_score":0.0071099307,"about_ca_system_score_codex":0.0015948829,"about_ca_system_score_gemma":0.0007843449,"threshold_uncertainty_score":0.03760135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002972703,0.00016464047,0.9783378,0.00096144096,0.00021834379,0.00035397374,0.00016384634,0.0012987314,0.015528477],"genre_scores_gemma":[0.12135336,0.00059251586,0.8418199,0.00070972176,0.00011694489,0.0016874331,0.0007023083,0.00047530507,0.032542616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99653554,0.0011055205,0.00039540764,0.00035088183,0.0013821893,0.00023049717],"domain_scores_gemma":[0.99814904,0.00053315517,0.00017768286,0.0005753544,0.0004456322,0.00011919671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031594501,0.00076605694,0.0005161906,0.000924827,0.0019692837,0.0038139701,0.0012770424,0.0024858331,0.011095817],"category_scores_gemma":[0.0040395525,0.0007689331,0.0009605826,0.0010284504,0.00221073,0.0058821393,0.0029759237,0.003992669,0.004128534],"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.00007763981,0.000038722417,0.000097566015,0.00016778885,0.00001600145,0.0003291465,0.00041882138,0.008381323,0.0058576604,0.9558992,0.007939777,0.020776492],"study_design_scores_gemma":[0.00012681447,0.00022111194,0.00022737397,0.00028289753,0.00005253685,0.0011893904,0.000313452,0.1660974,0.02592597,0.37442267,0.43098262,0.00015773837],"about_ca_topic_score_codex":0.0016086395,"about_ca_topic_score_gemma":0.0023444882,"teacher_disagreement_score":0.011095817,"about_ca_system_score_codex":0.0015886645,"about_ca_system_score_gemma":0.002574146,"threshold_uncertainty_score":0.03711921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08590085,0.00066852866,0.87358177,0.00055196026,0.00017219115,0.00030024114,0.00016461243,0.031895753,0.006764103],"genre_scores_gemma":[0.7081659,0.00040915716,0.27841583,0.0008230346,0.00017709742,0.0003491704,0.00027729617,0.003681446,0.0077010817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949576,0.0010033326,0.00034156092,0.0010099903,0.0018690446,0.000818427],"domain_scores_gemma":[0.9863355,0.002850173,0.0015187708,0.0074213073,0.0014597576,0.00041444864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00436149,0.001216052,0.0011311775,0.001540721,0.0010306018,0.0019468146,0.003637217,0.001242173,0.003375613],"category_scores_gemma":[0.009071229,0.0011951727,0.0019722034,0.00063390186,0.0033273755,0.003993109,0.004606777,0.0027765315,0.0019520164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034114597,0.0006347281,0.010034829,0.0013404269,0.00036207473,0.0013675744,0.0025839065,0.086211614,0.27824563,0.27489984,0.013414968,0.32749298],"study_design_scores_gemma":[0.0005730309,0.0015551259,0.004914644,0.00039158922,0.00053030543,0.0015520746,0.0002529093,0.43732482,0.34039178,0.12886646,0.08326514,0.00038217058],"about_ca_topic_score_codex":0.0013095626,"about_ca_topic_score_gemma":0.0012047229,"teacher_disagreement_score":0.00436149,"about_ca_system_score_codex":0.0011091385,"about_ca_system_score_gemma":0.0020594266,"threshold_uncertainty_score":0.023066044},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350445,0.0009889094,0.05525733,0.00058670965,0.000042138716,0.00009172476,0.0017840173,0.0015415474,0.0046630525],"genre_scores_gemma":[0.94412655,0.00048304678,0.049040135,0.0003499595,0.000032690175,0.00015892957,0.0029826623,0.0012780932,0.001547944],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996539,0.0014232234,0.0002867478,0.0005584801,0.0010317295,0.00016075584],"domain_scores_gemma":[0.96016276,0.029416518,0.0041595604,0.0025762501,0.003209222,0.0004756659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033271683,0.00035110308,0.00030948635,0.0026338252,0.0009897382,0.0017284004,0.0005944953,0.0007461196,0.00056333566],"category_scores_gemma":[0.035918545,0.0002938675,0.00027731512,0.0025896402,0.0013669892,0.0038606008,0.001167633,0.0011953806,0.0004579738],"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.00069834676,0.00039730046,0.38283324,0.0015384809,0.00010644571,0.0014653857,0.07193183,0.0062307287,0.05043132,0.020741588,0.014440229,0.44918513],"study_design_scores_gemma":[0.000102389466,0.00036254892,0.6043319,0.0009784668,0.00022069349,0.006076977,0.023934025,0.11636681,0.06649438,0.03840856,0.14237088,0.00035240094],"about_ca_topic_score_codex":0.005254104,"about_ca_topic_score_gemma":0.006025706,"teacher_disagreement_score":0.005254104,"about_ca_system_score_codex":0.0007356296,"about_ca_system_score_gemma":0.00087810354,"threshold_uncertainty_score":0.017595947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20885332,0.00075375504,0.7433598,0.0014837524,0.00027808794,0.00034974676,0.00021796816,0.0090788985,0.03562466],"genre_scores_gemma":[0.9293732,0.0003565309,0.06478609,0.0004165534,0.00008280343,0.00010587811,0.00008769973,0.00015513891,0.004636091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806684,0.00041649851,0.00008140655,0.0003152164,0.0007616014,0.00035852718],"domain_scores_gemma":[0.9962016,0.00085672276,0.00048677082,0.002138779,0.00021580588,0.00010031399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264549,0.000895826,0.00085540616,0.0012760267,0.00095105293,0.0011979019,0.0012542934,0.0024715685,0.0018163248],"category_scores_gemma":[0.004468444,0.00038053497,0.0011499844,0.00095378107,0.0021656528,0.0017427624,0.0030129147,0.0018242925,0.00068807835],"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.00066398236,0.0002344568,0.0037474812,0.0004798979,0.00024932247,0.0029540157,0.0010746624,0.05346933,0.19780254,0.5553644,0.011593871,0.17236607],"study_design_scores_gemma":[0.00018651545,0.00075305277,0.002694151,0.00018875246,0.00024699504,0.0068116207,0.0001240202,0.4886864,0.2789628,0.17787339,0.04332148,0.00015088485],"about_ca_topic_score_codex":0.00018326171,"about_ca_topic_score_gemma":0.00012615239,"teacher_disagreement_score":0.0024715685,"about_ca_system_score_codex":0.0005612786,"about_ca_system_score_gemma":0.00039959254,"threshold_uncertainty_score":0.0060762167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26598936,0.002001231,0.7076419,0.0019095989,0.0002499027,0.0003123346,0.000097560165,0.004043622,0.01775441],"genre_scores_gemma":[0.85285974,0.00065329147,0.13818593,0.00032322912,0.00015221536,0.00008366876,0.00013639996,0.00034358,0.0072619556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935341,0.0010313325,0.00040171045,0.00091522915,0.0035572131,0.00056038203],"domain_scores_gemma":[0.95653445,0.009559886,0.004215978,0.024893286,0.004020364,0.0007760292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023740488,0.00085992547,0.0009940676,0.0013987202,0.001363567,0.0024102116,0.0028247382,0.0022194413,0.0024782242],"category_scores_gemma":[0.028644029,0.0005004048,0.000729325,0.00102679,0.002992257,0.008780249,0.005741646,0.0020766715,0.0010172926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005521121,0.0005955295,0.01864646,0.00087216264,0.00023157257,0.002062269,0.0028353983,0.071207754,0.07646893,0.1462495,0.007900078,0.6723782],"study_design_scores_gemma":[0.00018289086,0.0014636655,0.0067259306,0.00029091287,0.0004345978,0.009031722,0.0013220476,0.46277332,0.20584376,0.231073,0.08065002,0.00020807346],"about_ca_topic_score_codex":0.0008092526,"about_ca_topic_score_gemma":0.00049562496,"teacher_disagreement_score":0.0028247382,"about_ca_system_score_codex":0.00070721423,"about_ca_system_score_gemma":0.001046832,"threshold_uncertainty_score":0.012555361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082749784,0.00035579377,0.9079862,0.000115018855,0.000042216492,0.0002995541,0.00004688841,0.0055307094,0.0028737169],"genre_scores_gemma":[0.25069723,0.00033549816,0.74545705,0.000055851902,0.000015597188,0.00020931513,0.00012607119,0.0004399398,0.0026634096],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868494,0.0002772532,0.0001438571,0.0002259056,0.0005590351,0.0001090287],"domain_scores_gemma":[0.9968464,0.0008709996,0.0005912503,0.0010535448,0.0005167089,0.000121181976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012586495,0.00084908184,0.0004981993,0.0006382324,0.00032202946,0.001151575,0.0015662041,0.00089424837,0.0014816083],"category_scores_gemma":[0.00464509,0.0009783235,0.00069701404,0.00040841824,0.0006873581,0.0017188134,0.0014641443,0.0010414113,0.00061545573],"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.000537744,0.00056178594,0.014608763,0.0016075535,0.00034562638,0.001505337,0.0014046599,0.24101125,0.40184647,0.0544943,0.0029583776,0.27911818],"study_design_scores_gemma":[0.00018625693,0.00085341715,0.004435684,0.0001803681,0.0005696036,0.0010659295,0.00012788476,0.56029546,0.3712148,0.011525526,0.049459387,0.00008570152],"about_ca_topic_score_codex":0.0008188882,"about_ca_topic_score_gemma":0.000729519,"teacher_disagreement_score":0.0015662041,"about_ca_system_score_codex":0.0004516659,"about_ca_system_score_gemma":0.00091662374,"threshold_uncertainty_score":0.006656468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041138898,0.00058418163,0.98678964,0.00035869973,0.000095552015,0.000092867616,0.00012209418,0.00075178273,0.0070912642],"genre_scores_gemma":[0.42086297,0.0024989313,0.5594932,0.000631203,0.0005307755,0.00068167946,0.0006348491,0.0006149396,0.014051564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929182,0.0014315217,0.0004912135,0.0015845833,0.0029891708,0.0005852417],"domain_scores_gemma":[0.98829496,0.0050765947,0.0009834777,0.004096753,0.0012797884,0.00026833912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055761137,0.00096818485,0.0009976949,0.0020116668,0.0016544864,0.004988874,0.0026493073,0.0019533667,0.0059703095],"category_scores_gemma":[0.013015626,0.00068268244,0.0017580941,0.0019225046,0.00480881,0.009045099,0.0032608742,0.0032330377,0.0011225974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008430234,0.000034526216,0.0005209901,0.00013091901,0.000024636729,0.00007927209,0.0003818993,0.02822136,0.0026151822,0.9180829,0.0021996624,0.047624443],"study_design_scores_gemma":[0.00005365086,0.00009833388,0.0002798943,0.00014904056,0.00006606183,0.00022559374,0.00008696841,0.2280458,0.009573599,0.7082523,0.053103205,0.000065451604],"about_ca_topic_score_codex":0.004094705,"about_ca_topic_score_gemma":0.0018090474,"teacher_disagreement_score":0.0059703095,"about_ca_system_score_codex":0.0030669665,"about_ca_system_score_gemma":0.0024847349,"threshold_uncertainty_score":0.029489696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10312076,0.0030267981,0.7649979,0.023306035,0.0003211158,0.00078241836,0.00021616732,0.0004148246,0.10381406],"genre_scores_gemma":[0.9394332,0.0008096678,0.04977191,0.00091868214,0.00025063878,0.0004628061,0.000103556056,0.00005136076,0.00819818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.959633,0.026038202,0.0021799293,0.0035079706,0.0064630825,0.0021777414],"domain_scores_gemma":[0.93355054,0.053079136,0.004506853,0.004483224,0.0025274572,0.0018528146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025365805,0.00073271175,0.0012832865,0.0030351055,0.0076160585,0.014107644,0.0021770038,0.008154555,0.0066518486],"category_scores_gemma":[0.04633213,0.0012484458,0.001550909,0.0025001932,0.015462072,0.01851917,0.011069304,0.0045998204,0.0010189387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002063895,0.00004978849,0.001306883,0.000090179994,0.000039217088,0.0004888931,0.003035929,0.013424701,0.00031254443,0.97470933,0.0006150185,0.005906934],"study_design_scores_gemma":[0.000033989585,0.00003693703,0.00040852415,0.00006650879,0.000018981522,0.00020699028,0.0012992247,0.061154,0.00033459326,0.9213847,0.015017038,0.000038480513],"about_ca_topic_score_codex":0.0038920378,"about_ca_topic_score_gemma":0.001515287,"teacher_disagreement_score":0.025365805,"about_ca_system_score_codex":0.0072547444,"about_ca_system_score_gemma":0.0055541843,"threshold_uncertainty_score":0.13414878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39749107,0.00341881,0.57534325,0.00082071155,0.00024706128,0.00020456899,0.00013995652,0.015250813,0.007083655],"genre_scores_gemma":[0.9083628,0.0006241755,0.08666349,0.00018366148,0.000057741905,0.00006140325,0.00012381791,0.00017196612,0.0037510255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994198,0.00006482541,0.00005547763,0.000083881365,0.00026748786,0.000108512664],"domain_scores_gemma":[0.9980058,0.0003138611,0.0004893374,0.00079380476,0.0003447292,0.000052375926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049431337,0.0005181293,0.0004619131,0.0009231851,0.00046603175,0.0009497612,0.001233647,0.0006237547,0.0017814822],"category_scores_gemma":[0.0019332856,0.00030193792,0.0003584445,0.00045864112,0.0006204427,0.0017053296,0.00092371734,0.00068042305,0.0006323288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005994629,0.00013715817,0.007883042,0.0004951272,0.00013603242,0.0010104304,0.00057525636,0.024396906,0.5322689,0.029949274,0.0036269291,0.39892143],"study_design_scores_gemma":[0.000063904714,0.0007225136,0.003523017,0.00007587274,0.00025886967,0.0017413273,0.00016072663,0.16192819,0.78281885,0.012065947,0.03655045,0.00009023774],"about_ca_topic_score_codex":0.0006601171,"about_ca_topic_score_gemma":0.00087334606,"teacher_disagreement_score":0.0017814822,"about_ca_system_score_codex":0.00044560924,"about_ca_system_score_gemma":0.0010016208,"threshold_uncertainty_score":0.0059596896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23495902,0.0008480658,0.72589755,0.0030839164,0.00042476243,0.00028568934,0.0004786041,0.015001359,0.019020908],"genre_scores_gemma":[0.95250493,0.0001220527,0.044324383,0.00031431083,0.00008940141,0.00007829166,0.00014672214,0.00038932596,0.0020307323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898477,0.0028858946,0.0009799547,0.0014027247,0.0033143822,0.001569345],"domain_scores_gemma":[0.94716,0.024746008,0.005494354,0.016548514,0.005014335,0.0010367322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071226833,0.00083080155,0.0009007835,0.0012569292,0.0013800584,0.0030887388,0.0027122626,0.0015596828,0.0030925968],"category_scores_gemma":[0.042451438,0.0008361186,0.0006629779,0.0009782973,0.0018945608,0.0048163924,0.0034851644,0.0027010336,0.00046286205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004133313,0.00064975925,0.023711264,0.0010935334,0.00037089508,0.002691787,0.0024513523,0.17762707,0.060545,0.35050124,0.02434002,0.35188475],"study_design_scores_gemma":[0.00020570209,0.00015615043,0.0019806472,0.00019081369,0.00018512613,0.00044119943,0.00021493204,0.78367025,0.084464826,0.117445946,0.010976801,0.00006754924],"about_ca_topic_score_codex":0.0032936886,"about_ca_topic_score_gemma":0.0033029844,"teacher_disagreement_score":0.0071226833,"about_ca_system_score_codex":0.0011688743,"about_ca_system_score_gemma":0.003497391,"threshold_uncertainty_score":0.037668765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09341012,0.00093500485,0.866526,0.000701147,0.0001560157,0.00029374598,0.00029956587,0.028371437,0.009306933],"genre_scores_gemma":[0.7583931,0.0002528625,0.23373643,0.00035833652,0.00013834042,0.0001628327,0.00040754618,0.0010375666,0.005513063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98754716,0.0034576815,0.0009178411,0.0013779163,0.0057124756,0.0009868951],"domain_scores_gemma":[0.9737534,0.006862555,0.0029769368,0.013167777,0.0028887354,0.00035059007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063617467,0.0006084359,0.0010412867,0.0013164212,0.0009557683,0.0024733455,0.002986477,0.0010663469,0.002036772],"category_scores_gemma":[0.023807218,0.00089705596,0.0006226449,0.00085048826,0.001757064,0.0034107475,0.0029994494,0.002037346,0.00083383673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016690623,0.000672805,0.013861612,0.0007269649,0.00018997409,0.0009700129,0.002056055,0.07585396,0.121810295,0.2110679,0.020838642,0.5502827],"study_design_scores_gemma":[0.00017278602,0.00037271518,0.0025384983,0.000117845666,0.000111387024,0.0005415253,0.00014787278,0.7610439,0.14721866,0.06317641,0.0244369,0.00012149864],"about_ca_topic_score_codex":0.002309272,"about_ca_topic_score_gemma":0.0032842332,"teacher_disagreement_score":0.0063617467,"about_ca_system_score_codex":0.0013915951,"about_ca_system_score_gemma":0.003001051,"threshold_uncertainty_score":0.033644557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156323,0.00008499901,0.98618084,0.00018171985,0.0000197362,0.00006830559,0.0000625344,0.00025565948,0.0029899685],"genre_scores_gemma":[0.67240155,0.00052085915,0.32032928,0.0001682103,0.00013172365,0.0005317259,0.00034745343,0.00009831702,0.0054709506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970945,0.00081021193,0.00015816446,0.00037198677,0.0012151203,0.00034989737],"domain_scores_gemma":[0.9969259,0.0015391208,0.00029908097,0.00043878035,0.00070446066,0.000092577124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029487747,0.00055819977,0.00045178217,0.0018531316,0.00093165284,0.0017085423,0.0010822318,0.00077910285,0.0024852573],"category_scores_gemma":[0.0055438546,0.00030355455,0.0012303517,0.0011829985,0.0013941117,0.0053881262,0.00090201123,0.001400577,0.00025920692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091294634,0.00007524646,0.0006339951,0.0000956922,0.000027648122,0.00022788958,0.000419359,0.093184985,0.004069582,0.86513895,0.0014774197,0.034557845],"study_design_scores_gemma":[0.000025368976,0.00004799809,0.00018607687,0.00002748644,0.000035210254,0.00007233024,0.0000396111,0.7596275,0.0047416603,0.23039602,0.0047767423,0.000023946199],"about_ca_topic_score_codex":0.005359429,"about_ca_topic_score_gemma":0.0017561903,"teacher_disagreement_score":0.005359429,"about_ca_system_score_codex":0.0016496998,"about_ca_system_score_gemma":0.0020947512,"threshold_uncertainty_score":0.01559478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051502604,0.0006137225,0.9268185,0.0021664645,0.00025441402,0.00036017844,0.00008009302,0.0051790145,0.013025071],"genre_scores_gemma":[0.78154963,0.00037074083,0.20838995,0.00060270535,0.0001646569,0.00016225509,0.00012335538,0.00026648992,0.008370314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968868,0.0007356682,0.00016882757,0.00032703677,0.0012907599,0.0005909273],"domain_scores_gemma":[0.9939107,0.00058329967,0.00043948463,0.0031080833,0.0016220207,0.00033647873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017251413,0.00064899516,0.00084630365,0.0009298305,0.0017465283,0.002297244,0.0026624114,0.0020412197,0.0031402467],"category_scores_gemma":[0.00460983,0.00045481665,0.0007822287,0.000850866,0.0016187347,0.003560986,0.0034568056,0.0025469856,0.0015437617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001192609,0.0011098282,0.0070541142,0.0004944528,0.0003274034,0.0022610815,0.0012855253,0.08961185,0.16720104,0.31882107,0.034464292,0.37617677],"study_design_scores_gemma":[0.00017492883,0.00055652607,0.0010297988,0.00011384714,0.0001907021,0.0020335699,0.00037079243,0.7896153,0.10768601,0.05738667,0.04071804,0.0001237888],"about_ca_topic_score_codex":0.0019551867,"about_ca_topic_score_gemma":0.0025268665,"teacher_disagreement_score":0.0031402467,"about_ca_system_score_codex":0.0009771959,"about_ca_system_score_gemma":0.004047299,"threshold_uncertainty_score":0.01050514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17349705,0.00014792905,0.814922,0.001208553,0.00009869718,0.00017572002,0.00040915768,0.00614704,0.0033938386],"genre_scores_gemma":[0.7351003,0.00010046948,0.2617373,0.00035738104,0.00008608153,0.000087601205,0.00066524936,0.000591139,0.0012745445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945868,0.0015313731,0.00043656706,0.0009574086,0.0016764646,0.00081137795],"domain_scores_gemma":[0.98370636,0.012103475,0.000913663,0.0019561849,0.00090334885,0.00041707614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005792462,0.0009726088,0.0010370436,0.001454114,0.0014806653,0.0038884787,0.0040102666,0.0033843813,0.0026907902],"category_scores_gemma":[0.022549586,0.0016020195,0.0028671874,0.00083104934,0.0036789093,0.0102055855,0.0046981135,0.0036453998,0.00035618487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016876576,0.0010715349,0.025959522,0.0017526618,0.00073202763,0.007116703,0.003800055,0.3363646,0.06658834,0.4484821,0.00868909,0.09775579],"study_design_scores_gemma":[0.00029428044,0.00018586921,0.0010147055,0.00011375575,0.00030858253,0.0005645447,0.00054639403,0.59492767,0.035708245,0.36138967,0.0048703263,0.00007594559],"about_ca_topic_score_codex":0.0023047698,"about_ca_topic_score_gemma":0.0033687782,"teacher_disagreement_score":0.005792462,"about_ca_system_score_codex":0.0009315845,"about_ca_system_score_gemma":0.0014420082,"threshold_uncertainty_score":0.030633867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36732185,0.004931897,0.5690944,0.001057934,0.0003214998,0.00019535204,0.0002998666,0.006782931,0.0499943],"genre_scores_gemma":[0.91605914,0.0008242432,0.06348455,0.00024964788,0.000053818698,0.000097850076,0.0002165122,0.00012334707,0.01889098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00007613782,0.000026021258,0.00007844898,0.00014171461,0.00009532679],"domain_scores_gemma":[0.9988067,0.00027537224,0.00018087446,0.0004654788,0.00023290659,0.00003866278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540066,0.00037677612,0.0004205616,0.00078628835,0.00055984297,0.0011064707,0.0018953274,0.00063865347,0.005654249],"category_scores_gemma":[0.0016726005,0.00023491912,0.00041582723,0.00052247924,0.0006554705,0.0020229917,0.00087994366,0.000792521,0.001167366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013682772,0.00031079998,0.0032533407,0.00063723564,0.00020266356,0.0004785356,0.00056697044,0.1584128,0.12856859,0.43107003,0.01896084,0.25617],"study_design_scores_gemma":[0.00016604723,0.00087143865,0.0009403056,0.00010399754,0.00016277132,0.00082520756,0.00010405529,0.71501094,0.09700299,0.15239173,0.03233732,0.000083173596],"about_ca_topic_score_codex":0.0008242999,"about_ca_topic_score_gemma":0.0012351332,"teacher_disagreement_score":0.005654249,"about_ca_system_score_codex":0.0009069627,"about_ca_system_score_gemma":0.0006298819,"threshold_uncertainty_score":0.018915355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8196279,0.0018125067,0.11949316,0.0010123692,0.00022501564,0.0006464892,0.011427047,0.032113228,0.013642315],"genre_scores_gemma":[0.83776486,0.00055359426,0.13290249,0.00023250212,0.000045732417,0.00063779077,0.02283628,0.0024145117,0.0026122725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99424934,0.002415256,0.00053833757,0.00061741663,0.0016158347,0.00056381524],"domain_scores_gemma":[0.9832696,0.010233881,0.0007259289,0.0028349273,0.0025171395,0.0004185422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004925265,0.0016385769,0.00071379496,0.0025805016,0.000879965,0.0011343029,0.0026834628,0.0010642512,0.0026965393],"category_scores_gemma":[0.018294925,0.00065946754,0.0010727446,0.003808682,0.00089501427,0.0020709962,0.0013720283,0.0015249511,0.00042350043],"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.002770544,0.0029419167,0.030417357,0.002345137,0.0006712827,0.0013490815,0.001159083,0.62870556,0.03726474,0.05231623,0.07952482,0.16053426],"study_design_scores_gemma":[0.0007838737,0.0008234967,0.0063930405,0.00012761581,0.00015296921,0.00028560866,0.00022412786,0.904572,0.043566227,0.023173701,0.019817501,0.00007980762],"about_ca_topic_score_codex":0.0092782285,"about_ca_topic_score_gemma":0.011760684,"teacher_disagreement_score":0.0092782285,"about_ca_system_score_codex":0.0015756178,"about_ca_system_score_gemma":0.0019829406,"threshold_uncertainty_score":0.026047587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012409986,0.00022204907,0.9708039,0.00034892437,0.00012950266,0.00014339232,0.00007565055,0.011674625,0.0041918424],"genre_scores_gemma":[0.3571887,0.00039150467,0.62733567,0.0007298742,0.00025256764,0.00038902793,0.00043526225,0.0019001096,0.0113772955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964037,0.00038065648,0.00028047085,0.0010167193,0.0015650302,0.0003534451],"domain_scores_gemma":[0.99406934,0.0015961663,0.0008144851,0.0018153985,0.0014693022,0.00023539636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015253418,0.0011147344,0.001103763,0.003397794,0.0013744092,0.001973265,0.002120089,0.001651662,0.002488192],"category_scores_gemma":[0.0078819515,0.00072333904,0.0010083397,0.0011636119,0.0020225574,0.0041676057,0.0035934264,0.0020609284,0.001206211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033653656,0.00021184435,0.0046446784,0.00042158135,0.000090645284,0.00068073755,0.0009310155,0.009100806,0.08577099,0.10405352,0.014936703,0.7788209],"study_design_scores_gemma":[0.00015462922,0.0005440686,0.0029507522,0.0002387496,0.00026475557,0.0044940016,0.00051903847,0.5668666,0.24190317,0.08369162,0.0980553,0.00031739174],"about_ca_topic_score_codex":0.0008206907,"about_ca_topic_score_gemma":0.0006933543,"teacher_disagreement_score":0.003397794,"about_ca_system_score_codex":0.0007939284,"about_ca_system_score_gemma":0.0017292777,"threshold_uncertainty_score":0.008323848},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18365838,0.037004795,0.28897077,0.058671393,0.0017129657,0.00077735237,0.00027827494,0.0016826107,0.4272435],"genre_scores_gemma":[0.947027,0.005259158,0.032325014,0.0016195695,0.00043446876,0.0002838983,0.00010316285,0.00030944415,0.012638452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9756551,0.012704029,0.0013652414,0.0013537665,0.007326008,0.0015960092],"domain_scores_gemma":[0.9523596,0.030040285,0.0031980188,0.0063079507,0.006265664,0.0018285423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018197129,0.0009401937,0.00090279063,0.001914417,0.0031958595,0.012325676,0.001151024,0.0029133623,0.00576593],"category_scores_gemma":[0.04715459,0.0005643091,0.00071280624,0.0012228837,0.015116475,0.012811007,0.005553958,0.0027202491,0.001572611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019147266,0.00013016944,0.0069159344,0.0015527289,0.0001354692,0.00048441408,0.01284575,0.006198593,0.004576704,0.8306395,0.011108729,0.12522055],"study_design_scores_gemma":[0.00006230999,0.0006324553,0.006881142,0.0012233742,0.00008623522,0.0017883473,0.007369318,0.012374651,0.005121144,0.842994,0.121283434,0.00018351444],"about_ca_topic_score_codex":0.004377685,"about_ca_topic_score_gemma":0.0014854699,"teacher_disagreement_score":0.018197129,"about_ca_system_score_codex":0.0029731507,"about_ca_system_score_gemma":0.0036279026,"threshold_uncertainty_score":0.096236765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029003026,0.00003760043,0.9918534,0.00008570229,0.000040596173,0.00004759622,0.00021735711,0.002632547,0.0021849093],"genre_scores_gemma":[0.2830546,0.0003017666,0.7062785,0.00030254087,0.00008183274,0.00048102377,0.0018649466,0.0014922133,0.006142656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985092,0.0003696163,0.00010490624,0.00029622705,0.00055914203,0.00016091292],"domain_scores_gemma":[0.9982476,0.00061472185,0.00014041396,0.00063404953,0.00032107744,0.000042128006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009702117,0.0010317885,0.0006308571,0.0016056738,0.00048049598,0.0023294485,0.0018301489,0.0012682255,0.005959707],"category_scores_gemma":[0.0030526652,0.00042058848,0.0013414876,0.0010331017,0.0014928678,0.0028738491,0.0009683768,0.0023630937,0.0012315958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019938278,0.000118365846,0.000560493,0.0002222295,0.000060321865,0.0003525242,0.00024815716,0.18234728,0.011762895,0.71996987,0.0048789773,0.07927952],"study_design_scores_gemma":[0.00005278798,0.000052941545,0.00015655038,0.000064122476,0.00008347578,0.00013048564,0.00003186777,0.6081368,0.016149227,0.35758746,0.017513117,0.000041112573],"about_ca_topic_score_codex":0.003965812,"about_ca_topic_score_gemma":0.0034005565,"teacher_disagreement_score":0.005959707,"about_ca_system_score_codex":0.0011996902,"about_ca_system_score_gemma":0.0014709613,"threshold_uncertainty_score":0.019937277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13462763,0.0005380262,0.74842054,0.006995865,0.00050985516,0.0006289513,0.00085595105,0.0028959347,0.104527235],"genre_scores_gemma":[0.8652912,0.00032545062,0.11356946,0.0016787611,0.00013998659,0.00043526763,0.00051341584,0.0002883173,0.017758159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836631,0.004040765,0.0020313594,0.0029498648,0.005150254,0.002164655],"domain_scores_gemma":[0.97242504,0.009325112,0.0022392622,0.010781269,0.0044271857,0.00080213003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012088643,0.00078776997,0.0010873196,0.001528534,0.003128463,0.004892795,0.0034465773,0.0018322566,0.0041577695],"category_scores_gemma":[0.0282418,0.0009912895,0.0014981669,0.0012056441,0.007314693,0.006732134,0.004894452,0.0042476393,0.0009702048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017004217,0.00007291778,0.0020206214,0.0001592803,0.00006456105,0.0003519625,0.0014465279,0.0102391485,0.0066121737,0.9516189,0.0045807785,0.02266304],"study_design_scores_gemma":[0.0002313482,0.00016310228,0.0020012155,0.00029723195,0.0002474349,0.0005317546,0.0006334357,0.14225061,0.047330655,0.74337876,0.06266472,0.00026965878],"about_ca_topic_score_codex":0.01773801,"about_ca_topic_score_gemma":0.011907317,"teacher_disagreement_score":0.01773801,"about_ca_system_score_codex":0.0037073283,"about_ca_system_score_gemma":0.011529933,"threshold_uncertainty_score":0.063931584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039039444,0.0006212247,0.9243149,0.0010499796,0.0004144868,0.00021070967,0.00010011797,0.01517065,0.019078445],"genre_scores_gemma":[0.71559566,0.00041627957,0.2560666,0.0010121064,0.00022016682,0.00027335476,0.00034492378,0.001574097,0.024496803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796677,0.000306312,0.00018302136,0.00044327535,0.0006739889,0.00042678512],"domain_scores_gemma":[0.9954405,0.00075118314,0.00031461095,0.0026827017,0.00055857596,0.0002524366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019517508,0.0010721664,0.00086516293,0.001152049,0.0012051677,0.0017506101,0.0025494157,0.0010581627,0.007016458],"category_scores_gemma":[0.0070145186,0.00054314756,0.0006829095,0.00066264655,0.0021904057,0.0040538083,0.007896081,0.002082828,0.0038275004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019916052,0.000746033,0.004886432,0.00053913903,0.00015655061,0.0011291968,0.0019192712,0.06425131,0.11457536,0.11703864,0.020750202,0.67201626],"study_design_scores_gemma":[0.00024462098,0.00084425963,0.0015019103,0.00016161769,0.00015275223,0.0015072034,0.0007109531,0.5252196,0.163914,0.24183318,0.06375742,0.00015245155],"about_ca_topic_score_codex":0.0007700554,"about_ca_topic_score_gemma":0.001007894,"teacher_disagreement_score":0.007016458,"about_ca_system_score_codex":0.00053465104,"about_ca_system_score_gemma":0.0015312415,"threshold_uncertainty_score":0.023472369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07187255,0.0007546735,0.9081844,0.00154733,0.000098190074,0.00006486379,0.000025158013,0.0011163962,0.01633644],"genre_scores_gemma":[0.8643766,0.00083032344,0.13203764,0.00037658398,0.000101514655,0.000094400515,0.00003598257,0.00023556274,0.0019114566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99245,0.0042057005,0.0004274427,0.00049444166,0.0018823001,0.0005400814],"domain_scores_gemma":[0.98029274,0.010493526,0.00147636,0.0060227616,0.0011210212,0.00059358345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065557254,0.00057131756,0.0004406449,0.0009826532,0.00087733613,0.0042147213,0.0013207803,0.0013362571,0.0016582885],"category_scores_gemma":[0.012024751,0.0006807743,0.0011383806,0.00060930697,0.0057194307,0.01301124,0.0057912427,0.0034648883,0.00031809567],"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.00008792725,0.000070315706,0.0018673888,0.00009719896,0.000052129955,0.00064521225,0.0023795152,0.0098126745,0.009320077,0.9289007,0.0009780793,0.045788713],"study_design_scores_gemma":[0.00010485774,0.00038917232,0.00087037426,0.00036913357,0.00022431219,0.001755614,0.0013129925,0.13525239,0.044154078,0.736433,0.07899561,0.00013844259],"about_ca_topic_score_codex":0.0014824958,"about_ca_topic_score_gemma":0.0008672407,"teacher_disagreement_score":0.0065557254,"about_ca_system_score_codex":0.00090051227,"about_ca_system_score_gemma":0.0013855961,"threshold_uncertainty_score":0.034670353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004706381,0.0003862242,0.96255463,0.00038655818,0.00010793657,0.00012851824,0.0001320775,0.026755463,0.004842246],"genre_scores_gemma":[0.1992677,0.0010767253,0.786523,0.00048618624,0.0002120119,0.00037989698,0.0009314469,0.004599865,0.0065232934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980987,0.0004115031,0.00017447982,0.00027055579,0.00086919277,0.00017570847],"domain_scores_gemma":[0.9951822,0.00091611466,0.0003682279,0.0026808612,0.0007142193,0.00013832028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021238239,0.0006584696,0.0006287843,0.0014492108,0.000906891,0.0018038866,0.0015311488,0.0012005337,0.004160092],"category_scores_gemma":[0.0055777933,0.0008385825,0.00095136696,0.001070102,0.0017223688,0.0038956145,0.0028468,0.0034067235,0.0030252724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033596257,0.00036811474,0.0025020905,0.00056901935,0.00014027687,0.0005443198,0.0011631275,0.037654195,0.09775926,0.47472015,0.029018026,0.35522553],"study_design_scores_gemma":[0.00014937486,0.00045848236,0.001542649,0.0002820808,0.00020146872,0.001468553,0.000113438306,0.30310318,0.19891118,0.17582324,0.31777766,0.00016867812],"about_ca_topic_score_codex":0.00072854944,"about_ca_topic_score_gemma":0.00061834906,"teacher_disagreement_score":0.004160092,"about_ca_system_score_codex":0.0009323157,"about_ca_system_score_gemma":0.0030855308,"threshold_uncertainty_score":0.013916969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867553,0.0013535816,0.3824988,0.00038194197,0.00019435024,0.00020220189,0.00012854517,0.0036269904,0.024858356],"genre_scores_gemma":[0.95317715,0.00020543119,0.040010627,0.00009308516,0.00002394917,0.000050240586,0.00010708336,0.00010460577,0.006227863],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997693,0.0000329982,0.000011969703,0.00005011798,0.00006895055,0.00006664078],"domain_scores_gemma":[0.99973863,0.000025216046,0.000026582142,0.00007636075,0.0001172649,0.000015942831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023652517,0.00041746694,0.0002400038,0.000412257,0.0005142792,0.00081261084,0.0008317108,0.0003849113,0.0030133934],"category_scores_gemma":[0.00030331503,0.00025450776,0.00044084512,0.00021877521,0.00029682688,0.0010032763,0.0004411814,0.00063650234,0.0008479822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001411422,0.00035239663,0.0058822217,0.00051890675,0.00020941926,0.0007041997,0.0004723636,0.11660545,0.55568016,0.06558135,0.006906969,0.24567522],"study_design_scores_gemma":[0.00008331779,0.0015174468,0.005852118,0.00007354641,0.00035789705,0.00080079184,0.00016847966,0.5536829,0.40636206,0.013257638,0.017782837,0.000061000093],"about_ca_topic_score_codex":0.0010989399,"about_ca_topic_score_gemma":0.0027191164,"teacher_disagreement_score":0.0030133934,"about_ca_system_score_codex":0.00051153527,"about_ca_system_score_gemma":0.0008871965,"threshold_uncertainty_score":0.010080814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5100543,0.025665812,0.41323256,0.0036789612,0.00047365014,0.0017462011,0.0027180535,0.013232324,0.029198194],"genre_scores_gemma":[0.7836929,0.006348838,0.20131122,0.00057500653,0.00023466327,0.0008220689,0.0029032745,0.0003347744,0.003777262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941579,0.0006448064,0.00097032863,0.0008004086,0.0028787286,0.00054787245],"domain_scores_gemma":[0.97826695,0.005972362,0.0070333215,0.002081113,0.005684188,0.0009619707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033750723,0.001086455,0.0008047739,0.0077642747,0.0007321276,0.0024780747,0.0018496669,0.0012980032,0.0006189284],"category_scores_gemma":[0.016591193,0.00038854772,0.00068455125,0.004270322,0.0006948834,0.0032189572,0.001575095,0.0009362958,0.00030101012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095035817,0.00052722153,0.31290805,0.0019031343,0.00023242977,0.0010729654,0.0027271165,0.010915479,0.025657097,0.021686079,0.008927257,0.6124928],"study_design_scores_gemma":[0.00026693282,0.002145695,0.36220166,0.0029693816,0.0013792692,0.009106803,0.0034247588,0.29203317,0.12453816,0.036919016,0.16452472,0.0004904634],"about_ca_topic_score_codex":0.0018832262,"about_ca_topic_score_gemma":0.001425266,"teacher_disagreement_score":0.0077642747,"about_ca_system_score_codex":0.0013163051,"about_ca_system_score_gemma":0.0014299571,"threshold_uncertainty_score":0.017849267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37522534,0.0074416795,0.55877763,0.0010772131,0.00034834634,0.000960224,0.0018497218,0.034772884,0.019546954],"genre_scores_gemma":[0.89325523,0.0019239269,0.099108316,0.0002510814,0.00011159908,0.0002053559,0.0012604396,0.00053581863,0.0033483445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954491,0.0007218632,0.00036153378,0.0008183043,0.0022994438,0.00034976803],"domain_scores_gemma":[0.9810089,0.0060918606,0.005394658,0.0029962778,0.0039338535,0.00057443936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018580421,0.001424085,0.0010805421,0.003984285,0.0007116826,0.001914377,0.0016850156,0.0010065933,0.0012440527],"category_scores_gemma":[0.015047102,0.00043748223,0.00055293355,0.0018393594,0.0005541399,0.003250243,0.0015216803,0.0012381095,0.0006658905],"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.0014438179,0.0005201967,0.079541795,0.0016182072,0.00031821922,0.00068740593,0.0012883074,0.026078451,0.07560961,0.008711257,0.012376683,0.79180604],"study_design_scores_gemma":[0.00014155151,0.0016737116,0.08333566,0.0008709395,0.00089050725,0.00482975,0.00083000126,0.48934954,0.34747165,0.015332523,0.05488038,0.00039373786],"about_ca_topic_score_codex":0.0011951921,"about_ca_topic_score_gemma":0.0011173914,"teacher_disagreement_score":0.003984285,"about_ca_system_score_codex":0.00077635073,"about_ca_system_score_gemma":0.0012689771,"threshold_uncertainty_score":0.009826362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3504318,0.0048379414,0.5742459,0.034744695,0.00081518857,0.00062773935,0.0011225723,0.011659066,0.021515029],"genre_scores_gemma":[0.88458675,0.0011859823,0.10680274,0.0014832761,0.00034414907,0.00021505491,0.00047449558,0.0026052971,0.002302258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9067985,0.034958705,0.004061321,0.010628409,0.037489,0.006064158],"domain_scores_gemma":[0.5249159,0.31456834,0.02507503,0.113065094,0.020062601,0.0023129724],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.05062539,0.0014914193,0.0014302214,0.0033746122,0.0038745848,0.01075595,0.0058079204,0.0063889353,0.0046367594],"category_scores_gemma":[0.28487748,0.0033406375,0.0023482342,0.0023465848,0.022534624,0.028067991,0.010193734,0.011624329,0.001571392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013210857,0.00042911552,0.039371617,0.0013516303,0.00035506504,0.0020811125,0.0060497243,0.11337196,0.01986358,0.6608681,0.010563996,0.144373],"study_design_scores_gemma":[0.00015576267,0.0003367915,0.007342571,0.00091483316,0.00022219306,0.001647577,0.0020299705,0.23204656,0.03675741,0.68758607,0.030690834,0.00026936847],"about_ca_topic_score_codex":0.0046279253,"about_ca_topic_score_gemma":0.0030145252,"teacher_disagreement_score":0.99419206,"about_ca_system_score_codex":0.0060001705,"about_ca_system_score_gemma":0.006667024,"threshold_uncertainty_score":0.2677359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115229644,0.0038719815,0.53308445,0.049538016,0.004217191,0.00062408415,0.00047513878,0.013844286,0.27911517],"genre_scores_gemma":[0.69729245,0.0021820373,0.12422413,0.010757729,0.00047830484,0.0004853906,0.00038268362,0.0045460286,0.15965131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766445,0.0005244154,0.00014142178,0.0003785004,0.0009134348,0.0003778833],"domain_scores_gemma":[0.9911193,0.0019085819,0.0008877949,0.0036058486,0.0016129583,0.00086542673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003249327,0.000906023,0.00039873083,0.00077592843,0.0032115972,0.0056457217,0.0010645676,0.0028264218,0.020508029],"category_scores_gemma":[0.015037953,0.0009628463,0.0006971144,0.00036267634,0.0076417723,0.013642681,0.006069678,0.0042096754,0.009917798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020589636,0.00010989729,0.005369514,0.0004205883,0.00014957295,0.0011846765,0.00664711,0.010521385,0.016924087,0.76668614,0.056069303,0.13571191],"study_design_scores_gemma":[0.000046899066,0.00021400541,0.0021520266,0.00031634042,0.0000641786,0.001004847,0.002513468,0.0085370755,0.0067678764,0.5036688,0.4745969,0.0001175979],"about_ca_topic_score_codex":0.0013263936,"about_ca_topic_score_gemma":0.0018294295,"teacher_disagreement_score":0.020508029,"about_ca_system_score_codex":0.0012170282,"about_ca_system_score_gemma":0.001429173,"threshold_uncertainty_score":0.06860614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166121,0.00032302752,0.8017056,0.00072792877,0.00007866828,0.0005071215,0.000068965295,0.0073380913,0.01758935],"genre_scores_gemma":[0.78989905,0.00026193092,0.2028374,0.00034335867,0.00009878229,0.0002674174,0.00010357292,0.0011746668,0.005013807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920739,0.001908997,0.0009801105,0.00070010405,0.0035790962,0.00075778825],"domain_scores_gemma":[0.97046554,0.009938323,0.0030616978,0.011095023,0.004438636,0.0010007963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009041519,0.0005632511,0.0007188188,0.0010733401,0.0014476975,0.00362671,0.0015429447,0.0013153665,0.0014880338],"category_scores_gemma":[0.022070488,0.0009592715,0.0010018775,0.0005882487,0.0031879763,0.0048681563,0.0052055344,0.00274878,0.00058932253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007094493,0.00079972524,0.039019726,0.0005718565,0.00026423178,0.0035366807,0.010956309,0.02795151,0.1360143,0.512974,0.005784001,0.26141825],"study_design_scores_gemma":[0.00049703004,0.0005677598,0.009525802,0.0004091496,0.00049062376,0.004374008,0.0015176865,0.34692916,0.23075905,0.2645232,0.1400787,0.0003277801],"about_ca_topic_score_codex":0.0025891082,"about_ca_topic_score_gemma":0.002006901,"teacher_disagreement_score":0.009041519,"about_ca_system_score_codex":0.0008464725,"about_ca_system_score_gemma":0.0030381486,"threshold_uncertainty_score":0.047816694},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4971311,0.0015927979,0.48638064,0.0010450472,0.00019672557,0.00032147323,0.00010789406,0.0046197036,0.00860465],"genre_scores_gemma":[0.9713435,0.00016682774,0.02736592,0.00011809917,0.000029728815,0.000036336693,0.000027338487,0.00006801314,0.000844133],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966928,0.00074679655,0.000179248,0.0002559568,0.0013964309,0.000728737],"domain_scores_gemma":[0.9877685,0.003445305,0.0017125304,0.0043643,0.0022937506,0.00041560468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015771232,0.0006339955,0.00095922814,0.0008038094,0.0014447194,0.0018947896,0.0015794309,0.0011195878,0.0012838372],"category_scores_gemma":[0.0063450513,0.0003634927,0.00052178843,0.00086830073,0.0014713296,0.003383764,0.0017640885,0.0016045269,0.00046119135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003704126,0.0014530716,0.022157304,0.0007228497,0.00052169384,0.0019691663,0.0015212673,0.2065645,0.39955723,0.093677774,0.012917609,0.2552335],"study_design_scores_gemma":[0.00013661069,0.0006972546,0.0015509959,0.00007305733,0.00016326927,0.0007588632,0.0002155847,0.6982119,0.28244862,0.009222836,0.006442115,0.00007898364],"about_ca_topic_score_codex":0.0023784745,"about_ca_topic_score_gemma":0.0023991892,"teacher_disagreement_score":0.0023784745,"about_ca_system_score_codex":0.0010882278,"about_ca_system_score_gemma":0.0023462097,"threshold_uncertainty_score":0.008340716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016051421,0.00023720728,0.97909355,0.0003549941,0.00006561422,0.00013806798,0.00003765332,0.002682354,0.0013391532],"genre_scores_gemma":[0.40927285,0.00061762385,0.5844946,0.00045814208,0.00027948222,0.00026936355,0.00022664694,0.0010522074,0.0033290538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.984288,0.005146348,0.002674087,0.0020441602,0.004844421,0.0010029391],"domain_scores_gemma":[0.9426241,0.022585604,0.004807992,0.026103025,0.0029411947,0.0009381966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01827356,0.0015228695,0.0014017179,0.0027695445,0.0017730792,0.007395278,0.0031761837,0.00257675,0.0015513276],"category_scores_gemma":[0.042936347,0.0019112953,0.0028608022,0.0021627469,0.0067218463,0.018013591,0.0065832795,0.004553251,0.00046672366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079806685,0.00021050166,0.0061399443,0.00042961712,0.0002087763,0.0007074976,0.0037163016,0.09145049,0.01977229,0.633027,0.0028673008,0.24067235],"study_design_scores_gemma":[0.00024458143,0.00055133784,0.0009559336,0.00036651548,0.0004348351,0.0009541357,0.00024062027,0.38016728,0.044466086,0.5072447,0.063976154,0.00039774712],"about_ca_topic_score_codex":0.002334635,"about_ca_topic_score_gemma":0.0014154898,"teacher_disagreement_score":0.01827356,"about_ca_system_score_codex":0.0018615685,"about_ca_system_score_gemma":0.0021447774,"threshold_uncertainty_score":0.096641004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10403017,0.01822693,0.85287863,0.0009591732,0.00040399432,0.00022567424,0.000044539593,0.0030521364,0.020178778],"genre_scores_gemma":[0.74191785,0.0077776965,0.24248785,0.0002431903,0.00019404951,0.00009083007,0.0001228195,0.00038196257,0.006783676],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883217,0.0001708097,0.00008486521,0.00019835106,0.0005757806,0.00013795348],"domain_scores_gemma":[0.99820185,0.0005712225,0.00024757473,0.0004013177,0.0005264893,0.000051541443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008758941,0.00043895724,0.00041500432,0.001416379,0.00046809844,0.0011214766,0.0009207144,0.0004389564,0.0011793055],"category_scores_gemma":[0.0031773036,0.00039434753,0.0007496789,0.0008052399,0.00076678034,0.0027688094,0.0005292353,0.0013234585,0.00035411856],"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.0003523689,0.0002129287,0.0033268349,0.0010624441,0.00011016506,0.00043766655,0.0009174388,0.007612144,0.2971525,0.05826364,0.0027705496,0.6277814],"study_design_scores_gemma":[0.000082127954,0.0011695585,0.0073473314,0.0005193236,0.00040715013,0.0051655085,0.00043792577,0.26375294,0.5997756,0.024659345,0.096478395,0.00020474238],"about_ca_topic_score_codex":0.00059879915,"about_ca_topic_score_gemma":0.00034137297,"teacher_disagreement_score":0.001416379,"about_ca_system_score_codex":0.0005390021,"about_ca_system_score_gemma":0.0005784048,"threshold_uncertainty_score":0.0046322346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023526631,0.00009741474,0.97337127,0.00019441362,0.000038715443,0.00022607137,0.000101842576,0.0014353611,0.0010083228],"genre_scores_gemma":[0.45032454,0.00017951977,0.54698783,0.00014186537,0.000025605914,0.00031291743,0.00021905042,0.0002940378,0.0015147083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917754,0.0021853207,0.0009932618,0.0012733244,0.0026559117,0.0011167568],"domain_scores_gemma":[0.9870205,0.00582274,0.0016267124,0.0031024269,0.0018718006,0.00055592775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008641632,0.001169023,0.0012212942,0.0012588659,0.0012898233,0.0037621437,0.003516342,0.0016805185,0.0027712937],"category_scores_gemma":[0.0138469245,0.0015645876,0.0033217582,0.00089922966,0.0036448424,0.0039770477,0.0041035716,0.0026333942,0.0005227659],"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.0009446803,0.00021378297,0.0025530024,0.00075577735,0.00031722378,0.0009725205,0.0009095985,0.6364227,0.03428827,0.26005512,0.0013474966,0.06121975],"study_design_scores_gemma":[0.00014693246,0.00015321691,0.0002521638,0.00009232952,0.00012401685,0.00014746732,0.00009804544,0.8770126,0.030487427,0.08737057,0.0040615867,0.00005362747],"about_ca_topic_score_codex":0.008903024,"about_ca_topic_score_gemma":0.007998449,"teacher_disagreement_score":0.008903024,"about_ca_system_score_codex":0.0023844559,"about_ca_system_score_gemma":0.0070138113,"threshold_uncertainty_score":0.04570186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18865927,0.004042144,0.75907105,0.0010464055,0.0011652126,0.00045917486,0.00024350385,0.019067591,0.026245665],"genre_scores_gemma":[0.93365633,0.0013972778,0.058029946,0.00061352446,0.00028539408,0.00013416329,0.00022874089,0.00044863537,0.0052059246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970457,0.00061660877,0.00021011733,0.00034150292,0.0012096948,0.00057630514],"domain_scores_gemma":[0.99447095,0.0014993717,0.00065186585,0.002232874,0.00087195943,0.00027301363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020376649,0.0009934201,0.0006207932,0.001137799,0.0008888622,0.0021868672,0.0018400834,0.0017971575,0.0022513554],"category_scores_gemma":[0.005960148,0.00046326086,0.0006518473,0.0007025911,0.0016342953,0.0044738753,0.0034316778,0.0028959517,0.00071508216],"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.0016066425,0.00075809774,0.023654176,0.0015507343,0.00059506414,0.0053085387,0.0015281718,0.08532877,0.24456552,0.247968,0.02678145,0.3603548],"study_design_scores_gemma":[0.00007870395,0.0008316045,0.0030713696,0.00015007117,0.00034037468,0.0056609754,0.0001385773,0.5601535,0.29935068,0.037550468,0.09242445,0.00024925199],"about_ca_topic_score_codex":0.00089147367,"about_ca_topic_score_gemma":0.000564685,"teacher_disagreement_score":0.0022513554,"about_ca_system_score_codex":0.0005807063,"about_ca_system_score_gemma":0.0008169611,"threshold_uncertainty_score":0.010776281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009305051,0.00029937248,0.95176476,0.0020344472,0.00029995866,0.00024794132,0.000043346165,0.0008714094,0.035133816],"genre_scores_gemma":[0.4839498,0.0005587409,0.47630143,0.00058219116,0.00028040452,0.00032454336,0.00011233779,0.00018578468,0.03770484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755234,0.0008634234,0.0001238437,0.00025665193,0.0009927839,0.00021091812],"domain_scores_gemma":[0.9984314,0.0004227142,0.000085510284,0.00034952283,0.00050458167,0.00020640698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021668258,0.00058236916,0.0007447408,0.0010656137,0.0019351587,0.0045584044,0.0028148927,0.0027169266,0.006988415],"category_scores_gemma":[0.0034479387,0.0005049091,0.0009902045,0.0007951629,0.0022107195,0.0048269676,0.0029742222,0.0029053823,0.0023407158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001179461,0.0002052306,0.00037303782,0.00009600169,0.00006252527,0.00029090585,0.00050524727,0.023818415,0.0051781274,0.9215188,0.005069201,0.042764533],"study_design_scores_gemma":[0.000098338896,0.00015452948,0.00018070186,0.000055499142,0.00009662823,0.00038026343,0.0002579396,0.5844357,0.006779249,0.34010306,0.06740223,0.00005599981],"about_ca_topic_score_codex":0.0033765675,"about_ca_topic_score_gemma":0.0034922892,"teacher_disagreement_score":0.006988415,"about_ca_system_score_codex":0.0015431988,"about_ca_system_score_gemma":0.0021638854,"threshold_uncertainty_score":0.023378551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009820715,0.00023170355,0.9267733,0.000120113975,0.00019305335,0.00045347057,0.0002538229,0.053565502,0.0085883755],"genre_scores_gemma":[0.42753202,0.00045157486,0.5202438,0.00094343186,0.0002902644,0.0012045751,0.0018857511,0.013208862,0.034239687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977029,0.00041217555,0.00019074832,0.00038765607,0.0010414758,0.0002649455],"domain_scores_gemma":[0.9943897,0.0015488524,0.00036956216,0.002677687,0.0008132516,0.00020083065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026480893,0.001151183,0.0006914819,0.0010945966,0.0004056457,0.0022641162,0.0029768692,0.001297188,0.015440659],"category_scores_gemma":[0.011374292,0.0012435368,0.0010286572,0.00041704773,0.0010035201,0.00461141,0.0036340593,0.0027951156,0.006347872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014594815,0.00072668405,0.007574251,0.0016452592,0.00022542494,0.001724018,0.0013166495,0.029729458,0.13304184,0.23717265,0.03468459,0.5506997],"study_design_scores_gemma":[0.00041676295,0.00062899356,0.0034843276,0.00033961862,0.00018093968,0.0029056421,0.00009349716,0.258125,0.31491444,0.07939818,0.33928832,0.00022417854],"about_ca_topic_score_codex":0.00041341482,"about_ca_topic_score_gemma":0.000302786,"teacher_disagreement_score":0.015440659,"about_ca_system_score_codex":0.0005264522,"about_ca_system_score_gemma":0.0012801815,"threshold_uncertainty_score":0.05165422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12239075,0.00060896773,0.85722065,0.00016298957,0.0001426213,0.000110037385,0.000057019934,0.014542545,0.004764371],"genre_scores_gemma":[0.767964,0.00039933703,0.21975043,0.00019019001,0.00008570549,0.00010648536,0.00017849836,0.0029371188,0.008388285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993262,0.00007404338,0.000037769292,0.0002305223,0.0002521359,0.00007942241],"domain_scores_gemma":[0.9981598,0.00045658567,0.00019402437,0.000969849,0.0001533086,0.00006636076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003436004,0.0005123973,0.00052769086,0.00040626488,0.00034048728,0.0005361885,0.0011308845,0.00046339026,0.0024796638],"category_scores_gemma":[0.0021525535,0.00042614184,0.00039622435,0.00021471038,0.0007923866,0.0013150803,0.0013237756,0.0008932477,0.0005995821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043317102,0.00013993985,0.005121326,0.0004517092,0.000075904456,0.001113908,0.0009994743,0.024433162,0.34633523,0.017080195,0.0038435524,0.5999724],"study_design_scores_gemma":[0.00011875947,0.00078171585,0.008407521,0.00016612967,0.00018910212,0.0036392747,0.00021680004,0.23566742,0.64362764,0.017450178,0.089624494,0.00011083817],"about_ca_topic_score_codex":0.0003898916,"about_ca_topic_score_gemma":0.00039364593,"teacher_disagreement_score":0.0024796638,"about_ca_system_score_codex":0.00022256082,"about_ca_system_score_gemma":0.00025994965,"threshold_uncertainty_score":0.008295357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014730904,0.0009636618,0.9159351,0.00041231108,0.00036572816,0.00031750445,0.0026249497,0.0519807,0.012669052],"genre_scores_gemma":[0.19138032,0.0006781095,0.7662464,0.00036919562,0.0003638538,0.00033647445,0.0062158885,0.008504892,0.025904927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958947,0.000560653,0.0004312908,0.0008370619,0.00191687,0.00035940128],"domain_scores_gemma":[0.99110764,0.0028202254,0.00047941567,0.0038158814,0.0015835405,0.00019332717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016772059,0.0022791037,0.0020580941,0.0062998105,0.0015603423,0.004816207,0.0027774018,0.001206118,0.04253628],"category_scores_gemma":[0.013761484,0.0015218484,0.0027935768,0.005720396,0.0007558171,0.00990048,0.004502302,0.0023169706,0.013980345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000892713,0.00015381128,0.001578736,0.00073038763,0.0001712492,0.00020275499,0.00040121627,0.007853163,0.019633561,0.07600375,0.03775473,0.8546239],"study_design_scores_gemma":[0.00024190948,0.00037110317,0.0014371519,0.00042701006,0.0005986937,0.00071181136,0.0005395458,0.30287427,0.13044365,0.39716956,0.16497049,0.00021488784],"about_ca_topic_score_codex":0.0016010558,"about_ca_topic_score_gemma":0.0025648286,"teacher_disagreement_score":0.04253628,"about_ca_system_score_codex":0.0013131703,"about_ca_system_score_gemma":0.0015606907,"threshold_uncertainty_score":0.14229804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010354534,0.00010758656,0.982701,0.00015507276,0.00003799975,0.000115338036,0.00008355072,0.0050404957,0.0014044323],"genre_scores_gemma":[0.49243551,0.00018939092,0.50476927,0.00010966176,0.000055977012,0.0001775109,0.00023009154,0.0004058815,0.0016267599],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964503,0.0011664161,0.00030740394,0.0004004886,0.0014486675,0.0002266927],"domain_scores_gemma":[0.9950352,0.0019652613,0.0005976664,0.0011289098,0.0011036798,0.00016926049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006247908,0.00056085695,0.0006232802,0.0015088265,0.00075482775,0.0022882149,0.0016911108,0.0010144516,0.002084479],"category_scores_gemma":[0.009675331,0.00042516252,0.00081460725,0.00078014366,0.00093483826,0.0025573168,0.0014289634,0.0015856622,0.0003886353],"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.00076882204,0.0005139886,0.009252373,0.0005423735,0.00027629174,0.0012716693,0.0015344528,0.17582956,0.031160392,0.32696056,0.009240989,0.4426486],"study_design_scores_gemma":[0.000041400155,0.00007062332,0.00071872154,0.00006109078,0.000068643836,0.0002463102,0.000059866168,0.9328221,0.016209768,0.03949351,0.010169676,0.000038378086],"about_ca_topic_score_codex":0.004679581,"about_ca_topic_score_gemma":0.0033338857,"teacher_disagreement_score":0.006247908,"about_ca_system_score_codex":0.00095363765,"about_ca_system_score_gemma":0.002894435,"threshold_uncertainty_score":0.03304249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029721197,0.001808477,0.9213883,0.0013064318,0.00072415586,0.00009015562,0.00011457153,0.0036230488,0.041223597],"genre_scores_gemma":[0.6427633,0.004605799,0.29689893,0.0013834952,0.0010707653,0.0002308612,0.0008582624,0.0053781653,0.046810396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973924,0.0006159649,0.00016233057,0.00035196138,0.00096715434,0.00051016366],"domain_scores_gemma":[0.99512947,0.002706083,0.00023573123,0.0011004205,0.0007062256,0.000122065634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024323703,0.0010181866,0.0010006821,0.0018425041,0.0017128959,0.0037308696,0.0019886673,0.0016175298,0.0059938943],"category_scores_gemma":[0.010320162,0.0010560061,0.0013316764,0.001944037,0.004540425,0.009555914,0.003467733,0.003753851,0.0019743652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003236174,0.000060880582,0.0015242967,0.00013944611,0.000021362332,0.00029854843,0.0006482661,0.020521145,0.003416688,0.8448066,0.00927423,0.11896495],"study_design_scores_gemma":[0.000047864243,0.000067988396,0.0008492916,0.00023387303,0.000063166524,0.00022201987,0.0001247983,0.12770633,0.013795365,0.8261349,0.030666264,0.00008809192],"about_ca_topic_score_codex":0.009996549,"about_ca_topic_score_gemma":0.0074751875,"teacher_disagreement_score":0.009996549,"about_ca_system_score_codex":0.00216938,"about_ca_system_score_gemma":0.0017316204,"threshold_uncertainty_score":0.020051599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46102437,0.0002861557,0.5299305,0.00027490422,0.000056093,0.00008459529,0.000055588047,0.0043950295,0.0038927773],"genre_scores_gemma":[0.9657191,0.00005687432,0.033025503,0.000048840382,0.000007862902,0.000023507939,0.000027113574,0.00015802355,0.00093315035],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977642,0.00022751545,0.000116285555,0.00039513287,0.0011262483,0.0003704927],"domain_scores_gemma":[0.99358314,0.0017979825,0.0012156005,0.0024997846,0.00063706795,0.00026641972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000830388,0.0004462458,0.0004397572,0.001380705,0.0008169366,0.0018131419,0.0009240567,0.0005960668,0.0010222582],"category_scores_gemma":[0.0075794253,0.00052847486,0.00048383707,0.00058490125,0.0025276814,0.003018499,0.0025557189,0.0017730682,0.00037527562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007541419,0.00039876814,0.085086375,0.00022099112,0.00013311484,0.002361347,0.0046744915,0.0626759,0.46803442,0.161531,0.0020215884,0.21210784],"study_design_scores_gemma":[0.00004268351,0.0003927993,0.010206299,0.00008026126,0.00012090184,0.0021529067,0.00041907924,0.59017,0.3396421,0.045361415,0.011286806,0.00012481464],"about_ca_topic_score_codex":0.0016246707,"about_ca_topic_score_gemma":0.0016605707,"teacher_disagreement_score":0.0018131419,"about_ca_system_score_codex":0.000893638,"about_ca_system_score_gemma":0.0009644966,"threshold_uncertainty_score":0.006483853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036379294,0.00026126855,0.99175733,0.00021936068,0.000028149081,0.00006445017,0.00010835886,0.00035014647,0.0035729434],"genre_scores_gemma":[0.37230605,0.0012295133,0.61998975,0.0002175248,0.00028359098,0.00050213584,0.00051740377,0.00047532833,0.0044785812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99090415,0.0035408358,0.00046866818,0.0010924238,0.0034056122,0.0005882196],"domain_scores_gemma":[0.9597936,0.031859253,0.0012538205,0.00488349,0.0018893282,0.0003204915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008196019,0.0014634806,0.0014737711,0.0031422458,0.0010177371,0.00409135,0.0034070313,0.0010250839,0.007848063],"category_scores_gemma":[0.030960854,0.0011698741,0.0024227456,0.0022989516,0.0044400506,0.010157253,0.0022124788,0.0035457655,0.00083853054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701303,0.00008819587,0.0004209464,0.0004346385,0.00006914709,0.000052320993,0.00014477625,0.062724605,0.0027218326,0.8883042,0.0014372667,0.043531958],"study_design_scores_gemma":[0.000016418455,0.0000341871,0.00018732423,0.00005125948,0.000034105753,0.000041677158,0.000021434626,0.2294347,0.0038502659,0.7641736,0.0021350584,0.000019990817],"about_ca_topic_score_codex":0.0009861998,"about_ca_topic_score_gemma":0.00060069584,"teacher_disagreement_score":0.008196019,"about_ca_system_score_codex":0.0026591618,"about_ca_system_score_gemma":0.0021460033,"threshold_uncertainty_score":0.043345153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550131,0.0012456899,0.037124388,0.0006519719,0.0000646432,0.00007864717,0.00014033724,0.00040717787,0.005273909],"genre_scores_gemma":[0.996543,0.00031970427,0.0028369687,0.00004425148,0.000018308532,0.000013660261,0.000063719155,0.000020908043,0.00013951323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820745,0.00050537527,0.00010238163,0.00018207011,0.0006195407,0.0003832571],"domain_scores_gemma":[0.9899629,0.0060057365,0.0013696989,0.0013623772,0.0009736648,0.00032558342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014209964,0.00074031967,0.00062598474,0.0011908227,0.0005064592,0.0012304232,0.0007544833,0.0009016581,0.00082170917],"category_scores_gemma":[0.014329512,0.0002880778,0.00038583804,0.0005183257,0.0007214356,0.004627049,0.0008640009,0.0012393951,0.00023843462],"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.001151282,0.0008686889,0.06385899,0.00041353746,0.000231802,0.00063605,0.00050618115,0.7305155,0.082047015,0.017769651,0.0016189348,0.10038237],"study_design_scores_gemma":[0.000032621385,0.0006634532,0.031419143,0.00004989132,0.00009123634,0.00037400174,0.00033240955,0.9198781,0.030554267,0.014737803,0.0018209547,0.000046032226],"about_ca_topic_score_codex":0.0018647807,"about_ca_topic_score_gemma":0.00085921376,"teacher_disagreement_score":0.0018647807,"about_ca_system_score_codex":0.0007648614,"about_ca_system_score_gemma":0.0007065073,"threshold_uncertainty_score":0.007515013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43155035,0.011036854,0.51704067,0.0011802405,0.00027668523,0.0010165309,0.0023939211,0.020163955,0.015340854],"genre_scores_gemma":[0.6784458,0.0031672572,0.3098082,0.0004311133,0.00014185878,0.00049245486,0.0037294398,0.0006843341,0.003099561],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878421,0.0016540659,0.001554685,0.0013100696,0.006809891,0.00082912535],"domain_scores_gemma":[0.96220464,0.019997582,0.0046473066,0.0038034206,0.0084392205,0.00090775854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007118166,0.0015981466,0.0016950817,0.022005158,0.0009184792,0.002114857,0.0025660354,0.0017438194,0.0012629896],"category_scores_gemma":[0.031429347,0.00074479403,0.0018492014,0.007757618,0.001012496,0.003015732,0.0016262485,0.0008940626,0.00082441693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008467209,0.00057357363,0.19511841,0.0016485878,0.00042069005,0.0016369155,0.0011957664,0.021573003,0.037298586,0.01182814,0.006433952,0.7214257],"study_design_scores_gemma":[0.00018424666,0.0009504174,0.15830238,0.001593495,0.0019059838,0.0074567436,0.0012371299,0.58552164,0.17376362,0.023324208,0.045262992,0.00049712165],"about_ca_topic_score_codex":0.002354758,"about_ca_topic_score_gemma":0.0019978238,"teacher_disagreement_score":0.022005158,"about_ca_system_score_codex":0.0014841068,"about_ca_system_score_gemma":0.0028462803,"threshold_uncertainty_score":0.037644923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011746199,0.00014425204,0.96695083,0.0009005492,0.0001280558,0.00012981228,0.00012600761,0.00028381095,0.019590538],"genre_scores_gemma":[0.6256984,0.00038915657,0.3603568,0.00055757136,0.00032833416,0.0007421205,0.00025946,0.00020450221,0.01146366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966202,0.00072556,0.00027203714,0.00066746294,0.0012267049,0.00048806684],"domain_scores_gemma":[0.99332786,0.0035492864,0.000555309,0.0010661246,0.0011610736,0.00034030023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035951652,0.0006860537,0.00094025384,0.0012516463,0.0019699577,0.0034217366,0.002165455,0.0023382106,0.010641259],"category_scores_gemma":[0.00960345,0.0005732824,0.0015857982,0.0010075815,0.0053718346,0.008866187,0.0030757047,0.004761921,0.0015633733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020415455,0.000009693055,0.00006466163,0.000050678336,0.000005395723,0.00016208178,0.00012262164,0.008097172,0.0014104375,0.9868614,0.00035042566,0.0028450214],"study_design_scores_gemma":[0.000034065102,0.000065738896,0.000072127375,0.00003584142,0.000017754757,0.00021952622,0.000087296525,0.097563654,0.0037342333,0.8899497,0.008170305,0.0000497532],"about_ca_topic_score_codex":0.0016952504,"about_ca_topic_score_gemma":0.0017206183,"teacher_disagreement_score":0.010641259,"about_ca_system_score_codex":0.0018527701,"about_ca_system_score_gemma":0.003415076,"threshold_uncertainty_score":0.035598516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081694216,0.00026357966,0.90013844,0.00033572767,0.00021702489,0.00045361678,0.00019013684,0.00915215,0.00755507],"genre_scores_gemma":[0.57969093,0.0004175231,0.4031176,0.00046915235,0.00013196778,0.0003778349,0.00061952265,0.006560516,0.008614894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991561,0.0016942362,0.001661462,0.00108426,0.003096576,0.00090241793],"domain_scores_gemma":[0.94579035,0.023046935,0.00331297,0.022753749,0.0045236554,0.00057235616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007367238,0.0012692562,0.0011976451,0.0022848023,0.0011314992,0.0029819412,0.0032415697,0.0022754192,0.0044895695],"category_scores_gemma":[0.043374505,0.0015510063,0.0019545401,0.0012675565,0.0032057941,0.009575869,0.008876623,0.0040773884,0.0017831646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014793207,0.0007106379,0.014736539,0.002059596,0.0004432083,0.0041434364,0.0048006843,0.053763144,0.16336063,0.19485457,0.008487437,0.5511608],"study_design_scores_gemma":[0.00017386003,0.00043106923,0.0018727811,0.0010444473,0.0006203905,0.0018765515,0.0009461003,0.34023288,0.32650208,0.27485195,0.051151592,0.00029620779],"about_ca_topic_score_codex":0.0004976661,"about_ca_topic_score_gemma":0.0009696785,"teacher_disagreement_score":0.007367238,"about_ca_system_score_codex":0.000556616,"about_ca_system_score_gemma":0.0019396971,"threshold_uncertainty_score":0.038962126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05260496,0.0018209554,0.742144,0.0036255505,0.002471833,0.0012966056,0.0011557363,0.0312811,0.16359918],"genre_scores_gemma":[0.63258624,0.0012034051,0.25421947,0.002955451,0.00065145735,0.00061567145,0.0020456668,0.005168003,0.100554645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895629,0.0017269962,0.0007261068,0.0018717838,0.0053086574,0.0008035584],"domain_scores_gemma":[0.9625353,0.008617616,0.0029732762,0.01785782,0.0072766636,0.0007393154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006735812,0.0014866514,0.0008369424,0.0021547978,0.0016714368,0.0027635335,0.0034892953,0.0020057573,0.01901607],"category_scores_gemma":[0.037258793,0.0006143692,0.0009998921,0.0008928444,0.0017589529,0.0033904149,0.0032377387,0.0027838133,0.0045327153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006954972,0.0007000435,0.011549964,0.0013148511,0.00020585392,0.0014341375,0.0018610455,0.02610379,0.03952822,0.21883588,0.06627054,0.6315001],"study_design_scores_gemma":[0.0002344719,0.0007438274,0.007636503,0.00094722566,0.00033291252,0.0025992899,0.0010281267,0.16465572,0.07455687,0.14629275,0.60072803,0.00024430786],"about_ca_topic_score_codex":0.0028109136,"about_ca_topic_score_gemma":0.0036901573,"teacher_disagreement_score":0.01901607,"about_ca_system_score_codex":0.0013956452,"about_ca_system_score_gemma":0.0034117608,"threshold_uncertainty_score":0.063615024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053783745,0.9960653,0.0013864622,0.0002041983,0.0001723288,0.0000046461773,0.000011462633,0.000010475566,0.0016073438],"genre_scores_gemma":[0.0034922818,0.9939056,0.0009409026,0.00017033752,0.00019638456,0.000007978713,0.0000241246,0.0000032962014,0.0012591755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962056,0.000038841874,0.0000449957,0.00008698247,0.00018088637,0.000027648177],"domain_scores_gemma":[0.99926776,0.00035689547,0.000113486654,0.00003802527,0.0001970541,0.000026750344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665609,0.0009971705,0.0020309398,0.0017392733,0.00028898366,0.0014725351,0.0012595119,0.0016864802,0.0014280077],"category_scores_gemma":[0.00085881475,0.00040850317,0.0004070468,0.0028263733,0.0010069414,0.0017643733,0.0005689044,0.0009577054,0.0021224236],"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.00006334537,0.00007141059,0.00018765444,0.0067114155,0.000048311405,0.00018622092,0.000056811834,0.0006026861,0.009344311,0.0049489895,0.007342605,0.9704361],"study_design_scores_gemma":[0.000025422865,0.00024516447,0.0011001034,0.0016149636,0.00011684396,0.003583994,0.00014537666,0.00064903684,0.018876094,0.0067111505,0.96688384,0.000048005928],"about_ca_topic_score_codex":0.0010160509,"about_ca_topic_score_gemma":0.0020497376,"teacher_disagreement_score":0.0020309398,"about_ca_system_score_codex":0.0006626709,"about_ca_system_score_gemma":0.0007662603,"threshold_uncertainty_score":0.0048080087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010331449,0.00024832762,0.97832257,0.0011488072,0.00021902152,0.00017820456,0.00014137937,0.0009917297,0.008418555],"genre_scores_gemma":[0.4795845,0.00056922156,0.50308496,0.0006812729,0.00032438975,0.0006679506,0.00044174952,0.00024333174,0.014402696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917665,0.002139658,0.0008226561,0.001253939,0.0031599125,0.00085737655],"domain_scores_gemma":[0.9837429,0.00397195,0.0012566762,0.008505125,0.0014875748,0.0010357079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007503859,0.00079659023,0.0012389047,0.00142644,0.0042843064,0.004888515,0.0031845686,0.0038339747,0.0045256726],"category_scores_gemma":[0.014931396,0.00067637314,0.0017038188,0.0017876296,0.005058498,0.015620506,0.009943848,0.0059301024,0.0021824974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002786253,0.000094520525,0.0003575822,0.00015618153,0.00003297604,0.00018081299,0.000708596,0.011321416,0.006043795,0.91722775,0.004670285,0.05892756],"study_design_scores_gemma":[0.00027272664,0.00031335908,0.00023820557,0.00013996506,0.00008492979,0.0008766583,0.00021538537,0.118877344,0.013727636,0.7873195,0.07776103,0.00017321545],"about_ca_topic_score_codex":0.00091962685,"about_ca_topic_score_gemma":0.00037934456,"teacher_disagreement_score":0.007503859,"about_ca_system_score_codex":0.0021300723,"about_ca_system_score_gemma":0.0029093053,"threshold_uncertainty_score":0.039684653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048354752,0.00015601209,0.947841,0.00035348322,0.00003614042,0.00005769349,0.00002725115,0.0016179375,0.0015557327],"genre_scores_gemma":[0.7594345,0.00031184175,0.23693293,0.000274552,0.00006650007,0.00016561996,0.00009499468,0.0006477213,0.0020713408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9846762,0.0047728796,0.0015561455,0.0024582238,0.005173447,0.0013631373],"domain_scores_gemma":[0.94361085,0.030515792,0.004478316,0.016515113,0.0042842194,0.0005957337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010120982,0.00075074926,0.0007007779,0.00112946,0.0008711544,0.003461217,0.0029948854,0.0017344293,0.0013451902],"category_scores_gemma":[0.043008436,0.0012943094,0.0015431327,0.0010158244,0.0070774206,0.009977888,0.003759853,0.0040406003,0.00054233224],"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.0008269992,0.00017346536,0.015511956,0.00049974036,0.00012124568,0.0016708462,0.0032539465,0.15693925,0.067002825,0.59366703,0.0010242317,0.1593085],"study_design_scores_gemma":[0.00006531746,0.00020302998,0.0011516982,0.00014603618,0.00010297786,0.0006091919,0.00020083433,0.4250665,0.08628026,0.4807059,0.0053566145,0.00011167496],"about_ca_topic_score_codex":0.0017879315,"about_ca_topic_score_gemma":0.0013423279,"teacher_disagreement_score":0.010120982,"about_ca_system_score_codex":0.0017163262,"about_ca_system_score_gemma":0.0018119548,"threshold_uncertainty_score":0.053525567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031080961,0.0011950554,0.6948344,0.0031120526,0.0018311718,0.0004500416,0.00092145044,0.19601943,0.070555344],"genre_scores_gemma":[0.21253304,0.0009951943,0.723222,0.0016309384,0.0009036248,0.00055651076,0.0021705672,0.018531293,0.039456762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973314,0.00053338177,0.0001807036,0.0003290752,0.0012272408,0.0003982695],"domain_scores_gemma":[0.9941928,0.0012566483,0.00020679948,0.0027076798,0.0012571638,0.0003789771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019561567,0.0012245768,0.000903709,0.0012662876,0.0012913536,0.0019945616,0.0036076957,0.00094352575,0.015921492],"category_scores_gemma":[0.009117836,0.00097545644,0.0012789669,0.0016095074,0.000780276,0.0034551749,0.0033088652,0.0026967162,0.007101756],"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.0020757027,0.0005805244,0.005980476,0.00061814656,0.00023402451,0.000781719,0.00058587623,0.032972857,0.039578665,0.09108028,0.18353671,0.64197505],"study_design_scores_gemma":[0.00054002774,0.000544177,0.0029918866,0.00012412432,0.00021208887,0.000831168,0.00014440078,0.34021646,0.078842536,0.051941395,0.5232864,0.00032524],"about_ca_topic_score_codex":0.0039593806,"about_ca_topic_score_gemma":0.0059758844,"teacher_disagreement_score":0.015921492,"about_ca_system_score_codex":0.0010136855,"about_ca_system_score_gemma":0.0018506339,"threshold_uncertainty_score":0.05326271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040562814,0.00015364576,0.9926743,0.00018322034,0.00003274972,0.00013050286,0.00002327429,0.0010201959,0.0017258055],"genre_scores_gemma":[0.09341939,0.00034595834,0.9032123,0.00021886613,0.000049807477,0.00016005262,0.00011023001,0.0005452874,0.001937993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964749,0.00095780066,0.00031150752,0.00043879752,0.0015383777,0.0002786427],"domain_scores_gemma":[0.99313533,0.0021033005,0.00042085146,0.0032606658,0.00092796347,0.00015189353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003586113,0.00084851723,0.0006634858,0.0015372392,0.001050665,0.002350956,0.0022508726,0.0010755575,0.0022147293],"category_scores_gemma":[0.009504253,0.0010821981,0.0018798045,0.0008400685,0.002558043,0.0037677148,0.0028326954,0.0036746697,0.000571117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026312153,0.00028394937,0.0020824843,0.00073952874,0.00020004596,0.00061891024,0.001649304,0.032962553,0.06287422,0.46777213,0.0048760003,0.42567778],"study_design_scores_gemma":[0.00012514112,0.00029306076,0.0011451638,0.00043937654,0.00040408224,0.0010457333,0.0002846047,0.3001724,0.07930399,0.5372295,0.07942082,0.00013610964],"about_ca_topic_score_codex":0.0012209004,"about_ca_topic_score_gemma":0.0022591797,"teacher_disagreement_score":0.003586113,"about_ca_system_score_codex":0.000617306,"about_ca_system_score_gemma":0.0021160487,"threshold_uncertainty_score":0.018965423},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03140264,0.0065422542,0.054698102,0.43334222,0.022156825,0.00022648051,0.00043271665,0.011307866,0.43989086],"genre_scores_gemma":[0.15728508,0.003988151,0.015477946,0.076424256,0.0020916164,0.000105817126,0.00020977603,0.0013193906,0.7430979],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994141,0.00008605648,0.000012624964,0.00017341995,0.00019702697,0.000116779935],"domain_scores_gemma":[0.99777573,0.00023870126,0.00007469039,0.00010969682,0.0005407077,0.0012604486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000924187,0.00048300554,0.00026020454,0.00039449456,0.0017517271,0.0017310525,0.0005311478,0.0016679841,0.10207345],"category_scores_gemma":[0.0031659806,0.00020136173,0.00020219767,0.00012264265,0.0007194305,0.0014166044,0.0017362986,0.0038895223,0.037870683],"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.000057696227,0.000074021984,0.0007497546,0.000031111158,0.000002150809,0.00046030845,0.00027949302,0.0001329134,0.0013733068,0.0041865082,0.93817496,0.054477833],"study_design_scores_gemma":[0.000026187272,0.00017008813,0.00084868254,0.00008811474,0.0000054859943,0.00399881,0.0007882042,0.0010037358,0.0037742197,0.0037176888,0.98554635,0.000032439108],"about_ca_topic_score_codex":0.002154122,"about_ca_topic_score_gemma":0.003980224,"teacher_disagreement_score":0.10207345,"about_ca_system_score_codex":0.00092071097,"about_ca_system_score_gemma":0.0012960876,"threshold_uncertainty_score":0.34146976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08930519,0.00085373165,0.8859607,0.0013516792,0.00018279595,0.0003390386,0.00007210492,0.0101100635,0.011824641],"genre_scores_gemma":[0.84467155,0.00041309322,0.14585006,0.0007238771,0.0001551955,0.0002468999,0.00016951049,0.0020929626,0.0056769648],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9911129,0.0029330533,0.00087574025,0.0014086263,0.0025560523,0.001113675],"domain_scores_gemma":[0.96968293,0.0050731753,0.0030971265,0.018381972,0.0022446008,0.0015201552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008635397,0.0011295425,0.0008463968,0.0010173222,0.0015729533,0.005482438,0.0034782076,0.0015879634,0.003253535],"category_scores_gemma":[0.025288893,0.0017886832,0.00088608393,0.00059489487,0.0050099613,0.01778289,0.009403234,0.004918159,0.0015823254],"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.0020228678,0.00044489047,0.017982282,0.0005517398,0.00023910143,0.0012590745,0.009709566,0.037519142,0.09898783,0.30384254,0.013478434,0.51396245],"study_design_scores_gemma":[0.00035932075,0.0011268139,0.008318877,0.00049586553,0.00049353257,0.0014146824,0.0020091692,0.32437158,0.13272934,0.39305753,0.13506924,0.0005540977],"about_ca_topic_score_codex":0.0017669838,"about_ca_topic_score_gemma":0.0011270671,"teacher_disagreement_score":0.008635397,"about_ca_system_score_codex":0.0017589763,"about_ca_system_score_gemma":0.0018981157,"threshold_uncertainty_score":0.0456689},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02009421,0.006275591,0.118384145,0.049725052,0.0030701992,0.00058132934,0.0013926718,0.003480649,0.7969961],"genre_scores_gemma":[0.8104853,0.008693611,0.042870168,0.011293923,0.0017262793,0.0003004651,0.002158802,0.00076005305,0.1217113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99320763,0.0010106831,0.0003661335,0.0006822762,0.0035321184,0.0012012294],"domain_scores_gemma":[0.98920083,0.0015844381,0.0007289176,0.0042688884,0.002983196,0.0012337423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039746477,0.00038828462,0.00039259176,0.0010830063,0.0031985568,0.0071119578,0.0012761907,0.0016190653,0.023158632],"category_scores_gemma":[0.012811115,0.00031198698,0.0005456034,0.0013379323,0.0017758615,0.0053641284,0.0038746381,0.0029689216,0.01086588],"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.00012321639,0.00008721475,0.002368613,0.00027897715,0.000036845428,0.000252977,0.00065593974,0.0017976186,0.006637847,0.6456285,0.1613914,0.18074085],"study_design_scores_gemma":[0.000025060906,0.00004205606,0.00204003,0.00032435101,0.000021463262,0.00074323436,0.0003811116,0.008630604,0.007272286,0.11474503,0.86573386,0.000040897445],"about_ca_topic_score_codex":0.0060265,"about_ca_topic_score_gemma":0.004475349,"teacher_disagreement_score":0.023158632,"about_ca_system_score_codex":0.0034457867,"about_ca_system_score_gemma":0.007994402,"threshold_uncertainty_score":0.07747334},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019409595,0.0012382978,0.19503126,0.0012787038,0.000598917,0.0010468314,0.00565653,0.7332612,0.042478625],"genre_scores_gemma":[0.42997727,0.0032928125,0.37022665,0.004131034,0.0009306366,0.0015753108,0.040513653,0.019877177,0.12947547],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977738,0.0003150271,0.0002249929,0.00038687699,0.001094729,0.00020445397],"domain_scores_gemma":[0.9962197,0.0006794524,0.00053204206,0.0012923138,0.0010426267,0.00023398806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367512,0.0011089039,0.0010615223,0.0021111297,0.0007009125,0.0017939286,0.0024791462,0.001120365,0.023800721],"category_scores_gemma":[0.007968464,0.00057649333,0.0008068109,0.000982042,0.0005573207,0.0031188948,0.0022749722,0.001908591,0.017980846],"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.0015430059,0.00043971874,0.0049006105,0.00079446,0.00032371693,0.00082834857,0.00052092795,0.009704069,0.028324598,0.017316824,0.5413892,0.39391446],"study_design_scores_gemma":[0.00058127986,0.00074037135,0.005137674,0.00020441001,0.0003541077,0.0022583366,0.00018143709,0.20229706,0.062433057,0.019464403,0.7060868,0.00026096834],"about_ca_topic_score_codex":0.0016552017,"about_ca_topic_score_gemma":0.0013233356,"teacher_disagreement_score":0.023800721,"about_ca_system_score_codex":0.00070710975,"about_ca_system_score_gemma":0.0015252141,"threshold_uncertainty_score":0.079621375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26217818,0.008275367,0.61609346,0.002557271,0.0040408955,0.00035254928,0.000687582,0.01856229,0.087252356],"genre_scores_gemma":[0.88758665,0.00072962843,0.05541666,0.00066908385,0.00028208515,0.00008393624,0.00040282094,0.00026653573,0.054562468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998642,0.000017439492,0.0000096103495,0.000027452006,0.00005929164,0.000021957376],"domain_scores_gemma":[0.9995803,0.00007388923,0.000028002132,0.00013118787,0.00016618245,0.000020328513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017219498,0.0003689115,0.00028279712,0.00031676865,0.0004396061,0.0009343156,0.00091042765,0.000876329,0.013541266],"category_scores_gemma":[0.0005456619,0.0001272171,0.00022731544,0.00023624548,0.0003897283,0.0009043339,0.0005046764,0.00045264044,0.0027618913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013087488,0.00019488252,0.0022894833,0.0009818121,0.00012457509,0.0030635037,0.00028483733,0.014926645,0.38806313,0.059895556,0.05047943,0.47838733],"study_design_scores_gemma":[0.000271801,0.001932994,0.002653627,0.00021889825,0.00021614673,0.005948836,0.00011893281,0.13897273,0.5703353,0.026700566,0.25252968,0.0001004776],"about_ca_topic_score_codex":0.00015361629,"about_ca_topic_score_gemma":0.00034114282,"teacher_disagreement_score":0.013541266,"about_ca_system_score_codex":0.00032235414,"about_ca_system_score_gemma":0.00021911568,"threshold_uncertainty_score":0.045300007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034519283,0.00018046526,0.97692263,0.00051035243,0.00020676675,0.000397682,0.00018613579,0.004308522,0.013835585],"genre_scores_gemma":[0.13110524,0.00061541697,0.84370416,0.00059574243,0.00022435757,0.0006763092,0.00092820363,0.001955933,0.020194624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9914151,0.002655142,0.0007284482,0.0020320804,0.0025350477,0.0006341253],"domain_scores_gemma":[0.96304786,0.01527025,0.002193484,0.014214074,0.0046516987,0.00062264566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008000394,0.0014224871,0.0009974112,0.0025466261,0.0025469565,0.0060180486,0.0040198504,0.003222593,0.037457157],"category_scores_gemma":[0.038741503,0.0012812568,0.002609892,0.0017437339,0.0036473537,0.012425341,0.0092294235,0.0037552603,0.0126773575],"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.00016457195,0.0001550916,0.0009607801,0.0005504677,0.000059247424,0.00031645113,0.0007883611,0.0080931615,0.0060776356,0.74927217,0.0106897345,0.2228723],"study_design_scores_gemma":[0.00014316985,0.0001955566,0.00034100472,0.0004929268,0.0001281578,0.00090100436,0.00027602463,0.071161844,0.039792255,0.67061555,0.21583432,0.00011830774],"about_ca_topic_score_codex":0.00086931855,"about_ca_topic_score_gemma":0.0007328133,"teacher_disagreement_score":0.037457157,"about_ca_system_score_codex":0.0017489068,"about_ca_system_score_gemma":0.0037966534,"threshold_uncertainty_score":0.12530673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004746258,0.003158775,0.859284,0.0017780907,0.00060152524,0.00009356802,0.00009405669,0.0012578791,0.12898576],"genre_scores_gemma":[0.19907868,0.0074471883,0.5631175,0.0016699749,0.0010049022,0.0003729264,0.00059425714,0.001727951,0.22498667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936527,0.00009072824,0.000030350591,0.000096331714,0.0003516913,0.00006558285],"domain_scores_gemma":[0.99933213,0.000363651,0.000022659451,0.00016694581,0.00009559757,0.000019065617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005100685,0.0010824724,0.00061460346,0.0008100665,0.00065724074,0.0018919079,0.0010196845,0.000836763,0.020708935],"category_scores_gemma":[0.0017933489,0.00068503356,0.0009954182,0.0005745715,0.0016938362,0.003990081,0.0019068215,0.0032241098,0.0056737857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004147918,0.000045869634,0.000071061295,0.00024935926,0.000020320915,0.000052246218,0.00024455253,0.008197459,0.005362668,0.8037662,0.012041921,0.16990687],"study_design_scores_gemma":[0.000023025703,0.00004095145,0.00012700167,0.000111250294,0.000037690068,0.000105163344,0.000056994435,0.026516315,0.00819051,0.8122111,0.15255877,0.000021283458],"about_ca_topic_score_codex":0.0009813982,"about_ca_topic_score_gemma":0.0013466688,"teacher_disagreement_score":0.020708935,"about_ca_system_score_codex":0.0010610921,"about_ca_system_score_gemma":0.0011165433,"threshold_uncertainty_score":0.06927836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103623316,0.00044580604,0.8794494,0.0003682294,0.00020889478,0.00068237697,0.00006408474,0.00684903,0.008308892],"genre_scores_gemma":[0.8479619,0.00029336385,0.14300099,0.00023307686,0.000059656726,0.00026442978,0.00013003673,0.00048157846,0.007575025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974025,0.00043287638,0.00031131555,0.0003557784,0.0011752825,0.0003221758],"domain_scores_gemma":[0.9970319,0.000449448,0.00026763734,0.0011844608,0.0009651843,0.000101300124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258422,0.0005965982,0.00042227676,0.000934511,0.00068052614,0.0019799336,0.0012995277,0.0008400605,0.0017666707],"category_scores_gemma":[0.0035557717,0.0003545374,0.0005398104,0.00024655304,0.0011774012,0.0028625233,0.0012464586,0.0014617007,0.0011119208],"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.0010579771,0.00048987614,0.010766977,0.0008990828,0.00015480333,0.0025272856,0.0037314205,0.018795652,0.34368452,0.15580074,0.006645236,0.45544648],"study_design_scores_gemma":[0.00029015655,0.0016710673,0.004784206,0.00043968606,0.0003989778,0.0047660745,0.0008863836,0.34860322,0.46408853,0.021510333,0.15221009,0.00035125992],"about_ca_topic_score_codex":0.0023764928,"about_ca_topic_score_gemma":0.0021297236,"teacher_disagreement_score":0.0023764928,"about_ca_system_score_codex":0.0007387639,"about_ca_system_score_gemma":0.0010891452,"threshold_uncertainty_score":0.008069575},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014403442,0.86340135,0.09535441,0.0065932064,0.0005745473,0.00010739381,0.00025210957,0.00088958134,0.018423982],"genre_scores_gemma":[0.12989968,0.80690795,0.05586787,0.0018273754,0.0012684743,0.00013658506,0.00045767787,0.0002456265,0.003388726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937735,0.0011694607,0.0007119759,0.0013823122,0.0024572718,0.0005054511],"domain_scores_gemma":[0.9715546,0.020428317,0.0023405286,0.0028534774,0.0024756957,0.00034732945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065957396,0.0010966987,0.0021262486,0.0037968825,0.00068213325,0.0035610758,0.00256119,0.0021862711,0.0027425718],"category_scores_gemma":[0.020820271,0.0011675017,0.0011896958,0.004615424,0.0021184243,0.008924731,0.0013433076,0.002966877,0.0011388661],"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.00017609388,0.00013032371,0.004716588,0.0047989576,0.00010054734,0.00010779361,0.00030570588,0.0031969366,0.0028231102,0.07496863,0.008949665,0.89972574],"study_design_scores_gemma":[0.00014058713,0.000516796,0.012554934,0.010990077,0.0006359401,0.002445447,0.0010812759,0.028399551,0.025048243,0.13575791,0.78221977,0.00020942268],"about_ca_topic_score_codex":0.0017509302,"about_ca_topic_score_gemma":0.0012056867,"teacher_disagreement_score":0.0065957396,"about_ca_system_score_codex":0.001812042,"about_ca_system_score_gemma":0.0036429341,"threshold_uncertainty_score":0.03488207},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020309847,0.0008307006,0.8250321,0.0021679848,0.00067104667,0.0013917503,0.0043000816,0.121708125,0.023588262],"genre_scores_gemma":[0.059855506,0.00069014484,0.88830227,0.00057426404,0.00026044188,0.0010611655,0.008639906,0.023963187,0.016653072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99605983,0.0012268622,0.00042766333,0.0005748251,0.0014057863,0.00030497042],"domain_scores_gemma":[0.9755592,0.012033777,0.00071089977,0.004767644,0.005266241,0.0016623138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005176254,0.0011394948,0.0013453703,0.0015407277,0.0017958619,0.005043973,0.003990667,0.00163159,0.021793956],"category_scores_gemma":[0.02188732,0.0015206373,0.0011858337,0.002001656,0.00093167677,0.014296824,0.005087726,0.004588888,0.013784088],"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.0021436468,0.0027808738,0.0032489856,0.0034392728,0.00020051106,0.0006390613,0.0021048891,0.0033960126,0.029593358,0.07557372,0.26499426,0.6118854],"study_design_scores_gemma":[0.0008957794,0.001276665,0.0026582784,0.00054853957,0.00030763357,0.002541609,0.0010552484,0.09548881,0.06510413,0.037727945,0.7920738,0.00032147553],"about_ca_topic_score_codex":0.0015912502,"about_ca_topic_score_gemma":0.0033609984,"teacher_disagreement_score":0.021793956,"about_ca_system_score_codex":0.0008951003,"about_ca_system_score_gemma":0.0027130742,"threshold_uncertainty_score":0.072908044},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055895675,0.006486631,0.80807775,0.038118668,0.002460991,0.00020707214,0.00029757252,0.00091046985,0.087545246],"genre_scores_gemma":[0.84709626,0.0038288124,0.11582765,0.0017148898,0.0021734282,0.00032478242,0.00021608162,0.00020877381,0.028609388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916318,0.0029283406,0.0007782957,0.0009900447,0.0027510894,0.000920356],"domain_scores_gemma":[0.9812712,0.010928913,0.0010910407,0.0041529387,0.0019874624,0.00056841865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007897176,0.0006199279,0.00068456854,0.0018196589,0.0024890916,0.010413747,0.0016215375,0.0033101423,0.0070128744],"category_scores_gemma":[0.023808273,0.0008453248,0.0015319386,0.001591798,0.00726144,0.014221563,0.0033218123,0.007507248,0.0013293929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035383677,0.000020776466,0.00013902396,0.00004192745,0.0000068058243,0.000034605077,0.00024736923,0.0009056256,0.0005421724,0.9866273,0.0014640582,0.009934962],"study_design_scores_gemma":[0.000032834567,0.000030389781,0.00025970157,0.00010926355,0.000021889125,0.00014788321,0.00010182258,0.011428095,0.0025955436,0.96234685,0.02289243,0.000033232984],"about_ca_topic_score_codex":0.0020254306,"about_ca_topic_score_gemma":0.0008681203,"teacher_disagreement_score":0.010413747,"about_ca_system_score_codex":0.0038150377,"about_ca_system_score_gemma":0.005028366,"threshold_uncertainty_score":0.041764796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4136006,0.0010010169,0.56073385,0.0006258092,0.00029490475,0.00030817735,0.00005586478,0.009418928,0.013960918],"genre_scores_gemma":[0.83471555,0.00061166915,0.16047455,0.000118313605,0.00007416101,0.00010269329,0.00007945049,0.00045312304,0.0033705262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570674,0.0011775721,0.000302139,0.0002752059,0.0020268622,0.00051149423],"domain_scores_gemma":[0.9911378,0.0019574394,0.0010275512,0.0042164545,0.00143144,0.00022928171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030854137,0.00044837504,0.0004727201,0.00058413966,0.00066578446,0.0018934023,0.0017794399,0.0006307933,0.0014134968],"category_scores_gemma":[0.010601054,0.000649853,0.00055932644,0.0003878551,0.0014745101,0.004006052,0.0019586885,0.0017598924,0.0008030923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022490975,0.0005918413,0.019912194,0.0010161132,0.00038089967,0.002213287,0.0032206913,0.18906352,0.18577234,0.2253066,0.008727878,0.3615455],"study_design_scores_gemma":[0.00034517905,0.0011866114,0.0034515304,0.00031306784,0.0002882759,0.0009676521,0.00029669638,0.6977476,0.2165563,0.03185642,0.046878453,0.000112316906],"about_ca_topic_score_codex":0.0010686824,"about_ca_topic_score_gemma":0.00080115243,"teacher_disagreement_score":0.0030854137,"about_ca_system_score_codex":0.0008810288,"about_ca_system_score_gemma":0.0020542871,"threshold_uncertainty_score":0.016317427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01436573,0.00007031643,0.9719284,0.00018193614,0.000047598354,0.00013385482,0.00033391287,0.011321154,0.0016171546],"genre_scores_gemma":[0.2175905,0.00022102172,0.77667004,0.00024316172,0.0000840681,0.00027010933,0.0017982388,0.0016121062,0.0015107703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98816514,0.003073578,0.00085983006,0.0019265838,0.0050264653,0.00094838825],"domain_scores_gemma":[0.9668742,0.019374691,0.0023441995,0.005376242,0.0057779523,0.00025270073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006781374,0.0020459362,0.0015651672,0.0066782027,0.0020896003,0.0030090855,0.003140175,0.0018022321,0.005074629],"category_scores_gemma":[0.03873648,0.00196655,0.003750249,0.0017199207,0.0030942352,0.0049939607,0.0034944538,0.00266028,0.0015646562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006873355,0.0004454996,0.015604008,0.0011847365,0.0005017794,0.0020097343,0.0022028491,0.16930293,0.06492281,0.2637406,0.012960183,0.46643752],"study_design_scores_gemma":[0.00012890181,0.00013091587,0.0013366693,0.00023719165,0.00026263235,0.00035868023,0.00025856335,0.7402803,0.08690936,0.154434,0.015502087,0.00016067935],"about_ca_topic_score_codex":0.012487129,"about_ca_topic_score_gemma":0.018231556,"teacher_disagreement_score":0.012487129,"about_ca_system_score_codex":0.0028838576,"about_ca_system_score_gemma":0.0060300063,"threshold_uncertainty_score":0.035863757},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027736053,0.0026397265,0.3071645,0.0017971694,0.0012302424,0.001037262,0.012726148,0.49792054,0.17271088],"genre_scores_gemma":[0.08243297,0.008427346,0.38887268,0.008403551,0.0016656313,0.0031347838,0.062043123,0.11957696,0.32544297],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819285,0.00028470732,0.00022411793,0.00025555873,0.00079617434,0.0002466878],"domain_scores_gemma":[0.99702305,0.00050340116,0.00022537487,0.0013435199,0.00066736137,0.00023732227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020305116,0.0016156319,0.00092650263,0.0016869626,0.00088420353,0.0027777913,0.0033932081,0.0013771147,0.08338568],"category_scores_gemma":[0.005923983,0.0011979236,0.00091988756,0.0016933574,0.00092962536,0.0055121174,0.0031962818,0.0041434765,0.07638433],"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.0004071895,0.000102154205,0.00060876645,0.00072697387,0.000058258414,0.00032047523,0.00025987843,0.0016061375,0.008341497,0.043153826,0.6834915,0.2609233],"study_design_scores_gemma":[0.0000855002,0.000053544165,0.0005790728,0.00018492505,0.000023765584,0.00036757556,0.00003163402,0.0052328664,0.0059681954,0.018517688,0.9688665,0.00008864461],"about_ca_topic_score_codex":0.0018606952,"about_ca_topic_score_gemma":0.001632953,"teacher_disagreement_score":0.08338568,"about_ca_system_score_codex":0.0008477249,"about_ca_system_score_gemma":0.0013069279,"threshold_uncertainty_score":0.2789529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01102418,0.0005057288,0.9698695,0.0020269176,0.00016728873,0.00020540437,0.000117218515,0.0019448075,0.014138895],"genre_scores_gemma":[0.57865876,0.0012796824,0.4040399,0.0008757076,0.00034084954,0.0008338492,0.0005156237,0.00038537808,0.013070322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880684,0.0047449647,0.0013292813,0.0014862885,0.0036337147,0.0007374282],"domain_scores_gemma":[0.97663873,0.010377413,0.0021251703,0.006554371,0.003779769,0.0005245485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069234325,0.00069840375,0.000717015,0.0019526725,0.0022044952,0.0046382495,0.0016281417,0.0027680313,0.0040970193],"category_scores_gemma":[0.032827213,0.00074720476,0.0015688706,0.0017056974,0.006199206,0.00726033,0.0038124667,0.004618794,0.0015158065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006842675,0.000055163433,0.00074081536,0.00016372078,0.000017908056,0.00018934069,0.0006657843,0.008617886,0.0020762659,0.95831954,0.0016240036,0.027461167],"study_design_scores_gemma":[0.000051649677,0.00009441599,0.00051994907,0.0002122738,0.00006461439,0.00045360668,0.00022097981,0.15791681,0.0072155604,0.7947707,0.03841063,0.00006864601],"about_ca_topic_score_codex":0.0054140617,"about_ca_topic_score_gemma":0.0028766873,"teacher_disagreement_score":0.0069234325,"about_ca_system_score_codex":0.0030384143,"about_ca_system_score_gemma":0.00400093,"threshold_uncertainty_score":0.036615074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0833636,0.00069469825,0.8967062,0.0006806927,0.0001602633,0.0004931385,0.00031614964,0.012867717,0.0047174315],"genre_scores_gemma":[0.8712599,0.00034498514,0.12611525,0.00016898962,0.00007553756,0.00015074547,0.00031002698,0.0001509011,0.0014235885],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9930012,0.002198483,0.000588738,0.0010570738,0.0025536935,0.0006007694],"domain_scores_gemma":[0.9759409,0.00875406,0.0037752297,0.008380591,0.0026472572,0.0005020209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005671876,0.0006410552,0.0008263919,0.0027122796,0.00094241754,0.003000171,0.0014035519,0.0008044377,0.00081747153],"category_scores_gemma":[0.020689655,0.0004923114,0.0005268229,0.0015508499,0.0012140053,0.0053619477,0.0020091964,0.0015414505,0.00034060498],"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.0011872994,0.0006887547,0.026334045,0.00032419854,0.00012737127,0.00043798474,0.0008439518,0.083732516,0.028487446,0.05799472,0.0070059644,0.79283583],"study_design_scores_gemma":[0.00009081556,0.00023656263,0.0045639994,0.00012025993,0.0000730962,0.00033853212,0.00010256559,0.8729703,0.06531975,0.04553917,0.010537801,0.00010725926],"about_ca_topic_score_codex":0.0030947132,"about_ca_topic_score_gemma":0.0019267182,"teacher_disagreement_score":0.005671876,"about_ca_system_score_codex":0.0013013583,"about_ca_system_score_gemma":0.0034615316,"threshold_uncertainty_score":0.029996097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06654826,0.002223301,0.75383717,0.0015149988,0.0015953328,0.0020572478,0.0007668727,0.072702214,0.09875454],"genre_scores_gemma":[0.6818829,0.0023102495,0.21636492,0.0026595513,0.0006247973,0.0014904083,0.002472557,0.0069560204,0.08523861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485296,0.0008012409,0.00050855667,0.0008831867,0.0019604354,0.000993722],"domain_scores_gemma":[0.98924595,0.0020446936,0.0011552001,0.005348386,0.0016298391,0.0005758703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039643464,0.0013098358,0.0008491417,0.0016884932,0.0018999251,0.005031903,0.0038484088,0.0025217612,0.020174585],"category_scores_gemma":[0.011445078,0.0011455362,0.0012889691,0.00094601774,0.0016208105,0.0068851663,0.005035196,0.0029280584,0.008788181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002084941,0.0015917423,0.016637888,0.0014857383,0.0003512829,0.0019371335,0.0020988157,0.010868511,0.07828462,0.32929742,0.08848136,0.46688065],"study_design_scores_gemma":[0.00042066272,0.00065247476,0.003613268,0.0005441232,0.0003307281,0.0020000907,0.00031185962,0.05987598,0.14553005,0.05386088,0.7326467,0.00021309553],"about_ca_topic_score_codex":0.0014127406,"about_ca_topic_score_gemma":0.0008581022,"teacher_disagreement_score":0.020174585,"about_ca_system_score_codex":0.0011263733,"about_ca_system_score_gemma":0.0022480248,"threshold_uncertainty_score":0.06749076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023222957,0.0002488216,0.9537066,0.00026490405,0.00014217965,0.00012641211,0.00063593284,0.017537119,0.0041149855],"genre_scores_gemma":[0.39943317,0.0004008118,0.58743936,0.0006116235,0.00023310486,0.00028025746,0.0009420098,0.00582977,0.0048299115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995509,0.00057976076,0.00043493693,0.00073847134,0.0022514611,0.00048627955],"domain_scores_gemma":[0.98685104,0.0059464937,0.0018540514,0.0031587584,0.0019968424,0.00019279707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028061995,0.0013227679,0.0010095139,0.0027738567,0.0014100315,0.0021303005,0.002036711,0.0016156335,0.0050696363],"category_scores_gemma":[0.01792431,0.00092136295,0.001680417,0.0013061608,0.0025672135,0.004183344,0.0020163648,0.002347613,0.0013093131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026663898,0.00026985075,0.027899688,0.0017403484,0.00026769584,0.0019635148,0.0013989635,0.102592915,0.058585405,0.38730195,0.025604209,0.38970906],"study_design_scores_gemma":[0.00018002433,0.0002674064,0.0060460456,0.0005739056,0.0004614329,0.0011118083,0.00015485848,0.48759818,0.21186297,0.21666631,0.07470154,0.00037551046],"about_ca_topic_score_codex":0.008839338,"about_ca_topic_score_gemma":0.0074559664,"teacher_disagreement_score":0.008839338,"about_ca_system_score_codex":0.0015151802,"about_ca_system_score_gemma":0.0039040092,"threshold_uncertainty_score":0.0175758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008773868,0.00058877555,0.9355242,0.0057405513,0.0003910058,0.00015873845,0.0006579102,0.0008238534,0.04734113],"genre_scores_gemma":[0.5671376,0.0030193941,0.39406908,0.0046421452,0.0009950778,0.0006950659,0.001476346,0.00058260653,0.027382702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963142,0.0010256896,0.00024693366,0.00041606007,0.0016143536,0.00038280134],"domain_scores_gemma":[0.99270153,0.004338144,0.00036413892,0.0011711977,0.0011983255,0.0002266855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041851783,0.00097165845,0.0006872454,0.0013448712,0.002228751,0.0032015946,0.0014517502,0.0018651694,0.009773118],"category_scores_gemma":[0.009640825,0.0010178146,0.0029492374,0.0011551066,0.0045332215,0.007895887,0.005591102,0.0065947375,0.0017331791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001803819,0.000023500806,0.00009870939,0.00008509752,0.000012914582,0.00014055266,0.00019013455,0.0045629465,0.0007737149,0.9869294,0.0026551962,0.0045096315],"study_design_scores_gemma":[0.000040700852,0.000032607633,0.000085717846,0.00010611302,0.000024968447,0.00017971266,0.00007134467,0.024324918,0.0028140317,0.9363961,0.035895538,0.000028207502],"about_ca_topic_score_codex":0.0029098198,"about_ca_topic_score_gemma":0.002199844,"teacher_disagreement_score":0.009773118,"about_ca_system_score_codex":0.0029123276,"about_ca_system_score_gemma":0.0034716325,"threshold_uncertainty_score":0.03269428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42982787,0.00057186896,0.5559604,0.00032541913,0.00011812026,0.00014123885,0.00005185635,0.0028175905,0.010185704],"genre_scores_gemma":[0.957526,0.00011290549,0.040207814,0.000067670684,0.000019881963,0.00002779812,0.000033940552,0.00004319275,0.0019608128],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989035,0.00030656328,0.00007699503,0.00010964467,0.00045130344,0.00015193997],"domain_scores_gemma":[0.9960337,0.00082148676,0.0005835881,0.002033904,0.00045382447,0.00007342995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059096864,0.00037563065,0.0005218536,0.0005221275,0.00038293275,0.00049195206,0.0010681805,0.00077165605,0.0012436747],"category_scores_gemma":[0.0034630501,0.000251199,0.00036430673,0.00036527196,0.0009993522,0.001286404,0.0014773598,0.00078814535,0.0004695314],"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.0008628275,0.0002530593,0.009573317,0.00062446273,0.00022952573,0.0018433927,0.0011590729,0.080919474,0.329573,0.17696553,0.0060412204,0.3919551],"study_design_scores_gemma":[0.00011214769,0.0012535158,0.0030708693,0.000056726953,0.00010522167,0.002921531,0.00010825119,0.4142477,0.53500664,0.023757126,0.019270984,0.00008931469],"about_ca_topic_score_codex":0.00010225002,"about_ca_topic_score_gemma":0.00013525871,"teacher_disagreement_score":0.0012436747,"about_ca_system_score_codex":0.00024596747,"about_ca_system_score_gemma":0.00033389448,"threshold_uncertainty_score":0.0041605234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078179274,0.00024520635,0.9950317,0.00025150526,0.000079531266,0.00011409388,0.00002918251,0.0009381692,0.0025287352],"genre_scores_gemma":[0.09970456,0.00091563805,0.8895371,0.00028220212,0.00030382856,0.00055306056,0.00024602393,0.00024131166,0.008216252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963229,0.0008158512,0.0004127017,0.00045910545,0.0016306626,0.00035887514],"domain_scores_gemma":[0.99659723,0.00077094487,0.0003532162,0.0012973703,0.0007234598,0.00025773942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056715324,0.0009533859,0.0010062763,0.0016909514,0.0022633485,0.005393347,0.004557909,0.002402437,0.0049849227],"category_scores_gemma":[0.006231684,0.0010169161,0.001733042,0.0014747861,0.0033312426,0.0074161687,0.004384511,0.004264238,0.0031366735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084032494,0.00008949923,0.00020285977,0.00017995878,0.000045131634,0.00024356013,0.0003154639,0.021769363,0.0044759098,0.8891157,0.006991948,0.07648659],"study_design_scores_gemma":[0.00013010258,0.00017451422,0.0001606125,0.00016772549,0.00008008534,0.00091870537,0.00011324192,0.34901077,0.010255567,0.49014476,0.14871834,0.0001255109],"about_ca_topic_score_codex":0.0015166056,"about_ca_topic_score_gemma":0.0015448572,"teacher_disagreement_score":0.0056715324,"about_ca_system_score_codex":0.0020026718,"about_ca_system_score_gemma":0.0037693062,"threshold_uncertainty_score":0.029994309},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083527185,0.0010823921,0.90902245,0.00049826346,0.000035918445,0.00010108674,0.00029616614,0.0021537838,0.0032828234],"genre_scores_gemma":[0.7855122,0.001089043,0.20937793,0.0001822391,0.000083138,0.00013352073,0.00044255162,0.00047370902,0.002705664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855226,0.00032751847,0.000096550946,0.00026667595,0.0005615996,0.00019540859],"domain_scores_gemma":[0.99537164,0.0018398418,0.0007768631,0.0013081272,0.00060850335,0.00009504913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017957473,0.000796774,0.0005651176,0.003828235,0.0007532024,0.0031136316,0.0014109133,0.0011476558,0.001979275],"category_scores_gemma":[0.009806622,0.00061107374,0.0009880272,0.0014576974,0.0036640235,0.0068866797,0.0022450106,0.0012144592,0.00043137855],"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.0004710339,0.00019353091,0.01853928,0.0005892846,0.00018162176,0.0018985168,0.0024521335,0.13676503,0.043936096,0.49560007,0.0028677166,0.29650575],"study_design_scores_gemma":[0.000032064672,0.00016356156,0.0038294625,0.00028432594,0.00014631936,0.0011743639,0.0007484286,0.5457341,0.06158458,0.37357938,0.012610555,0.000112873684],"about_ca_topic_score_codex":0.0030246237,"about_ca_topic_score_gemma":0.0014350715,"teacher_disagreement_score":0.003828235,"about_ca_system_score_codex":0.0011180817,"about_ca_system_score_gemma":0.0016796795,"threshold_uncertainty_score":0.009496987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36730933,0.003869437,0.58411497,0.0009497867,0.0005601471,0.00087083795,0.0002368575,0.025325201,0.016763413],"genre_scores_gemma":[0.9109348,0.0008816456,0.07006483,0.0003639741,0.000102272235,0.00019981526,0.00023698481,0.0004497164,0.016765937],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987638,0.00013974616,0.000120625176,0.0001957322,0.00048494982,0.00029524424],"domain_scores_gemma":[0.9936127,0.0008552787,0.0010117618,0.0029893068,0.0012702724,0.00026075446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000724084,0.0009464501,0.00056578586,0.0013058095,0.001323081,0.0026714162,0.002522955,0.0012403434,0.0058027604],"category_scores_gemma":[0.00271987,0.00068522815,0.0004531237,0.0006688072,0.0015245795,0.004258679,0.0024284546,0.0018503001,0.0025299739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002917655,0.0005929436,0.008631015,0.00080150017,0.00019382712,0.0013009061,0.0023699712,0.018368138,0.5100341,0.06978136,0.019613324,0.36539522],"study_design_scores_gemma":[0.00011472038,0.0014148881,0.0036562674,0.00017880702,0.00028151038,0.0028524818,0.00047982574,0.15174873,0.75164044,0.018005384,0.06937151,0.00025547933],"about_ca_topic_score_codex":0.0012550475,"about_ca_topic_score_gemma":0.001566079,"teacher_disagreement_score":0.0058027604,"about_ca_system_score_codex":0.0016267635,"about_ca_system_score_gemma":0.0011028675,"threshold_uncertainty_score":0.01941216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01301082,0.00815652,0.78645027,0.002803907,0.0013203775,0.00039841462,0.0007213187,0.007464645,0.17967372],"genre_scores_gemma":[0.55583555,0.012316904,0.33572376,0.0022464553,0.0016868938,0.0009958446,0.0020960784,0.0019526524,0.0871459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760866,0.00049245637,0.00020355597,0.0003576543,0.0010597579,0.00027793818],"domain_scores_gemma":[0.99616903,0.000810204,0.00026286385,0.0013989861,0.0011755455,0.00018333535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018039733,0.0006995088,0.0005721432,0.0016086133,0.0013484958,0.0030078085,0.00176417,0.001608023,0.012939448],"category_scores_gemma":[0.0062282006,0.0004334292,0.00082720886,0.0023668725,0.002098929,0.004688315,0.0032906295,0.00225112,0.0067592137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017474078,0.000045779423,0.00039162798,0.00027443303,0.00001544059,0.00013210319,0.0003010828,0.007954661,0.003562151,0.8561023,0.014264669,0.1167811],"study_design_scores_gemma":[0.00003849614,0.00015062983,0.00027747027,0.0002435076,0.00005974147,0.00053739536,0.00016121738,0.0779514,0.019307131,0.3674585,0.53370005,0.00011450617],"about_ca_topic_score_codex":0.0034399438,"about_ca_topic_score_gemma":0.001135979,"teacher_disagreement_score":0.012939448,"about_ca_system_score_codex":0.00203954,"about_ca_system_score_gemma":0.0022647304,"threshold_uncertainty_score":0.0432868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009352393,0.00044586786,0.9843426,0.00050943554,0.00007350228,0.00020463538,0.00010633133,0.0023744903,0.0025906924],"genre_scores_gemma":[0.32044515,0.00072931394,0.67458594,0.00019948545,0.00013232711,0.000707034,0.00032888935,0.00032610729,0.00254578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398696,0.002370989,0.00047961454,0.00047851485,0.00246561,0.00021832192],"domain_scores_gemma":[0.9888021,0.0057252385,0.0019505679,0.0017456553,0.0014900898,0.00028646004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007970734,0.0006234245,0.0006073907,0.0015232046,0.0011276369,0.002343655,0.0013154035,0.0012985286,0.0021835838],"category_scores_gemma":[0.024590986,0.0005542117,0.0008664907,0.0011669103,0.002108305,0.003204923,0.0015069211,0.00224159,0.00042855454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004182791,0.000106055864,0.004722938,0.00029287208,0.000081336715,0.00048007752,0.0007718113,0.09433547,0.011514039,0.7312648,0.0059849955,0.15002729],"study_design_scores_gemma":[0.00004987969,0.0001094868,0.00077448046,0.00012207334,0.000046870773,0.00021668008,0.000040295803,0.8394133,0.0100402,0.12624173,0.022878993,0.00006597495],"about_ca_topic_score_codex":0.0042129606,"about_ca_topic_score_gemma":0.002915653,"teacher_disagreement_score":0.007970734,"about_ca_system_score_codex":0.0022429384,"about_ca_system_score_gemma":0.003601181,"threshold_uncertainty_score":0.042153776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014240907,0.0005261247,0.99530506,0.00026084113,0.000050915933,0.000055527013,0.000050710754,0.00030023174,0.0020265519],"genre_scores_gemma":[0.20619768,0.0028432282,0.7847206,0.0004389481,0.00046481844,0.00074364035,0.000558289,0.0003413112,0.0036915098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646336,0.0014290708,0.00032241223,0.0003239514,0.001171942,0.00028934103],"domain_scores_gemma":[0.9966799,0.0019196623,0.00027071437,0.0007427586,0.00028420798,0.00010288239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160967,0.0014756557,0.0010468564,0.0013762986,0.0011487484,0.002695366,0.0027021489,0.0015077342,0.0027078756],"category_scores_gemma":[0.006860113,0.0007608845,0.002567072,0.0012311337,0.004067454,0.0044845254,0.0017901822,0.0035749634,0.0007258173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014650109,0.000043866345,0.000208837,0.00015332353,0.000033749646,0.000113674345,0.00018215158,0.042149015,0.0015214537,0.9443234,0.00079411734,0.010461686],"study_design_scores_gemma":[0.000034034514,0.00003564263,0.00009453031,0.00013192826,0.000054603297,0.0001321674,0.000066862514,0.21478397,0.0020045512,0.75934076,0.02329513,0.000025856854],"about_ca_topic_score_codex":0.0039633093,"about_ca_topic_score_gemma":0.002416736,"teacher_disagreement_score":0.004160967,"about_ca_system_score_codex":0.0022736273,"about_ca_system_score_gemma":0.0032243473,"threshold_uncertainty_score":0.022005558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003918493,0.00006487434,0.9926709,0.00011430648,0.000038290284,0.00010510531,0.00004331631,0.0009649353,0.0020798065],"genre_scores_gemma":[0.24342409,0.00019886912,0.7509664,0.0002635975,0.00010835706,0.00049129507,0.00018556006,0.0002764291,0.0040853205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977927,0.00062239286,0.00017702604,0.00045719382,0.00074385887,0.00020679651],"domain_scores_gemma":[0.994666,0.0033054387,0.00043283103,0.0007459638,0.0007225449,0.00012726824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037825133,0.00088938104,0.0005332527,0.003676669,0.0010148939,0.0016467159,0.0012853299,0.0010429005,0.00339178],"category_scores_gemma":[0.009171958,0.00049415743,0.0013329554,0.0010902766,0.002926039,0.0046925023,0.0013868753,0.0018932635,0.000535027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019059672,0.00012502845,0.0014420301,0.00019321342,0.00005639635,0.00016737757,0.0004165749,0.024715062,0.009438066,0.8215457,0.0019264498,0.13978349],"study_design_scores_gemma":[0.00008351797,0.00023057235,0.00064988644,0.0001421133,0.00011612475,0.00042127544,0.00007122419,0.47371674,0.036246084,0.45159528,0.03662736,0.00009986893],"about_ca_topic_score_codex":0.0012814818,"about_ca_topic_score_gemma":0.00070709933,"teacher_disagreement_score":0.0037825133,"about_ca_system_score_codex":0.0016664093,"about_ca_system_score_gemma":0.0015682994,"threshold_uncertainty_score":0.020004094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035963908,0.00393003,0.37211746,0.0015422764,0.002759888,0.0023593812,0.0072496505,0.35462376,0.21945372],"genre_scores_gemma":[0.4066876,0.0025204911,0.13924384,0.003719847,0.00068427494,0.0021339438,0.014697379,0.0482792,0.38203347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998033,0.00018085867,0.000178649,0.00035117337,0.0009392095,0.00031714118],"domain_scores_gemma":[0.9955206,0.00068307767,0.00029397194,0.0022455815,0.0010482557,0.00020857998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080118835,0.001621905,0.00081588246,0.0014599041,0.0010762274,0.0028878532,0.0033298086,0.0017848136,0.058011305],"category_scores_gemma":[0.0062934076,0.0010250552,0.0008663899,0.00052391196,0.0013469748,0.0052556894,0.0052835564,0.0020287973,0.04188352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030382061,0.0002671428,0.0046997727,0.0021689094,0.00013544635,0.0023515911,0.0019418075,0.0023127696,0.035925977,0.059173316,0.37540087,0.5125842],"study_design_scores_gemma":[0.0002029501,0.00042146287,0.001991556,0.00026229653,0.000089739806,0.0019206117,0.00023793889,0.016351072,0.068205096,0.01376538,0.8963376,0.00021435252],"about_ca_topic_score_codex":0.0018482431,"about_ca_topic_score_gemma":0.0024398908,"teacher_disagreement_score":0.058011305,"about_ca_system_score_codex":0.00068908173,"about_ca_system_score_gemma":0.0010635696,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005435221,0.00007438768,0.9975204,0.00008912809,0.000015251335,0.000035800826,0.00004325101,0.0009446705,0.0007336226],"genre_scores_gemma":[0.06510083,0.00048357187,0.9291278,0.00017414632,0.00011724928,0.00027984005,0.00039586544,0.0008822079,0.003438507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957183,0.0008948478,0.00046262663,0.0007005782,0.0018780315,0.00034566096],"domain_scores_gemma":[0.9964371,0.0008068511,0.00021667489,0.0015567553,0.0008166754,0.00016603584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004268046,0.001312812,0.0011901123,0.0023820186,0.0011113621,0.0043960833,0.003409007,0.0014361009,0.0046533295],"category_scores_gemma":[0.0066524344,0.001057893,0.0027922913,0.0014108953,0.0023617034,0.006260862,0.0038200554,0.0035324052,0.0024024667],"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.00007252421,0.00011418008,0.00078008993,0.00029099212,0.00010042502,0.00030545337,0.00068320375,0.03385064,0.006774496,0.8507225,0.004497161,0.10180838],"study_design_scores_gemma":[0.000040710536,0.00008669587,0.00033866437,0.0001764406,0.0000837645,0.00040904284,0.00016557888,0.25314558,0.0076448754,0.6530403,0.08477358,0.00009482325],"about_ca_topic_score_codex":0.0026143617,"about_ca_topic_score_gemma":0.0015697394,"teacher_disagreement_score":0.0046533295,"about_ca_system_score_codex":0.0014470394,"about_ca_system_score_gemma":0.002814332,"threshold_uncertainty_score":0.022571862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23983055,0.0016095958,0.6273245,0.009234413,0.000889077,0.001726431,0.00021323975,0.05670199,0.06247018],"genre_scores_gemma":[0.76069534,0.00040368192,0.2203092,0.0030128097,0.00022766284,0.00024194678,0.00034464168,0.0018493922,0.012915267],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962943,0.00061790994,0.00022235383,0.00046873544,0.0016195303,0.000777134],"domain_scores_gemma":[0.9937663,0.0006060186,0.00065243914,0.003194866,0.0011543137,0.00062609883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019109552,0.000652383,0.00055849244,0.00078404334,0.0012832163,0.004542061,0.0018448225,0.0012242822,0.0073007075],"category_scores_gemma":[0.00597619,0.0005606442,0.0005890954,0.00028985314,0.0013493198,0.0067529394,0.0055713565,0.0029220977,0.0032146224],"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.0013907381,0.0022197326,0.016345927,0.00068196945,0.00021390112,0.0010856747,0.0013239008,0.014795618,0.27219036,0.07402709,0.05972413,0.55600095],"study_design_scores_gemma":[0.0005669593,0.002354243,0.020681348,0.0004339096,0.0002631273,0.0027133464,0.0009161266,0.29009652,0.27427295,0.042426135,0.36487132,0.00040403727],"about_ca_topic_score_codex":0.0011151779,"about_ca_topic_score_gemma":0.0013980197,"teacher_disagreement_score":0.0073007075,"about_ca_system_score_codex":0.0008287521,"about_ca_system_score_gemma":0.002104473,"threshold_uncertainty_score":0.024423301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022820733,0.0002856611,0.95404506,0.00011870949,0.00014488741,0.000051815638,0.0000584859,0.0007275618,0.021747116],"genre_scores_gemma":[0.64863795,0.00043801952,0.33453107,0.00011362506,0.00006383995,0.00016901546,0.00016850559,0.0002552719,0.015622705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970657,0.00006533876,0.000019300513,0.00006316932,0.000120234035,0.000025311923],"domain_scores_gemma":[0.99965024,0.00015195961,0.000027716744,0.00008478889,0.00006885916,0.000016341764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034414788,0.0004785645,0.00041628152,0.0002203108,0.0003719933,0.0009334792,0.0006493828,0.00044183648,0.004911046],"category_scores_gemma":[0.0010322443,0.00031500836,0.00035720467,0.00018278146,0.0004399853,0.0006437954,0.0007185846,0.0005268292,0.00086410786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002769899,0.00012916488,0.00038379245,0.000549205,0.00007809764,0.0003741947,0.00042041513,0.27773464,0.14173369,0.41448566,0.002618714,0.16121545],"study_design_scores_gemma":[0.000117457595,0.00019786794,0.0001718618,0.0000614348,0.00005880544,0.00020191088,0.0000693978,0.729119,0.08220884,0.15931274,0.028457893,0.00002279605],"about_ca_topic_score_codex":0.00018340156,"about_ca_topic_score_gemma":0.00040766306,"teacher_disagreement_score":0.004911046,"about_ca_system_score_codex":0.00038681622,"about_ca_system_score_gemma":0.0003750004,"threshold_uncertainty_score":0.016429067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056719027,0.001171197,0.68957,0.007332136,0.0007590635,0.0008696085,0.003952191,0.006824594,0.2328022],"genre_scores_gemma":[0.5911267,0.0017431292,0.2741842,0.002457366,0.00025100473,0.0012616817,0.004126249,0.0010074507,0.12384215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998142,0.00042008635,0.00014821664,0.00035401896,0.0006568183,0.0002788391],"domain_scores_gemma":[0.99782926,0.0005811847,0.00018058358,0.00067070435,0.00055680133,0.00018150956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019099832,0.00052930514,0.00041913477,0.0011033271,0.0008954304,0.004400184,0.0018140269,0.0017911743,0.016132236],"category_scores_gemma":[0.0037295278,0.00041555736,0.00081804115,0.0008985513,0.0010416529,0.0059718266,0.0015525623,0.002221309,0.004720795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029039613,0.00019022262,0.0015682947,0.0001847233,0.000025279849,0.00030431393,0.00039617566,0.03164649,0.0042024152,0.909807,0.012864941,0.038519707],"study_design_scores_gemma":[0.00031097414,0.00018283326,0.001002149,0.00021353674,0.000076582655,0.00053748756,0.0004119657,0.344963,0.0071904403,0.33724642,0.3077732,0.00009138582],"about_ca_topic_score_codex":0.007376774,"about_ca_topic_score_gemma":0.006304962,"teacher_disagreement_score":0.016132236,"about_ca_system_score_codex":0.0026498693,"about_ca_system_score_gemma":0.0042253416,"threshold_uncertainty_score":0.053967714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111428285,0.00072448084,0.9798418,0.0007605741,0.00006441961,0.000038985894,0.00017251572,0.000098828605,0.0071554887],"genre_scores_gemma":[0.6892053,0.0020176324,0.29992086,0.00032032438,0.0006483866,0.00032900792,0.0004589006,0.00022987246,0.0068696258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604285,0.0017059598,0.00029061295,0.00052536663,0.0011299506,0.0003053217],"domain_scores_gemma":[0.9828205,0.013708447,0.0007598019,0.0011861771,0.0012266891,0.00029835393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006348113,0.000897802,0.0010803482,0.0023809082,0.0010418053,0.004268911,0.0020036595,0.0012184364,0.0063712485],"category_scores_gemma":[0.017426973,0.0007793174,0.0021319846,0.0021459411,0.00377357,0.010672425,0.0022887483,0.003224948,0.00045150903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018045877,0.000011393556,0.0001345811,0.000044872195,0.000016438797,0.000028529876,0.00007268107,0.019908067,0.00024928464,0.97386307,0.00029853793,0.0053545046],"study_design_scores_gemma":[0.0000044515914,0.000009858465,0.000069946494,0.000019523353,0.000010283739,0.000024451252,0.000013197192,0.092058234,0.00026675832,0.9068652,0.00064917543,0.000009014847],"about_ca_topic_score_codex":0.0012530646,"about_ca_topic_score_gemma":0.0008844071,"teacher_disagreement_score":0.0063712485,"about_ca_system_score_codex":0.0026939143,"about_ca_system_score_gemma":0.001693775,"threshold_uncertainty_score":0.033572435},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039188262,0.000050176604,0.9497344,0.0001331392,0.00006136028,0.00011749078,0.00020703368,0.009181445,0.0013265613],"genre_scores_gemma":[0.6072633,0.00010226348,0.3885146,0.00009594999,0.00002493047,0.00020908614,0.0005830875,0.0011642054,0.0020426225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98874027,0.004437736,0.0012478057,0.0009183924,0.0035521649,0.0011035281],"domain_scores_gemma":[0.9570385,0.02401328,0.0021012037,0.010550625,0.0057595503,0.00053698634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007989064,0.0010846788,0.0012063535,0.0016725201,0.0013003381,0.005269136,0.0036491547,0.0024744703,0.0043129306],"category_scores_gemma":[0.029693238,0.0014137009,0.002613776,0.0010187795,0.0028795307,0.0048898305,0.0038305141,0.0036354254,0.0014416559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024090365,0.0008618244,0.010278903,0.0013018738,0.00048907485,0.0029009297,0.0028881873,0.24793124,0.1274029,0.39057842,0.007459798,0.2054978],"study_design_scores_gemma":[0.00025874973,0.00016884199,0.00046471308,0.00010324578,0.00015633763,0.00029888196,0.00018107158,0.788745,0.11001551,0.09233746,0.007158256,0.00011193957],"about_ca_topic_score_codex":0.0035436857,"about_ca_topic_score_gemma":0.004878007,"teacher_disagreement_score":0.007989064,"about_ca_system_score_codex":0.0014832626,"about_ca_system_score_gemma":0.0041577616,"threshold_uncertainty_score":0.042250693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23930669,0.0002564974,0.73054945,0.00033408872,0.0003507252,0.00025248204,0.00016964735,0.015027905,0.013752508],"genre_scores_gemma":[0.8579631,0.00013249656,0.13098593,0.00014788234,0.00005609427,0.00010394002,0.00023479,0.00074171345,0.009634113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861765,0.00025375845,0.00010197342,0.00018073746,0.0006749284,0.00017084404],"domain_scores_gemma":[0.99556667,0.0006811915,0.00049617555,0.0018494272,0.0012744489,0.00013206722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010597631,0.00028845982,0.00035347935,0.00049483834,0.00040144083,0.0011369387,0.0006862116,0.00063656265,0.0020053133],"category_scores_gemma":[0.00416775,0.00029886744,0.00038097057,0.0002666807,0.0011851811,0.0010219637,0.000987386,0.00074008445,0.0007881412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010510775,0.0005639921,0.012801429,0.0007122235,0.00011389573,0.0024228361,0.0018045094,0.13978115,0.26774424,0.27996784,0.016059875,0.27697694],"study_design_scores_gemma":[0.00021992074,0.0006445204,0.002731176,0.00014804654,0.0000832168,0.0014686271,0.0001944729,0.62344766,0.26734966,0.04616914,0.057468418,0.00007522881],"about_ca_topic_score_codex":0.0006600347,"about_ca_topic_score_gemma":0.00081839313,"teacher_disagreement_score":0.0020053133,"about_ca_system_score_codex":0.00055129535,"about_ca_system_score_gemma":0.0012561962,"threshold_uncertainty_score":0.006708443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37376407,0.0011165497,0.42000037,0.00051011576,0.0009805759,0.0010197009,0.0012529598,0.16976145,0.031594217],"genre_scores_gemma":[0.90653306,0.0002206907,0.07503306,0.00038877528,0.00012291149,0.00017510445,0.0014735918,0.0047173155,0.011335493],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99591607,0.00048347077,0.00036828496,0.000985358,0.0015542373,0.0006926486],"domain_scores_gemma":[0.98091495,0.0020077957,0.0009728511,0.012895572,0.0024626951,0.0007459972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018058848,0.0011990069,0.0008932882,0.00080269185,0.00069006125,0.0019292608,0.0026002924,0.0010527796,0.008633494],"category_scores_gemma":[0.020544909,0.0008902123,0.00069140084,0.0004291207,0.00068710785,0.0036719767,0.0037070503,0.0024525193,0.003971436],"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.0037745258,0.0015935851,0.03715603,0.00078537065,0.0003052636,0.0017728746,0.0022656012,0.031510293,0.17386907,0.025198,0.040883623,0.68088585],"study_design_scores_gemma":[0.00072989945,0.0019707887,0.03808261,0.00022552157,0.00053915987,0.0031278057,0.00075327285,0.37821126,0.30942717,0.024732828,0.24188419,0.00031540796],"about_ca_topic_score_codex":0.0012673887,"about_ca_topic_score_gemma":0.0009580572,"teacher_disagreement_score":0.008633494,"about_ca_system_score_codex":0.0005251757,"about_ca_system_score_gemma":0.0008458626,"threshold_uncertainty_score":0.028881907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062332796,0.00012745416,0.9864378,0.000087677945,0.0000718863,0.000079458965,0.00011312917,0.00606524,0.0007840262],"genre_scores_gemma":[0.2014213,0.00031972854,0.79201424,0.00036920223,0.00019011066,0.00019499095,0.0003274735,0.0018390773,0.0033238374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962436,0.00043026367,0.00026978366,0.0006652954,0.0020979866,0.00029296137],"domain_scores_gemma":[0.9935296,0.001793352,0.0008118902,0.00241043,0.0012877677,0.00016697205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020910525,0.0012494291,0.0011351494,0.0029811973,0.0008986279,0.001680569,0.0017568242,0.0011579059,0.0027636846],"category_scores_gemma":[0.006824873,0.000779235,0.0015730035,0.0010104674,0.0022337586,0.0031562601,0.0019176214,0.0020184491,0.0008988862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010441924,0.0002884756,0.0081069,0.00085211365,0.00022662758,0.0007238708,0.00060725654,0.06436243,0.20550169,0.113624446,0.009314545,0.59534746],"study_design_scores_gemma":[0.00010680014,0.00047332273,0.0025722247,0.0001798718,0.00029092652,0.00083388295,0.000062409425,0.59598434,0.31812373,0.043291282,0.03780842,0.0002728413],"about_ca_topic_score_codex":0.002466867,"about_ca_topic_score_gemma":0.002348871,"teacher_disagreement_score":0.0029811973,"about_ca_system_score_codex":0.001295322,"about_ca_system_score_gemma":0.0028874702,"threshold_uncertainty_score":0.011058688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08407281,0.00011201917,0.9117211,0.00034302636,0.00004531451,0.00013384302,0.00014807175,0.0014502076,0.0019737666],"genre_scores_gemma":[0.6963922,0.00023114389,0.3012265,0.0001410594,0.000039004935,0.0002284464,0.00030706043,0.00020317455,0.0012313615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904516,0.0025367164,0.0010042022,0.0015657756,0.0034091624,0.0010325514],"domain_scores_gemma":[0.98452777,0.0079661,0.0015125487,0.0038971866,0.0018509341,0.00024537687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007721335,0.0007039594,0.00090353505,0.0012980594,0.0015409059,0.0034179564,0.0016756424,0.0017455161,0.0015176393],"category_scores_gemma":[0.024975646,0.0009230825,0.0033209457,0.00090410426,0.0037860153,0.0039612576,0.0037266961,0.0025361967,0.00033804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057737017,0.0001757742,0.0070178686,0.00046455688,0.00025254098,0.0017312989,0.0012569979,0.3757775,0.071300216,0.48448634,0.0007796739,0.05617985],"study_design_scores_gemma":[0.00010882444,0.000111331974,0.0010202307,0.00011637653,0.0001339446,0.00025336634,0.00015312088,0.7527218,0.06002032,0.18053871,0.0047659506,0.00005598187],"about_ca_topic_score_codex":0.0070979134,"about_ca_topic_score_gemma":0.0048983465,"teacher_disagreement_score":0.007721335,"about_ca_system_score_codex":0.0021483134,"about_ca_system_score_gemma":0.0049953023,"threshold_uncertainty_score":0.040834785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008960793,0.000521158,0.9850183,0.00036543558,0.0001165591,0.00020956082,0.000026376858,0.0027996658,0.0019819988],"genre_scores_gemma":[0.09423843,0.00076360995,0.8988439,0.00034373754,0.00018969654,0.0006246922,0.00017213622,0.0016412695,0.0031825488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961534,0.0012974538,0.00067773473,0.00033778098,0.0011113088,0.0004223362],"domain_scores_gemma":[0.9931403,0.0024133974,0.00088965305,0.0019872768,0.0010919392,0.00047748254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011377693,0.0010818534,0.00086798676,0.0015848844,0.0013001096,0.006751836,0.003977947,0.0026868915,0.0024359887],"category_scores_gemma":[0.016190708,0.002333862,0.0013337566,0.00092225045,0.0023043326,0.010188722,0.004331566,0.0036720396,0.0017138761],"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.0004717431,0.00024882026,0.004380567,0.0010770794,0.00021888979,0.00085548323,0.0058912043,0.026681168,0.036826946,0.7118508,0.0085279485,0.20296933],"study_design_scores_gemma":[0.00030984136,0.0004198427,0.0011290853,0.0008666626,0.00035878594,0.00088226714,0.0009697991,0.2773005,0.058166347,0.4068311,0.25254253,0.00022322293],"about_ca_topic_score_codex":0.0004676946,"about_ca_topic_score_gemma":0.00070097594,"teacher_disagreement_score":0.011377693,"about_ca_system_score_codex":0.0012339525,"about_ca_system_score_gemma":0.0013614849,"threshold_uncertainty_score":0.060171723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00798042,0.00011403701,0.9839893,0.00063663,0.00005625196,0.00014038503,0.00017554773,0.0005741422,0.0063333],"genre_scores_gemma":[0.60146296,0.00038051396,0.37983322,0.00037717365,0.00012105043,0.00050624995,0.00046810738,0.00014138618,0.016709358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610114,0.0012742445,0.00032832343,0.00059368403,0.0013092856,0.0003933795],"domain_scores_gemma":[0.99716836,0.00095143873,0.0002041803,0.0009926097,0.00046602477,0.00021738092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039021128,0.00064078526,0.0008037811,0.0007274828,0.0010315311,0.0044155265,0.003285009,0.002481187,0.0045443103],"category_scores_gemma":[0.004672568,0.0005977306,0.0014855971,0.0009428351,0.0022042664,0.0082502095,0.0025847699,0.0039859125,0.0013881279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012557354,0.000104822815,0.00021713867,0.00006311128,0.000022414795,0.00016628146,0.00028893416,0.039050333,0.0035196668,0.940108,0.0016488874,0.014684879],"study_design_scores_gemma":[0.00009615438,0.000107279324,0.000117256415,0.000036525333,0.00005635481,0.00021350081,0.000089151676,0.46918678,0.0042080414,0.51123595,0.014605935,0.00004712709],"about_ca_topic_score_codex":0.0029230593,"about_ca_topic_score_gemma":0.0021744808,"teacher_disagreement_score":0.0045443103,"about_ca_system_score_codex":0.0014863365,"about_ca_system_score_gemma":0.0020625826,"threshold_uncertainty_score":0.020636559},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16569069,0.00010730423,0.8269656,0.00022952342,0.000016050242,0.000119187534,0.0001529237,0.0038724083,0.0028463507],"genre_scores_gemma":[0.87507683,0.00008724851,0.12301238,0.00006675707,0.000018145338,0.000048704238,0.00014865113,0.0001900336,0.0013511871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.00028785368,0.00007495325,0.00018753302,0.0004010461,0.00016966063],"domain_scores_gemma":[0.99666446,0.002088881,0.00032978132,0.00050507596,0.00036099492,0.000050843304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011883044,0.00047521607,0.00035497046,0.0015964266,0.00044083397,0.00092146563,0.00050093763,0.00044599109,0.0012844892],"category_scores_gemma":[0.0050482657,0.00035288814,0.0010973947,0.00067131553,0.0013463687,0.0018984961,0.0008693761,0.00060574565,0.00018720477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008958049,0.00026176724,0.040202845,0.00058101636,0.00018408177,0.0015298123,0.001429409,0.30647263,0.12222186,0.17870753,0.003567884,0.34394535],"study_design_scores_gemma":[0.000018548302,0.00010264179,0.003564332,0.000035039906,0.000068506604,0.00033342207,0.00008600302,0.8738739,0.050727688,0.06949214,0.0016603901,0.000037419642],"about_ca_topic_score_codex":0.0030547758,"about_ca_topic_score_gemma":0.002484598,"teacher_disagreement_score":0.0030547758,"about_ca_system_score_codex":0.0009040449,"about_ca_system_score_gemma":0.0010078739,"threshold_uncertainty_score":0.0065593123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061298683,0.00005809601,0.976074,0.00021532406,0.000049347167,0.00011197552,0.00009966311,0.014928326,0.0023332953],"genre_scores_gemma":[0.12044173,0.00017197331,0.8727719,0.00017632156,0.00005173655,0.00018457488,0.00048609296,0.0036264744,0.0020892916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604,0.0017187317,0.00048176755,0.00035269462,0.0012129887,0.00019381978],"domain_scores_gemma":[0.97905135,0.009468502,0.000925051,0.008278439,0.0021606565,0.000115988776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039374786,0.00093898835,0.0006046382,0.00098344,0.0005872118,0.00143057,0.0013689774,0.0007099677,0.007839768],"category_scores_gemma":[0.024643945,0.000785188,0.0013001196,0.0009479599,0.0014027535,0.0034035037,0.0018903995,0.0029448967,0.0028150612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054447236,0.00051054,0.003153502,0.000811857,0.000100997444,0.0008734331,0.0013698246,0.12290202,0.08138282,0.30822828,0.017911283,0.46221098],"study_design_scores_gemma":[0.00016306611,0.0002425039,0.00059391395,0.00016751426,0.00009547205,0.0005995799,0.00014668067,0.5909279,0.12112852,0.1900759,0.09578252,0.00007645168],"about_ca_topic_score_codex":0.0011246942,"about_ca_topic_score_gemma":0.001740779,"teacher_disagreement_score":0.007839768,"about_ca_system_score_codex":0.0009887607,"about_ca_system_score_gemma":0.0016050724,"threshold_uncertainty_score":0.02622664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026062561,0.00021227889,0.90760833,0.00012612806,0.00012201048,0.00035485832,0.0003123559,0.049833808,0.015367683],"genre_scores_gemma":[0.34068772,0.0006060057,0.58697146,0.0006129681,0.00019715003,0.00094588834,0.0022320794,0.008511616,0.05923516],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991394,0.00016083904,0.00010107278,0.00017852975,0.00030773366,0.000112318674],"domain_scores_gemma":[0.9983069,0.00031087955,0.00014394932,0.00080662436,0.00030757458,0.00012411621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016056899,0.000596154,0.0005068673,0.0010340648,0.0005924329,0.0013183634,0.0020679436,0.00080060336,0.006415887],"category_scores_gemma":[0.003027596,0.0006545391,0.0008541372,0.00056303793,0.0008889193,0.0032442652,0.0025556255,0.0011676624,0.004547901],"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.0007892004,0.00037806426,0.008333563,0.00078284304,0.00016007331,0.0008007251,0.0019035256,0.016172372,0.13464059,0.30443972,0.029524803,0.50207454],"study_design_scores_gemma":[0.00019030481,0.001103344,0.004598524,0.00021352779,0.00032791094,0.0017514755,0.00013010277,0.20351556,0.16828854,0.0636714,0.5559449,0.00026440213],"about_ca_topic_score_codex":0.0006671501,"about_ca_topic_score_gemma":0.0007073652,"teacher_disagreement_score":0.006415887,"about_ca_system_score_codex":0.000480509,"about_ca_system_score_gemma":0.0012979389,"threshold_uncertainty_score":0.021463215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016751396,0.0005703081,0.9786341,0.00019513568,0.000045702465,0.00006130551,0.000039529714,0.0012658517,0.002436698],"genre_scores_gemma":[0.7287112,0.0014497796,0.26697886,0.00012753396,0.00009040174,0.00023468494,0.00015362595,0.00013519458,0.0021186285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762136,0.00059921184,0.0001647952,0.0006418442,0.00082531694,0.00014741889],"domain_scores_gemma":[0.9943668,0.0033967565,0.0004349339,0.0006907099,0.001001036,0.000109774825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018551252,0.0006897013,0.00068895204,0.0015326828,0.0007272308,0.0017948963,0.0014351392,0.000591425,0.0013518223],"category_scores_gemma":[0.008659433,0.0004532155,0.00090057583,0.0010835326,0.0013381233,0.0055433,0.0006394513,0.0011981399,0.00020403732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005541278,0.00022828297,0.0103026675,0.000813213,0.00020291073,0.00038405423,0.0014553503,0.18083179,0.053645886,0.27106696,0.0025958559,0.47791886],"study_design_scores_gemma":[0.000032966298,0.00016202379,0.0011091869,0.00007708371,0.00013061283,0.00020094213,0.00007863013,0.9027139,0.037707694,0.0508235,0.0069030602,0.00006045755],"about_ca_topic_score_codex":0.0031216105,"about_ca_topic_score_gemma":0.0012821888,"teacher_disagreement_score":0.0031216105,"about_ca_system_score_codex":0.0016294143,"about_ca_system_score_gemma":0.0016098607,"threshold_uncertainty_score":0.011822283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035021294,0.00011331797,0.96092886,0.00020447151,0.000036732832,0.00007794151,0.000091341775,0.0028018758,0.0007242024],"genre_scores_gemma":[0.60612863,0.00013413043,0.39142713,0.0001991067,0.000044473978,0.00023973099,0.00027544794,0.00043312475,0.0011181342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99156547,0.002789481,0.0007068747,0.0012716218,0.0029540006,0.000712555],"domain_scores_gemma":[0.98373955,0.010616804,0.0014419169,0.0027709247,0.0012203486,0.0002104169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055463784,0.0013752693,0.0013150057,0.0016496292,0.00082546636,0.0022208274,0.0029281375,0.001423822,0.001914776],"category_scores_gemma":[0.016571164,0.0013557477,0.0036665641,0.0007641911,0.002496114,0.0051742513,0.004566816,0.0025942912,0.0003734786],"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.00073467067,0.00036368228,0.009564392,0.0008373735,0.0006570145,0.0021706605,0.0010748141,0.6375177,0.055209555,0.23013538,0.0022537636,0.05948101],"study_design_scores_gemma":[0.000085150896,0.00010223195,0.00027158312,0.000049505164,0.00013402263,0.00019087516,0.000037686586,0.9175786,0.020298783,0.059502546,0.0017025835,0.00004647605],"about_ca_topic_score_codex":0.003667721,"about_ca_topic_score_gemma":0.005831161,"teacher_disagreement_score":0.0055463784,"about_ca_system_score_codex":0.0015816657,"about_ca_system_score_gemma":0.0029108578,"threshold_uncertainty_score":0.0293324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02112962,0.0012415224,0.9289822,0.0021850085,0.0008123434,0.00035636252,0.00015549808,0.009169777,0.03596774],"genre_scores_gemma":[0.5539531,0.0014781099,0.40494964,0.0024567633,0.0014960575,0.00072326063,0.000422974,0.0025367164,0.031983346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905828,0.0020573372,0.0007750934,0.0016583182,0.004051207,0.0008751612],"domain_scores_gemma":[0.9772366,0.003756865,0.000984525,0.014961217,0.0017748636,0.0012859552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004106377,0.0010675128,0.0011309916,0.0019264605,0.0025728215,0.008115269,0.0036030465,0.0018815168,0.010551574],"category_scores_gemma":[0.012561156,0.0013199935,0.0010596294,0.0010610684,0.008252258,0.01696936,0.010627118,0.00771339,0.003987903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038240504,0.00024929197,0.0045791203,0.0004015968,0.000088323155,0.00052239065,0.0031716628,0.005300841,0.019522749,0.7066973,0.016427454,0.24265687],"study_design_scores_gemma":[0.00020319405,0.0007871742,0.0033351323,0.00051572843,0.00021413046,0.0034016855,0.00055369677,0.06184436,0.04630327,0.39032534,0.49208486,0.0004314278],"about_ca_topic_score_codex":0.0010862041,"about_ca_topic_score_gemma":0.0011137043,"teacher_disagreement_score":0.010551574,"about_ca_system_score_codex":0.0014750354,"about_ca_system_score_gemma":0.0023959477,"threshold_uncertainty_score":0.035298526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028329404,0.00006341807,0.96804374,0.00023231305,0.000022918834,0.00009099783,0.00006162373,0.00089401583,0.0022616177],"genre_scores_gemma":[0.4185867,0.0003546845,0.5772649,0.00048084185,0.0000350998,0.00023507442,0.0003419126,0.00026897146,0.0024318234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963659,0.0012939867,0.00027851766,0.00054576684,0.0010762782,0.0004395178],"domain_scores_gemma":[0.9939175,0.0041840877,0.00027940786,0.00078663323,0.0006948412,0.00013756497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034874503,0.001001522,0.00064408605,0.0015489248,0.0010893833,0.0013461149,0.0013565097,0.0009754527,0.0019179226],"category_scores_gemma":[0.0076735606,0.0010426447,0.00251369,0.0008907871,0.003405683,0.0032522855,0.003324293,0.0027175844,0.00068210496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047028178,0.00032855044,0.003339818,0.0005227165,0.00021978041,0.001612431,0.0016062558,0.079261385,0.091516666,0.7406913,0.0017957963,0.07863514],"study_design_scores_gemma":[0.00021271521,0.00036312378,0.0009817288,0.00010546212,0.00018755713,0.00035546787,0.00028490118,0.3547706,0.09345008,0.5380118,0.011169424,0.00010713751],"about_ca_topic_score_codex":0.012815409,"about_ca_topic_score_gemma":0.009511361,"teacher_disagreement_score":0.012815409,"about_ca_system_score_codex":0.001320203,"about_ca_system_score_gemma":0.0021980498,"threshold_uncertainty_score":0.025481641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11836732,0.000421958,0.8633023,0.000642128,0.00011097405,0.00021712728,0.00004888764,0.008690407,0.008198937],"genre_scores_gemma":[0.82528424,0.00021387608,0.1673501,0.0002261493,0.00015699421,0.00015919772,0.000056490273,0.00081423414,0.005738701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961527,0.0007106394,0.00032259215,0.0008626208,0.0015126029,0.00043874624],"domain_scores_gemma":[0.9791013,0.005687056,0.0024168994,0.009569047,0.0025144748,0.0007112672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041349204,0.0006934402,0.0007649044,0.0013538664,0.0012688744,0.0026579709,0.0025384063,0.0011984817,0.0035695916],"category_scores_gemma":[0.015039775,0.00061017286,0.00046292957,0.0005977491,0.0037203794,0.006215069,0.0038333938,0.0026354375,0.0012734212],"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.0009944576,0.00095712784,0.009279094,0.00050604955,0.00009270491,0.0008205821,0.0054313694,0.023978775,0.15583055,0.33492008,0.008242885,0.45894632],"study_design_scores_gemma":[0.0004243392,0.0022172474,0.006742508,0.00026725692,0.00034417628,0.001718092,0.0008028408,0.33073178,0.43368402,0.13556738,0.087213814,0.00028652608],"about_ca_topic_score_codex":0.00079801935,"about_ca_topic_score_gemma":0.00082855474,"teacher_disagreement_score":0.0041349204,"about_ca_system_score_codex":0.0006677824,"about_ca_system_score_gemma":0.00095594185,"threshold_uncertainty_score":0.021867812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049525198,0.00046680978,0.93034714,0.00074971485,0.00028504722,0.0001542988,0.00016822501,0.007353091,0.01095048],"genre_scores_gemma":[0.8032603,0.0003937939,0.1827694,0.0006401941,0.00018460197,0.0002867597,0.00032049246,0.0015838271,0.010560665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9945299,0.0015223692,0.00042185662,0.0005715048,0.0024075496,0.0005468902],"domain_scores_gemma":[0.9858197,0.0043571936,0.001968021,0.0061192424,0.001443386,0.00029247557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00492523,0.00035263237,0.00047638846,0.00094111875,0.0013051255,0.0032834122,0.0022432576,0.0017844975,0.0033100795],"category_scores_gemma":[0.025050698,0.000652038,0.0007138232,0.00062800694,0.0029463798,0.005098287,0.0049891584,0.0026933237,0.00091891433],"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.00051292917,0.00018220808,0.004730481,0.00046859152,0.00010442785,0.0006787775,0.0024296083,0.026142672,0.029579647,0.8236216,0.008603216,0.10294594],"study_design_scores_gemma":[0.00024159664,0.00032455858,0.0017357937,0.00044520534,0.00017564447,0.0006884856,0.00046272713,0.31665936,0.1037117,0.434347,0.14101528,0.00019269444],"about_ca_topic_score_codex":0.0017365789,"about_ca_topic_score_gemma":0.002436837,"teacher_disagreement_score":0.00492523,"about_ca_system_score_codex":0.0014911722,"about_ca_system_score_gemma":0.0022598032,"threshold_uncertainty_score":0.026047468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018529609,0.0030220253,0.942265,0.0054553454,0.0004716404,0.00020960356,0.0011261081,0.0013359939,0.04426145],"genre_scores_gemma":[0.11930707,0.0050236736,0.8401526,0.0041702767,0.0012813073,0.00081341073,0.0023285113,0.00033854513,0.026584601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953251,0.0015547348,0.0006040086,0.000825556,0.0012271034,0.0004634037],"domain_scores_gemma":[0.996714,0.0018960856,0.00025988053,0.0004988424,0.00042188287,0.00020937425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004948648,0.0017282177,0.0011864123,0.0036122478,0.0035210438,0.00945213,0.0033370485,0.0029946251,0.010281108],"category_scores_gemma":[0.0061060498,0.0011108335,0.0035346735,0.003443735,0.0071166363,0.0174288,0.004278493,0.0067045586,0.00299842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013633706,0.000014559222,0.00006534742,0.00010885989,0.000018463033,0.00012426607,0.00023588371,0.00165737,0.00034974655,0.97934544,0.004953897,0.013112527],"study_design_scores_gemma":[0.000018047504,0.000011788609,0.0000440308,0.00007086419,0.000024003644,0.00015166921,0.00008909076,0.0065384596,0.0004853056,0.9372345,0.055313908,0.000018309416],"about_ca_topic_score_codex":0.007963905,"about_ca_topic_score_gemma":0.0051661306,"teacher_disagreement_score":0.010281108,"about_ca_system_score_codex":0.0037588729,"about_ca_system_score_gemma":0.003243417,"threshold_uncertainty_score":0.034393787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042364523,0.016261647,0.41941273,0.15286441,0.0071321777,0.00005572276,0.0003005145,0.001992648,0.3596156],"genre_scores_gemma":[0.49726045,0.03323765,0.24175218,0.052199796,0.0069823056,0.00021006701,0.0004900709,0.0035568993,0.16431062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99841225,0.00064160913,0.000069006055,0.00032236942,0.00042541933,0.00012939019],"domain_scores_gemma":[0.9950629,0.0022393535,0.00020223571,0.0010079286,0.0010631396,0.00042439468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035563938,0.00047300456,0.00035324087,0.0005861528,0.0016535352,0.0038709922,0.0009565412,0.0011780272,0.0091199735],"category_scores_gemma":[0.009497302,0.00036423936,0.00038742958,0.00060956547,0.005557275,0.010623689,0.0018208182,0.005494361,0.002349015],"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.000097020944,0.000060949696,0.0024949666,0.00034787308,0.0000305965,0.00009994314,0.004695351,0.0016853886,0.0017437545,0.7131943,0.042709887,0.23283991],"study_design_scores_gemma":[0.000027610055,0.000071934424,0.0010074237,0.00044741135,0.000021418944,0.00040820526,0.0008625646,0.0024737553,0.002385915,0.32839036,0.6638499,0.000053500164],"about_ca_topic_score_codex":0.0035655757,"about_ca_topic_score_gemma":0.003964761,"teacher_disagreement_score":0.0091199735,"about_ca_system_score_codex":0.0021873491,"about_ca_system_score_gemma":0.0012366057,"threshold_uncertainty_score":0.030509412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04965135,0.00047404197,0.93066823,0.00074434874,0.00018266258,0.00010844716,0.00014720665,0.010756782,0.0072668795],"genre_scores_gemma":[0.772885,0.00041950206,0.22072525,0.0005092364,0.00021040787,0.000095145726,0.00016352614,0.0012099722,0.0037820055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98988485,0.0032219784,0.0007619444,0.0012221107,0.0038702714,0.001038852],"domain_scores_gemma":[0.9605271,0.017809097,0.0025612072,0.015048579,0.003570549,0.00048346785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075283134,0.0010664642,0.0013705055,0.001706832,0.0011916953,0.003102135,0.0027417098,0.0014837147,0.003563244],"category_scores_gemma":[0.02780378,0.0012993315,0.001669728,0.001103497,0.003598939,0.0064140633,0.004232413,0.0038612464,0.0008108017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016951939,0.0004188453,0.011644648,0.0007507542,0.00031412515,0.00077158574,0.0014397245,0.11586129,0.068547346,0.35672206,0.0074800598,0.43435434],"study_design_scores_gemma":[0.00019429611,0.00033351168,0.00089862006,0.00016785685,0.00038797918,0.00029935624,0.000103241066,0.6985961,0.06385476,0.22296187,0.01207919,0.00012319909],"about_ca_topic_score_codex":0.0030932925,"about_ca_topic_score_gemma":0.0034829162,"teacher_disagreement_score":0.0075283134,"about_ca_system_score_codex":0.0012927096,"about_ca_system_score_gemma":0.0041412497,"threshold_uncertainty_score":0.039814055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04085249,0.08672095,0.62906647,0.19990899,0.0018557591,0.00051610474,0.00011942307,0.0021862518,0.038773485],"genre_scores_gemma":[0.7210916,0.029896596,0.22721875,0.008908538,0.002625996,0.00062182394,0.00022167336,0.0007701279,0.008644874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.86425817,0.10471201,0.0039609484,0.005894498,0.018109264,0.003065104],"domain_scores_gemma":[0.56744057,0.34548202,0.006492238,0.040824458,0.033962972,0.0057977564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0982604,0.00094333384,0.0025519584,0.0035226885,0.006322433,0.01996624,0.0077571664,0.015746152,0.0076326327],"category_scores_gemma":[0.20787558,0.0020984325,0.0015780982,0.0051888092,0.022264585,0.07059714,0.008772431,0.015991325,0.0029245494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043348703,0.00044792867,0.004222404,0.000828819,0.000086264336,0.00036764593,0.009544831,0.00758221,0.0012634938,0.68869925,0.019863866,0.2666598],"study_design_scores_gemma":[0.000119688826,0.00047317267,0.0013714699,0.0012182591,0.00008249606,0.0017907327,0.009502672,0.123243526,0.0062635303,0.73994935,0.11568226,0.00030291107],"about_ca_topic_score_codex":0.005251057,"about_ca_topic_score_gemma":0.002196795,"teacher_disagreement_score":0.0982604,"about_ca_system_score_codex":0.006774056,"about_ca_system_score_gemma":0.004509585,"threshold_uncertainty_score":0.5196569},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321895,0.0012176762,0.42750257,0.0032636747,0.00033140994,0.00017473198,0.0001719233,0.0032450377,0.031903345],"genre_scores_gemma":[0.97600675,0.00022749712,0.019825147,0.00016611205,0.00008049678,0.000027736793,0.000089095956,0.00036788677,0.003209333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99317944,0.0016774068,0.00032261203,0.0006795211,0.0031830312,0.0009578796],"domain_scores_gemma":[0.9489746,0.03060433,0.0032888404,0.013367008,0.0030417163,0.0007234542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004059523,0.00058564404,0.0006641507,0.0023681126,0.0013236678,0.0030642017,0.0015293246,0.0013477954,0.006681974],"category_scores_gemma":[0.04857858,0.0007878198,0.0012169901,0.00078717596,0.0035025412,0.00819888,0.004777827,0.0038440535,0.00068845286],"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.0012313124,0.0003359566,0.0056044455,0.00064850773,0.00018500826,0.0012715603,0.002002266,0.16022103,0.098699026,0.48490116,0.0066219866,0.23827781],"study_design_scores_gemma":[0.0000619345,0.00014226409,0.0023722094,0.00014968388,0.000061326944,0.000503859,0.00031603724,0.37818158,0.06502966,0.5449832,0.008124431,0.00007375351],"about_ca_topic_score_codex":0.0008800774,"about_ca_topic_score_gemma":0.00070607377,"teacher_disagreement_score":0.006681974,"about_ca_system_score_codex":0.0013152574,"about_ca_system_score_gemma":0.0010510039,"threshold_uncertainty_score":0.02235347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070920385,0.00022138041,0.86467344,0.00015501355,0.000078284516,0.00017212587,0.00016608591,0.057516612,0.0060967263],"genre_scores_gemma":[0.7299156,0.00018597956,0.26014885,0.00028187095,0.000045627574,0.00022586608,0.00042411627,0.0047737844,0.0039982744],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981615,0.00031837242,0.0001515615,0.00032939808,0.0007236955,0.0003154547],"domain_scores_gemma":[0.99542457,0.0013518309,0.00044775326,0.0020319663,0.0006164451,0.00012742626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012278312,0.0007493151,0.0006710936,0.0011180892,0.0005937002,0.0014013194,0.0013324078,0.0006139585,0.003196458],"category_scores_gemma":[0.0070720683,0.0006652498,0.00055141014,0.00056374865,0.0011668669,0.0024531644,0.0028728598,0.0012971411,0.0012850116],"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.0010447535,0.0006310288,0.020715406,0.0007704793,0.00013556918,0.001323781,0.002253866,0.04340287,0.22607718,0.084266536,0.015761128,0.60361737],"study_design_scores_gemma":[0.00013528131,0.0005801447,0.007395456,0.00018116269,0.00015104264,0.0015156013,0.00022820223,0.3381037,0.54317826,0.042891964,0.065445594,0.00019351006],"about_ca_topic_score_codex":0.0006799628,"about_ca_topic_score_gemma":0.0006139928,"teacher_disagreement_score":0.003196458,"about_ca_system_score_codex":0.0007677502,"about_ca_system_score_gemma":0.0012555376,"threshold_uncertainty_score":0.0106931925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5278723,0.0032487942,0.31133038,0.010343599,0.00015450841,0.0010764326,0.00020979664,0.0021611503,0.143603],"genre_scores_gemma":[0.8934657,0.0006032782,0.09415559,0.000358825,0.0000321428,0.00018402052,0.00008747566,0.00013177542,0.01098126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880647,0.007639953,0.00047835187,0.00056290685,0.0022482027,0.0010059465],"domain_scores_gemma":[0.9781984,0.016583987,0.00094613724,0.0019786255,0.0014320512,0.0008607368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102276355,0.00050525786,0.0005240818,0.0011842416,0.005026709,0.0054230224,0.0025264372,0.0037322843,0.003318508],"category_scores_gemma":[0.01842732,0.0006549691,0.00084180245,0.0015983575,0.008090867,0.0066900556,0.004334557,0.002926615,0.0005584948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061334233,0.0009993468,0.006650749,0.00061141746,0.000051372986,0.018437777,0.021780817,0.0318476,0.004034432,0.848202,0.0055722375,0.06119906],"study_design_scores_gemma":[0.0010181268,0.0014306894,0.0053177727,0.0007900366,0.00017658391,0.02198025,0.024632296,0.30971077,0.026526218,0.25495428,0.3531878,0.0002751975],"about_ca_topic_score_codex":0.027886651,"about_ca_topic_score_gemma":0.030186899,"teacher_disagreement_score":0.027886651,"about_ca_system_score_codex":0.005704563,"about_ca_system_score_gemma":0.0041738697,"threshold_uncertainty_score":0.05544865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023920137,0.0008748904,0.9153743,0.0034339956,0.00024238709,0.0001393991,0.00046391512,0.0007512688,0.05479985],"genre_scores_gemma":[0.8732656,0.000987822,0.079096995,0.00040810445,0.0002636505,0.00028120374,0.00079515326,0.00024114827,0.044660255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970186,0.0012262658,0.0001885833,0.00046905788,0.0007148708,0.0003826227],"domain_scores_gemma":[0.9916425,0.0042234357,0.00074781274,0.0018347703,0.0010401385,0.0005113929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026917155,0.0007256465,0.0006444526,0.0007601757,0.0011220616,0.0035293063,0.0012972882,0.0018092834,0.011569623],"category_scores_gemma":[0.013416202,0.000570229,0.0010123893,0.00068709673,0.0020029014,0.008389738,0.0024463127,0.003461211,0.0022036016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051566953,0.000023100687,0.00029385398,0.00004943365,0.000018612995,0.00018028286,0.00031852315,0.027807198,0.00036808508,0.9608194,0.0031873465,0.0068824133],"study_design_scores_gemma":[0.000031803345,0.000034518383,0.000120528464,0.000043011663,0.000020694673,0.00010032733,0.00012990815,0.19316241,0.0004443805,0.79055595,0.015340086,0.000016371365],"about_ca_topic_score_codex":0.0055897133,"about_ca_topic_score_gemma":0.0049711717,"teacher_disagreement_score":0.011569623,"about_ca_system_score_codex":0.0027309645,"about_ca_system_score_gemma":0.0017411304,"threshold_uncertainty_score":0.038704216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02567444,0.00008836883,0.9707308,0.00013113358,0.000020623862,0.00009833345,0.00003181293,0.00059216644,0.0026322487],"genre_scores_gemma":[0.7130788,0.00016817635,0.28468934,0.00015151115,0.000032726235,0.0003020906,0.00010686953,0.00015611741,0.0013144492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922742,0.002442256,0.00054302975,0.0010433587,0.0028036316,0.00089339755],"domain_scores_gemma":[0.9813184,0.011382844,0.0018025088,0.0035101844,0.0016201073,0.00036596987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006575615,0.0010360843,0.0008089334,0.0038430674,0.0013310645,0.0024135732,0.0022547944,0.0014122993,0.0016181136],"category_scores_gemma":[0.023944069,0.00071621017,0.0017150939,0.0014774441,0.006352018,0.0062797857,0.0040182145,0.0029730587,0.00028038843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001988479,0.000107095,0.0034095307,0.00011332097,0.000078876954,0.00024641235,0.00063879037,0.08570401,0.010198831,0.8615156,0.0003436724,0.03744508],"study_design_scores_gemma":[0.00005123617,0.00015031284,0.00065656635,0.000050460203,0.00008682912,0.00022669196,0.00008907167,0.43159962,0.030407408,0.531916,0.0046911254,0.00007467684],"about_ca_topic_score_codex":0.002372711,"about_ca_topic_score_gemma":0.0012490056,"teacher_disagreement_score":0.006575615,"about_ca_system_score_codex":0.0028796403,"about_ca_system_score_gemma":0.0022805876,"threshold_uncertainty_score":0.034775615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078645935,0.0003727626,0.9686009,0.0006145295,0.0001711784,0.00012093858,0.0005732132,0.0011849183,0.020497013],"genre_scores_gemma":[0.31062523,0.0010421759,0.6670121,0.0007860248,0.0005449091,0.00038987247,0.0018127937,0.0014456547,0.016341316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899372,0.002306655,0.0009971395,0.0022974552,0.0036927902,0.00076871016],"domain_scores_gemma":[0.9856586,0.004441031,0.0010780586,0.00623242,0.002314574,0.00027531528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005826472,0.001554931,0.0012669583,0.004152971,0.0014726846,0.00825979,0.0040992885,0.0033192919,0.013715977],"category_scores_gemma":[0.020118352,0.001409465,0.0040709865,0.0031482906,0.005229573,0.023605492,0.006196099,0.00454022,0.0027342336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005075137,0.000040475563,0.00093217735,0.00017791883,0.000072737996,0.00014244832,0.0002737138,0.013456404,0.0019454014,0.9386312,0.0034848158,0.040791973],"study_design_scores_gemma":[0.000012239172,0.000035752906,0.00029756562,0.000092326794,0.00006871845,0.00027440052,0.00011947975,0.06633399,0.0039061971,0.9160151,0.012810827,0.000033464836],"about_ca_topic_score_codex":0.0021979085,"about_ca_topic_score_gemma":0.0017131813,"teacher_disagreement_score":0.013715977,"about_ca_system_score_codex":0.002487818,"about_ca_system_score_gemma":0.001720815,"threshold_uncertainty_score":0.04588455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021520888,0.0012500369,0.9672088,0.0004995853,0.00016265761,0.00011494916,0.00024515306,0.0051002568,0.00389763],"genre_scores_gemma":[0.5761403,0.0009195647,0.4142427,0.00031200843,0.00030214747,0.00016016887,0.00075057225,0.0010424927,0.006130162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99033314,0.0019267098,0.0006436103,0.0013852724,0.0050624255,0.00064878876],"domain_scores_gemma":[0.98036355,0.00840278,0.0014032059,0.007766433,0.0018979411,0.00016608786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051996186,0.0010052429,0.0012089096,0.0017544975,0.0008894357,0.0027778312,0.0034959733,0.0017021933,0.0044389544],"category_scores_gemma":[0.020901695,0.00125487,0.0018629505,0.0017328423,0.0032704028,0.0058675245,0.0036693036,0.0034392232,0.0010025984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010567986,0.00015576447,0.0014625959,0.0008394698,0.00025079594,0.00032944878,0.00039237464,0.16417353,0.041630816,0.34124926,0.012519268,0.43593988],"study_design_scores_gemma":[0.00013586735,0.00015453024,0.00063783524,0.00016444169,0.0001061697,0.00033317818,0.00006675649,0.4037301,0.049641006,0.5340189,0.010929278,0.00008201984],"about_ca_topic_score_codex":0.0015501959,"about_ca_topic_score_gemma":0.0012903252,"teacher_disagreement_score":0.0051996186,"about_ca_system_score_codex":0.0018832298,"about_ca_system_score_gemma":0.001853376,"threshold_uncertainty_score":0.027498603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337217,0.003593035,0.5026012,0.0052858335,0.00062626926,0.00058684614,0.0026600773,0.026717383,0.12071228],"genre_scores_gemma":[0.58969784,0.00403026,0.26847777,0.0010205843,0.00018667207,0.00021527603,0.004113873,0.005897748,0.12636003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987985,0.00023660174,0.00007457803,0.00019936141,0.00056787534,0.00012312288],"domain_scores_gemma":[0.9974502,0.00086438627,0.00010770801,0.0006414342,0.00075390696,0.00018242873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024748247,0.0009553827,0.00030843186,0.0013008367,0.0009848736,0.0019085719,0.0013184953,0.00080048625,0.016186317],"category_scores_gemma":[0.004342877,0.0005242147,0.00044128555,0.0012209988,0.0010156101,0.0054570353,0.0015278377,0.0015816687,0.004184606],"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.0009108845,0.00084213645,0.02009749,0.0005726907,0.00015937405,0.0027626527,0.013907184,0.004385446,0.10989765,0.021002367,0.06486294,0.7605992],"study_design_scores_gemma":[0.00010150115,0.001137637,0.01602681,0.000317516,0.000266747,0.0057225833,0.004214607,0.022335216,0.25631768,0.011641483,0.6816059,0.00031230107],"about_ca_topic_score_codex":0.0027060362,"about_ca_topic_score_gemma":0.004384715,"teacher_disagreement_score":0.016186317,"about_ca_system_score_codex":0.00063278334,"about_ca_system_score_gemma":0.00071418285,"threshold_uncertainty_score":0.054148674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016624868,0.00062749494,0.91046405,0.00049907865,0.00036006863,0.00010145361,0.00020239844,0.014896681,0.056223832],"genre_scores_gemma":[0.6391434,0.0006749411,0.29963967,0.00042811848,0.00029488848,0.00020255466,0.0009108265,0.004061623,0.054644015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969752,0.00059192115,0.00017696047,0.0004614153,0.0014236371,0.0003708085],"domain_scores_gemma":[0.9964038,0.0009781291,0.00017768881,0.0020449369,0.0003147734,0.000080679834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019767813,0.00084530225,0.00081439386,0.0007265322,0.0008357232,0.0026585248,0.0015057463,0.00083901495,0.011236971],"category_scores_gemma":[0.005867062,0.00074326043,0.000940248,0.00072014495,0.0022243953,0.0029383136,0.0030128604,0.0029910281,0.0023695966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046266703,0.00016096656,0.00060934166,0.00043094554,0.00006682612,0.00031759392,0.00045436647,0.035799887,0.013996292,0.6026285,0.016353551,0.3287191],"study_design_scores_gemma":[0.00013964731,0.00011339893,0.0004298223,0.00021831851,0.00011387675,0.0003332722,0.00009043184,0.3561202,0.05239387,0.50663954,0.08332607,0.00008151943],"about_ca_topic_score_codex":0.0010414912,"about_ca_topic_score_gemma":0.001444297,"teacher_disagreement_score":0.011236971,"about_ca_system_score_codex":0.00075234345,"about_ca_system_score_gemma":0.0011165433,"threshold_uncertainty_score":0.037591398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049748197,0.00044970223,0.9781724,0.00066238065,0.00017266185,0.000083134844,0.00018939229,0.0014681178,0.013827426],"genre_scores_gemma":[0.26104054,0.001306227,0.72362334,0.0008546249,0.00027096938,0.00035357688,0.0003917623,0.0010292113,0.011129675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997143,0.000823447,0.00014987998,0.00036101893,0.001127024,0.00039565808],"domain_scores_gemma":[0.9972269,0.0014209403,0.00016970484,0.0005452267,0.00055378425,0.00008346201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004276681,0.00049152575,0.0006043965,0.0010394864,0.0011026453,0.002833191,0.001152335,0.00077474257,0.0048533557],"category_scores_gemma":[0.005224037,0.00058282976,0.0017783399,0.0008058114,0.003630025,0.0030871567,0.0027640604,0.0025385139,0.0013001293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053596017,0.0000118261705,0.00021790556,0.00016288325,0.000022497372,0.00022141349,0.00045175027,0.0039326358,0.0037175103,0.9723293,0.0015124374,0.017366245],"study_design_scores_gemma":[0.00007031807,0.000054253916,0.00027357403,0.00017290235,0.00009842983,0.0003772219,0.00015052735,0.035671875,0.021701613,0.827231,0.11414335,0.000054950477],"about_ca_topic_score_codex":0.004515302,"about_ca_topic_score_gemma":0.003195981,"teacher_disagreement_score":0.0048533557,"about_ca_system_score_codex":0.0014060322,"about_ca_system_score_gemma":0.0035563717,"threshold_uncertainty_score":0.022617519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076306045,0.00040098716,0.801333,0.00047172917,0.00013808327,0.00020169033,0.00088604307,0.11193498,0.0083274795],"genre_scores_gemma":[0.58788997,0.0002291821,0.3975489,0.0005485517,0.000101352794,0.00019701733,0.0014616775,0.007917655,0.0041056573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9938877,0.0013182915,0.00043201665,0.00094323326,0.0028628383,0.00055590767],"domain_scores_gemma":[0.9850612,0.006398286,0.001977998,0.003676747,0.002660904,0.00022480186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722863,0.0016301638,0.0007226811,0.003015147,0.0014272287,0.0023331472,0.0024443935,0.0013985303,0.004583688],"category_scores_gemma":[0.018119205,0.0010168594,0.0014146746,0.0012279097,0.0022907767,0.003354435,0.0026223762,0.0018706868,0.0018558758],"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.002429144,0.00038858427,0.049650043,0.0012144608,0.00040942564,0.0012319576,0.001449843,0.10629147,0.0938781,0.09959884,0.061813515,0.58164465],"study_design_scores_gemma":[0.00012343602,0.0003247722,0.0053718453,0.00022271751,0.00011496815,0.00063738244,0.00018411744,0.7076536,0.19824095,0.054192066,0.032725748,0.00020834625],"about_ca_topic_score_codex":0.0060440577,"about_ca_topic_score_gemma":0.0043745977,"teacher_disagreement_score":0.0060440577,"about_ca_system_score_codex":0.0015209304,"about_ca_system_score_gemma":0.003694613,"threshold_uncertainty_score":0.019688606},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010298069,0.0035123045,0.34048206,0.015359952,0.0015651481,0.00028014963,0.00082886737,0.0136254085,0.614048],"genre_scores_gemma":[0.22737361,0.0041696234,0.2016674,0.0056025777,0.0005520062,0.00040186886,0.0011406647,0.0017930549,0.55729926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998582,0.00027671803,0.000049247235,0.00044212452,0.0004498869,0.00020004432],"domain_scores_gemma":[0.99860746,0.00030567846,0.00006025299,0.000535551,0.0003194757,0.0001715862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012451,0.00065058493,0.0004393751,0.0010502032,0.0019787531,0.0051849023,0.0011565351,0.0015628693,0.07829733],"category_scores_gemma":[0.004678144,0.00049995235,0.00042704603,0.0008508089,0.005108349,0.0065460657,0.0048640925,0.003014799,0.02236391],"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.00014940002,0.000015951602,0.0006188695,0.00013367276,0.000012604455,0.00019971315,0.00076793035,0.0019907355,0.0024180622,0.75405294,0.08887426,0.15076588],"study_design_scores_gemma":[0.000031782507,0.00003744516,0.00036144085,0.00018388912,0.000008339971,0.0002496376,0.00021985294,0.005923976,0.0024427595,0.099161796,0.891349,0.000029952156],"about_ca_topic_score_codex":0.012365212,"about_ca_topic_score_gemma":0.008629655,"teacher_disagreement_score":0.07829733,"about_ca_system_score_codex":0.0029112757,"about_ca_system_score_gemma":0.0032732468,"threshold_uncertainty_score":0.26193064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11478923,0.0016250187,0.84358674,0.0032934193,0.00042998116,0.00035711852,0.00008032244,0.006660997,0.02917709],"genre_scores_gemma":[0.52783924,0.0009746413,0.46184787,0.0005414798,0.000098960496,0.00015349462,0.00012412298,0.00088928017,0.00753092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99760485,0.00073457067,0.00015742342,0.00020912894,0.0009386704,0.0003553585],"domain_scores_gemma":[0.9965443,0.0006518469,0.0003088797,0.0016968228,0.0005955312,0.00020258741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032164934,0.0007898374,0.00047908915,0.00039778568,0.00073063636,0.0031509735,0.0022712057,0.0009941976,0.0038534817],"category_scores_gemma":[0.006287637,0.00069280877,0.0006021087,0.0003747558,0.00135034,0.006783619,0.0027659368,0.00331255,0.0013432167],"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.0014838703,0.00043792382,0.007233787,0.0011231283,0.0001927795,0.0010415271,0.0016059084,0.09731219,0.1209099,0.58038014,0.016177224,0.17210162],"study_design_scores_gemma":[0.00028015097,0.0018402246,0.0020723909,0.0005398097,0.00023275177,0.0013266825,0.0006026037,0.3948066,0.14936924,0.1794827,0.26926383,0.00018311849],"about_ca_topic_score_codex":0.0007552343,"about_ca_topic_score_gemma":0.0011302916,"teacher_disagreement_score":0.0038534817,"about_ca_system_score_codex":0.0009820594,"about_ca_system_score_gemma":0.0018946652,"threshold_uncertainty_score":0.01701063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073631797,0.00006685423,0.9901253,0.00020147319,0.000028749724,0.00013714105,0.000010943763,0.00023180932,0.0018345208],"genre_scores_gemma":[0.45542976,0.00012606246,0.54122037,0.00010558467,0.000050250695,0.00032945015,0.000048747024,0.000073429335,0.0026162781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945575,0.002621718,0.0003660613,0.00057184865,0.0015337827,0.00034905653],"domain_scores_gemma":[0.99577004,0.0013321805,0.00077784364,0.0009649441,0.0009119812,0.00024296372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062298626,0.0004681491,0.0004120806,0.0010965645,0.0012003828,0.0024664665,0.0017117481,0.001046818,0.0007511285],"category_scores_gemma":[0.009130425,0.00041205328,0.0009734302,0.00063265255,0.0016825389,0.0032981436,0.0021273314,0.0019037918,0.00024784225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017125104,0.0002488022,0.0044272286,0.0002924876,0.00016040623,0.0006187488,0.0018032008,0.09127535,0.01365088,0.6360356,0.0025507489,0.24876532],"study_design_scores_gemma":[0.000052518128,0.00020552542,0.001034237,0.00011177431,0.00008890602,0.00037682155,0.00037012517,0.8120937,0.022696866,0.14151818,0.021389842,0.000061490675],"about_ca_topic_score_codex":0.0020634513,"about_ca_topic_score_gemma":0.0017785229,"teacher_disagreement_score":0.0062298626,"about_ca_system_score_codex":0.0017826374,"about_ca_system_score_gemma":0.0028738629,"threshold_uncertainty_score":0.032947063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94095063,0.0002195986,0.050356135,0.0003387961,0.000050138286,0.00014244708,0.0003531483,0.000628497,0.006960551],"genre_scores_gemma":[0.9969304,0.000027259779,0.0025485305,0.000013439946,0.000004036216,0.0000126994455,0.00011901111,0.000009910431,0.00033471797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804974,0.0004962636,0.00009517635,0.000335248,0.0006607242,0.00036284575],"domain_scores_gemma":[0.99450916,0.0025613145,0.000980618,0.0008612435,0.0008453858,0.00024238224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017646754,0.00043302015,0.00027279914,0.0018959318,0.0005638059,0.0020498284,0.00067191815,0.00065594167,0.0016272322],"category_scores_gemma":[0.00847514,0.00025290644,0.00047002936,0.0007262581,0.000888794,0.0016758484,0.0010312044,0.0006887968,0.00024766746],"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.0020400516,0.00051518,0.18044586,0.00026483685,0.0003426714,0.0012395709,0.0014380933,0.54118645,0.058285344,0.0634348,0.0033023902,0.14750475],"study_design_scores_gemma":[0.000018969871,0.00024825387,0.028180769,0.000025557687,0.000050712104,0.00016096428,0.0005412532,0.943989,0.012480615,0.012693784,0.0015818701,0.000028192959],"about_ca_topic_score_codex":0.003737282,"about_ca_topic_score_gemma":0.0020093808,"teacher_disagreement_score":0.003737282,"about_ca_system_score_codex":0.0014652956,"about_ca_system_score_gemma":0.00092833047,"threshold_uncertainty_score":0.010631502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19037636,0.023736874,0.31019205,0.29397124,0.006684998,0.00014393566,0.0005206157,0.0016334982,0.17274044],"genre_scores_gemma":[0.94297624,0.003023349,0.035984017,0.0067693912,0.0021709248,0.00008972421,0.000076490986,0.0002818844,0.008628024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956235,0.0013283108,0.00026338417,0.00084348186,0.0015984476,0.00034280334],"domain_scores_gemma":[0.9788179,0.011299026,0.0018322639,0.0045867865,0.0026998601,0.00076419103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057895924,0.00045287888,0.0005700953,0.0016614414,0.0016425906,0.0045305234,0.001536528,0.0031697224,0.0048036007],"category_scores_gemma":[0.02543538,0.0005209558,0.0006023932,0.0005486818,0.018956263,0.016500892,0.0031948357,0.0064308895,0.00095327786],"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.00032013058,0.00007278502,0.0041436553,0.00028644878,0.00006976488,0.00074183254,0.002853738,0.0012097034,0.009474529,0.8915343,0.012630946,0.076662056],"study_design_scores_gemma":[0.00005620261,0.00013763923,0.0028252944,0.00025618344,0.00004948746,0.0026927541,0.0016012551,0.005868523,0.009711515,0.92318195,0.05350944,0.00010969288],"about_ca_topic_score_codex":0.0007113612,"about_ca_topic_score_gemma":0.00036417512,"teacher_disagreement_score":0.0057895924,"about_ca_system_score_codex":0.0014128702,"about_ca_system_score_gemma":0.00078315363,"threshold_uncertainty_score":0.030618668},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046491185,0.04721234,0.16276588,0.0047514234,0.0032332453,0.00006875897,0.00008034254,0.00096553075,0.7762733],"genre_scores_gemma":[0.28165326,0.042637695,0.048818838,0.0018995544,0.005112808,0.00022100878,0.00026257636,0.00062395073,0.6187703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994868,0.00009815036,0.000020646276,0.000071432674,0.00027820608,0.000044744545],"domain_scores_gemma":[0.9995425,0.00015193874,0.00003230615,0.00016075837,0.00007297662,0.00003960804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004833503,0.0006514827,0.0006354223,0.0007670987,0.0009298916,0.0032639785,0.0005986654,0.00088985445,0.009317857],"category_scores_gemma":[0.0012846757,0.00038567334,0.00029446767,0.0012174689,0.00248057,0.003565669,0.0012777421,0.0026295308,0.0042776563],"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.00001777997,0.000019672189,0.000075754535,0.000082378174,0.000010745773,0.00005599026,0.00019670003,0.002386884,0.0006669149,0.86072725,0.03527842,0.10048144],"study_design_scores_gemma":[0.0000055329715,0.00001640809,0.00015142756,0.00008932778,0.00000801498,0.00017895817,0.00005178699,0.005950491,0.00044645325,0.74891144,0.24418065,0.000009434008],"about_ca_topic_score_codex":0.0005921673,"about_ca_topic_score_gemma":0.0007672913,"teacher_disagreement_score":0.009317857,"about_ca_system_score_codex":0.0013791063,"about_ca_system_score_gemma":0.00076293707,"threshold_uncertainty_score":0.031171322},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92058,0.000756467,0.06987263,0.00030914223,0.000121703495,0.000086208565,0.000071037575,0.0037791498,0.0044236425],"genre_scores_gemma":[0.9918847,0.0001503349,0.006629129,0.000059995655,0.000013911432,0.0000149230655,0.00004887246,0.00009642414,0.0011016027],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986326,0.00026476334,0.00009516475,0.00022687134,0.0005674362,0.00021309461],"domain_scores_gemma":[0.9967939,0.0016597116,0.0004884616,0.00041315673,0.00048647093,0.00015828019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153069,0.00054940354,0.0002801148,0.0009341834,0.00046112452,0.0007608551,0.0006948608,0.0006490892,0.0011865157],"category_scores_gemma":[0.0052617704,0.00026810757,0.00045949375,0.0003302821,0.0005647886,0.0017352566,0.0006589285,0.00060289,0.00014302769],"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.0043141507,0.000574038,0.10779083,0.0009753091,0.0003745094,0.015695183,0.0047988547,0.030002242,0.4800897,0.020618927,0.007931847,0.32683438],"study_design_scores_gemma":[0.00012270338,0.0017246477,0.036584556,0.0001734805,0.00050911674,0.0080763735,0.00046849082,0.3248513,0.6110264,0.00817274,0.008128311,0.00016175945],"about_ca_topic_score_codex":0.0011551891,"about_ca_topic_score_gemma":0.000871205,"teacher_disagreement_score":0.0011865157,"about_ca_system_score_codex":0.00038931204,"about_ca_system_score_gemma":0.000433733,"threshold_uncertainty_score":0.0043118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36299482,0.00071676105,0.60344595,0.00078320963,0.000110135545,0.00016543352,0.00027980277,0.0054584052,0.026045501],"genre_scores_gemma":[0.9356922,0.00039640575,0.054948382,0.00021988104,0.000069751775,0.00009324299,0.00027001294,0.000971284,0.0073389257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99664515,0.000449549,0.0001788416,0.00037029147,0.0015305933,0.00082557224],"domain_scores_gemma":[0.9961798,0.0015273945,0.00045261893,0.0008766929,0.0008778524,0.00008574119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753074,0.0009471221,0.0006315253,0.0020273854,0.0012771107,0.0023181548,0.0009658194,0.0009022124,0.00343067],"category_scores_gemma":[0.0073019415,0.000501532,0.0011763497,0.0013872868,0.0027774558,0.005516097,0.0017096993,0.0015886177,0.0006955628],"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.0014408095,0.00015864291,0.030759623,0.0006879026,0.00016655326,0.0029354277,0.00293395,0.047588434,0.09326155,0.61545324,0.007617508,0.19699636],"study_design_scores_gemma":[0.000065021544,0.00031724744,0.0078413915,0.00018261265,0.00031356365,0.0021839351,0.00047873385,0.4087696,0.2620806,0.29793796,0.01959488,0.00023441848],"about_ca_topic_score_codex":0.0019043094,"about_ca_topic_score_gemma":0.0009792374,"teacher_disagreement_score":0.00343067,"about_ca_system_score_codex":0.0013137345,"about_ca_system_score_gemma":0.0018480786,"threshold_uncertainty_score":0.011476696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042603746,0.00021827368,0.9323089,0.0044485643,0.00010274211,0.00039877582,0.00063962257,0.0015232242,0.01775622],"genre_scores_gemma":[0.52693635,0.00047228741,0.4614387,0.0009604481,0.00014342954,0.0003150439,0.0014742813,0.00027057517,0.007988967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895076,0.004308345,0.00076217676,0.0014072799,0.0030389086,0.0009756899],"domain_scores_gemma":[0.9862103,0.00929703,0.0013903131,0.001622119,0.001161958,0.00031827478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009795825,0.0013333674,0.0010064763,0.0034122115,0.0037976578,0.0085111465,0.0039551216,0.003530655,0.005416003],"category_scores_gemma":[0.02308563,0.0015498631,0.0034498512,0.0014683715,0.006498159,0.013776856,0.008691547,0.0044476283,0.00076095737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030955012,0.00020611362,0.0059001595,0.0004696471,0.00016981369,0.0077969246,0.006115127,0.13579413,0.0030336566,0.79774904,0.006026045,0.036429808],"study_design_scores_gemma":[0.00012443309,0.000092616974,0.00074281316,0.0003858143,0.00023150734,0.0023261344,0.004262228,0.46107528,0.016330015,0.46558225,0.048703916,0.00014292824],"about_ca_topic_score_codex":0.016843438,"about_ca_topic_score_gemma":0.014030474,"teacher_disagreement_score":0.016843438,"about_ca_system_score_codex":0.0041806693,"about_ca_system_score_gemma":0.0036626696,"threshold_uncertainty_score":0.051805913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0271362,0.00006587186,0.96940875,0.00005982385,0.000042778487,0.00008039599,0.000106955966,0.00070139527,0.0023977777],"genre_scores_gemma":[0.8291825,0.00016445783,0.1658982,0.000046816196,0.000027480566,0.0001289555,0.00022358863,0.0001660144,0.004161877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875605,0.00034694537,0.000050289564,0.00019190427,0.0004604508,0.00019444323],"domain_scores_gemma":[0.99768734,0.0015412434,0.00013156491,0.00018588107,0.00038749995,0.00006650061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225306,0.0008444336,0.0007148757,0.0015551369,0.0005881363,0.0015050188,0.0011321839,0.00053917296,0.0033393058],"category_scores_gemma":[0.003208265,0.00038316613,0.0013524289,0.00074198266,0.0010327499,0.0013495365,0.0007052933,0.0008301839,0.0003819757],"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.00038392373,0.000102099824,0.0014190556,0.00012427532,0.000092313865,0.00038076862,0.000119260505,0.789117,0.020872673,0.15958579,0.00062059134,0.027182154],"study_design_scores_gemma":[0.000007969962,0.000015367252,0.000114156544,0.000005264694,0.000016315616,0.000018286048,0.00000723899,0.97403336,0.004323048,0.021062782,0.00038901847,0.00000714602],"about_ca_topic_score_codex":0.008692102,"about_ca_topic_score_gemma":0.0049637123,"teacher_disagreement_score":0.008692102,"about_ca_system_score_codex":0.0020558478,"about_ca_system_score_gemma":0.0022096615,"threshold_uncertainty_score":0.017283022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024239619,0.000053475796,0.9946779,0.0001539575,0.000053924774,0.00008522148,0.000041646676,0.00057053467,0.0019394221],"genre_scores_gemma":[0.22741787,0.00023999005,0.76672024,0.00039913348,0.00018970697,0.00047139547,0.00035309105,0.00056289206,0.003645668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919939,0.002691538,0.0008634036,0.0011698166,0.0027144388,0.0005669094],"domain_scores_gemma":[0.9911554,0.004783238,0.00050624437,0.001963132,0.0014173462,0.00017449714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006562477,0.0013805013,0.0011046139,0.0024958123,0.0014401925,0.0026909155,0.002567696,0.0019288907,0.0050310316],"category_scores_gemma":[0.014056693,0.0009386234,0.0040310742,0.0012031966,0.0052326773,0.009580958,0.0037950093,0.0065824967,0.001224785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012090246,0.00009785622,0.00062203716,0.00022253087,0.00010786874,0.0003529006,0.00085490855,0.012219664,0.0065267878,0.9349769,0.0015043779,0.042393334],"study_design_scores_gemma":[0.00012302323,0.00017693733,0.0003371899,0.00015127484,0.00017451408,0.0004926733,0.00022173896,0.19520926,0.031663153,0.7488664,0.022444094,0.000139793],"about_ca_topic_score_codex":0.001098235,"about_ca_topic_score_gemma":0.0008503684,"teacher_disagreement_score":0.006562477,"about_ca_system_score_codex":0.0020069613,"about_ca_system_score_gemma":0.0023104819,"threshold_uncertainty_score":0.034706056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004619568,0.00013759623,0.9733848,0.00071386615,0.0002317575,0.00042117338,0.00034521328,0.0063652107,0.01378078],"genre_scores_gemma":[0.16638072,0.00036204254,0.812772,0.0015752845,0.00021566944,0.0011732472,0.0012047801,0.0016756196,0.014640647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99401736,0.001470128,0.00058949314,0.00093202933,0.0022535308,0.0007374488],"domain_scores_gemma":[0.99049544,0.0030774272,0.00064809906,0.0020766442,0.0032848686,0.0004175236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059709097,0.00065541797,0.00054313923,0.0013826572,0.0011910121,0.0042860685,0.0026772371,0.0016928755,0.006246085],"category_scores_gemma":[0.010220032,0.0009651529,0.0010826282,0.000916932,0.003156619,0.005328001,0.0028804194,0.0033990492,0.0033534404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105614185,0.00015313129,0.00046541696,0.00030854114,0.00002707866,0.00030885145,0.0006421854,0.008844258,0.0072912127,0.92258054,0.012454438,0.04681873],"study_design_scores_gemma":[0.00020381653,0.00020509388,0.00026606073,0.00036137216,0.000090594025,0.0010147593,0.00029108574,0.18823059,0.04991035,0.35586053,0.40341774,0.00014798515],"about_ca_topic_score_codex":0.0038087976,"about_ca_topic_score_gemma":0.0025734508,"teacher_disagreement_score":0.006246085,"about_ca_system_score_codex":0.002034024,"about_ca_system_score_gemma":0.00762191,"threshold_uncertainty_score":0.031577587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017053993,0.00043531685,0.9573019,0.00024287308,0.000333954,0.00019779686,0.00046698537,0.014980725,0.008986438],"genre_scores_gemma":[0.5933243,0.00044685774,0.38689628,0.00078232016,0.0003173663,0.00027557753,0.000750324,0.0010720536,0.016134933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982401,0.00034018428,0.00011132476,0.0004292787,0.0007199401,0.00015904951],"domain_scores_gemma":[0.9961442,0.0010546808,0.0003748439,0.0013978836,0.00086259446,0.00016576367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016219004,0.00087156706,0.00069384143,0.001426442,0.0005437824,0.0015868722,0.0016356067,0.000727869,0.00442739],"category_scores_gemma":[0.004544103,0.00036931774,0.00035976924,0.00061976956,0.00085298315,0.0024076563,0.0016906689,0.0015140711,0.0011965067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022853604,0.00048754277,0.004535075,0.0006428903,0.00012319302,0.00051216985,0.00088705914,0.030841129,0.1274216,0.122018784,0.032731514,0.67751366],"study_design_scores_gemma":[0.00014904453,0.00085368194,0.0018622626,0.00013845616,0.00025585364,0.0006946348,0.00009891996,0.58767325,0.27974704,0.05292815,0.07547672,0.00012209965],"about_ca_topic_score_codex":0.00094570866,"about_ca_topic_score_gemma":0.0010197,"teacher_disagreement_score":0.00442739,"about_ca_system_score_codex":0.0009092167,"about_ca_system_score_gemma":0.0012287871,"threshold_uncertainty_score":0.014811158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06849689,0.0007947612,0.9025029,0.0018001953,0.00017647108,0.00009148565,0.00013965843,0.00032371227,0.025673918],"genre_scores_gemma":[0.9584978,0.00077325414,0.035349477,0.00017683623,0.0001659693,0.00008276757,0.000054047643,0.00009354158,0.0048061875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751914,0.0007095501,0.00005933145,0.0003011982,0.00094801123,0.00046278053],"domain_scores_gemma":[0.9773332,0.018332472,0.0010260874,0.001780713,0.0012086161,0.00031888086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249058,0.0011556129,0.0012093846,0.0016909546,0.0012618821,0.002285386,0.0016226611,0.002172704,0.0071630594],"category_scores_gemma":[0.02035769,0.0006468832,0.0008735137,0.00090015243,0.0031485746,0.0065593664,0.0027663761,0.0023890065,0.0005862064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002508797,0.00006753302,0.00083737186,0.0002355834,0.00007941369,0.00032989815,0.00022201648,0.3204152,0.010016822,0.6388426,0.0027783879,0.025924291],"study_design_scores_gemma":[0.000012785701,0.000051116716,0.00015368007,0.00004080646,0.00002959134,0.00023172356,0.000056149936,0.73861516,0.004029347,0.25537288,0.0013810256,0.000025768457],"about_ca_topic_score_codex":0.00068127434,"about_ca_topic_score_gemma":0.0007807773,"teacher_disagreement_score":0.0071630594,"about_ca_system_score_codex":0.0016226409,"about_ca_system_score_gemma":0.001529988,"threshold_uncertainty_score":0.023962796},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011288424,0.026641546,0.63777965,0.0071345475,0.0011484527,0.00034584897,0.00022967366,0.0017387329,0.3136931],"genre_scores_gemma":[0.4553856,0.04168786,0.28372377,0.004969984,0.0024822538,0.00072702,0.00066193053,0.00075206615,0.20960954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965412,0.0007670368,0.00023068146,0.0006052991,0.0016025804,0.0002531859],"domain_scores_gemma":[0.9946313,0.0017547294,0.0003234693,0.0025804415,0.0005340732,0.00017599759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038827998,0.0006537947,0.00054714305,0.0017597543,0.0013691455,0.005802997,0.0019757384,0.0020889044,0.0075842617],"category_scores_gemma":[0.005528898,0.00052557606,0.0009927015,0.0019117192,0.005596218,0.010140324,0.0032482846,0.0034851262,0.0035364642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010377503,0.000020714873,0.00011926237,0.00015869751,0.000010738928,0.000038707047,0.0004962101,0.0007947414,0.0010782831,0.9377034,0.0053178538,0.05425112],"study_design_scores_gemma":[0.000018543798,0.000045220007,0.00022427646,0.00037556334,0.000026292964,0.0006499301,0.0001466399,0.0062032347,0.004404558,0.54389244,0.44398043,0.000032876393],"about_ca_topic_score_codex":0.00060854526,"about_ca_topic_score_gemma":0.00043126856,"teacher_disagreement_score":0.0075842617,"about_ca_system_score_codex":0.0018075033,"about_ca_system_score_gemma":0.0017912093,"threshold_uncertainty_score":0.02537191},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002864411,0.18526474,0.1299198,0.022352688,0.0028545666,0.00027666497,0.00025614697,0.00073316053,0.65547776],"genre_scores_gemma":[0.1517035,0.28272304,0.12570798,0.007688598,0.0060254154,0.00063005346,0.0007582694,0.00056268816,0.42420042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865144,0.00033383275,0.000076237426,0.00018290675,0.00065245375,0.000103152575],"domain_scores_gemma":[0.99925786,0.00034347046,0.00004100706,0.00016192134,0.00013936107,0.000056362678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010123786,0.0010179247,0.00059258397,0.0009181122,0.0014504712,0.005332939,0.001348307,0.003309326,0.012444924],"category_scores_gemma":[0.0020220003,0.0005787685,0.00054039696,0.0019483977,0.0038839264,0.00802645,0.0028263612,0.004425287,0.0065320637],"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.0000076092138,0.000021328686,0.00006301637,0.00045791094,0.000006576264,0.00013568856,0.00076267484,0.0008563906,0.0005828695,0.8439314,0.0474741,0.1057004],"study_design_scores_gemma":[0.0000037032755,0.000014244874,0.00013292363,0.000655891,0.00000696533,0.0005722617,0.00023044634,0.0014203514,0.00027811533,0.28572905,0.71094096,0.000015164573],"about_ca_topic_score_codex":0.0011602781,"about_ca_topic_score_gemma":0.0010734873,"teacher_disagreement_score":0.012444924,"about_ca_system_score_codex":0.0024774594,"about_ca_system_score_gemma":0.002308882,"threshold_uncertainty_score":0.041632354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07860887,0.0005479994,0.89406264,0.0006521689,0.00018618604,0.0006553795,0.00017066598,0.0054069203,0.0197091],"genre_scores_gemma":[0.86436474,0.00036730885,0.117609985,0.00032468882,0.0000763061,0.00041665867,0.00019684924,0.00030648973,0.016336987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642485,0.0007104724,0.00038424387,0.0005391447,0.0015764389,0.00036472213],"domain_scores_gemma":[0.9973315,0.00045238744,0.00027766786,0.001024997,0.0008110214,0.000102428254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016223761,0.00056493445,0.00042741664,0.0010515893,0.00085315993,0.002387174,0.0013820878,0.0013949443,0.0029064876],"category_scores_gemma":[0.0036493526,0.0003167662,0.0005597723,0.0002756636,0.0015788422,0.0035690486,0.0014621462,0.0014259212,0.0013027157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012058695,0.00036926693,0.007183254,0.00085654476,0.00009796448,0.002551829,0.0037119968,0.012868518,0.17216267,0.54536897,0.008177869,0.24544527],"study_design_scores_gemma":[0.00033360548,0.002229928,0.0052411156,0.000836896,0.0003591976,0.0075565064,0.0011771213,0.35860503,0.29588744,0.08515326,0.24216054,0.00045939005],"about_ca_topic_score_codex":0.0019376102,"about_ca_topic_score_gemma":0.0018925869,"teacher_disagreement_score":0.0029064876,"about_ca_system_score_codex":0.0008969646,"about_ca_system_score_gemma":0.0010151298,"threshold_uncertainty_score":0.0097231865},"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":"empirical","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48429963,0.0016188313,0.3503729,0.0011138528,0.0005595384,0.001082315,0.0003698068,0.15366904,0.006914114],"genre_scores_gemma":[0.8876216,0.0003622343,0.10351893,0.0009223102,0.00008000864,0.00039289054,0.00048930413,0.0040018326,0.002610945],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946694,0.0013573543,0.00042977967,0.0009665931,0.0016600657,0.0009168318],"domain_scores_gemma":[0.9859655,0.003997711,0.0033228684,0.0044636833,0.0013647875,0.00088540255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040099504,0.0021886993,0.00070588,0.001637037,0.0006590824,0.0015790827,0.0031454754,0.0014842426,0.003610216],"category_scores_gemma":[0.01680137,0.0011599638,0.0010764105,0.00045430224,0.0028260509,0.0041862833,0.003773563,0.0020427725,0.0019432072],"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.0034099128,0.0016765014,0.055444103,0.0021611946,0.00066308584,0.002084532,0.0040439013,0.056372367,0.5078365,0.0128901955,0.028449502,0.32496822],"study_design_scores_gemma":[0.0012121772,0.008818681,0.034815077,0.00063176965,0.0009677204,0.0033781559,0.0025471684,0.3243954,0.53296655,0.018003335,0.071329035,0.0009350472],"about_ca_topic_score_codex":0.0015424914,"about_ca_topic_score_gemma":0.0010129692,"teacher_disagreement_score":0.0040099504,"about_ca_system_score_codex":0.0007099241,"about_ca_system_score_gemma":0.0014244418,"threshold_uncertainty_score":0.021206856},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03873016,0.0029835345,0.3035326,0.0032574974,0.0030455147,0.0019980145,0.008293563,0.2908744,0.34728473],"genre_scores_gemma":[0.34091425,0.002233927,0.140911,0.0053032367,0.0005910357,0.001974028,0.017180033,0.046585377,0.4443072],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986676,0.00017363235,0.00011189046,0.0002604408,0.00055160257,0.00023485848],"domain_scores_gemma":[0.997248,0.0004695644,0.00019710851,0.0013525801,0.0005357661,0.00019695198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009993593,0.0010648597,0.0005487606,0.0006683124,0.0007708332,0.001871268,0.0033038997,0.0013965892,0.10927987],"category_scores_gemma":[0.0047654104,0.00081759033,0.0006354062,0.00040125108,0.0010181934,0.0042437646,0.004078766,0.0025264819,0.05344162],"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.003086379,0.00041491253,0.0028896073,0.0017355636,0.00011192327,0.0010880525,0.0010511257,0.003725818,0.03911101,0.06897479,0.49121976,0.38659108],"study_design_scores_gemma":[0.00013766518,0.00037265997,0.00093822525,0.00014412224,0.000040533858,0.00088160846,0.00012426556,0.014535627,0.039222144,0.0137988655,0.9297197,0.00008456236],"about_ca_topic_score_codex":0.0009177917,"about_ca_topic_score_gemma":0.0010720091,"teacher_disagreement_score":0.10927987,"about_ca_system_score_codex":0.00047331487,"about_ca_system_score_gemma":0.0012379722,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026146855,0.00018055322,0.95591444,0.00042337063,0.00008236803,0.0002215651,0.00035622664,0.005807902,0.010866786],"genre_scores_gemma":[0.7314589,0.00041566655,0.24719375,0.0005657698,0.00015628326,0.0006293253,0.0008254684,0.0010610193,0.017693754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946291,0.0010254212,0.00035931822,0.0008829484,0.0022312223,0.00087211264],"domain_scores_gemma":[0.98917085,0.003687735,0.0011209633,0.0041976096,0.0015016334,0.00032117483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003990627,0.000791254,0.00067875365,0.0012199065,0.0010478691,0.0021760126,0.0021887065,0.0010531688,0.004641553],"category_scores_gemma":[0.011337584,0.0006060168,0.0009047821,0.00079641456,0.0026946985,0.004214121,0.0031319433,0.0022073635,0.001264443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010612925,0.00029617257,0.0037302973,0.0004564556,0.000112912654,0.00034797593,0.001200323,0.06857,0.033271987,0.72791374,0.0104357,0.15260324],"study_design_scores_gemma":[0.00024255959,0.00027246555,0.0008697517,0.00019059812,0.00015719225,0.00026301524,0.0001131421,0.4610215,0.082246765,0.3970752,0.05744413,0.00010372448],"about_ca_topic_score_codex":0.0030273038,"about_ca_topic_score_gemma":0.0023876058,"teacher_disagreement_score":0.004641553,"about_ca_system_score_codex":0.0018570271,"about_ca_system_score_gemma":0.0025913455,"threshold_uncertainty_score":0.021104693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036931477,0.000092087124,0.94654155,0.00036645,0.00004785068,0.0001432697,0.00041033232,0.013987855,0.0014790323],"genre_scores_gemma":[0.5369441,0.00013985683,0.45649981,0.00048467758,0.00006378691,0.00027227055,0.0014288789,0.0025666503,0.0015999916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99062985,0.0021461302,0.0009330272,0.0018196305,0.0035237842,0.0009475828],"domain_scores_gemma":[0.96886384,0.017199408,0.0027545334,0.007161778,0.0036029662,0.00041751517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070084934,0.0010000269,0.0007736112,0.0014979145,0.0010472573,0.0032548218,0.0028779292,0.0011437294,0.003276645],"category_scores_gemma":[0.030534727,0.0013242724,0.0028716594,0.0009899932,0.0033880842,0.0072862557,0.004579221,0.0033403977,0.00086993753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015287428,0.00065073365,0.03481287,0.0014861671,0.00047861753,0.002373283,0.0029180744,0.21406664,0.1659772,0.23699144,0.0083765285,0.3303397],"study_design_scores_gemma":[0.00014558616,0.0001931551,0.0014332556,0.00014890225,0.00016923099,0.00040866743,0.00022552589,0.7244029,0.1559371,0.10794278,0.008888554,0.00010426387],"about_ca_topic_score_codex":0.0057587833,"about_ca_topic_score_gemma":0.007728996,"teacher_disagreement_score":0.0070084934,"about_ca_system_score_codex":0.0024118759,"about_ca_system_score_gemma":0.0044635297,"threshold_uncertainty_score":0.03706491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038549416,0.00012823562,0.94503117,0.00015316505,0.0001131574,0.00015214001,0.00010735333,0.009764152,0.0060011735],"genre_scores_gemma":[0.67542106,0.00022486586,0.31421036,0.00014588353,0.00004501814,0.00028340175,0.0002140257,0.003373871,0.00608161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987669,0.00020670389,0.000080750026,0.00017459664,0.00058742834,0.00018370918],"domain_scores_gemma":[0.9982192,0.0005817584,0.00023529991,0.0006525406,0.00028221615,0.000028977556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005956134,0.00082862657,0.00049313775,0.0009329155,0.00048410395,0.0008241098,0.00075413607,0.0005256432,0.0035537821],"category_scores_gemma":[0.0030323956,0.00044238038,0.0007443137,0.0005951424,0.001043381,0.0010551397,0.0009210829,0.0012638795,0.0010359318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005846546,0.00041544857,0.0052457857,0.00069279777,0.00007759999,0.0011196982,0.0011095911,0.15472914,0.28609565,0.15624024,0.006430717,0.38725865],"study_design_scores_gemma":[0.00007373331,0.00040510498,0.0016146059,0.0000832053,0.00011373922,0.00080482726,0.00011344251,0.43410036,0.4700522,0.04478157,0.04775596,0.00010118569],"about_ca_topic_score_codex":0.00083701895,"about_ca_topic_score_gemma":0.00085142325,"teacher_disagreement_score":0.0035537821,"about_ca_system_score_codex":0.000707699,"about_ca_system_score_gemma":0.0013898985,"threshold_uncertainty_score":0.011888564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07590454,0.00023945924,0.90052634,0.0007382353,0.00009962708,0.00018660634,0.00010929546,0.013547725,0.0086482465],"genre_scores_gemma":[0.593736,0.0003946146,0.40118763,0.00031858942,0.00008910379,0.00011906883,0.00024264815,0.0009752704,0.0029370287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950972,0.0015800964,0.00036412713,0.00047688826,0.0020407115,0.00044094233],"domain_scores_gemma":[0.97541034,0.014197867,0.0024882436,0.004566562,0.0030074017,0.00032952699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055000414,0.00092528836,0.00045935056,0.0020228897,0.00073404174,0.0020413646,0.001518203,0.00082238164,0.0027539309],"category_scores_gemma":[0.020452423,0.0007723744,0.000898717,0.00059123506,0.0023752442,0.00463808,0.0029116466,0.0016048256,0.0010340671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006268057,0.00069089886,0.013825656,0.0009030612,0.00011138171,0.0026757114,0.003456033,0.08217061,0.19486831,0.3465855,0.005758822,0.34832725],"study_design_scores_gemma":[0.00016124331,0.00036952217,0.001618785,0.0002888051,0.00022703297,0.001394042,0.00032601523,0.6093922,0.2274799,0.12792894,0.030659575,0.0001539399],"about_ca_topic_score_codex":0.0015558397,"about_ca_topic_score_gemma":0.0014386222,"teacher_disagreement_score":0.0055000414,"about_ca_system_score_codex":0.00074888277,"about_ca_system_score_gemma":0.0019759028,"threshold_uncertainty_score":0.029087365},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037656434,0.0015064222,0.6089356,0.0026171962,0.00076410885,0.00041233984,0.0028389462,0.047673903,0.29759496],"genre_scores_gemma":[0.4576782,0.0011150779,0.29510957,0.0020755245,0.000337837,0.00059027795,0.006721892,0.004415637,0.23195605],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999479,0.00007140705,0.000030724328,0.00012242833,0.00022735073,0.00006915809],"domain_scores_gemma":[0.9991898,0.000104631916,0.000057953264,0.0004367391,0.00017165433,0.00003917311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039013755,0.00053595804,0.00023654028,0.0004938709,0.00051115535,0.0011101934,0.0010947682,0.00053876895,0.04638799],"category_scores_gemma":[0.0017032811,0.0002312157,0.00031259854,0.00041604927,0.00037167376,0.0016784422,0.0016461672,0.0008067606,0.017940443],"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.0003402984,0.00011806608,0.0014276701,0.0003695321,0.000027110638,0.00027601313,0.0001767549,0.004184798,0.04240767,0.084189296,0.11755483,0.748928],"study_design_scores_gemma":[0.000069315734,0.00024970176,0.0015990906,0.00012039901,0.000039594783,0.0009573389,0.00010159422,0.05682961,0.08222794,0.055146348,0.8026242,0.000034798806],"about_ca_topic_score_codex":0.00062813354,"about_ca_topic_score_gemma":0.0010034723,"teacher_disagreement_score":0.953612,"about_ca_system_score_codex":0.0005448839,"about_ca_system_score_gemma":0.0007238011,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01859411,0.00021796588,0.9730243,0.00042385297,0.00003982972,0.00008903241,0.00013310525,0.0005309358,0.0069468305],"genre_scores_gemma":[0.65879583,0.00071577955,0.33190772,0.00033160526,0.0001372612,0.0004190087,0.00048676183,0.00030534653,0.0069006444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724126,0.0008170107,0.00021746152,0.00033530916,0.0010955167,0.00029349537],"domain_scores_gemma":[0.99504095,0.0028856026,0.00057935005,0.0006543403,0.0007462507,0.000093590046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025385187,0.00089170306,0.0004552369,0.0012879635,0.0006852588,0.0020328988,0.0013055322,0.0009293438,0.0026107584],"category_scores_gemma":[0.0058575724,0.0005372213,0.0017081926,0.0005121659,0.0032420242,0.0029021008,0.0011442368,0.0016172087,0.000523733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030124413,0.00008164134,0.00074722467,0.00014243186,0.000034584118,0.00027971077,0.00038774378,0.15688755,0.0060372204,0.82526547,0.0006205729,0.009485783],"study_design_scores_gemma":[0.00003804441,0.000049758397,0.00018092373,0.000060358117,0.00003948206,0.00010043701,0.00009403142,0.5203697,0.007379261,0.46236515,0.009293571,0.00002936633],"about_ca_topic_score_codex":0.0036465654,"about_ca_topic_score_gemma":0.002356107,"teacher_disagreement_score":0.0036465654,"about_ca_system_score_codex":0.002217726,"about_ca_system_score_gemma":0.0022278014,"threshold_uncertainty_score":0.01609081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017394766,0.0024503837,0.86543554,0.0034331987,0.0011052706,0.0015436907,0.001153934,0.07612646,0.031356677],"genre_scores_gemma":[0.568997,0.0028139036,0.3986998,0.0033392648,0.0009796905,0.0012578216,0.0041581746,0.0030509294,0.01670336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959943,0.0007174982,0.0003081166,0.00043545302,0.0018527538,0.0006918391],"domain_scores_gemma":[0.99519724,0.0009256554,0.0005851329,0.0016056873,0.0011328239,0.0005534726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004542958,0.0012635232,0.0009775488,0.0031160258,0.0021703513,0.005315156,0.0023732553,0.0022707204,0.005172533],"category_scores_gemma":[0.00881245,0.00046930407,0.001506424,0.0018445757,0.002866942,0.0042272317,0.0027807597,0.0031039035,0.00218154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001302304,0.0006872713,0.009086883,0.0010266254,0.00024092542,0.0010588444,0.0012199259,0.025309874,0.029057449,0.40378767,0.0907442,0.43647796],"study_design_scores_gemma":[0.00030826253,0.00045173935,0.0036626274,0.00068636425,0.00020071733,0.0013024786,0.0002802205,0.39569455,0.04875075,0.15433964,0.3939878,0.00033488465],"about_ca_topic_score_codex":0.013496301,"about_ca_topic_score_gemma":0.005977343,"teacher_disagreement_score":0.013496301,"about_ca_system_score_codex":0.0034650944,"about_ca_system_score_gemma":0.007122902,"threshold_uncertainty_score":0.026835501},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02875413,0.0003757431,0.958104,0.002460098,0.00006989824,0.00012039224,0.00015536172,0.0006763237,0.009283998],"genre_scores_gemma":[0.8192088,0.0007035051,0.17357966,0.00079722784,0.00029129654,0.00038638173,0.00028424975,0.00027519235,0.0044737128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98653907,0.0047940486,0.0009416318,0.0024934998,0.003530269,0.0017014428],"domain_scores_gemma":[0.94694126,0.040442217,0.0042926664,0.004733493,0.0022815622,0.0013087136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016112275,0.002093665,0.0015207315,0.0030760805,0.0019140308,0.008006073,0.0052169473,0.00490289,0.0052115875],"category_scores_gemma":[0.059429727,0.002046689,0.0039497437,0.0012360987,0.0076750536,0.015892291,0.0073927403,0.0071972897,0.0007858333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062471714,0.00004342059,0.0009185375,0.00012510814,0.00010748217,0.0002265876,0.00034411403,0.10718234,0.0010415433,0.88236475,0.00085055974,0.0067331474],"study_design_scores_gemma":[0.000035645637,0.00003330819,0.00014833664,0.00004649049,0.00006047588,0.00011525519,0.000078382305,0.25193217,0.001004076,0.74459296,0.0019228187,0.000030113546],"about_ca_topic_score_codex":0.0027337994,"about_ca_topic_score_gemma":0.0018383521,"teacher_disagreement_score":0.016112275,"about_ca_system_score_codex":0.004442555,"about_ca_system_score_gemma":0.0022760557,"threshold_uncertainty_score":0.08521092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21280779,0.00036471835,0.7370413,0.00026166037,0.00024968642,0.00036378455,0.0001111994,0.032654658,0.016145222],"genre_scores_gemma":[0.8890543,0.00014024637,0.10001054,0.00021115286,0.00006678537,0.00013599239,0.00012998383,0.0021283128,0.008122638],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988091,0.00017427994,0.000093067625,0.00018999542,0.00044604938,0.00028745114],"domain_scores_gemma":[0.99592185,0.0007135093,0.0003032971,0.0022166816,0.00046628414,0.00037836249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014438377,0.00061800296,0.0005016078,0.0006175649,0.0007980068,0.0022098275,0.0018328609,0.00069890346,0.0059667844],"category_scores_gemma":[0.005519606,0.0006570432,0.00049733056,0.00035859592,0.0019988052,0.0033864279,0.004274266,0.0018268592,0.0011025481],"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.003778504,0.001021959,0.030760352,0.000656046,0.00015439563,0.002291195,0.010519394,0.030269228,0.24791251,0.18181188,0.020962631,0.4698619],"study_design_scores_gemma":[0.0002816041,0.0012890536,0.0068922313,0.00014269557,0.00020272098,0.0018193035,0.00076545955,0.29793784,0.50190425,0.044090416,0.1444073,0.00026718603],"about_ca_topic_score_codex":0.0014251359,"about_ca_topic_score_gemma":0.0012709801,"teacher_disagreement_score":0.0059667844,"about_ca_system_score_codex":0.0008644904,"about_ca_system_score_gemma":0.001363687,"threshold_uncertainty_score":0.01996088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8845698,0.00016094476,0.11108396,0.000095809286,0.00001713525,0.000053634365,0.00067231106,0.001926501,0.0014200205],"genre_scores_gemma":[0.92193246,0.000056081062,0.07616975,0.000013917875,0.000007935627,0.000075561606,0.0011920359,0.00017561881,0.0003767813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781203,0.0004291478,0.00017366353,0.0005351538,0.0008117272,0.00023821577],"domain_scores_gemma":[0.9831104,0.0126912175,0.0016153387,0.001323955,0.001003686,0.00025545017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00222461,0.0009568257,0.00057290547,0.0036946551,0.00061954686,0.0012865235,0.00077401276,0.0008907235,0.0015882818],"category_scores_gemma":[0.019307237,0.000591954,0.0014150558,0.0014347088,0.001087068,0.0024571666,0.0009915465,0.00094205077,0.00016837317],"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.0007030365,0.00025202372,0.10375784,0.00030815625,0.00020762127,0.0008131082,0.00080590893,0.79872966,0.013119773,0.019743187,0.0013086251,0.06025101],"study_design_scores_gemma":[0.00001205341,0.000045036933,0.0038898555,0.0000146346465,0.000030007102,0.00016010283,0.00007024236,0.9838727,0.0051323064,0.0062769325,0.00048156138,0.000014565139],"about_ca_topic_score_codex":0.004005841,"about_ca_topic_score_gemma":0.003688263,"teacher_disagreement_score":0.004005841,"about_ca_system_score_codex":0.0014723971,"about_ca_system_score_gemma":0.0010271237,"threshold_uncertainty_score":0.011765003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02036628,0.00028121567,0.9454259,0.0003909323,0.0002770764,0.00016616743,0.00034438627,0.020468527,0.012279512],"genre_scores_gemma":[0.6131123,0.00028215587,0.36227015,0.00072267174,0.0002453843,0.0003432064,0.0016190886,0.006382168,0.015022954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938314,0.001512744,0.00048553557,0.0010180047,0.002369099,0.00078314816],"domain_scores_gemma":[0.99155617,0.0039756894,0.00035686465,0.002702086,0.001249137,0.0001599905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027377647,0.0009569141,0.0010294778,0.0010851807,0.0010576074,0.0032945275,0.0025194664,0.0012842261,0.012054119],"category_scores_gemma":[0.009798545,0.0008829512,0.0021997478,0.0007810426,0.0031736027,0.0048925597,0.0048468495,0.0034381172,0.0049072285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011244888,0.00041001203,0.0022344412,0.0012129808,0.00019039275,0.0012142493,0.0015504868,0.07020931,0.082962304,0.4971173,0.019474834,0.3222992],"study_design_scores_gemma":[0.0002192508,0.00017644065,0.0004088105,0.00015122932,0.00018105409,0.00037705846,0.00016768144,0.3749566,0.09871762,0.5022142,0.022296831,0.00013326494],"about_ca_topic_score_codex":0.0015335184,"about_ca_topic_score_gemma":0.0021864218,"teacher_disagreement_score":0.012054119,"about_ca_system_score_codex":0.0016441928,"about_ca_system_score_gemma":0.0019255063,"threshold_uncertainty_score":0.040325046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02602799,0.0469358,0.68044025,0.1662855,0.008785187,0.00019528421,0.0009335762,0.009887051,0.060509413],"genre_scores_gemma":[0.45702535,0.043898072,0.40594456,0.027273998,0.0050617545,0.00022634826,0.0018220942,0.00469862,0.054049198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99136764,0.0017228173,0.000496942,0.0008685167,0.0051352656,0.00040873577],"domain_scores_gemma":[0.95715,0.01721912,0.002138321,0.013425928,0.009336713,0.0007299505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008404911,0.00063662947,0.0005888217,0.0009558903,0.0018346424,0.0052958652,0.0017035512,0.0029274293,0.008770946],"category_scores_gemma":[0.03166431,0.00062503864,0.0008779997,0.0008049779,0.007417158,0.018170021,0.002748704,0.0056716427,0.005533847],"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.00010859128,0.00004540763,0.0038023966,0.0015291622,0.000114685296,0.00057444564,0.0012926299,0.0030719417,0.009484811,0.57725674,0.0882213,0.31449786],"study_design_scores_gemma":[0.000041623454,0.00012179635,0.0017288324,0.00091960083,0.000070520175,0.0022582603,0.000816398,0.00498499,0.012907839,0.35846055,0.61758494,0.000104746985],"about_ca_topic_score_codex":0.0020355936,"about_ca_topic_score_gemma":0.0016427289,"teacher_disagreement_score":0.008770946,"about_ca_system_score_codex":0.002172269,"about_ca_system_score_gemma":0.0034909323,"threshold_uncertainty_score":0.044449925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06929,0.0005169048,0.9138204,0.0017040047,0.00015230403,0.00014608668,0.00009704512,0.006277879,0.00799538],"genre_scores_gemma":[0.74232596,0.0005421003,0.25261077,0.0006990935,0.00017881874,0.00016801589,0.0001446622,0.0011077576,0.0022227329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927187,0.001788954,0.00062502257,0.0011086491,0.0026292359,0.00112943],"domain_scores_gemma":[0.9692523,0.0126501145,0.0030174584,0.010845108,0.0035021694,0.0007328939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006964155,0.0010610421,0.001150283,0.0016790321,0.0013908619,0.00443205,0.002676261,0.0020525996,0.003235388],"category_scores_gemma":[0.0391334,0.0011750791,0.0016551426,0.0007448508,0.0064101806,0.0116168745,0.006546968,0.004475154,0.0012016051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069057004,0.00047407736,0.011783676,0.0012513418,0.00018818503,0.00074035785,0.0020144503,0.05689732,0.09553789,0.6830141,0.006696963,0.14071108],"study_design_scores_gemma":[0.00015979412,0.0007515823,0.0019535443,0.0004930772,0.0003103065,0.0011232606,0.0004749734,0.33343953,0.23665898,0.3928069,0.031583294,0.00024472887],"about_ca_topic_score_codex":0.0007610607,"about_ca_topic_score_gemma":0.000593649,"teacher_disagreement_score":0.006964155,"about_ca_system_score_codex":0.0011444401,"about_ca_system_score_gemma":0.0031431287,"threshold_uncertainty_score":0.036830425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036056954,0.00040700258,0.953381,0.00073958636,0.00004644874,0.00023135768,0.0004017642,0.0010126657,0.0077231657],"genre_scores_gemma":[0.7176591,0.00091285096,0.27087954,0.00039596265,0.0001971872,0.0011071458,0.0013143349,0.000320018,0.0072138775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9905599,0.003203727,0.0009279402,0.0015597764,0.0027009442,0.0010477677],"domain_scores_gemma":[0.9776813,0.015770413,0.0016438798,0.0030066988,0.00132062,0.0005770974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006125074,0.0015263051,0.0012236165,0.0013157079,0.0016900887,0.0041059246,0.0023792698,0.0017779252,0.0030155228],"category_scores_gemma":[0.016202819,0.0013038191,0.0030789168,0.0015342896,0.0060998946,0.007263551,0.0037638939,0.0039757066,0.00052081206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007441977,0.00007457102,0.0011319871,0.00016280945,0.00006026823,0.0005174232,0.00091604656,0.120232955,0.0016676268,0.86663866,0.0006017718,0.007921507],"study_design_scores_gemma":[0.000061793864,0.00005818614,0.000121996025,0.00004026652,0.000051805062,0.00012813209,0.00011931861,0.26789656,0.003124498,0.7226862,0.0056858864,0.000025356523],"about_ca_topic_score_codex":0.006780417,"about_ca_topic_score_gemma":0.006509923,"teacher_disagreement_score":0.006780417,"about_ca_system_score_codex":0.0032300164,"about_ca_system_score_gemma":0.003981181,"threshold_uncertainty_score":0.03239292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081808254,0.0094377855,0.6927819,0.0078021996,0.0006616634,0.00032930708,0.00038756148,0.0032879857,0.20350336],"genre_scores_gemma":[0.7635464,0.007052472,0.16119167,0.0011877026,0.0005882544,0.0003494128,0.0006068176,0.0006334632,0.064843744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00019888087,0.0000823322,0.00017897732,0.0007903224,0.00022019837],"domain_scores_gemma":[0.9990977,0.00031281868,0.00014238754,0.00022598151,0.00019240264,0.000028774664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078726973,0.00057161006,0.00041337032,0.001109326,0.00093833153,0.0030818617,0.0007238466,0.0009295457,0.007938189],"category_scores_gemma":[0.0026478048,0.0004730706,0.00049397285,0.00087342295,0.0020551719,0.0045155846,0.0014128812,0.002522024,0.0016751752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008356275,0.000033754353,0.0011004432,0.00015656484,0.000011299221,0.0001479108,0.00045794982,0.020136654,0.0036470282,0.8906347,0.013756649,0.069833495],"study_design_scores_gemma":[0.000025568123,0.00030322868,0.0034202482,0.00045089683,0.00004523636,0.0008397745,0.0004872099,0.19359672,0.023666516,0.45334923,0.3237482,0.00006725494],"about_ca_topic_score_codex":0.0017345812,"about_ca_topic_score_gemma":0.0014224004,"teacher_disagreement_score":0.007938189,"about_ca_system_score_codex":0.0025367686,"about_ca_system_score_gemma":0.0017134829,"threshold_uncertainty_score":0.026555836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129607385,0.00014571396,0.9631769,0.00048544654,0.00019755792,0.00023967789,0.0009939839,0.014961036,0.0068388884],"genre_scores_gemma":[0.55357057,0.0005490753,0.42081708,0.0006175033,0.00034657613,0.0006957007,0.0034224044,0.004662649,0.01531851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99110293,0.0026915837,0.0010731332,0.0011715055,0.003369312,0.0005915146],"domain_scores_gemma":[0.958658,0.021739887,0.003026336,0.010689936,0.005227923,0.0006579237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009135719,0.001008638,0.00061086385,0.0014636569,0.0010940613,0.0029195938,0.002577342,0.0014451294,0.010993754],"category_scores_gemma":[0.037882987,0.0010122432,0.0011207098,0.00088366074,0.002868821,0.009742446,0.0033085789,0.0027728858,0.0027067775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014959717,0.00043773037,0.012319567,0.0014483181,0.00016504884,0.0024325072,0.0038579337,0.07414502,0.025957638,0.6088566,0.030268487,0.2386152],"study_design_scores_gemma":[0.0002590307,0.00047396822,0.0021519244,0.0006926526,0.00020843555,0.001189113,0.0006804229,0.3653067,0.103111915,0.32667822,0.19904841,0.00019921141],"about_ca_topic_score_codex":0.0033037097,"about_ca_topic_score_gemma":0.0028883845,"teacher_disagreement_score":0.010993754,"about_ca_system_score_codex":0.0010730221,"about_ca_system_score_gemma":0.003125679,"threshold_uncertainty_score":0.04831493},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009870373,0.00033300722,0.88876116,0.0011626764,0.00035698668,0.00013516594,0.0018814146,0.07082032,0.026678918],"genre_scores_gemma":[0.18060142,0.0005353266,0.7748162,0.001719294,0.00054739736,0.0002467019,0.00742004,0.016683664,0.017429926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996258,0.0005444446,0.00028452615,0.00044083738,0.0021501137,0.00032211654],"domain_scores_gemma":[0.9926674,0.0018600728,0.00039117888,0.0027158624,0.0021056924,0.00025977654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412938,0.00078687817,0.0006729862,0.0017350701,0.00080209004,0.0035756358,0.002413542,0.00086119235,0.016231941],"category_scores_gemma":[0.00942819,0.00070021517,0.001151103,0.0010927088,0.0019339886,0.0053058346,0.0031919945,0.0025528106,0.008663601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011711,0.00028618958,0.0089191,0.0006351889,0.00009647221,0.0004258608,0.000479101,0.02415611,0.049989026,0.12476344,0.24826247,0.54081607],"study_design_scores_gemma":[0.000214808,0.00023334115,0.003342469,0.00019943192,0.00009058882,0.0007212999,0.00025646083,0.41260964,0.13897054,0.0710546,0.37214413,0.00016266313],"about_ca_topic_score_codex":0.0031847155,"about_ca_topic_score_gemma":0.0044155936,"teacher_disagreement_score":0.016231941,"about_ca_system_score_codex":0.0013340114,"about_ca_system_score_gemma":0.0024101427,"threshold_uncertainty_score":0.05430132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078281276,0.00007668282,0.9082947,0.0003371394,0.000105394654,0.0001789042,0.00014549388,0.0051860325,0.0073943743],"genre_scores_gemma":[0.870737,0.00007191033,0.12422835,0.00015069998,0.000034190434,0.00016348549,0.00017397398,0.000221233,0.00421912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986545,0.00020677704,0.00016121361,0.00026512792,0.0004908545,0.00022156937],"domain_scores_gemma":[0.99774665,0.00053416775,0.0002441477,0.0010001925,0.00038327824,0.000091584814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512812,0.0005055616,0.0003711115,0.00048670336,0.0007554826,0.00152299,0.0008970257,0.0005953483,0.0034443196],"category_scores_gemma":[0.0032118596,0.0002593221,0.00075486087,0.0004145022,0.0014236633,0.0029376014,0.0022145072,0.0011502496,0.0007820216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019001368,0.00048735278,0.006470071,0.0002723704,0.000117559706,0.0007916055,0.00082651805,0.23851815,0.16081946,0.32809296,0.009929415,0.25177437],"study_design_scores_gemma":[0.00007635703,0.00015939948,0.0004971735,0.000032561107,0.000031797943,0.00015299811,0.00004304211,0.77356505,0.14367913,0.071590774,0.0101266485,0.00004511751],"about_ca_topic_score_codex":0.0018113143,"about_ca_topic_score_gemma":0.0016789768,"teacher_disagreement_score":0.0034443196,"about_ca_system_score_codex":0.0013283759,"about_ca_system_score_gemma":0.0019676415,"threshold_uncertainty_score":0.011522353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48325127,0.0032787593,0.3704478,0.0014436629,0.0017074698,0.0014246376,0.0027527183,0.034210306,0.10148341],"genre_scores_gemma":[0.75798064,0.00062777364,0.22072507,0.00048203033,0.00010258606,0.00056436216,0.0045346543,0.0061841654,0.008798751],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9794094,0.004819201,0.0014647539,0.0015823824,0.011680727,0.0010435241],"domain_scores_gemma":[0.9533452,0.020016883,0.0024415466,0.0061213174,0.01682689,0.001248295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01461328,0.00090834126,0.00047130397,0.00177856,0.0007772982,0.0032707525,0.0018128062,0.0009789664,0.003145426],"category_scores_gemma":[0.074369214,0.00038049743,0.0005149895,0.0010967593,0.0011717393,0.004767121,0.0027584238,0.0014606426,0.0016034303],"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.0039247302,0.0018542747,0.0840328,0.0026578412,0.00026508482,0.00059642206,0.0038903179,0.033801217,0.03577515,0.0653958,0.04557605,0.7222303],"study_design_scores_gemma":[0.0005974845,0.0044427393,0.069830656,0.0012071378,0.0004859968,0.0016866081,0.0036482383,0.5489652,0.12092972,0.036521614,0.21121669,0.00046787737],"about_ca_topic_score_codex":0.0053694625,"about_ca_topic_score_gemma":0.0041528703,"teacher_disagreement_score":0.01461328,"about_ca_system_score_codex":0.001612837,"about_ca_system_score_gemma":0.0021574558,"threshold_uncertainty_score":0.07728338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0647949,0.0004178548,0.6979674,0.00016552527,0.00025762065,0.0002548813,0.00076829037,0.22999251,0.0053810147],"genre_scores_gemma":[0.7373565,0.00022270481,0.2239046,0.00060187385,0.00009706277,0.0003057321,0.001683672,0.0216932,0.01413474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991749,0.00012753584,0.00006687082,0.00027719804,0.00022357763,0.00013000859],"domain_scores_gemma":[0.99893516,0.00036889972,0.00009225924,0.0003787321,0.0001598597,0.000065065076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353828,0.0012945585,0.00071630505,0.0008286554,0.00042013123,0.0010371632,0.0015682791,0.0007053629,0.0095332945],"category_scores_gemma":[0.0021541324,0.0006524545,0.00074047566,0.00031636603,0.0005456125,0.0018425997,0.0011446844,0.0012229367,0.0017949134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005574592,0.00058664085,0.01596659,0.0010897116,0.00038313097,0.001542188,0.0012830154,0.020144263,0.25606453,0.016658181,0.061856475,0.6188507],"study_design_scores_gemma":[0.00047173235,0.00084885344,0.0054622926,0.00013412573,0.0002634691,0.0011199273,0.00010745418,0.38907647,0.5402642,0.010379465,0.051704563,0.00016742914],"about_ca_topic_score_codex":0.001511566,"about_ca_topic_score_gemma":0.0015984763,"teacher_disagreement_score":0.0095332945,"about_ca_system_score_codex":0.00062176544,"about_ca_system_score_gemma":0.0008708689,"threshold_uncertainty_score":0.031892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01621266,0.00039602045,0.97639716,0.00034083502,0.00013729543,0.00017022072,0.00005958642,0.0012840679,0.0050020614],"genre_scores_gemma":[0.81778044,0.00041781735,0.17158155,0.00019431535,0.0001325645,0.00023926853,0.00017942821,0.00008263136,0.009392042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790883,0.00045958353,0.0001854391,0.00035155338,0.0008431293,0.00025136274],"domain_scores_gemma":[0.998137,0.0002844976,0.00020155286,0.00064221816,0.00063150155,0.00010328238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336523,0.0005788416,0.0005684155,0.000824723,0.0011857479,0.0013872868,0.0013603587,0.0011804152,0.0035655978],"category_scores_gemma":[0.00309877,0.00029371175,0.00075824757,0.0006539782,0.0013452863,0.0031346658,0.0018033029,0.0015636554,0.0013392619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008520795,0.00014245097,0.0007956947,0.00035472465,0.00012617472,0.00048623607,0.0006187517,0.062668934,0.116739854,0.65945953,0.008987861,0.14876777],"study_design_scores_gemma":[0.00013006011,0.00047183988,0.0004695922,0.00007515954,0.0001323673,0.0007897364,0.000090820584,0.7989653,0.07536629,0.09700412,0.026356908,0.00014776614],"about_ca_topic_score_codex":0.00083517225,"about_ca_topic_score_gemma":0.00046026226,"teacher_disagreement_score":0.0035655978,"about_ca_system_score_codex":0.0016014499,"about_ca_system_score_gemma":0.0016318508,"threshold_uncertainty_score":0.011928141},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02659485,0.00027374196,0.9639767,0.0007649423,0.0001289423,0.00023647482,0.000054158354,0.0051173586,0.002852889],"genre_scores_gemma":[0.6491717,0.00026534437,0.34453565,0.0003730932,0.00012523388,0.00031238786,0.0001687572,0.0006373584,0.004410489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99355644,0.0023975074,0.00086820946,0.0009309555,0.0017909692,0.00045594358],"domain_scores_gemma":[0.98943794,0.0031644362,0.0013177037,0.004718343,0.00089095696,0.00047052017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011309675,0.00056913815,0.0006022525,0.00069172645,0.0011941339,0.003969999,0.0019684574,0.0016593711,0.0018760455],"category_scores_gemma":[0.020463422,0.000837795,0.00080670335,0.0006673434,0.0025455542,0.0049709617,0.0027665892,0.0030750188,0.00067449897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010087047,0.00038411224,0.007571872,0.00047058417,0.00012779082,0.0008008029,0.0020606285,0.11861325,0.042937428,0.7149252,0.005424517,0.1056751],"study_design_scores_gemma":[0.00016136683,0.00013469903,0.0011103962,0.000103740385,0.00009625027,0.00025929572,0.00013001316,0.7969117,0.03542402,0.12965055,0.035941865,0.00007617473],"about_ca_topic_score_codex":0.0016647666,"about_ca_topic_score_gemma":0.0013466264,"teacher_disagreement_score":0.011309675,"about_ca_system_score_codex":0.0020847348,"about_ca_system_score_gemma":0.0026741491,"threshold_uncertainty_score":0.05981195},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011511486,0.0009230933,0.5875213,0.0027671482,0.0009654111,0.00096337846,0.0038372737,0.2490845,0.14242646],"genre_scores_gemma":[0.1966873,0.0012639774,0.4959288,0.0038031137,0.000431787,0.0015438545,0.022083415,0.05116068,0.22709697],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964101,0.0004871247,0.0002881415,0.0005099232,0.0020112407,0.00029345384],"domain_scores_gemma":[0.99184966,0.0013575391,0.00039881593,0.0038192882,0.0021675855,0.0004071282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036190727,0.0010014958,0.00065039954,0.0011877206,0.0009497114,0.004188371,0.0037179622,0.0025347904,0.07155126],"category_scores_gemma":[0.018093435,0.0011696066,0.001039117,0.0007718414,0.0017240028,0.009950041,0.0046809604,0.004452563,0.04040299],"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.0011903242,0.00044305294,0.0025083993,0.0011356111,0.00009278648,0.0008959104,0.00062321266,0.0076761036,0.02202065,0.22872962,0.4225884,0.3120959],"study_design_scores_gemma":[0.00019076763,0.00029683873,0.0006744196,0.00018824794,0.000027877828,0.0013678356,0.00009304235,0.048966233,0.03197992,0.0528271,0.8632663,0.000121399404],"about_ca_topic_score_codex":0.0013150389,"about_ca_topic_score_gemma":0.0015828883,"teacher_disagreement_score":0.07155126,"about_ca_system_score_codex":0.0011588974,"about_ca_system_score_gemma":0.0022701132,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049041277,0.0077659343,0.92973566,0.019181961,0.0008336746,0.00010262947,0.00019207569,0.001653601,0.035630345],"genre_scores_gemma":[0.40726805,0.013286994,0.53476757,0.0088641485,0.002179894,0.00073143595,0.0004885451,0.0035672693,0.028846128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9786362,0.011609329,0.0012914984,0.0018101505,0.0060095754,0.0006433301],"domain_scores_gemma":[0.88544804,0.08397003,0.003601478,0.020359574,0.0056981053,0.00092282146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024221634,0.0015190273,0.001021258,0.0020341624,0.002567437,0.008710853,0.002702722,0.0038981894,0.011512674],"category_scores_gemma":[0.09593724,0.0015414637,0.0014572394,0.002085741,0.02150046,0.028102476,0.0066547166,0.010338666,0.003748906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039271727,0.000018117886,0.00021033727,0.00027806094,0.00001414033,0.00013115731,0.00073264516,0.0013502053,0.00043285362,0.9622563,0.0043883813,0.030148605],"study_design_scores_gemma":[0.000017937184,0.000013540212,0.000055955985,0.00020193424,0.000011337141,0.00019119296,0.000092034024,0.0023271712,0.0010126032,0.9632841,0.03277596,0.000016253476],"about_ca_topic_score_codex":0.0018504311,"about_ca_topic_score_gemma":0.00092385814,"teacher_disagreement_score":0.024221634,"about_ca_system_score_codex":0.0030635593,"about_ca_system_score_gemma":0.0035353387,"threshold_uncertainty_score":0.12809777},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056679007,0.00542139,0.20883039,0.0047201477,0.0037157212,0.0009359205,0.019290406,0.29383183,0.40657523],"genre_scores_gemma":[0.3630265,0.0023030287,0.096573934,0.0053165415,0.00075176085,0.0010854534,0.020585285,0.0497495,0.460608],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992347,0.00011482235,0.000059768616,0.00016401257,0.0002659588,0.00016073385],"domain_scores_gemma":[0.997965,0.00031436558,0.000111955575,0.0011590597,0.00033320644,0.00011646934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072020525,0.0011461257,0.0006062386,0.0010381296,0.00080076884,0.0018776379,0.0020897475,0.0009233526,0.09960424],"category_scores_gemma":[0.0040516006,0.0006419625,0.00063215103,0.00071468053,0.0007238797,0.004763075,0.0038298117,0.0010554524,0.040362723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029053548,0.00016071407,0.0035909954,0.0013317156,0.00014413161,0.0010144035,0.0007089834,0.0017628457,0.0202069,0.048357673,0.5376856,0.38213077],"study_design_scores_gemma":[0.00016748773,0.00015593779,0.0015711668,0.00026092058,0.00007797331,0.00077955134,0.000144961,0.0096812155,0.04506915,0.025224295,0.91677576,0.00009165973],"about_ca_topic_score_codex":0.0014198959,"about_ca_topic_score_gemma":0.0024330912,"teacher_disagreement_score":0.09960424,"about_ca_system_score_codex":0.00075564143,"about_ca_system_score_gemma":0.0007856008,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036174964,0.0002927683,0.9425885,0.0011289904,0.00021369908,0.0001505617,0.0002039909,0.006942513,0.01230402],"genre_scores_gemma":[0.5292869,0.00038232253,0.44662654,0.0015524303,0.00019762156,0.00034817687,0.00036588073,0.0032267529,0.0180134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99183697,0.0018555884,0.000664758,0.0013165498,0.0032324297,0.0010936628],"domain_scores_gemma":[0.9791126,0.00643632,0.001446593,0.009272465,0.0031308343,0.00060110353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077179973,0.0010093839,0.00089039386,0.0014567288,0.0017021374,0.004791109,0.0038727962,0.0024896397,0.004345438],"category_scores_gemma":[0.023575803,0.0015873293,0.002767801,0.0011015282,0.008619728,0.012570535,0.010669696,0.006486484,0.0023526575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014108303,0.00004342367,0.0017928521,0.00018864004,0.00003054888,0.000332699,0.002254551,0.008233579,0.0070978496,0.9480861,0.0020902138,0.02970845],"study_design_scores_gemma":[0.00011489086,0.0001895985,0.000537665,0.000333268,0.00013310173,0.000719315,0.0005068104,0.07059957,0.036899354,0.7900064,0.099730596,0.00022945512],"about_ca_topic_score_codex":0.0032986735,"about_ca_topic_score_gemma":0.0034023956,"teacher_disagreement_score":0.0077179973,"about_ca_system_score_codex":0.0020461797,"about_ca_system_score_gemma":0.0041299183,"threshold_uncertainty_score":0.04081714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1311709,0.0009821214,0.8452787,0.0017796356,0.00021280031,0.0005009559,0.00019840221,0.007021359,0.012855163],"genre_scores_gemma":[0.8314744,0.00037730613,0.16172192,0.00033659168,0.000045382192,0.00014746746,0.00024713587,0.0001233776,0.0055263764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996451,0.000047058536,0.000028732336,0.000070813,0.00011965712,0.00008863748],"domain_scores_gemma":[0.9991899,0.000120082885,0.00011247764,0.00024714548,0.00016917501,0.00016122054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064195367,0.0003033711,0.00025412513,0.0004969351,0.0008968825,0.0014488348,0.0015866002,0.00080057007,0.0017493039],"category_scores_gemma":[0.0011640365,0.00029261556,0.000423128,0.0003127926,0.0007104997,0.0029728042,0.0023157396,0.0012194203,0.00059871987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090463366,0.0009528525,0.016559957,0.00074067345,0.00035667332,0.0028704924,0.002921858,0.16694918,0.17496057,0.31237575,0.0335932,0.28681412],"study_design_scores_gemma":[0.000036038287,0.00021075517,0.003092444,0.00008601336,0.00012461504,0.00090788066,0.00039703277,0.87302345,0.033228837,0.049408436,0.039401934,0.00008260827],"about_ca_topic_score_codex":0.0024444936,"about_ca_topic_score_gemma":0.0053734905,"teacher_disagreement_score":0.0024444936,"about_ca_system_score_codex":0.0009797249,"about_ca_system_score_gemma":0.0010824136,"threshold_uncertainty_score":0.0071083903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6826563,0.003763505,0.26085353,0.0010389483,0.00047160764,0.0011548407,0.0014601854,0.020976853,0.02762424],"genre_scores_gemma":[0.87307966,0.000965029,0.12052485,0.00010296754,0.000037214635,0.00037886092,0.0016827034,0.001326589,0.001902105],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9783966,0.0054339343,0.0015129476,0.0014371714,0.011929378,0.0012899588],"domain_scores_gemma":[0.9483087,0.02895145,0.0030039265,0.007826039,0.011221936,0.0006879968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008624692,0.0021171132,0.00069047796,0.00579761,0.000862704,0.0024309175,0.0026142374,0.001121076,0.0024927007],"category_scores_gemma":[0.044683017,0.00070118974,0.0010097389,0.0025183547,0.0013259117,0.004628402,0.0027117506,0.0016979809,0.0006664879],"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.0028799328,0.0022265138,0.03184284,0.0025055064,0.00052517414,0.00069964945,0.0020112025,0.18476789,0.066913694,0.035547495,0.0100067165,0.66007346],"study_design_scores_gemma":[0.00029461822,0.0033900426,0.016326325,0.0011173466,0.00046388735,0.0007819153,0.0013347176,0.8044966,0.1273511,0.0139507055,0.030244108,0.00024865434],"about_ca_topic_score_codex":0.0027644746,"about_ca_topic_score_gemma":0.0015382994,"teacher_disagreement_score":0.008624692,"about_ca_system_score_codex":0.002276853,"about_ca_system_score_gemma":0.0027572461,"threshold_uncertainty_score":0.045612276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13362284,0.001256842,0.842556,0.0006066391,0.00014127456,0.00014626443,0.00013649749,0.016465614,0.00506806],"genre_scores_gemma":[0.84442776,0.0004848257,0.14979991,0.00024169768,0.000049362992,0.00007211216,0.00016158189,0.0013704601,0.0033923555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987055,0.0003029244,0.00010343379,0.00021365308,0.0004735822,0.00020080424],"domain_scores_gemma":[0.99617505,0.0012724265,0.00040316526,0.0016112167,0.0004524256,0.000085638465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001939482,0.0008655343,0.00038878058,0.001200906,0.00043479254,0.0014258844,0.0014105969,0.000715719,0.003091909],"category_scores_gemma":[0.0068127564,0.0006066427,0.0006145976,0.00048268866,0.0009615834,0.0029546083,0.0014166051,0.0020275929,0.00059598364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016432358,0.00024263251,0.018393327,0.0009338099,0.00013100781,0.00093214604,0.0013232986,0.049192525,0.27594936,0.14198598,0.008403936,0.5008687],"study_design_scores_gemma":[0.000284196,0.0014656646,0.00983208,0.0007036384,0.00035681197,0.0017671123,0.00025189636,0.36269444,0.44026572,0.061203003,0.120935135,0.00024029975],"about_ca_topic_score_codex":0.00094667193,"about_ca_topic_score_gemma":0.0009797366,"teacher_disagreement_score":0.003091909,"about_ca_system_score_codex":0.00067853637,"about_ca_system_score_gemma":0.0012547696,"threshold_uncertainty_score":0.010343432},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029927574,0.26590702,0.02012024,0.63586336,0.03647829,0.000022738184,0.00013577493,0.00013732052,0.038342517],"genre_scores_gemma":[0.26077387,0.34539667,0.025382502,0.17968671,0.14455171,0.0003206023,0.00030791998,0.001278265,0.04230181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9768485,0.012892596,0.0012458606,0.0018571625,0.0059679043,0.0011879153],"domain_scores_gemma":[0.86012924,0.11432961,0.0029841494,0.006761489,0.012968767,0.0028267603],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.04099899,0.0015202608,0.0019003195,0.0055914363,0.0059924056,0.015046954,0.0035860639,0.008239881,0.01078532],"category_scores_gemma":[0.081348635,0.000785633,0.0015318306,0.004884884,0.044462457,0.038765203,0.0093210405,0.025982542,0.0016237468],"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.00003320052,0.000018184057,0.000041517353,0.00023224684,0.000016208704,0.000046922243,0.0017570705,0.00025612995,0.00007625404,0.9437749,0.044375673,0.009371727],"study_design_scores_gemma":[0.000023132947,0.000023232924,0.00006869575,0.000886424,0.000008640409,0.000062207626,0.001444985,0.0002932696,0.00013276759,0.6274327,0.36959898,0.00002491785],"about_ca_topic_score_codex":0.0028894944,"about_ca_topic_score_gemma":0.0023158875,"teacher_disagreement_score":0.99440855,"about_ca_system_score_codex":0.013931112,"about_ca_system_score_gemma":0.0059855534,"threshold_uncertainty_score":0.21682602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021204744,0.0030126364,0.746432,0.0020169264,0.0012556908,0.000666067,0.017759979,0.10655852,0.10109341],"genre_scores_gemma":[0.5121868,0.0026457326,0.20671329,0.0020435748,0.0004241282,0.0023957123,0.035549868,0.043102592,0.19493832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.00020492465,0.00012221903,0.0002160738,0.0005922226,0.00037851167],"domain_scores_gemma":[0.998555,0.00031199408,0.000069652946,0.00074310857,0.00024845696,0.0000717678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083271717,0.0016766614,0.0009543529,0.0008324844,0.00091621856,0.002557919,0.002735313,0.0017410475,0.06405554],"category_scores_gemma":[0.0041987915,0.0012196266,0.0008226317,0.0013866362,0.0011191565,0.0058219302,0.0025239068,0.0038036972,0.0238395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017233656,0.00014757022,0.0007871537,0.0018160883,0.000045802135,0.00037922635,0.0005377773,0.007205365,0.022073716,0.54266113,0.25097677,0.17164606],"study_design_scores_gemma":[0.00030048308,0.00026439672,0.00048712597,0.00035408983,0.00008684846,0.000594325,0.000092310765,0.029719839,0.092419036,0.23733394,0.6382003,0.00014736707],"about_ca_topic_score_codex":0.00091812573,"about_ca_topic_score_gemma":0.0010726614,"teacher_disagreement_score":0.06405554,"about_ca_system_score_codex":0.0013207003,"about_ca_system_score_gemma":0.0017925721,"threshold_uncertainty_score":0.2142871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10248177,0.000087844106,0.88941497,0.00071397,0.000038346432,0.0001708811,0.0004205794,0.0025530227,0.0041185683],"genre_scores_gemma":[0.9103407,0.00014352362,0.08687964,0.00017616875,0.000064485,0.00021089727,0.00050082605,0.00021062551,0.0014730896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99192727,0.0018962864,0.0005861455,0.0019880994,0.0023574203,0.001244773],"domain_scores_gemma":[0.9470552,0.0393473,0.0033012957,0.0070172334,0.0027167941,0.0005621994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007345364,0.0006610885,0.0007884338,0.00091914413,0.0010331775,0.0030447936,0.0018917251,0.0011393749,0.0021178669],"category_scores_gemma":[0.042488813,0.0007435296,0.0023225283,0.00062269176,0.005874407,0.0068257814,0.0027605495,0.0032463924,0.0003150997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005997758,0.00025102412,0.005993619,0.000529322,0.00017184996,0.0015149134,0.0019538463,0.14362761,0.03129206,0.77186614,0.0018072858,0.040392566],"study_design_scores_gemma":[0.00014837472,0.0001154365,0.0006836592,0.000057905898,0.00011042458,0.0002856894,0.00019438945,0.4457476,0.067832656,0.48184842,0.0029270067,0.000048408492],"about_ca_topic_score_codex":0.0043542525,"about_ca_topic_score_gemma":0.0024923352,"teacher_disagreement_score":0.007345364,"about_ca_system_score_codex":0.0026805268,"about_ca_system_score_gemma":0.004588405,"threshold_uncertainty_score":0.038846433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07732651,0.0006389964,0.89240295,0.0017191485,0.00013095222,0.00011718124,0.0002990756,0.00435632,0.02300889],"genre_scores_gemma":[0.8289779,0.00034364298,0.1619906,0.00045545236,0.00016280047,0.00022925247,0.00036526241,0.0007106779,0.006764494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98960286,0.0030765415,0.0006730543,0.0021086182,0.0033726483,0.0011663572],"domain_scores_gemma":[0.9770687,0.009071614,0.0018092283,0.009568435,0.0017756346,0.00070627773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006417391,0.00076690275,0.0009988401,0.0010330869,0.0012314984,0.0049513956,0.0021454908,0.0011451123,0.004219437],"category_scores_gemma":[0.02374598,0.0007904834,0.0016550148,0.000814161,0.0071442774,0.006974778,0.005187483,0.0035895004,0.0006452239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028701045,0.00008273393,0.0031155688,0.00023847912,0.00009070009,0.0003114985,0.0011357466,0.052312378,0.007829406,0.88736534,0.0018559103,0.04537519],"study_design_scores_gemma":[0.00010736082,0.00013086792,0.0007691879,0.00012458942,0.00009285476,0.00020363285,0.00020591063,0.2395658,0.014241227,0.7250334,0.019447375,0.000077838886],"about_ca_topic_score_codex":0.0035646933,"about_ca_topic_score_gemma":0.0028819854,"teacher_disagreement_score":0.006417391,"about_ca_system_score_codex":0.0021570236,"about_ca_system_score_gemma":0.002707008,"threshold_uncertainty_score":0.033938825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067083454,0.0077990415,0.020404462,0.0027020338,0.0008189172,0.000067255474,0.00004561061,0.00012432536,0.96133],"genre_scores_gemma":[0.14717011,0.0071467333,0.0072453143,0.001945356,0.0004038744,0.000119632765,0.00015723585,0.00013842313,0.8356734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861705,0.0003218816,0.00004428437,0.00019619659,0.00068325124,0.00013732607],"domain_scores_gemma":[0.9987815,0.000446323,0.00011056313,0.00023147803,0.00034363786,0.000086448854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087023724,0.00051011273,0.00040832465,0.0007284078,0.0012799584,0.0043129902,0.0010228412,0.0010736105,0.020900222],"category_scores_gemma":[0.0021339566,0.00024492375,0.00040924258,0.00094381033,0.002500708,0.0034947146,0.0037622724,0.002564798,0.005409778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014567372,0.000038723632,0.00029300913,0.00022501392,0.000009277352,0.00014322533,0.0017221848,0.0013182795,0.00067490886,0.832158,0.04418308,0.119219676],"study_design_scores_gemma":[0.0000047944004,0.000032288663,0.00043835572,0.00036348694,0.000007283871,0.0004083307,0.0006444801,0.0017024736,0.0012582222,0.07840826,0.9167186,0.0000134636675],"about_ca_topic_score_codex":0.0012474795,"about_ca_topic_score_gemma":0.002051702,"teacher_disagreement_score":0.020900222,"about_ca_system_score_codex":0.0016043,"about_ca_system_score_gemma":0.001618928,"threshold_uncertainty_score":0.069918215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018128678,0.00012215345,0.9738349,0.00016121673,0.0000227872,0.000104811734,0.00017366077,0.0028785442,0.0045731645],"genre_scores_gemma":[0.29151776,0.00032373852,0.70178694,0.00016610825,0.000036910707,0.00026370632,0.0007051398,0.00068163505,0.004518071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961647,0.0009679548,0.00020587494,0.0006705978,0.0017318563,0.0002590088],"domain_scores_gemma":[0.9924177,0.0035978064,0.00040264998,0.00271736,0.00078478723,0.00007969251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068055,0.00056280027,0.00056596706,0.001162421,0.00084183697,0.0017660292,0.0020470445,0.000772811,0.004672408],"category_scores_gemma":[0.0066030202,0.00055602926,0.0013685655,0.0007232322,0.0023814396,0.0042639584,0.0031052316,0.002007115,0.0011748015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003014641,0.00016254936,0.0028581014,0.0006137194,0.00013566001,0.0007757201,0.0010405954,0.04928119,0.091789015,0.5373485,0.005602181,0.31009123],"study_design_scores_gemma":[0.00007954149,0.00018355683,0.0010232907,0.00013787384,0.000081335325,0.00095098023,0.0001994036,0.3339196,0.18265222,0.4271288,0.05355401,0.00008941402],"about_ca_topic_score_codex":0.0011653661,"about_ca_topic_score_gemma":0.0010706832,"teacher_disagreement_score":0.004672408,"about_ca_system_score_codex":0.0007526783,"about_ca_system_score_gemma":0.0016390262,"threshold_uncertainty_score":0.015630782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58722025,0.00098195,0.39321545,0.0007669659,0.00017977487,0.0003957717,0.00035409583,0.008449948,0.008435826],"genre_scores_gemma":[0.9718005,0.00010847462,0.026853029,0.00010413632,0.00002334764,0.00005670775,0.00007329876,0.00010741247,0.0008730032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904265,0.0031566934,0.0010289546,0.0015221582,0.0030984106,0.00076727255],"domain_scores_gemma":[0.97993714,0.0068923114,0.0030935288,0.006754025,0.0027622315,0.00056062883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003833696,0.0006358539,0.00068147824,0.0012456106,0.0012004795,0.0034378849,0.0011810513,0.0009835843,0.0012655956],"category_scores_gemma":[0.02370357,0.0006790765,0.0005708936,0.0005117225,0.0030568517,0.00639004,0.003574381,0.0021715746,0.00051963836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057570874,0.001082081,0.109607786,0.0010053866,0.00035707557,0.004956461,0.016370734,0.06912149,0.12538046,0.16607401,0.0030363293,0.49725115],"study_design_scores_gemma":[0.00019518277,0.001511525,0.019826587,0.0005799677,0.0003103476,0.0014814697,0.0029407188,0.39017957,0.43356648,0.13227284,0.016578028,0.0005572975],"about_ca_topic_score_codex":0.0047483984,"about_ca_topic_score_gemma":0.0037871804,"teacher_disagreement_score":0.0047483984,"about_ca_system_score_codex":0.0012136764,"about_ca_system_score_gemma":0.0016593222,"threshold_uncertainty_score":0.020274758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41596022,0.0044677975,0.44125706,0.006948521,0.0028046945,0.00045897407,0.0015328168,0.057177987,0.06939192],"genre_scores_gemma":[0.9666137,0.0003413348,0.020684006,0.0010596231,0.0002049176,0.000116420844,0.00035331823,0.0009351267,0.009691613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594384,0.00085541914,0.00020053447,0.00037669344,0.0015443058,0.0010792494],"domain_scores_gemma":[0.991963,0.0016432576,0.0007180459,0.0045504523,0.0007842834,0.00034091913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030329563,0.0013366363,0.0011983851,0.0010550111,0.0016897115,0.0022396168,0.0023471955,0.002644822,0.009348516],"category_scores_gemma":[0.0118191065,0.0008197348,0.0007338743,0.00082576607,0.0017112251,0.007064802,0.0067970394,0.003062418,0.003595768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008585107,0.00062227796,0.01600101,0.00090081594,0.00082711765,0.002870963,0.0022763065,0.022912756,0.13875051,0.25392154,0.19014286,0.36218873],"study_design_scores_gemma":[0.0004347113,0.0016003075,0.0054203286,0.00045371047,0.0004893752,0.0025522916,0.0008111654,0.2805992,0.4300127,0.12812923,0.14922525,0.0002717613],"about_ca_topic_score_codex":0.00089718937,"about_ca_topic_score_gemma":0.001037866,"teacher_disagreement_score":0.009348516,"about_ca_system_score_codex":0.0011728879,"about_ca_system_score_gemma":0.0012167994,"threshold_uncertainty_score":0.0312739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21244599,0.00009914065,0.7741145,0.00033195547,0.00014321225,0.00020020641,0.00017879147,0.0051680985,0.0073181465],"genre_scores_gemma":[0.9303491,0.00003927274,0.06688626,0.00007338289,0.000019507235,0.000070835216,0.000109253895,0.00015251603,0.0022998771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0002629056,0.00016227619,0.00020390967,0.0004352384,0.00021862633],"domain_scores_gemma":[0.99644524,0.00089308154,0.00029529913,0.0016859618,0.00054446224,0.00013592774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010588871,0.00039607895,0.0003530094,0.0004792783,0.00067461823,0.0012004056,0.00073075294,0.0004893757,0.0030170956],"category_scores_gemma":[0.0030998944,0.00022306516,0.00055532856,0.00045090856,0.0013434797,0.0024420551,0.002253608,0.00081454555,0.0005100724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033318542,0.0005348931,0.010683343,0.00035354708,0.00015295361,0.0014610867,0.0012485109,0.23131615,0.2148585,0.32505623,0.0092788,0.20172408],"study_design_scores_gemma":[0.000097764154,0.0002099753,0.0007102736,0.000039097737,0.000034299304,0.00017674241,0.000050517254,0.73990625,0.19313785,0.05424778,0.011343826,0.000045572382],"about_ca_topic_score_codex":0.0012964852,"about_ca_topic_score_gemma":0.0008644653,"teacher_disagreement_score":0.0030170956,"about_ca_system_score_codex":0.0011589709,"about_ca_system_score_gemma":0.0013672125,"threshold_uncertainty_score":0.010093212},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03840702,0.00032371664,0.9160801,0.0006042727,0.00008464859,0.00018711516,0.0005123938,0.04011833,0.0036824683],"genre_scores_gemma":[0.45726383,0.00033834283,0.53290135,0.00039817626,0.00010773138,0.00046097016,0.0015681335,0.0042492812,0.002712202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933328,0.0017550727,0.0004241124,0.0009640311,0.002887568,0.0006364286],"domain_scores_gemma":[0.9867448,0.008428616,0.001154139,0.0024111995,0.0010009897,0.00026014718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024009494,0.0023114197,0.0011611455,0.0036737723,0.00078840146,0.0020719967,0.0028112037,0.0013080089,0.004582019],"category_scores_gemma":[0.017060528,0.0012022783,0.00209952,0.0019745342,0.003524306,0.005792256,0.0049840123,0.0022640475,0.0014372187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092243485,0.0006296677,0.017863113,0.0010517692,0.00035168993,0.0015913214,0.0011217037,0.30062333,0.07037451,0.08102427,0.014752931,0.50969326],"study_design_scores_gemma":[0.00006789203,0.0001300967,0.00094838097,0.000063724074,0.00005163132,0.00020553498,0.00010701543,0.9217192,0.02545556,0.046698276,0.0044848765,0.0000677765],"about_ca_topic_score_codex":0.0061159977,"about_ca_topic_score_gemma":0.0066694333,"teacher_disagreement_score":0.0061159977,"about_ca_system_score_codex":0.0017087741,"about_ca_system_score_gemma":0.0036395108,"threshold_uncertainty_score":0.015328348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25983855,0.00092293625,0.7147077,0.0024173576,0.00014746762,0.00061481836,0.00006242357,0.0025690007,0.01871982],"genre_scores_gemma":[0.80677146,0.0003185257,0.1889142,0.00023733662,0.000041606527,0.00009782828,0.00006366664,0.00014501138,0.0034102937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885964,0.00023532966,0.000065173735,0.00016374367,0.00040993092,0.00026616978],"domain_scores_gemma":[0.99860954,0.00017453749,0.00016741223,0.00047126831,0.00033880761,0.00023850851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016447463,0.00043679215,0.00027787144,0.0005096433,0.0010400212,0.0018414204,0.0010790444,0.00063453056,0.0021173994],"category_scores_gemma":[0.002429669,0.00031827617,0.0004530395,0.00039211524,0.0011328624,0.0032690973,0.0024722337,0.0015448285,0.00074286707],"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.0005193411,0.00065233465,0.012157764,0.00037238284,0.00006389801,0.0012233112,0.0019925577,0.11643619,0.21542418,0.3324579,0.015934713,0.30276546],"study_design_scores_gemma":[0.00010688296,0.0007480532,0.0042804037,0.00012135417,0.00005733097,0.00096100493,0.0013340196,0.7980331,0.06746558,0.056109145,0.070695825,0.00008729475],"about_ca_topic_score_codex":0.0034093312,"about_ca_topic_score_gemma":0.004052813,"teacher_disagreement_score":0.0034093312,"about_ca_system_score_codex":0.0016920344,"about_ca_system_score_gemma":0.0022808218,"threshold_uncertainty_score":0.012276709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11355054,0.0002547599,0.8232349,0.0004960292,0.00016551292,0.00023960571,0.00028538346,0.054471996,0.007301327],"genre_scores_gemma":[0.6686254,0.00018672932,0.3128498,0.00040386693,0.00006994888,0.00028894818,0.0010006865,0.011113116,0.0054613776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897994,0.002652666,0.00070379407,0.0010049765,0.0046987017,0.0011404568],"domain_scores_gemma":[0.9704002,0.009392165,0.0019974867,0.014830995,0.002942859,0.00043642335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008552195,0.0008793536,0.00083670835,0.0008224494,0.0007415112,0.0020285163,0.0021682046,0.0010759255,0.0043549677],"category_scores_gemma":[0.030833919,0.00096411485,0.00084337936,0.0007054227,0.0030217536,0.005211026,0.0044429475,0.0023965165,0.0020945927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024510818,0.0005496444,0.02134449,0.00091837137,0.00020686387,0.0011815717,0.0021080272,0.16047765,0.11684268,0.20676394,0.02573766,0.461418],"study_design_scores_gemma":[0.00026298736,0.00043627425,0.0021880143,0.00018166578,0.00006803098,0.0005609078,0.00024226225,0.67350334,0.19043359,0.089450225,0.042514857,0.00015776789],"about_ca_topic_score_codex":0.0014566615,"about_ca_topic_score_gemma":0.0011493494,"teacher_disagreement_score":0.008552195,"about_ca_system_score_codex":0.0009121821,"about_ca_system_score_gemma":0.004143451,"threshold_uncertainty_score":0.04522884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78451955,0.001027045,0.12985298,0.0030920217,0.00033497033,0.00018292814,0.0007052243,0.032547753,0.047737483],"genre_scores_gemma":[0.9479662,0.00025259043,0.039162405,0.00038917287,0.000031291864,0.000036946356,0.0005354499,0.0047288253,0.00689706],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9921435,0.0014857454,0.0005478763,0.0008751431,0.004205457,0.0007423596],"domain_scores_gemma":[0.98411936,0.005262414,0.0015346032,0.0056053745,0.003130283,0.00034804398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038529488,0.00035676686,0.00028643652,0.0008239504,0.0007382242,0.0022517228,0.0011343457,0.00092882407,0.0030397393],"category_scores_gemma":[0.028938983,0.00045644338,0.00052807404,0.00082622067,0.0023151317,0.0039813304,0.003202666,0.0020306401,0.00087859645],"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.005447645,0.00037393035,0.062154047,0.0012520684,0.00026852582,0.0043624407,0.023385491,0.018657127,0.15152434,0.23726656,0.039894108,0.45541364],"study_design_scores_gemma":[0.00066863373,0.0019031398,0.05907141,0.0012425567,0.0006794149,0.008980517,0.005533432,0.1886057,0.3112029,0.12365743,0.29776078,0.000693978],"about_ca_topic_score_codex":0.010941573,"about_ca_topic_score_gemma":0.008265405,"teacher_disagreement_score":0.010941573,"about_ca_system_score_codex":0.0022827783,"about_ca_system_score_gemma":0.0025368675,"threshold_uncertainty_score":0.021755755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036857214,0.002026767,0.96813923,0.0013852902,0.0003207114,0.00021365575,0.00017148217,0.0011289773,0.02292811],"genre_scores_gemma":[0.23748425,0.0035416656,0.7381712,0.0023491995,0.0009691627,0.0012435954,0.0008105712,0.0014532458,0.013977094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99045205,0.0035258743,0.00058025966,0.0015141316,0.0034012143,0.0005265241],"domain_scores_gemma":[0.98844403,0.0072307754,0.00042546817,0.0027936394,0.00090347417,0.0002026585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058762725,0.0012710752,0.0010907638,0.002346559,0.001879216,0.002771796,0.002379845,0.0017739419,0.0073975218],"category_scores_gemma":[0.015919264,0.0010092936,0.0026310745,0.0014821521,0.0070411586,0.00698473,0.004844044,0.008153969,0.0024159634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025901645,0.00002088513,0.00010083254,0.00017875357,0.000024089193,0.000059477246,0.00024939713,0.002957254,0.0015495155,0.9666817,0.00244739,0.025704756],"study_design_scores_gemma":[0.000021035577,0.00002586838,0.000080111015,0.000086018816,0.00002932591,0.000106737454,0.000049119906,0.009158088,0.002974414,0.92907214,0.058375984,0.000021085269],"about_ca_topic_score_codex":0.001271929,"about_ca_topic_score_gemma":0.0010556545,"teacher_disagreement_score":0.0073975218,"about_ca_system_score_codex":0.002539207,"about_ca_system_score_gemma":0.0020871547,"threshold_uncertainty_score":0.031077087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7898573,0.00083224656,0.19205524,0.00082001166,0.000102915066,0.00025748415,0.00017701539,0.013434655,0.0024631151],"genre_scores_gemma":[0.9763257,0.000094742485,0.023132186,0.00003697686,0.000011147014,0.000021915544,0.0000476521,0.00006742073,0.00026225808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950262,0.0015218381,0.00025242468,0.0006824228,0.0017277525,0.00078934076],"domain_scores_gemma":[0.98527956,0.0037877543,0.002744361,0.005874668,0.0016866258,0.00062707387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003030672,0.00043312358,0.00067847554,0.0014101624,0.0009309053,0.0013059133,0.0016612245,0.0007348729,0.0005729101],"category_scores_gemma":[0.013505307,0.0005126083,0.00036770417,0.0013073978,0.0012088357,0.0031519963,0.0014953448,0.0010057483,0.00019756536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021255196,0.0008168497,0.1546476,0.00038328447,0.00018520697,0.0014222132,0.0019557464,0.17979318,0.07655512,0.012715004,0.0074483473,0.5619518],"study_design_scores_gemma":[0.00008274654,0.0005258419,0.028281039,0.00006328601,0.00007967696,0.0008120225,0.0006734115,0.89282674,0.06301462,0.009042098,0.004524187,0.000074326614],"about_ca_topic_score_codex":0.0073367925,"about_ca_topic_score_gemma":0.0034890932,"teacher_disagreement_score":0.0073367925,"about_ca_system_score_codex":0.0012797364,"about_ca_system_score_gemma":0.0022808763,"threshold_uncertainty_score":0.016027927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76803976,0.00030293714,0.19849294,0.00017027503,0.00006885903,0.0002046809,0.001155006,0.028465368,0.0031001582],"genre_scores_gemma":[0.93124247,0.00011638964,0.06456776,0.00009485069,0.000022370137,0.00010662886,0.0012574241,0.0013324535,0.0012595137],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997544,0.00045654966,0.00015627449,0.00040453576,0.0012194271,0.00021927209],"domain_scores_gemma":[0.98886883,0.0066271783,0.0010449267,0.00133825,0.001931004,0.00018979388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013989293,0.00087608566,0.00044009392,0.0016074813,0.00048051798,0.0008146158,0.0012191945,0.00063420285,0.0007957318],"category_scores_gemma":[0.009158387,0.00046228507,0.0006696625,0.001205372,0.00079221633,0.0009972502,0.0005140351,0.00066853256,0.00025086701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019293058,0.0010830328,0.12846062,0.0015334723,0.00039924958,0.0038941358,0.0026575283,0.17329325,0.38528594,0.015210059,0.009460085,0.2767933],"study_design_scores_gemma":[0.00006639163,0.00036498377,0.038670465,0.000065262415,0.00016795025,0.0006756239,0.00020216515,0.74097306,0.207427,0.005259587,0.0060290643,0.000098451725],"about_ca_topic_score_codex":0.0034365638,"about_ca_topic_score_gemma":0.0035199649,"teacher_disagreement_score":0.0034365638,"about_ca_system_score_codex":0.000905745,"about_ca_system_score_gemma":0.0012974977,"threshold_uncertainty_score":0.007398367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859602,0.0043397667,0.6668365,0.0008085548,0.0006932219,0.00027554852,0.00032134648,0.0049694637,0.03579543],"genre_scores_gemma":[0.93134916,0.0013529335,0.05287465,0.00045089587,0.000112882,0.00008456673,0.00022138626,0.000105140665,0.013448312],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983275,0.00002059744,0.000009030369,0.00002933456,0.000084533625,0.000023689405],"domain_scores_gemma":[0.99989164,0.000014038356,0.000017152322,0.0000286113,0.00003878614,0.0000097568945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009562505,0.00028849035,0.00028649057,0.00026303987,0.00023906583,0.00039942077,0.00083098013,0.00034826642,0.0033220395],"category_scores_gemma":[0.00020608265,0.00009507749,0.00018561134,0.00024489666,0.0001432928,0.00072791864,0.00046591405,0.00028518357,0.0012387548],"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.00033911128,0.0001671494,0.0013664349,0.00043058002,0.0000988758,0.00034141948,0.00020228591,0.011094093,0.69048375,0.020726664,0.008321391,0.26642823],"study_design_scores_gemma":[0.00007571054,0.0010241696,0.0017456837,0.000050793307,0.00017384857,0.0010512867,0.00007755033,0.1722048,0.73081577,0.003984836,0.08874674,0.000048720896],"about_ca_topic_score_codex":0.00028856215,"about_ca_topic_score_gemma":0.0004714435,"teacher_disagreement_score":0.0033220395,"about_ca_system_score_codex":0.0002735782,"about_ca_system_score_gemma":0.0003011011,"threshold_uncertainty_score":0.011113286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04134138,0.0011146872,0.9024023,0.0006697148,0.00019965372,0.0002524107,0.00011150929,0.041709423,0.012198916],"genre_scores_gemma":[0.6154221,0.00080932386,0.36038384,0.0009293814,0.00023088277,0.00027238842,0.00060796685,0.0024134235,0.018930737],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790657,0.0002929613,0.00021062652,0.00035907145,0.0009392123,0.00029154186],"domain_scores_gemma":[0.99456376,0.00080184033,0.0005969624,0.0031335321,0.0007025791,0.00020137579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017232709,0.00077070616,0.0006357094,0.0010695521,0.0007095203,0.0015398572,0.00243987,0.0007505807,0.0033913462],"category_scores_gemma":[0.0054516504,0.0005783684,0.0007254059,0.0005302406,0.0013646964,0.0038498738,0.004384865,0.0021022183,0.0020832345],"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.0014886886,0.0005899974,0.007561912,0.0009354988,0.00024628468,0.00087803527,0.0017894043,0.039049488,0.16395375,0.06478723,0.025739642,0.69298005],"study_design_scores_gemma":[0.00026581227,0.0011197798,0.0041582333,0.00023241452,0.00022454192,0.002882429,0.00035278234,0.4001086,0.37613043,0.06279678,0.15148748,0.00024072813],"about_ca_topic_score_codex":0.0006677063,"about_ca_topic_score_gemma":0.0006578583,"teacher_disagreement_score":0.0033913462,"about_ca_system_score_codex":0.00047255796,"about_ca_system_score_gemma":0.001166334,"threshold_uncertainty_score":0.011345208},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084738955,0.11923141,0.043986257,0.006230786,0.0036857773,0.00008445421,0.00008366131,0.00042381702,0.8178],"genre_scores_gemma":[0.1475248,0.15302837,0.039573442,0.004089268,0.002719539,0.0001029752,0.00023514399,0.0003846479,0.65234184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976426,0.00003635736,0.0000065258114,0.000022819848,0.00014255811,0.000027415199],"domain_scores_gemma":[0.9998129,0.00007948035,0.00001192664,0.000024079634,0.0000445741,0.000027032078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018710215,0.00044789977,0.00022249928,0.00048784455,0.00088039273,0.0037167452,0.00047087128,0.00065385073,0.0070540966],"category_scores_gemma":[0.00046133774,0.00024421417,0.00029991756,0.0008673787,0.0010878987,0.0027593486,0.0008838434,0.0021614127,0.0023511034],"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.000018430399,0.000043665645,0.00027469976,0.00028062495,0.0000068545482,0.0002795073,0.0011911744,0.0034855648,0.0032204082,0.61007243,0.10941699,0.2717097],"study_design_scores_gemma":[0.0000023719488,0.00002434947,0.00048103774,0.0003834416,0.00000485462,0.00062667334,0.00028031858,0.003629587,0.0010432496,0.10981408,0.8836952,0.000014923521],"about_ca_topic_score_codex":0.0015554738,"about_ca_topic_score_gemma":0.002662495,"teacher_disagreement_score":0.0070540966,"about_ca_system_score_codex":0.0009791096,"about_ca_system_score_gemma":0.000974786,"threshold_uncertainty_score":0.023598313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49067986,0.0049752216,0.46774969,0.0031171455,0.0002334161,0.00025232765,0.00023042638,0.012620786,0.020141084],"genre_scores_gemma":[0.9153665,0.00065329904,0.08117291,0.00043528044,0.00007608799,0.00005472959,0.0002265065,0.0008990799,0.0011155944],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900372,0.0041310973,0.00036489585,0.0011475341,0.0033897616,0.0009294503],"domain_scores_gemma":[0.954698,0.022997716,0.0046537756,0.013321725,0.0034786195,0.0008501456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009070153,0.00090976944,0.00047175772,0.0012088974,0.0009914695,0.0035897426,0.0027290052,0.00089720264,0.0010819038],"category_scores_gemma":[0.039443135,0.00064249383,0.0005574052,0.0006899882,0.0022842165,0.0071477885,0.0040445933,0.003313624,0.00032749248],"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.0005455345,0.0004603378,0.055430092,0.00097170874,0.00021128204,0.0010975017,0.01971247,0.04541801,0.040087912,0.0729886,0.009188077,0.7538885],"study_design_scores_gemma":[0.000107087144,0.0011680479,0.02974572,0.0013055382,0.00033375862,0.0032762133,0.009634439,0.5801305,0.11667834,0.12661149,0.13063678,0.0003720691],"about_ca_topic_score_codex":0.0011590178,"about_ca_topic_score_gemma":0.0014585889,"teacher_disagreement_score":0.009070153,"about_ca_system_score_codex":0.0013606864,"about_ca_system_score_gemma":0.0018898093,"threshold_uncertainty_score":0.04796815},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.213345,0.0026013001,0.18931304,0.0020120132,0.0016240341,0.0007695271,0.003831199,0.028657949,0.557846],"genre_scores_gemma":[0.684743,0.00069903705,0.12085353,0.0011217525,0.00021567247,0.0004908617,0.010294881,0.00055504625,0.18102631],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969363,0.00003031511,0.000013204067,0.00006558813,0.00014255184,0.0000546865],"domain_scores_gemma":[0.99979943,0.000015030242,0.000008936295,0.00003327622,0.00011129372,0.00003196757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469544,0.00034275503,0.00023381168,0.00027490224,0.00027183382,0.00058292336,0.0006914905,0.00030275222,0.027283203],"category_scores_gemma":[0.00065554824,0.00019097644,0.00016034786,0.00037853324,0.00015873896,0.00054047245,0.00062481733,0.00051656243,0.005670263],"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.0017169381,0.00021946679,0.0032552471,0.00027174936,0.00006757204,0.00036791398,0.0001352736,0.020084344,0.07279585,0.04437122,0.44328105,0.41343328],"study_design_scores_gemma":[0.00083614263,0.0013789303,0.0062499163,0.000064594555,0.000073238865,0.0009795767,0.00007939532,0.20666566,0.049467288,0.014487357,0.71961564,0.000102173864],"about_ca_topic_score_codex":0.0015626649,"about_ca_topic_score_gemma":0.0024133471,"teacher_disagreement_score":0.027283203,"about_ca_system_score_codex":0.0004715116,"about_ca_system_score_gemma":0.0010301287,"threshold_uncertainty_score":0.09127134},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005880959,0.053272784,0.011247103,0.6812105,0.05609424,0.00007106289,0.0020389261,0.002195321,0.18798913],"genre_scores_gemma":[0.13368687,0.16108271,0.018908115,0.16396236,0.10803796,0.0002016952,0.004770473,0.0040163365,0.40533346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9895377,0.002294782,0.0010033569,0.0009187147,0.005218123,0.0010272277],"domain_scores_gemma":[0.8766076,0.03598106,0.006880309,0.013435028,0.048038844,0.019057222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025454953,0.0005714614,0.0010963979,0.0037555671,0.0016746352,0.011460529,0.0015092661,0.0030906114,0.114274085],"category_scores_gemma":[0.05739762,0.00035852275,0.00076646183,0.0070024957,0.0038024199,0.01192412,0.0055119214,0.0051245266,0.05574779],"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.000088102825,0.000028081746,0.001977648,0.00034563759,0.000020800171,0.00014387391,0.00018909489,0.00012673288,0.000531325,0.02722721,0.8151026,0.15421887],"study_design_scores_gemma":[0.000009346167,0.000036262776,0.0013804109,0.00043379405,0.000013604767,0.00029464267,0.00030048407,0.00039986864,0.00049555104,0.0197806,0.97683436,0.00002114973],"about_ca_topic_score_codex":0.0011149527,"about_ca_topic_score_gemma":0.0017425499,"teacher_disagreement_score":0.114274085,"about_ca_system_score_codex":0.0024001126,"about_ca_system_score_gemma":0.0094075,"threshold_uncertainty_score":0.38228488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074486196,0.0028954835,0.8863704,0.0033933164,0.00044540534,0.0009314082,0.00012580093,0.013101652,0.0182503],"genre_scores_gemma":[0.6855239,0.0015827353,0.30371326,0.0014489865,0.0002112976,0.00055611716,0.00026019313,0.00094831537,0.0057551134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98806936,0.0042564305,0.00060424866,0.001457084,0.0044836057,0.0011293045],"domain_scores_gemma":[0.9646217,0.012591108,0.0052814023,0.012229951,0.004392388,0.00088349765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007743814,0.0022924347,0.0013026964,0.0025498208,0.0011038665,0.003313161,0.0046991818,0.0026799277,0.0035696812],"category_scores_gemma":[0.03616042,0.0010811754,0.0016787427,0.00093952485,0.00356117,0.007844614,0.0050540892,0.0036028856,0.0022734054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007554252,0.0012325059,0.020104997,0.0014626685,0.00034062282,0.0015379312,0.001448287,0.0933682,0.08065802,0.106481105,0.012164305,0.68044585],"study_design_scores_gemma":[0.00024102835,0.0021267633,0.0038407866,0.0013334451,0.00065022474,0.0025207368,0.0009565011,0.61447203,0.1649358,0.15263662,0.056003425,0.00028259994],"about_ca_topic_score_codex":0.0011729554,"about_ca_topic_score_gemma":0.0011224359,"teacher_disagreement_score":0.007743814,"about_ca_system_score_codex":0.0010907209,"about_ca_system_score_gemma":0.0035707701,"threshold_uncertainty_score":0.040953755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006538489,0.00065870717,0.86651653,0.0006557594,0.00034394627,0.00075433985,0.00093531894,0.11067651,0.01292043],"genre_scores_gemma":[0.38443208,0.0011176373,0.5446509,0.0027728227,0.00047510274,0.0028408314,0.006230209,0.015387737,0.042092726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933821,0.002036054,0.0006494234,0.000956602,0.0022044596,0.0007713746],"domain_scores_gemma":[0.99115,0.002830081,0.0006268078,0.003916866,0.00090743747,0.0005688374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066453577,0.0017138385,0.0018427435,0.0022991758,0.0017629192,0.005008447,0.0064039337,0.0028242639,0.030410029],"category_scores_gemma":[0.016453445,0.0017739588,0.0020476435,0.0012716196,0.0036783603,0.011563544,0.01260618,0.0058152876,0.016871555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004985975,0.0007560411,0.0036092927,0.0017805989,0.00041501163,0.0013064763,0.0013646083,0.03462189,0.03824813,0.5432471,0.12602596,0.24363898],"study_design_scores_gemma":[0.00055229524,0.00055805984,0.00058200775,0.0003517965,0.00016643463,0.0008802309,0.00018348676,0.44117874,0.05651168,0.3342197,0.1644962,0.00031926768],"about_ca_topic_score_codex":0.0011926277,"about_ca_topic_score_gemma":0.0013249662,"teacher_disagreement_score":0.030410029,"about_ca_system_score_codex":0.0023977912,"about_ca_system_score_gemma":0.0040162266,"threshold_uncertainty_score":0.10173166},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108976,0.045649763,0.03645047,0.5498737,0.007029383,0.00003491611,0.0002612314,0.0001601971,0.25156438],"genre_scores_gemma":[0.94958186,0.016696772,0.002331835,0.020425268,0.0035162214,0.00002116957,0.000071963244,0.00006190429,0.0072930376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623173,0.0015025607,0.00016426115,0.00058973534,0.0010737149,0.00043795747],"domain_scores_gemma":[0.9854881,0.008802406,0.001981143,0.0014931209,0.0016464312,0.0005887533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035197958,0.00031564897,0.00049356616,0.0011324395,0.0019940084,0.006832146,0.00063111447,0.0032670856,0.009068825],"category_scores_gemma":[0.018535808,0.0002227194,0.00031503566,0.0012870254,0.019951139,0.0152526675,0.0019400562,0.0037637148,0.0016488008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010375043,0.000030149246,0.0038195585,0.00020881057,0.000024981593,0.00017611319,0.0020691485,0.0002417447,0.0006374429,0.9418628,0.010791221,0.04003412],"study_design_scores_gemma":[0.000018239532,0.000099770165,0.006090499,0.00052577915,0.000036082944,0.00062209344,0.005888686,0.0006887529,0.0011643443,0.8706991,0.11412596,0.000040799965],"about_ca_topic_score_codex":0.0019025854,"about_ca_topic_score_gemma":0.001372189,"teacher_disagreement_score":0.009068825,"about_ca_system_score_codex":0.0021106086,"about_ca_system_score_gemma":0.0017327962,"threshold_uncertainty_score":0.030338228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019037917,0.00030014603,0.9713699,0.000833458,0.000071196286,0.00008510798,0.00019696113,0.00035175364,0.007753573],"genre_scores_gemma":[0.8154131,0.00043351212,0.17924346,0.00040402362,0.00024089623,0.0002734785,0.00021639916,0.00022669745,0.0035485094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875239,0.0035899458,0.0009088736,0.002376232,0.004461305,0.001139616],"domain_scores_gemma":[0.963063,0.021866761,0.0037269476,0.008358247,0.0022835026,0.00070155074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477683,0.0011997061,0.0013038489,0.0028045732,0.0024837812,0.007353929,0.0025063392,0.002475749,0.0042288858],"category_scores_gemma":[0.041516714,0.001020992,0.002879391,0.0018387309,0.011687703,0.016511567,0.0075458908,0.0047506616,0.00038916492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031665444,0.0000142221625,0.00052770664,0.000075761556,0.000032379077,0.00010145668,0.00039742186,0.011638891,0.001312052,0.9804155,0.00025821786,0.0051946538],"study_design_scores_gemma":[0.00001007843,0.000027836993,0.00025481076,0.000034860845,0.000033609158,0.00014444707,0.000076876975,0.0399771,0.0018796398,0.9543638,0.0031636932,0.000033097243],"about_ca_topic_score_codex":0.0022650505,"about_ca_topic_score_gemma":0.0009834494,"teacher_disagreement_score":0.009477683,"about_ca_system_score_codex":0.0041620564,"about_ca_system_score_gemma":0.002232474,"threshold_uncertainty_score":0.050123394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0664293,0.0002809346,0.91646355,0.00036161597,0.00012477065,0.00008424366,0.000066016924,0.0006321951,0.015557368],"genre_scores_gemma":[0.96783555,0.00010164188,0.029826188,0.0000342893,0.000020582638,0.00004708255,0.00004143466,0.00004381304,0.0020495232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996792,0.00006710669,0.000018875964,0.000057079294,0.00012853295,0.000049227303],"domain_scores_gemma":[0.9993162,0.00033395618,0.000105041094,0.00012902482,0.00009067518,0.00002512413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046638795,0.0005205793,0.00048355677,0.00021740321,0.00027176982,0.0008411169,0.00044334162,0.00061558245,0.0035564308],"category_scores_gemma":[0.0017667027,0.00031227473,0.0005920883,0.00010777019,0.0006301912,0.00053341186,0.0006922926,0.0008957693,0.00030357394],"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.00021151964,0.000053042193,0.000335081,0.00026846517,0.00005687906,0.00025449015,0.00018127605,0.8559349,0.028942917,0.08060553,0.0009106908,0.032245252],"study_design_scores_gemma":[0.000016815018,0.00005952228,0.000113862356,0.000016221602,0.00001169909,0.000024435465,0.000012250769,0.9765272,0.0069217747,0.01547589,0.00081474165,0.0000055560204],"about_ca_topic_score_codex":0.00085614616,"about_ca_topic_score_gemma":0.0009942771,"teacher_disagreement_score":0.0035564308,"about_ca_system_score_codex":0.0004669558,"about_ca_system_score_gemma":0.00064284174,"threshold_uncertainty_score":0.011897445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16707183,0.00037779906,0.821346,0.00066566747,0.00007034501,0.00020749505,0.00023675151,0.004812271,0.005211825],"genre_scores_gemma":[0.87249106,0.00011669263,0.1255338,0.00011622648,0.000027633474,0.000111332316,0.0001530726,0.00040781967,0.0010422401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921894,0.002741748,0.00039231853,0.00088309817,0.0027223735,0.001070977],"domain_scores_gemma":[0.98623174,0.0072608865,0.001401443,0.003669201,0.001138661,0.00029810966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052432218,0.0012366723,0.00094925374,0.0014853418,0.00088599185,0.0028860797,0.0012494095,0.0010546683,0.003109416],"category_scores_gemma":[0.016372878,0.00059632165,0.0013085975,0.0010706746,0.0021563494,0.0045313775,0.0019979305,0.0018603101,0.00045067907],"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.0016081262,0.000563498,0.010316837,0.00031793382,0.00016485329,0.0002166373,0.00023963743,0.68896955,0.04893674,0.08257114,0.0030984518,0.16299658],"study_design_scores_gemma":[0.000021415266,0.00013974715,0.0005720596,0.000021107355,0.000024379875,0.00008771664,0.000039386225,0.9470296,0.026666116,0.024491102,0.00088573556,0.000021721205],"about_ca_topic_score_codex":0.001446954,"about_ca_topic_score_gemma":0.0011224021,"teacher_disagreement_score":0.0052432218,"about_ca_system_score_codex":0.0030504542,"about_ca_system_score_gemma":0.003417031,"threshold_uncertainty_score":0.027729154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13161585,0.0005020878,0.80143255,0.001217763,0.00028929277,0.00077332096,0.00018890676,0.053564116,0.010416149],"genre_scores_gemma":[0.8084759,0.00021997724,0.18412913,0.0005228529,0.0000874571,0.00023008432,0.0002165922,0.0013592588,0.00475878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872366,0.003728388,0.00087251776,0.0014109508,0.0054140277,0.0013374676],"domain_scores_gemma":[0.9755352,0.0056253923,0.0032788694,0.012241974,0.0027984139,0.00052009366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006047995,0.0009257063,0.00085033226,0.0011719794,0.0012823964,0.0030120597,0.0030613232,0.0018320114,0.005509418],"category_scores_gemma":[0.019399894,0.0009397061,0.0008924914,0.000626745,0.0028336195,0.004638954,0.004745882,0.0041278927,0.002043779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039785537,0.0013449675,0.024750594,0.0019394592,0.00068001833,0.0031101312,0.002810245,0.065042205,0.27744555,0.19915462,0.034827717,0.38491607],"study_design_scores_gemma":[0.00039990284,0.0011004136,0.0025356652,0.00035835744,0.0003357455,0.0014223133,0.0003414408,0.4117709,0.49495044,0.035989292,0.050541755,0.00025386774],"about_ca_topic_score_codex":0.001093881,"about_ca_topic_score_gemma":0.0006632029,"teacher_disagreement_score":0.006047995,"about_ca_system_score_codex":0.0011275047,"about_ca_system_score_gemma":0.0025368894,"threshold_uncertainty_score":0.031985223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014482333,0.0024346302,0.91345906,0.0028864662,0.0012014892,0.00054366916,0.0024528163,0.040514372,0.022025155],"genre_scores_gemma":[0.60583746,0.0022720678,0.32299563,0.0024971922,0.0013861151,0.0013637206,0.0055678673,0.009855464,0.048224412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909949,0.0023296762,0.000712236,0.0010750977,0.0037016273,0.0011864031],"domain_scores_gemma":[0.9700935,0.007042018,0.0010337029,0.01955039,0.0017783451,0.00050192635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004943867,0.0023550505,0.002695889,0.0022910438,0.0024419855,0.0066474983,0.005427564,0.0034991063,0.02946104],"category_scores_gemma":[0.026039658,0.0018864082,0.002231839,0.0024920984,0.004300149,0.01313987,0.01757015,0.0059529175,0.013825011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002156457,0.00040205833,0.0010578169,0.0016263678,0.000323259,0.00066338404,0.0008989458,0.019759795,0.019536292,0.49343488,0.11928257,0.34085816],"study_design_scores_gemma":[0.00031228922,0.00021411886,0.00024488242,0.00030393316,0.00015158315,0.00066560734,0.00016574425,0.07199664,0.04243242,0.823991,0.059367016,0.0001547835],"about_ca_topic_score_codex":0.0005519173,"about_ca_topic_score_gemma":0.00073042087,"teacher_disagreement_score":0.02946104,"about_ca_system_score_codex":0.0015209218,"about_ca_system_score_gemma":0.0045536985,"threshold_uncertainty_score":0.098556936},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8802915,0.0019265951,0.07417074,0.0016719123,0.00022379243,0.00042431217,0.00948765,0.01146613,0.020337319],"genre_scores_gemma":[0.91228336,0.0014321439,0.056481723,0.0009053664,0.00012891057,0.00026465242,0.010466284,0.0055405777,0.012497005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99545276,0.0004434361,0.000498823,0.00086335075,0.0023169823,0.0004245727],"domain_scores_gemma":[0.96632284,0.01695912,0.0073501337,0.0038046448,0.0050781714,0.00048520108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018435295,0.00069827825,0.00024617862,0.004588544,0.0014226423,0.0012917996,0.0005492195,0.00080107537,0.0025111707],"category_scores_gemma":[0.024317777,0.0005286111,0.00038011765,0.0036549862,0.0018319042,0.0029279261,0.0018137142,0.0011447491,0.0010861072],"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.0009571358,0.00017967986,0.26249358,0.0036654447,0.00013842607,0.008563046,0.03709543,0.004008198,0.08663468,0.028270727,0.048979424,0.5190142],"study_design_scores_gemma":[0.00002792994,0.00041571245,0.35403323,0.0022195985,0.00030727877,0.010464151,0.008529308,0.023027766,0.13708213,0.01192736,0.45147744,0.00048814638],"about_ca_topic_score_codex":0.011015353,"about_ca_topic_score_gemma":0.016063463,"teacher_disagreement_score":0.011015353,"about_ca_system_score_codex":0.0010090306,"about_ca_system_score_gemma":0.0023173047,"threshold_uncertainty_score":0.021902502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029853268,0.000055953184,0.9898499,0.00021520535,0.00006197335,0.000058474085,0.00018047256,0.0026574365,0.003935263],"genre_scores_gemma":[0.26853612,0.0003761193,0.71300113,0.00036903517,0.00020442018,0.00027269518,0.001311913,0.003742646,0.012185918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98865265,0.0041781734,0.0011222302,0.0014861968,0.003648503,0.00091225276],"domain_scores_gemma":[0.9806292,0.008683804,0.0010310562,0.0067998944,0.0025285762,0.00032749132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062940433,0.0019090082,0.0014316454,0.0067514717,0.0012676658,0.0062745092,0.0030767648,0.0020370346,0.012336879],"category_scores_gemma":[0.026545726,0.0019662674,0.005688598,0.003958168,0.0033420222,0.014767525,0.0068456577,0.0038880575,0.0048903734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021848356,0.00014800957,0.0041023334,0.00045766542,0.0002179955,0.0003297528,0.0008600579,0.027855342,0.0065581584,0.7655378,0.005119691,0.18859477],"study_design_scores_gemma":[0.000021450867,0.0000319102,0.00043024472,0.00012313493,0.0001345013,0.00015088002,0.00014848007,0.1075055,0.0071294885,0.86780316,0.016465804,0.000055619792],"about_ca_topic_score_codex":0.0027238077,"about_ca_topic_score_gemma":0.002875868,"teacher_disagreement_score":0.012336879,"about_ca_system_score_codex":0.0018612355,"about_ca_system_score_gemma":0.0019754667,"threshold_uncertainty_score":0.04127097},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007494554,0.000703065,0.39610034,0.0014080947,0.002866245,0.00041570736,0.011521972,0.40254086,0.17694914],"genre_scores_gemma":[0.122876085,0.0015118412,0.35158172,0.0026174977,0.0009820851,0.0008563015,0.044014003,0.22630017,0.24926034],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845254,0.00011543985,0.00014971316,0.00025284887,0.0007518049,0.00027766547],"domain_scores_gemma":[0.99797803,0.00038984424,0.000089503206,0.0009176612,0.00052725,0.0000977306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011350196,0.0011614027,0.0008896001,0.0011163215,0.00093936466,0.0036264465,0.0020529716,0.0012872405,0.089646496],"category_scores_gemma":[0.0039244,0.001297185,0.0015498033,0.0007714976,0.00079951505,0.0033312787,0.0032967818,0.0032581883,0.08880055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008867048,0.0003134052,0.0018307117,0.001083167,0.00012689989,0.00059103343,0.000566535,0.0044072713,0.020525087,0.21040455,0.553909,0.20535576],"study_design_scores_gemma":[0.00018243925,0.000048865033,0.0005503847,0.00015878117,0.000056310073,0.00045456417,0.00009134755,0.017048433,0.037341293,0.068788245,0.87521386,0.00006551235],"about_ca_topic_score_codex":0.0011181809,"about_ca_topic_score_gemma":0.0016380551,"teacher_disagreement_score":0.089646496,"about_ca_system_score_codex":0.0008907748,"about_ca_system_score_gemma":0.0021420817,"threshold_uncertainty_score":0.29989737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87419415,0.0018555402,0.07276651,0.0029196963,0.00011808211,0.0009348857,0.0009723943,0.0032334602,0.043005288],"genre_scores_gemma":[0.9731631,0.00017841806,0.023836244,0.00015106633,0.000021276386,0.000107198204,0.0003554253,0.00007871675,0.0021084314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884065,0.0038986974,0.00029706577,0.000683393,0.0058727297,0.00084163126],"domain_scores_gemma":[0.9659895,0.018681332,0.0043705837,0.005154012,0.005157503,0.0006470093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010896894,0.0006595153,0.00047397855,0.0028011536,0.0008899867,0.0020985804,0.0011494532,0.0012304425,0.0043254644],"category_scores_gemma":[0.030760989,0.00039616937,0.00074446626,0.0010230775,0.0014640187,0.0030263714,0.0027554662,0.0012160757,0.0005758714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054866266,0.0011157623,0.37072924,0.0024773113,0.0006569491,0.0012689332,0.0025768746,0.042522732,0.029585687,0.08989253,0.010597512,0.4430897],"study_design_scores_gemma":[0.00023267056,0.009956499,0.33799428,0.0012938958,0.000983672,0.0051932437,0.006035021,0.4859642,0.05634798,0.050844625,0.044792667,0.000361311],"about_ca_topic_score_codex":0.0024899135,"about_ca_topic_score_gemma":0.0029868293,"teacher_disagreement_score":0.010896894,"about_ca_system_score_codex":0.0029191733,"about_ca_system_score_gemma":0.0022971162,"threshold_uncertainty_score":0.05762893},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011748372,0.52406037,0.03930201,0.024871139,0.008445996,0.0005376212,0.001588418,0.00074388966,0.39927572],"genre_scores_gemma":[0.04648771,0.7559195,0.028423626,0.024473289,0.012467861,0.0009803089,0.0036018405,0.00043826766,0.12720762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9806686,0.0050396114,0.0024433092,0.002216411,0.00859876,0.0010332346],"domain_scores_gemma":[0.97261184,0.01037403,0.0023592713,0.00673668,0.007162553,0.0007556446],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0074874386,0.0012530092,0.0018509324,0.006362337,0.0028834506,0.0110972505,0.0033414457,0.006243977,0.03775685],"category_scores_gemma":[0.026330698,0.00067083206,0.0013152813,0.0072386796,0.008186547,0.016693648,0.00548217,0.0041250163,0.030009374],"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.000048705864,0.00004660524,0.00030313467,0.007355572,0.0000860207,0.00027921758,0.0008428579,0.00039840027,0.0012108169,0.3820963,0.17623894,0.43109345],"study_design_scores_gemma":[0.0000046573687,0.000014774433,0.00011439177,0.0020609428,0.00001824874,0.0004754641,0.00010674013,0.000058444384,0.00043709646,0.026972368,0.969723,0.000013941353],"about_ca_topic_score_codex":0.0016446993,"about_ca_topic_score_gemma":0.0010359802,"teacher_disagreement_score":0.9925126,"about_ca_system_score_codex":0.0034071254,"about_ca_system_score_gemma":0.00887622,"threshold_uncertainty_score":0.12630928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.334934,0.0058784354,0.4885594,0.0027462614,0.0007227496,0.0009323179,0.000961205,0.042809255,0.12245628],"genre_scores_gemma":[0.8470614,0.0010675926,0.099326484,0.0012754973,0.00008841505,0.00025210244,0.00086406514,0.0024458447,0.047618594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752253,0.00044556492,0.00015700758,0.00029764333,0.0011830647,0.00039422157],"domain_scores_gemma":[0.99385417,0.0016272683,0.0005449219,0.0026604282,0.0010390414,0.00027429624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011959535,0.0009536685,0.00048896956,0.0009061819,0.00055587635,0.0018582031,0.0018817236,0.0007228154,0.014512169],"category_scores_gemma":[0.006301476,0.0005483548,0.0005181555,0.000928906,0.00083056645,0.004303525,0.0019052732,0.0013231006,0.0035812026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024537966,0.00026467093,0.008320032,0.0013940098,0.0001948656,0.0010529113,0.00071674446,0.017582998,0.13192046,0.13009973,0.038534597,0.66746515],"study_design_scores_gemma":[0.00034727715,0.0018463591,0.013050718,0.0005140628,0.00055822707,0.005134472,0.0005216649,0.09649496,0.4365332,0.025163703,0.4194825,0.00035291453],"about_ca_topic_score_codex":0.0012499891,"about_ca_topic_score_gemma":0.0018950205,"teacher_disagreement_score":0.014512169,"about_ca_system_score_codex":0.0012284829,"about_ca_system_score_gemma":0.001476769,"threshold_uncertainty_score":0.048548102},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021224614,0.012837016,0.025848607,0.1692032,0.1422558,0.0020895535,0.011325436,0.004264649,0.610951],"genre_scores_gemma":[0.13396761,0.006598364,0.0054698656,0.023740953,0.037017897,0.0011020381,0.005377083,0.0016325066,0.78509367],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916077,0.00018082249,0.0000483534,0.00016983056,0.00024076359,0.00019949402],"domain_scores_gemma":[0.9939214,0.0019959682,0.00018819193,0.0004883325,0.0015190325,0.0018872069],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030224966,0.0011507312,0.0021513503,0.000527347,0.0027699368,0.005186348,0.0009804346,0.004702682,0.39206168],"category_scores_gemma":[0.0052746898,0.00033406293,0.0010116324,0.000597771,0.0008220502,0.0031143497,0.0018280569,0.0033043346,0.13749324],"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.0024586888,0.00032992478,0.0011199478,0.0004016971,0.00005112088,0.00012635706,0.00016434708,0.0004363309,0.0030984774,0.009395694,0.87765884,0.10475855],"study_design_scores_gemma":[0.0006333476,0.0004579671,0.0074939784,0.000304075,0.0001070424,0.00035459833,0.0006587403,0.002992898,0.0029637322,0.0205833,0.9633226,0.00012781021],"about_ca_topic_score_codex":0.0012282366,"about_ca_topic_score_gemma":0.0028611722,"teacher_disagreement_score":0.39206168,"about_ca_system_score_codex":0.001176273,"about_ca_system_score_gemma":0.001333871,"threshold_uncertainty_score":0.86715025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5386137,0.00040443894,0.43982223,0.00034773632,0.00019660832,0.00023601225,0.000059597827,0.010216031,0.010103675],"genre_scores_gemma":[0.8777259,0.00020459414,0.11918002,0.000064525426,0.000036483616,0.00007054124,0.000068640074,0.000446572,0.0022026915],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969652,0.00075495936,0.00022734908,0.00024513656,0.0014035486,0.00040373564],"domain_scores_gemma":[0.9928883,0.0015962566,0.0008201199,0.0035009559,0.0009864751,0.0002079886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002225383,0.0005111792,0.00045712918,0.0004584562,0.00066024734,0.0016609842,0.0017358854,0.00057232234,0.0016074085],"category_scores_gemma":[0.008516488,0.00063896395,0.000529429,0.0003097538,0.001487691,0.003559903,0.0018801437,0.0015476629,0.0006898814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031465339,0.00066612277,0.024500662,0.00076020375,0.00035185655,0.0024432796,0.003479348,0.263417,0.26889336,0.16782923,0.006724151,0.2577883],"study_design_scores_gemma":[0.00025260853,0.0009655051,0.0028063415,0.00014219208,0.00018154483,0.00059219025,0.00020176485,0.72822565,0.22869924,0.017208416,0.020639531,0.00008510247],"about_ca_topic_score_codex":0.00092736026,"about_ca_topic_score_gemma":0.00070245215,"teacher_disagreement_score":0.002225383,"about_ca_system_score_codex":0.0007747174,"about_ca_system_score_gemma":0.0015548792,"threshold_uncertainty_score":0.011769116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11662558,0.0031911596,0.8541579,0.0020182198,0.00017206691,0.00025011963,0.00007012755,0.0018852161,0.021629615],"genre_scores_gemma":[0.8703895,0.0024515388,0.1235732,0.0002821681,0.00011039519,0.000106537125,0.00007899428,0.0001723767,0.0028352547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962388,0.0010883528,0.0001480269,0.0004181124,0.0015776876,0.00052897],"domain_scores_gemma":[0.9951994,0.0016981914,0.0005849701,0.001794817,0.00052436534,0.0001982751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018491177,0.0007544157,0.0005821219,0.0006596363,0.0011150037,0.0025146226,0.0010765843,0.0009913401,0.0019747035],"category_scores_gemma":[0.005591219,0.0003541128,0.00039123034,0.0006456779,0.002630269,0.005169602,0.0026033623,0.001997722,0.0005992171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009171945,0.0003062076,0.004054892,0.0007972328,0.000092054244,0.0010367339,0.00097562163,0.2816229,0.06952344,0.335256,0.0056531946,0.29976457],"study_design_scores_gemma":[0.00010994774,0.00040587838,0.0013629469,0.00031764456,0.000058336416,0.0005937504,0.00032001408,0.837564,0.069301546,0.06550216,0.024391148,0.00007258236],"about_ca_topic_score_codex":0.0017898799,"about_ca_topic_score_gemma":0.0015946225,"teacher_disagreement_score":0.0025146226,"about_ca_system_score_codex":0.0008603652,"about_ca_system_score_gemma":0.0019322583,"threshold_uncertainty_score":0.009779155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06658961,0.0016394217,0.8813282,0.0006280151,0.00063499506,0.0003399221,0.00040859758,0.030188879,0.018242339],"genre_scores_gemma":[0.69682586,0.00064372533,0.2760015,0.0009994765,0.00021902593,0.00027200437,0.0008849941,0.0015762949,0.022577122],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99788743,0.00027153286,0.00016056767,0.00024678523,0.0009662667,0.00046735012],"domain_scores_gemma":[0.9919166,0.0008697371,0.0004498274,0.0051647467,0.0013586087,0.00024045815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018551782,0.0010040724,0.0008445925,0.0017084309,0.0011558287,0.0018755613,0.0047949147,0.0015753545,0.007797731],"category_scores_gemma":[0.0053939507,0.00058875576,0.0007282603,0.0012415189,0.0018901387,0.0043423204,0.006811982,0.0019026388,0.0029890323],"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.0024583116,0.00050943013,0.008651342,0.0011256356,0.00037201954,0.0011714048,0.0014661229,0.03436519,0.13743475,0.15997958,0.046771772,0.6056945],"study_design_scores_gemma":[0.00041353988,0.0016653368,0.0027151224,0.00040716332,0.000535823,0.0024599389,0.00053032546,0.39610812,0.32351723,0.12066461,0.15068464,0.0002981711],"about_ca_topic_score_codex":0.0013527155,"about_ca_topic_score_gemma":0.0017017518,"teacher_disagreement_score":0.007797731,"about_ca_system_score_codex":0.0010379278,"about_ca_system_score_gemma":0.002186222,"threshold_uncertainty_score":0.026085973},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037068207,0.030848606,0.1280625,0.015449242,0.023670398,0.00036208244,0.005749918,0.050810028,0.70797896],"genre_scores_gemma":[0.36006957,0.011760383,0.11815358,0.016480554,0.005762701,0.0006602022,0.015395578,0.0086072935,0.46311015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763656,0.00018534448,0.00013027326,0.0006775408,0.000828996,0.00054128026],"domain_scores_gemma":[0.9971533,0.00015274122,0.00007025744,0.0006637447,0.0014396877,0.00052037387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008772714,0.0011966657,0.0010579126,0.0013927348,0.0021266788,0.007382572,0.0022083079,0.0014422196,0.082300074],"category_scores_gemma":[0.0039175134,0.00083795784,0.0006184764,0.0013858837,0.0010130034,0.004676577,0.003398201,0.0036202439,0.05853211],"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.0009177096,0.000118723285,0.0022416434,0.00044692314,0.00007085108,0.00024422674,0.0006386067,0.001412621,0.012559822,0.083456695,0.59650713,0.30138507],"study_design_scores_gemma":[0.00006316206,0.00012447462,0.0005631662,0.00015825452,0.00005356222,0.00028995282,0.00013157075,0.0035325894,0.008323874,0.0079843905,0.9787063,0.00006871219],"about_ca_topic_score_codex":0.004803033,"about_ca_topic_score_gemma":0.0033666878,"teacher_disagreement_score":0.082300074,"about_ca_system_score_codex":0.0021868267,"about_ca_system_score_gemma":0.0024209945,"threshold_uncertainty_score":0.27532113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028677316,0.00012518189,0.96230155,0.0007918393,0.00007947989,0.000102362814,0.00020544196,0.0052815625,0.0024352297],"genre_scores_gemma":[0.73519903,0.0001862509,0.258473,0.0007079005,0.00020401888,0.00035191898,0.000508961,0.0006855569,0.0036832464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.985329,0.0038940804,0.0011330174,0.0033580856,0.0043450436,0.0019406939],"domain_scores_gemma":[0.9707431,0.014723496,0.0023781366,0.009212067,0.0021890732,0.00075403374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009828041,0.00092083897,0.0013604712,0.001263122,0.001610796,0.0046432097,0.003752988,0.0018101687,0.0036625096],"category_scores_gemma":[0.03783857,0.0010498406,0.0021835307,0.0007981049,0.0068089734,0.012098511,0.008871292,0.0051017297,0.000789325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008526586,0.0001571506,0.0037433563,0.0004090248,0.00017790947,0.0011104194,0.0011698328,0.10708308,0.022028081,0.79646754,0.0046598706,0.06214113],"study_design_scores_gemma":[0.00015906617,0.00020026456,0.00043941027,0.00008485228,0.00014535722,0.00037487297,0.0001690224,0.4411764,0.040093623,0.5067023,0.010366743,0.00008806882],"about_ca_topic_score_codex":0.002854199,"about_ca_topic_score_gemma":0.0022749535,"teacher_disagreement_score":0.009828041,"about_ca_system_score_codex":0.002350342,"about_ca_system_score_gemma":0.0043547093,"threshold_uncertainty_score":0.051976323},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009634548,0.0023045973,0.13878371,0.0025493186,0.0035560005,0.0006873514,0.016858218,0.16605222,0.65957403],"genre_scores_gemma":[0.08260349,0.0020699904,0.08511122,0.0028765872,0.0011181819,0.0010752548,0.0397959,0.021823274,0.76352614],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920636,0.00010291297,0.000046459423,0.00015390672,0.0003817037,0.000108572705],"domain_scores_gemma":[0.99917334,0.000085368665,0.000043421,0.00030868175,0.0002651835,0.00012398131],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000695089,0.00093123526,0.00048721675,0.00091282977,0.0008810007,0.0024570662,0.0016693615,0.000983894,0.29361725],"category_scores_gemma":[0.0018269959,0.0005623445,0.00040779036,0.0008557563,0.00032382956,0.002528919,0.0026753754,0.001553094,0.19522214],"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.00063983566,0.00007981978,0.00071210065,0.0004086116,0.000034820667,0.00018410824,0.0001529604,0.0008898237,0.012719381,0.030193951,0.6870746,0.2669099],"study_design_scores_gemma":[0.000042566775,0.000058600304,0.00048211872,0.000038744074,0.000011016774,0.00013284071,0.000019488509,0.002108879,0.008132962,0.0036651732,0.9852915,0.000016069656],"about_ca_topic_score_codex":0.00084057456,"about_ca_topic_score_gemma":0.0007538674,"teacher_disagreement_score":0.70638275,"about_ca_system_score_codex":0.0004738543,"about_ca_system_score_gemma":0.00080769096,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007060407,0.0000831849,0.960422,0.00052302756,0.00020945675,0.00048777895,0.0011347925,0.022020083,0.008059263],"genre_scores_gemma":[0.2688269,0.0002585689,0.6991039,0.0008334389,0.00020312752,0.00086444156,0.0034010906,0.0050385706,0.021469975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996342,0.0009267909,0.00033471314,0.0008886669,0.0010285992,0.0004792741],"domain_scores_gemma":[0.9866296,0.0060676197,0.00054864446,0.004599383,0.0019954816,0.00015921454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005768765,0.0010703278,0.00048070186,0.0007460745,0.0006289836,0.002894519,0.001842962,0.0019044582,0.04063356],"category_scores_gemma":[0.017373018,0.0008996462,0.0012615786,0.00048527794,0.002496925,0.0034617155,0.002360459,0.002562729,0.010722909],"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.0014871582,0.00059090485,0.005363968,0.002224199,0.00017541021,0.002061152,0.001950534,0.074170485,0.0835067,0.44807896,0.07379697,0.30659366],"study_design_scores_gemma":[0.00069176144,0.00071897934,0.0017754532,0.00045304743,0.00017285306,0.002306008,0.00018880054,0.23098479,0.21109778,0.14683728,0.40449673,0.00027649463],"about_ca_topic_score_codex":0.002571048,"about_ca_topic_score_gemma":0.0023002252,"teacher_disagreement_score":0.04063356,"about_ca_system_score_codex":0.00097015296,"about_ca_system_score_gemma":0.002774771,"threshold_uncertainty_score":0.1359328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022608398,0.0062366845,0.948748,0.0031064826,0.00017076726,0.00022499957,0.00006373273,0.001148026,0.017692791],"genre_scores_gemma":[0.4607416,0.0072349315,0.52286744,0.0010657744,0.0003524635,0.00032370057,0.0002150544,0.0005236388,0.006675484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99367875,0.001370669,0.00045239372,0.0007592385,0.0031834745,0.000555483],"domain_scores_gemma":[0.98810273,0.0047476077,0.0013678164,0.0043378877,0.001191031,0.00025294724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042148735,0.0011027046,0.00065239484,0.0024005075,0.0009838472,0.0033732431,0.0023284247,0.0014638822,0.0024498177],"category_scores_gemma":[0.00964999,0.00068315846,0.0017457695,0.0018061633,0.003273393,0.00873163,0.0036911834,0.0048297057,0.00082225905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020861994,0.00043989427,0.0074727703,0.0011495905,0.00020350332,0.00046669037,0.0010394235,0.017976336,0.01988013,0.49699673,0.0063740276,0.44779223],"study_design_scores_gemma":[0.00008797065,0.0006119269,0.0031484745,0.0012870791,0.0003666636,0.004655616,0.0011079952,0.29532918,0.04425201,0.47870576,0.17028916,0.00015821388],"about_ca_topic_score_codex":0.00039900537,"about_ca_topic_score_gemma":0.00047795317,"teacher_disagreement_score":0.0042148735,"about_ca_system_score_codex":0.001330353,"about_ca_system_score_gemma":0.0014818747,"threshold_uncertainty_score":0.022290647},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05975805,0.0006817808,0.83363557,0.0009364483,0.00023956675,0.00032627938,0.0008073024,0.035886116,0.0677289],"genre_scores_gemma":[0.78333145,0.0003505206,0.18403699,0.0005658993,0.00007798117,0.00021836805,0.00142061,0.0012156129,0.02878263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992649,0.000143565,0.00005323986,0.00010648363,0.0002955163,0.00013627416],"domain_scores_gemma":[0.9993818,0.00012546965,0.000058538648,0.00029840347,0.0001038901,0.00003189908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877115,0.0006080023,0.00036504082,0.00045758518,0.00045712394,0.0010626566,0.0009839615,0.0006928213,0.007541839],"category_scores_gemma":[0.001858993,0.00035352656,0.0004981613,0.00024001891,0.0012958267,0.0028014332,0.0015471744,0.0012560077,0.0022861538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011777182,0.00019792265,0.0021807412,0.00040526091,0.000045491695,0.00044093077,0.00058624597,0.01662734,0.03642327,0.70449126,0.054051142,0.18337262],"study_design_scores_gemma":[0.00032794368,0.00096903316,0.0018417162,0.00026882175,0.00010363448,0.0013693926,0.0001360546,0.24378064,0.1481633,0.2630764,0.33984283,0.000120241944],"about_ca_topic_score_codex":0.00088240084,"about_ca_topic_score_gemma":0.00099712,"teacher_disagreement_score":0.007541839,"about_ca_system_score_codex":0.0008933861,"about_ca_system_score_gemma":0.0007952209,"threshold_uncertainty_score":0.02522993},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004634097,0.00027798724,0.97792983,0.00068811624,0.00011575055,0.00015766502,0.00014456888,0.009351988,0.006700039],"genre_scores_gemma":[0.22462094,0.00053312327,0.7497016,0.0010389568,0.00018874113,0.00060807966,0.0006151964,0.0041807396,0.018512486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941432,0.0012182093,0.00041690175,0.00073713367,0.0025304523,0.000954121],"domain_scores_gemma":[0.9943796,0.0011939275,0.00026102766,0.002966768,0.00091425463,0.00028439134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057830093,0.00092784414,0.0010416667,0.0011948473,0.0029557394,0.0034756716,0.004867593,0.0024353815,0.010231001],"category_scores_gemma":[0.012777893,0.0009426564,0.0013848935,0.0010561841,0.00410447,0.0116982125,0.010553149,0.004476722,0.0047317003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045688808,0.00027029362,0.0018538206,0.0005264776,0.00006594577,0.00042781775,0.0016078909,0.034727607,0.018024594,0.5993151,0.03183521,0.3108884],"study_design_scores_gemma":[0.00007710004,0.00018345211,0.00065872166,0.00037122262,0.00008226384,0.0005828184,0.00039354686,0.28073075,0.035027508,0.504002,0.1776895,0.00020118762],"about_ca_topic_score_codex":0.005266285,"about_ca_topic_score_gemma":0.0060437545,"teacher_disagreement_score":0.010231001,"about_ca_system_score_codex":0.0020626828,"about_ca_system_score_gemma":0.0041694245,"threshold_uncertainty_score":0.03422606},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000807895,0.0052026566,0.008856687,0.0060062427,0.015512035,0.00087820506,0.06012546,0.004753022,0.8978578],"genre_scores_gemma":[0.006903035,0.007080974,0.0061518895,0.0047304784,0.0058215596,0.00049161335,0.056031704,0.0020578185,0.91073084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993001,0.00007774025,0.00004792252,0.0001228555,0.00039359607,0.000057790545],"domain_scores_gemma":[0.9949425,0.00084640854,0.00024094383,0.0006085723,0.0028373394,0.00052436953],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00076956465,0.000943479,0.00087360945,0.0029465565,0.0013797324,0.0041383556,0.0016697756,0.0011793863,0.80873984],"category_scores_gemma":[0.009321486,0.00039872265,0.000511468,0.003009343,0.00033415115,0.0029104108,0.0014487865,0.001245708,0.72031397],"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.000025563699,0.000021638516,0.00015216274,0.00027670345,0.000004139874,0.000030796622,0.0000140653665,0.00019119478,0.00026482664,0.0027493162,0.9441102,0.052159335],"study_design_scores_gemma":[0.0000056148174,0.00001850318,0.0002600866,0.00016343153,0.0000045406955,0.00006104719,0.000022126596,0.000108983135,0.00017602906,0.0020471408,0.99712485,0.000007740634],"about_ca_topic_score_codex":0.0031916925,"about_ca_topic_score_gemma":0.0036753106,"teacher_disagreement_score":0.19126016,"about_ca_system_score_codex":0.0015677179,"about_ca_system_score_gemma":0.002293841,"threshold_uncertainty_score":0.27280945},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015636114,0.14606509,0.07791267,0.008280321,0.0025186592,0.000091413865,0.000086989545,0.00040522398,0.7490035],"genre_scores_gemma":[0.3760816,0.17939496,0.054874554,0.0039694677,0.0023164942,0.00011927013,0.00019868776,0.00035645778,0.3826885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997433,0.000060700833,0.0000075785833,0.000024919082,0.00012703224,0.000036377613],"domain_scores_gemma":[0.9998074,0.000093915136,0.000013562273,0.000028175373,0.000032296262,0.000024628443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023912649,0.00042613634,0.00023107047,0.00045772176,0.00084763806,0.004123091,0.0004675288,0.0007060041,0.0044389693],"category_scores_gemma":[0.00043954406,0.0002545073,0.0002994527,0.00075657776,0.001459487,0.0027471285,0.0008873115,0.0021633809,0.0014565387],"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.000016861359,0.00003653227,0.0003481065,0.00033012134,0.0000074456025,0.00027747845,0.0012140995,0.0045419186,0.0030071512,0.7368021,0.038993962,0.21442422],"study_design_scores_gemma":[0.0000032534672,0.000035873312,0.00078522717,0.00066549977,0.000009227995,0.00097611523,0.00057972065,0.0074837245,0.0020519039,0.2630501,0.72433764,0.000021627291],"about_ca_topic_score_codex":0.0011261693,"about_ca_topic_score_gemma":0.0016392401,"teacher_disagreement_score":0.0044389693,"about_ca_system_score_codex":0.0010859754,"about_ca_system_score_gemma":0.0008616865,"threshold_uncertainty_score":0.014849842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028537836,0.00006864852,0.9667968,0.00015498063,0.00003738804,0.00011775078,0.00010621869,0.00095553085,0.003224743],"genre_scores_gemma":[0.6106281,0.00010081254,0.3859167,0.0001380417,0.000050816612,0.00060245383,0.00028550328,0.00025806582,0.0020195744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99115163,0.0032953247,0.00072549394,0.0012109985,0.0030783105,0.00053833955],"domain_scores_gemma":[0.9820256,0.011353561,0.0015360407,0.003287827,0.0013374912,0.0004595255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003708063,0.0010633665,0.0010677344,0.0018283364,0.0010340923,0.0024838902,0.0022847338,0.0017546135,0.003348669],"category_scores_gemma":[0.02191656,0.00060227374,0.0023126614,0.00093859923,0.002745484,0.005639114,0.0024410516,0.002465717,0.00035610306],"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.0003087836,0.0002612134,0.007386027,0.00022055609,0.00020888324,0.0005881512,0.00070757885,0.2634409,0.0118467165,0.6688591,0.0015259746,0.0446461],"study_design_scores_gemma":[0.000030501582,0.00012372347,0.00031388772,0.000030463934,0.00004803004,0.00011629175,0.0000694533,0.82085496,0.0064025186,0.16993333,0.0020336888,0.000043086915],"about_ca_topic_score_codex":0.0038307547,"about_ca_topic_score_gemma":0.002942733,"teacher_disagreement_score":0.0038307547,"about_ca_system_score_codex":0.002755554,"about_ca_system_score_gemma":0.00170528,"threshold_uncertainty_score":0.019993007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79007566,0.0011128613,0.16769308,0.0018652568,0.00082763954,0.00015892285,0.00017145516,0.006759866,0.031335276],"genre_scores_gemma":[0.9553649,0.00017765553,0.036571637,0.00049907976,0.000026893744,0.000033646913,0.000085823274,0.00022184991,0.007018564],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993087,0.00008512169,0.0000333611,0.00009529758,0.00035416198,0.00012332918],"domain_scores_gemma":[0.99929523,0.00018899032,0.00007637247,0.0002641589,0.00014305602,0.000032127937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005408481,0.0002352697,0.00017026142,0.00039759857,0.00031785344,0.0006165172,0.0006200215,0.00054034963,0.0017916014],"category_scores_gemma":[0.0029733274,0.00016172088,0.00027227294,0.00016775315,0.0010214662,0.0007637201,0.00099286,0.0007317261,0.00044016232],"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.0012269062,0.00014451242,0.016960079,0.00037512492,0.000117049145,0.0025937895,0.0012201688,0.03162066,0.5153045,0.16459817,0.019563321,0.2462757],"study_design_scores_gemma":[0.00011446903,0.0009202619,0.0067048874,0.00014570943,0.00010789098,0.0021150806,0.00028031587,0.18261616,0.646984,0.035229955,0.12463567,0.00014563052],"about_ca_topic_score_codex":0.0016703798,"about_ca_topic_score_gemma":0.002136209,"teacher_disagreement_score":0.0017916014,"about_ca_system_score_codex":0.0005589568,"about_ca_system_score_gemma":0.00074107427,"threshold_uncertainty_score":0.0059934855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1696485,0.0018101876,0.7938747,0.00046076233,0.0003170714,0.00026713306,0.00031265168,0.025778024,0.007530976],"genre_scores_gemma":[0.83286524,0.00051242404,0.15640537,0.0003087945,0.00009675898,0.0003414128,0.00047313306,0.0019112995,0.0070854453],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982015,0.0003139759,0.00018776809,0.00025789792,0.0005838607,0.0004549649],"domain_scores_gemma":[0.9955504,0.0005342882,0.0006052191,0.0025974803,0.00049371726,0.00021888292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013167139,0.0010135951,0.0008636737,0.0011503734,0.0012692738,0.0023004923,0.0025138275,0.000773825,0.0026890785],"category_scores_gemma":[0.003921162,0.0006492544,0.00070360856,0.0011069297,0.0019943614,0.00449039,0.00468188,0.0014876944,0.0013324565],"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.0031580569,0.00035177072,0.010959267,0.00075097964,0.00036107804,0.00082205626,0.0023304448,0.067668304,0.23798905,0.21194956,0.025468666,0.43819076],"study_design_scores_gemma":[0.0003361532,0.00085672404,0.0024642542,0.00016796212,0.00036194146,0.0007326901,0.0005781696,0.43543202,0.38277173,0.09909854,0.07690643,0.00029343553],"about_ca_topic_score_codex":0.0018029972,"about_ca_topic_score_gemma":0.0021118664,"teacher_disagreement_score":0.0026890785,"about_ca_system_score_codex":0.0010969756,"about_ca_system_score_gemma":0.002390756,"threshold_uncertainty_score":0.008995891},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7359506,0.0011125463,0.19615568,0.0021733781,0.00041786805,0.0003922874,0.00021179176,0.007667632,0.05591818],"genre_scores_gemma":[0.9763817,0.00015682894,0.016215883,0.0005133771,0.00001965674,0.000057198347,0.000049193124,0.00013090223,0.006475241],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793565,0.00028047405,0.000111100555,0.0002948526,0.0009878643,0.00039008688],"domain_scores_gemma":[0.9965205,0.0009843917,0.0005192458,0.0014398288,0.0004337038,0.00010228408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005916773,0.0005077764,0.0004644755,0.00082913996,0.000807967,0.00080707396,0.0007756937,0.0014161748,0.0026405703],"category_scores_gemma":[0.004328369,0.00025731858,0.00040579945,0.00050815166,0.0011510514,0.0018542715,0.001995192,0.0011584442,0.0005305846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021380312,0.0006047292,0.02776871,0.0006574818,0.0002513011,0.014932762,0.004749656,0.035414685,0.4095038,0.17449526,0.027186118,0.30229744],"study_design_scores_gemma":[0.00010862934,0.0015762042,0.009635999,0.00021604741,0.00020021787,0.012990506,0.00047935598,0.22743209,0.6639494,0.019560128,0.063647375,0.00020411171],"about_ca_topic_score_codex":0.00073060533,"about_ca_topic_score_gemma":0.00071529584,"teacher_disagreement_score":0.0026405703,"about_ca_system_score_codex":0.00064492173,"about_ca_system_score_gemma":0.00038572168,"threshold_uncertainty_score":0.008833587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075583104,0.00019793485,0.9837991,0.00024401095,0.00004864926,0.000115209645,0.000044328488,0.0042597014,0.0037327926],"genre_scores_gemma":[0.08198247,0.00060311554,0.91340554,0.00022014319,0.000049159247,0.00028005673,0.00027032016,0.0012502924,0.0019388319],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969891,0.0010087242,0.0002547605,0.00035799213,0.0011900297,0.00019942087],"domain_scores_gemma":[0.9953949,0.0025024684,0.00022826178,0.0012693497,0.000540029,0.00006492357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030193527,0.0010425518,0.000654521,0.0010364436,0.00055873685,0.0022988904,0.0017062909,0.0010237449,0.0037325413],"category_scores_gemma":[0.008604363,0.0009648707,0.0014727259,0.00068214396,0.0024496268,0.0032065883,0.0019156074,0.002737158,0.0014348892],"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.00018595281,0.0002548783,0.00210662,0.00094837614,0.000121976074,0.00043945215,0.00091373676,0.27375108,0.055717856,0.3098015,0.005398299,0.35036036],"study_design_scores_gemma":[0.00009669288,0.00020519726,0.00032277594,0.00028669406,0.0000883831,0.00023690313,0.00013916235,0.66894615,0.078601465,0.18880115,0.062205568,0.00006983869],"about_ca_topic_score_codex":0.0013704317,"about_ca_topic_score_gemma":0.0012373974,"teacher_disagreement_score":0.0037325413,"about_ca_system_score_codex":0.00095794996,"about_ca_system_score_gemma":0.0020856168,"threshold_uncertainty_score":0.015968025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057268325,0.000657679,0.9134842,0.00040018544,0.00018192425,0.00022023942,0.00036118866,0.018473262,0.008952875],"genre_scores_gemma":[0.8380324,0.00041464722,0.14951749,0.000398216,0.00011006191,0.00027620234,0.00078584114,0.0011827548,0.009282331],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978618,0.00029078766,0.00016740801,0.00027377295,0.0009947954,0.00041143093],"domain_scores_gemma":[0.9965603,0.00052283984,0.00039313917,0.0020622865,0.00035418195,0.00010736077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013856535,0.0006720117,0.00061238825,0.00055266276,0.00051157526,0.0018231666,0.0024434726,0.0007314124,0.004739555],"category_scores_gemma":[0.003497956,0.00054274313,0.00079235143,0.0005117084,0.0021012581,0.0035373548,0.003260456,0.0015970439,0.0015035622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038494875,0.0003595447,0.0054539633,0.001119555,0.00029572,0.0011228563,0.0008806906,0.10830355,0.19245087,0.31124967,0.03020168,0.34471247],"study_design_scores_gemma":[0.0003947159,0.000700809,0.0010131644,0.0001566922,0.0001458636,0.0006761048,0.00011668575,0.5375258,0.31577125,0.09580405,0.04751764,0.00017721938],"about_ca_topic_score_codex":0.0015624223,"about_ca_topic_score_gemma":0.0016040121,"teacher_disagreement_score":0.004739555,"about_ca_system_score_codex":0.0010659954,"about_ca_system_score_gemma":0.0017961834,"threshold_uncertainty_score":0.015855372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015657231,0.0002585114,0.9793729,0.0008388415,0.0000427287,0.00030717553,0.00006788627,0.0014808374,0.0019739803],"genre_scores_gemma":[0.16638291,0.0005908615,0.82980794,0.00035386716,0.00006483897,0.0005020785,0.00052877853,0.0007344279,0.0010344236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.93839264,0.021371346,0.005256385,0.0054709753,0.027281435,0.0022272095],"domain_scores_gemma":[0.8314557,0.08347899,0.013326953,0.049866956,0.020838927,0.0010325367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03245442,0.0013595737,0.0010169694,0.006377896,0.001999596,0.0056419433,0.0026789797,0.0026781834,0.0025685641],"category_scores_gemma":[0.14967918,0.0020056646,0.0030908303,0.002835857,0.0059825615,0.012267658,0.009426551,0.0074182088,0.0011637316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025621784,0.0006219261,0.023497298,0.0019093208,0.0002757406,0.0018967212,0.008705066,0.041696776,0.045683563,0.3181974,0.0043638567,0.55289626],"study_design_scores_gemma":[0.00018393085,0.0006146853,0.010908368,0.0021551396,0.0003991842,0.0032377741,0.0025717353,0.29496878,0.13574821,0.45272326,0.09616846,0.00032054502],"about_ca_topic_score_codex":0.0031902576,"about_ca_topic_score_gemma":0.003163891,"teacher_disagreement_score":0.03245442,"about_ca_system_score_codex":0.0027031873,"about_ca_system_score_gemma":0.007416011,"threshold_uncertainty_score":0.17163742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26542282,0.00076137343,0.6719435,0.0038132335,0.0001221266,0.00020259531,0.0040286025,0.002510013,0.0511959],"genre_scores_gemma":[0.92452353,0.0003049521,0.05718014,0.0004911537,0.00023029067,0.00031054261,0.0025451225,0.00062611914,0.013788002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608177,0.0008089939,0.00021832953,0.00093152904,0.0012298764,0.0007293802],"domain_scores_gemma":[0.9859007,0.009460493,0.00094449567,0.0020678127,0.0010793961,0.00054711977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020283705,0.0011016474,0.0013076338,0.0015534334,0.001561422,0.0055443486,0.0028863708,0.0015301527,0.010571446],"category_scores_gemma":[0.0110162245,0.0009519886,0.0026566212,0.002248809,0.0033480502,0.009586507,0.0025488664,0.0057974122,0.0009614185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021775295,0.0000953945,0.0011804029,0.00019120912,0.000033579454,0.00015590519,0.00052704156,0.029067237,0.0019411276,0.9558111,0.002835175,0.007944191],"study_design_scores_gemma":[0.00005639894,0.0000498653,0.00075548474,0.000043320997,0.000033501226,0.00017112948,0.00016863599,0.12369707,0.0024330826,0.86540806,0.007144479,0.000038992745],"about_ca_topic_score_codex":0.0038548987,"about_ca_topic_score_gemma":0.0044487217,"teacher_disagreement_score":0.010571446,"about_ca_system_score_codex":0.003540935,"about_ca_system_score_gemma":0.0019466096,"threshold_uncertainty_score":0.035365045},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008259182,0.0010334266,0.5820323,0.00085770787,0.00061857904,0.0005827495,0.01563393,0.3038629,0.08711921],"genre_scores_gemma":[0.17120044,0.001430521,0.52276516,0.0023676353,0.00043919648,0.0012015721,0.06380767,0.033882674,0.2029051],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799097,0.00030446364,0.00016974226,0.00062534853,0.0007451755,0.0001642527],"domain_scores_gemma":[0.9977059,0.0005381934,0.0001497565,0.0010766778,0.00045742138,0.00007210555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019903546,0.0013592008,0.0007938687,0.0019463698,0.0008180084,0.0024524436,0.0020938464,0.0010895706,0.08191858],"category_scores_gemma":[0.004865339,0.00097614335,0.0010111434,0.0010020207,0.00076390133,0.004558106,0.0034725976,0.0016870335,0.03729616],"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.0010003182,0.00022604529,0.0065475744,0.0009752304,0.00015234649,0.00038268356,0.00037580123,0.0072090426,0.017093133,0.08713165,0.2787386,0.6001676],"study_design_scores_gemma":[0.00020700133,0.0001771757,0.0026287693,0.00014974784,0.00009267982,0.0004622486,0.000114095776,0.08798008,0.042300835,0.06902467,0.7967709,0.00009183394],"about_ca_topic_score_codex":0.0027148523,"about_ca_topic_score_gemma":0.0036934232,"teacher_disagreement_score":0.08191858,"about_ca_system_score_codex":0.0012056613,"about_ca_system_score_gemma":0.001595587,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003566901,0.0023869597,0.0069799945,0.0022805287,0.0040765777,0.0001257593,0.0015553721,0.0009350304,0.98130316],"genre_scores_gemma":[0.0012630771,0.0015470947,0.0018010696,0.0008672657,0.00060801575,0.000070943825,0.0012447994,0.00023877822,0.992359],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993899,0.00005624978,0.00002008739,0.00012488215,0.00033983187,0.000069072375],"domain_scores_gemma":[0.9992473,0.00010755379,0.000027013179,0.000121600184,0.0003527441,0.00014378759],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00056140195,0.00092667836,0.00053592963,0.0015589962,0.0012894977,0.0037563078,0.0016081004,0.0016332436,0.56592804],"category_scores_gemma":[0.002219734,0.0003066521,0.00047368542,0.0015148391,0.0006081429,0.0030936366,0.002297679,0.0016618875,0.47905257],"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.000025488049,0.000034438723,0.000088606495,0.00016550557,0.000002335695,0.000050814295,0.00012016205,0.00015663164,0.00052387937,0.053663276,0.7403514,0.20481749],"study_design_scores_gemma":[0.0000015324067,0.0000056653894,0.000045241817,0.00004705917,8.104155e-7,0.000031596897,0.000023937224,0.000027074368,0.00009521057,0.0046667,0.9950531,0.0000021985595],"about_ca_topic_score_codex":0.0016669672,"about_ca_topic_score_gemma":0.0025607734,"teacher_disagreement_score":0.43407196,"about_ca_system_score_codex":0.0011270805,"about_ca_system_score_gemma":0.0017365069,"threshold_uncertainty_score":0.61915094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06219621,0.00023776984,0.8701803,0.00017550918,0.00008304568,0.0001674928,0.00016770506,0.059973426,0.0068185213],"genre_scores_gemma":[0.7146457,0.00021061326,0.27425978,0.00034004924,0.00005212323,0.0002331432,0.00046096562,0.0052407994,0.004556871],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980211,0.00034894003,0.00015881244,0.00033941332,0.00079284096,0.0003388955],"domain_scores_gemma":[0.9953354,0.0013422982,0.00043767568,0.0021220748,0.00063364784,0.00012886393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658065,0.0007364819,0.0006535411,0.0011512625,0.0006034824,0.0014850412,0.0014219608,0.00062331173,0.003237563],"category_scores_gemma":[0.0071390336,0.0006790361,0.00055302895,0.0005849261,0.001199822,0.0025984007,0.0030383163,0.0013591005,0.0013925763],"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.0009852778,0.00060552754,0.018775435,0.00071701297,0.00012540392,0.0011969578,0.002159002,0.039323628,0.20555516,0.091340914,0.018337678,0.62087804],"study_design_scores_gemma":[0.00013936729,0.00056968594,0.006923635,0.00019039023,0.00014956376,0.0014982509,0.00023561614,0.34097537,0.5228842,0.04986074,0.07637681,0.0001963818],"about_ca_topic_score_codex":0.00072650827,"about_ca_topic_score_gemma":0.0006868558,"teacher_disagreement_score":0.003237563,"about_ca_system_score_codex":0.00083354407,"about_ca_system_score_gemma":0.0013355274,"threshold_uncertainty_score":0.01083076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013363119,0.00003331923,0.976226,0.00003367433,0.0000076468505,0.000044512428,0.00007028286,0.009698397,0.00052309944],"genre_scores_gemma":[0.31566176,0.00012456771,0.68114305,0.000082690385,0.000015547883,0.00017073902,0.00047047023,0.0012443432,0.0010867524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997253,0.0007015382,0.00023049445,0.0004434909,0.0011372146,0.00023419881],"domain_scores_gemma":[0.9917937,0.004947763,0.0007075254,0.0018338517,0.00063238264,0.0000848194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028264564,0.000828514,0.0005913281,0.0010379772,0.00043612043,0.0011851883,0.0014036614,0.0005277238,0.0017990549],"category_scores_gemma":[0.00722014,0.00076430803,0.00096898444,0.0005157391,0.0013499574,0.001944519,0.0019064186,0.0015999989,0.0005767519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005366678,0.0002028157,0.0056904946,0.0006705907,0.00014259963,0.00080108445,0.0010755955,0.30049118,0.17125769,0.040723134,0.002757348,0.47565076],"study_design_scores_gemma":[0.00009402547,0.00020168987,0.0010103983,0.00007892114,0.000064236156,0.0003953642,0.00008863592,0.8323598,0.12250365,0.037173223,0.0059688194,0.00006113565],"about_ca_topic_score_codex":0.0019279767,"about_ca_topic_score_gemma":0.0020430516,"teacher_disagreement_score":0.0028264564,"about_ca_system_score_codex":0.00084553304,"about_ca_system_score_gemma":0.0020357266,"threshold_uncertainty_score":0.014947891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019640874,0.0006526452,0.9870569,0.00030961834,0.0001242578,0.00014184015,0.00004703282,0.003009393,0.0066942074],"genre_scores_gemma":[0.06121194,0.0013064509,0.9218513,0.00032795747,0.00010289662,0.0002210478,0.00026026726,0.0021337061,0.012584503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968746,0.00062433304,0.00031399247,0.00047721274,0.0013197369,0.0003902128],"domain_scores_gemma":[0.9979413,0.0006221692,0.00009126097,0.000738285,0.00050962484,0.00009733422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049375165,0.0009287232,0.00076321705,0.0010585226,0.0012432294,0.004373626,0.0028710875,0.0016496982,0.005122261],"category_scores_gemma":[0.006258611,0.0016947621,0.0019336363,0.001018777,0.0025418375,0.0067652287,0.0022405186,0.0053801723,0.002847321],"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.000118758595,0.00008404101,0.00068305014,0.0004979576,0.000045640438,0.00018927664,0.001160044,0.0049941977,0.010321966,0.64235854,0.014249256,0.3252973],"study_design_scores_gemma":[0.00010420717,0.00020156577,0.00091481145,0.0006352073,0.0001984489,0.0015699387,0.00029747983,0.080231175,0.04885655,0.37955356,0.4872597,0.00017734438],"about_ca_topic_score_codex":0.0050469344,"about_ca_topic_score_gemma":0.003927669,"teacher_disagreement_score":0.005122261,"about_ca_system_score_codex":0.0014909819,"about_ca_system_score_gemma":0.003568857,"threshold_uncertainty_score":0.026112378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709051,0.00023467478,0.86286944,0.00016979217,0.00008050178,0.00017260983,0.00017362501,0.062320054,0.006888716],"genre_scores_gemma":[0.7261065,0.00020272116,0.2628892,0.00032047706,0.000049492974,0.00023317136,0.00044757995,0.0052200644,0.0045307595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980615,0.0003474333,0.0001560932,0.00034165903,0.0007563064,0.00033700603],"domain_scores_gemma":[0.99535537,0.0013528679,0.00044297086,0.002096974,0.00061986025,0.0001320184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121476,0.0007399159,0.0006501569,0.0011331349,0.00059815694,0.0014716471,0.0014472124,0.0006142907,0.0032875156],"category_scores_gemma":[0.0070117055,0.0006895465,0.00054335,0.0005792517,0.0012031049,0.002605903,0.0030574126,0.0013311101,0.0014035264],"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.0010317981,0.0006265738,0.019904017,0.0007354355,0.00012664968,0.0012422334,0.0022795282,0.041108787,0.20679316,0.08725173,0.018057957,0.62084204],"study_design_scores_gemma":[0.00013922372,0.0005791641,0.0072514256,0.0001908239,0.00015335435,0.0014911185,0.00024507393,0.3487868,0.51846796,0.047598254,0.074901275,0.00019556],"about_ca_topic_score_codex":0.00075173465,"about_ca_topic_score_gemma":0.0007074943,"teacher_disagreement_score":0.0032875156,"about_ca_system_score_codex":0.00082562683,"about_ca_system_score_gemma":0.0013257673,"threshold_uncertainty_score":0.010997891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009781737,0.0002299184,0.9226242,0.00012301987,0.00019650198,0.00046114047,0.00026686015,0.057562247,0.008754452],"genre_scores_gemma":[0.42445737,0.00044057443,0.5210247,0.0009904184,0.00028600032,0.0012217689,0.0019725214,0.014040802,0.03556583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975107,0.00045824936,0.00020385419,0.0004136692,0.0011270664,0.00028654025],"domain_scores_gemma":[0.99421114,0.0015706635,0.0003760255,0.0028153933,0.000819011,0.00020777571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680857,0.0011632345,0.00068656227,0.0010976483,0.00041680032,0.0023151524,0.0031574548,0.0013198592,0.016496738],"category_scores_gemma":[0.011755918,0.0013034603,0.001041784,0.0004244711,0.0010136319,0.0046709673,0.0038715163,0.0028493311,0.006872006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015060906,0.0007454594,0.0076763933,0.0016273095,0.00022463765,0.0016798401,0.0013309271,0.029755024,0.1288184,0.22749078,0.037310626,0.5618345],"study_design_scores_gemma":[0.00042778134,0.00066422526,0.003474143,0.00034446773,0.00017473205,0.0027905996,0.000097503165,0.25898522,0.30981755,0.07971164,0.34328765,0.00022446718],"about_ca_topic_score_codex":0.0004311654,"about_ca_topic_score_gemma":0.00032822735,"teacher_disagreement_score":0.016496738,"about_ca_system_score_codex":0.0005563725,"about_ca_system_score_gemma":0.001346084,"threshold_uncertainty_score":0.055187106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013277223,0.0015883399,0.9237124,0.0068099326,0.00035415907,0.00006824785,0.00012546346,0.00036019782,0.053704057],"genre_scores_gemma":[0.5846601,0.0030261162,0.38085577,0.003249972,0.0016448182,0.00047054686,0.00035821254,0.00052744953,0.02520701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99238527,0.0032836024,0.00041903718,0.0011918034,0.001978994,0.0007413157],"domain_scores_gemma":[0.97323316,0.015718512,0.0011684282,0.005855053,0.0028165686,0.0012082908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007062585,0.0010973708,0.0012447063,0.0041072154,0.0031253744,0.006878323,0.0026564382,0.0036463942,0.0075646974],"category_scores_gemma":[0.022673465,0.0011805389,0.0021879892,0.00225448,0.015927732,0.024181861,0.009505909,0.009554633,0.0017804014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042263446,0.0000040613213,0.00007302041,0.000011686976,0.000002729569,0.000013997887,0.000095358264,0.00081579224,0.000095411204,0.99578154,0.00047779913,0.002624404],"study_design_scores_gemma":[0.0000040600394,0.0000070917763,0.000024221661,0.000015110506,0.0000026873793,0.000030365156,0.000039555394,0.0055195247,0.00009133474,0.9900141,0.004246897,0.0000051746183],"about_ca_topic_score_codex":0.0013445625,"about_ca_topic_score_gemma":0.0011899525,"teacher_disagreement_score":0.0075646974,"about_ca_system_score_codex":0.0039498,"about_ca_system_score_gemma":0.0024380253,"threshold_uncertainty_score":0.037350953},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050299797,0.0031539698,0.48657995,0.00168265,0.0018291575,0.0017088625,0.0034405957,0.06754924,0.38375574],"genre_scores_gemma":[0.5122633,0.0022546926,0.18512847,0.0012879266,0.00036030277,0.0012359521,0.0069390424,0.002177407,0.28835288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993469,0.00008048615,0.00003843107,0.00009834818,0.0002930226,0.00014274655],"domain_scores_gemma":[0.9991788,0.00008920793,0.000053858737,0.00030107333,0.00027994238,0.00009712562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186756,0.0008971021,0.00042499436,0.00074702565,0.0006349108,0.0017465974,0.001656343,0.0010054432,0.07140662],"category_scores_gemma":[0.0013127889,0.0003229278,0.00044273012,0.00037301355,0.00046582567,0.0017323302,0.0022078825,0.001501983,0.037148125],"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.0018099878,0.00041795525,0.0026758742,0.0013067188,0.00014086571,0.0015444028,0.00053844607,0.01628896,0.1373881,0.25453582,0.17137653,0.41197634],"study_design_scores_gemma":[0.00019167228,0.0007940051,0.0017807053,0.00019440347,0.00008016514,0.001473674,0.00012600998,0.04700236,0.09220877,0.020500708,0.83554363,0.00010391804],"about_ca_topic_score_codex":0.00084653427,"about_ca_topic_score_gemma":0.0007230589,"teacher_disagreement_score":0.07140662,"about_ca_system_score_codex":0.00063443044,"about_ca_system_score_gemma":0.0011848458,"threshold_uncertainty_score":0.2388789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012759854,0.0037311811,0.9502703,0.003998134,0.00045305354,0.00020491215,0.00008801596,0.0009364297,0.03904195],"genre_scores_gemma":[0.1487771,0.010815443,0.8058915,0.0019876352,0.0017482027,0.0014379884,0.00041006942,0.00085918634,0.028072912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98287225,0.0057758004,0.0014849723,0.0021273296,0.006763377,0.0009762538],"domain_scores_gemma":[0.97890294,0.010543465,0.0012088736,0.0063847336,0.0025254013,0.0004346422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010873468,0.0020175204,0.0017234464,0.0036036714,0.003693651,0.007569998,0.0036000332,0.004528305,0.008206689],"category_scores_gemma":[0.03184233,0.001597545,0.002978085,0.003140626,0.012091343,0.014079319,0.008926979,0.010429803,0.0066525764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016700982,0.000020160642,0.000089758476,0.00021057435,0.000029099849,0.00011107363,0.00053240726,0.0031399303,0.0004444729,0.9653652,0.0039570522,0.026083674],"study_design_scores_gemma":[0.000020163949,0.000013181862,0.000021550579,0.00013398904,0.000013097453,0.00013094163,0.00006512417,0.007183945,0.00067736127,0.941667,0.050055485,0.000018169834],"about_ca_topic_score_codex":0.0015544661,"about_ca_topic_score_gemma":0.0010040475,"teacher_disagreement_score":0.010873468,"about_ca_system_score_codex":0.0037713265,"about_ca_system_score_gemma":0.0044251774,"threshold_uncertainty_score":0.05750507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54573697,0.011276685,0.24845222,0.0066200946,0.001026576,0.0010303301,0.00309391,0.018109508,0.16465367],"genre_scores_gemma":[0.9557326,0.0013759037,0.019783778,0.0012052319,0.00015228085,0.00016705554,0.0005859679,0.00033870857,0.020658517],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831545,0.00030340735,0.00016655758,0.00019266442,0.0007549814,0.0002668427],"domain_scores_gemma":[0.99543154,0.000730234,0.0004893147,0.0027744446,0.00042821481,0.00014617709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062311866,0.00053839106,0.00064546557,0.00089968165,0.0009648417,0.0021985413,0.0007424329,0.0014543951,0.0062367707],"category_scores_gemma":[0.005770042,0.00039772084,0.00048968,0.0006130239,0.00086974027,0.002155335,0.0030039172,0.0011994666,0.0031196927],"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.00157063,0.00024590775,0.017413793,0.0011594808,0.0002532143,0.00314353,0.0030346662,0.007615865,0.18546027,0.08405597,0.067376256,0.62867045],"study_design_scores_gemma":[0.00026643227,0.0009357943,0.014487807,0.00072422356,0.00037305578,0.0062260795,0.0010076489,0.06216708,0.4831308,0.032923773,0.39754927,0.00020801369],"about_ca_topic_score_codex":0.0010453933,"about_ca_topic_score_gemma":0.0009081924,"teacher_disagreement_score":0.0062367707,"about_ca_system_score_codex":0.00058141217,"about_ca_system_score_gemma":0.00068959023,"threshold_uncertainty_score":0.02086407},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008419939,0.0010001257,0.61251694,0.00085235253,0.0005948536,0.00055965746,0.014165626,0.28467768,0.077212825],"genre_scores_gemma":[0.18219548,0.0014133909,0.5399157,0.002343586,0.00045086173,0.0011656878,0.057702284,0.030438889,0.18437414],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979765,0.0003136807,0.00016948325,0.00062614394,0.0007540675,0.0001601643],"domain_scores_gemma":[0.99761295,0.0005816097,0.00016186706,0.0011001902,0.00047259423,0.00007080964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020652667,0.0013163628,0.0007832805,0.00196949,0.0008178712,0.0024458368,0.0020016883,0.0010508337,0.07237555],"category_scores_gemma":[0.0050491854,0.0009459308,0.0010056582,0.0009761783,0.000769682,0.0045451927,0.003326025,0.001686021,0.031946644],"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.0009995898,0.00022838709,0.0071210717,0.0009648625,0.00016226684,0.0003864011,0.00037884503,0.007765042,0.018117813,0.09229213,0.26020458,0.61137897],"study_design_scores_gemma":[0.00021697578,0.0001877783,0.0029068354,0.00015556623,0.00010272401,0.00048234337,0.00011965823,0.10629121,0.047820218,0.07774299,0.7638754,0.00009818404],"about_ca_topic_score_codex":0.0027282382,"about_ca_topic_score_gemma":0.0036648435,"teacher_disagreement_score":0.07237555,"about_ca_system_score_codex":0.0012009043,"about_ca_system_score_gemma":0.0016008584,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050299797,0.0031539698,0.48657995,0.00168265,0.0018291575,0.0017088625,0.0034405957,0.06754924,0.38375574],"genre_scores_gemma":[0.5122633,0.0022546926,0.18512847,0.0012879266,0.00036030277,0.0012359521,0.0069390424,0.002177407,0.28835288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993469,0.00008048615,0.00003843107,0.00009834818,0.0002930226,0.00014274655],"domain_scores_gemma":[0.9991788,0.00008920793,0.000053858737,0.00030107333,0.00027994238,0.00009712562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186756,0.0008971021,0.00042499436,0.00074702565,0.0006349108,0.0017465974,0.001656343,0.0010054432,0.07140662],"category_scores_gemma":[0.0013127889,0.0003229278,0.00044273012,0.00037301355,0.00046582567,0.0017323302,0.0022078825,0.001501983,0.037148125],"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.0018099878,0.00041795525,0.0026758742,0.0013067188,0.00014086571,0.0015444028,0.00053844607,0.01628896,0.1373881,0.25453582,0.17137653,0.41197634],"study_design_scores_gemma":[0.00019167228,0.0007940051,0.0017807053,0.00019440347,0.00008016514,0.001473674,0.00012600998,0.04700236,0.09220877,0.020500708,0.83554363,0.00010391804],"about_ca_topic_score_codex":0.00084653427,"about_ca_topic_score_gemma":0.0007230589,"teacher_disagreement_score":0.07140662,"about_ca_system_score_codex":0.00063443044,"about_ca_system_score_gemma":0.0011848458,"threshold_uncertainty_score":0.2388789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122418,0.015174434,0.23632629,0.009113321,0.0014532766,0.0009899434,0.0030760523,0.018160675,0.20346422],"genre_scores_gemma":[0.948534,0.0019494649,0.020611921,0.0016512469,0.00022963749,0.00016351149,0.000674147,0.0003694345,0.02581661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842864,0.0002704094,0.00013945115,0.00016869968,0.00074191135,0.00025081058],"domain_scores_gemma":[0.9957209,0.00067589496,0.0004449299,0.002568965,0.000439338,0.00015008732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006342929,0.00051941624,0.000617156,0.000880652,0.0009817302,0.002220018,0.00071682164,0.00144591,0.006499095],"category_scores_gemma":[0.005641331,0.00038611385,0.00047074383,0.0006287351,0.00088267826,0.0022130862,0.002823159,0.0012650657,0.003345566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014029477,0.00021202532,0.014735676,0.0011091834,0.0002173815,0.0026621302,0.0026577087,0.0060510435,0.17507574,0.08235373,0.08523991,0.6282826],"study_design_scores_gemma":[0.00024407727,0.00085641554,0.012871496,0.0006772066,0.00033035592,0.0056232987,0.0009222622,0.049689617,0.43424407,0.030211106,0.46414018,0.00019003228],"about_ca_topic_score_codex":0.001036815,"about_ca_topic_score_gemma":0.0009292574,"teacher_disagreement_score":0.006499095,"about_ca_system_score_codex":0.00059596915,"about_ca_system_score_gemma":0.000682131,"threshold_uncertainty_score":0.021741569},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001957108,0.0076237344,0.0037188597,0.07118429,0.18361479,0.00067030726,0.0065877326,0.002449851,0.72219324],"genre_scores_gemma":[0.004061269,0.0025868907,0.0007946734,0.008460896,0.011341978,0.00016866006,0.002376919,0.00045239288,0.96975625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982823,0.00018137823,0.000074747055,0.00030058555,0.0009301016,0.00023092455],"domain_scores_gemma":[0.98814964,0.0006547549,0.0002639562,0.00060064043,0.0072890627,0.003041956],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001544413,0.00083798176,0.00063333666,0.0020063291,0.0023388357,0.0056146644,0.0014101409,0.001859094,0.5892071],"category_scores_gemma":[0.013475183,0.00028831192,0.00041368348,0.0015517591,0.00047480717,0.003604408,0.0026079959,0.0020757439,0.44328973],"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.00001161276,0.000007851983,0.000100352816,0.000035121822,7.5180066e-7,0.00002620545,0.000048722588,0.000018141462,0.000065514774,0.0016241412,0.97263825,0.025423229],"study_design_scores_gemma":[0.0000022845654,0.000003625678,0.000120769706,0.000039978328,8.415812e-7,0.000049118975,0.0000833766,0.000016266185,0.000037303365,0.00049300236,0.9991511,0.0000024168166],"about_ca_topic_score_codex":0.0018581146,"about_ca_topic_score_gemma":0.0027850247,"teacher_disagreement_score":0.4107929,"about_ca_system_score_codex":0.0019822943,"about_ca_system_score_gemma":0.0029389106,"threshold_uncertainty_score":0.5859462},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02437614,0.0009372209,0.23735672,0.0010307473,0.00046913023,0.00094031123,0.004819888,0.6959175,0.034152336],"genre_scores_gemma":[0.47586668,0.0020961927,0.37883353,0.0029277196,0.0006277418,0.0012500654,0.028491441,0.015955897,0.09395075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997938,0.00029571727,0.00021259657,0.0003796147,0.0009843917,0.00018963448],"domain_scores_gemma":[0.996366,0.00069462915,0.0005179979,0.0013147823,0.0008967126,0.00020984937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020741315,0.001088133,0.0009903366,0.0018814085,0.000656752,0.0016655378,0.0023947638,0.0010910534,0.021235872],"category_scores_gemma":[0.0075410544,0.0005600183,0.0007909958,0.00085838715,0.0006131285,0.0029804378,0.0021951068,0.0017893609,0.013838117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019144688,0.00054354046,0.0063477997,0.00087598205,0.00038628306,0.0010252857,0.0006366138,0.014902024,0.04487683,0.02208022,0.45295766,0.45345333],"study_design_scores_gemma":[0.0006165968,0.00088262704,0.005655958,0.0001966123,0.00037990743,0.002678515,0.000191771,0.284511,0.096546374,0.02227894,0.5857617,0.0003000126],"about_ca_topic_score_codex":0.0015067547,"about_ca_topic_score_gemma":0.0011696601,"teacher_disagreement_score":0.021235872,"about_ca_system_score_codex":0.0006645553,"about_ca_system_score_gemma":0.0013591439,"threshold_uncertainty_score":0.07104111},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13508575,0.0367812,0.6556513,0.0028839067,0.00076478434,0.00089343684,0.002924579,0.037434198,0.12758088],"genre_scores_gemma":[0.6904524,0.01875013,0.24393448,0.0009639596,0.00042047247,0.00035659655,0.0041538915,0.0018146412,0.039153438],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827707,0.00021293222,0.00009417144,0.00037288244,0.00089327607,0.0001497808],"domain_scores_gemma":[0.9952583,0.0017918695,0.0009673599,0.0007668644,0.0010496288,0.00016603248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011044298,0.0012452708,0.0007389988,0.0029251028,0.0005134282,0.0024016646,0.0017369607,0.0011984588,0.0035124863],"category_scores_gemma":[0.005771552,0.00042352988,0.0005276154,0.001884018,0.0005205113,0.003521728,0.0012820697,0.0012018776,0.0022750306],"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.00026684575,0.00016508657,0.011465707,0.0011389687,0.00007986842,0.00037062741,0.00068397383,0.008967641,0.022185188,0.016975233,0.02633549,0.9113654],"study_design_scores_gemma":[0.00010081573,0.0009786444,0.042937517,0.003048212,0.00060783717,0.008132861,0.0010952805,0.22962542,0.25411576,0.058149695,0.400778,0.00042995904],"about_ca_topic_score_codex":0.0011722596,"about_ca_topic_score_gemma":0.00112962,"teacher_disagreement_score":0.0035124863,"about_ca_system_score_codex":0.0008486346,"about_ca_system_score_gemma":0.0011327913,"threshold_uncertainty_score":0.0117504},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029877866,0.005981445,0.121078186,0.0050117243,0.00322061,0.0009096719,0.024902776,0.171518,0.6374997],"genre_scores_gemma":[0.22438067,0.0053466014,0.13143021,0.004218959,0.00067630655,0.0011278654,0.05966193,0.02297014,0.5501873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992662,0.00007100726,0.000036395988,0.00018425084,0.0002939186,0.00014826022],"domain_scores_gemma":[0.99925023,0.0000888409,0.00004125336,0.00028388554,0.00020479926,0.00013099442],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069888314,0.00092901307,0.00074318354,0.0007820294,0.0010989179,0.0025836527,0.0025327706,0.0015131055,0.16754037],"category_scores_gemma":[0.0017853344,0.000781499,0.0007192999,0.0006964317,0.0006971844,0.0038734125,0.003487051,0.0016119037,0.10400657],"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.0012691843,0.00023607975,0.0034944403,0.0015868134,0.00014478175,0.0005942605,0.0004882961,0.0058890763,0.03531098,0.07794209,0.63064003,0.24240395],"study_design_scores_gemma":[0.00009052131,0.00009857371,0.00073886197,0.00009788069,0.000036999387,0.00027803637,0.00011541163,0.006807826,0.0144147305,0.0093368,0.96793157,0.00005279492],"about_ca_topic_score_codex":0.00260656,"about_ca_topic_score_gemma":0.0031089878,"teacher_disagreement_score":0.8324596,"about_ca_system_score_codex":0.00090144546,"about_ca_system_score_gemma":0.0015962526,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040559713,0.00083139277,0.15380603,0.0011736179,0.0009711368,0.00020459594,0.002666599,0.0072346996,0.829056],"genre_scores_gemma":[0.07116775,0.0012913424,0.034244556,0.0007324759,0.00043472054,0.00033627538,0.0051085153,0.002864751,0.88381964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919623,0.00009495304,0.00003952777,0.00021491296,0.00036253268,0.00009180477],"domain_scores_gemma":[0.9991449,0.00013103483,0.00003146018,0.00046175954,0.00019008557,0.000040699062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559068,0.0010107576,0.0005999194,0.0015813885,0.0014281356,0.006350871,0.001369414,0.0013282229,0.13164078],"category_scores_gemma":[0.0020965682,0.0006231875,0.00062322285,0.001511163,0.0016263849,0.009169705,0.0031507008,0.0020248082,0.06570984],"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.00008407818,0.000048181526,0.00019770068,0.00013188734,0.000008032208,0.000052254887,0.000419671,0.00044444067,0.0026811128,0.82834536,0.058892358,0.10869497],"study_design_scores_gemma":[0.000013644186,0.000028564156,0.00013504745,0.00006747026,0.000017461534,0.00009835165,0.000108704764,0.0019464885,0.0060664667,0.24340264,0.7480953,0.000019902864],"about_ca_topic_score_codex":0.0013624266,"about_ca_topic_score_gemma":0.0011961437,"teacher_disagreement_score":0.13164078,"about_ca_system_score_codex":0.0011474895,"about_ca_system_score_gemma":0.0011662791,"threshold_uncertainty_score":0.44038224},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042486984,0.12610744,0.40588838,0.021108259,0.0016282958,0.00006612634,0.00011189112,0.0018355586,0.40076706],"genre_scores_gemma":[0.62639046,0.07876077,0.10258666,0.0023547865,0.001421605,0.00008160139,0.00014362043,0.0011913453,0.1870691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852693,0.00041932796,0.000053577318,0.00016031135,0.00068625645,0.00015361368],"domain_scores_gemma":[0.9958009,0.0026553608,0.000116780844,0.00059947063,0.0005603707,0.00026707575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003242918,0.00061218196,0.0005854543,0.00073459075,0.000957882,0.0051934957,0.0013522229,0.001711015,0.0071562976],"category_scores_gemma":[0.005080117,0.00056936033,0.0003807556,0.0011173588,0.0033712364,0.0074044615,0.0022282414,0.004962994,0.0017502368],"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.00020367661,0.00010502325,0.000538582,0.0002566048,0.000022488972,0.00022408829,0.0031795925,0.010709838,0.005665315,0.6809066,0.025807634,0.27238047],"study_design_scores_gemma":[0.000033059045,0.00018895391,0.00042900763,0.00035668578,0.000038001042,0.00072444277,0.00089773093,0.04358475,0.00924773,0.33379647,0.61064196,0.00006123038],"about_ca_topic_score_codex":0.0014615956,"about_ca_topic_score_gemma":0.001528155,"teacher_disagreement_score":0.0071562976,"about_ca_system_score_codex":0.0018828427,"about_ca_system_score_gemma":0.001385672,"threshold_uncertainty_score":0.023940146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997771,0.002552242,0.53698146,0.00061448343,0.00022238035,0.00034564035,0.00035977637,0.03414208,0.02500486],"genre_scores_gemma":[0.88052505,0.00058365474,0.10900733,0.00026802206,0.000035109068,0.00015099754,0.00034928462,0.0012112329,0.007869374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908614,0.00014948264,0.00008257097,0.00013805108,0.00027966689,0.0002640986],"domain_scores_gemma":[0.9985598,0.00024882998,0.00016939625,0.00070539856,0.00025055185,0.00006606329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008051678,0.00077903975,0.00041820045,0.0006355997,0.00076322467,0.0011911256,0.0013559968,0.00053046,0.0046500443],"category_scores_gemma":[0.002231286,0.0006088362,0.0004290626,0.00061114656,0.0010307127,0.003261217,0.0017145739,0.0011286427,0.0011641147],"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.0035861155,0.00042240144,0.015045868,0.0011680915,0.00016448862,0.00095559057,0.001887173,0.06078528,0.24180454,0.16947247,0.02620722,0.47850075],"study_design_scores_gemma":[0.00033982235,0.001606469,0.005128109,0.00032037726,0.00026083997,0.00089859305,0.0005077283,0.2933356,0.496707,0.058351383,0.14235936,0.00018488333],"about_ca_topic_score_codex":0.0022305215,"about_ca_topic_score_gemma":0.0021244425,"teacher_disagreement_score":0.0046500443,"about_ca_system_score_codex":0.0010818461,"about_ca_system_score_gemma":0.0015487721,"threshold_uncertainty_score":0.015555978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957734,0.00027573638,0.0021520623,0.00020049556,0.000009529515,0.00001704355,0.00019060433,0.00053263543,0.0008486108],"genre_scores_gemma":[0.9943984,0.00019286016,0.0033495682,0.00013697159,0.000013652291,0.000024669413,0.0005163317,0.00057295966,0.000794631],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9906607,0.0030644692,0.0007416383,0.0012788571,0.0037741454,0.0004802222],"domain_scores_gemma":[0.8772019,0.07732384,0.025174905,0.009077398,0.009326702,0.0018953393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00722738,0.00054376165,0.00046366552,0.0049821185,0.0009345382,0.0026522675,0.0009995946,0.00080999784,0.0010149862],"category_scores_gemma":[0.07248842,0.0006690788,0.0003705934,0.0035299002,0.0025640798,0.0053536994,0.0023560456,0.0013909759,0.0004758634],"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.00044424672,0.00030354774,0.77549356,0.00041310117,0.00015448274,0.002272271,0.048135784,0.0014127931,0.007810724,0.0012921045,0.00391293,0.1583544],"study_design_scores_gemma":[0.000026852016,0.0004436031,0.9275613,0.0003885989,0.00015959115,0.0048908736,0.02566991,0.014168364,0.009755937,0.0033098042,0.013420595,0.00020465405],"about_ca_topic_score_codex":0.0031537707,"about_ca_topic_score_gemma":0.0054090214,"teacher_disagreement_score":0.00722738,"about_ca_system_score_codex":0.0008936372,"about_ca_system_score_gemma":0.0006984763,"threshold_uncertainty_score":0.03822249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01766456,0.00040360508,0.9128974,0.00026236373,0.000083117695,0.00013600833,0.00052531506,0.06480973,0.0032178112],"genre_scores_gemma":[0.32818726,0.00036029553,0.65557724,0.00035764495,0.000074878255,0.00023566218,0.0016480868,0.010389355,0.0031694474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611664,0.0009999708,0.00031156483,0.00063046615,0.0015890679,0.00035226526],"domain_scores_gemma":[0.9924631,0.0035367298,0.000715628,0.0023564633,0.00079883117,0.00012922892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023263476,0.001544088,0.00086319196,0.0018958678,0.0007731841,0.0019808044,0.0025571682,0.0008042081,0.008593989],"category_scores_gemma":[0.012106264,0.0009978233,0.0011724517,0.0010254278,0.0022021018,0.004339952,0.0027348567,0.0019566668,0.0025886798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017886639,0.00035550923,0.010717895,0.0019766756,0.00027064706,0.00065809616,0.0012175778,0.107405,0.09043466,0.17743877,0.028125295,0.57961124],"study_design_scores_gemma":[0.00016830344,0.00031996152,0.0015769497,0.00029738856,0.00015428006,0.00055049115,0.00021594661,0.69016755,0.17862564,0.08114114,0.046630718,0.0001516829],"about_ca_topic_score_codex":0.0035952402,"about_ca_topic_score_gemma":0.0051183137,"teacher_disagreement_score":0.008593989,"about_ca_system_score_codex":0.0017502551,"about_ca_system_score_gemma":0.0038205383,"threshold_uncertainty_score":0.028749704},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022111617,0.33575484,0.4355513,0.012544689,0.0032313874,0.00041897336,0.0006532147,0.0014591087,0.18827492],"genre_scores_gemma":[0.26721823,0.35973057,0.2523639,0.0077198697,0.0074414606,0.0009825641,0.0019747193,0.00078608195,0.10178264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859816,0.00023866826,0.000210205,0.0002694667,0.0005289318,0.00015454763],"domain_scores_gemma":[0.99881375,0.00054122094,0.00021342574,0.00015917368,0.000207144,0.00006538926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078154553,0.001033625,0.00060160994,0.003657293,0.0014257547,0.004943311,0.0010792146,0.0024082095,0.0061966213],"category_scores_gemma":[0.002458344,0.0009942178,0.00061348855,0.0044190474,0.0031287097,0.008711467,0.0020252804,0.006224173,0.0026801454],"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.000040004066,0.0000700901,0.0010180817,0.0007069661,0.000009173642,0.00014773195,0.00087398785,0.0032331066,0.0017529078,0.8670324,0.016790004,0.10832551],"study_design_scores_gemma":[0.000008997528,0.00023044538,0.0020962397,0.0014924892,0.000015929963,0.0012274045,0.0005098412,0.010841082,0.0021517319,0.21921752,0.7621565,0.000051850577],"about_ca_topic_score_codex":0.0019189342,"about_ca_topic_score_gemma":0.0010904009,"teacher_disagreement_score":0.0061966213,"about_ca_system_score_codex":0.0022059178,"about_ca_system_score_gemma":0.0014486774,"threshold_uncertainty_score":0.02072978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0514744,0.00026188977,0.93273425,0.0010189182,0.00010858999,0.00017440945,0.00029428746,0.0053486815,0.008584542],"genre_scores_gemma":[0.59506875,0.000508479,0.3950298,0.0010086083,0.00010007086,0.0002409689,0.00072694,0.0013279606,0.0059884484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952011,0.0015238682,0.00034418885,0.00092246354,0.0012306285,0.00077779],"domain_scores_gemma":[0.9831445,0.01383071,0.000444345,0.0014400533,0.0008765052,0.00026386947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030807178,0.0017446157,0.0014739773,0.0017712396,0.0016596485,0.0026360895,0.0021205037,0.0024375697,0.0066561163],"category_scores_gemma":[0.011039596,0.0017800422,0.004306052,0.0015361996,0.004751189,0.0063490877,0.006225754,0.00519881,0.0025455519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024664195,0.00059026753,0.0050054905,0.0024523002,0.00047937367,0.0030874084,0.001993821,0.12795334,0.12691265,0.5610359,0.010450726,0.15757237],"study_design_scores_gemma":[0.00038651584,0.00030069822,0.00081807736,0.0001802484,0.00033603227,0.00054750533,0.00034420702,0.2789635,0.091944225,0.61831725,0.00775637,0.00010535627],"about_ca_topic_score_codex":0.007922036,"about_ca_topic_score_gemma":0.006986526,"teacher_disagreement_score":0.007922036,"about_ca_system_score_codex":0.0015493192,"about_ca_system_score_gemma":0.0020953543,"threshold_uncertainty_score":0.022266924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51512724,0.0040657213,0.36180413,0.0010314005,0.00085774163,0.0005795476,0.0011932488,0.09565921,0.01968174],"genre_scores_gemma":[0.8951684,0.000281777,0.09078781,0.0004893569,0.000083423736,0.00022015141,0.000893843,0.0008956152,0.0111796195],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934655,0.00008628076,0.00005077217,0.00014909203,0.00021639327,0.00015101297],"domain_scores_gemma":[0.99815816,0.00027256872,0.00023885745,0.00088365335,0.00034572138,0.000101103884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777328,0.0011779262,0.0005344921,0.0005914129,0.00059316744,0.00085051183,0.0024435204,0.0005234423,0.007359643],"category_scores_gemma":[0.0013029422,0.0004983071,0.0005277311,0.00037154707,0.0007146826,0.0020015931,0.0015483629,0.0008302132,0.0021009634],"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.0018556096,0.00050185074,0.011849915,0.001047528,0.00037675453,0.00091953995,0.0006837737,0.04640321,0.5343909,0.010659288,0.05136835,0.3399433],"study_design_scores_gemma":[0.00023327072,0.0033342247,0.005557719,0.00010933335,0.00029156395,0.0015796514,0.00043442694,0.3551517,0.5418029,0.010774661,0.08049957,0.00023093174],"about_ca_topic_score_codex":0.0012598605,"about_ca_topic_score_gemma":0.0032751034,"teacher_disagreement_score":0.007359643,"about_ca_system_score_codex":0.0005439488,"about_ca_system_score_gemma":0.0010107427,"threshold_uncertainty_score":0.024620473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005535848,0.00048689457,0.978231,0.0003744192,0.00010370706,0.000042193285,0.00004660342,0.0010441319,0.014135043],"genre_scores_gemma":[0.47068223,0.0015748526,0.50791174,0.00032569538,0.00037929683,0.0002585692,0.00020509257,0.00091852277,0.017744076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806076,0.00071474403,0.00013663954,0.00029374607,0.000606419,0.00018774466],"domain_scores_gemma":[0.9951514,0.0037817548,0.0001418622,0.00058826554,0.00026795358,0.0000686614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018717634,0.0012840036,0.00142288,0.0017388023,0.0010604853,0.0034393556,0.0015711316,0.001559299,0.006439048],"category_scores_gemma":[0.008603809,0.0010930159,0.0020725627,0.0020879514,0.00808805,0.004923344,0.0031427718,0.0051899934,0.0011339037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007223055,0.00003307044,0.00012000077,0.000104016945,0.000021429867,0.00013133146,0.00033179505,0.026227213,0.0019499024,0.92334795,0.0014535001,0.046207685],"study_design_scores_gemma":[0.000013785689,0.000012523985,0.000032265776,0.00002145029,0.0000179669,0.000033467306,0.000027265953,0.074833006,0.0013786425,0.9211235,0.0024933394,0.000012776553],"about_ca_topic_score_codex":0.0016848183,"about_ca_topic_score_gemma":0.0013770858,"teacher_disagreement_score":0.006439048,"about_ca_system_score_codex":0.0016094805,"about_ca_system_score_gemma":0.0013329503,"threshold_uncertainty_score":0.02154082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042204345,0.9578314,0.017213995,0.0033291825,0.0005491349,0.00017600419,0.000055648055,0.00016696494,0.016457248],"genre_scores_gemma":[0.073879294,0.90202075,0.017365625,0.0018603245,0.0004758312,0.00023736263,0.00021288457,0.000071645365,0.003876362],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99221593,0.0024470047,0.0005539796,0.0010833688,0.0031633289,0.0005363847],"domain_scores_gemma":[0.9667831,0.023588566,0.003028781,0.0017598721,0.004272981,0.000566697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008573637,0.0017298787,0.0015168166,0.0060067833,0.0012556214,0.0038606322,0.0033207734,0.0032363278,0.0052646813],"category_scores_gemma":[0.020448735,0.00085531286,0.0012409905,0.0039820164,0.0023349258,0.006697437,0.002616816,0.002225132,0.002359278],"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.000057538484,0.00011941106,0.0015122449,0.013619685,0.00011605128,0.00007847961,0.00037554637,0.0013571496,0.0008721137,0.015062832,0.0066016405,0.9602273],"study_design_scores_gemma":[0.000052559135,0.00097377837,0.005860771,0.034556698,0.0004798193,0.0018131157,0.0031421287,0.003037275,0.0075066932,0.019205369,0.92322683,0.00014495471],"about_ca_topic_score_codex":0.0016771116,"about_ca_topic_score_gemma":0.001632339,"teacher_disagreement_score":0.008573637,"about_ca_system_score_codex":0.0017339579,"about_ca_system_score_gemma":0.004355743,"threshold_uncertainty_score":0.045342267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078470565,0.0014378472,0.8260774,0.0041935,0.0014194853,0.0003964095,0.0024401897,0.022858962,0.06270558],"genre_scores_gemma":[0.7185247,0.0008973711,0.23876204,0.0034390695,0.0009230715,0.0006663257,0.0039504888,0.010522252,0.022314653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863804,0.0031811227,0.0015506259,0.0030147072,0.0040498106,0.0018234389],"domain_scores_gemma":[0.9499929,0.01604106,0.0026051903,0.022117283,0.008419826,0.00082372886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007858938,0.0009874019,0.0011229091,0.00145918,0.0020682376,0.0045192647,0.0023825306,0.0014782978,0.008456647],"category_scores_gemma":[0.04291907,0.0013130922,0.0014826024,0.0012269294,0.003777146,0.011265022,0.008019452,0.0049967174,0.0028287342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011578286,0.0002208318,0.011719147,0.0010999114,0.00020062123,0.0014756226,0.002501499,0.026394418,0.02321373,0.69707847,0.046051018,0.18888696],"study_design_scores_gemma":[0.00026586585,0.00023069899,0.0026927406,0.0003768788,0.00027849275,0.0015365265,0.0004374592,0.050033506,0.06552062,0.75860137,0.1198362,0.00018953178],"about_ca_topic_score_codex":0.002471478,"about_ca_topic_score_gemma":0.0021454643,"teacher_disagreement_score":0.008456647,"about_ca_system_score_codex":0.0014265453,"about_ca_system_score_gemma":0.0046701184,"threshold_uncertainty_score":0.041562498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017041886,0.0023070967,0.8142502,0.0008898875,0.00040877695,0.0021659012,0.0009586651,0.15487823,0.0070994557],"genre_scores_gemma":[0.46901932,0.0028528273,0.49735227,0.002030058,0.0002833464,0.0027102737,0.0030350157,0.0081530595,0.014563788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763393,0.00031944376,0.0004181004,0.00030569924,0.0009790484,0.00034374604],"domain_scores_gemma":[0.998348,0.0005941899,0.00021019283,0.00036719546,0.00035046443,0.00012994882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517702,0.0015116524,0.0009453227,0.0016540908,0.00086021516,0.0020459713,0.0021517426,0.0015804396,0.003112905],"category_scores_gemma":[0.007805103,0.0012531165,0.0014810517,0.0003490371,0.0010595057,0.0026194518,0.002605758,0.004135592,0.001168296],"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.0013055012,0.0010176805,0.011681765,0.0034684553,0.00038405263,0.005934492,0.0039411127,0.057007328,0.09473628,0.13486448,0.10670091,0.5789579],"study_design_scores_gemma":[0.00043830374,0.00051776477,0.0053370004,0.0011023376,0.00031560264,0.0038302375,0.0003780783,0.56188935,0.07489772,0.029485654,0.32117078,0.00063721935],"about_ca_topic_score_codex":0.008144357,"about_ca_topic_score_gemma":0.007044117,"teacher_disagreement_score":0.008144357,"about_ca_system_score_codex":0.0009367343,"about_ca_system_score_gemma":0.0030202859,"threshold_uncertainty_score":0.016193867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915036,0.00010588242,0.0062827137,0.00029984527,0.0000030262813,0.00000905893,0.000055813623,0.00009633489,0.0016437634],"genre_scores_gemma":[0.9993869,0.0000134742195,0.0004203342,0.0000041387375,0.000001438657,0.00000207333,0.000021785554,0.0000063453767,0.00014343295],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99782616,0.000983488,0.00010758514,0.00033940774,0.00041017393,0.00033323508],"domain_scores_gemma":[0.95744866,0.028249137,0.0068053124,0.0037915867,0.0026583504,0.0010469784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042046746,0.00021649945,0.00022426622,0.0027287004,0.00081747153,0.0014996864,0.0006790548,0.0005253632,0.002101588],"category_scores_gemma":[0.054171726,0.00018984445,0.0002586384,0.0017089483,0.0013719734,0.0037372322,0.0014352738,0.00096108194,0.00014770601],"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.000478198,0.00031762876,0.7447213,0.00008620884,0.000114024886,0.00033496812,0.0041085244,0.058016423,0.0021816164,0.07729128,0.0023543946,0.1099954],"study_design_scores_gemma":[0.000039179668,0.00028229304,0.39364624,0.00011138791,0.00010928954,0.0008211107,0.0063135438,0.44218665,0.004216496,0.14866374,0.0035401674,0.000069963775],"about_ca_topic_score_codex":0.007222889,"about_ca_topic_score_gemma":0.0052254344,"teacher_disagreement_score":0.007222889,"about_ca_system_score_codex":0.0020710316,"about_ca_system_score_gemma":0.0011980115,"threshold_uncertainty_score":0.022236705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765829,0.0063940827,0.59646094,0.0082669845,0.0004184425,0.0011751738,0.0029440098,0.0064038225,0.101353675],"genre_scores_gemma":[0.6052605,0.005545835,0.37358665,0.0011443696,0.00017680012,0.0005022225,0.0029081202,0.0003664582,0.010509097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933101,0.00082373223,0.0011310048,0.00076466287,0.0031255914,0.00084496906],"domain_scores_gemma":[0.9795926,0.0064778053,0.0033495,0.003281388,0.006365588,0.0009330766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031908718,0.0009858786,0.0005722037,0.010476112,0.003148603,0.003576314,0.0017310278,0.0037385374,0.003887989],"category_scores_gemma":[0.016846415,0.0006737981,0.0011688025,0.0044269864,0.0041151126,0.0077506946,0.0034679475,0.0024222997,0.0010988573],"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.000118238066,0.0002410217,0.04550269,0.0010081853,0.000057109875,0.0045984318,0.009105868,0.01020393,0.0063956226,0.7497187,0.011421126,0.16162911],"study_design_scores_gemma":[0.000059311085,0.0003411002,0.021641852,0.0018691526,0.00014354261,0.01365961,0.0055285594,0.051788855,0.005138006,0.7184272,0.1811439,0.00025891914],"about_ca_topic_score_codex":0.007226935,"about_ca_topic_score_gemma":0.0056037465,"teacher_disagreement_score":0.010476112,"about_ca_system_score_codex":0.0017037814,"about_ca_system_score_gemma":0.0035124228,"threshold_uncertainty_score":0.016875148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008029095,0.00010670748,0.9320179,0.00017869117,0.00009069958,0.00033094414,0.00025440333,0.05625256,0.0027389897],"genre_scores_gemma":[0.22658859,0.00023948897,0.74860454,0.00054875383,0.00011364736,0.00049460336,0.0017849323,0.011228001,0.010397556],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956168,0.00081286946,0.0003898327,0.0011316809,0.0013536963,0.0006949931],"domain_scores_gemma":[0.9920731,0.0030203585,0.00035867625,0.0032690861,0.0009482939,0.000330487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004109693,0.002194453,0.0014624178,0.0015657404,0.001238227,0.003112149,0.003440065,0.0017722811,0.020019256],"category_scores_gemma":[0.009401272,0.0018604022,0.002744491,0.0009010324,0.0023718907,0.0062532336,0.0063339886,0.0035219037,0.007788686],"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.0031303326,0.0013405668,0.0065201526,0.0012244923,0.0004528745,0.0014008735,0.0021015247,0.042119242,0.1269392,0.11985433,0.05574327,0.63917315],"study_design_scores_gemma":[0.00063602655,0.00063877075,0.0018354986,0.00022617639,0.00041548247,0.000658326,0.0002823562,0.5987058,0.15578277,0.176507,0.06398451,0.0003272342],"about_ca_topic_score_codex":0.004252327,"about_ca_topic_score_gemma":0.005141396,"teacher_disagreement_score":0.020019256,"about_ca_system_score_codex":0.0014607753,"about_ca_system_score_gemma":0.0033966575,"threshold_uncertainty_score":0.06697112},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016170286,0.00027117474,0.75664467,0.00037846479,0.000130817,0.0007905778,0.0010223667,0.20875026,0.015841372],"genre_scores_gemma":[0.52581835,0.00041100674,0.43489864,0.0011364939,0.00018434745,0.0006105706,0.0047712433,0.0045551606,0.027614137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955586,0.0005249315,0.00036806433,0.0010490613,0.0020843118,0.00041509303],"domain_scores_gemma":[0.9947883,0.00077640114,0.0004955518,0.0022475536,0.0013961527,0.00029599128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028136938,0.001310252,0.0008558701,0.0017457994,0.0005114453,0.002731728,0.0024007806,0.0010221102,0.00996714],"category_scores_gemma":[0.0051764753,0.00072320463,0.0012315812,0.0005272648,0.0010900036,0.0025126056,0.0027063813,0.0018983994,0.0069279973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015587081,0.0017554591,0.016447647,0.000980333,0.00027692926,0.0013553783,0.0008428096,0.050291363,0.061197113,0.07409864,0.098595105,0.69260037],"study_design_scores_gemma":[0.00018349991,0.00070595933,0.0047500194,0.00015568803,0.00017263375,0.0015901895,0.00015575603,0.67012215,0.12888779,0.031479098,0.1615845,0.00021272441],"about_ca_topic_score_codex":0.002388553,"about_ca_topic_score_gemma":0.0018725474,"teacher_disagreement_score":0.00996714,"about_ca_system_score_codex":0.0008754114,"about_ca_system_score_gemma":0.0022120462,"threshold_uncertainty_score":0.033343434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088194,0.0009660016,0.18037641,0.00031997904,0.0001253913,0.0000915251,0.00015226257,0.0016952003,0.0074539534],"genre_scores_gemma":[0.99272716,0.00010153214,0.0062899957,0.000019887912,0.000013096693,0.000011497963,0.00005479207,0.000039445942,0.00074259087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656445,0.0006051392,0.00012168313,0.00043816888,0.0015454569,0.0007251179],"domain_scores_gemma":[0.9865855,0.0069232844,0.0014389621,0.0020933722,0.0027420297,0.00021685522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024559924,0.0004898643,0.00046209918,0.0012200756,0.00065159355,0.0010385335,0.0010904705,0.00054194237,0.0029960703],"category_scores_gemma":[0.012037663,0.00027530696,0.0007351853,0.00074551307,0.0011521823,0.0025469312,0.00077562785,0.0006256013,0.00022052118],"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.0029852341,0.00037227222,0.048169695,0.00080329896,0.00030853873,0.0016416915,0.0005397249,0.6063981,0.10434485,0.095602356,0.004275168,0.13455914],"study_design_scores_gemma":[0.000025507248,0.0002695844,0.0045048767,0.000027217813,0.00015678073,0.000261632,0.00010726732,0.9499427,0.036369234,0.0073277312,0.0009798105,0.000027638629],"about_ca_topic_score_codex":0.0034154025,"about_ca_topic_score_gemma":0.0027484728,"teacher_disagreement_score":0.0034154025,"about_ca_system_score_codex":0.0013220847,"about_ca_system_score_gemma":0.0021650635,"threshold_uncertainty_score":0.012988687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011837071,0.0013299552,0.95897436,0.005276914,0.0007251537,0.00014156023,0.00016238786,0.0033201983,0.01823252],"genre_scores_gemma":[0.49662417,0.0022066995,0.48174107,0.002850385,0.001311997,0.000351967,0.0006208198,0.003272138,0.011020873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98320067,0.00468991,0.0014837179,0.0028698414,0.006140736,0.0016151512],"domain_scores_gemma":[0.90477335,0.03964358,0.0035843474,0.036046483,0.013694958,0.0022572698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017486433,0.0013362654,0.001617071,0.0019515463,0.002443445,0.007909099,0.004114161,0.0035868597,0.0077747116],"category_scores_gemma":[0.07331472,0.0016177009,0.0022085472,0.0008975442,0.0157368,0.025642822,0.00909801,0.010957107,0.0044375197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002675877,0.00010543118,0.0014053214,0.00043357184,0.000050930703,0.0002949616,0.00091877097,0.010296075,0.004171077,0.92807335,0.0054573175,0.048525725],"study_design_scores_gemma":[0.000096996526,0.000151283,0.000333727,0.00044422815,0.00007840177,0.0002242803,0.00019761077,0.04608618,0.013522101,0.9034315,0.035352867,0.000080745376],"about_ca_topic_score_codex":0.0025878302,"about_ca_topic_score_gemma":0.0011499884,"teacher_disagreement_score":0.017486433,"about_ca_system_score_codex":0.002097506,"about_ca_system_score_gemma":0.007992866,"threshold_uncertainty_score":0.092478216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033859797,0.0031151471,0.8230828,0.02120255,0.007391172,0.00050320587,0.001087749,0.03767121,0.07208641],"genre_scores_gemma":[0.1738336,0.0025985658,0.7332239,0.009948053,0.0010750442,0.00039416878,0.0016148385,0.022441104,0.054870788],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986268,0.00023387151,0.00009107587,0.00021567516,0.000666817,0.0001658062],"domain_scores_gemma":[0.9935353,0.0015390837,0.0003108757,0.0016513076,0.0027523828,0.00021103965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020731802,0.00081172626,0.00040934907,0.00065122475,0.00070228014,0.0023618832,0.0010361385,0.0012470001,0.016832773],"category_scores_gemma":[0.01721811,0.00060094206,0.00053542445,0.00046037722,0.0013882887,0.0044830954,0.0012845375,0.0020980272,0.018316584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057597447,0.00023784746,0.0058261296,0.0012187869,0.00009956659,0.00094949367,0.00220766,0.009053956,0.067609526,0.09852265,0.18525441,0.628444],"study_design_scores_gemma":[0.00018374137,0.00043934933,0.0015219118,0.0010987975,0.0001682517,0.0018091231,0.0011748456,0.030003754,0.107118286,0.07534379,0.78094935,0.00018875205],"about_ca_topic_score_codex":0.0013542442,"about_ca_topic_score_gemma":0.0015882433,"teacher_disagreement_score":0.016832773,"about_ca_system_score_codex":0.0004506677,"about_ca_system_score_gemma":0.0014091027,"threshold_uncertainty_score":0.05631125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032201896,0.0003816111,0.8488105,0.00042150743,0.00018009666,0.0002634116,0.00040464906,0.1288234,0.017494598],"genre_scores_gemma":[0.08162002,0.0013097842,0.8085953,0.0014337545,0.000366725,0.0013113979,0.0060006795,0.050495554,0.048866715],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965161,0.00045912794,0.00041065947,0.0007228392,0.0015007881,0.00039035958],"domain_scores_gemma":[0.9938261,0.0013058358,0.0005833785,0.0028331585,0.0010221764,0.00042933176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004770214,0.0015596612,0.00080286287,0.002354507,0.0013391095,0.0054453304,0.0065699047,0.0028503595,0.018087497],"category_scores_gemma":[0.013023739,0.002566099,0.002231388,0.0013413465,0.0023630024,0.012290195,0.009105562,0.0043637143,0.022624899],"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.0012541868,0.00038677422,0.0055735256,0.0013559008,0.00022542533,0.0009370793,0.0020823576,0.008928946,0.045142643,0.22167583,0.1649572,0.5474802],"study_design_scores_gemma":[0.00026410475,0.00030721974,0.0017506381,0.0004392782,0.00024798492,0.001098782,0.00021587283,0.08736791,0.054730013,0.09390433,0.75939107,0.000282904],"about_ca_topic_score_codex":0.0018860293,"about_ca_topic_score_gemma":0.0017587234,"teacher_disagreement_score":0.018087497,"about_ca_system_score_codex":0.0017778354,"about_ca_system_score_gemma":0.00255848,"threshold_uncertainty_score":0.060508728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014129453,0.0012764337,0.6630662,0.0004902358,0.0010202066,0.0007488789,0.0018535551,0.30093423,0.016480766],"genre_scores_gemma":[0.2759171,0.0014727861,0.5265656,0.0025323024,0.00045918883,0.002380209,0.009037283,0.12709099,0.05454443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972415,0.00043002362,0.00029228427,0.0006442728,0.0009879988,0.00040390008],"domain_scores_gemma":[0.9945103,0.0016598874,0.0002801291,0.0024660896,0.0005841527,0.0004994929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042450926,0.0015572922,0.0015581042,0.0012560639,0.0014307186,0.0039884727,0.0048500933,0.0024431928,0.022729354],"category_scores_gemma":[0.012680139,0.0017560057,0.0022790302,0.00066421373,0.002593698,0.007706702,0.008673742,0.003583049,0.010559538],"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.0064110267,0.001138192,0.015998779,0.0041058995,0.00063007517,0.0015046431,0.0023947102,0.030781591,0.07519874,0.28323182,0.25228223,0.32632232],"study_design_scores_gemma":[0.00074669294,0.00022737887,0.0020288152,0.0004687977,0.0002404338,0.00045572701,0.00020739147,0.15206832,0.087676875,0.0965725,0.65889496,0.00041209135],"about_ca_topic_score_codex":0.004245776,"about_ca_topic_score_gemma":0.007025724,"teacher_disagreement_score":0.022729354,"about_ca_system_score_codex":0.0021780895,"about_ca_system_score_gemma":0.0030984683,"threshold_uncertainty_score":0.07603729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10757337,0.00048736707,0.6911111,0.00047907804,0.0003952816,0.00025445936,0.0004021206,0.18488388,0.014413443],"genre_scores_gemma":[0.57115865,0.00027329804,0.38185152,0.00044556745,0.00014964674,0.00014902893,0.0011959308,0.028440956,0.016335407],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987041,0.00027266864,0.00010650469,0.00020070611,0.0004840088,0.0002320283],"domain_scores_gemma":[0.99539423,0.0010875991,0.00028158954,0.002433667,0.00053614425,0.00026680302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016739061,0.0009193969,0.00043634852,0.00092277786,0.0006098203,0.0011859795,0.0015066534,0.0008382342,0.0081213275],"category_scores_gemma":[0.006521489,0.0006155426,0.0005715763,0.00037030398,0.0007762697,0.0033066252,0.0028206392,0.0015412853,0.003966147],"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.0023039996,0.00092418917,0.013496749,0.00090173533,0.00012091451,0.0016706975,0.0014593792,0.035873063,0.20381047,0.025429219,0.05076214,0.66324735],"study_design_scores_gemma":[0.00017865219,0.0005890903,0.0074033393,0.000245677,0.00011128825,0.0013602987,0.00014782225,0.35996327,0.43330595,0.019194018,0.1772772,0.0002233851],"about_ca_topic_score_codex":0.0009896609,"about_ca_topic_score_gemma":0.0013852008,"teacher_disagreement_score":0.0081213275,"about_ca_system_score_codex":0.00054509164,"about_ca_system_score_gemma":0.00082645647,"threshold_uncertainty_score":0.027168572},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031704905,0.000067627414,0.9591816,0.00006425843,0.000047915888,0.000054407934,0.0004495312,0.03568431,0.0012798541],"genre_scores_gemma":[0.29077262,0.0002541566,0.6939892,0.00029631032,0.00006015215,0.0003048056,0.0019911395,0.0077564344,0.00457517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979461,0.0006981321,0.00023591223,0.00033137738,0.00062797475,0.00016044608],"domain_scores_gemma":[0.994586,0.003364687,0.00032534267,0.0011691708,0.0004556341,0.00009914578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025044933,0.0013133505,0.0010457763,0.0014867173,0.00051942567,0.0020507562,0.0024866208,0.0013184255,0.012915979],"category_scores_gemma":[0.011274055,0.001146356,0.0020037852,0.0008414961,0.0010163627,0.0034834356,0.0030319733,0.0021818713,0.0025543303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016013095,0.0003623779,0.006085608,0.0024127525,0.0007551174,0.0010416044,0.0006869477,0.21181817,0.034907535,0.28436795,0.04337954,0.4125811],"study_design_scores_gemma":[0.0002055552,0.00013335177,0.00051560835,0.0002118738,0.00016465239,0.00032959934,0.00006221064,0.81470937,0.03285289,0.12563768,0.025098821,0.00007834512],"about_ca_topic_score_codex":0.0021875727,"about_ca_topic_score_gemma":0.002660814,"teacher_disagreement_score":0.012915979,"about_ca_system_score_codex":0.0007858853,"about_ca_system_score_gemma":0.0017597652,"threshold_uncertainty_score":0.04320824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40673193,0.0037591285,0.41581857,0.0011101709,0.00024167306,0.0008122963,0.014358413,0.14495903,0.012208795],"genre_scores_gemma":[0.7474486,0.0008758135,0.22854722,0.00045207143,0.000056419132,0.0002747236,0.01522831,0.0015646183,0.005552145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928307,0.0010747282,0.0007963247,0.0015293992,0.0032686135,0.0005003337],"domain_scores_gemma":[0.98068917,0.008489138,0.0029652861,0.004757352,0.0027848927,0.00031422832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137472,0.0015303451,0.0010454545,0.008394945,0.00067821046,0.0019232185,0.0017637922,0.0018747575,0.002376172],"category_scores_gemma":[0.021756975,0.00073028234,0.0010645321,0.002847091,0.0010072442,0.005161496,0.0032779146,0.0013207387,0.0017654039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014707814,0.0007434454,0.22028422,0.0017748288,0.00073981995,0.0015019398,0.001419756,0.046977572,0.04121878,0.017298302,0.05275002,0.6138207],"study_design_scores_gemma":[0.00016121815,0.00041753743,0.051951412,0.00038757414,0.00019623231,0.002311244,0.00064474536,0.79144454,0.09273493,0.025009628,0.03446515,0.00027589922],"about_ca_topic_score_codex":0.006985037,"about_ca_topic_score_gemma":0.0093840845,"teacher_disagreement_score":0.008394945,"about_ca_system_score_codex":0.0009899428,"about_ca_system_score_gemma":0.0022326547,"threshold_uncertainty_score":0.021881282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17191319,0.0004801318,0.81279236,0.0029275396,0.00010717608,0.00012785528,0.00011906586,0.0012239432,0.010308773],"genre_scores_gemma":[0.85834163,0.00025190527,0.13849303,0.00048785683,0.000059018552,0.00012777718,0.000095337215,0.00038665356,0.0017567661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942386,0.0026094995,0.00027104927,0.0006441089,0.0016806633,0.00055609655],"domain_scores_gemma":[0.95883095,0.025972927,0.0041375,0.008282943,0.0024273184,0.00034840946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058154836,0.000803691,0.00079540466,0.0011461633,0.0012355538,0.0024605468,0.0014684602,0.0019136054,0.0019540575],"category_scores_gemma":[0.044358827,0.00085565966,0.0012986895,0.0005938352,0.0032809412,0.0069717243,0.0030845893,0.0041756043,0.0003106816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002975921,0.000118216136,0.016213048,0.000238851,0.00013109903,0.0010649646,0.0031571994,0.34196874,0.0057650255,0.5868427,0.002658432,0.041544106],"study_design_scores_gemma":[0.000024127678,0.00012314312,0.0011956086,0.00011641193,0.000058908332,0.00039206867,0.00042538322,0.8043904,0.0069644614,0.17723446,0.009026942,0.000048193706],"about_ca_topic_score_codex":0.0025226478,"about_ca_topic_score_gemma":0.002207017,"teacher_disagreement_score":0.0058154836,"about_ca_system_score_codex":0.0017043338,"about_ca_system_score_gemma":0.0015567087,"threshold_uncertainty_score":0.03075564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1142383,0.0035724072,0.78049093,0.0011471,0.0008224077,0.00053145725,0.0011212019,0.081118435,0.016957752],"genre_scores_gemma":[0.89619774,0.0005581558,0.08799654,0.0009275176,0.0003000582,0.00023096436,0.0009371872,0.0022219433,0.01062989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616265,0.00064526923,0.00034435187,0.0006226497,0.0016512402,0.00057382346],"domain_scores_gemma":[0.9856009,0.0021089548,0.0014875635,0.008958417,0.0013904811,0.0004536224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022566498,0.0010906403,0.00077955174,0.0013111114,0.0009739158,0.0026457075,0.00297075,0.0014406947,0.0078068157],"category_scores_gemma":[0.009665765,0.0009244952,0.00072973344,0.0007305243,0.0022226982,0.0068100374,0.004347723,0.0027045347,0.0036528995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044844346,0.0003982163,0.016375247,0.0014590422,0.0005163303,0.0014971006,0.0018071989,0.05419963,0.19713289,0.15704471,0.09035329,0.47473204],"study_design_scores_gemma":[0.0003031315,0.0020108751,0.0027392039,0.0003289291,0.00036956617,0.0020880897,0.0002945663,0.2630229,0.52147496,0.08148237,0.12561776,0.00026769738],"about_ca_topic_score_codex":0.0009049153,"about_ca_topic_score_gemma":0.0007928341,"teacher_disagreement_score":0.0078068157,"about_ca_system_score_codex":0.0010108347,"about_ca_system_score_gemma":0.0021117185,"threshold_uncertainty_score":0.026116371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37399706,0.0013738587,0.5295314,0.0010796677,0.00036200671,0.00027127817,0.0002144657,0.076307714,0.016862553],"genre_scores_gemma":[0.9346609,0.00024492652,0.059737075,0.00035616098,0.00004363467,0.00008259734,0.00014236673,0.0020631836,0.0026690722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594516,0.00074161217,0.00022438401,0.00044966638,0.0017442735,0.0008948122],"domain_scores_gemma":[0.98474044,0.0042691557,0.0011353857,0.007974678,0.001420965,0.00045926165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036360906,0.0010551312,0.0006557813,0.0011680229,0.0010194902,0.002060088,0.002383823,0.00094912614,0.0033294256],"category_scores_gemma":[0.014487586,0.00090800074,0.00078553305,0.0004482938,0.002528736,0.0063385135,0.004428054,0.002821142,0.0011100306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034932543,0.0012622322,0.053237714,0.0011904042,0.00040269026,0.0016799849,0.002340693,0.05561656,0.24642323,0.10840481,0.02647958,0.49946883],"study_design_scores_gemma":[0.0002413949,0.0010218512,0.008980048,0.00038849877,0.00039323387,0.0017084511,0.00046286974,0.38601708,0.48393172,0.050350707,0.066187575,0.00031662596],"about_ca_topic_score_codex":0.0018001117,"about_ca_topic_score_gemma":0.0019800833,"teacher_disagreement_score":0.0036360906,"about_ca_system_score_codex":0.0009870628,"about_ca_system_score_gemma":0.002408779,"threshold_uncertainty_score":0.01922971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027591005,0.0037007723,0.8302261,0.04389679,0.0066025984,0.00020712572,0.00035082895,0.01930416,0.06812061],"genre_scores_gemma":[0.4901578,0.003147912,0.40799698,0.021611057,0.0026632722,0.00048015837,0.00057617074,0.012041054,0.06132558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990231,0.0028352982,0.0005143409,0.0013744682,0.003877707,0.0011673425],"domain_scores_gemma":[0.97722274,0.004371093,0.0011690811,0.013736239,0.0021848537,0.0013159985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009527843,0.0010457116,0.0012725053,0.0010663839,0.0027639265,0.0075427713,0.0033956005,0.0037111703,0.010144494],"category_scores_gemma":[0.027493536,0.0013050366,0.0016930641,0.0006452725,0.009236311,0.02748286,0.013129969,0.010919025,0.0042357347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046190075,0.00015548136,0.0027632182,0.00044306167,0.00009929013,0.00039716242,0.002902692,0.0047130394,0.007573139,0.81653917,0.05506782,0.108884096],"study_design_scores_gemma":[0.00009931513,0.00016211999,0.00047782913,0.0005263216,0.000102386264,0.0006850261,0.0008629821,0.017284045,0.010471383,0.4783956,0.49078977,0.00014324843],"about_ca_topic_score_codex":0.0016948608,"about_ca_topic_score_gemma":0.00230719,"teacher_disagreement_score":0.010144494,"about_ca_system_score_codex":0.0014577834,"about_ca_system_score_gemma":0.0039889007,"threshold_uncertainty_score":0.050388694},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028986968,0.0015058294,0.8801937,0.00038295318,0.00034759464,0.00023798474,0.0010441403,0.080860294,0.006440484],"genre_scores_gemma":[0.52602446,0.0007381384,0.45645094,0.00069469423,0.000276973,0.000506601,0.0027048457,0.0052253697,0.007378062],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970394,0.00038062173,0.0002669279,0.00041015944,0.001494146,0.00040866324],"domain_scores_gemma":[0.99264467,0.002323792,0.0004777306,0.003294449,0.0011114859,0.0001478187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016963297,0.0018924861,0.0009906405,0.0026138767,0.0010937601,0.0020128675,0.0036291678,0.001458177,0.010853617],"category_scores_gemma":[0.01099284,0.00097159046,0.00088411383,0.002311038,0.0014757519,0.005056881,0.004200815,0.0020743941,0.003796989],"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.0021605224,0.00031449943,0.0078702355,0.0008503908,0.00020646886,0.0008225494,0.00064029027,0.041216742,0.073539056,0.078596644,0.07218244,0.7216001],"study_design_scores_gemma":[0.0002541057,0.0003237505,0.0016569378,0.00032486636,0.00013720569,0.0008579544,0.00016092038,0.6450776,0.22015332,0.08379466,0.047066253,0.0001924753],"about_ca_topic_score_codex":0.003073154,"about_ca_topic_score_gemma":0.0052595325,"teacher_disagreement_score":0.010853617,"about_ca_system_score_codex":0.0011466406,"about_ca_system_score_gemma":0.0026453552,"threshold_uncertainty_score":0.036308944},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021539118,0.76074195,0.09561548,0.0033438518,0.0013056966,0.00046932732,0.0006321621,0.0010866763,0.115265734],"genre_scores_gemma":[0.10050802,0.83884495,0.035668496,0.0013607086,0.0008763069,0.00024934014,0.0018637306,0.00028601714,0.020342425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964217,0.00080517906,0.00037415675,0.00044302762,0.0016498292,0.00030615408],"domain_scores_gemma":[0.99544215,0.0025925008,0.0004891536,0.0004270416,0.0008981468,0.00015100896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029624472,0.0009230021,0.00082085025,0.005115345,0.00074711925,0.0029393057,0.0013625388,0.00161918,0.0063046063],"category_scores_gemma":[0.0057228943,0.00077313033,0.00067815976,0.011626427,0.001211749,0.007434148,0.0011704414,0.0017879274,0.0027786738],"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.00016863775,0.00015942231,0.0025597955,0.009087916,0.00005211674,0.00022510554,0.00055542827,0.004719041,0.0031765369,0.099729106,0.023883753,0.8556831],"study_design_scores_gemma":[0.000015951447,0.00029946712,0.0022980012,0.003272822,0.000068425354,0.0012442132,0.00049343205,0.0037145452,0.003827707,0.013182878,0.97151214,0.00007046464],"about_ca_topic_score_codex":0.001630478,"about_ca_topic_score_gemma":0.0012251944,"teacher_disagreement_score":0.0063046063,"about_ca_system_score_codex":0.0017392781,"about_ca_system_score_gemma":0.0023029603,"threshold_uncertainty_score":0.021090984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04895311,0.0003761246,0.9265435,0.00017153284,0.00018698884,0.00017102777,0.00063435175,0.010632054,0.012331345],"genre_scores_gemma":[0.33267507,0.0003824115,0.65440565,0.00018271107,0.000024527431,0.00023415692,0.0011578887,0.003402007,0.0075355964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993948,0.000097870274,0.00006026451,0.000112104535,0.00024874063,0.00008622898],"domain_scores_gemma":[0.9989085,0.00046780336,0.00007958889,0.0002759919,0.00022891442,0.000039301114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007267953,0.00074791646,0.00040250536,0.0007347857,0.00036381718,0.0011862783,0.0009901493,0.00062973244,0.003934073],"category_scores_gemma":[0.0028314444,0.00062626106,0.00083068793,0.0003508543,0.0005461487,0.0013629709,0.0009809849,0.0009347318,0.0012613948],"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.00045477026,0.00023547438,0.00745431,0.0014359524,0.00012222747,0.0012433522,0.00088184024,0.30462936,0.20737712,0.1608426,0.018478688,0.2968444],"study_design_scores_gemma":[0.0001448436,0.00028407588,0.0004638515,0.00012796198,0.000104124556,0.00040146982,0.0001177697,0.6234675,0.23505175,0.036642604,0.10312211,0.00007196859],"about_ca_topic_score_codex":0.0011270194,"about_ca_topic_score_gemma":0.0020474535,"teacher_disagreement_score":0.003934073,"about_ca_system_score_codex":0.00068045774,"about_ca_system_score_gemma":0.0014594732,"threshold_uncertainty_score":0.013160825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045677174,0.00042800506,0.9427974,0.00028601915,0.000076501354,0.00009441099,0.0001982692,0.007568176,0.0028740643],"genre_scores_gemma":[0.63697726,0.00044219528,0.35812896,0.00040012025,0.00007346056,0.00023785564,0.0003989773,0.0012086624,0.0021325524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936845,0.0016262095,0.00044078013,0.00077679206,0.002854062,0.00061758835],"domain_scores_gemma":[0.98946077,0.004832441,0.0011941183,0.0032737167,0.0010597069,0.00017920797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966647,0.0016607748,0.0011002393,0.0032726384,0.0009294642,0.0024905317,0.00195545,0.001022795,0.0019000337],"category_scores_gemma":[0.010319246,0.00097160565,0.0023991778,0.0015853799,0.0039917873,0.0055395127,0.0041208733,0.0027721557,0.00048084374],"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.00061059487,0.00028831832,0.013684464,0.0011191315,0.00045261008,0.00056212646,0.0011833137,0.4140231,0.08880519,0.25071737,0.0056244764,0.22292931],"study_design_scores_gemma":[0.000043558033,0.00022057166,0.00089066115,0.00014048065,0.00022289749,0.00026043135,0.00011452583,0.75602746,0.081809536,0.15181582,0.00835733,0.00009665385],"about_ca_topic_score_codex":0.001943999,"about_ca_topic_score_gemma":0.0030947293,"teacher_disagreement_score":0.0032726384,"about_ca_system_score_codex":0.002293923,"about_ca_system_score_gemma":0.0028997753,"threshold_uncertainty_score":0.016643703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06858705,0.00051963027,0.8779005,0.0003436563,0.00008873436,0.00040472415,0.0007499192,0.047999945,0.0034058678],"genre_scores_gemma":[0.45894527,0.00033823663,0.53104955,0.00028192205,0.0000409041,0.00042320887,0.0023253693,0.0025577927,0.0040377695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816054,0.0003001361,0.00011349905,0.00040273575,0.0007223434,0.00030068363],"domain_scores_gemma":[0.9979038,0.0008050128,0.00021151725,0.0006109617,0.00035396087,0.00011476537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009053236,0.0015838539,0.0010222611,0.00213737,0.0010047953,0.0015610802,0.0016575137,0.00079621194,0.0040247254],"category_scores_gemma":[0.0038056634,0.0009806416,0.0027844037,0.001138936,0.0014940753,0.0031877626,0.0020281833,0.0016096868,0.001122554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007422568,0.00073482,0.020510664,0.0011457291,0.00030957806,0.0007787725,0.00073607394,0.37159747,0.056035917,0.054117795,0.01477666,0.4785144],"study_design_scores_gemma":[0.00006783337,0.00014116778,0.0009823642,0.00003565756,0.00012819037,0.00011514232,0.000085875115,0.9506707,0.017094968,0.023175936,0.0074529024,0.000049389044],"about_ca_topic_score_codex":0.015413419,"about_ca_topic_score_gemma":0.020120263,"teacher_disagreement_score":0.015413419,"about_ca_system_score_codex":0.0015388818,"about_ca_system_score_gemma":0.0055802427,"threshold_uncertainty_score":0.030647457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05265952,0.005785728,0.49841297,0.0020651894,0.0033643832,0.0009426755,0.0052190796,0.28809598,0.1434545],"genre_scores_gemma":[0.4795433,0.0027660439,0.33296186,0.0022456895,0.0008319903,0.00089829287,0.017065268,0.031857166,0.13183035],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984112,0.00022153145,0.000096105556,0.00033602733,0.00065361505,0.00028151338],"domain_scores_gemma":[0.9968631,0.00045661782,0.0001939032,0.0014909094,0.00062785466,0.00036761008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013674735,0.001054481,0.00080482714,0.0011401523,0.0012332528,0.0024140233,0.0029097523,0.0011017895,0.042395603],"category_scores_gemma":[0.005997239,0.0006946612,0.00079521403,0.0007882505,0.001207579,0.0034253027,0.0038937666,0.0021354314,0.020903965],"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.0028481148,0.00038074728,0.0069124694,0.0012401781,0.00016710206,0.0007933707,0.0009989488,0.018145714,0.040882044,0.09005748,0.3614146,0.4761592],"study_design_scores_gemma":[0.0002803296,0.0005264257,0.002756028,0.00024347076,0.000098593395,0.0011132632,0.00022549988,0.110494316,0.068335235,0.02689952,0.7888744,0.00015279037],"about_ca_topic_score_codex":0.002376815,"about_ca_topic_score_gemma":0.0026216253,"teacher_disagreement_score":0.042395603,"about_ca_system_score_codex":0.001239741,"about_ca_system_score_gemma":0.002078637,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028288132,0.0006729956,0.93872815,0.0048039313,0.00025765892,0.00052106933,0.00006554321,0.0025123328,0.024150124],"genre_scores_gemma":[0.39367178,0.0010691972,0.5894573,0.0013901091,0.00024244889,0.000532851,0.00021013233,0.0007028989,0.01272336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964522,0.0012637984,0.0002643037,0.000529332,0.0011119009,0.00037835175],"domain_scores_gemma":[0.9945188,0.0014200672,0.0005651541,0.0019773904,0.001021942,0.00049665786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054850304,0.0010867086,0.00065030035,0.0014152816,0.0020682663,0.0070087584,0.0023711708,0.0026930138,0.0046821134],"category_scores_gemma":[0.009075023,0.000872839,0.00093817775,0.00078576553,0.004728724,0.012792789,0.006103353,0.0033844796,0.0019194182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020084174,0.00020179036,0.0039936174,0.00082658406,0.00025448517,0.0004048125,0.0038678441,0.0693356,0.022536082,0.72041905,0.010162263,0.16779697],"study_design_scores_gemma":[0.00012781899,0.0005373549,0.0013886692,0.00043645315,0.0003073552,0.00053081027,0.002391995,0.24444228,0.021328906,0.49015817,0.23819844,0.0001517788],"about_ca_topic_score_codex":0.0022279806,"about_ca_topic_score_gemma":0.0020836191,"teacher_disagreement_score":0.0070087584,"about_ca_system_score_codex":0.0014511289,"about_ca_system_score_gemma":0.0033037646,"threshold_uncertainty_score":0.029007971},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043669786,0.10372764,0.23194982,0.33077794,0.008623816,0.00018571607,0.00041866934,0.001099885,0.27954677],"genre_scores_gemma":[0.60643774,0.12045278,0.1136914,0.033152584,0.0066410983,0.00023301155,0.00052524084,0.00051424146,0.118351825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952781,0.001298614,0.00025318546,0.000710734,0.002126737,0.0003325918],"domain_scores_gemma":[0.99345857,0.0021691162,0.0009357319,0.0015883802,0.0015440529,0.0003042143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034447075,0.00046714875,0.00040593563,0.0010082148,0.002029987,0.006105867,0.0010199317,0.0028832445,0.0065169116],"category_scores_gemma":[0.0070088943,0.00034740512,0.00041734663,0.001003423,0.0047197063,0.010102081,0.0022944566,0.004129577,0.0029452161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053208456,0.000059427144,0.002178494,0.0009891969,0.0000607059,0.00022889224,0.0008080335,0.004208297,0.004626682,0.78214747,0.031804863,0.17283483],"study_design_scores_gemma":[0.0000145784525,0.00008152491,0.0014051143,0.0012673405,0.000038328682,0.0010033834,0.0017339655,0.006378599,0.0043095616,0.38946792,0.5942411,0.000058607347],"about_ca_topic_score_codex":0.0015467993,"about_ca_topic_score_gemma":0.0013155575,"teacher_disagreement_score":0.0065169116,"about_ca_system_score_codex":0.0022315027,"about_ca_system_score_gemma":0.0030309441,"threshold_uncertainty_score":0.021801233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4128812,0.007856739,0.28558,0.0007942266,0.00096418825,0.00076034013,0.0020015803,0.27186823,0.017293368],"genre_scores_gemma":[0.918083,0.00050406606,0.073912196,0.0004979209,0.000074357195,0.00014837545,0.0016694294,0.0020928255,0.0030179655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.00022527686,0.0001446933,0.00029617478,0.00059801346,0.00046746965],"domain_scores_gemma":[0.99787104,0.000346385,0.00032956398,0.0008694662,0.0003077724,0.00027590198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161995,0.0015472878,0.00064441084,0.00079753855,0.00076667115,0.0017998369,0.003091393,0.0005570146,0.0033738648],"category_scores_gemma":[0.003688133,0.00056037336,0.0005195452,0.0005870216,0.0010040083,0.0031183686,0.0032690242,0.0011892386,0.0016314952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009451689,0.001303901,0.04094002,0.0014923053,0.00049380644,0.0011184639,0.0012520647,0.04952547,0.19253118,0.01811021,0.09883414,0.5849467],"study_design_scores_gemma":[0.0007755073,0.0017945225,0.011408703,0.00018643317,0.00032873676,0.00082457555,0.0003504013,0.6121319,0.30538693,0.009404478,0.05705319,0.00035455878],"about_ca_topic_score_codex":0.0048550162,"about_ca_topic_score_gemma":0.0046799323,"teacher_disagreement_score":0.0048550162,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023602713,"threshold_uncertainty_score":0.011286676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070090126,0.00039975933,0.89933044,0.00044180546,0.0005399173,0.00020836799,0.0020991834,0.07534497,0.014626605],"genre_scores_gemma":[0.08178741,0.00033908873,0.8682598,0.0008869061,0.00016257666,0.000495581,0.0045976685,0.029656753,0.013814175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941613,0.0006921601,0.00068447075,0.0008286474,0.0030383188,0.00059518404],"domain_scores_gemma":[0.99349326,0.0015189032,0.00056773424,0.0031990607,0.0010559915,0.00016500057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027203655,0.0016389545,0.0012141186,0.0019773091,0.0014288655,0.0042731212,0.0043950942,0.0017984392,0.028966725],"category_scores_gemma":[0.009879911,0.0026612214,0.0030377498,0.0022681172,0.0025612365,0.0075329784,0.005039008,0.00383486,0.015183073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013720745,0.00040356925,0.0047104536,0.0016476241,0.00018377884,0.0010975298,0.000830636,0.03859393,0.027588565,0.41228497,0.13100831,0.38027853],"study_design_scores_gemma":[0.0002358588,0.00025064405,0.001006568,0.0005053817,0.0001606134,0.0011068193,0.00018995385,0.12492956,0.107949905,0.23727727,0.5260667,0.00032072756],"about_ca_topic_score_codex":0.0030736453,"about_ca_topic_score_gemma":0.004327027,"teacher_disagreement_score":0.028966725,"about_ca_system_score_codex":0.0017873163,"about_ca_system_score_gemma":0.0043713963,"threshold_uncertainty_score":0.096903324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052695755,0.0012497053,0.89175016,0.00097030256,0.0003989893,0.00015753457,0.00040343654,0.032711543,0.019662546],"genre_scores_gemma":[0.71241593,0.00037868097,0.26908192,0.00083647616,0.00023219446,0.00023783435,0.0006157016,0.0012022832,0.0149989305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809474,0.0003336307,0.00013594334,0.00031000382,0.00076210586,0.00036350513],"domain_scores_gemma":[0.99664044,0.00075569283,0.0003134843,0.0017855949,0.00035894022,0.00014578193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001458302,0.0009015284,0.0007613113,0.0007526923,0.00092076923,0.0023900534,0.002327428,0.0008541674,0.010825861],"category_scores_gemma":[0.0047975453,0.0007157322,0.0007297874,0.0009395754,0.0017551156,0.004589346,0.0041502225,0.0030238503,0.0034143897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034855728,0.0004633684,0.0035387343,0.000774994,0.00016169206,0.00039901453,0.0005778798,0.09865521,0.088890895,0.37220874,0.038780738,0.39206326],"study_design_scores_gemma":[0.00038845264,0.000585292,0.0005462133,0.000121559075,0.000086306376,0.00031091415,0.00006960793,0.6385124,0.143518,0.16567443,0.050062932,0.00012393131],"about_ca_topic_score_codex":0.0011641075,"about_ca_topic_score_gemma":0.0013889564,"teacher_disagreement_score":0.010825861,"about_ca_system_score_codex":0.0018643119,"about_ca_system_score_gemma":0.002465613,"threshold_uncertainty_score":0.03621614},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67466915,0.0008284148,0.11794934,0.0025434077,0.0021704717,0.0062450115,0.0060188277,0.013323897,0.17625153],"genre_scores_gemma":[0.3655534,0.001130197,0.2823706,0.0008755623,0.00046179455,0.0055968426,0.016215911,0.002400691,0.325395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936014,0.00010573782,0.000048237205,0.000116505216,0.00018244941,0.00018702846],"domain_scores_gemma":[0.99696976,0.00030551612,0.00018884639,0.00016013357,0.00077746133,0.0015983018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010257981,0.0012897784,0.00042880277,0.0011404456,0.0006773789,0.0012402247,0.0012498343,0.00079968304,0.053166155],"category_scores_gemma":[0.002481455,0.0003964807,0.00085949793,0.00064324774,0.00026945167,0.0012729021,0.0028134997,0.0012030728,0.020864734],"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.0009594829,0.010252508,0.012876389,0.0011170158,0.00003281771,0.0008204787,0.0027807627,0.0055217384,0.051330492,0.010103199,0.22572522,0.67847985],"study_design_scores_gemma":[0.00020603203,0.005821596,0.06952142,0.0005524625,0.00005581301,0.0013676726,0.0011914925,0.0137895625,0.058696143,0.008870247,0.8397902,0.00013740486],"about_ca_topic_score_codex":0.00030045476,"about_ca_topic_score_gemma":0.00063592085,"teacher_disagreement_score":0.053166155,"about_ca_system_score_codex":0.000713612,"about_ca_system_score_gemma":0.0012610946,"threshold_uncertainty_score":0.17785847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47114897,0.0041374555,0.5048186,0.0015463887,0.00030999,0.00043635623,0.00007366503,0.0015864489,0.015942154],"genre_scores_gemma":[0.96757096,0.00073813007,0.029416079,0.0001199207,0.000050269246,0.000033183383,0.000036970687,0.0000272932,0.0020071643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851924,0.00042621337,0.000087998145,0.00014446076,0.00048406323,0.0003379675],"domain_scores_gemma":[0.99584854,0.001529755,0.0007301029,0.00082853285,0.0008881043,0.00017501233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010253409,0.0007008614,0.0005643075,0.0008007075,0.00090368435,0.0013149356,0.0006742262,0.0007288835,0.0016272732],"category_scores_gemma":[0.0055018016,0.00025100366,0.0003938111,0.00043492706,0.00081199245,0.002543729,0.0014155275,0.000966542,0.0005241358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018736029,0.0008640463,0.019632932,0.00090643857,0.00045505754,0.0010027591,0.0010379037,0.26648095,0.24432838,0.055971492,0.007478648,0.39996773],"study_design_scores_gemma":[0.000053548334,0.0017584641,0.0031795914,0.0001352602,0.00021948053,0.0013487166,0.0004913667,0.84725744,0.12742771,0.009795493,0.008264799,0.00006803191],"about_ca_topic_score_codex":0.0010468669,"about_ca_topic_score_gemma":0.0013721198,"teacher_disagreement_score":0.0016272732,"about_ca_system_score_codex":0.00046744742,"about_ca_system_score_gemma":0.0011223429,"threshold_uncertainty_score":0.005443752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027432633,0.0002807263,0.0005098225,0.00024214803,0.000058611447,0.00009126582,0.9912389,0.0022954936,0.002539647],"genre_scores_gemma":[0.0018805924,0.00005610055,0.0005681018,0.000056548535,0.000005717777,0.00010343861,0.9968317,0.00009754501,0.00040027773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985258,0.00023270524,0.00016228239,0.00037034205,0.0005311767,0.00017785338],"domain_scores_gemma":[0.9976981,0.000652609,0.00017447135,0.0006007393,0.00062276603,0.00025125407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104789,0.002119467,0.0008107847,0.0035866296,0.0008692507,0.0013654155,0.0023448095,0.002248814,0.014299424],"category_scores_gemma":[0.0060573984,0.00045059746,0.0010062362,0.004687999,0.0004784514,0.0012095055,0.0017202457,0.0017434533,0.02466355],"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.00013198041,0.000085588086,0.0016961334,0.00071850733,0.00003996853,0.00017281306,0.000044628112,0.0015948848,0.00046241708,0.0008625796,0.98832,0.0058706063],"study_design_scores_gemma":[0.00029943866,0.00007460658,0.010428108,0.0003501754,0.000049525814,0.00049565337,0.00017718073,0.007868341,0.0018509614,0.0025540746,0.97578555,0.00006647377],"about_ca_topic_score_codex":0.018100552,"about_ca_topic_score_gemma":0.03136386,"teacher_disagreement_score":0.018100552,"about_ca_system_score_codex":0.0016109624,"about_ca_system_score_gemma":0.0018689728,"threshold_uncertainty_score":0.047836363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017777127,0.00008718538,0.98956,0.0004454888,0.00007730218,0.0005846775,0.000065814995,0.0055230255,0.0018788318],"genre_scores_gemma":[0.036589958,0.00016503462,0.95886827,0.00036415618,0.000027908964,0.000522293,0.00020984148,0.0013211505,0.0019313243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98412967,0.0046321694,0.0013891984,0.0020241044,0.006341042,0.0014838846],"domain_scores_gemma":[0.98561674,0.0046182014,0.0011138954,0.0044369125,0.0035251544,0.0006890181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02531578,0.0012306115,0.0010423661,0.0020759196,0.0017402828,0.004950151,0.0042956355,0.0027652872,0.0050327717],"category_scores_gemma":[0.03014818,0.0024713192,0.0028359864,0.00087253173,0.0048344703,0.0068285326,0.005649867,0.008324564,0.0026983183],"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.0002688557,0.00067120825,0.0034523914,0.0013771052,0.00017801233,0.00093050295,0.0026950133,0.030050121,0.02721956,0.7225184,0.016193407,0.19444545],"study_design_scores_gemma":[0.00035966776,0.000631353,0.0009560692,0.0013268872,0.00023149369,0.0014711528,0.0006270097,0.34717384,0.093207695,0.1998181,0.3538903,0.00030637442],"about_ca_topic_score_codex":0.0040791607,"about_ca_topic_score_gemma":0.0027042287,"teacher_disagreement_score":0.02531578,"about_ca_system_score_codex":0.0031275218,"about_ca_system_score_gemma":0.013569137,"threshold_uncertainty_score":0.13388425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07077031,0.0014870408,0.7172724,0.0036573382,0.0012161934,0.000979092,0.001452554,0.11944873,0.083716296],"genre_scores_gemma":[0.59788406,0.00053101615,0.34279388,0.00242623,0.00030397298,0.0007962258,0.0015194243,0.015888942,0.037856247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649304,0.00043514188,0.0002480454,0.00064541766,0.0014244327,0.0007539162],"domain_scores_gemma":[0.989783,0.0020436137,0.0006171064,0.0055253766,0.0016281661,0.00040274925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030018317,0.001209293,0.0010266227,0.0013832729,0.0027137117,0.0037042685,0.0064606704,0.0022010491,0.02124072],"category_scores_gemma":[0.01558108,0.0012193013,0.0012611108,0.0008673878,0.003538061,0.010199552,0.0096872505,0.0047066365,0.005746423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002840372,0.0003245219,0.005564802,0.0009707968,0.00009383517,0.0009513238,0.0032224883,0.017160803,0.042044383,0.5596277,0.07960538,0.2875936],"study_design_scores_gemma":[0.00048240507,0.00056867645,0.0014655676,0.0006604924,0.00022829846,0.0009409408,0.0007596028,0.16603658,0.15637922,0.22516188,0.44687876,0.0004374795],"about_ca_topic_score_codex":0.008124163,"about_ca_topic_score_gemma":0.009663346,"teacher_disagreement_score":0.02124072,"about_ca_system_score_codex":0.0027260662,"about_ca_system_score_gemma":0.006223825,"threshold_uncertainty_score":0.07105726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098271064,0.0010021057,0.87291396,0.0008636788,0.0003420765,0.00030854237,0.00015074816,0.01073347,0.015414217],"genre_scores_gemma":[0.76733726,0.00059059454,0.19994484,0.0006612176,0.00018103112,0.00022947571,0.00025012737,0.0017563767,0.029049141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717534,0.0006504681,0.00021278708,0.0004170902,0.001056176,0.00048812732],"domain_scores_gemma":[0.9915978,0.0025678284,0.0008820579,0.0039638267,0.0008460422,0.00014246114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00188852,0.0009004772,0.0007017944,0.00094575336,0.0006069726,0.0020597577,0.0015004664,0.0014261664,0.008959848],"category_scores_gemma":[0.0075691133,0.000976736,0.0006270031,0.00051669613,0.0014905552,0.0038814077,0.002655141,0.0030320033,0.0030947602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009581443,0.00028372987,0.0015471963,0.001017688,0.0001654412,0.0005283869,0.0011903631,0.08342014,0.25482243,0.16667251,0.0120098265,0.47738406],"study_design_scores_gemma":[0.0002099448,0.0009658294,0.0008599433,0.00027392778,0.0002968825,0.000708178,0.00023903754,0.28381032,0.4861413,0.1546407,0.07174665,0.00010728046],"about_ca_topic_score_codex":0.00030647236,"about_ca_topic_score_gemma":0.0005074934,"teacher_disagreement_score":0.008959848,"about_ca_system_score_codex":0.00067564455,"about_ca_system_score_gemma":0.00092706113,"threshold_uncertainty_score":0.029973745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16598123,0.0016903847,0.7609348,0.0014423288,0.00045812616,0.0010664285,0.00031780842,0.04834902,0.019759797],"genre_scores_gemma":[0.7783434,0.00045576203,0.20682271,0.00077758945,0.000103356404,0.00024689714,0.0008119004,0.00093707436,0.011501336],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953166,0.0010471756,0.0003858992,0.00034597915,0.0021533172,0.0007511309],"domain_scores_gemma":[0.994848,0.00051731203,0.00057903666,0.002585438,0.0010048316,0.0004653946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003313369,0.00093610305,0.00071736536,0.0019335146,0.0006877112,0.0025482664,0.002811939,0.0015698285,0.00361058],"category_scores_gemma":[0.0056683407,0.00056151807,0.000877572,0.0008674712,0.00156902,0.006166206,0.007776576,0.002068656,0.002748324],"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.0032635678,0.0014392347,0.012075236,0.0016711442,0.0004042507,0.0018054768,0.0021468152,0.05298718,0.19413827,0.09298797,0.040469028,0.5966118],"study_design_scores_gemma":[0.0005213126,0.0033725125,0.005393954,0.00035528178,0.00024705747,0.0018884923,0.00089875876,0.4453004,0.2856008,0.02762718,0.22842045,0.00037382983],"about_ca_topic_score_codex":0.001090203,"about_ca_topic_score_gemma":0.0010274417,"teacher_disagreement_score":0.00361058,"about_ca_system_score_codex":0.0014365976,"about_ca_system_score_gemma":0.0023032213,"threshold_uncertainty_score":0.017522931},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064774356,0.000071506176,0.96149814,0.00009050139,0.000046307505,0.00014304872,0.0003145855,0.029999664,0.001358789],"genre_scores_gemma":[0.2364573,0.00016957741,0.75460964,0.0002541205,0.000062113104,0.00046485025,0.0014633768,0.0035034418,0.003015614],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953133,0.0016333177,0.00037591302,0.000672504,0.0016981484,0.00030690915],"domain_scores_gemma":[0.9821354,0.01070769,0.001547349,0.0036502078,0.0018136783,0.0001456566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037640387,0.001371541,0.0007246603,0.0023881632,0.00057480537,0.001418337,0.0016290064,0.00092514645,0.0075088255],"category_scores_gemma":[0.015767014,0.0007830298,0.0013741971,0.0007825822,0.0011557279,0.002456745,0.0012588071,0.001516387,0.0022772537],"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.0009307813,0.00056271366,0.00658133,0.00107991,0.00025150226,0.0014581886,0.0007844474,0.13086168,0.08080565,0.08497973,0.024064697,0.6676394],"study_design_scores_gemma":[0.00022005367,0.0003112083,0.0006930899,0.00019674194,0.000093598646,0.00072427274,0.00005078945,0.811474,0.13491459,0.031552617,0.019671606,0.00009738726],"about_ca_topic_score_codex":0.0022120366,"about_ca_topic_score_gemma":0.0024030644,"teacher_disagreement_score":0.0075088255,"about_ca_system_score_codex":0.0009589347,"about_ca_system_score_gemma":0.0031346376,"threshold_uncertainty_score":0.025119483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006572242,0.9945815,0.0008869867,0.00031228762,0.00014018756,0.000020922766,0.000043065556,0.000039056977,0.0033188504],"genre_scores_gemma":[0.0029297657,0.9943058,0.0011312551,0.00023510368,0.00013240342,0.000022427126,0.000118861135,0.000014480346,0.0011099296],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853873,0.00027856018,0.0001679892,0.00022283052,0.00067342405,0.000118507705],"domain_scores_gemma":[0.99509346,0.002777589,0.0005011148,0.00020453653,0.0012878292,0.00013561858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022053006,0.0010497906,0.001163332,0.005788964,0.00041659933,0.001196183,0.0014131482,0.0010142782,0.006880919],"category_scores_gemma":[0.0059169726,0.00083103235,0.000940256,0.006578466,0.00051873,0.0028896334,0.00088325917,0.0013282683,0.0033416091],"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.0000588484,0.00007593647,0.0006304412,0.021173006,0.000070710536,0.00006638936,0.00009330873,0.00061994005,0.0011402748,0.0047719153,0.017531376,0.95376766],"study_design_scores_gemma":[0.000026191108,0.00037604885,0.0032924232,0.014275349,0.0002629193,0.00079162326,0.00018614276,0.0004874911,0.002399641,0.002234867,0.9756232,0.000044265944],"about_ca_topic_score_codex":0.002316759,"about_ca_topic_score_gemma":0.0032029888,"teacher_disagreement_score":0.006880919,"about_ca_system_score_codex":0.0010096062,"about_ca_system_score_gemma":0.0028528122,"threshold_uncertainty_score":0.023018956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50407284,0.0059421537,0.25530827,0.0006505331,0.00071245583,0.00060347473,0.0014150296,0.21672511,0.014570092],"genre_scores_gemma":[0.936145,0.0003597828,0.057702575,0.00037079962,0.000049690785,0.00010564458,0.0010831399,0.0015418471,0.002641615],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985127,0.00019166493,0.00012210043,0.00024417348,0.00052482274,0.00040455032],"domain_scores_gemma":[0.9981517,0.00031416217,0.00029159067,0.000762233,0.00025355397,0.00022666955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000908904,0.0013279099,0.00053660054,0.00066998583,0.00061019964,0.0014843894,0.0025935697,0.0004903645,0.0028560506],"category_scores_gemma":[0.003102048,0.00048384213,0.00045194433,0.0004865795,0.0009516879,0.0027114553,0.0027233167,0.0010649434,0.0012547569],"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.009438034,0.0012612289,0.03864098,0.0012885336,0.00042842014,0.0010525178,0.0011398934,0.049637478,0.2507948,0.015619796,0.07310861,0.55758965],"study_design_scores_gemma":[0.0007395463,0.0018938134,0.0112163145,0.0001495165,0.00027857439,0.0007647208,0.00028811104,0.5507057,0.38119754,0.007290496,0.045180682,0.0002950669],"about_ca_topic_score_codex":0.0040815305,"about_ca_topic_score_gemma":0.0039491076,"teacher_disagreement_score":0.0040815305,"about_ca_system_score_codex":0.00091347063,"about_ca_system_score_gemma":0.002059362,"threshold_uncertainty_score":0.009554446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007168667,0.00002874821,0.98845994,0.00012649829,0.00003060482,0.000038374896,0.000052337135,0.0026489364,0.0014458991],"genre_scores_gemma":[0.26453558,0.00016075437,0.7298455,0.00022729748,0.000109337205,0.0002426203,0.00037472803,0.0018228794,0.0026812677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979924,0.0004882986,0.00015500841,0.00039713993,0.0007735863,0.00019358046],"domain_scores_gemma":[0.9941772,0.0038659319,0.00033030848,0.0011133958,0.00045475588,0.000058354875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023049584,0.0006723189,0.00070240936,0.0007842608,0.00075102504,0.0020360432,0.0013051591,0.00071243785,0.0034195986],"category_scores_gemma":[0.011094675,0.00069480424,0.002153823,0.00079664035,0.0018709644,0.0027078679,0.0018746397,0.002280953,0.0008404055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016317124,0.00014895911,0.002383148,0.00039808947,0.00010462835,0.000319344,0.00068987376,0.29314026,0.011834977,0.54105645,0.005052467,0.14470862],"study_design_scores_gemma":[0.00003344708,0.00003888868,0.00024321345,0.0000495234,0.000059390182,0.00011104576,0.000040499504,0.6842461,0.015134481,0.29305965,0.006954002,0.000029652118],"about_ca_topic_score_codex":0.0016634134,"about_ca_topic_score_gemma":0.0022128895,"teacher_disagreement_score":0.0034195986,"about_ca_system_score_codex":0.0012679663,"about_ca_system_score_gemma":0.0021595056,"threshold_uncertainty_score":0.012189925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039368384,0.000052660896,0.993601,0.00015168343,0.000029402174,0.00012131179,0.0000410758,0.0015167808,0.00054920645],"genre_scores_gemma":[0.14134945,0.0002691268,0.853807,0.00036213067,0.00007972165,0.0005237815,0.00043414297,0.0016626498,0.0015120691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95684165,0.02063904,0.0033648026,0.0039984323,0.012357605,0.002798443],"domain_scores_gemma":[0.9009984,0.057136934,0.006709515,0.02465438,0.009809126,0.0006916601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030779889,0.002012511,0.00159718,0.0023120786,0.0012429091,0.0071015805,0.0052157105,0.0037242465,0.0051617436],"category_scores_gemma":[0.09148731,0.0025618186,0.0043192157,0.0010156662,0.008627309,0.010790694,0.0072624683,0.007289019,0.002760144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004862031,0.00047992723,0.0040717735,0.0017959663,0.0003750217,0.0011830634,0.0033199773,0.17023993,0.044514395,0.65625226,0.003417532,0.11386397],"study_design_scores_gemma":[0.00027681433,0.00041035409,0.00047069186,0.00086631544,0.0002333199,0.00046259307,0.0004147963,0.49960822,0.11530297,0.358926,0.022862362,0.00016555189],"about_ca_topic_score_codex":0.0018398874,"about_ca_topic_score_gemma":0.0013754515,"teacher_disagreement_score":0.030779889,"about_ca_system_score_codex":0.0027698234,"about_ca_system_score_gemma":0.008251173,"threshold_uncertainty_score":0.16278154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076606707,0.00023542388,0.98831034,0.0005559624,0.000050229242,0.00006846569,0.00009907958,0.0008608951,0.0021589664],"genre_scores_gemma":[0.48205653,0.000944728,0.50826246,0.0008331123,0.00038701203,0.00045859406,0.00046750347,0.0011091422,0.005480911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988492,0.0038616776,0.0009454117,0.0025111802,0.0032389504,0.00095070084],"domain_scores_gemma":[0.95251715,0.032060146,0.0021939941,0.010145885,0.0023940552,0.00068877847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009634376,0.0011480898,0.0010222299,0.0022643877,0.0015067058,0.004320128,0.0025726822,0.0013887885,0.0043383082],"category_scores_gemma":[0.03403551,0.0010144182,0.002132575,0.0023129168,0.0060237558,0.013009539,0.004569034,0.008306193,0.0010154302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017477218,0.00008953406,0.001484033,0.00022300344,0.000033154054,0.00006883971,0.00047085798,0.018504145,0.0040468373,0.93117404,0.0012562374,0.042474587],"study_design_scores_gemma":[0.000026713898,0.00006821653,0.000400836,0.00008062668,0.00004551187,0.00011554341,0.00011010329,0.13764246,0.017268442,0.834927,0.00925171,0.000062840896],"about_ca_topic_score_codex":0.0018411409,"about_ca_topic_score_gemma":0.0011360445,"teacher_disagreement_score":0.009634376,"about_ca_system_score_codex":0.0042371848,"about_ca_system_score_gemma":0.00425526,"threshold_uncertainty_score":0.050952077},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208557,0.000408438,0.066278,0.000111673515,0.000030627914,0.000045320106,0.00029140324,0.010495965,0.0014828607],"genre_scores_gemma":[0.98507255,0.000047686983,0.014140849,0.0000339302,0.0000054547545,0.000014133074,0.00014792313,0.00010169935,0.00043589933],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991167,0.00010528327,0.000059008904,0.00018501029,0.00040152945,0.00013258276],"domain_scores_gemma":[0.9973091,0.0008431258,0.0008325715,0.0004416667,0.00046904688,0.000104513485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004468637,0.00054165086,0.00035167774,0.0021678272,0.00023918896,0.00050593907,0.0005867799,0.00048132226,0.00082889624],"category_scores_gemma":[0.0033670366,0.00021868011,0.00040525149,0.0006762123,0.00045444368,0.0011657259,0.0007084105,0.0004822134,0.00032900117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014786541,0.00070511026,0.2015585,0.00055907056,0.0002544347,0.0018958853,0.0010696707,0.028402831,0.44693905,0.0036207512,0.003237975,0.310278],"study_design_scores_gemma":[0.00005262003,0.0006551736,0.089594275,0.000092560535,0.00017385448,0.0015385676,0.00029626262,0.59557897,0.30605397,0.003466222,0.0023958408,0.00010185505],"about_ca_topic_score_codex":0.0016037563,"about_ca_topic_score_gemma":0.0030493552,"teacher_disagreement_score":0.0021678272,"about_ca_system_score_codex":0.00051136926,"about_ca_system_score_gemma":0.00068639446,"threshold_uncertainty_score":0.0037102103},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14373769,0.029412705,0.6156038,0.15724207,0.001570205,0.00025219622,0.00014477929,0.0016580825,0.05037848],"genre_scores_gemma":[0.66486835,0.0133919865,0.30151984,0.009830563,0.00068876793,0.00022532005,0.00019646635,0.0014046812,0.007874068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9644681,0.015792936,0.0019200474,0.001856597,0.014346773,0.0016154995],"domain_scores_gemma":[0.90373456,0.054632675,0.0045019267,0.024456814,0.010937315,0.0017366923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.049159475,0.0009891796,0.000821157,0.0033352328,0.004827689,0.013078729,0.002346434,0.005123787,0.001374419],"category_scores_gemma":[0.07170636,0.0013591754,0.0011276176,0.0026024315,0.018781558,0.037149277,0.009208269,0.012811832,0.00061696983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010123682,0.00013937081,0.007809752,0.0010572592,0.000075114454,0.0013637912,0.058880366,0.0067759897,0.006961025,0.65805936,0.016294463,0.24248224],"study_design_scores_gemma":[0.000027208698,0.00023766638,0.0024561011,0.0024594516,0.000055070854,0.0024657082,0.024749339,0.020566525,0.00869486,0.6207321,0.31729066,0.00026526107],"about_ca_topic_score_codex":0.003437137,"about_ca_topic_score_gemma":0.004959668,"teacher_disagreement_score":0.049159475,"about_ca_system_score_codex":0.0055492963,"about_ca_system_score_gemma":0.009157106,"threshold_uncertainty_score":0.2599833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54522955,0.0049114567,0.29616022,0.010264658,0.0014525669,0.00039935246,0.0014173981,0.038422182,0.1017427],"genre_scores_gemma":[0.9760317,0.00020726769,0.013424211,0.00043792618,0.000058021964,0.00004225558,0.00016002846,0.00028524434,0.009353324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956872,0.0013012359,0.00027855893,0.0003319441,0.0016195825,0.00078148226],"domain_scores_gemma":[0.9948578,0.001364122,0.00047218654,0.0024302502,0.00066949707,0.00020617999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022404268,0.0005751602,0.00086141966,0.00095575146,0.00127736,0.002325604,0.0009353439,0.0019146275,0.004666086],"category_scores_gemma":[0.007835481,0.00062300224,0.0007190668,0.0008418478,0.0015835342,0.0049345023,0.0038778638,0.0019814558,0.0017652477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008218655,0.0007649871,0.01081218,0.0008542972,0.0008887701,0.0028754028,0.0019760837,0.025771245,0.0916685,0.35711405,0.09961481,0.39944097],"study_design_scores_gemma":[0.0006731116,0.0012870576,0.003980168,0.00055758463,0.000711879,0.0040588444,0.000804296,0.3480147,0.35794252,0.18035358,0.10131143,0.00030482118],"about_ca_topic_score_codex":0.00081513094,"about_ca_topic_score_gemma":0.00097584684,"teacher_disagreement_score":0.004666086,"about_ca_system_score_codex":0.0014642719,"about_ca_system_score_gemma":0.0014564125,"threshold_uncertainty_score":0.015609622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0392226,0.0005942989,0.92346346,0.0020494778,0.0003330527,0.00060004886,0.00028531335,0.015458537,0.017993156],"genre_scores_gemma":[0.8186172,0.0004277651,0.16316268,0.0010533785,0.000362321,0.0005583711,0.0005715165,0.0014504738,0.01379622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986938,0.0040583927,0.0012102558,0.0019959246,0.003508085,0.0022892924],"domain_scores_gemma":[0.9771275,0.0039830804,0.0019719277,0.014067856,0.0016419275,0.001207751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008820446,0.001166439,0.002177215,0.0009750532,0.0027998446,0.0061440817,0.0044910084,0.0031120072,0.007093449],"category_scores_gemma":[0.019643292,0.0010726991,0.0019234502,0.0009804543,0.0054845857,0.019527016,0.017701028,0.005746442,0.005595661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035385527,0.0004951974,0.0039411685,0.0010180473,0.0001932457,0.0027877819,0.0021326665,0.030752769,0.04275153,0.6934543,0.038216546,0.18071829],"study_design_scores_gemma":[0.0006731496,0.0009087949,0.0011606046,0.0002554319,0.0002881258,0.0032091667,0.0006397229,0.40570545,0.07616768,0.40990385,0.100608096,0.00047988765],"about_ca_topic_score_codex":0.0019520536,"about_ca_topic_score_gemma":0.0016315264,"teacher_disagreement_score":0.008820446,"about_ca_system_score_codex":0.0024188843,"about_ca_system_score_gemma":0.0044193515,"threshold_uncertainty_score":0.04664755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09851065,0.002469282,0.841936,0.0014407081,0.0006916747,0.00043887433,0.0006191818,0.015549796,0.03834387],"genre_scores_gemma":[0.84716624,0.00087726855,0.13176462,0.0008787464,0.00012722079,0.00019004823,0.000538367,0.00047362476,0.017983768],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984971,0.00015774254,0.000092037095,0.00023662353,0.00068315753,0.00033336313],"domain_scores_gemma":[0.99808407,0.0002815076,0.00030698467,0.0008201512,0.00037669553,0.00013066758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087027124,0.0007897677,0.0007804671,0.00046819038,0.00081278785,0.0018215169,0.0025256432,0.0011632384,0.0075362804],"category_scores_gemma":[0.0030018748,0.0005207349,0.00043747845,0.0004270243,0.0009280775,0.0030335952,0.002713452,0.0015959023,0.004112393],"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.001272782,0.0007181366,0.008456825,0.0014460474,0.00028126713,0.0014330551,0.00082296855,0.17783141,0.2492803,0.13962926,0.07304054,0.3457874],"study_design_scores_gemma":[0.00013703131,0.0013852476,0.0016739905,0.0001671337,0.00020109612,0.0018112957,0.0002489753,0.5506815,0.29820448,0.036289398,0.10903237,0.00016754607],"about_ca_topic_score_codex":0.00083271286,"about_ca_topic_score_gemma":0.001398846,"teacher_disagreement_score":0.0075362804,"about_ca_system_score_codex":0.0009622263,"about_ca_system_score_gemma":0.0013039676,"threshold_uncertainty_score":0.025211394},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022237257,0.9148022,0.0474767,0.008173051,0.0023557846,0.00010216513,0.00075325667,0.0003402273,0.023772804],"genre_scores_gemma":[0.030240087,0.8812694,0.063021794,0.0021657194,0.004866936,0.00023329597,0.0015232116,0.00030364568,0.016375927],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970632,0.00059335306,0.00050037034,0.00043026093,0.0012925536,0.000120178986],"domain_scores_gemma":[0.9919402,0.0047902423,0.00071459124,0.00035985507,0.0020201649,0.0001749809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032555847,0.0015883711,0.0013364728,0.016014481,0.0007497261,0.0038009428,0.0012018227,0.0014357516,0.008547264],"category_scores_gemma":[0.012062777,0.0008657665,0.00064243993,0.020331899,0.0019582282,0.0080080535,0.0018296306,0.0023526093,0.0031240657],"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.000022191758,0.00006654319,0.0011429256,0.0043621785,0.000039805713,0.000093918825,0.0003504806,0.0021986074,0.0007192297,0.12142655,0.10676506,0.76281244],"study_design_scores_gemma":[0.000007650466,0.00008965099,0.0023252945,0.006456879,0.000047594443,0.0011223546,0.00039196055,0.0029002344,0.0007846058,0.13530795,0.850472,0.00009391966],"about_ca_topic_score_codex":0.0019271501,"about_ca_topic_score_gemma":0.0024173108,"teacher_disagreement_score":0.016014481,"about_ca_system_score_codex":0.0019954112,"about_ca_system_score_gemma":0.0022002137,"threshold_uncertainty_score":0.02859348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027603297,0.00017959597,0.9575878,0.00039173308,0.00009492082,0.0001985771,0.00028121105,0.009210242,0.0044526313],"genre_scores_gemma":[0.48959863,0.00041163503,0.49752802,0.00049459795,0.000111001464,0.00031975983,0.0010081616,0.003132329,0.007395861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99334973,0.0017897087,0.0006096775,0.0009093707,0.0026239988,0.0007174825],"domain_scores_gemma":[0.9760919,0.014041727,0.0013829753,0.005362339,0.0028318807,0.00028929274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061954847,0.00083091867,0.0008115696,0.0015283833,0.0010419481,0.0036987225,0.0028839975,0.001362086,0.0053673293],"category_scores_gemma":[0.026929049,0.0010723603,0.0021737714,0.00095886266,0.004435304,0.0078093573,0.004776412,0.0040156813,0.0015877547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058735727,0.00016965567,0.006557936,0.0009910685,0.00010998113,0.0005353434,0.0014847807,0.072297774,0.028274566,0.71963876,0.008150259,0.16120254],"study_design_scores_gemma":[0.00022823477,0.00022582231,0.0007167005,0.00026606466,0.00019198439,0.0005390195,0.00022093853,0.35010388,0.11526952,0.47842145,0.05367665,0.00013974702],"about_ca_topic_score_codex":0.0047444343,"about_ca_topic_score_gemma":0.005275413,"teacher_disagreement_score":0.0061954847,"about_ca_system_score_codex":0.002800927,"about_ca_system_score_gemma":0.004201318,"threshold_uncertainty_score":0.03276527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14888068,0.0008655664,0.60951406,0.00017535988,0.00022232838,0.00040872413,0.0007631684,0.23459926,0.0045708884],"genre_scores_gemma":[0.7516746,0.00025672902,0.23334563,0.00025679098,0.000051782084,0.00027228546,0.0015695948,0.0083440095,0.0042285724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989697,0.0001837535,0.0000847533,0.00028904708,0.0002995461,0.00017325161],"domain_scores_gemma":[0.9968982,0.0012421182,0.0003767251,0.0010010436,0.00037493627,0.00010704338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094656955,0.0015406338,0.0006599331,0.0011963522,0.00036317922,0.00079180277,0.0017381874,0.0007444364,0.0040574777],"category_scores_gemma":[0.003970512,0.00078590104,0.0009177371,0.0004820771,0.0009110824,0.0015834821,0.0011593264,0.00082291826,0.0013904592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020260548,0.00048012132,0.017694233,0.0012025466,0.00030748692,0.0019360103,0.00097478164,0.100180686,0.24817117,0.0066156094,0.039666515,0.58074474],"study_design_scores_gemma":[0.00030617404,0.00091781205,0.006825604,0.00008627763,0.00014740479,0.001255113,0.00013686984,0.7062093,0.25494564,0.0057741283,0.023249999,0.00014571915],"about_ca_topic_score_codex":0.0012369703,"about_ca_topic_score_gemma":0.001227678,"teacher_disagreement_score":0.0040574777,"about_ca_system_score_codex":0.0004690129,"about_ca_system_score_gemma":0.0007650608,"threshold_uncertainty_score":0.013573587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.553889,0.0014285118,0.3984122,0.0017746709,0.00028824646,0.0009569703,0.0016510248,0.014366771,0.027232626],"genre_scores_gemma":[0.74384284,0.00045749135,0.24874851,0.00034102582,0.000029429075,0.00047859142,0.0023435433,0.0012103942,0.002548106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9834907,0.00846792,0.00102054,0.00064900465,0.005745048,0.00062673696],"domain_scores_gemma":[0.9647816,0.014386269,0.0021388216,0.00987929,0.008377375,0.0004365893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013520404,0.0010647542,0.00055131665,0.0028388991,0.00059079344,0.0024087466,0.0019542715,0.0010885446,0.003030028],"category_scores_gemma":[0.0547177,0.0005071145,0.00068785145,0.0015382929,0.0011290928,0.0030924866,0.0020150237,0.0018286479,0.00072962325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015292997,0.0017604236,0.039750468,0.001833891,0.00028222438,0.00079169526,0.0021729802,0.3349539,0.08160003,0.090075985,0.021646427,0.42360258],"study_design_scores_gemma":[0.00021340235,0.0022322345,0.0077235173,0.0005796829,0.00010966097,0.0005048296,0.0008306989,0.7892607,0.13800605,0.025298988,0.035126537,0.00011382479],"about_ca_topic_score_codex":0.0014450792,"about_ca_topic_score_gemma":0.001994294,"teacher_disagreement_score":0.013520404,"about_ca_system_score_codex":0.0016768002,"about_ca_system_score_gemma":0.0019228223,"threshold_uncertainty_score":0.07150358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062268835,0.00085160567,0.8580784,0.0008879069,0.0018418627,0.00017517654,0.00028373743,0.029309742,0.04630277],"genre_scores_gemma":[0.67384905,0.00097267726,0.22004661,0.0012943693,0.00061375654,0.00014238768,0.00054366403,0.011728655,0.090808816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945603,0.0010803413,0.00055524695,0.0007926735,0.002092294,0.00091919425],"domain_scores_gemma":[0.97873116,0.0064045377,0.0011415727,0.011077562,0.0021608027,0.00048433882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031240243,0.0012575609,0.0015013624,0.0011692401,0.0013072193,0.004241257,0.0037346485,0.0021963927,0.010687181],"category_scores_gemma":[0.017886031,0.0012804429,0.0009831936,0.0010533651,0.0018746975,0.0068743494,0.0069573023,0.00420669,0.0064403014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014011931,0.0004748208,0.008603271,0.0010835038,0.00013283188,0.0017906089,0.003588286,0.017513879,0.036226988,0.27341706,0.046282813,0.60948473],"study_design_scores_gemma":[0.00012516833,0.00037232047,0.001590428,0.00078255165,0.00041416942,0.0027661584,0.0009230993,0.17565578,0.17937356,0.4056145,0.23209986,0.00028235582],"about_ca_topic_score_codex":0.0007244394,"about_ca_topic_score_gemma":0.00090834167,"teacher_disagreement_score":0.010687181,"about_ca_system_score_codex":0.0006052009,"about_ca_system_score_gemma":0.0014665847,"threshold_uncertainty_score":0.035752177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02209713,0.00004222653,0.9696348,0.00020092445,0.00003155806,0.0003843184,0.00045253724,0.003299642,0.0038568997],"genre_scores_gemma":[0.17374022,0.0001764965,0.8180485,0.00010941332,0.000014022758,0.0005755922,0.0017499169,0.0010367114,0.0045491643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985299,0.00037994276,0.000116020296,0.0002143657,0.0006463765,0.00011337615],"domain_scores_gemma":[0.99634093,0.0021058384,0.00030949924,0.0007644056,0.00041563893,0.00006366785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017283378,0.0011144201,0.00043810383,0.0011039044,0.000431285,0.0012332816,0.0011009119,0.00097303616,0.0047515724],"category_scores_gemma":[0.008077813,0.0011653916,0.0024112368,0.00079664227,0.0007968886,0.0017405446,0.0018579556,0.0015126099,0.0018085857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054291636,0.00044017096,0.0043976144,0.0011299454,0.00021043656,0.0019394989,0.0011290254,0.34729522,0.04013487,0.18952434,0.01070269,0.40255326],"study_design_scores_gemma":[0.00015380261,0.00019621234,0.0004303709,0.00016742949,0.00013746209,0.00048318642,0.00026170217,0.7691368,0.046274308,0.16438317,0.018331898,0.000043620978],"about_ca_topic_score_codex":0.0013570827,"about_ca_topic_score_gemma":0.0026427598,"teacher_disagreement_score":0.0047515724,"about_ca_system_score_codex":0.0007263754,"about_ca_system_score_gemma":0.0018279562,"threshold_uncertainty_score":0.015895545},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18064575,0.0009163678,0.57703567,0.0009244917,0.0004907333,0.00038335085,0.0025690738,0.21387684,0.023157688],"genre_scores_gemma":[0.60177046,0.00033697282,0.36848223,0.0009912971,0.00010745768,0.00029003946,0.0033601478,0.012647616,0.01201382],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982597,0.00031591175,0.00012005315,0.00030904278,0.00073299627,0.00026224993],"domain_scores_gemma":[0.9963552,0.0010160679,0.0004889684,0.0013878641,0.0006537796,0.00009816472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011763509,0.0009576365,0.00044733845,0.0010692914,0.00048959313,0.000997426,0.0011796942,0.00060211105,0.0064229853],"category_scores_gemma":[0.006245824,0.0005865001,0.0007602463,0.00054181664,0.0010209035,0.0021156068,0.0016209107,0.0015039908,0.0022243941],"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.0027989964,0.000456307,0.022589568,0.0012138562,0.00017971866,0.0007017305,0.0009846314,0.06726342,0.07956254,0.06979417,0.08638055,0.6680745],"study_design_scores_gemma":[0.0002574489,0.0013749981,0.008063665,0.00046389838,0.000199742,0.0016999943,0.00026454075,0.46277767,0.2507437,0.07758222,0.1963124,0.00025979418],"about_ca_topic_score_codex":0.0016812498,"about_ca_topic_score_gemma":0.0026437656,"teacher_disagreement_score":0.0064229853,"about_ca_system_score_codex":0.001036732,"about_ca_system_score_gemma":0.0017534298,"threshold_uncertainty_score":0.021487057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10202223,0.0011266004,0.7132803,0.0005170474,0.0003170964,0.00034524145,0.0004607016,0.17290235,0.009028435],"genre_scores_gemma":[0.7475459,0.00044554318,0.22976564,0.00076995336,0.00008335691,0.00034552815,0.0010791235,0.009136671,0.010828301],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998735,0.00016472823,0.00009132101,0.00018828675,0.00049517234,0.00032552797],"domain_scores_gemma":[0.9975922,0.00059639197,0.00025484516,0.0011313226,0.0002975835,0.00012775396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013256063,0.0013300229,0.0005304372,0.0008737889,0.0006356397,0.001313231,0.0026177657,0.0014229395,0.0069611287],"category_scores_gemma":[0.0051189987,0.00082564575,0.00085955067,0.00032402534,0.0013007765,0.0035521684,0.0029636852,0.0023745492,0.0027051973],"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.0036346647,0.0009711421,0.021024635,0.0014511626,0.0002151572,0.0021828806,0.0013664627,0.049293038,0.24774548,0.050619733,0.07028095,0.5512147],"study_design_scores_gemma":[0.00044433944,0.0015028383,0.007139524,0.00040250405,0.00018484249,0.0022110308,0.00021666284,0.4308007,0.38324776,0.03504513,0.13847828,0.00032647944],"about_ca_topic_score_codex":0.0016364901,"about_ca_topic_score_gemma":0.0014993522,"teacher_disagreement_score":0.0069611287,"about_ca_system_score_codex":0.000895114,"about_ca_system_score_gemma":0.0013526195,"threshold_uncertainty_score":0.023287296},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046219323,0.00044178177,0.71170527,0.0027514733,0.0011246472,0.00022781861,0.006761444,0.23309125,0.039274354],"genre_scores_gemma":[0.25800198,0.00064595416,0.5257188,0.0072016804,0.0010051402,0.000879657,0.018279923,0.119668834,0.06859801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656856,0.0008641693,0.0003308404,0.00052684033,0.0012260474,0.00048356215],"domain_scores_gemma":[0.99213725,0.0016826615,0.0002882932,0.0043633156,0.0012729922,0.00025541507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036292146,0.0017819428,0.0011164561,0.0012243412,0.0012869181,0.004281942,0.0038792286,0.0023362027,0.054173805],"category_scores_gemma":[0.010554204,0.0014933073,0.001402286,0.0013861946,0.002813905,0.0077449097,0.006010842,0.0035804082,0.022853822],"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.0012824031,0.00011488269,0.0012092784,0.00072875945,0.00012617311,0.00029356475,0.0004207325,0.009558036,0.011639517,0.22835055,0.600081,0.14619519],"study_design_scores_gemma":[0.0003773938,0.00012860005,0.0005273919,0.0002670743,0.00012095751,0.000386824,0.0001074424,0.099837296,0.07097502,0.28232497,0.5447358,0.00021114002],"about_ca_topic_score_codex":0.003877011,"about_ca_topic_score_gemma":0.008306617,"teacher_disagreement_score":0.054173805,"about_ca_system_score_codex":0.0020075247,"about_ca_system_score_gemma":0.0035850059,"threshold_uncertainty_score":0.18122941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99287695,0.00065793155,0.0040209056,0.00014266561,0.0000127385265,0.000149825,0.00043878064,0.0002954429,0.0014046511],"genre_scores_gemma":[0.989141,0.0003114811,0.008676306,0.000060702838,0.000012662981,0.0001299709,0.0010590089,0.00008645032,0.00052251195],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98772824,0.004943256,0.001118878,0.0016481754,0.0040911366,0.00047043225],"domain_scores_gemma":[0.6596974,0.27572268,0.029372497,0.016619518,0.016898211,0.001689749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010219785,0.0005580053,0.0003186967,0.0027133748,0.00048690476,0.0009762127,0.0012407746,0.00089849223,0.0012198124],"category_scores_gemma":[0.11792654,0.0003842743,0.00045854974,0.0019895486,0.0010369943,0.002235344,0.00075473246,0.0014200811,0.00047990048],"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.0015555054,0.0045252596,0.5975113,0.002391316,0.00037395128,0.00067272986,0.0062437626,0.022450183,0.012276974,0.0020921375,0.006390607,0.3435163],"study_design_scores_gemma":[0.00031995427,0.0065428903,0.8043471,0.00054252916,0.0003675655,0.0019808288,0.005096002,0.13997255,0.019873548,0.0019311231,0.018892227,0.00013363194],"about_ca_topic_score_codex":0.0017862023,"about_ca_topic_score_gemma":0.0033401963,"teacher_disagreement_score":0.010219785,"about_ca_system_score_codex":0.0008032182,"about_ca_system_score_gemma":0.00091350416,"threshold_uncertainty_score":0.054048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2669337,0.0010504201,0.7052488,0.00031221632,0.00018835043,0.00021764972,0.00008630831,0.013484819,0.012477802],"genre_scores_gemma":[0.934289,0.000101637714,0.06301878,0.00013524473,0.000023767685,0.000041513173,0.000056642948,0.00016608262,0.0021673522],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922454,0.0002135736,0.00003870611,0.00007548053,0.00033252063,0.00011513336],"domain_scores_gemma":[0.99889565,0.00041452073,0.00020566041,0.00026504154,0.00018182296,0.000037290807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006741179,0.00048586063,0.0004428766,0.000798862,0.00033408395,0.0005781815,0.0008409246,0.00046443523,0.0016425116],"category_scores_gemma":[0.0017820573,0.00017387971,0.0003389919,0.00030079353,0.000752528,0.0007607391,0.00067828095,0.00056847726,0.00043541612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026416846,0.00037661043,0.0054098633,0.0006419732,0.00020806219,0.0011942226,0.0003482612,0.17455652,0.41041332,0.078708015,0.005959164,0.3195423],"study_design_scores_gemma":[0.00008030446,0.000750162,0.00079061603,0.00003576279,0.00007333543,0.0004663954,0.00002471303,0.6822551,0.30608305,0.0049795834,0.004429533,0.000031503718],"about_ca_topic_score_codex":0.00044687325,"about_ca_topic_score_gemma":0.0005638398,"teacher_disagreement_score":0.0016425116,"about_ca_system_score_codex":0.00043759253,"about_ca_system_score_gemma":0.00053023046,"threshold_uncertainty_score":0.0054947734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024585533,0.00014823947,0.99154013,0.0002622739,0.000046383724,0.00006899037,0.00008844197,0.0042873845,0.0010995618],"genre_scores_gemma":[0.38453442,0.00048449228,0.60654664,0.00075988285,0.00020353164,0.0005535252,0.00054464693,0.0009108491,0.0054619703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920031,0.0021134773,0.00059293216,0.0011160593,0.0034045544,0.0007698231],"domain_scores_gemma":[0.99140656,0.0030680122,0.00064715237,0.0038311789,0.00076504704,0.00028206926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063798004,0.0012468464,0.001321132,0.0011621879,0.0012661669,0.0038313405,0.0053142766,0.0021662053,0.0056432784],"category_scores_gemma":[0.016664008,0.001200057,0.0014465352,0.0013833842,0.0031383275,0.007801979,0.00717995,0.0050473153,0.0014526697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010234702,0.00027209622,0.0020569225,0.00039875356,0.00021875884,0.00042309123,0.00037283156,0.29052138,0.013140569,0.4226096,0.021219527,0.24774286],"study_design_scores_gemma":[0.00008606151,0.00014588617,0.00016928789,0.000036090667,0.00003125636,0.00015158844,0.000033157972,0.8242759,0.012683155,0.14832371,0.014013436,0.000050469633],"about_ca_topic_score_codex":0.0019996492,"about_ca_topic_score_gemma":0.002078462,"teacher_disagreement_score":0.0063798004,"about_ca_system_score_codex":0.001933751,"about_ca_system_score_gemma":0.0034737068,"threshold_uncertainty_score":0.033739984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022794956,0.00015401615,0.98406255,0.0024987,0.00019142975,0.000072302275,0.00004531038,0.00012915187,0.010567018],"genre_scores_gemma":[0.4351393,0.0006994156,0.53196824,0.0021429823,0.00093487557,0.00049674505,0.00018114112,0.00020955801,0.028227773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901389,0.0039586723,0.00079057476,0.0012692269,0.0032823302,0.0005604082],"domain_scores_gemma":[0.9861309,0.007122518,0.00049203873,0.004326895,0.0014118432,0.0005157985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00665459,0.0011778802,0.0011654439,0.002179522,0.0015345175,0.0065688128,0.003314911,0.0035273684,0.012335844],"category_scores_gemma":[0.019382164,0.0009572046,0.0022439717,0.0008513198,0.007115797,0.015853088,0.007922587,0.008089019,0.0022794118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003296001,0.000029578427,0.00014846587,0.00004224624,0.000022089907,0.00009331168,0.00016686754,0.0044745277,0.0005551663,0.98431027,0.00056265586,0.009561885],"study_design_scores_gemma":[0.000023096221,0.0000413265,0.000051742187,0.00003148212,0.000019453475,0.00011553785,0.00004548486,0.05119285,0.0009271367,0.9414453,0.0060864952,0.00002019757],"about_ca_topic_score_codex":0.0004257683,"about_ca_topic_score_gemma":0.00047685872,"teacher_disagreement_score":0.012335844,"about_ca_system_score_codex":0.0016717964,"about_ca_system_score_gemma":0.0022660377,"threshold_uncertainty_score":0.041267514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0204969,0.00046168914,0.8801394,0.0009887489,0.00097226084,0.00030315557,0.0012790083,0.045057908,0.050301],"genre_scores_gemma":[0.1981381,0.00046377728,0.75196946,0.000836432,0.00014667417,0.00053238973,0.002754983,0.016981853,0.028176397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940395,0.00009722203,0.000040292012,0.00011268663,0.00024671684,0.000099098346],"domain_scores_gemma":[0.99891865,0.000294801,0.00007882751,0.00027940836,0.0003854681,0.00004284944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325505,0.0009970645,0.00034761993,0.0009940256,0.00074345275,0.0014214105,0.0012786972,0.0007945263,0.025015043],"category_scores_gemma":[0.0032961126,0.00040450017,0.0006489816,0.0007164143,0.00070944085,0.0013416479,0.0013874691,0.0011193105,0.008884836],"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.00046224895,0.0002707044,0.0027226768,0.0009130551,0.00010694764,0.00094090094,0.0006740933,0.049142107,0.09669866,0.13871199,0.14806807,0.56128854],"study_design_scores_gemma":[0.00015342921,0.00024765136,0.00078868435,0.00033959476,0.000086273656,0.0005933283,0.00023762583,0.36011443,0.320731,0.045765027,0.27083522,0.000107680826],"about_ca_topic_score_codex":0.002059901,"about_ca_topic_score_gemma":0.002772219,"teacher_disagreement_score":0.025015043,"about_ca_system_score_codex":0.00071888836,"about_ca_system_score_gemma":0.001476866,"threshold_uncertainty_score":0.08368373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094121546,0.0013861271,0.80755347,0.00059418887,0.00028836753,0.00033469027,0.0006927682,0.09015506,0.0048737684],"genre_scores_gemma":[0.70616025,0.00032211802,0.2876316,0.00039759884,0.00009813126,0.0003218785,0.00077130814,0.001942598,0.0023545339],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954189,0.001686252,0.00021387298,0.00058525655,0.0017195316,0.00037617906],"domain_scores_gemma":[0.988252,0.007125949,0.001163546,0.0022503578,0.0009800119,0.00022810974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003079927,0.0023035235,0.00095344585,0.0018999522,0.0005101507,0.0014503186,0.0028392274,0.0012272636,0.007672065],"category_scores_gemma":[0.012397737,0.0007981296,0.0010686137,0.0005141101,0.0014017853,0.0027935025,0.0015529098,0.0015190656,0.0014434267],"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.0032715807,0.0006899106,0.016854756,0.0014783116,0.0005643963,0.001367117,0.000559903,0.19113754,0.18298967,0.037820067,0.026886323,0.5363804],"study_design_scores_gemma":[0.00040797284,0.0011460211,0.0014664335,0.00009390531,0.00013100427,0.0005804433,0.000046232948,0.8611471,0.10593681,0.018479168,0.010472225,0.000092748196],"about_ca_topic_score_codex":0.0009008002,"about_ca_topic_score_gemma":0.0011857445,"teacher_disagreement_score":0.007672065,"about_ca_system_score_codex":0.0007593648,"about_ca_system_score_gemma":0.0016009788,"threshold_uncertainty_score":0.02566564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012479409,0.00004949921,0.9850942,0.00005023155,0.000017557675,0.00015006315,0.00045683188,0.011383364,0.0015502471],"genre_scores_gemma":[0.064166546,0.00046424978,0.9136105,0.00022927935,0.00005379255,0.0009979446,0.004180474,0.008719631,0.0075776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976974,0.00057799835,0.00038070767,0.00028636795,0.00084213674,0.00021527315],"domain_scores_gemma":[0.9932533,0.003550667,0.0006366341,0.0017763608,0.000633053,0.00014992399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043765837,0.0027120318,0.0012154098,0.0031537334,0.0012124642,0.0049629495,0.0036068284,0.0018277881,0.012841992],"category_scores_gemma":[0.009768172,0.0027063438,0.0034968958,0.0020703136,0.0015325221,0.006281705,0.003046036,0.003466107,0.0047979485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043323913,0.00069612364,0.0026799543,0.001499061,0.00026521352,0.00069129915,0.0012803917,0.17056501,0.016966527,0.52213216,0.025867825,0.2569232],"study_design_scores_gemma":[0.00021581986,0.00013032962,0.00038651057,0.00048069505,0.0003169903,0.00042923796,0.0002695807,0.63937616,0.04617014,0.20611912,0.105950415,0.000155048],"about_ca_topic_score_codex":0.0053767157,"about_ca_topic_score_gemma":0.009721523,"teacher_disagreement_score":0.012841992,"about_ca_system_score_codex":0.0020105708,"about_ca_system_score_gemma":0.0034589402,"threshold_uncertainty_score":0.042960763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7725768,0.0015980651,0.19467658,0.0007137606,0.00016761551,0.00048763733,0.0025765023,0.023429943,0.003773123],"genre_scores_gemma":[0.88386005,0.0001734497,0.10980435,0.00022282623,0.000024692044,0.00024353701,0.0037519936,0.0009629264,0.00095630536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99400204,0.001987712,0.00043395185,0.0010050414,0.002250867,0.00032039284],"domain_scores_gemma":[0.9550491,0.029893521,0.004302145,0.0063196984,0.0037515673,0.00068387773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004700056,0.0010695497,0.00047446924,0.0025328249,0.00064128404,0.0013891741,0.0018026205,0.0010476336,0.0008764029],"category_scores_gemma":[0.04671404,0.00042975644,0.0006808885,0.0013901019,0.0015291433,0.0022651237,0.002251224,0.0014931585,0.00041690262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025373895,0.0010750778,0.18211201,0.002636707,0.0004836268,0.0017797399,0.004416314,0.18442112,0.05538717,0.014633083,0.029324304,0.5211935],"study_design_scores_gemma":[0.00013407409,0.0006173998,0.019323919,0.00011548641,0.000075209384,0.00073409633,0.0007317234,0.92084885,0.037458766,0.011402462,0.008488168,0.00006978801],"about_ca_topic_score_codex":0.005238434,"about_ca_topic_score_gemma":0.007557634,"teacher_disagreement_score":0.005238434,"about_ca_system_score_codex":0.0010316805,"about_ca_system_score_gemma":0.0017562639,"threshold_uncertainty_score":0.024856508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97029066,0.000399618,0.025056629,0.00015976315,0.000019533405,0.00004559846,0.00017837489,0.00025310463,0.0035966444],"genre_scores_gemma":[0.99915624,0.000045069348,0.0005562814,0.000004153145,8.30686e-7,0.000006024595,0.000025669946,0.0000049841256,0.00020069454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976367,0.000069753616,0.000016659578,0.000033520537,0.00007900902,0.000037379243],"domain_scores_gemma":[0.99886656,0.0007165706,0.00017508361,0.00008120044,0.00012899542,0.00003174516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032026102,0.0002788454,0.0003231104,0.0004565356,0.00017332999,0.00033539362,0.00030334134,0.00042037357,0.0007404887],"category_scores_gemma":[0.0016670575,0.000102390026,0.00033924892,0.00019863652,0.00033294596,0.00044541986,0.0002717017,0.00033027423,0.00009099014],"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.0003948785,0.000059697955,0.010281814,0.00027301797,0.00009105882,0.00089338765,0.0001999289,0.9468088,0.024529645,0.0031058637,0.00047715323,0.0128847165],"study_design_scores_gemma":[0.000010474608,0.0003163895,0.0061027766,0.000019146148,0.00003060637,0.0002767056,0.00008839911,0.9801497,0.011287876,0.0012356307,0.00046920998,0.0000130767385],"about_ca_topic_score_codex":0.001160246,"about_ca_topic_score_gemma":0.0006115859,"teacher_disagreement_score":0.001160246,"about_ca_system_score_codex":0.00032822392,"about_ca_system_score_gemma":0.00020212904,"threshold_uncertainty_score":0.0024772286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44071397,0.0012221975,0.52876467,0.00057335274,0.00016671678,0.0002095189,0.00055493455,0.01494687,0.012847785],"genre_scores_gemma":[0.8599991,0.00024432546,0.13626292,0.00010141346,0.0000198792,0.000042129002,0.0003936951,0.00028037737,0.0026560412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741876,0.000437865,0.00018098437,0.00028471422,0.001444648,0.00023301167],"domain_scores_gemma":[0.99520904,0.0021063266,0.0005548786,0.0011723691,0.00088785193,0.00006949705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134227,0.00059232366,0.0006421584,0.0022181165,0.0006331209,0.0016810314,0.0011809304,0.000993265,0.0017503252],"category_scores_gemma":[0.006741285,0.0005137885,0.0009591248,0.0012133314,0.0008125161,0.0024795623,0.0011147504,0.0007554067,0.0005981061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001962111,0.0003769815,0.05223505,0.0010993563,0.00039506386,0.0021771626,0.001488934,0.12884459,0.1444694,0.13569523,0.011321301,0.5199348],"study_design_scores_gemma":[0.00005115953,0.00036443135,0.004699285,0.00011860591,0.000261674,0.0011953074,0.00040795072,0.7919469,0.100765906,0.0895179,0.0105990255,0.000071820694],"about_ca_topic_score_codex":0.0019098549,"about_ca_topic_score_gemma":0.0025054037,"teacher_disagreement_score":0.0022181165,"about_ca_system_score_codex":0.0008791571,"about_ca_system_score_gemma":0.0010806117,"threshold_uncertainty_score":0.0063787103},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008257373,0.0025794369,0.9719657,0.0014940584,0.00011139059,0.00009276346,0.0001382931,0.00043446914,0.014926471],"genre_scores_gemma":[0.47363323,0.010107422,0.49995238,0.000654089,0.00045789467,0.00044847222,0.00064518745,0.00035040284,0.013750958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629456,0.0017489288,0.0002603081,0.00032686492,0.0011547119,0.00021467668],"domain_scores_gemma":[0.9916952,0.0063878004,0.00032650886,0.0006931385,0.00082071556,0.00007666675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043721767,0.00079894235,0.0005318287,0.0016471902,0.0009201672,0.0027941682,0.0009713877,0.0010301224,0.0028828953],"category_scores_gemma":[0.013501795,0.00055543147,0.0013734323,0.0017682079,0.0041042636,0.0037548714,0.0020159925,0.0021674228,0.0007631654],"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.00002114821,0.000023631399,0.00033259747,0.00022108763,0.000019554904,0.00021091782,0.00035332685,0.0585325,0.0013400452,0.90725374,0.0013105838,0.030380888],"study_design_scores_gemma":[0.000010379704,0.000020072192,0.0001425174,0.00015690226,0.000014065399,0.00007607353,0.0000734737,0.13788317,0.0026470858,0.8388897,0.020065278,0.000021141343],"about_ca_topic_score_codex":0.0058443784,"about_ca_topic_score_gemma":0.0031954935,"teacher_disagreement_score":0.0058443784,"about_ca_system_score_codex":0.0028302032,"about_ca_system_score_gemma":0.002491213,"threshold_uncertainty_score":0.023122549},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034894887,0.00044498467,0.88994104,0.00062434695,0.00036297867,0.00081096793,0.0004485468,0.058729943,0.0137423165],"genre_scores_gemma":[0.5818527,0.000540565,0.38120255,0.0007101928,0.00037605886,0.0009305722,0.0016792621,0.0025006358,0.03020754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675316,0.0007369019,0.0003906983,0.00049174816,0.001219648,0.0004078446],"domain_scores_gemma":[0.9944463,0.0010110219,0.0007566173,0.0023365375,0.0008738312,0.0005757452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030512882,0.0008009356,0.0009710121,0.0010369335,0.0016220432,0.002910757,0.003242283,0.0016058161,0.007652382],"category_scores_gemma":[0.009077945,0.00077646424,0.00068072556,0.0007133054,0.002022598,0.006130833,0.006037229,0.0025473563,0.00435412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057225497,0.0010419987,0.0067862505,0.0016815354,0.00030694832,0.0022473843,0.0029216388,0.07812159,0.09766039,0.37131885,0.06388577,0.3683052],"study_design_scores_gemma":[0.0008831588,0.0014348405,0.0014073123,0.00023273163,0.00027936505,0.0010946182,0.00038732286,0.6079048,0.10742858,0.08567299,0.19297737,0.00029699798],"about_ca_topic_score_codex":0.0009547626,"about_ca_topic_score_gemma":0.0008227814,"teacher_disagreement_score":0.007652382,"about_ca_system_score_codex":0.0009801792,"about_ca_system_score_gemma":0.0029210865,"threshold_uncertainty_score":0.025599718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012281332,0.0001257273,0.9766213,0.0008927419,0.000044619683,0.00027825113,0.00015091363,0.005309331,0.004295756],"genre_scores_gemma":[0.42446676,0.00015860579,0.57182944,0.00036842222,0.000053756932,0.00028647747,0.00043829062,0.0005098181,0.0018883853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9931572,0.0023064245,0.00065771415,0.001050984,0.0023463005,0.00048135227],"domain_scores_gemma":[0.9817826,0.008197133,0.0019429442,0.004533585,0.002999459,0.00054431154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007985214,0.0010558385,0.0006551672,0.0020402838,0.0009802795,0.0043697907,0.0019193242,0.00123049,0.003579226],"category_scores_gemma":[0.03785999,0.000773828,0.0013497055,0.00086247176,0.0028235512,0.006329668,0.003070482,0.0044170464,0.0011281822],"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.00040146595,0.00043783922,0.007794881,0.0007555464,0.00013884743,0.00041828427,0.0021167153,0.3198959,0.022227256,0.32995883,0.008108124,0.30774635],"study_design_scores_gemma":[0.000030138624,0.00013747,0.0005950118,0.000103129096,0.000048285372,0.00010109188,0.00016988834,0.82923734,0.011642509,0.14899863,0.008890764,0.000045729277],"about_ca_topic_score_codex":0.004350219,"about_ca_topic_score_gemma":0.0042123524,"teacher_disagreement_score":0.007985214,"about_ca_system_score_codex":0.0028725648,"about_ca_system_score_gemma":0.0039295536,"threshold_uncertainty_score":0.042230368},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009390509,0.0031240783,0.4676244,0.006907579,0.0015566639,0.0009172273,0.0033176856,0.006831222,0.5003307],"genre_scores_gemma":[0.33341777,0.007315641,0.14912494,0.0020531733,0.00061086554,0.0015552149,0.008631062,0.0016048155,0.49568653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976972,0.0007035106,0.00018283656,0.00037771158,0.0007407756,0.00029809144],"domain_scores_gemma":[0.99453473,0.001322718,0.00033367152,0.0018085093,0.0014490699,0.0005513741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293254,0.0007226914,0.00063556276,0.001231244,0.0017736069,0.004667909,0.0020226962,0.002221213,0.082859196],"category_scores_gemma":[0.00878018,0.00051859475,0.0005543005,0.0024600716,0.0012109218,0.0063235443,0.003738138,0.0018086127,0.03358439],"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.00023739698,0.00010158364,0.0006218991,0.00052299135,0.000042924177,0.00054987083,0.00038392682,0.01573705,0.0017447773,0.6519509,0.11227082,0.21583587],"study_design_scores_gemma":[0.00007848383,0.00006013514,0.00011747766,0.0001970447,0.000017705059,0.00031544908,0.0001128543,0.032745205,0.0016669005,0.32841587,0.6362341,0.000038757575],"about_ca_topic_score_codex":0.003580806,"about_ca_topic_score_gemma":0.003445634,"teacher_disagreement_score":0.082859196,"about_ca_system_score_codex":0.0019493409,"about_ca_system_score_gemma":0.004234753,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036491368,0.0031069042,0.9139398,0.00044067414,0.00067152723,0.00009229904,0.00012152709,0.011945226,0.03319076],"genre_scores_gemma":[0.49237853,0.002356861,0.3899436,0.0003345074,0.00025767877,0.00010290331,0.00043567954,0.0012136709,0.11297661],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997677,0.00003698191,0.000013834466,0.000038774233,0.00010952667,0.00003319086],"domain_scores_gemma":[0.9997676,0.000075757365,0.000018811104,0.000081041806,0.000039272578,0.000017487117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588919,0.00047261335,0.00028640428,0.00036375062,0.00028773933,0.0011718108,0.0009383189,0.00056034507,0.0038884012],"category_scores_gemma":[0.00072135415,0.00028380894,0.0001955503,0.00028001788,0.00037977862,0.0012813208,0.00086485007,0.001000944,0.0014514737],"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.00037215726,0.00007386956,0.0007044097,0.0002791381,0.00005160045,0.0004515024,0.00034027276,0.02818621,0.11955771,0.092730634,0.02449957,0.73275286],"study_design_scores_gemma":[0.00006448897,0.0004684175,0.0012807471,0.000115872215,0.00007101781,0.002007842,0.00015232612,0.46534714,0.19862327,0.04158132,0.2902158,0.00007185433],"about_ca_topic_score_codex":0.0006270174,"about_ca_topic_score_gemma":0.0009955633,"teacher_disagreement_score":0.0038884012,"about_ca_system_score_codex":0.00034731618,"about_ca_system_score_gemma":0.0003284784,"threshold_uncertainty_score":0.0130079985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26470515,0.0018828571,0.63937557,0.0004062829,0.0003211156,0.00060720305,0.00049021095,0.081785716,0.010425893],"genre_scores_gemma":[0.8122739,0.0001929197,0.18188198,0.00020814345,0.00003890603,0.00019530921,0.00032739097,0.00084198,0.0040394478],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982743,0.00024457753,0.000103647195,0.00041026014,0.00070852943,0.00025863794],"domain_scores_gemma":[0.99693453,0.0007207605,0.00040945466,0.0013823103,0.00039283474,0.00016021146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978951,0.00094798795,0.0005819918,0.001102909,0.00080868555,0.0011562648,0.0025392722,0.0006974606,0.004701553],"category_scores_gemma":[0.0045837034,0.000521105,0.00043985844,0.00092832826,0.0011980183,0.0026584931,0.0022359001,0.0011623977,0.0010030838],"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.0052091065,0.0005788164,0.013840999,0.00069731445,0.00020210721,0.0012278846,0.0011294727,0.10575096,0.16841787,0.036931787,0.026686717,0.639327],"study_design_scores_gemma":[0.00023993863,0.0009652427,0.0024119208,0.000095910895,0.000118399366,0.0006554695,0.0001262997,0.74140793,0.21485928,0.011259214,0.027726032,0.00013428579],"about_ca_topic_score_codex":0.0059331837,"about_ca_topic_score_gemma":0.005414878,"teacher_disagreement_score":0.0059331837,"about_ca_system_score_codex":0.0010537845,"about_ca_system_score_gemma":0.0026500698,"threshold_uncertainty_score":0.015728295},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032967117,0.0020751667,0.4369847,0.00045549165,0.0008350812,0.0005371068,0.0021409949,0.48348343,0.04052094],"genre_scores_gemma":[0.6479307,0.0022200926,0.17673886,0.0021395253,0.00060478726,0.00089591445,0.0076160426,0.09266759,0.06918657],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888164,0.00013848442,0.000109542576,0.00016466084,0.00050696434,0.0001987995],"domain_scores_gemma":[0.9978041,0.0005467773,0.00025674782,0.0008834793,0.00033652014,0.00017246952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015314863,0.0013668147,0.0006865305,0.0009834059,0.00053444545,0.0019851283,0.0029726503,0.00097327534,0.025874842],"category_scores_gemma":[0.005215319,0.0007958293,0.0008199106,0.00050360936,0.0011791644,0.0040649455,0.0031564059,0.0021455204,0.013114205],"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.0055856267,0.000591176,0.007936986,0.0023671407,0.00046050054,0.0015831044,0.0017683642,0.017237417,0.1200878,0.09756883,0.34260163,0.4022114],"study_design_scores_gemma":[0.0009521028,0.0012337136,0.0033074834,0.0006005433,0.0004069494,0.0017591402,0.00026664275,0.15260309,0.23725818,0.058663093,0.54245186,0.00049720693],"about_ca_topic_score_codex":0.0005659409,"about_ca_topic_score_gemma":0.00072785205,"teacher_disagreement_score":0.025874842,"about_ca_system_score_codex":0.0007147827,"about_ca_system_score_gemma":0.0012946653,"threshold_uncertainty_score":0.08656001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004589986,0.000118817705,0.98630446,0.00010066872,0.000070022594,0.00010173461,0.00005136661,0.001852209,0.0068107354],"genre_scores_gemma":[0.29795405,0.000550342,0.6697184,0.00038433148,0.00015688156,0.00043887156,0.0006993765,0.0026065367,0.02749116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967642,0.0008642705,0.00022375918,0.00044226873,0.0013595723,0.0003459518],"domain_scores_gemma":[0.9955422,0.0022013832,0.00018348893,0.0015067651,0.00046590416,0.00010017859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024498703,0.001202075,0.0008732699,0.0010728411,0.0011512148,0.0022449915,0.0018682452,0.0011565445,0.010983358],"category_scores_gemma":[0.007923648,0.0011101849,0.0014986371,0.0009965517,0.003458899,0.0038870086,0.004495637,0.0041336776,0.0034444847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031332497,0.00010671188,0.00035686683,0.00034858653,0.000047748905,0.00022956992,0.0005224579,0.049801815,0.009108022,0.7508178,0.0056122825,0.18273482],"study_design_scores_gemma":[0.000042045333,0.000055404387,0.00010319529,0.000108428845,0.00004460171,0.000109331486,0.000042633103,0.24197072,0.016214637,0.71864283,0.02262896,0.000037152644],"about_ca_topic_score_codex":0.0022203298,"about_ca_topic_score_gemma":0.0033385172,"teacher_disagreement_score":0.010983358,"about_ca_system_score_codex":0.0013594183,"about_ca_system_score_gemma":0.001982649,"threshold_uncertainty_score":0.036742985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018779552,0.0014281409,0.8805645,0.00058061985,0.0011406989,0.00013895973,0.0024398067,0.08974663,0.0051810704],"genre_scores_gemma":[0.31157547,0.0005643752,0.64480793,0.0013548725,0.00059782737,0.00031325067,0.007621514,0.0063357535,0.026829004],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984459,0.0002908106,0.00009301986,0.00046339538,0.00044443065,0.00026236442],"domain_scores_gemma":[0.99586856,0.0011763626,0.0002748273,0.0019748663,0.00052557536,0.00017981807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014022406,0.0018379444,0.0016355825,0.0017443133,0.0012587287,0.0024910602,0.0037161151,0.0020166948,0.009330504],"category_scores_gemma":[0.005784043,0.0011489864,0.0012288439,0.002134624,0.0008445044,0.0045998376,0.0041578664,0.0018786938,0.011140152],"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.0026461962,0.0003998658,0.003067109,0.00043415642,0.00022631255,0.00041813482,0.00023040386,0.017295748,0.044501945,0.03301704,0.15078188,0.7469812],"study_design_scores_gemma":[0.00033439067,0.0005349804,0.0012764744,0.00012231624,0.00027435046,0.00068459014,0.0001917618,0.61176246,0.14163116,0.16711652,0.07575937,0.00031161713],"about_ca_topic_score_codex":0.002722976,"about_ca_topic_score_gemma":0.0057428307,"teacher_disagreement_score":0.009330504,"about_ca_system_score_codex":0.00079383614,"about_ca_system_score_gemma":0.0019519643,"threshold_uncertainty_score":0.031213641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027695846,0.00038421393,0.9610664,0.00017769777,0.000069254296,0.000056444424,0.0001236657,0.0035953184,0.0068311044],"genre_scores_gemma":[0.5033867,0.00021117306,0.48417896,0.0001853627,0.000049650524,0.00012488534,0.00059597084,0.00031359424,0.010953796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999236,0.0001163716,0.00006273223,0.00020066177,0.00022825558,0.00015598802],"domain_scores_gemma":[0.9988918,0.00028688667,0.00005721586,0.000373316,0.0003133857,0.00007745899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667643,0.0005346498,0.0012323034,0.0009815253,0.00074822473,0.0018114392,0.0023111424,0.0011156109,0.0075137843],"category_scores_gemma":[0.0022428338,0.0003579277,0.0007688023,0.0010455601,0.0006792519,0.0026184928,0.002299376,0.0015294659,0.0017643168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006070539,0.00041903916,0.00204945,0.00015495183,0.0001206483,0.00021187059,0.00017813582,0.16819201,0.019630723,0.05306462,0.007624415,0.74774706],"study_design_scores_gemma":[0.000026516593,0.00008943685,0.00030302358,0.00002652719,0.000035033598,0.00014314886,0.000035940953,0.9501929,0.00908682,0.036585897,0.003456713,0.000018046998],"about_ca_topic_score_codex":0.0026279446,"about_ca_topic_score_gemma":0.0061279107,"teacher_disagreement_score":0.0075137843,"about_ca_system_score_codex":0.000884038,"about_ca_system_score_gemma":0.0018385383,"threshold_uncertainty_score":0.025136113},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33438516,0.0010619743,0.61763424,0.000739536,0.00038744163,0.00037085378,0.00036759142,0.022460686,0.022592425],"genre_scores_gemma":[0.9133878,0.00019334609,0.079243645,0.0003052839,0.000043835556,0.00011224921,0.00022984382,0.00069595495,0.0057880245],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899083,0.0001793364,0.000064333384,0.00018763721,0.00035082604,0.00022708328],"domain_scores_gemma":[0.99682534,0.0008150811,0.000375529,0.0014563603,0.00037574125,0.0001519897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448646,0.00065060786,0.00037679085,0.00041101995,0.000556052,0.0013752793,0.0014663592,0.0005662792,0.004673839],"category_scores_gemma":[0.0040081055,0.00038896888,0.0003895996,0.00029291896,0.0022148085,0.0029450941,0.002249865,0.0014887857,0.00089068536],"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.005745801,0.00050468167,0.011481711,0.0013156736,0.00021744627,0.0015994455,0.0013877046,0.105736494,0.30143183,0.25788504,0.032309115,0.2803851],"study_design_scores_gemma":[0.00044369703,0.0017769255,0.001622044,0.00023201581,0.0001614197,0.0008844484,0.00021528805,0.35192534,0.49468377,0.096279986,0.051593542,0.0001815919],"about_ca_topic_score_codex":0.0009082414,"about_ca_topic_score_gemma":0.001399485,"teacher_disagreement_score":0.004673839,"about_ca_system_score_codex":0.0006855156,"about_ca_system_score_gemma":0.0016079282,"threshold_uncertainty_score":0.01563555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009401507,0.0001434143,0.9600197,0.00033375682,0.00007535603,0.00018760237,0.000033924738,0.024990857,0.0048138597],"genre_scores_gemma":[0.29349014,0.00025550986,0.6926102,0.00040234847,0.00008320949,0.0003709807,0.0003096405,0.004828293,0.0076497267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646217,0.00083026825,0.00021790441,0.00068739976,0.0013834537,0.00041891765],"domain_scores_gemma":[0.9943778,0.001147096,0.0006571231,0.0026350773,0.00073077,0.0004520204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004042907,0.0012375861,0.00055730983,0.0012713821,0.0009127307,0.0029259776,0.0046003005,0.0016961988,0.0029560206],"category_scores_gemma":[0.0105338665,0.0008380677,0.0010688544,0.00035470407,0.0038867006,0.005105657,0.005702397,0.003754636,0.0012890722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048150477,0.00084743265,0.0053494414,0.0005294654,0.00013651745,0.0013886441,0.0058472743,0.16161996,0.06684743,0.3606113,0.01661865,0.37972242],"study_design_scores_gemma":[0.00012977599,0.00039803283,0.0008630237,0.00017134435,0.00008445079,0.0006842515,0.00039330916,0.75993156,0.0546982,0.07595878,0.10650418,0.00018318128],"about_ca_topic_score_codex":0.0035091413,"about_ca_topic_score_gemma":0.002817642,"teacher_disagreement_score":0.0046003005,"about_ca_system_score_codex":0.0013562171,"about_ca_system_score_gemma":0.0028751297,"threshold_uncertainty_score":0.0213812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39210218,0.0007403046,0.59855324,0.0011124373,0.00012273867,0.00011150156,0.00012819159,0.0028471702,0.0042821765],"genre_scores_gemma":[0.9687146,0.0001121724,0.029904418,0.00024943321,0.000024357414,0.00004390627,0.000028420107,0.00007937725,0.0008433426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99479926,0.0024430398,0.0003143489,0.00045792406,0.0014526,0.00053281203],"domain_scores_gemma":[0.98043907,0.0073459563,0.0019875504,0.008963493,0.0010753222,0.00018868092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003393921,0.000590624,0.00077762903,0.00058345695,0.000622606,0.0013027205,0.0012632627,0.0011635204,0.0013085565],"category_scores_gemma":[0.017717816,0.0005241663,0.0008510031,0.00051235507,0.0019810928,0.0046721976,0.0018478349,0.0016843227,0.0003368762],"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.0017601503,0.00033508762,0.0122474525,0.000335907,0.00042742823,0.000657102,0.0009241224,0.5239976,0.0731404,0.27237734,0.0045369575,0.10926049],"study_design_scores_gemma":[0.000068173926,0.0005686931,0.0005463063,0.000053627984,0.00008318177,0.00037041123,0.0000801049,0.88335776,0.06605648,0.045419358,0.0033325981,0.000063287334],"about_ca_topic_score_codex":0.0005659916,"about_ca_topic_score_gemma":0.0006778351,"teacher_disagreement_score":0.003393921,"about_ca_system_score_codex":0.0010630408,"about_ca_system_score_gemma":0.0010399865,"threshold_uncertainty_score":0.017948985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06295443,0.00048048244,0.7756108,0.0025906642,0.00052955165,0.00020592238,0.00010246696,0.005226557,0.1522991],"genre_scores_gemma":[0.5325141,0.00077106786,0.3703166,0.0010725227,0.00012645812,0.00019174279,0.00025020164,0.0021450054,0.09261236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782926,0.00067325303,0.00017025425,0.00030711739,0.0007934289,0.0002267764],"domain_scores_gemma":[0.9893623,0.0038010438,0.0003270478,0.005428881,0.0008576243,0.00022309528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038596308,0.00045454162,0.0004646759,0.0007225898,0.0013398909,0.006009284,0.001953299,0.002416491,0.008329872],"category_scores_gemma":[0.0115187485,0.00084066263,0.0007160505,0.00087007094,0.003210706,0.016717577,0.003910882,0.0040840236,0.0024250862],"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.00014601242,0.00017617297,0.0016753143,0.0001340224,0.000015508655,0.0005552825,0.002207618,0.009447148,0.008851736,0.8249373,0.005380602,0.14647333],"study_design_scores_gemma":[0.000027462627,0.00022206141,0.0012520767,0.00034291524,0.00009160819,0.0016578084,0.0011266685,0.14145984,0.06088407,0.61499566,0.17783625,0.00010350489],"about_ca_topic_score_codex":0.0010608424,"about_ca_topic_score_gemma":0.00139827,"teacher_disagreement_score":0.008329872,"about_ca_system_score_codex":0.001086997,"about_ca_system_score_gemma":0.001048263,"threshold_uncertainty_score":0.027866185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12593602,0.0006804071,0.85359645,0.0009496785,0.0005472303,0.00016046777,0.0002335162,0.0049531343,0.012943099],"genre_scores_gemma":[0.9800633,0.00008670912,0.016480656,0.00012651755,0.00005225458,0.000035022695,0.00006610009,0.00009710211,0.0029923508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980665,0.00032656497,0.00007249511,0.0003852026,0.0005452904,0.0006040456],"domain_scores_gemma":[0.99642676,0.0012329652,0.00030363814,0.0012945107,0.00044101677,0.00030113218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031603,0.00062199036,0.00086210034,0.00067413045,0.0014531541,0.0030572948,0.0016188079,0.001049475,0.0057474445],"category_scores_gemma":[0.0065871133,0.0003666853,0.00047385995,0.000525393,0.0021201195,0.0036209815,0.004284563,0.0019543746,0.0004900881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019244156,0.00031526596,0.0057845498,0.0002344107,0.000108041226,0.00090704946,0.0005962795,0.35511264,0.02600156,0.4226149,0.014330872,0.17207006],"study_design_scores_gemma":[0.000034565655,0.00012579787,0.00046266115,0.000021845137,0.000026607226,0.00012961596,0.000093598246,0.90998596,0.0068587223,0.07786733,0.0043521,0.000041295174],"about_ca_topic_score_codex":0.0027535367,"about_ca_topic_score_gemma":0.0033206993,"teacher_disagreement_score":0.0057474445,"about_ca_system_score_codex":0.0015651039,"about_ca_system_score_gemma":0.0020745392,"threshold_uncertainty_score":0.019227087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81372076,0.0013881724,0.07028535,0.0007717863,0.0007201493,0.00089497527,0.0052907513,0.079381526,0.027546523],"genre_scores_gemma":[0.904885,0.0005075097,0.069628626,0.0004420056,0.000035800065,0.0003575992,0.013918204,0.0047878493,0.005437424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516714,0.0011475474,0.00043719748,0.0005933933,0.0018446118,0.00081016024],"domain_scores_gemma":[0.9916367,0.0024459693,0.0006702908,0.002644988,0.0019551879,0.0006468015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038675775,0.0015582051,0.0005885342,0.0014085101,0.0007189165,0.0014925053,0.0031235416,0.00095821416,0.0026081882],"category_scores_gemma":[0.010745756,0.0006874478,0.0008202431,0.0014209815,0.0021050812,0.0028730158,0.0021741053,0.0021082035,0.0012839589],"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.0052401843,0.0040472737,0.06419896,0.0030735582,0.0008331687,0.0018082072,0.0019239762,0.40466604,0.11913087,0.03173214,0.16217782,0.20116784],"study_design_scores_gemma":[0.00035779743,0.0021956337,0.019449905,0.00014500928,0.000084113715,0.00041293155,0.00056294614,0.8070476,0.12838884,0.0049563507,0.03621851,0.0001803904],"about_ca_topic_score_codex":0.008829672,"about_ca_topic_score_gemma":0.006837211,"teacher_disagreement_score":0.008829672,"about_ca_system_score_codex":0.0019504274,"about_ca_system_score_gemma":0.0016662246,"threshold_uncertainty_score":0.02045399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032743156,0.00036774063,0.9538591,0.000193374,0.00011400116,0.00021549402,0.00007411522,0.005237136,0.0071959],"genre_scores_gemma":[0.76804465,0.00026526878,0.21921271,0.00016666512,0.00007269771,0.00011658859,0.0002342914,0.00021926237,0.011667915],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989184,0.0002003611,0.00007267887,0.00022670266,0.00040546493,0.00017640743],"domain_scores_gemma":[0.9990584,0.000119769735,0.0000872902,0.00039083316,0.00026941282,0.000074304546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009249833,0.0003654285,0.00062843924,0.0006917191,0.00077058753,0.0014498518,0.0014804715,0.00054271444,0.0035394884],"category_scores_gemma":[0.001140293,0.00021148776,0.0005310162,0.00042092477,0.0006067927,0.0023929167,0.0014875195,0.0010021596,0.0006649259],"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.001070749,0.00087829307,0.005357121,0.0005395048,0.0002797621,0.000955528,0.0006630883,0.07867669,0.16008861,0.11647497,0.013057428,0.6219582],"study_design_scores_gemma":[0.000053928372,0.0002688433,0.0012095681,0.000063272964,0.00011119641,0.0006740661,0.00020437506,0.892178,0.058358517,0.027218373,0.019592999,0.00006695639],"about_ca_topic_score_codex":0.0024440608,"about_ca_topic_score_gemma":0.004404964,"teacher_disagreement_score":0.0035394884,"about_ca_system_score_codex":0.00067306735,"about_ca_system_score_gemma":0.0018103893,"threshold_uncertainty_score":0.01184082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45742702,0.0031498906,0.48998204,0.0018310125,0.0006732326,0.000648658,0.00040131988,0.01904287,0.026843926],"genre_scores_gemma":[0.96468586,0.00017018664,0.032511417,0.0003535363,0.00005403908,0.00007302763,0.00012078804,0.00015659035,0.001874556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969014,0.00066113373,0.00019896832,0.00043042953,0.0011752904,0.0006328585],"domain_scores_gemma":[0.9935494,0.0013971427,0.0009075338,0.003145453,0.0007659763,0.00023459348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014968779,0.00078779575,0.0006022717,0.00082281156,0.00082183763,0.001408802,0.0013475624,0.00094981736,0.0027960541],"category_scores_gemma":[0.0063506276,0.00034947324,0.00044857292,0.00035546132,0.0011489775,0.0028842858,0.002159404,0.0017280089,0.0009944997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021017636,0.0006107778,0.023489704,0.00086639187,0.00044386662,0.0011292711,0.0009582308,0.08620921,0.34904608,0.11254137,0.025287881,0.3973155],"study_design_scores_gemma":[0.000118893775,0.002238832,0.0048949905,0.0001784303,0.00030208786,0.0020535705,0.00060344295,0.4978363,0.41187745,0.03661051,0.04310533,0.0001801456],"about_ca_topic_score_codex":0.00051844673,"about_ca_topic_score_gemma":0.0009000371,"teacher_disagreement_score":0.0027960541,"about_ca_system_score_codex":0.0007020684,"about_ca_system_score_gemma":0.001564382,"threshold_uncertainty_score":0.009353757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148205245,0.00020624018,0.96840835,0.0001695806,0.00008723944,0.00013400379,0.0009482281,0.0075320983,0.007693716],"genre_scores_gemma":[0.31110027,0.000612746,0.66504776,0.00028191853,0.00009260653,0.001036485,0.0028114058,0.0033831722,0.015633615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.000082084174,0.000038262275,0.000063276755,0.00014872075,0.00004985242],"domain_scores_gemma":[0.99952817,0.00021551849,0.000041092626,0.00010417779,0.00008133874,0.00002970443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000648869,0.0009096733,0.0004111144,0.00055015757,0.00043823334,0.0015304091,0.0019775857,0.0011781821,0.006477416],"category_scores_gemma":[0.0018947653,0.00062016485,0.0013156803,0.00034920248,0.0015130183,0.0025693497,0.0013582011,0.0014534607,0.0015354113],"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.00020471217,0.000075433396,0.0032088861,0.00047307156,0.00008182573,0.0004378686,0.0006692308,0.46500927,0.0123324655,0.46312588,0.011135614,0.043245696],"study_design_scores_gemma":[0.00006731997,0.00007304399,0.00039640925,0.00006510312,0.000043622385,0.000157411,0.000069702255,0.73905593,0.011681272,0.17136198,0.07698959,0.000038554157],"about_ca_topic_score_codex":0.0020448987,"about_ca_topic_score_gemma":0.0019430973,"teacher_disagreement_score":0.006477416,"about_ca_system_score_codex":0.0008958439,"about_ca_system_score_gemma":0.0012028173,"threshold_uncertainty_score":0.02166909},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42947885,0.04305582,0.009505275,0.0019598594,0.0009034016,0.001053162,0.0061619007,0.0021193335,0.50576234],"genre_scores_gemma":[0.94956565,0.008060806,0.0058302954,0.00086149736,0.0003023076,0.00022776109,0.0016885826,0.00007546095,0.03338755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998803,0.000012869232,0.000010989638,0.000036559777,0.000041248284,0.000017976923],"domain_scores_gemma":[0.9998584,0.000021974362,0.00005628694,0.000010996064,0.00003432257,0.000017987486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007337132,0.00066443364,0.0002359839,0.0011635066,0.0012397647,0.0004972625,0.0004481855,0.00038494787,0.016140193],"category_scores_gemma":[0.00032907142,0.00022863591,0.00011415764,0.0005865996,0.00036574496,0.00068166305,0.0005692917,0.00057198125,0.0027534175],"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.00075192703,0.00014831341,0.060207237,0.0018558945,0.00007688017,0.005229512,0.00220116,0.0005582994,0.06553913,0.002756824,0.046499386,0.8141754],"study_design_scores_gemma":[0.00020883771,0.00035977262,0.37488922,0.0016423757,0.00021918047,0.018883193,0.0030358396,0.0011098069,0.009581104,0.0018789517,0.5881137,0.00007799046],"about_ca_topic_score_codex":0.011129248,"about_ca_topic_score_gemma":0.02273936,"teacher_disagreement_score":0.016140193,"about_ca_system_score_codex":0.0006513567,"about_ca_system_score_gemma":0.00059704424,"threshold_uncertainty_score":0.053994298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058418703,0.00009037876,0.00012326997,0.00003697073,0.000012834886,0.000015562862,0.9928941,0.00030076192,0.00068439054],"genre_scores_gemma":[0.0027431925,0.00004553233,0.00033868896,0.000013051952,0.0000028259713,0.000044913413,0.9962521,0.000034861845,0.00052481744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993462,0.000059969083,0.00008024551,0.00022792182,0.00018791587,0.00009772907],"domain_scores_gemma":[0.9992848,0.00013420888,0.00009922648,0.00015841353,0.00024639748,0.00007705248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695243,0.0013206701,0.00065339607,0.003904332,0.0004811076,0.00078852056,0.0008504968,0.0009765727,0.008067591],"category_scores_gemma":[0.0017503134,0.00033267753,0.0006609471,0.0051405816,0.00035318447,0.0003739373,0.0009319165,0.0006878502,0.013209123],"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.00096221344,0.00027138117,0.057481248,0.0035962916,0.00041354416,0.0007263784,0.00047421554,0.00551922,0.007434303,0.001103039,0.8825731,0.03944507],"study_design_scores_gemma":[0.00027583216,0.00008163629,0.13712987,0.0003735759,0.00010400196,0.00033272503,0.00046390205,0.001811359,0.0051381877,0.0008579222,0.8533247,0.00010632107],"about_ca_topic_score_codex":0.046593186,"about_ca_topic_score_gemma":0.067494676,"teacher_disagreement_score":0.046593186,"about_ca_system_score_codex":0.000975706,"about_ca_system_score_gemma":0.0013097023,"threshold_uncertainty_score":0.092643976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99562305,0.00017146656,0.0001641201,0.0002766809,0.000047809426,0.000011649199,0.00021551423,0.00004589486,0.0034437075],"genre_scores_gemma":[0.99724174,0.000084651896,0.00029825987,0.00016294859,0.00002264507,0.0000035722026,0.00029460966,0.0000100172665,0.0018815921],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99985194,0.000004861059,0.000011786251,0.000058592777,0.00002444603,0.000048343998],"domain_scores_gemma":[0.9997769,0.0000066252996,0.00005511133,0.000015780251,0.000008442227,0.00013721154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000840075,0.0004674521,0.00060809305,0.0004278671,0.0006053587,0.00091355335,0.00063004374,0.0011488841,0.0034470966],"category_scores_gemma":[0.000293672,0.0002569567,0.0002596217,0.00048876385,0.00058636593,0.00066751486,0.0008477148,0.0006441345,0.0020507406],"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.00071751163,0.00071547535,0.8635432,0.00017778554,0.0000805508,0.04986277,0.0014065275,0.0003421785,0.037280936,0.0014791625,0.004467404,0.039926562],"study_design_scores_gemma":[0.000120885925,0.002463135,0.7898975,0.00006585712,0.00009308437,0.1671872,0.0053416025,0.0011530006,0.0042179516,0.0020352467,0.02734765,0.000076946984],"about_ca_topic_score_codex":0.0034380695,"about_ca_topic_score_gemma":0.007166781,"teacher_disagreement_score":0.0034470966,"about_ca_system_score_codex":0.0004596368,"about_ca_system_score_gemma":0.00018973406,"threshold_uncertainty_score":0.011531651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054723023,0.00003423565,0.000012964395,0.00009408149,0.000022519987,0.000016285483,0.99888843,0.000034183515,0.0008425978],"genre_scores_gemma":[0.000798214,0.00025531993,0.00030527211,0.00014126487,0.000017152759,0.00019319616,0.99285126,0.000088028944,0.005350368],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954615,0.0002684016,0.0005487123,0.0005538503,0.0020984372,0.0010690425],"domain_scores_gemma":[0.9589348,0.0014399103,0.001138186,0.0010697143,0.03541972,0.0019976129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025045422,0.0024272741,0.002809604,0.0075624036,0.0036052987,0.0050400286,0.005627727,0.0014828906,0.10699353],"category_scores_gemma":[0.019720161,0.0018150106,0.0019288531,0.040829297,0.00066253985,0.0024197865,0.0023592152,0.0033811585,0.06484012],"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.000024375233,0.00000836511,0.0010791325,0.00021856643,0.0000135304235,0.000006747708,0.000025383195,0.0000810464,0.000008155086,0.00021023137,0.99693066,0.001393769],"study_design_scores_gemma":[0.0002312263,0.000014649227,0.039143283,0.0010339483,0.00006442783,0.00002511749,0.00064753107,0.0002659701,0.00017604967,0.00051109906,0.95780396,0.00008289227],"about_ca_topic_score_codex":0.9934141,"about_ca_topic_score_gemma":0.9908407,"teacher_disagreement_score":0.10699353,"about_ca_system_score_codex":0.05581123,"about_ca_system_score_gemma":0.13228244,"threshold_uncertainty_score":0.40494066},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07519277,0.00026354258,0.8072241,0.0006888501,0.00028275233,0.0003239018,0.000471881,0.10559122,0.0099609485],"genre_scores_gemma":[0.37029675,0.0001968977,0.60868937,0.000561337,0.000058829486,0.0002184499,0.0010611119,0.011020531,0.007896648],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99685353,0.0007644831,0.0003865441,0.00038433642,0.001240397,0.00037073108],"domain_scores_gemma":[0.98885113,0.0032935855,0.00079327205,0.0045534563,0.0023133953,0.00019520147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025047031,0.00071200787,0.00041286522,0.0010221944,0.00043027397,0.0017221605,0.0016661723,0.00067291886,0.005146931],"category_scores_gemma":[0.011771284,0.00069048256,0.00077523803,0.00065450347,0.0009836836,0.0028566169,0.0018705968,0.001816496,0.0018666087],"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.0012584297,0.00069427997,0.01421854,0.001451497,0.00014679787,0.00087768136,0.002245154,0.046682563,0.2557153,0.055730455,0.03305566,0.58792365],"study_design_scores_gemma":[0.00015770781,0.000496262,0.0038439764,0.00027470363,0.00014648834,0.00060413626,0.00029992627,0.35206056,0.5103386,0.017898498,0.113732845,0.00014626846],"about_ca_topic_score_codex":0.001347506,"about_ca_topic_score_gemma":0.0024533523,"teacher_disagreement_score":0.005146931,"about_ca_system_score_codex":0.0008991585,"about_ca_system_score_gemma":0.0021853757,"threshold_uncertainty_score":0.017218173},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03812721,0.0004956994,0.93194187,0.00066964154,0.00016423986,0.00016215234,0.00061443896,0.0032293377,0.024595391],"genre_scores_gemma":[0.6435516,0.0007892507,0.33437547,0.00035148798,0.00020149504,0.0001794797,0.0012732171,0.0007857809,0.01849233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796045,0.00032659815,0.00015104964,0.00032476318,0.0009460323,0.000291125],"domain_scores_gemma":[0.9971969,0.0012285145,0.00017457138,0.00048826291,0.00078594935,0.00012562063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026889532,0.0005640069,0.00061044074,0.0020010541,0.001602735,0.003234295,0.0014725906,0.000615512,0.008741702],"category_scores_gemma":[0.0076262495,0.0005053318,0.0019016414,0.0015407836,0.0016150445,0.0054276744,0.0017011265,0.001496223,0.0009483601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021024658,0.000090215326,0.0026629886,0.00018465564,0.00005463233,0.0003291416,0.00042120332,0.04219663,0.0050646053,0.8561888,0.0051617427,0.08743505],"study_design_scores_gemma":[0.000046059522,0.000041017083,0.0009392146,0.00010548731,0.00007142231,0.00015793307,0.000093439914,0.36941373,0.011012644,0.5868394,0.031236662,0.00004307179],"about_ca_topic_score_codex":0.00996531,"about_ca_topic_score_gemma":0.007744836,"teacher_disagreement_score":0.00996531,"about_ca_system_score_codex":0.0027592753,"about_ca_system_score_gemma":0.003547636,"threshold_uncertainty_score":0.029243946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19775634,0.0030897118,0.7294754,0.0015244666,0.0009586773,0.00026983637,0.00046755787,0.012730503,0.053727526],"genre_scores_gemma":[0.6927694,0.002672512,0.24137643,0.00034184003,0.00016384006,0.00010132627,0.0010789392,0.0011075928,0.060388092],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999257,0.00010374111,0.00006416931,0.00013473968,0.00034853915,0.000091748916],"domain_scores_gemma":[0.99792445,0.00037387095,0.00016981433,0.0010145116,0.00045463568,0.0000627102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087172195,0.00046800185,0.0003203618,0.0010171584,0.00041054434,0.0012388481,0.0004981276,0.000765827,0.007461498],"category_scores_gemma":[0.0026398783,0.00049180386,0.00048635298,0.0006723355,0.00039634955,0.002887256,0.00079298374,0.00095227244,0.0030309614],"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.00058644667,0.0002184621,0.0036617161,0.00082078873,0.000067859684,0.0012116181,0.0005896792,0.0045129005,0.24234705,0.07696343,0.025612667,0.6434074],"study_design_scores_gemma":[0.00010902628,0.001189959,0.0076314816,0.000649931,0.0002840671,0.0046450715,0.00025307457,0.05586905,0.62745297,0.045527678,0.2562797,0.00010791363],"about_ca_topic_score_codex":0.0003537998,"about_ca_topic_score_gemma":0.00051070366,"teacher_disagreement_score":0.007461498,"about_ca_system_score_codex":0.00036357378,"about_ca_system_score_gemma":0.00047219882,"threshold_uncertainty_score":0.024961174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23268285,0.0012470671,0.73746663,0.00047966331,0.00022203925,0.00028183757,0.00020315898,0.01595698,0.011459748],"genre_scores_gemma":[0.7644518,0.00046761267,0.22405294,0.00049129105,0.00016574001,0.00047357165,0.00024497634,0.0012183024,0.008433685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998052,0.00041115825,0.00025400543,0.00034742648,0.0006353791,0.00030005115],"domain_scores_gemma":[0.99465346,0.00092843315,0.00096436596,0.002586296,0.0006490403,0.00021843184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016621968,0.00082632573,0.0007910802,0.0014415372,0.0008379386,0.0017979933,0.0023132514,0.0007593723,0.0028029415],"category_scores_gemma":[0.0055020815,0.00052430615,0.00052394194,0.0007798861,0.0015826065,0.0035069978,0.004249253,0.00096532534,0.0014479851],"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.0023709126,0.00039710855,0.02573893,0.00066565035,0.0001871086,0.0005210419,0.0020034579,0.033140317,0.20613943,0.1565576,0.013988698,0.55828977],"study_design_scores_gemma":[0.0002530618,0.0012536905,0.004872243,0.0002380944,0.0003340416,0.0013329756,0.00035924208,0.37593272,0.45362708,0.05887541,0.10263994,0.00028153276],"about_ca_topic_score_codex":0.00042301568,"about_ca_topic_score_gemma":0.00056986825,"teacher_disagreement_score":0.0028029415,"about_ca_system_score_codex":0.00077245757,"about_ca_system_score_gemma":0.001499977,"threshold_uncertainty_score":0.009376764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012381807,0.00030387938,0.0005489054,0.012683752,0.007392944,0.00019612501,0.006223423,0.0017097138,0.96970314],"genre_scores_gemma":[0.002260394,0.00007232436,0.00018277945,0.0019281971,0.00020853792,0.000027019787,0.0015051705,0.0002862189,0.99352926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987631,0.000067825866,0.000021259657,0.000095140254,0.0006578565,0.0003948071],"domain_scores_gemma":[0.9977278,0.00016627277,0.000059868536,0.00012382673,0.000906568,0.001015742],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016572501,0.0009066941,0.00046997314,0.0010515597,0.00226965,0.0057638716,0.00088249997,0.0044821417,0.5934747],"category_scores_gemma":[0.0032951792,0.00039558555,0.00069327437,0.00045368448,0.0004558755,0.0015155453,0.0017905436,0.0034174966,0.5167203],"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.000063847096,0.00002346833,0.00009216437,0.00001109678,0.0000013776564,0.000028552608,0.0000060736256,0.000023284498,0.00016972878,0.0011727944,0.9907883,0.0076194042],"study_design_scores_gemma":[0.000031562813,0.000039270628,0.0006917061,0.000025529966,0.0000029321334,0.000021104657,0.000052602758,0.00013941196,0.0004000231,0.0007298188,0.99785775,0.0000083243385],"about_ca_topic_score_codex":0.020344606,"about_ca_topic_score_gemma":0.04213727,"teacher_disagreement_score":0.4065253,"about_ca_system_score_codex":0.0017863886,"about_ca_system_score_gemma":0.004171579,"threshold_uncertainty_score":0.579859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36614862,0.0078559425,0.004085739,0.038090054,0.0016940176,0.000060914383,0.0002950079,0.000119651915,0.58165014],"genre_scores_gemma":[0.91127056,0.0014862063,0.00047971593,0.0009579555,0.00020046505,0.000019225245,0.000044355646,0.000059414895,0.085482225],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994417,0.00019787885,0.000010689478,0.000057650483,0.00017539022,0.000116713454],"domain_scores_gemma":[0.9991233,0.00053302065,0.00007784214,0.000043397256,0.00010868011,0.0001137845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422988,0.00032592705,0.00021498631,0.0006449786,0.011137316,0.0025149002,0.00045144552,0.0008022961,0.00423119],"category_scores_gemma":[0.0018398628,0.0001498937,0.00010710162,0.00063624606,0.013874265,0.0015110306,0.0017331558,0.0015004963,0.00032455497],"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.00010612503,0.000013734391,0.0030122332,0.00015604147,0.000006260598,0.001367876,0.62093943,0.00020627548,0.0017069564,0.3114271,0.04032061,0.020737415],"study_design_scores_gemma":[0.0000031145385,0.000021192518,0.004314896,0.00012462283,0.0000068131526,0.0004890726,0.10254877,0.00015427292,0.00070668716,0.0047545787,0.88685924,0.000016846383],"about_ca_topic_score_codex":0.21248548,"about_ca_topic_score_gemma":0.4430919,"teacher_disagreement_score":0.21248548,"about_ca_system_score_codex":0.015506689,"about_ca_system_score_gemma":0.0026664827,"threshold_uncertainty_score":0.4224974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99838436,0.00043798244,0.00018165575,0.00002039587,0.0000039636334,0.000038035883,0.00042591587,0.00000505947,0.0005027727],"genre_scores_gemma":[0.9977451,0.0004481243,0.00038082703,0.000038714505,0.000008551953,0.00008529104,0.00060795073,0.000003947418,0.0006815456],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985114,0.00045846394,0.00013279897,0.00030897954,0.00024882503,0.0003395273],"domain_scores_gemma":[0.99861634,0.0003321747,0.0005954874,0.00012587913,0.0001980455,0.00013199924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018789056,0.00034369918,0.00047020457,0.0009438067,0.0004320014,0.0007816684,0.00035394996,0.00049015816,0.0017545443],"category_scores_gemma":[0.003416711,0.0004879434,0.00095959095,0.0011758332,0.00044748833,0.00044029055,0.00052539626,0.00038224872,0.0005408726],"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.00026178925,0.000023428029,0.99333125,0.00003232812,0.000073435345,0.00018580994,0.00032430686,0.00014737237,0.00023702532,0.000027468146,0.00008447126,0.0052712923],"study_design_scores_gemma":[0.000015348325,0.000873933,0.9972543,0.000037114212,0.00006628924,0.00035527936,0.00046083832,0.00013673356,0.00019453096,0.00001680544,0.00057792425,0.000010961716],"about_ca_topic_score_codex":0.043708988,"about_ca_topic_score_gemma":0.06716468,"teacher_disagreement_score":0.043708988,"about_ca_system_score_codex":0.0010224447,"about_ca_system_score_gemma":0.0009865913,"threshold_uncertainty_score":0.086909115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06240854,0.0018357215,0.0021420987,0.016496493,0.0005353087,0.000056524743,0.0039335852,0.00047514925,0.9121167],"genre_scores_gemma":[0.5469671,0.0027521555,0.0017028314,0.0064288857,0.000102363134,0.000024542796,0.0017967268,0.0003945534,0.4398309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809366,0.000054439253,0.000030689618,0.00012964245,0.0010668201,0.00062473654],"domain_scores_gemma":[0.99643695,0.000279958,0.00012743539,0.00020813206,0.0025849214,0.0003626974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008302831,0.00054558256,0.0002973146,0.0031721126,0.0052052382,0.0055075972,0.00086214923,0.0010912863,0.036772117],"category_scores_gemma":[0.0045655956,0.00023191118,0.00064264756,0.0036122634,0.002138489,0.0017326478,0.0018897373,0.0024072016,0.0029923622],"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.00023619946,0.000039617444,0.01685384,0.00014751327,0.00006813211,0.0003800856,0.0012277823,0.0010730299,0.002014973,0.6400171,0.2179254,0.12001639],"study_design_scores_gemma":[0.000019696357,0.000025818326,0.013998325,0.00023039378,0.000044038865,0.00019274295,0.0022725773,0.0011087921,0.0042925966,0.018480541,0.95928746,0.000047135596],"about_ca_topic_score_codex":0.9439284,"about_ca_topic_score_gemma":0.96131414,"teacher_disagreement_score":0.05607158,"about_ca_system_score_codex":0.029282713,"about_ca_system_score_gemma":0.049959883,"threshold_uncertainty_score":0.21246195},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031394567,0.06212255,0.0040091723,0.62232643,0.009610449,0.00004724207,0.00011713606,0.00008496017,0.27028745],"genre_scores_gemma":[0.84497684,0.043469187,0.0021530052,0.05407233,0.00549857,0.0001307761,0.00013936784,0.0002688454,0.049291085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.993978,0.0046918415,0.00008806525,0.0002899906,0.0003134757,0.0006385311],"domain_scores_gemma":[0.9932312,0.00478902,0.0002932033,0.0004471204,0.0004986286,0.0007409085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008871535,0.0008133236,0.0005981438,0.0018193395,0.011810455,0.0120600555,0.0014310367,0.0052976212,0.010149805],"category_scores_gemma":[0.008722616,0.00031749034,0.00033414314,0.0023434253,0.0713647,0.0162871,0.0061314055,0.007593092,0.00113513],"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.000040003146,0.00004386135,0.0015512214,0.00024871956,0.000014875047,0.0005634004,0.40499467,0.0002184505,0.0001221957,0.49674988,0.06608243,0.029370291],"study_design_scores_gemma":[0.000015580992,0.000028975486,0.0017094251,0.00072990364,0.000007880114,0.00018759747,0.30259308,0.00016072221,0.0000688673,0.21338129,0.4810887,0.000027940041],"about_ca_topic_score_codex":0.061303787,"about_ca_topic_score_gemma":0.056511234,"teacher_disagreement_score":0.061303787,"about_ca_system_score_codex":0.010889572,"about_ca_system_score_gemma":0.009377712,"threshold_uncertainty_score":0.12189394},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011306124,0.003402196,0.0015031571,0.0055079055,0.0007480617,0.00020953626,0.023145221,0.0011589412,0.9530187],"genre_scores_gemma":[0.02989193,0.001700901,0.00166331,0.00050553697,0.00004064737,0.000042045576,0.0048333816,0.00043092563,0.9608914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992157,0.000023478833,0.00001661902,0.000106044456,0.00042754345,0.00021054372],"domain_scores_gemma":[0.99787176,0.00007758768,0.00007033013,0.000120289165,0.0012740104,0.0005860691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044311563,0.00061709806,0.00043655073,0.00149753,0.009123516,0.0048188795,0.000840257,0.0008511896,0.27555454],"category_scores_gemma":[0.0014147924,0.00052661507,0.00036240226,0.0041710585,0.0012866411,0.0011709465,0.0015625985,0.00082928373,0.06540734],"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.00014407521,0.000032347052,0.0054400344,0.0002487083,0.000016758624,0.0003043777,0.00069756724,0.00024139383,0.00080935995,0.011059676,0.9000209,0.08098468],"study_design_scores_gemma":[0.000008774154,0.000008042821,0.011506233,0.00006975856,0.0000041205476,0.00006352037,0.0005605469,0.00011361536,0.00033002195,0.00032983755,0.9869899,0.00001552142],"about_ca_topic_score_codex":0.97076595,"about_ca_topic_score_gemma":0.9929629,"teacher_disagreement_score":0.27555454,"about_ca_system_score_codex":0.026722698,"about_ca_system_score_gemma":0.05939499,"threshold_uncertainty_score":0.9218218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58908343,0.0018319947,0.2505081,0.00054573215,0.0003677693,0.00027499872,0.014647798,0.0069820876,0.13575807],"genre_scores_gemma":[0.7431889,0.0006724513,0.10992711,0.00011651806,0.000033047687,0.00014500492,0.010620651,0.0020704675,0.13322589],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990433,0.000043515036,0.000028333416,0.00018072934,0.0005692172,0.00013484272],"domain_scores_gemma":[0.9987877,0.00011805531,0.000054078737,0.00013828756,0.00085909304,0.000042824293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069567154,0.00076444785,0.0004438389,0.0033070275,0.0027837881,0.0022829368,0.0008074547,0.0007280532,0.011255387],"category_scores_gemma":[0.001449662,0.00043378177,0.00069144106,0.00236403,0.0013778816,0.00085377187,0.0005108711,0.0006523342,0.0027945854],"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.002392741,0.000200976,0.062265627,0.0008487988,0.00033560768,0.0023701084,0.0064997077,0.07172112,0.48670727,0.09663391,0.042523917,0.22750022],"study_design_scores_gemma":[0.00009333712,0.00020641596,0.08053628,0.000197246,0.00021962369,0.0017127846,0.0044071046,0.09355527,0.4341466,0.015702752,0.3690385,0.00018401207],"about_ca_topic_score_codex":0.5840379,"about_ca_topic_score_gemma":0.6341692,"teacher_disagreement_score":0.4159621,"about_ca_system_score_codex":0.008191535,"about_ca_system_score_gemma":0.0059032454,"threshold_uncertainty_score":0.8368236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015379641,0.0024740712,0.0018455479,0.025562197,0.01257028,0.00018815344,0.006189958,0.0025635874,0.9470683],"genre_scores_gemma":[0.0054869032,0.0013905847,0.00047700695,0.0012500342,0.00064145244,0.000029000674,0.0029412906,0.00037499183,0.98740876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673444,0.00018884339,0.000098948796,0.00029355806,0.0022403146,0.00044378857],"domain_scores_gemma":[0.9864611,0.0015344147,0.0006606614,0.00092507707,0.0076791155,0.00273958],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003118969,0.0009538675,0.0006856328,0.0024973976,0.0024218282,0.0074241934,0.0011454523,0.0025404138,0.4370895],"category_scores_gemma":[0.010027407,0.00045386594,0.00049757806,0.0018114875,0.0010228169,0.0033774197,0.002367725,0.0025025192,0.36262506],"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.000057734782,0.00003514968,0.00040411932,0.000036756006,0.000003534408,0.000059120615,0.000017310576,0.000045700905,0.00016957986,0.004950297,0.9683948,0.025825778],"study_design_scores_gemma":[0.000014059416,0.000022427,0.00030891717,0.000051383573,0.000005049765,0.000063453204,0.000073814605,0.00022902412,0.00073428435,0.00089823495,0.9975903,0.000009050696],"about_ca_topic_score_codex":0.004434645,"about_ca_topic_score_gemma":0.0124604795,"teacher_disagreement_score":0.4370895,"about_ca_system_score_codex":0.0021319534,"about_ca_system_score_gemma":0.0056225765,"threshold_uncertainty_score":0.8029235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597919,0.0002804148,0.008816313,0.0008744422,0.00012353907,0.026243139,0.000086497195,0.00013149536,0.0036522343],"genre_scores_gemma":[0.8373912,0.0015778424,0.108111925,0.0005781498,0.000120744015,0.0494012,0.00020087928,0.000043018666,0.0025750191],"study_design_codex":"design_other","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.99737,0.0010954461,0.0002161536,0.00024820116,0.00067030266,0.000399872],"domain_scores_gemma":[0.9983896,0.0006550933,0.00014188702,0.00013310366,0.00021973063,0.00046065182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072946413,0.0007067669,0.00068384537,0.0010675814,0.0011237888,0.0009547399,0.0013522389,0.0012344591,0.0025604495],"category_scores_gemma":[0.0055682347,0.0004882828,0.0010928754,0.00041484018,0.00076223287,0.0010529933,0.0019621581,0.0019178679,0.00027124304],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056383614,0.2471791,0.010591232,0.0030877583,0.00016691994,0.00060175563,0.009490362,0.0016865311,0.023566462,0.0017001495,0.001405645,0.6948856],"study_design_scores_gemma":[0.07418548,0.5575289,0.23764451,0.0034638706,0.0021231147,0.0015430787,0.01564649,0.014489187,0.053654585,0.004254979,0.035114385,0.00035136603],"about_ca_topic_score_codex":0.0016289054,"about_ca_topic_score_gemma":0.0024133401,"teacher_disagreement_score":0.0072946413,"about_ca_system_score_codex":0.0008754285,"about_ca_system_score_gemma":0.0055510937,"threshold_uncertainty_score":0.038578212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99405706,0.00026359397,0.001040388,0.00007985453,0.00004575276,0.00008538714,0.00009905686,0.00003612011,0.004292649],"genre_scores_gemma":[0.996179,0.00021948761,0.001416171,0.000118513475,0.000044219625,0.00007130621,0.0001401131,0.00003575002,0.0017754913],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99868554,0.0005144728,0.000088631474,0.0001688891,0.00038509048,0.00015743653],"domain_scores_gemma":[0.9786744,0.015326557,0.0022162474,0.0008740248,0.0014075857,0.0015012049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011862377,0.00035921522,0.00022072798,0.00028676985,0.00034596934,0.0010370298,0.00039692468,0.0003628918,0.005751604],"category_scores_gemma":[0.02039313,0.0001509164,0.0002623874,0.00021480415,0.00047494756,0.0007745712,0.0007722743,0.0009886652,0.00028543654],"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.030038735,0.0060688145,0.13050546,0.0016983459,0.0005756934,0.0007677723,0.00813124,0.0038961316,0.5539382,0.0016142025,0.0020419264,0.2607235],"study_design_scores_gemma":[0.00047240197,0.017543236,0.90036386,0.0003208682,0.00051086623,0.0004419598,0.0030541273,0.0031335717,0.06893173,0.0011995952,0.0039386717,0.00008911327],"about_ca_topic_score_codex":0.0017860791,"about_ca_topic_score_gemma":0.0018866082,"teacher_disagreement_score":0.005751604,"about_ca_system_score_codex":0.00047552923,"about_ca_system_score_gemma":0.00022414565,"threshold_uncertainty_score":0.019241035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99283314,0.0004190692,0.0026663265,0.00069246,0.000023055092,0.00004973431,0.0010478063,0.000013751314,0.002254636],"genre_scores_gemma":[0.99589634,0.00022942678,0.0009923376,0.000048677295,0.00001306957,0.00010685822,0.0006103336,0.000010934519,0.002091984],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998154,0.0008871564,0.00007612797,0.0003117528,0.0002311328,0.0003398336],"domain_scores_gemma":[0.9966403,0.0015224073,0.0009747951,0.0003517007,0.00021261796,0.00029809278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024450459,0.00041800912,0.0005178018,0.0009288329,0.0010270601,0.0029836854,0.0008454556,0.000757481,0.010940413],"category_scores_gemma":[0.004633418,0.00032907585,0.0014849791,0.0015989153,0.0011436478,0.001432656,0.0022233117,0.0015126213,0.00082515803],"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.00022038181,0.00012592848,0.96785694,0.00009296485,0.00036387806,0.0000775325,0.0102652,0.00027936508,0.00047781947,0.0030489925,0.00052351836,0.016667513],"study_design_scores_gemma":[0.000008818624,0.000121953715,0.9836158,0.00011108408,0.00015883315,0.00009585631,0.010054464,0.0016795447,0.00020391682,0.001684895,0.0022474276,0.00001733526],"about_ca_topic_score_codex":0.048570704,"about_ca_topic_score_gemma":0.036851577,"teacher_disagreement_score":0.048570704,"about_ca_system_score_codex":0.0014832303,"about_ca_system_score_gemma":0.0022043786,"threshold_uncertainty_score":0.096575975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07984556,0.0033337784,0.8433291,0.008144528,0.0012231703,0.00017735484,0.0004387088,0.0024342574,0.061073463],"genre_scores_gemma":[0.92004794,0.0014432713,0.06398338,0.00062036247,0.0006375273,0.00019577601,0.00019767162,0.0001640347,0.012709913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727505,0.0005393279,0.00018580479,0.0006941797,0.000875945,0.00042968694],"domain_scores_gemma":[0.9895711,0.004614017,0.00086114375,0.0036804555,0.0009663503,0.00030690533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022074464,0.0007615943,0.0012922081,0.0013537826,0.0013515352,0.0030192437,0.0011179902,0.001656522,0.00683942],"category_scores_gemma":[0.012087363,0.00054369145,0.0008834612,0.0010172704,0.004849695,0.006695305,0.0031616616,0.0038319153,0.0021525056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005072682,0.00004152494,0.00039483298,0.00034474878,0.000056700952,0.00024126083,0.00026420155,0.013471491,0.010914458,0.9186585,0.0065055187,0.048599474],"study_design_scores_gemma":[0.00006119031,0.00013471223,0.00030131856,0.0000806326,0.00008123362,0.0006110322,0.0000622648,0.025204336,0.009229805,0.9520163,0.0121714445,0.00004574432],"about_ca_topic_score_codex":0.00036985715,"about_ca_topic_score_gemma":0.0001934766,"teacher_disagreement_score":0.00683942,"about_ca_system_score_codex":0.0011887256,"about_ca_system_score_gemma":0.0012956077,"threshold_uncertainty_score":0.022880137},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041972317,0.057963282,0.0025996268,0.6808195,0.004608799,0.000016172004,0.00007025602,0.00010937429,0.21184067],"genre_scores_gemma":[0.86288047,0.012175128,0.00096553034,0.07016751,0.0042697,0.00003975513,0.000033352768,0.00012928376,0.049339306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904027,0.006966402,0.00008715193,0.00049389765,0.0010288676,0.0010210766],"domain_scores_gemma":[0.99547786,0.00313732,0.00033711598,0.000115500996,0.00063546636,0.00029669038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007257193,0.0008246353,0.00061191246,0.0022336205,0.015147008,0.0137200225,0.001053891,0.011587675,0.0039957114],"category_scores_gemma":[0.008698827,0.0003143867,0.0005978918,0.0011377259,0.022286924,0.0051938896,0.0030059472,0.0079118,0.00068843877],"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.000048682065,0.000011182405,0.00041687954,0.000050945728,0.000010941349,0.00036049596,0.04141681,0.0001401849,0.000120462384,0.8827956,0.0664576,0.008170237],"study_design_scores_gemma":[0.000019729998,0.000031434203,0.0010695296,0.0003069789,0.000012855069,0.00027118466,0.03499139,0.00032989308,0.00036834044,0.06988649,0.89266187,0.000050255192],"about_ca_topic_score_codex":0.057923358,"about_ca_topic_score_gemma":0.040619817,"teacher_disagreement_score":0.057923358,"about_ca_system_score_codex":0.019386519,"about_ca_system_score_gemma":0.0050153667,"threshold_uncertainty_score":0.14065969},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005765728,0.058657106,0.012701035,0.42655048,0.2696281,0.00024078766,0.0015364208,0.0017287208,0.2231917],"genre_scores_gemma":[0.02978662,0.015240458,0.0031987778,0.026718091,0.031086262,0.000092520204,0.00059073133,0.0007569265,0.89252967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977034,0.00043473733,0.000102299484,0.0006217489,0.00097576645,0.0001621435],"domain_scores_gemma":[0.9949185,0.0012623346,0.00023661905,0.0002740921,0.0027133645,0.0005950049],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019284869,0.0009038036,0.00095298677,0.0011725543,0.0020138398,0.0045607635,0.00088471005,0.0024942837,0.07921624],"category_scores_gemma":[0.008389969,0.00030712053,0.000451819,0.00063949975,0.0014364437,0.0029525892,0.0018503933,0.004236223,0.04684355],"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.00008241391,0.000015115024,0.00022615149,0.00010144134,0.000007545425,0.00023340377,0.00017301067,0.00012418308,0.0007282337,0.0065434775,0.94754326,0.044221845],"study_design_scores_gemma":[0.0000048477095,0.000011404103,0.00027661517,0.00004735379,0.0000020307543,0.00022848876,0.00009925804,0.00012132979,0.00037823195,0.00047411246,0.99834883,0.000007557129],"about_ca_topic_score_codex":0.0073671225,"about_ca_topic_score_gemma":0.0051478613,"teacher_disagreement_score":0.92078376,"about_ca_system_score_codex":0.0025126871,"about_ca_system_score_gemma":0.0017428983,"threshold_uncertainty_score":0.26500475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77954775,0.0009820363,0.11042451,0.0020319489,0.00051092246,0.00046757626,0.00033388886,0.0934936,0.012207749],"genre_scores_gemma":[0.97760606,0.00009608061,0.017147383,0.00015465205,0.00004711968,0.000051001658,0.00025404658,0.0008206161,0.0038230056],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900011,0.0019094573,0.00059360074,0.0013481928,0.003855356,0.002292216],"domain_scores_gemma":[0.9776799,0.0049759126,0.00093561894,0.009740186,0.0045398567,0.002128547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062407744,0.0012944321,0.0012330766,0.0013516756,0.003116682,0.0037571713,0.003310638,0.0018009816,0.008719174],"category_scores_gemma":[0.020492436,0.0012250055,0.0007298312,0.0022895345,0.0018994722,0.005545963,0.0032892053,0.002328859,0.005363769],"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.015906364,0.0024585526,0.06396976,0.00085408834,0.00072349276,0.0045784707,0.008338995,0.060858067,0.27288923,0.039813172,0.083521344,0.44608846],"study_design_scores_gemma":[0.0012628057,0.003013664,0.027169697,0.00013736736,0.00047282196,0.002743721,0.0027842533,0.59184235,0.290837,0.0105495015,0.068566754,0.0006200519],"about_ca_topic_score_codex":0.017083868,"about_ca_topic_score_gemma":0.01046196,"teacher_disagreement_score":0.017083868,"about_ca_system_score_codex":0.0040363288,"about_ca_system_score_gemma":0.0027159916,"threshold_uncertainty_score":0.033968866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934668,0.0004734974,0.0026754353,0.00005463897,0.000038813916,0.00004275398,0.00021963361,0.0005698609,0.0024585838],"genre_scores_gemma":[0.9960944,0.00014422834,0.0025904097,0.00002389746,0.000016593369,0.000022510345,0.00043616266,0.00007583452,0.00059592177],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980261,0.00028222264,0.00012688265,0.00023336442,0.0010291701,0.0003023124],"domain_scores_gemma":[0.9951958,0.0020065645,0.00055401836,0.0005148701,0.0013157363,0.0004130437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010974575,0.00079821487,0.0005243929,0.0014385688,0.0004302783,0.0011339152,0.00095380517,0.0005356475,0.000962849],"category_scores_gemma":[0.0070335823,0.00025516425,0.00023685556,0.0014830438,0.0005237552,0.0015065616,0.0007324175,0.0006485991,0.00048256537],"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.011683056,0.0037264614,0.2246132,0.00096126675,0.0005016142,0.00073038536,0.001482773,0.20830132,0.20804664,0.003717105,0.010502184,0.32573402],"study_design_scores_gemma":[0.00015024525,0.01256661,0.18037939,0.00008984542,0.00019859722,0.0005057282,0.00109503,0.585143,0.21233568,0.001297979,0.006050765,0.00018706688],"about_ca_topic_score_codex":0.0027584066,"about_ca_topic_score_gemma":0.0017355484,"teacher_disagreement_score":0.0027584066,"about_ca_system_score_codex":0.0008874849,"about_ca_system_score_gemma":0.00055373413,"threshold_uncertainty_score":0.0064391494},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054217335,0.017618863,0.00372582,0.017538488,0.0032477488,0.00011456348,0.012033203,0.0017206884,0.9385789],"genre_scores_gemma":[0.017648095,0.009175978,0.0021009091,0.00070629717,0.00021429606,0.00004788373,0.0029985772,0.00033718842,0.9667709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855286,0.00013456256,0.00007364832,0.00043927436,0.00056643336,0.00023317742],"domain_scores_gemma":[0.99698216,0.00049205654,0.00020518425,0.0002994141,0.0012016594,0.00081957976],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006119468,0.0014712722,0.0011274,0.0013777247,0.0039282865,0.0064579,0.0011763648,0.0021471453,0.5999477],"category_scores_gemma":[0.0032218273,0.0007059917,0.0005633429,0.0021297177,0.0014420019,0.0022497547,0.0024497723,0.0016780979,0.24701086],"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.00038539863,0.0000879725,0.0029031453,0.0012324784,0.00003438993,0.001317502,0.0012123758,0.00086616626,0.0016234262,0.05731873,0.7455543,0.18746413],"study_design_scores_gemma":[0.000025498673,0.00002631431,0.0014800319,0.00027913478,0.000013643746,0.00017981557,0.0003582892,0.00026510516,0.0004813748,0.004322428,0.992539,0.000029409955],"about_ca_topic_score_codex":0.14314511,"about_ca_topic_score_gemma":0.31089672,"teacher_disagreement_score":0.4000523,"about_ca_system_score_codex":0.00847326,"about_ca_system_score_gemma":0.010162403,"threshold_uncertainty_score":0.570626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035468403,0.00027542008,0.95322186,0.0001338333,0.000058757094,0.0000645126,0.0006685309,0.007381453,0.0027272103],"genre_scores_gemma":[0.6315666,0.0002982831,0.36045897,0.00019396002,0.00004037348,0.00010234787,0.0021346128,0.0011018906,0.0041030142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993704,0.00009969247,0.00004306074,0.00014406611,0.00025529013,0.00008759578],"domain_scores_gemma":[0.9985783,0.00042466147,0.00016243075,0.00044538957,0.00033688225,0.00005226657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008214129,0.00084656774,0.00064892345,0.0010032094,0.00029987583,0.0015494063,0.0016661857,0.00079188123,0.0031399226],"category_scores_gemma":[0.002565928,0.00046288542,0.0011875463,0.0007226655,0.00073884317,0.0039036532,0.0021841407,0.0011595179,0.0013051883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007852094,0.00034560007,0.013915982,0.00064973714,0.0002922397,0.0010812549,0.0008061443,0.38271004,0.07337006,0.09364332,0.010870165,0.42153016],"study_design_scores_gemma":[0.0000071587456,0.000058736285,0.0005954211,0.0000329669,0.000042589934,0.00013979999,0.000046681238,0.9486463,0.01653049,0.030582346,0.0032980735,0.000019396603],"about_ca_topic_score_codex":0.0037455007,"about_ca_topic_score_gemma":0.007554831,"teacher_disagreement_score":0.0037455007,"about_ca_system_score_codex":0.0007766089,"about_ca_system_score_gemma":0.001173056,"threshold_uncertainty_score":0.010504067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05120045,0.00060110225,0.9388809,0.00045543505,0.000102626334,0.00024870614,0.000042882486,0.0037355088,0.004732344],"genre_scores_gemma":[0.6939011,0.00075580453,0.29741573,0.00031581888,0.000115170784,0.00027843556,0.0001892088,0.00023618757,0.0067925886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988512,0.0002307811,0.00012922048,0.00022033029,0.00043959043,0.000128921],"domain_scores_gemma":[0.9980862,0.00026691833,0.00020020029,0.0009812893,0.00030945236,0.00015594767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017711477,0.000410143,0.00055963197,0.0005955501,0.0013671364,0.0026169007,0.0018397492,0.0011440428,0.0011753439],"category_scores_gemma":[0.0021913054,0.00053390884,0.00051754864,0.00059859577,0.0020541335,0.0041142665,0.0023509213,0.0020113278,0.0005993784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007614063,0.00048917136,0.0057866243,0.00039834788,0.00014551429,0.0010662406,0.0022125184,0.13069043,0.1017344,0.44505492,0.008994353,0.3026661],"study_design_scores_gemma":[0.00007594072,0.00046466614,0.0017003873,0.00011341029,0.0001344431,0.0007034775,0.00023907673,0.78777677,0.05134965,0.10784261,0.049464114,0.00013548513],"about_ca_topic_score_codex":0.0013268321,"about_ca_topic_score_gemma":0.0014398408,"teacher_disagreement_score":0.0026169007,"about_ca_system_score_codex":0.00086559,"about_ca_system_score_gemma":0.0012711097,"threshold_uncertainty_score":0.00936687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029740217,0.008725532,0.01730263,0.0016977284,0.0024519318,0.0005505224,0.022669954,0.021916535,0.9217112],"genre_scores_gemma":[0.0055119307,0.0035094335,0.002734148,0.0007613293,0.00018186666,0.00021931116,0.0119789,0.002835983,0.97226727],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991629,0.000061638755,0.000074187126,0.00024103129,0.00030282768,0.00015749497],"domain_scores_gemma":[0.998323,0.00036976452,0.0000855585,0.00061724026,0.00037032916,0.00023404867],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017509358,0.0035203747,0.002406906,0.0031553842,0.002554675,0.0044988175,0.0027010262,0.0046527004,0.9231937],"category_scores_gemma":[0.0033116797,0.0017581166,0.0013690379,0.008898031,0.0016005376,0.0107343225,0.0057053175,0.00292676,0.9477068],"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.0002943946,0.00014961053,0.00056689844,0.00066353,0.00005239527,0.00023193368,0.00010901829,0.00094509707,0.0015061931,0.00875097,0.64624673,0.34048313],"study_design_scores_gemma":[0.000036972433,0.000032427015,0.0007418711,0.00026820108,0.000049387138,0.00018231457,0.00006127623,0.0009936932,0.0006638307,0.0022420618,0.9946932,0.000034670797],"about_ca_topic_score_codex":0.017939182,"about_ca_topic_score_gemma":0.013312634,"teacher_disagreement_score":0.07680631,"about_ca_system_score_codex":0.002589964,"about_ca_system_score_gemma":0.0011720837,"threshold_uncertainty_score":0.10955477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34186643,0.009764185,0.52462554,0.01588785,0.00035846105,0.0006573293,0.0003380832,0.0008935118,0.10560861],"genre_scores_gemma":[0.9419336,0.004006748,0.047744084,0.00076492404,0.0001147843,0.00013145547,0.00016677572,0.00012575406,0.0050119925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9922861,0.0028247247,0.00040910192,0.0006579781,0.00277471,0.0010473978],"domain_scores_gemma":[0.96173227,0.024996514,0.0042246534,0.0036135085,0.0042770724,0.001155945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007336726,0.0009484094,0.00043261066,0.005119084,0.0022194795,0.006083905,0.0015262607,0.0028336763,0.0024440447],"category_scores_gemma":[0.02844049,0.0006938868,0.0009405468,0.0024607622,0.005648887,0.01317169,0.004821361,0.0045744656,0.00054364296],"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.00020096745,0.00022745597,0.038426865,0.0009018985,0.00008981009,0.002763822,0.011972379,0.046689365,0.0053100944,0.7763905,0.0069410424,0.110085785],"study_design_scores_gemma":[0.00003387708,0.0006133028,0.023438562,0.002283639,0.00018330962,0.008922427,0.024935884,0.29943886,0.017148823,0.49363127,0.12907428,0.00029572722],"about_ca_topic_score_codex":0.0033920489,"about_ca_topic_score_gemma":0.002050358,"teacher_disagreement_score":0.007336726,"about_ca_system_score_codex":0.0026567867,"about_ca_system_score_gemma":0.002472008,"threshold_uncertainty_score":0.038800776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034623226,0.00011991016,0.9836357,0.00025970617,0.00004496305,0.00029735814,0.0006265957,0.011979208,0.0026902338],"genre_scores_gemma":[0.022573061,0.00046617052,0.96524507,0.00025119918,0.00013955949,0.00081182417,0.0038584198,0.0027491301,0.0039056756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922078,0.0018883648,0.00087338506,0.0011712965,0.0034007803,0.00045838978],"domain_scores_gemma":[0.9879682,0.00391374,0.0008670532,0.004171645,0.0027088504,0.00037047916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008919628,0.002017289,0.0014783941,0.007654616,0.0017387907,0.0072640367,0.0066385847,0.0035117457,0.019821895],"category_scores_gemma":[0.01960919,0.0019621581,0.004318998,0.0045051817,0.0025262537,0.006304857,0.0071221637,0.00515861,0.014570722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113965696,0.0002931211,0.0022213908,0.000889614,0.00023868663,0.0009904709,0.00073736854,0.025332684,0.0057445085,0.73537886,0.031243978,0.1968153],"study_design_scores_gemma":[0.00009575645,0.00007915763,0.00079347304,0.0005656769,0.000110486304,0.00086115085,0.00026498537,0.27780488,0.008874835,0.4915029,0.21892923,0.00011747059],"about_ca_topic_score_codex":0.0046099834,"about_ca_topic_score_gemma":0.0044247992,"teacher_disagreement_score":0.019821895,"about_ca_system_score_codex":0.0018658014,"about_ca_system_score_gemma":0.004678988,"threshold_uncertainty_score":0.06631082},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44042882,0.2725962,0.09969684,0.033345725,0.0009773449,0.00067652104,0.0021807484,0.010665313,0.13943253],"genre_scores_gemma":[0.7378425,0.18165283,0.058876343,0.0047628987,0.0001939713,0.00033346008,0.0032301554,0.0021510292,0.010956851],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98075897,0.0037024324,0.002584834,0.0016445222,0.010112022,0.0011971955],"domain_scores_gemma":[0.89862466,0.06751242,0.012308655,0.0072704162,0.01287893,0.0014049372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012979126,0.0011325355,0.00061876356,0.011029054,0.0015887279,0.0048903483,0.0025337385,0.0020879454,0.002764463],"category_scores_gemma":[0.059901454,0.001139782,0.0009540429,0.009697878,0.0035758263,0.010838961,0.0041446,0.002230891,0.0015177911],"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.00023362516,0.00015176713,0.0637507,0.009238825,0.00015645621,0.0020981277,0.018095598,0.003319394,0.006925787,0.041508965,0.037667833,0.816853],"study_design_scores_gemma":[0.000020843852,0.00039234498,0.053443562,0.031197563,0.0005680612,0.013778109,0.0373255,0.006214345,0.02521619,0.026035335,0.8053036,0.0005045353],"about_ca_topic_score_codex":0.0043371073,"about_ca_topic_score_gemma":0.0050516776,"teacher_disagreement_score":0.012979126,"about_ca_system_score_codex":0.0022430622,"about_ca_system_score_gemma":0.0041225096,"threshold_uncertainty_score":0.06864095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121600494,0.000067966605,0.84956825,0.00023663999,0.000042087242,0.00033718237,0.000083099025,0.02538288,0.0026813198],"genre_scores_gemma":[0.5797981,0.0000546072,0.4154783,0.00017715055,0.00001079239,0.00026270052,0.00026211195,0.0016640713,0.0022923092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794585,0.00070139393,0.00012493227,0.00031974853,0.0007402016,0.00016786242],"domain_scores_gemma":[0.9920209,0.0032716554,0.0007251362,0.0029885622,0.0008608832,0.00013277287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025750753,0.0007628531,0.00040582826,0.0004954982,0.00031734264,0.0010318039,0.0015700946,0.0007351069,0.0014674768],"category_scores_gemma":[0.011470819,0.00057938165,0.00052537123,0.00016293189,0.00087205257,0.0013810956,0.0012904088,0.0011879434,0.00058010966],"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.0006944823,0.0007658004,0.015271583,0.00040869243,0.00015365142,0.00083300134,0.0022875653,0.39026824,0.18076383,0.026085956,0.006054056,0.37641317],"study_design_scores_gemma":[0.000046747973,0.00020707177,0.00070138584,0.000025802481,0.00003176539,0.00012399172,0.00007232759,0.897204,0.09164794,0.004226521,0.005682534,0.000029902983],"about_ca_topic_score_codex":0.0014303406,"about_ca_topic_score_gemma":0.0014087564,"teacher_disagreement_score":0.0025750753,"about_ca_system_score_codex":0.00074291945,"about_ca_system_score_gemma":0.0011030828,"threshold_uncertainty_score":0.01361841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14939164,0.0008807306,0.67901456,0.000982854,0.00015976522,0.0003789054,0.0019505159,0.1632878,0.003953205],"genre_scores_gemma":[0.5525535,0.0003229965,0.4321568,0.0005782517,0.000036738762,0.00024035576,0.004638038,0.00663829,0.0028350027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852645,0.0003174575,0.00007930392,0.00045115224,0.0005137784,0.00011184563],"domain_scores_gemma":[0.99406755,0.0035937661,0.00061900687,0.0012488373,0.0003515976,0.00011924191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012833275,0.0017944247,0.00067061436,0.002227722,0.0005898918,0.0011440074,0.0025922798,0.001529227,0.0028647631],"category_scores_gemma":[0.011118437,0.00097518275,0.0018887465,0.00072698935,0.0019269647,0.0031843039,0.0021168988,0.001844963,0.0008077949],"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.00082675234,0.00058462715,0.042748895,0.0011999272,0.0006337114,0.0010168694,0.0011746682,0.44633418,0.06607959,0.029996572,0.030719688,0.37868458],"study_design_scores_gemma":[0.00008038378,0.00015195519,0.0025397604,0.000058126207,0.00007326004,0.000271189,0.00007297393,0.94340074,0.021730736,0.026141316,0.005432202,0.000047400303],"about_ca_topic_score_codex":0.006304526,"about_ca_topic_score_gemma":0.011812692,"teacher_disagreement_score":0.006304526,"about_ca_system_score_codex":0.0013143044,"about_ca_system_score_gemma":0.0014600132,"threshold_uncertainty_score":0.012535691},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095258884,0.8007532,0.054612666,0.0131386565,0.00046112025,0.00089655793,0.0008245978,0.00018226141,0.03387202],"genre_scores_gemma":[0.6468663,0.3051151,0.041329574,0.003532851,0.00020381481,0.0006621225,0.00056169764,0.00009995344,0.0016285175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98093224,0.009805767,0.0024207807,0.0013913597,0.00482133,0.0006285501],"domain_scores_gemma":[0.857293,0.10962596,0.015488802,0.0056839013,0.010954266,0.00095405953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027599651,0.0005396018,0.00068349094,0.012368514,0.0010504778,0.0039090673,0.0011670592,0.0012000358,0.0016973199],"category_scores_gemma":[0.08831956,0.0005216761,0.0015883854,0.010192791,0.0036349348,0.007532929,0.002172365,0.002049725,0.00027021187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043371305,0.00012857284,0.032450218,0.07641001,0.0013549792,0.00074999337,0.013839649,0.0031256732,0.0031921677,0.1409253,0.0057533206,0.7216364],"study_design_scores_gemma":[0.00016014007,0.0017379335,0.07363328,0.21737863,0.0057702903,0.0045136,0.031663362,0.0067244614,0.012144575,0.10778211,0.538232,0.00025960832],"about_ca_topic_score_codex":0.0054785237,"about_ca_topic_score_gemma":0.006105676,"teacher_disagreement_score":0.027599651,"about_ca_system_score_codex":0.0040278938,"about_ca_system_score_gemma":0.011102804,"threshold_uncertainty_score":0.14596266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4608416,0.0005111943,0.5197913,0.0004270439,0.0000355734,0.00016665948,0.0005364157,0.008011,0.0096793],"genre_scores_gemma":[0.9100286,0.00011444353,0.08812442,0.000073855066,0.0000111366535,0.00006637078,0.00040281357,0.00024183672,0.0009364057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964663,0.00075707695,0.00014127848,0.0003954237,0.0018737486,0.00036622945],"domain_scores_gemma":[0.98866034,0.0069780457,0.0014338176,0.0015683296,0.0012111117,0.00014834358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024937738,0.00088978995,0.0006115795,0.0024510743,0.0005734865,0.0012984211,0.001011035,0.00090044923,0.0021749102],"category_scores_gemma":[0.014228203,0.0003606827,0.00094239466,0.0014268503,0.0019537339,0.0026847315,0.0012702697,0.0014243617,0.0003665361],"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.000610819,0.00042125653,0.047080517,0.00052953936,0.00019220686,0.0003190549,0.0006322893,0.65822387,0.08376746,0.039089695,0.0019307925,0.16720246],"study_design_scores_gemma":[0.000010452664,0.00014741793,0.0030144483,0.000032442833,0.000037434213,0.00009274056,0.00008052577,0.9450031,0.040438086,0.0102038765,0.000918249,0.000021185802],"about_ca_topic_score_codex":0.0040115505,"about_ca_topic_score_gemma":0.004060851,"teacher_disagreement_score":0.0040115505,"about_ca_system_score_codex":0.0015017621,"about_ca_system_score_gemma":0.001772504,"threshold_uncertainty_score":0.013188481},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051165897,0.15349828,0.32334006,0.282308,0.0066889776,0.0002779721,0.00045661692,0.0012668276,0.1809975],"genre_scores_gemma":[0.54543257,0.18331139,0.19441801,0.01951098,0.0072526624,0.0003098061,0.00037994495,0.00064524566,0.048739314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959234,0.0014264996,0.0002761016,0.00061358366,0.0013774675,0.00038292844],"domain_scores_gemma":[0.9864377,0.008871107,0.00034901677,0.0015453614,0.002129682,0.00066709873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059317523,0.001177925,0.00077289314,0.0017863357,0.0018762061,0.006270464,0.0030408332,0.0037870747,0.0072023002],"category_scores_gemma":[0.012261124,0.000722938,0.0008366678,0.0011273989,0.0096352035,0.018896556,0.003403581,0.009380844,0.0020409925],"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.000092097056,0.00028253684,0.0036344952,0.0018858715,0.00006791414,0.001352955,0.004273788,0.015324213,0.0021847533,0.61923933,0.029202996,0.322459],"study_design_scores_gemma":[0.00003290216,0.00025497167,0.0016944426,0.0021300472,0.000026146123,0.0013623692,0.0041741244,0.0151035655,0.0032907343,0.66658515,0.30519894,0.00014655874],"about_ca_topic_score_codex":0.0048956093,"about_ca_topic_score_gemma":0.0041146493,"teacher_disagreement_score":0.0072023002,"about_ca_system_score_codex":0.0027361535,"about_ca_system_score_gemma":0.0028342607,"threshold_uncertainty_score":0.03137046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37748727,0.00095394044,0.6052237,0.000545415,0.00020991113,0.0003003488,0.0011703924,0.0044402964,0.009668643],"genre_scores_gemma":[0.8771611,0.0006634536,0.105487734,0.00009234762,0.000039074817,0.00041079117,0.0010142426,0.00047941395,0.014651864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889475,0.00015806472,0.00006715797,0.00025023657,0.0005129228,0.00011691276],"domain_scores_gemma":[0.9985297,0.0006049348,0.00014951183,0.00021911773,0.0004282526,0.00006843486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822199,0.0010617939,0.0008684348,0.0008644327,0.0007807717,0.002564402,0.0014197634,0.0014507103,0.00557175],"category_scores_gemma":[0.003426418,0.000692228,0.0016491007,0.0006558982,0.00091511925,0.0022393388,0.0011266614,0.0012959322,0.0012313888],"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.00033383587,0.00014032106,0.012355681,0.00036672494,0.0001395746,0.00041491428,0.0006208322,0.8967609,0.04539214,0.011962421,0.0011496695,0.030363066],"study_design_scores_gemma":[0.000015350543,0.00017352666,0.0027719291,0.000022776467,0.00004302211,0.000093835144,0.00010272941,0.9718587,0.019055104,0.0024894304,0.0033373437,0.000036363734],"about_ca_topic_score_codex":0.011504055,"about_ca_topic_score_gemma":0.005787216,"teacher_disagreement_score":0.011504055,"about_ca_system_score_codex":0.0013984232,"about_ca_system_score_gemma":0.002021785,"threshold_uncertainty_score":0.022874177},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02413605,0.0020834515,0.00036462597,0.003051752,0.0010646532,0.00009646427,0.01330531,0.0005419997,0.9553558],"genre_scores_gemma":[0.017952282,0.0008624196,0.00028810333,0.0005101251,0.00004828752,0.00001666129,0.0031993662,0.00009582444,0.9770269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998733,0.0000046845475,0.0000037813236,0.00003810681,0.00004264359,0.000037442573],"domain_scores_gemma":[0.99980265,0.000012309015,0.0000137353645,0.00001700673,0.00007737355,0.00007699123],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009175515,0.0004993356,0.00018436658,0.00053330435,0.0012235438,0.0016566182,0.00042004054,0.0004828295,0.43753207],"category_scores_gemma":[0.00025393645,0.00021647285,0.00015576594,0.0005509274,0.00026366883,0.00081240607,0.0012048859,0.00066280004,0.12206748],"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.000099754616,0.000087744476,0.01748411,0.00017265863,0.000017100965,0.00084712176,0.00044120968,0.00010566657,0.002973965,0.0053030187,0.7206963,0.2517713],"study_design_scores_gemma":[0.000006477366,0.000011481641,0.014489531,0.000059536636,0.000003393426,0.00013330238,0.00053903717,0.000034358687,0.00018195985,0.00015850461,0.9843776,0.000004734014],"about_ca_topic_score_codex":0.13327713,"about_ca_topic_score_gemma":0.46244067,"teacher_disagreement_score":0.56246793,"about_ca_system_score_codex":0.0015885185,"about_ca_system_score_gemma":0.0018695742,"threshold_uncertainty_score":0.8022922},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076788766,0.0021635059,0.00045067092,0.002150809,0.0008994342,0.000106634834,0.008626943,0.0004984834,0.97742474],"genre_scores_gemma":[0.009133655,0.0010651854,0.00035306098,0.00041359762,0.000042409134,0.000024275907,0.0027007377,0.00012434533,0.9861428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997398,0.000012596038,0.0000092015125,0.00009237354,0.00008608724,0.00005992631],"domain_scores_gemma":[0.9997366,0.00002463734,0.00002010751,0.00002587626,0.00010943826,0.00008327229],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001663156,0.0009219263,0.0003024565,0.00076468283,0.0018496272,0.0024699173,0.0007282822,0.00085554726,0.65298164],"category_scores_gemma":[0.00043339844,0.00034373344,0.00024456228,0.0007065349,0.0004530717,0.0014179486,0.0017621315,0.0010827678,0.29464364],"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.00011987919,0.00013580025,0.006404703,0.00022014763,0.000015008246,0.0011759276,0.00043832677,0.00017827841,0.0018887956,0.010270737,0.6709356,0.30821684],"study_design_scores_gemma":[0.000008866915,0.000017955324,0.004927805,0.00009130352,0.000003861014,0.00014902993,0.0004155251,0.000048167567,0.0001521703,0.00036413284,0.9938146,0.0000066388916],"about_ca_topic_score_codex":0.08434303,"about_ca_topic_score_gemma":0.30402222,"teacher_disagreement_score":0.34701836,"about_ca_system_score_codex":0.0024741914,"about_ca_system_score_gemma":0.002415721,"threshold_uncertainty_score":0.49497956},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012930899,0.0025311944,0.00055284123,0.002147056,0.0010615183,0.00011959987,0.01438536,0.0007727006,0.9654988],"genre_scores_gemma":[0.012488923,0.00096646947,0.00041428115,0.00046122944,0.000045679135,0.000027620348,0.0032511374,0.00012432778,0.9822204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975544,0.000009960527,0.0000072214843,0.00006866121,0.00009369028,0.00006498921],"domain_scores_gemma":[0.9997187,0.000022979955,0.000014973734,0.000023055798,0.00013887344,0.00008130484],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017015821,0.000757071,0.00031588532,0.0007708009,0.0022827878,0.002118995,0.0010621389,0.0007758078,0.50647163],"category_scores_gemma":[0.00045598153,0.00030193158,0.00021712999,0.00082343473,0.00050449243,0.0010411424,0.0015132712,0.0009873704,0.15288748],"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.00021552369,0.00011876622,0.009329566,0.0002439743,0.00001803646,0.0018826658,0.0006456755,0.0001922242,0.0026701067,0.01140452,0.7356691,0.23760994],"study_design_scores_gemma":[0.000012792123,0.000026124142,0.008574437,0.0000972839,0.000004214852,0.00018609938,0.00063851074,0.000061520244,0.0003407941,0.00041339407,0.98963416,0.000010662503],"about_ca_topic_score_codex":0.24490678,"about_ca_topic_score_gemma":0.6825941,"teacher_disagreement_score":0.49352837,"about_ca_system_score_codex":0.0036243915,"about_ca_system_score_gemma":0.00392391,"threshold_uncertainty_score":0.7039583},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05690704,0.00741462,0.22773278,0.004118438,0.0007235867,0.00020779739,0.000658493,0.0054245563,0.6968126],"genre_scores_gemma":[0.73321307,0.010178091,0.03601117,0.0007232385,0.00040217678,0.00019083428,0.00081550184,0.00064218155,0.21782376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994766,0.00006939167,0.000027816915,0.00006981856,0.00029477273,0.00006167269],"domain_scores_gemma":[0.9989598,0.0003180481,0.000107743836,0.00041876343,0.00016456399,0.000031033982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004307404,0.0007229242,0.00028382518,0.0012429713,0.000627708,0.001698424,0.0004902418,0.0011012056,0.012713655],"category_scores_gemma":[0.002292365,0.00033111128,0.00036679738,0.00094156084,0.00098224,0.0027577353,0.0015286497,0.0014927194,0.0038638243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006595976,0.000054423523,0.00081897253,0.00030360563,0.000028047869,0.00088349055,0.0006761919,0.00522283,0.010222734,0.6309966,0.050520584,0.30020657],"study_design_scores_gemma":[0.000021438804,0.00011013089,0.0012406533,0.0005064185,0.00007600064,0.0062284074,0.000267919,0.016123194,0.024538796,0.4285317,0.5223075,0.00004767174],"about_ca_topic_score_codex":0.00030152485,"about_ca_topic_score_gemma":0.00038401852,"teacher_disagreement_score":0.012713655,"about_ca_system_score_codex":0.00061193085,"about_ca_system_score_gemma":0.0005784276,"threshold_uncertainty_score":0.04253137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043079756,0.00020866246,0.94610035,0.0010494344,0.00015039458,0.00045475064,0.0001703466,0.0018337929,0.006952567],"genre_scores_gemma":[0.64826703,0.00030610443,0.3474145,0.00028580765,0.00012156257,0.00036617005,0.00032095253,0.00047946715,0.0024382998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.93314594,0.039975297,0.002518074,0.003223319,0.01710854,0.0040288568],"domain_scores_gemma":[0.81567144,0.15472637,0.004657587,0.014073444,0.009600559,0.0012706708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035427317,0.0012299751,0.0014324295,0.0017106232,0.0022359276,0.007853537,0.0036904325,0.0022828802,0.006052996],"category_scores_gemma":[0.10832645,0.0010141714,0.0029268905,0.0011314583,0.006740522,0.011262675,0.0046543437,0.0036294558,0.0007862126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016851238,0.00088470284,0.0033079633,0.0010064675,0.00036908983,0.00041082612,0.00079852383,0.17038086,0.01211972,0.71545917,0.0042092935,0.089368254],"study_design_scores_gemma":[0.00040714882,0.00042760163,0.00035212937,0.00014727851,0.00023535018,0.00015472533,0.00026636632,0.5959326,0.057581894,0.33901164,0.005412827,0.00007039676],"about_ca_topic_score_codex":0.0021877717,"about_ca_topic_score_gemma":0.0015753275,"teacher_disagreement_score":0.035427317,"about_ca_system_score_codex":0.004895014,"about_ca_system_score_gemma":0.007754631,"threshold_uncertainty_score":0.18735981},"labels":[],"label_agreement":null}]}