{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":403,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":403,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"46938b97bdab","filters":{"topic":"Security and Verification in Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jalal Hawari","is_ca":true},{"name":"Sylvie Beaudet","is_ca":true},{"name":"Annamaria Halasz","is_ca":true},{"name":"Sonia Thiboutot","is_ca":false},{"name":"Guy Ampleman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0348044467777853,"gpt":0.2696225532612307,"spread":0.2348181064834454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665609,0.0009971705,0.00203094,0.001739273,0.0002889837,0.001472535,0.001259512,0.00168648,0.001428008],"category_scores_gemma":[0.0008588147,0.0004085032,0.0004070468,0.002826373,0.001006941,0.001764373,0.0005689044,0.0009577054,0.002122424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006626709,"about_ca_system_score_gemma":0.0007662603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016051,"about_ca_topic_score_gemma":0.002049738,"domain_scores_codex":[0.9996206,0.00003884187,0.0000449957,0.00008698247,0.0001808864,0.00002764818],"domain_scores_gemma":[0.9992678,0.0003568955,0.0001134867,0.00003802527,0.0001970541,0.00002675034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006334537,0.00007141059,0.0001876544,0.006711415,0.00004831141,0.0001862209,0.00005681183,0.0006026861,0.009344311,0.004948989,0.007342605,0.9704361],"study_design_scores_gemma":[0.00002542287,0.0002451645,0.001100103,0.001614964,0.000116844,0.003583994,0.0001453767,0.0006490368,0.01887609,0.006711151,0.9668838,0.00004800593],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0005378374,0.9960653,0.001386462,0.0002041983,0.0001723288,0.000004646177,0.00001146263,0.00001047557,0.001607344],"genre_scores_gemma":[0.003492282,0.9939056,0.0009409026,0.0001703375,0.0001963846,0.000007978713,0.0000241246,0.000003296201,0.001259175],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00203094,"threshold_uncertainty_score":0.004808009,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jakub Szefer","is_ca":false},{"name":"Eric Keller","is_ca":false},{"name":"Ruby B. Lee","is_ca":false},{"name":"Jennifer Rexford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1134163309189137,"gpt":0.2970785336339948,"spread":0.1836622027150811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001910955,0.000652383,0.0005584924,0.0007840433,0.001283216,0.004542061,0.001844823,0.001224282,0.007300708],"category_scores_gemma":[0.00597619,0.0005606442,0.0005890954,0.0002898531,0.00134932,0.006752939,0.005571357,0.002922098,0.003214622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008287521,"about_ca_system_score_gemma":0.002104473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001115178,"about_ca_topic_score_gemma":0.00139802,"domain_scores_codex":[0.9962943,0.0006179099,0.0002223538,0.0004687354,0.00161953,0.000777134],"domain_scores_gemma":[0.9937663,0.0006060186,0.0006524391,0.003194866,0.001154314,0.0006260988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001390738,0.002219733,0.01634593,0.0006819695,0.0002139011,0.001085675,0.001323901,0.01479562,0.2721904,0.07402709,0.05972413,0.5560009],"study_design_scores_gemma":[0.0005669593,0.002354243,0.02068135,0.0004339096,0.0002631273,0.002713346,0.0009161266,0.2900965,0.2742729,0.04242614,0.3648713,0.0004040373],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2398306,0.001609596,0.6273245,0.009234413,0.000889077,0.001726431,0.0002132397,0.05670199,0.06247018],"genre_scores_gemma":[0.7606953,0.0004036819,0.2203092,0.00301281,0.0002276628,0.0002419468,0.0003446417,0.001849392,0.01291527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007300708,"threshold_uncertainty_score":0.0244233,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lionel Litty","is_ca":true},{"name":"H. Andrés Lagar-Cavilla","is_ca":true},{"name":"David Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1085937034258301,"gpt":0.304664452298402,"spread":0.1960707488725719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210375,0.0005607535,0.0004027082,0.001183489,0.0004169674,0.001579616,0.001698882,0.0006827169,0.003126985],"category_scores_gemma":[0.007456655,0.0006274296,0.0002848162,0.0004362493,0.0008528588,0.003180238,0.001980466,0.0009993602,0.0008035984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005217002,"about_ca_system_score_gemma":0.0007301606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006738057,"about_ca_topic_score_gemma":0.0008502225,"domain_scores_codex":[0.9984655,0.0003125513,0.0001251272,0.0003248513,0.0005935898,0.0001784243],"domain_scores_gemma":[0.9923046,0.002124353,0.001079819,0.003223403,0.001029244,0.0002385562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005201413,0.0004512924,0.06402536,0.0007021268,0.0002768877,0.001580365,0.002151282,0.01706026,0.4067835,0.0240167,0.009705792,0.4680451],"study_design_scores_gemma":[0.0001650286,0.0006148557,0.01847357,0.0001414664,0.000127068,0.0012761,0.0002233142,0.3495001,0.6008346,0.009717742,0.01881558,0.0001104969],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.560579,0.0005406282,0.3342478,0.00032208,0.00009737644,0.0002905593,0.0005211582,0.09335621,0.01004523],"genre_scores_gemma":[0.9301316,0.0001191125,0.06627819,0.00007998469,0.00001977352,0.00006049116,0.0004943944,0.000725884,0.002090588],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003126985,"threshold_uncertainty_score":0.01046079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tal Garfinkel","is_ca":false},{"name":"Keith Adams","is_ca":false},{"name":"Andrew Warfield","is_ca":true},{"name":"Jason Franklin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0343666966614161,"gpt":0.2779749314557529,"spread":0.2436082347943368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005789592,0.0004528789,0.0005700953,0.001661441,0.001642591,0.004530523,0.001536528,0.003169722,0.004803601],"category_scores_gemma":[0.02543538,0.0005209558,0.0006023932,0.0005486818,0.01895626,0.01650089,0.003194836,0.006430889,0.0009532779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00141287,"about_ca_system_score_gemma":0.0007831536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007113612,"about_ca_topic_score_gemma":0.0003641751,"domain_scores_codex":[0.9956235,0.001328311,0.0002633842,0.0008434819,0.001598448,0.0003428033],"domain_scores_gemma":[0.9788179,0.01129903,0.001832264,0.004586786,0.00269986,0.000764191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003201306,0.00007278502,0.004143655,0.0002864488,0.00006976488,0.0007418325,0.002853738,0.001209703,0.009474529,0.8915343,0.01263095,0.07666206],"study_design_scores_gemma":[0.00005620261,0.0001376392,0.002825294,0.0002561834,0.00004948746,0.002692754,0.001601255,0.005868523,0.009711515,0.923182,0.05350944,0.0001096929],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1903764,0.02373687,0.310192,0.2939712,0.006684998,0.0001439357,0.0005206157,0.001633498,0.1727404],"genre_scores_gemma":[0.9429762,0.003023349,0.03598402,0.006769391,0.002170925,0.00008972421,0.00007649099,0.0002818844,0.008628024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005789592,"threshold_uncertainty_score":0.03061867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Richard Ta-Min","is_ca":true},{"name":"Lionel Litty","is_ca":true},{"name":"David Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03242877942569101,"gpt":0.3164687079170901,"spread":0.2840399284913991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008635397,0.001129542,0.0008463968,0.001017322,0.001572953,0.005482438,0.003478208,0.001587963,0.003253535],"category_scores_gemma":[0.02528889,0.001788683,0.0008860839,0.0005948949,0.005009961,0.01778289,0.009403234,0.004918159,0.001582325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758976,"about_ca_system_score_gemma":0.001898116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766984,"about_ca_topic_score_gemma":0.001127067,"domain_scores_codex":[0.9911129,0.002933053,0.0008757403,0.001408626,0.002556052,0.001113675],"domain_scores_gemma":[0.9696829,0.005073175,0.003097126,0.01838197,0.002244601,0.001520155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002022868,0.0004448905,0.01798228,0.0005517398,0.0002391014,0.001259075,0.009709566,0.03751914,0.09898783,0.3038425,0.01347843,0.5139624],"study_design_scores_gemma":[0.0003593208,0.001126814,0.008318877,0.0004958655,0.0004935326,0.001414682,0.002009169,0.3243716,0.1327293,0.3930575,0.1350692,0.0005540977],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08930519,0.0008537316,0.8859607,0.001351679,0.0001827959,0.0003390386,0.00007210492,0.01011006,0.01182464],"genre_scores_gemma":[0.8446715,0.0004130932,0.1458501,0.0007238771,0.0001551955,0.0002468999,0.0001695105,0.002092963,0.005676965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008635397,"threshold_uncertainty_score":0.0456689,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Lie","is_ca":true},{"name":"Chandramohan A. Thekkath","is_ca":false},{"name":"Mark Horowitz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03508068956660935,"gpt":0.2828035630620673,"spread":0.2477228734954579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002225383,0.0005111792,0.0004571292,0.0004584562,0.0006602473,0.001660984,0.001735885,0.0005723223,0.001607409],"category_scores_gemma":[0.008516488,0.0006389639,0.000529429,0.0003097538,0.001487691,0.003559903,0.001880144,0.001547663,0.0006898814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007747174,"about_ca_system_score_gemma":0.001554879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009273603,"about_ca_topic_score_gemma":0.0007024521,"domain_scores_codex":[0.9969652,0.0007549594,0.0002273491,0.0002451366,0.001403549,0.0004037356],"domain_scores_gemma":[0.9928883,0.001596257,0.0008201199,0.003500956,0.0009864751,0.0002079886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003146534,0.0006661228,0.02450066,0.0007602038,0.0003518565,0.00244328,0.003479348,0.263417,0.2688934,0.1678292,0.006724151,0.2577883],"study_design_scores_gemma":[0.0002526085,0.0009655051,0.002806342,0.0001421921,0.0001815448,0.0005921902,0.0002017649,0.7282256,0.2286992,0.01720842,0.02063953,0.00008510247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5386137,0.0004044389,0.4398222,0.0003477363,0.0001966083,0.0002360122,0.00005959783,0.01021603,0.01010367],"genre_scores_gemma":[0.8777259,0.0002045941,0.11918,0.00006452543,0.00003648362,0.00007054124,0.00006864007,0.000446572,0.002202692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002225383,"threshold_uncertainty_score":0.01176912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ashvin Goel","is_ca":true},{"name":"Kenneth Po","is_ca":true},{"name":"Kamran Farhadi","is_ca":true},{"name":"Zheng Li","is_ca":true},{"name":"Eyal de Lara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02358958566077081,"gpt":0.2759263164955433,"spread":0.2523367308347725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367512,0.001108904,0.001061522,0.00211113,0.0007009125,0.001793929,0.002479146,0.001120365,0.02380072],"category_scores_gemma":[0.007968464,0.0005764933,0.0008068109,0.0009820421,0.0005573207,0.003118895,0.002274972,0.001908591,0.01798085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007071097,"about_ca_system_score_gemma":0.001525214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001655202,"about_ca_topic_score_gemma":0.001323336,"domain_scores_codex":[0.9977738,0.0003150271,0.0002249929,0.000386877,0.001094729,0.000204454],"domain_scores_gemma":[0.9962197,0.0006794524,0.0005320421,0.001292314,0.001042627,0.0002339881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001543006,0.0004397187,0.004900611,0.00079446,0.0003237169,0.0008283486,0.0005209279,0.009704069,0.0283246,0.01731682,0.5413892,0.3939145],"study_design_scores_gemma":[0.0005812799,0.0007403714,0.005137674,0.00020441,0.0003541077,0.002258337,0.0001814371,0.2022971,0.06243306,0.0194644,0.7060868,0.0002609683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.0194096,0.001238298,0.1950313,0.001278704,0.000598917,0.001046831,0.00565653,0.7332612,0.04247862],"genre_scores_gemma":[0.4299773,0.003292813,0.3702267,0.004131034,0.0009306366,0.001575311,0.04051365,0.01987718,0.1294755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02380072,"threshold_uncertainty_score":0.07962137,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Checksum; Computer science; Tamper resistance; x86; Software; Operating system; Embedded system; Software engineering; Computer security","authors":[{"name":"Glenn Wurster","is_ca":true},{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Anil Somayaji","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05401537281976637,"gpt":0.2869693654017309,"spread":0.2329539925819645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264549,0.000895826,0.0008554062,0.001276027,0.0009510529,0.001197902,0.001254293,0.002471569,0.001816325],"category_scores_gemma":[0.004468444,0.000380535,0.001149984,0.0009537811,0.002165653,0.001742762,0.003012915,0.001824292,0.0006880783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005612786,"about_ca_system_score_gemma":0.0003995925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001832617,"about_ca_topic_score_gemma":0.0001261524,"domain_scores_codex":[0.9980668,0.0004164985,0.00008140655,0.0003152164,0.0007616014,0.0003585272],"domain_scores_gemma":[0.9962016,0.0008567228,0.0004867708,0.002138779,0.0002158059,0.000100314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006639824,0.0002344568,0.003747481,0.0004798979,0.0002493225,0.002954016,0.001074662,0.05346933,0.1978025,0.5553644,0.01159387,0.1723661],"study_design_scores_gemma":[0.0001865154,0.0007530528,0.002694151,0.0001887525,0.000246995,0.006811621,0.0001240202,0.4886864,0.2789628,0.1778734,0.04332148,0.0001508849],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088533,0.000753755,0.7433598,0.001483752,0.0002780879,0.0003497468,0.0002179682,0.009078898,0.03562466],"genre_scores_gemma":[0.9293732,0.0003565309,0.06478609,0.0004165534,0.00008280343,0.0001058781,0.00008769973,0.0001551389,0.004636091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002471569,"threshold_uncertainty_score":0.006076217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ashvin Goel","is_ca":true},{"name":"Kenneth Po","is_ca":true},{"name":"Kamran Farhadi","is_ca":true},{"name":"Zheng Li","is_ca":true},{"name":"Eyal de Lara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01142202898362927,"gpt":0.224880850135831,"spread":0.2134588211522017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002074132,0.001088133,0.0009903366,0.001881409,0.000656752,0.001665538,0.002394764,0.001091053,0.02123587],"category_scores_gemma":[0.007541054,0.0005600183,0.0007909958,0.0008583872,0.0006131285,0.002980438,0.002195107,0.001789361,0.01383812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006645553,"about_ca_system_score_gemma":0.001359144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001506755,"about_ca_topic_score_gemma":0.00116966,"domain_scores_codex":[0.997938,0.0002957173,0.0002125966,0.0003796147,0.0009843917,0.0001896345],"domain_scores_gemma":[0.996366,0.0006946292,0.0005179979,0.001314782,0.0008967126,0.0002098494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001914469,0.0005435405,0.0063478,0.000875982,0.0003862831,0.001025286,0.0006366138,0.01490202,0.04487683,0.02208022,0.4529577,0.4534533],"study_design_scores_gemma":[0.0006165968,0.000882627,0.005655958,0.0001966123,0.0003799074,0.002678515,0.000191771,0.284511,0.09654637,0.02227894,0.5857617,0.0003000126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.02437614,0.0009372209,0.2373567,0.001030747,0.0004691302,0.0009403112,0.004819888,0.6959175,0.03415234],"genre_scores_gemma":[0.4758667,0.002096193,0.3788335,0.00292772,0.0006277418,0.001250065,0.02849144,0.0159559,0.09395075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02123587,"threshold_uncertainty_score":0.07104111,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Godfrey","is_ca":true},{"name":"Mohammad Zulkernine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02479099729971626,"gpt":0.250895570407359,"spread":0.2261045731076427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577123,0.0006339955,0.0009592281,0.0008038094,0.001444719,0.00189479,0.001579431,0.001119588,0.001283837],"category_scores_gemma":[0.006345051,0.0003634927,0.0005217884,0.0008683007,0.00147133,0.003383764,0.001764089,0.001604527,0.0004611913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088228,"about_ca_system_score_gemma":0.00234621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002378474,"about_ca_topic_score_gemma":0.002399189,"domain_scores_codex":[0.9966928,0.0007467965,0.000179248,0.0002559568,0.001396431,0.000728737],"domain_scores_gemma":[0.9877685,0.003445305,0.00171253,0.0043643,0.002293751,0.0004156047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003704126,0.001453072,0.0221573,0.0007228497,0.0005216938,0.001969166,0.001521267,0.2065645,0.3995572,0.09367777,0.01291761,0.2552335],"study_design_scores_gemma":[0.0001366107,0.0006972546,0.001550996,0.00007305733,0.0001632693,0.0007588632,0.0002155847,0.6982119,0.2824486,0.009222836,0.006442115,0.00007898364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4971311,0.001592798,0.4863806,0.001045047,0.0001967256,0.0003214732,0.0001078941,0.004619704,0.00860465],"genre_scores_gemma":[0.9713435,0.0001668277,0.02736592,0.0001180992,0.00002972882,0.00003633669,0.00002733849,0.00006801314,0.000844133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002378474,"threshold_uncertainty_score":0.008340716,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Buffer overflow; Software; Buffer (optical fiber); Operating system; Telecommunications","authors":[{"name":"Kelvin Ku","is_ca":true},{"name":"Thomas E. Hart","is_ca":true},{"name":"Marsha Chećhik","is_ca":true},{"name":"David Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03086025562768321,"gpt":0.2862900344783689,"spread":0.2554297788506857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004925265,0.001638577,0.000713795,0.002580502,0.000879965,0.001134303,0.002683463,0.001064251,0.002696539],"category_scores_gemma":[0.01829492,0.0006594675,0.001072745,0.003808682,0.0008950143,0.002070996,0.001372028,0.001524951,0.0004235004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001575618,"about_ca_system_score_gemma":0.001982941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009278229,"about_ca_topic_score_gemma":0.01176068,"domain_scores_codex":[0.9942493,0.002415256,0.0005383376,0.0006174166,0.001615835,0.0005638152],"domain_scores_gemma":[0.9832696,0.01023388,0.0007259289,0.002834927,0.00251714,0.0004185422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002770544,0.002941917,0.03041736,0.002345137,0.0006712827,0.001349082,0.001159083,0.6287056,0.03726474,0.05231623,0.07952482,0.1605343],"study_design_scores_gemma":[0.0007838737,0.0008234967,0.006393041,0.0001276158,0.0001529692,0.0002856087,0.0002241279,0.904572,0.04356623,0.0231737,0.0198175,0.00007980762],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8196279,0.001812507,0.1194932,0.001012369,0.0002250156,0.0006464892,0.01142705,0.03211323,0.01364231],"genre_scores_gemma":[0.8377649,0.0005535943,0.1329025,0.0002325021,0.00004573242,0.0006377908,0.02283628,0.002414512,0.002612273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009278229,"threshold_uncertainty_score":0.02604759,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Suggs","is_ca":true},{"name":"Mahesh Subramony","is_ca":true},{"name":"Dan Bouvier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03420267875181875,"gpt":0.2520401742089486,"spread":0.2178374954571298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469544,0.000342755,0.0002338117,0.0002749022,0.0002718338,0.0005829234,0.0006914905,0.0003027522,0.0272832],"category_scores_gemma":[0.0006555482,0.0001909764,0.0001603479,0.0003785332,0.000158739,0.0005404725,0.0006248173,0.0005165624,0.005670263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004715116,"about_ca_system_score_gemma":0.001030129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562665,"about_ca_topic_score_gemma":0.002413347,"domain_scores_codex":[0.9996936,0.00003031511,0.00001320407,0.00006558813,0.0001425518,0.0000546865],"domain_scores_gemma":[0.9997994,0.00001503024,0.000008936295,0.00003327622,0.0001112937,0.00003196757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001716938,0.0002194668,0.003255247,0.0002717494,0.00006757204,0.000367914,0.0001352736,0.02008434,0.07279585,0.04437122,0.4432811,0.4134333],"study_design_scores_gemma":[0.0008361426,0.00137893,0.006249916,0.00006459455,0.00007323887,0.0009795767,0.00007939532,0.2066657,0.04946729,0.01448736,0.7196156,0.0001021739],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.213345,0.0026013,0.189313,0.002012013,0.001624034,0.0007695271,0.003831199,0.02865795,0.557846],"genre_scores_gemma":[0.684743,0.000699037,0.1208535,0.001121753,0.0002156725,0.0004908617,0.01029488,0.0005550463,0.1810263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0272832,"threshold_uncertainty_score":0.09127134,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Lie","is_ca":true},{"name":"Chandramohan A. Thekkath","is_ca":false},{"name":"Mark Horowitz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05117373143572124,"gpt":0.3171586654917876,"spread":0.2659849340560663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003085414,0.000448375,0.0004727201,0.0005841397,0.0006657845,0.001893402,0.00177944,0.0006307933,0.001413497],"category_scores_gemma":[0.01060105,0.000649853,0.0005593264,0.0003878551,0.00147451,0.004006052,0.001958688,0.001759892,0.0008030923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008810288,"about_ca_system_score_gemma":0.002054287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001068682,"about_ca_topic_score_gemma":0.0008011524,"domain_scores_codex":[0.9957067,0.001177572,0.000302139,0.0002752059,0.002026862,0.0005114942],"domain_scores_gemma":[0.9911378,0.001957439,0.001027551,0.004216454,0.00143144,0.0002292817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002249097,0.0005918413,0.01991219,0.001016113,0.0003808997,0.002213287,0.003220691,0.1890635,0.1857723,0.2253066,0.008727878,0.3615455],"study_design_scores_gemma":[0.0003451791,0.001186611,0.00345153,0.0003130678,0.0002882759,0.0009676521,0.0002966964,0.6977476,0.2165563,0.03185642,0.04687845,0.0001123169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4136006,0.001001017,0.5607339,0.0006258092,0.0002949047,0.0003081773,0.00005586478,0.009418928,0.01396092],"genre_scores_gemma":[0.8347155,0.0006116692,0.1604746,0.0001183136,0.00007416101,0.0001026933,0.00007945049,0.000453123,0.003370526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003085414,"threshold_uncertainty_score":0.01631743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Seongmin Kim","is_ca":true},{"name":"Youjung Shin","is_ca":true},{"name":"Jaehyung Ha","is_ca":true},{"name":"Taesoo Kim","is_ca":false},{"name":"Dongsu Han","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07230726937960268,"gpt":0.2768106275644536,"spread":0.2045033581848509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216493,0.0007898374,0.0004790892,0.0003977857,0.0007306364,0.003150973,0.002271206,0.0009941976,0.003853482],"category_scores_gemma":[0.006287637,0.0006928088,0.0006021087,0.0003747558,0.00135034,0.006783619,0.002765937,0.00331255,0.001343217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009820594,"about_ca_system_score_gemma":0.001894665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007552343,"about_ca_topic_score_gemma":0.001130292,"domain_scores_codex":[0.9976048,0.0007345707,0.0001574234,0.0002091289,0.0009386704,0.0003553585],"domain_scores_gemma":[0.9965443,0.0006518469,0.0003088797,0.001696823,0.0005955312,0.0002025874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00148387,0.0004379238,0.007233787,0.001123128,0.0001927795,0.001041527,0.001605908,0.09731219,0.1209099,0.5803801,0.01617722,0.1721016],"study_design_scores_gemma":[0.000280151,0.001840225,0.002072391,0.0005398097,0.0002327518,0.001326683,0.0006026037,0.3948066,0.1493692,0.1794827,0.2692638,0.0001831185],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147892,0.001625019,0.8435867,0.003293419,0.0004299812,0.0003571185,0.00008032244,0.006660997,0.02917709],"genre_scores_gemma":[0.5278392,0.0009746413,0.4618479,0.0005414798,0.0000989605,0.0001534946,0.000124123,0.0008892802,0.00753092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003853482,"threshold_uncertainty_score":0.01701063,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Anil Somayaji","is_ca":true},{"name":"Glenn Wurster","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0299179685823152,"gpt":0.2934950360866904,"spread":0.2635770675043752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909686,0.0003756307,0.0005218536,0.0005221275,0.0003829327,0.0004919521,0.001068181,0.0007716561,0.001243675],"category_scores_gemma":[0.00346305,0.000251199,0.0003643067,0.000365272,0.0009993522,0.001286404,0.00147736,0.0007881453,0.0004695314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002459675,"about_ca_system_score_gemma":0.0003338945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00010225,"about_ca_topic_score_gemma":0.0001352587,"domain_scores_codex":[0.9989035,0.0003065633,0.00007699503,0.0001096447,0.0004513034,0.00015194],"domain_scores_gemma":[0.9960337,0.0008214868,0.0005835881,0.002033904,0.0004538245,0.00007342995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008628275,0.0002530593,0.009573317,0.0006244627,0.0002295257,0.001843393,0.001159073,0.08091947,0.329573,0.1769655,0.00604122,0.3919551],"study_design_scores_gemma":[0.0001121477,0.001253516,0.003070869,0.00005672695,0.0001052217,0.002921531,0.0001082512,0.4142477,0.5350066,0.02375713,0.01927098,0.00008931469],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4298279,0.000571869,0.5559604,0.0003254191,0.0001181203,0.0001412389,0.00005185635,0.00281759,0.0101857],"genre_scores_gemma":[0.957526,0.0001129055,0.04020781,0.00006767068,0.00001988196,0.00002779812,0.00003394055,0.00004319275,0.001960813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001243675,"threshold_uncertainty_score":0.004160523,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Asem Ghaleb","is_ca":true},{"name":"Julia Rubin","is_ca":true},{"name":"Karthik Pattabiraman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04749461741768342,"gpt":0.3178266684592295,"spread":0.2703320510415461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137472,0.001530345,0.001045455,0.008394945,0.0006782105,0.001923218,0.001763792,0.001874757,0.002376172],"category_scores_gemma":[0.02175697,0.0007302823,0.001064532,0.002847091,0.001007244,0.005161496,0.003277915,0.001320739,0.001765404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009899428,"about_ca_system_score_gemma":0.002232655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006985037,"about_ca_topic_score_gemma":0.009384084,"domain_scores_codex":[0.9928307,0.001074728,0.0007963247,0.001529399,0.003268613,0.0005003337],"domain_scores_gemma":[0.9806892,0.008489138,0.002965286,0.004757352,0.002784893,0.0003142283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001470781,0.0007434454,0.2202842,0.001774829,0.00073982,0.00150194,0.001419756,0.04697757,0.04121878,0.0172983,0.05275002,0.6138207],"study_design_scores_gemma":[0.0001612182,0.0004175374,0.05195141,0.0003875741,0.0001962323,0.002311244,0.0006447454,0.7914445,0.09273493,0.02500963,0.03446515,0.0002758992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4067319,0.003759129,0.4158186,0.001110171,0.0002416731,0.0008122963,0.01435841,0.144959,0.0122088],"genre_scores_gemma":[0.7474486,0.0008758135,0.2285472,0.0004520714,0.00005641913,0.0002747236,0.01522831,0.001564618,0.005552145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008394945,"threshold_uncertainty_score":0.02188128,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eric Gartzke","is_ca":false},{"name":"Jon R. Lindsay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02604022618984251,"gpt":0.2805152282491508,"spread":0.2544750020593083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702372,0.0005101127,0.0004083246,0.0007284078,0.001279958,0.00431299,0.001022841,0.001073611,0.02090022],"category_scores_gemma":[0.002133957,0.0002449238,0.0004092426,0.0009438103,0.002500708,0.003494715,0.003762272,0.002564798,0.005409778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016043,"about_ca_system_score_gemma":0.001618928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247479,"about_ca_topic_score_gemma":0.002051702,"domain_scores_codex":[0.9986171,0.0003218816,0.00004428437,0.0001961966,0.0006832512,0.0001373261],"domain_scores_gemma":[0.9987815,0.000446323,0.0001105631,0.000231478,0.0003436379,0.00008644885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001456737,0.00003872363,0.0002930091,0.0002250139,0.000009277352,0.0001432253,0.001722185,0.00131828,0.0006749089,0.832158,0.04418308,0.1192197],"study_design_scores_gemma":[0.0000047944,0.00003228866,0.0004383557,0.0003634869,0.000007283871,0.0004083307,0.0006444801,0.001702474,0.001258222,0.07840826,0.9167186,0.00001346367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.006708345,0.007799041,0.02040446,0.002702034,0.0008189172,0.00006725547,0.00004561061,0.0001243254,0.96133],"genre_scores_gemma":[0.1471701,0.007146733,0.007245314,0.001945356,0.0004038744,0.0001196328,0.0001572358,0.0001384231,0.8356734],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02090022,"threshold_uncertainty_score":0.06991822,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shreya Agrawal","is_ca":true},{"name":"Borzoo Bonakdarpour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01451861681611869,"gpt":0.2142110994329634,"spread":0.1996924826168447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007008493,0.001000027,0.0007736112,0.001497915,0.001047257,0.003254822,0.002877929,0.001143729,0.003276645],"category_scores_gemma":[0.03053473,0.001324272,0.002871659,0.0009899932,0.003388084,0.007286256,0.004579221,0.003340398,0.0008699375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002411876,"about_ca_system_score_gemma":0.00446353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005758783,"about_ca_topic_score_gemma":0.007728996,"domain_scores_codex":[0.9906299,0.00214613,0.0009330272,0.001819631,0.003523784,0.0009475828],"domain_scores_gemma":[0.9688638,0.01719941,0.002754533,0.007161778,0.003602966,0.0004175152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001528743,0.0006507337,0.03481287,0.001486167,0.0004786175,0.002373283,0.002918074,0.2140666,0.1659772,0.2369914,0.008376529,0.3303397],"study_design_scores_gemma":[0.0001455862,0.0001931551,0.001433256,0.0001489023,0.000169231,0.0004086674,0.0002255259,0.7244029,0.1559371,0.1079428,0.008888554,0.0001042639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03693148,0.00009208712,0.9465415,0.00036645,0.00004785068,0.0001432697,0.0004103323,0.01398786,0.001479032],"genre_scores_gemma":[0.5369441,0.0001398568,0.4564998,0.0004846776,0.00006378691,0.0002722706,0.001428879,0.00256665,0.001599992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007008493,"threshold_uncertainty_score":0.03706491,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Overhead (engineering); Source code; Compiler; Solidity; Benchmark (surveying); Protocol (science); Code (set theory); Spec#","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0259987955944887,"gpt":0.227119602889423,"spread":0.2011208072949343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008552195,0.0008793536,0.0008367084,0.0008224494,0.0007415112,0.002028516,0.002168205,0.001075926,0.004354968],"category_scores_gemma":[0.03083392,0.0009641148,0.0008433794,0.0007054227,0.003021754,0.005211026,0.004442947,0.002396517,0.002094593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009121821,"about_ca_system_score_gemma":0.004143451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456661,"about_ca_topic_score_gemma":0.001149349,"domain_scores_codex":[0.9897994,0.002652666,0.0007037941,0.001004976,0.004698702,0.001140457],"domain_scores_gemma":[0.9704002,0.009392165,0.001997487,0.014831,0.002942859,0.0004364233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002451082,0.0005496444,0.02134449,0.0009183714,0.0002068639,0.001181572,0.002108027,0.1604777,0.1168427,0.2067639,0.02573766,0.461418],"study_design_scores_gemma":[0.0002629874,0.0004362742,0.002188014,0.0001816658,0.00006803098,0.0005609078,0.0002422622,0.6735033,0.1904336,0.08945023,0.04251486,0.0001577679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1135505,0.0002547599,0.8232349,0.0004960292,0.0001655129,0.0002396057,0.0002853835,0.054472,0.007301327],"genre_scores_gemma":[0.6686254,0.0001867293,0.3128498,0.0004038669,0.00006994888,0.0002889482,0.001000687,0.01111312,0.005461378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008552195,"threshold_uncertainty_score":0.04522884,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Godfrey","is_ca":true},{"name":"Mohammad Zulkernine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04051348829365457,"gpt":0.270032057030193,"spread":0.2295185687365384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001725141,0.0006489952,0.0008463037,0.0009298305,0.001746528,0.002297244,0.002662411,0.00204122,0.003140247],"category_scores_gemma":[0.00460983,0.0004548166,0.0007822287,0.000850866,0.001618735,0.003560986,0.003456806,0.002546986,0.001543762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009771959,"about_ca_system_score_gemma":0.004047299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001955187,"about_ca_topic_score_gemma":0.002526867,"domain_scores_codex":[0.9968868,0.0007356682,0.0001688276,0.0003270368,0.00129076,0.0005909273],"domain_scores_gemma":[0.9939107,0.0005832997,0.0004394846,0.003108083,0.001622021,0.0003364787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001192609,0.001109828,0.007054114,0.0004944528,0.0003274034,0.002261081,0.001285525,0.08961185,0.167201,0.3188211,0.03446429,0.3761768],"study_design_scores_gemma":[0.0001749288,0.0005565261,0.001029799,0.0001138471,0.0001907021,0.00203357,0.0003707924,0.7896153,0.107686,0.05738667,0.04071804,0.0001237888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0515026,0.0006137225,0.9268185,0.002166464,0.000254414,0.0003601784,0.00008009302,0.005179015,0.01302507],"genre_scores_gemma":[0.7815496,0.0003707408,0.20839,0.0006027053,0.0001646569,0.0001622551,0.0001233554,0.0002664899,0.008370314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003140247,"threshold_uncertainty_score":0.01050514,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jonathan M. McCune","is_ca":false},{"name":"Adrian Perrig","is_ca":false},{"name":"Arvind Seshadri","is_ca":false},{"name":"Leendert van Doorn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2555037992180282,"gpt":0.3977696746541599,"spread":0.1422658754361316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0982604,0.0009433338,0.002551958,0.003522689,0.006322433,0.01996624,0.007757166,0.01574615,0.007632633],"category_scores_gemma":[0.2078756,0.002098433,0.001578098,0.005188809,0.02226458,0.07059714,0.008772431,0.01599132,0.002924549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006774056,"about_ca_system_score_gemma":0.004509585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005251057,"about_ca_topic_score_gemma":0.002196795,"domain_scores_codex":[0.8642582,0.104712,0.003960948,0.005894498,0.01810926,0.003065104],"domain_scores_gemma":[0.5674406,0.345482,0.006492238,0.04082446,0.03396297,0.005797756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000433487,0.0004479287,0.004222404,0.000828819,0.00008626434,0.0003676459,0.009544831,0.00758221,0.001263494,0.6886992,0.01986387,0.2666598],"study_design_scores_gemma":[0.0001196888,0.0004731727,0.00137147,0.001218259,0.00008249606,0.001790733,0.009502672,0.1232435,0.00626353,0.7399493,0.1156823,0.0003029111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04085249,0.08672095,0.6290665,0.199909,0.001855759,0.0005161047,0.0001194231,0.002186252,0.03877348],"genre_scores_gemma":[0.7210916,0.0298966,0.2272187,0.008908538,0.002625996,0.0006218239,0.0002216734,0.0007701279,0.008644874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0982604,"threshold_uncertainty_score":0.5196569,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shvetank Jain","is_ca":true},{"name":"Fareha Shafique","is_ca":true},{"name":"Vladan Djeric","is_ca":true},{"name":"Ashvin Goel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03278069124276253,"gpt":0.2317832041088033,"spread":0.1990025128660408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951751,0.001072166,0.0008651629,0.001152049,0.001205168,0.00175061,0.002549416,0.001058163,0.007016458],"category_scores_gemma":[0.007014519,0.0005431476,0.0006829095,0.0006626465,0.002190406,0.004053808,0.007896081,0.002082828,0.0038275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000534651,"about_ca_system_score_gemma":0.001531241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007700554,"about_ca_topic_score_gemma":0.001007894,"domain_scores_codex":[0.9979668,0.000306312,0.0001830214,0.0004432753,0.0006739889,0.0004267851],"domain_scores_gemma":[0.9954405,0.0007511831,0.000314611,0.002682702,0.000558576,0.0002524366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001991605,0.000746033,0.004886432,0.000539139,0.0001565506,0.001129197,0.001919271,0.06425131,0.1145754,0.1170386,0.0207502,0.6720163],"study_design_scores_gemma":[0.000244621,0.0008442596,0.00150191,0.0001616177,0.0001527522,0.001507203,0.0007109531,0.5252196,0.163914,0.2418332,0.06375742,0.0001524516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03903944,0.0006212247,0.9243149,0.00104998,0.0004144868,0.0002107097,0.000100118,0.01517065,0.01907844],"genre_scores_gemma":[0.7155957,0.0004162796,0.2560666,0.001012106,0.0002201668,0.0002733548,0.0003449238,0.001574097,0.0244968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007016458,"threshold_uncertainty_score":0.02347237,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Moinuddin K. Qureshi","is_ca":false},{"name":"Aditya Rohan","is_ca":false},{"name":"Gururaj Saileshwar","is_ca":false},{"name":"Prashant J. Nair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01498002426218091,"gpt":0.2201203002542421,"spread":0.2051402759920612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006988831,0.0009290131,0.0007431835,0.0007820294,0.001098918,0.002583653,0.002532771,0.001513105,0.1675404],"category_scores_gemma":[0.001785334,0.000781499,0.0007192999,0.0006964317,0.0006971844,0.003873412,0.003487051,0.001611904,0.1040066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009014455,"about_ca_system_score_gemma":0.001596253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00260656,"about_ca_topic_score_gemma":0.003108988,"domain_scores_codex":[0.9992662,0.00007100726,0.00003639599,0.0001842508,0.0002939186,0.0001482602],"domain_scores_gemma":[0.9992502,0.0000888409,0.00004125336,0.0002838855,0.0002047993,0.0001309944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001269184,0.0002360798,0.00349444,0.001586813,0.0001447817,0.0005942605,0.0004882961,0.005889076,0.03531098,0.07794209,0.63064,0.242404],"study_design_scores_gemma":[0.00009052131,0.00009857371,0.000738862,0.00009788069,0.00003699939,0.0002780364,0.0001154116,0.006807826,0.01441473,0.0093368,0.9679316,0.00005279492],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02987787,0.005981445,0.1210782,0.005011724,0.00322061,0.0009096719,0.02490278,0.171518,0.6374997],"genre_scores_gemma":[0.2243807,0.005346601,0.1314302,0.004218959,0.0006763065,0.001127865,0.05966193,0.02297014,0.5501873],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8324596,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Salabat Khan","is_ca":false},{"name":"Fei Luo","is_ca":false},{"name":"Zijian Zhang","is_ca":false},{"name":"Farhan Ullah","is_ca":false},{"name":"Farhan Amin","is_ca":false},{"name":"Syed Furqan Qadri","is_ca":false},{"name":"Md Belal Bin Heyat","is_ca":false},{"name":"Rukhsana Ruby","is_ca":false},{"name":"Lu Wang","is_ca":false},{"name":"Shamsher Ullah","is_ca":false},{"name":"Meng Li","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true},{"name":"Kaishun Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1879105566283936,"gpt":0.3534768931076378,"spread":0.1655663364792442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002962447,0.0009230021,0.0008208503,0.005115345,0.0007471193,0.002939306,0.001362539,0.00161918,0.006304606],"category_scores_gemma":[0.005722894,0.0007731303,0.0006781598,0.01162643,0.001211749,0.007434148,0.001170441,0.001787927,0.002778674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001739278,"about_ca_system_score_gemma":0.00230296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001630478,"about_ca_topic_score_gemma":0.001225194,"domain_scores_codex":[0.9964217,0.0008051791,0.0003741567,0.0004430276,0.001649829,0.0003061541],"domain_scores_gemma":[0.9954422,0.002592501,0.0004891536,0.0004270416,0.0008981468,0.000151009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001686378,0.0001594223,0.002559796,0.009087916,0.00005211674,0.0002251055,0.0005554283,0.004719041,0.003176537,0.09972911,0.02388375,0.8556831],"study_design_scores_gemma":[0.00001595145,0.0002994671,0.002298001,0.003272822,0.00006842535,0.001244213,0.000493432,0.003714545,0.003827707,0.01318288,0.9715121,0.00007046464],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02153912,0.7607419,0.09561548,0.003343852,0.001305697,0.0004693273,0.0006321621,0.001086676,0.1152657],"genre_scores_gemma":[0.100508,0.838845,0.0356685,0.001360709,0.0008763069,0.0002493401,0.001863731,0.0002860171,0.02034242],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006304606,"threshold_uncertainty_score":0.02109098,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Feiner","is_ca":true},{"name":"Angela Demke Brown","is_ca":true},{"name":"Ashvin Goel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0375604737519413,"gpt":0.2913144684051619,"spread":0.2537539946532206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227831,0.0007493151,0.0006710936,0.001118089,0.0005937002,0.001401319,0.001332408,0.0006139585,0.003196458],"category_scores_gemma":[0.007072068,0.0006652498,0.0005514101,0.0005637486,0.001166867,0.002453164,0.00287286,0.001297141,0.001285012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007677502,"about_ca_system_score_gemma":0.001255538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006799628,"about_ca_topic_score_gemma":0.0006139928,"domain_scores_codex":[0.9981615,0.0003183724,0.0001515615,0.0003293981,0.0007236955,0.0003154547],"domain_scores_gemma":[0.9954246,0.001351831,0.0004477533,0.002031966,0.0006164451,0.0001274263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001044753,0.0006310288,0.02071541,0.0007704793,0.0001355692,0.001323781,0.002253866,0.04340287,0.2260772,0.08426654,0.01576113,0.6036174],"study_design_scores_gemma":[0.0001352813,0.0005801447,0.007395456,0.0001811627,0.0001510426,0.001515601,0.0002282022,0.3381037,0.5431783,0.04289196,0.06544559,0.0001935101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07092039,0.0002213804,0.8646734,0.0001550135,0.00007828452,0.0001721259,0.0001660859,0.05751661,0.006096726],"genre_scores_gemma":[0.7299156,0.0001859796,0.2601489,0.0002818709,0.00004562757,0.0002258661,0.0004241163,0.004773784,0.003998274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003196458,"threshold_uncertainty_score":0.01069319,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anish Saxena","is_ca":false},{"name":"Gururaj Saileshwar","is_ca":false},{"name":"Prashant J. Nair","is_ca":true},{"name":"Moinuddin K. Qureshi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01011404763245133,"gpt":0.2229753802334781,"spread":0.2128613326010267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777328,0.001177926,0.0005344921,0.0005914129,0.0005931674,0.0008505118,0.00244352,0.0005234423,0.007359643],"category_scores_gemma":[0.001302942,0.0004983071,0.0005277311,0.0003715471,0.0007146826,0.002001593,0.001548363,0.0008302132,0.002100963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005439488,"about_ca_system_score_gemma":0.001010743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00125986,"about_ca_topic_score_gemma":0.003275103,"domain_scores_codex":[0.9993466,0.00008628076,0.00005077217,0.000149092,0.0002163933,0.000151013],"domain_scores_gemma":[0.9981582,0.0002725687,0.0002388575,0.0008836534,0.0003457214,0.0001011039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00185561,0.0005018507,0.01184991,0.001047528,0.0003767545,0.0009195399,0.0006837737,0.04640321,0.5343909,0.01065929,0.05136835,0.3399433],"study_design_scores_gemma":[0.0002332707,0.003334225,0.005557719,0.0001093333,0.0002915639,0.001579651,0.0004344269,0.3551517,0.5418029,0.01077466,0.08049957,0.0002309317],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5151272,0.004065721,0.3618041,0.001031401,0.0008577416,0.0005795476,0.001193249,0.09565921,0.01968174],"genre_scores_gemma":[0.8951684,0.000281777,0.09078781,0.0004893569,0.00008342374,0.0002201514,0.000893843,0.0008956152,0.01117962],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007359643,"threshold_uncertainty_score":0.02462047,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information flow; Data-flow analysis; Data flow diagram; Database","authors":[{"name":"Vladimir Klebanov","is_ca":false},{"name":"Norbert Manthey","is_ca":false},{"name":"Christian Muise","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01959835151394648,"gpt":0.2435986769979469,"spread":0.2240003254840004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514355,0.001662789,0.001497315,0.003288902,0.001310253,0.004485243,0.003990405,0.001734529,0.01084846],"category_scores_gemma":[0.01948534,0.001758759,0.004593543,0.003309995,0.004997414,0.01176005,0.003712884,0.005872321,0.001458332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00356298,"about_ca_system_score_gemma":0.002508701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003064276,"about_ca_topic_score_gemma":0.003622644,"domain_scores_codex":[0.9927591,0.003134324,0.0004132882,0.001038188,0.002065571,0.0005894792],"domain_scores_gemma":[0.9848971,0.01149725,0.0004257121,0.002045601,0.0009890303,0.0001453246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009831733,0.00005862404,0.0005073408,0.0003176176,0.00007873169,0.00005250887,0.0002187432,0.05531577,0.002372375,0.8791068,0.0030225,0.05885075],"study_design_scores_gemma":[0.00001157036,0.00001954423,0.0002186451,0.0000795987,0.00004708396,0.00003697774,0.00003228949,0.1784356,0.003545097,0.8142669,0.003282135,0.00002463591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0072697,0.0005679623,0.9811859,0.0006649797,0.00008806901,0.0000645792,0.0002616076,0.0007848831,0.009112298],"genre_scores_gemma":[0.3916881,0.001467749,0.5911247,0.0006780622,0.0003981244,0.0003723246,0.001316021,0.000965244,0.01198976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01084846,"threshold_uncertainty_score":0.03629172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Matías Toro","is_ca":false},{"name":"Ronald Garcia","is_ca":true},{"name":"Éric Tanter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03285374123396055,"gpt":0.3009539253309454,"spread":0.2681001840969849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007717997,0.001009384,0.0008903939,0.001456729,0.001702137,0.004791109,0.003872796,0.00248964,0.004345438],"category_scores_gemma":[0.0235758,0.001587329,0.002767801,0.001101528,0.008619728,0.01257053,0.0106697,0.006486484,0.002352657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00204618,"about_ca_system_score_gemma":0.004129918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003298674,"about_ca_topic_score_gemma":0.003402396,"domain_scores_codex":[0.991837,0.001855588,0.000664758,0.00131655,0.00323243,0.001093663],"domain_scores_gemma":[0.9791126,0.00643632,0.001446593,0.009272465,0.003130834,0.0006011035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000141083,0.00004342367,0.001792852,0.00018864,0.00003054888,0.000332699,0.002254551,0.008233579,0.00709785,0.9480861,0.002090214,0.02970845],"study_design_scores_gemma":[0.0001148909,0.0001895985,0.000537665,0.000333268,0.0001331017,0.000719315,0.0005068104,0.07059957,0.03689935,0.7900064,0.0997306,0.0002294551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03617496,0.0002927683,0.9425885,0.00112899,0.0002136991,0.0001505617,0.0002039909,0.006942513,0.01230402],"genre_scores_gemma":[0.5292869,0.0003823225,0.4466265,0.00155243,0.0001976216,0.0003481769,0.0003658807,0.003226753,0.0180134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007717997,"threshold_uncertainty_score":0.04081714,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chamseddine Talhi","is_ca":true},{"name":"Nadia Tawbi","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03018069831504839,"gpt":0.2908001041920741,"spread":0.2606194058770257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007122683,0.0008308016,0.0009007835,0.001256929,0.001380058,0.003088739,0.002712263,0.001559683,0.003092597],"category_scores_gemma":[0.04245144,0.0008361186,0.0006629779,0.0009782973,0.001894561,0.004816392,0.003485164,0.002701034,0.0004628621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001168874,"about_ca_system_score_gemma":0.003497391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003293689,"about_ca_topic_score_gemma":0.003302984,"domain_scores_codex":[0.9898477,0.002885895,0.0009799547,0.001402725,0.003314382,0.001569345],"domain_scores_gemma":[0.94716,0.02474601,0.005494354,0.01654851,0.005014335,0.001036732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004133313,0.0006497593,0.02371126,0.001093533,0.0003708951,0.002691787,0.002451352,0.1776271,0.060545,0.3505012,0.02434002,0.3518848],"study_design_scores_gemma":[0.0002057021,0.0001561504,0.001980647,0.0001908137,0.0001851261,0.0004411994,0.000214932,0.7836702,0.08446483,0.1174459,0.0109768,0.00006754924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.234959,0.0008480658,0.7258976,0.003083916,0.0004247624,0.0002856893,0.0004786041,0.01500136,0.01902091],"genre_scores_gemma":[0.9525049,0.0001220527,0.04432438,0.0003143108,0.00008940141,0.00007829166,0.0001467221,0.000389326,0.002030732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007122683,"threshold_uncertainty_score":0.03766876,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Béatrice Bérard","is_ca":false},{"name":"John Mullins","is_ca":true},{"name":"Mathieu Sassolas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0460157913763329,"gpt":0.3060719185987094,"spread":0.2600561272223765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477683,0.001199706,0.001303849,0.002804573,0.002483781,0.007353929,0.002506339,0.002475749,0.004228886],"category_scores_gemma":[0.04151671,0.001020992,0.002879391,0.001838731,0.0116877,0.01651157,0.007545891,0.004750662,0.0003891649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004162056,"about_ca_system_score_gemma":0.002232474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002265051,"about_ca_topic_score_gemma":0.0009834494,"domain_scores_codex":[0.9875239,0.003589946,0.0009088736,0.002376232,0.004461305,0.001139616],"domain_scores_gemma":[0.963063,0.02186676,0.003726948,0.008358247,0.002283503,0.0007015507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003166544,0.00001422216,0.0005277066,0.00007576156,0.00003237908,0.0001014567,0.0003974219,0.01163889,0.001312052,0.9804155,0.0002582179,0.005194654],"study_design_scores_gemma":[0.00001007843,0.00002783699,0.0002548108,0.00003486084,0.00003360916,0.0001444471,0.00007687698,0.0399771,0.00187964,0.9543638,0.003163693,0.00003309724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01903792,0.000300146,0.9713699,0.000833458,0.00007119629,0.00008510798,0.0001969611,0.0003517536,0.007753573],"genre_scores_gemma":[0.8154131,0.0004335121,0.1792435,0.0004040236,0.0002408962,0.0002734785,0.0002163992,0.0002266974,0.003548509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009477683,"threshold_uncertainty_score":0.05012339,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Zhen Huang","is_ca":true},{"name":"M. D’Angelo","is_ca":true},{"name":"Dhaval Miyani","is_ca":true},{"name":"David Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03620936681950668,"gpt":0.2853534543307426,"spread":0.2491440875112359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00400995,0.002188699,0.00070588,0.001637037,0.0006590824,0.001579083,0.003145475,0.001484243,0.003610216],"category_scores_gemma":[0.01680137,0.001159964,0.001076411,0.0004543022,0.002826051,0.004186283,0.003773563,0.002042772,0.001943207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007099241,"about_ca_system_score_gemma":0.001424442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001542491,"about_ca_topic_score_gemma":0.001012969,"domain_scores_codex":[0.9946694,0.001357354,0.0004297797,0.0009665931,0.001660066,0.0009168318],"domain_scores_gemma":[0.9859655,0.003997711,0.003322868,0.004463683,0.001364787,0.0008854026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003409913,0.001676501,0.0554441,0.002161195,0.0006630858,0.002084532,0.004043901,0.05637237,0.5078365,0.0128902,0.0284495,0.3249682],"study_design_scores_gemma":[0.001212177,0.008818681,0.03481508,0.0006317697,0.0009677204,0.003378156,0.002547168,0.3243954,0.5329666,0.01800334,0.07132903,0.0009350472],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"software","genre_scores_codex":[0.4842996,0.001618831,0.3503729,0.001113853,0.0005595384,0.001082315,0.0003698068,0.153669,0.006914114],"genre_scores_gemma":[0.8876216,0.0003622343,0.1035189,0.0009223102,0.00008000864,0.0003928905,0.0004893041,0.004001833,0.002610945],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.00400995,"threshold_uncertainty_score":0.02120686,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ryan Shea","is_ca":true},{"name":"Jiangchuan Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1410357471753522,"gpt":0.3424692844536432,"spread":0.201433537278291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420996,0.0007403197,0.0006259847,0.001190823,0.0005064592,0.001230423,0.0007544833,0.0009016581,0.0008217092],"category_scores_gemma":[0.01432951,0.0002880778,0.000385838,0.0005183257,0.0007214356,0.004627049,0.0008640009,0.001239395,0.0002384346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007648614,"about_ca_system_score_gemma":0.0007065073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001864781,"about_ca_topic_score_gemma":0.0008592138,"domain_scores_codex":[0.9982074,0.0005053753,0.0001023816,0.0001820701,0.0006195407,0.0003832571],"domain_scores_gemma":[0.9899629,0.006005737,0.001369699,0.001362377,0.0009736648,0.0003255834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001151282,0.0008686889,0.06385899,0.0004135375,0.000231802,0.00063605,0.0005061812,0.7305155,0.08204702,0.01776965,0.001618935,0.1003824],"study_design_scores_gemma":[0.00003262138,0.0006634532,0.03141914,0.00004989132,0.00009123634,0.0003740017,0.0003324095,0.9198781,0.03055427,0.0147378,0.001820955,0.00004603223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9550131,0.00124569,0.03712439,0.0006519719,0.0000646432,0.00007864717,0.0001403372,0.0004071779,0.005273909],"genre_scores_gemma":[0.996543,0.0003197043,0.002836969,0.00004425148,0.00001830853,0.00001366026,0.00006371916,0.00002090804,0.0001395132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001864781,"threshold_uncertainty_score":0.007515013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Noel Brett","is_ca":true},{"name":"Umair Siddique","is_ca":true},{"name":"Borzoo Bonakdarpour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03159615724552439,"gpt":0.278020581336785,"spread":0.2464244240912606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002737765,0.0009569141,0.001029478,0.001085181,0.001057607,0.003294528,0.002519466,0.001284226,0.01205412],"category_scores_gemma":[0.009798545,0.0008829512,0.002199748,0.0007810426,0.003173603,0.00489256,0.004846849,0.003438117,0.004907229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644193,"about_ca_system_score_gemma":0.001925506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001533518,"about_ca_topic_score_gemma":0.002186422,"domain_scores_codex":[0.9938314,0.001512744,0.0004855356,0.001018005,0.002369099,0.0007831482],"domain_scores_gemma":[0.9915562,0.003975689,0.0003568646,0.002702086,0.001249137,0.0001599905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001124489,0.000410012,0.002234441,0.001212981,0.0001903927,0.001214249,0.001550487,0.07020931,0.0829623,0.4971173,0.01947483,0.3222992],"study_design_scores_gemma":[0.0002192508,0.0001764406,0.0004088105,0.0001512293,0.0001810541,0.0003770585,0.0001676814,0.3749566,0.09871762,0.5022142,0.02229683,0.0001332649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02036628,0.0002812157,0.9454259,0.0003909323,0.0002770764,0.0001661674,0.0003443863,0.02046853,0.01227951],"genre_scores_gemma":[0.6131123,0.0002821559,0.3622701,0.0007226717,0.0002453843,0.0003432064,0.001619089,0.006382168,0.01502295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01205412,"threshold_uncertainty_score":0.04032505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tarek Mhamdi","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03381377359147041,"gpt":0.2476253939191147,"spread":0.2138116203276443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00188998,0.0006678645,0.0006850701,0.0018915,0.001018672,0.003015127,0.001204726,0.0007941849,0.00605036],"category_scores_gemma":[0.003671051,0.0005404439,0.001305477,0.001070716,0.004237625,0.006438481,0.002399144,0.003458956,0.0006902615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001732964,"about_ca_system_score_gemma":0.0006742027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004893151,"about_ca_topic_score_gemma":0.0006435515,"domain_scores_codex":[0.9985664,0.0004357064,0.0001293189,0.0002055211,0.0004918984,0.0001711667],"domain_scores_gemma":[0.9973048,0.001587053,0.0001756702,0.00045771,0.0003330727,0.0001415411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006993985,0.00000674213,0.00004123609,0.00001631251,0.000003346514,0.00001596682,0.00007947555,0.0009720193,0.0002711732,0.9958378,0.000271973,0.002476984],"study_design_scores_gemma":[0.000005591459,0.000008289941,0.00007583313,0.00001362782,0.000004658079,0.00002910381,0.00002295653,0.006487862,0.0004767515,0.9903731,0.002494583,0.000007639311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03412612,0.001202761,0.8993258,0.00130197,0.0003399295,0.00005572893,0.0002909628,0.0005270589,0.06282974],"genre_scores_gemma":[0.8511967,0.001086715,0.1277643,0.0004881584,0.0008728397,0.0001933275,0.0004125776,0.0005056718,0.01747973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00605036,"threshold_uncertainty_score":0.02024043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Callback; JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Operating system; Rich Internet application","authors":[{"name":"Keheliya Gallaba","is_ca":true},{"name":"Ali Mesbah","is_ca":true},{"name":"Ivan Beschastnikh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05261667345722549,"gpt":0.270713781035217,"spread":0.2180971075779915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003327168,0.0003511031,0.0003094863,0.002633825,0.0009897382,0.0017284,0.0005944953,0.0007461196,0.0005633357],"category_scores_gemma":[0.03591854,0.0002938675,0.0002773151,0.00258964,0.001366989,0.003860601,0.001167633,0.001195381,0.0004579738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007356296,"about_ca_system_score_gemma":0.0008781035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005254104,"about_ca_topic_score_gemma":0.006025706,"domain_scores_codex":[0.996539,0.001423223,0.0002867478,0.0005584801,0.00103173,0.0001607558],"domain_scores_gemma":[0.9601628,0.02941652,0.00415956,0.00257625,0.003209222,0.0004756659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006983468,0.0003973005,0.3828332,0.001538481,0.0001064457,0.001465386,0.07193183,0.006230729,0.05043132,0.02074159,0.01444023,0.4491851],"study_design_scores_gemma":[0.0001023895,0.0003625489,0.6043319,0.0009784668,0.0002206935,0.006076977,0.02393403,0.1163668,0.06649438,0.03840856,0.1423709,0.0003524009],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9350445,0.0009889094,0.05525733,0.0005867096,0.00004213872,0.00009172476,0.001784017,0.001541547,0.004663053],"genre_scores_gemma":[0.9441265,0.0004830468,0.04904013,0.0003499595,0.00003269018,0.0001589296,0.002982662,0.001278093,0.001547944],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005254104,"threshold_uncertainty_score":0.01759595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sören Bleikertz","is_ca":false},{"name":"Carsten Vogel","is_ca":false},{"name":"Thomas Groß","is_ca":false},{"name":"Sebastian Mödersheim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03595886892326106,"gpt":0.2945342173846299,"spread":0.2585753484613688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764675,0.0004330201,0.0002727991,0.001895932,0.0005638059,0.002049828,0.0006719182,0.0006559417,0.001627232],"category_scores_gemma":[0.00847514,0.0002529064,0.0004700294,0.0007262581,0.000888794,0.001675848,0.001031204,0.0006887968,0.0002476675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001465296,"about_ca_system_score_gemma":0.0009283305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003737282,"about_ca_topic_score_gemma":0.002009381,"domain_scores_codex":[0.9980497,0.0004962636,0.00009517635,0.000335248,0.0006607242,0.0003628457],"domain_scores_gemma":[0.9945092,0.002561314,0.0009806179,0.0008612435,0.0008453858,0.0002423822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002040052,0.00051518,0.1804459,0.0002648369,0.0003426714,0.001239571,0.001438093,0.5411865,0.05828534,0.0634348,0.00330239,0.1475047],"study_design_scores_gemma":[0.00001896987,0.0002482539,0.02818077,0.00002555769,0.0000507121,0.0001609643,0.0005412532,0.943989,0.01248061,0.01269378,0.00158187,0.00002819296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9409506,0.0002195986,0.05035613,0.0003387961,0.00005013829,0.0001424471,0.0003531483,0.000628497,0.006960551],"genre_scores_gemma":[0.9969304,0.00002725978,0.00254853,0.00001343995,0.000004036216,0.00001269945,0.0001190111,0.000009910431,0.000334718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003737282,"threshold_uncertainty_score":0.0106315,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Anthony Vandikas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02087024869430514,"gpt":0.2551521743188784,"spread":0.2342819256245733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006806,0.0005628003,0.0005659671,0.001162421,0.000841837,0.001766029,0.002047044,0.000772811,0.004672408],"category_scores_gemma":[0.00660302,0.0005560293,0.001368565,0.0007232322,0.00238144,0.004263958,0.003105232,0.002007115,0.001174801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007526783,"about_ca_system_score_gemma":0.001639026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165366,"about_ca_topic_score_gemma":0.001070683,"domain_scores_codex":[0.9961647,0.0009679548,0.0002058749,0.0006705978,0.001731856,0.0002590088],"domain_scores_gemma":[0.9924177,0.003597806,0.00040265,0.00271736,0.0007847872,0.00007969251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003014641,0.0001625494,0.002858101,0.0006137194,0.00013566,0.0007757201,0.001040595,0.04928119,0.09178901,0.5373485,0.005602181,0.3100912],"study_design_scores_gemma":[0.00007954149,0.0001835568,0.001023291,0.0001378738,0.00008133533,0.0009509802,0.0001994036,0.3339196,0.1826522,0.4271288,0.05355401,0.00008941402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812868,0.0001221534,0.9738349,0.0001612167,0.0000227872,0.0001048117,0.0001736608,0.002878544,0.004573165],"genre_scores_gemma":[0.2915178,0.0003237385,0.7017869,0.0001661082,0.00003691071,0.0002637063,0.0007051398,0.0006816351,0.004518071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004672408,"threshold_uncertainty_score":0.01563078,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Executor; Computer science; Probabilistic logic; Computer security; Artificial intelligence; Economics; Finance","authors":[{"name":"Drew Dean","is_ca":false},{"name":"Alan J. Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08609299613582785,"gpt":0.3199793802399711,"spread":0.2338863841041432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007606118,0.000628405,0.0009268761,0.0006671539,0.002446213,0.00343908,0.002261043,0.002496254,0.008136746],"category_scores_gemma":[0.04845902,0.0008998553,0.001554818,0.0006007433,0.007910221,0.01638337,0.006756308,0.00363528,0.0013793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533185,"about_ca_system_score_gemma":0.002929447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003176663,"about_ca_topic_score_gemma":0.002736988,"domain_scores_codex":[0.9923434,0.003012514,0.0003604182,0.001297092,0.001515736,0.001470839],"domain_scores_gemma":[0.9716106,0.01400184,0.001903124,0.0101082,0.001501023,0.0008753067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00150499,0.0002703851,0.007556447,0.0002689309,0.0001711193,0.0005880388,0.002852125,0.04325966,0.01733159,0.7489696,0.01457432,0.1626529],"study_design_scores_gemma":[0.0001622779,0.0001911037,0.001095032,0.0001220018,0.0001458765,0.0004089019,0.0005613278,0.1456336,0.03601357,0.79067,0.02483462,0.0001616072],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1850642,0.0004535875,0.7754369,0.007774999,0.0003383769,0.0003129567,0.0002047806,0.00658068,0.02383351],"genre_scores_gemma":[0.8559534,0.0001809017,0.1333148,0.0006316977,0.0000934184,0.000248724,0.00008815329,0.00160453,0.007884238],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008136746,"threshold_uncertainty_score":0.04022551,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03448189769276498,"gpt":0.2702764084565434,"spread":0.2357945107637784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400949,0.00231142,0.001161146,0.003673772,0.0007884015,0.002071997,0.002811204,0.001308009,0.004582019],"category_scores_gemma":[0.01706053,0.001202278,0.00209952,0.001974534,0.003524306,0.005792256,0.004984012,0.002264048,0.001437219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708774,"about_ca_system_score_gemma":0.003639511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006115998,"about_ca_topic_score_gemma":0.006669433,"domain_scores_codex":[0.9933328,0.001755073,0.0004241124,0.0009640311,0.002887568,0.0006364286],"domain_scores_gemma":[0.9867448,0.008428616,0.001154139,0.0024112,0.00100099,0.0002601472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009224348,0.0006296677,0.01786311,0.001051769,0.0003516899,0.001591321,0.001121704,0.3006233,0.07037451,0.08102427,0.01475293,0.5096933],"study_design_scores_gemma":[0.00006789203,0.0001300967,0.000948381,0.00006372407,0.00005163132,0.000205535,0.0001070154,0.9217192,0.02545556,0.04669828,0.004484877,0.0000677765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03840702,0.0003237166,0.9160801,0.0006042727,0.00008464859,0.0001871152,0.0005123938,0.04011833,0.003682468],"genre_scores_gemma":[0.4572638,0.0003383428,0.5329013,0.0003981763,0.0001077314,0.0004609702,0.001568133,0.004249281,0.002712202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006115998,"threshold_uncertainty_score":0.01532835,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ali Reza Arasteh","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03766217992191722,"gpt":0.2444065722086764,"spread":0.2067443922867592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795747,0.000796774,0.0005651176,0.003828235,0.0007532024,0.003113632,0.001410913,0.001147656,0.001979275],"category_scores_gemma":[0.009806622,0.0006110737,0.0009880272,0.001457697,0.003664023,0.00688668,0.002245011,0.001214459,0.0004313785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118082,"about_ca_system_score_gemma":0.001679679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003024624,"about_ca_topic_score_gemma":0.001435071,"domain_scores_codex":[0.9985523,0.0003275185,0.00009655095,0.000266676,0.0005615996,0.0001954086],"domain_scores_gemma":[0.9953716,0.001839842,0.0007768631,0.001308127,0.0006085034,0.00009504913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004710339,0.0001935309,0.01853928,0.0005892846,0.0001816218,0.001898517,0.002452133,0.136765,0.0439361,0.4956001,0.002867717,0.2965057],"study_design_scores_gemma":[0.00003206467,0.0001635616,0.003829462,0.0002843259,0.0001463194,0.001174364,0.0007484286,0.5457341,0.06158458,0.3735794,0.01261055,0.0001128737],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08352719,0.001082392,0.9090225,0.0004982635,0.00003591845,0.0001010867,0.0002961661,0.002153784,0.003282823],"genre_scores_gemma":[0.7855122,0.001089043,0.2093779,0.0001822391,0.000083138,0.0001335207,0.0004425516,0.000473709,0.002705664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003828235,"threshold_uncertainty_score":0.009496987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Magnus Madsen","is_ca":true},{"name":"Frank Tip","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06467412276819863,"gpt":0.3154442103194611,"spread":0.2507700875512625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398929,0.0008760857,0.0004400939,0.001607481,0.000480518,0.0008146158,0.001219194,0.0006342029,0.0007957318],"category_scores_gemma":[0.009158387,0.0004622851,0.0006696625,0.001205372,0.0007922163,0.0009972502,0.0005140351,0.0006685326,0.000250867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000905745,"about_ca_system_score_gemma":0.001297498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003436564,"about_ca_topic_score_gemma":0.003519965,"domain_scores_codex":[0.997544,0.0004565497,0.0001562745,0.0004045358,0.001219427,0.0002192721],"domain_scores_gemma":[0.9888688,0.006627178,0.001044927,0.00133825,0.001931004,0.0001897939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001929306,0.001083033,0.1284606,0.001533472,0.0003992496,0.003894136,0.002657528,0.1732932,0.3852859,0.01521006,0.009460085,0.2767933],"study_design_scores_gemma":[0.00006639163,0.0003649838,0.03867047,0.00006526241,0.0001679502,0.0006756239,0.0002021651,0.7409731,0.207427,0.005259587,0.006029064,0.00009845172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7680398,0.0003029371,0.1984929,0.000170275,0.00006885903,0.0002046809,0.001155006,0.02846537,0.003100158],"genre_scores_gemma":[0.9312425,0.0001163896,0.06456776,0.00009485069,0.00002237014,0.0001066289,0.001257424,0.001332453,0.001259514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003436564,"threshold_uncertainty_score":0.007398367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marc E. Fiuczynski","is_ca":false},{"name":"Robert Grimm","is_ca":false},{"name":"Yvonne Coady","is_ca":true},{"name":"David Walker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05007305583384269,"gpt":0.3020199961544404,"spread":0.2519469403205977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987867,0.0008528832,0.0006951043,0.00101809,0.002210516,0.002687203,0.001661174,0.002796848,0.03310107],"category_scores_gemma":[0.01446676,0.0005314575,0.0007699784,0.0008649547,0.002473488,0.005903268,0.00405215,0.002305628,0.008782604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237171,"about_ca_system_score_gemma":0.001479746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002778784,"about_ca_topic_score_gemma":0.002367999,"domain_scores_codex":[0.9964071,0.0004636788,0.0002761572,0.0009565091,0.001199491,0.0006970242],"domain_scores_gemma":[0.9899301,0.002700157,0.0009053392,0.003970468,0.00192458,0.0005693171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001345357,0.0003805464,0.03784918,0.001355125,0.0002231119,0.006954187,0.006122891,0.004663766,0.02709498,0.3391382,0.2827286,0.292144],"study_design_scores_gemma":[0.00009455041,0.0003330657,0.009857248,0.0003140253,0.0002201537,0.005994587,0.001885212,0.007550581,0.02119812,0.1433266,0.8090976,0.000128202],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.2505476,0.002167569,0.2463734,0.01231692,0.005822128,0.001074129,0.005347374,0.04553487,0.430816],"genre_scores_gemma":[0.7690223,0.001018899,0.05996164,0.007477099,0.001212224,0.0004628156,0.004443664,0.01446173,0.1419396],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.03310107,"threshold_uncertainty_score":0.1107342,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azzam Mourad","is_ca":true},{"name":"Marc-André Laverdière","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03443803637260593,"gpt":0.266494874496235,"spread":0.2320568381236291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003586113,0.0008485172,0.0006634858,0.001537239,0.001050665,0.002350956,0.002250873,0.001075558,0.002214729],"category_scores_gemma":[0.009504253,0.001082198,0.001879805,0.0008400685,0.002558043,0.003767715,0.002832695,0.00367467,0.000571117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000617306,"about_ca_system_score_gemma":0.002116049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012209,"about_ca_topic_score_gemma":0.00225918,"domain_scores_codex":[0.9964749,0.0009578007,0.0003115075,0.0004387975,0.001538378,0.0002786427],"domain_scores_gemma":[0.9931353,0.002103301,0.0004208515,0.003260666,0.0009279635,0.0001518935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002631215,0.0002839494,0.002082484,0.0007395287,0.000200046,0.0006189102,0.001649304,0.03296255,0.06287422,0.4677721,0.004876,0.4256778],"study_design_scores_gemma":[0.0001251411,0.0002930608,0.001145164,0.0004393765,0.0004040822,0.001045733,0.0002846047,0.3001724,0.07930399,0.5372295,0.07942082,0.0001361096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004056281,0.0001536458,0.9926743,0.0001832203,0.00003274972,0.0001305029,0.00002327429,0.001020196,0.001725805],"genre_scores_gemma":[0.09341939,0.0003459583,0.9032123,0.0002188661,0.00004980748,0.0001600526,0.00011023,0.0005452874,0.001937993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003586113,"threshold_uncertainty_score":0.01896542,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Architecture; Computer science; Computer security; Operating system; History","authors":[{"name":"Victor Costan","is_ca":true},{"name":"Ilya Lebedev","is_ca":true},{"name":"Srinivas Devadas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06422840979328397,"gpt":0.3109318821747717,"spread":0.2467034723814878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815455,0.001033625,0.0006016099,0.003657293,0.001425755,0.004943311,0.001079215,0.002408209,0.006196621],"category_scores_gemma":[0.002458344,0.0009942178,0.0006134885,0.004419047,0.00312871,0.008711467,0.00202528,0.006224173,0.002680145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002205918,"about_ca_system_score_gemma":0.001448677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001918934,"about_ca_topic_score_gemma":0.001090401,"domain_scores_codex":[0.9985982,0.0002386683,0.000210205,0.0002694667,0.0005289318,0.0001545476],"domain_scores_gemma":[0.9988137,0.0005412209,0.0002134257,0.0001591737,0.000207144,0.00006538926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004000407,0.0000700901,0.001018082,0.0007069661,0.000009173642,0.0001477319,0.0008739879,0.003233107,0.001752908,0.8670324,0.01679,0.1083255],"study_design_scores_gemma":[0.000008997528,0.0002304454,0.00209624,0.001492489,0.00001592996,0.001227404,0.0005098412,0.01084108,0.002151732,0.2192175,0.7621565,0.00005185058],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.02211162,0.3357548,0.4355513,0.01254469,0.003231387,0.0004189734,0.0006532147,0.001459109,0.1882749],"genre_scores_gemma":[0.2672182,0.3597306,0.2523639,0.00771987,0.007441461,0.0009825641,0.001974719,0.0007860819,0.1017826],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006196621,"threshold_uncertainty_score":0.02072978,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kelsey Harley","is_ca":true},{"name":"Rodney H. Cooper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1181871269327649,"gpt":0.3682330644045224,"spread":0.2500459374717575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007487439,0.001253009,0.001850932,0.006362337,0.002883451,0.01109725,0.003341446,0.006243977,0.03775685],"category_scores_gemma":[0.0263307,0.0006708321,0.001315281,0.00723868,0.008186547,0.01669365,0.00548217,0.004125016,0.03000937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003407125,"about_ca_system_score_gemma":0.00887622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001644699,"about_ca_topic_score_gemma":0.00103598,"domain_scores_codex":[0.9806686,0.005039611,0.002443309,0.002216411,0.00859876,0.001033235],"domain_scores_gemma":[0.9726118,0.01037403,0.002359271,0.00673668,0.007162553,0.0007556446],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004870586,0.00004660524,0.0003031347,0.007355572,0.0000860207,0.0002792176,0.0008428579,0.0003984003,0.001210817,0.3820963,0.1762389,0.4310935],"study_design_scores_gemma":[0.000004657369,0.00001477443,0.0001143918,0.002060943,0.00001824874,0.0004754641,0.0001067401,0.00005844438,0.0004370965,0.02697237,0.969723,0.00001394135],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001174837,0.5240604,0.03930201,0.02487114,0.008445996,0.0005376212,0.001588418,0.0007438897,0.3992757],"genre_scores_gemma":[0.04648771,0.7559195,0.02842363,0.02447329,0.01246786,0.0009803089,0.00360184,0.0004382677,0.1272076],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9925126,"threshold_uncertainty_score":0.1263093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ben Fisch","is_ca":false},{"name":"Dhinakaran Vinayagamurthy","is_ca":true},{"name":"Dan Boneh","is_ca":false},{"name":"S. Gorbunov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05872375147886557,"gpt":0.2922273820116055,"spread":0.2335036305327399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877115,0.0006080023,0.0003650408,0.0004575852,0.0004571239,0.001062657,0.0009839615,0.0006928213,0.007541839],"category_scores_gemma":[0.001858993,0.0003535266,0.0004981613,0.0002400189,0.001295827,0.002801433,0.001547174,0.001256008,0.002286154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008933861,"about_ca_system_score_gemma":0.0007952209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008824008,"about_ca_topic_score_gemma":0.00099712,"domain_scores_codex":[0.9992649,0.000143565,0.00005323986,0.0001064836,0.0002955163,0.0001362742],"domain_scores_gemma":[0.9993818,0.0001254697,0.00005853865,0.0002984035,0.0001038901,0.00003189908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001177718,0.0001979227,0.002180741,0.0004052609,0.0000454917,0.0004409308,0.000586246,0.01662734,0.03642327,0.7044913,0.05405114,0.1833726],"study_design_scores_gemma":[0.0003279437,0.0009690332,0.001841716,0.0002688218,0.0001036345,0.001369393,0.0001360546,0.2437806,0.1481633,0.2630764,0.3398428,0.0001202419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05975805,0.0006817808,0.8336356,0.0009364483,0.0002395668,0.0003262794,0.0008073024,0.03588612,0.0677289],"genre_scores_gemma":[0.7833315,0.0003505206,0.184037,0.0005658993,0.00007798117,0.000218368,0.00142061,0.001215613,0.02878263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007541839,"threshold_uncertainty_score":0.02522993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cloud computing; Computer security; Cloud computing security; Operating system","authors":[{"name":"Mihir Nanavati","is_ca":true},{"name":"Patrick Colp","is_ca":true},{"name":"Bill Aiello","is_ca":true},{"name":"Andrew Warfield","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04093434147680153,"gpt":0.2896691493521417,"spread":0.2487348078753402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003974648,0.0003882846,0.0003925918,0.001083006,0.003198557,0.007111958,0.001276191,0.001619065,0.02315863],"category_scores_gemma":[0.01281112,0.000311987,0.0005456034,0.001337932,0.001775861,0.005364128,0.003874638,0.002968922,0.01086588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003445787,"about_ca_system_score_gemma":0.007994402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0060265,"about_ca_topic_score_gemma":0.004475349,"domain_scores_codex":[0.9932076,0.001010683,0.0003661335,0.0006822762,0.003532118,0.001201229],"domain_scores_gemma":[0.9892008,0.001584438,0.0007289176,0.004268888,0.002983196,0.001233742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001232164,0.00008721475,0.002368613,0.0002789772,0.00003684543,0.000252977,0.0006559397,0.001797619,0.006637847,0.6456285,0.1613914,0.1807408],"study_design_scores_gemma":[0.00002506091,0.00004205606,0.00204003,0.000324351,0.00002146326,0.0007432344,0.0003811116,0.008630604,0.007272286,0.114745,0.8657339,0.00004089744],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02009421,0.006275591,0.1183841,0.04972505,0.003070199,0.0005813293,0.001392672,0.003480649,0.7969961],"genre_scores_gemma":[0.8104853,0.008693611,0.04287017,0.01129392,0.001726279,0.0003004651,0.002158802,0.0007600531,0.1217113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02315863,"threshold_uncertainty_score":0.07747334,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Focus (optics); Field (mathematics); Software engineering; Programming language","authors":[{"name":"Josef Urban","is_ca":false},{"name":"Jesse Alama","is_ca":false},{"name":"Piotr Rudnicki","is_ca":true},{"name":"Herman Geuvers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05854665833522479,"gpt":0.3276158500955672,"spread":0.2690691917603424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005176254,0.001139495,0.00134537,0.001540728,0.001795862,0.005043973,0.003990667,0.00163159,0.02179396],"category_scores_gemma":[0.02188732,0.001520637,0.001185834,0.002001656,0.0009316768,0.01429682,0.005087726,0.004588888,0.01378409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008951003,"about_ca_system_score_gemma":0.002713074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159125,"about_ca_topic_score_gemma":0.003360998,"domain_scores_codex":[0.9960598,0.001226862,0.0004276633,0.0005748251,0.001405786,0.0003049704],"domain_scores_gemma":[0.9755592,0.01203378,0.0007108998,0.004767644,0.005266241,0.001662314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002143647,0.002780874,0.003248986,0.003439273,0.0002005111,0.0006390613,0.002104889,0.003396013,0.02959336,0.07557372,0.2649943,0.6118854],"study_design_scores_gemma":[0.0008957794,0.001276665,0.002658278,0.0005485396,0.0003076336,0.002541609,0.001055248,0.09548881,0.06510413,0.03772794,0.7920738,0.0003214755],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.02030985,0.0008307006,0.8250321,0.002167985,0.0006710467,0.00139175,0.004300082,0.1217081,0.02358826],"genre_scores_gemma":[0.05985551,0.0006901448,0.8883023,0.000574264,0.0002604419,0.001061165,0.008639906,0.02396319,0.01665307],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.02179396,"threshold_uncertainty_score":0.07290804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Set (abstract data type); Implementation; Computer security; Security policy; Programming language","authors":[{"name":"Raphaël Khoury","is_ca":true},{"name":"Nadia Tawbi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04141110148793092,"gpt":0.3150902523665228,"spread":0.2736791508785918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00659574,0.001096699,0.002126249,0.003796882,0.0006821332,0.003561076,0.00256119,0.002186271,0.002742572],"category_scores_gemma":[0.02082027,0.001167502,0.001189696,0.004615424,0.002118424,0.008924731,0.001343308,0.002966877,0.001138866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812042,"about_ca_system_score_gemma":0.003642934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00175093,"about_ca_topic_score_gemma":0.001205687,"domain_scores_codex":[0.9937735,0.001169461,0.0007119759,0.001382312,0.002457272,0.0005054511],"domain_scores_gemma":[0.9715546,0.02042832,0.002340529,0.002853477,0.002475696,0.0003473294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001760939,0.0001303237,0.004716588,0.004798958,0.0001005473,0.0001077936,0.0003057059,0.003196937,0.00282311,0.07496863,0.008949665,0.8997257],"study_design_scores_gemma":[0.0001405871,0.000516796,0.01255493,0.01099008,0.0006359401,0.002445447,0.001081276,0.02839955,0.02504824,0.1357579,0.7822198,0.0002094227],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01440344,0.8634014,0.09535441,0.006593206,0.0005745473,0.0001073938,0.0002521096,0.0008895813,0.01842398],"genre_scores_gemma":[0.1298997,0.806908,0.05586787,0.001827375,0.001268474,0.0001365851,0.0004576779,0.0002456265,0.003388726],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00659574,"threshold_uncertainty_score":0.03488207,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ahmed E. Hassan","is_ca":true},{"name":"Dayi Lin","is_ca":true},{"name":"Gopi Krishnan Rajbahadur","is_ca":true},{"name":"Keheliya Gallaba","is_ca":true},{"name":"Filipe R. Cogo","is_ca":true},{"name":"Boyuan Chen","is_ca":true},{"name":"Haoxiang Zhang","is_ca":true},{"name":"Kishanthan Thangarajah","is_ca":true},{"name":"Gustavo A. Oliva","is_ca":true},{"name":"Jiahuei Lin","is_ca":true},{"name":"Wali Mohammad Abdullah","is_ca":true},{"name":"Zhen Ming Jiang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09938154788201323,"gpt":0.2759678766141226,"spread":0.1765863287321094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04915947,0.0009891796,0.000821157,0.003335233,0.004827689,0.01307873,0.002346434,0.005123787,0.001374419],"category_scores_gemma":[0.07170636,0.001359175,0.001127618,0.002602431,0.01878156,0.03714928,0.009208269,0.01281183,0.0006169698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005549296,"about_ca_system_score_gemma":0.009157106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003437137,"about_ca_topic_score_gemma":0.004959668,"domain_scores_codex":[0.9644681,0.01579294,0.001920047,0.001856597,0.01434677,0.001615499],"domain_scores_gemma":[0.9037346,0.05463267,0.004501927,0.02445681,0.01093732,0.001736692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001012368,0.0001393708,0.007809752,0.001057259,0.00007511445,0.001363791,0.05888037,0.00677599,0.006961025,0.6580594,0.01629446,0.2424822],"study_design_scores_gemma":[0.0000272087,0.0002376664,0.002456101,0.002459452,0.00005507085,0.002465708,0.02474934,0.02056652,0.00869486,0.6207321,0.3172907,0.0002652611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.1437377,0.02941271,0.6156038,0.1572421,0.001570205,0.0002521962,0.0001447793,0.001658082,0.05037848],"genre_scores_gemma":[0.6648684,0.01339199,0.3015198,0.009830563,0.0006887679,0.0002253201,0.0001964664,0.001404681,0.007874068],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.04915947,"threshold_uncertainty_score":0.2599833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}