{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000164396,0.000299808,0.0007948454,0.0004954704,0.0001244533,0.00002660783,0.0007110263,0.001385074,0.00001085926],"category_scores_gemma":[0.00001229431,0.00027233,0.0001129804,0.0006036089,0.0003028503,0.0001049946,0.0001478114,0.0003388855,0.00003258134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003903496,"about_ca_system_score_gemma":0.00009408306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005635575,"about_ca_topic_score_gemma":0.000004899581,"domain_scores_codex":[0.9984218,0.00008998734,0.0006662444,0.000543124,0.00003276876,0.0002460013],"domain_scores_gemma":[0.9989008,0.0001475903,0.0004469107,0.0004473549,0.0000322896,0.00002508496],"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.00001323208,0.00003297641,6.366932e-8,0.0009719093,0.00006343643,4.533963e-7,0.00008244958,7.749116e-7,0.005569089,0.1071755,0.0001182206,0.8859719],"study_design_scores_gemma":[0.0004759158,0.0001027683,1.193825e-7,0.0004697131,0.0001173,0.0001022362,0.00001756222,0.00004642916,0.008974926,0.0002480675,0.9891143,0.000330624],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001950508,0.9233673,0.07456133,0.000170907,0.0004797048,0.0006590078,0.00004187642,0.000258558,0.0002663184],"genre_scores_gemma":[0.0002926062,0.991168,0.007896024,0.00004050872,0.00003740894,0.00003423639,0.0005042105,0.00001256221,0.00001441604],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9889961,"threshold_uncertainty_score":0.9999729,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464457,0.00009542073,0.00008580359,0.00001713481,0.0003260897,0.0000962062,0.001092077,0.00004660268,0.00003266413],"category_scores_gemma":[0.00006958232,0.0000658498,0.0000678817,0.0002231045,0.0000444773,0.0001933413,0.0001977783,0.000101758,0.00003391015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001276219,"about_ca_system_score_gemma":0.00003077267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003228873,"about_ca_topic_score_gemma":0.000006015529,"domain_scores_codex":[0.9991636,0.00004088047,0.0001792398,0.0002744563,0.000117446,0.0002243571],"domain_scores_gemma":[0.9989486,0.0002823278,0.00008277268,0.0005173863,0.0001261672,0.00004273355],"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.00001080113,0.0001123775,0.0005982446,0.00005199234,0.00002975883,0.000001847962,0.04150693,0.0003318273,0.0002581038,0.9164616,0.01570343,0.02493312],"study_design_scores_gemma":[0.0003183773,0.00008454295,0.001428844,0.00002081254,0.000008422378,0.00001922922,0.001782526,0.959443,0.005660105,0.00711576,0.02385247,0.0002658472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038107,0.0001059852,0.8854626,0.003190722,0.0006264573,0.0002968894,0.000001523714,0.0002457153,0.0062594],"genre_scores_gemma":[0.7818992,0.000003294318,0.2163592,0.001242286,0.0001308452,0.00001328706,9.671489e-7,0.000007366098,0.0003435605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9591112,"threshold_uncertainty_score":0.2685277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002715987,0.00009359869,0.0001172716,0.00007242574,0.0006042903,0.0001563248,0.0006281845,0.0000434271,0.00003170288],"category_scores_gemma":[0.00009817175,0.00009293264,0.00007495139,0.00024454,0.00004218356,0.0005325712,0.000176999,0.00006482463,0.00006657071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002220946,"about_ca_system_score_gemma":0.00008464027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000232769,"about_ca_topic_score_gemma":0.000001633035,"domain_scores_codex":[0.9990209,0.00001950713,0.0002383456,0.0003159785,0.000144939,0.0002602685],"domain_scores_gemma":[0.9991847,0.0002170847,0.00008071431,0.00034945,0.0001110705,0.00005696422],"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.00001373811,0.0001399571,0.004905613,0.0001024433,0.00003725923,0.00002509333,0.009507615,0.0001986302,0.002895665,0.9330353,0.02948134,0.01965734],"study_design_scores_gemma":[0.001895215,0.0003453264,0.009504105,0.00006330006,0.0000175346,0.0006390057,0.0009504122,0.7088323,0.05357294,0.02778156,0.1951776,0.001220668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03215193,0.00005458859,0.9608957,0.0005793998,0.0005774695,0.0001483591,0.000001054063,0.0003362173,0.005255308],"genre_scores_gemma":[0.8036046,0.00001159792,0.1940212,0.0008905528,0.0001025492,0.00001696787,0.000003710319,0.000007176286,0.001341666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9052538,"threshold_uncertainty_score":0.4647774,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479896,0.000073646,0.00008538907,0.00005458553,0.0001773743,0.00009167517,0.0002230634,0.00004728126,0.00001782362],"category_scores_gemma":[0.00001857639,0.0000710202,0.00002590082,0.0001861895,0.00005097698,0.0002516348,0.00004154599,0.00008443336,0.00000934038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002324021,"about_ca_system_score_gemma":0.00001554037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002332983,"about_ca_topic_score_gemma":0.0001547216,"domain_scores_codex":[0.9991376,0.00003122665,0.000224084,0.0002898202,0.000155475,0.0001617943],"domain_scores_gemma":[0.9993532,0.0001613579,0.00004595392,0.0003166313,0.00005956838,0.00006333585],"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.00003448734,0.0001174266,0.005173985,0.00009549134,0.00002175441,0.00000393096,0.0301627,0.00002410738,0.003839229,0.2434754,0.0004609089,0.7165905],"study_design_scores_gemma":[0.0008272638,0.0002304304,0.2678694,0.00003791161,0.0000122287,0.00005665057,0.001630696,0.3110577,0.368369,0.02714807,0.02205294,0.0007077793],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1472798,0.00002880535,0.8448047,0.0006234362,0.0002019745,0.00006531095,0.000001050533,0.0001864151,0.006808556],"genre_scores_gemma":[0.9829195,0.00001257252,0.01618326,0.000756907,0.00004414636,0.000001291771,5.455097e-7,0.000002333151,0.00007943267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8356398,"threshold_uncertainty_score":0.289612,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704821,0.0001077155,0.000147424,0.00005620227,0.0004003755,0.0006080114,0.0004000059,0.00005156202,0.000005460622],"category_scores_gemma":[0.00001849747,0.0001117107,0.0000169284,0.0002542103,0.000037218,0.0002260669,0.0001404958,0.0001320836,0.00002335326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003498079,"about_ca_system_score_gemma":0.00002520301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002653131,"about_ca_topic_score_gemma":0.000002549604,"domain_scores_codex":[0.9990009,0.00005342627,0.0002526835,0.0003410726,0.0001323677,0.0002195325],"domain_scores_gemma":[0.9992478,0.0001761454,0.00013533,0.0003362226,0.00006623221,0.00003828667],"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.00000158492,0.00004899015,0.0143184,0.00027119,0.00003762428,0.00000384085,0.007153315,0.00506231,0.005225302,0.9500182,0.0008128129,0.01704648],"study_design_scores_gemma":[0.0006936435,0.00008143261,0.007520957,0.0002994276,0.00005394126,0.00008447639,0.006205895,0.8883771,0.010865,0.003381467,0.0814243,0.001012322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08492871,0.0005824117,0.8951245,0.0006262221,0.00009561392,0.0002771326,0.00000123698,0.0002778309,0.01808634],"genre_scores_gemma":[0.9736184,0.000002234997,0.02548334,0.00005352233,0.000218779,0.0000333549,0.000002708959,0.000008022385,0.0005795606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9466367,"threshold_uncertainty_score":0.5863068,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215352,0.000136485,0.000134849,0.00009313197,0.0006377646,0.0004754564,0.0005914911,0.00005101568,0.00007565634],"category_scores_gemma":[0.00008232819,0.0001266825,0.00004038683,0.0004347341,0.00001047538,0.0004475187,0.00009716558,0.0001287421,0.00007535603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007511018,"about_ca_system_score_gemma":0.00005770134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000317013,"about_ca_topic_score_gemma":0.000008278311,"domain_scores_codex":[0.9982965,0.0002387385,0.0003401893,0.0004599788,0.0002486082,0.0004159909],"domain_scores_gemma":[0.9989493,0.0001011532,0.000103143,0.000627953,0.0001126379,0.0001058292],"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":[6.54751e-7,0.0000299895,0.0004517089,0.00001803689,0.000007368885,0.00000445313,0.0006838064,0.0003913269,0.0003560981,0.9915733,0.0001381178,0.006345107],"study_design_scores_gemma":[0.0007459216,0.0001569649,0.0008818105,0.00009773779,0.000006083216,0.00006917857,0.003666619,0.9538741,0.02078802,0.0002987818,0.01895124,0.0004635425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1020087,0.00001974205,0.8125779,0.0001831784,0.000747311,0.0002639019,0.000001414554,0.001067906,0.08312996],"genre_scores_gemma":[0.9225292,3.146368e-7,0.07684071,0.0003842514,0.00006843411,0.00001014952,0.000003842436,0.000009084354,0.000154041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9912745,"threshold_uncertainty_score":0.5165964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00306506,0.0001970988,0.00035087,0.00003341856,0.001041629,0.0008398519,0.002275671,0.00006597449,0.000005829582],"category_scores_gemma":[0.00102261,0.0001301795,0.0001080267,0.0004740714,0.00002674221,0.0005407099,0.0005382691,0.0002237943,0.0004582306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001648934,"about_ca_system_score_gemma":0.00009540448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004875982,"about_ca_topic_score_gemma":0.000004361499,"domain_scores_codex":[0.9973071,0.0006166727,0.0008952385,0.0004555052,0.000398057,0.0003274605],"domain_scores_gemma":[0.9966744,0.0007393891,0.0003404766,0.001929328,0.0002280475,0.00008832429],"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.00000233988,0.00005331974,0.000137162,0.006608339,0.0000818851,0.00001390422,0.0007443618,0.002504408,0.000387635,0.2863199,0.07523417,0.6279126],"study_design_scores_gemma":[0.0001803666,0.00005251269,0.00004225188,0.01399487,0.00002269885,0.000296192,0.0001733416,0.1660652,0.0001819836,0.00003393108,0.8185324,0.0004242065],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.003241993,0.7552236,0.203375,0.01906827,0.006558208,0.00316249,0.000006691374,0.001371175,0.007992541],"genre_scores_gemma":[0.8747479,0.04803426,0.06430658,0.006724173,0.003556747,0.0007034424,0.00002161131,0.00007856958,0.001826691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8715059,"threshold_uncertainty_score":0.8098711,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001988945,0.0001139523,0.00009551109,0.00007243783,0.0001789191,0.0001379873,0.0007173045,0.00005095416,0.00009475802],"category_scores_gemma":[0.00006219395,0.0001060398,0.00005575706,0.0003572417,0.00002691123,0.0002038189,0.00006483176,0.0001088623,0.0004284151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006759693,"about_ca_system_score_gemma":0.0000691465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002343984,"about_ca_topic_score_gemma":0.00001987801,"domain_scores_codex":[0.9989219,0.00003842796,0.0001634864,0.0003970104,0.0002495254,0.000229668],"domain_scores_gemma":[0.9990036,0.0001385058,0.00006725964,0.0006479512,0.00006926493,0.00007336028],"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.0000637624,0.000879844,0.002307919,0.0001242773,0.00004446714,0.00002594989,0.002400835,0.07415057,0.0009606644,0.3084002,0.3600861,0.2505555],"study_design_scores_gemma":[0.0003813405,0.0000378716,0.001312123,0.00003820359,0.000002151275,0.000001769726,0.00001072005,0.2704849,0.009007007,0.0002294422,0.7181757,0.0003187517],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01054533,0.0001113547,0.9761471,0.005424543,0.0002096021,0.00008548867,7.867842e-7,0.0004870468,0.006988777],"genre_scores_gemma":[0.5333807,0.000002485589,0.4567997,0.006905141,0.0002003272,0.00001156783,0.000002015067,0.00000834103,0.002689712],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5228354,"threshold_uncertainty_score":0.5506552,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710548,0.00004273962,0.0000371047,0.000018409,0.0003475917,0.0002189972,0.0005858326,0.00002298876,0.000009697909],"category_scores_gemma":[0.00002076254,0.00002711766,0.00002595744,0.0001448211,0.00001290218,0.0002301742,0.0001468946,0.00005725935,0.0003379084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004482004,"about_ca_system_score_gemma":0.00001996446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009020927,"about_ca_topic_score_gemma":0.000006582642,"domain_scores_codex":[0.9994479,0.00004092241,0.0001314077,0.0001408142,0.0001220051,0.0001169565],"domain_scores_gemma":[0.9993337,0.0001616598,0.00004139315,0.0003975533,0.0000367075,0.00002902988],"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.000001315522,0.000007450788,0.00001821743,0.00000307409,0.000002773948,4.455739e-7,0.0001440451,0.0002297007,0.00004989204,0.7396222,0.0101807,0.2497401],"study_design_scores_gemma":[0.00008671431,0.00001557601,0.000287508,0.0000147938,9.842512e-7,0.00001890929,0.0001135239,0.5723046,0.00232978,0.0009007968,0.4238344,0.00009237105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0063694,0.0001643786,0.9541131,0.005934245,0.0008292125,0.00007402308,1.963141e-7,0.0003530018,0.03216245],"genre_scores_gemma":[0.9612188,0.00001621842,0.03693688,0.0006709487,0.0002801963,0.000004815989,3.963009e-7,0.00000258156,0.000869214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9548494,"threshold_uncertainty_score":0.4343242,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001310515,0.000309627,0.0003174422,0.0002876671,0.0005437143,0.0001856408,0.0009075708,0.0001505525,0.00001682922],"category_scores_gemma":[0.00002324486,0.0003591707,0.0001895221,0.0005689875,0.00006236813,0.0001721133,0.00001714664,0.0006365976,0.0001178498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002086051,"about_ca_system_score_gemma":0.00006837282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007577895,"about_ca_topic_score_gemma":0.00001674158,"domain_scores_codex":[0.9970361,0.0003908317,0.0006858326,0.0008383712,0.0004443204,0.0006045712],"domain_scores_gemma":[0.997901,0.0008450359,0.0002452806,0.0008201099,0.00004248736,0.0001460787],"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.00001134535,0.000350963,0.00006141736,0.00004215508,0.0000179437,0.000005985501,0.001382776,0.9236978,0.0003474029,0.001514186,0.00003970459,0.07252835],"study_design_scores_gemma":[0.0008199686,0.0001129119,0.0002457995,0.0001733672,0.000009814027,0.0000119184,0.000062802,0.9863452,0.01009875,0.0008624475,0.0008715352,0.0003855339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07628868,0.00002947909,0.9200873,0.0006028741,0.001926785,0.0002611346,0.000001657246,0.0003395869,0.0004625165],"genre_scores_gemma":[0.973024,0.000003525917,0.02597295,0.0005937119,0.0003107839,0.00001821196,0.000001445044,0.00002717439,0.00004825995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8967353,"threshold_uncertainty_score":0.999886,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336025,0.00008743078,0.00008408802,0.00006178256,0.0001567214,0.0000898459,0.0005510832,0.00006106064,0.0000164899],"category_scores_gemma":[0.00008697464,0.00008380182,0.00007055295,0.0001935262,0.00001952097,0.0002605686,0.0001021138,0.00006811581,0.00001641038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003659025,"about_ca_system_score_gemma":0.00005488547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009471813,"about_ca_topic_score_gemma":0.000005479632,"domain_scores_codex":[0.9990732,0.000006488755,0.0001869291,0.0002949541,0.0001607556,0.000277636],"domain_scores_gemma":[0.9991807,0.0002132426,0.00004776713,0.0003789094,0.00009795006,0.00008142518],"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.00002211907,0.0001179847,0.001140691,0.00004498738,0.00002427927,0.000002260522,0.002069163,0.0060382,0.0004651353,0.8763534,0.02799296,0.08572886],"study_design_scores_gemma":[0.0002330498,0.00002371408,0.0005858032,0.000006709434,0.000002073231,0.000003318004,0.00002569054,0.9721258,0.002733405,0.01676002,0.007349858,0.0001505331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004945528,0.00003911617,0.9902802,0.0003975884,0.0002853762,0.0001537442,0.000001309796,0.0002644389,0.00363277],"genre_scores_gemma":[0.3322551,0.000001415447,0.6660784,0.001067714,0.00007473398,0.000007469962,0.000002696653,0.000005015847,0.0005074482],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9660876,"threshold_uncertainty_score":0.3417339,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000124881,0.00005529548,0.00004999107,0.000008427593,0.0002618495,0.0002264579,0.0009788342,0.00002280797,0.00000355821],"category_scores_gemma":[0.0000419216,0.00004102772,0.00002883145,0.000235959,0.00003062097,0.0001152843,0.00008267976,0.00009790905,0.0002306238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009073963,"about_ca_system_score_gemma":0.00004180184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003279589,"about_ca_topic_score_gemma":8.552574e-7,"domain_scores_codex":[0.999417,0.00002633092,0.0001152923,0.0001954833,0.0001014864,0.0001443772],"domain_scores_gemma":[0.9995151,0.00009506905,0.00004994781,0.0002368949,0.00004938158,0.00005365643],"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.00003475057,0.0001239786,0.0008910357,0.0001371071,0.00007871833,0.00002941526,0.03666783,0.0004158452,0.2283866,0.1279792,0.3346977,0.2705578],"study_design_scores_gemma":[0.0002413312,0.00004765592,0.0004079634,0.00001303426,0.000003231758,0.00001390491,0.00009900123,0.0739802,0.1991938,0.002423271,0.723358,0.0002186352],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06180394,0.0007888118,0.8722599,0.0592506,0.001376741,0.0002280827,0.000001717476,0.00050894,0.003781323],"genre_scores_gemma":[0.9837008,0.00001990831,0.01075187,0.004959471,0.0003728896,0.000007706653,3.90537e-7,0.000006050973,0.0001809483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9218968,"threshold_uncertainty_score":0.2964279,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00544631,0.0004887133,0.0008747142,0.0001364261,0.001566291,0.00140829,0.002244207,0.0001342284,0.0000395503],"category_scores_gemma":[0.002199991,0.0004361131,0.0001562728,0.001113472,0.00002600438,0.0009495415,0.0003846734,0.0004289613,0.0001756185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002484433,"about_ca_system_score_gemma":0.0002164962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000120409,"about_ca_topic_score_gemma":0.000005945837,"domain_scores_codex":[0.9934335,0.002086316,0.001694635,0.001171162,0.0007075999,0.0009068245],"domain_scores_gemma":[0.9954121,0.0004977146,0.0006302039,0.002698686,0.0005017001,0.0002596166],"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.000002000615,0.0001948658,0.001627668,0.0142857,0.0001645917,0.00008603257,0.002530187,0.003632751,0.001816832,0.9389729,0.00304378,0.0336427],"study_design_scores_gemma":[0.002631511,0.0008822719,0.0003518086,0.07917092,0.0002067405,0.001812077,0.0065415,0.6607808,0.003747104,0.00007499791,0.2399992,0.003800997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1001652,0.2151221,0.56206,0.003628982,0.01712718,0.01926656,0.00008447758,0.009657275,0.0728882],"genre_scores_gemma":[0.9520515,0.000489159,0.04470582,0.001654033,0.0004162836,0.0003520647,0.00004210387,0.00007296955,0.0002160868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9388979,"threshold_uncertainty_score":0.9998091,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005131813,0.0001007875,0.0001090603,0.00003376871,0.0003491733,0.0001297821,0.0006104296,0.00005604713,0.000006767303],"category_scores_gemma":[0.00002349494,0.0001041083,0.00004889231,0.0002435828,0.00002938102,0.0002724493,0.0001895332,0.00007713727,0.00004106751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210636,"about_ca_system_score_gemma":0.00005311701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003685564,"about_ca_topic_score_gemma":0.000008744285,"domain_scores_codex":[0.9989725,0.00004129766,0.0002199358,0.0003256304,0.0002003491,0.0002402276],"domain_scores_gemma":[0.9991257,0.00010357,0.00009678669,0.0005027329,0.00004827433,0.0001229615],"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.0000312143,0.0004058942,0.001782644,0.00005669619,0.00006244978,0.000001049545,0.003097225,0.04741907,0.00003254113,0.7235562,0.07377166,0.1497833],"study_design_scores_gemma":[0.0003813132,0.00002636824,0.0009268228,0.000006761405,0.000004295913,0.000003330299,0.00005518816,0.6279448,0.00009773246,0.008323628,0.3621041,0.0001256299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005866322,0.00006462554,0.9948536,0.001260751,0.0002988096,0.0004952388,0.000002877841,0.0001873248,0.0022501],"genre_scores_gemma":[0.6356369,0.000006481703,0.36285,0.0006239629,0.0003186686,0.0002753858,0.00002762894,0.00000830948,0.0002526657],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7152326,"threshold_uncertainty_score":0.4245415,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575661,0.000150753,0.0001725641,0.0001963419,0.0007346096,0.0000637409,0.001187833,0.000134356,0.00004959426],"category_scores_gemma":[0.00002328592,0.0001583514,0.0001282006,0.0005380046,0.00005924648,0.0008611744,0.00001596155,0.0004686514,0.00004641172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001724147,"about_ca_system_score_gemma":0.0001448689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001096457,"about_ca_topic_score_gemma":0.00003267812,"domain_scores_codex":[0.9980894,0.0004137712,0.0005394066,0.0003180118,0.0004510405,0.0001884205],"domain_scores_gemma":[0.9975497,0.000466859,0.0003354197,0.001268312,0.0003130966,0.00006667262],"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.0003181083,0.007762146,0.0003178858,0.0005707875,0.0003582617,0.000002690819,0.02154289,0.02123511,0.01868314,0.1493706,0.00573069,0.7741077],"study_design_scores_gemma":[0.00878593,0.0005136859,0.05244039,0.006604358,0.0003061168,0.0001045597,0.002117556,0.3650454,0.3479936,0.03150146,0.1806699,0.00391711],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01652221,0.0003104891,0.9787984,0.002678687,0.0005231878,0.0002539874,0.000008866907,0.0004046969,0.0004994766],"genre_scores_gemma":[0.7915187,0.00009275802,0.2076197,0.0002128372,0.00002301179,0.00005485216,0.000009818977,0.00001148914,0.0004567604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7749965,"threshold_uncertainty_score":0.6457384,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086627,0.0001239768,0.000173687,0.0001228942,0.0003194577,0.0006859266,0.001096728,0.00005740824,0.00008708148],"category_scores_gemma":[0.0005950823,0.0001135428,0.00006727542,0.0006439817,0.00005232694,0.0007696663,0.0002475932,0.0001951329,0.0002474419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003378139,"about_ca_system_score_gemma":0.00008092737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001061618,"about_ca_topic_score_gemma":0.00002308044,"domain_scores_codex":[0.9984493,0.0001431259,0.000343,0.0003872949,0.0002857274,0.000391522],"domain_scores_gemma":[0.9976181,0.001563634,0.00008684437,0.000486241,0.0001427064,0.0001024588],"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.00003309982,0.0001504293,0.02201506,0.0001495152,0.0001259248,0.00004745551,0.006123705,0.003674234,0.002431093,0.7690139,0.004726079,0.1915094],"study_design_scores_gemma":[0.0006038436,0.00004783305,0.01577922,0.00001811056,0.000004929876,0.00000992738,0.0002086642,0.9634521,0.00276509,0.01392923,0.002934071,0.0002469951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115535,0.00002137225,0.8750758,0.00275146,0.000546089,0.0001910044,0.000002219477,0.001333643,0.004543442],"genre_scores_gemma":[0.9889224,0.000005491186,0.009474301,0.001220843,0.00009075419,0.00002875297,0.000001817186,0.000008494517,0.0002471501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9597778,"threshold_uncertainty_score":0.6614406,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002796756,0.0002028014,0.0002128628,0.00009941356,0.0001073826,0.0004778207,0.00213327,0.0002415399,0.0002767174],"category_scores_gemma":[0.00001676352,0.0001990662,0.0001135817,0.00009353795,0.00005920419,0.0002772759,0.0005202199,0.000325446,0.002819319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083986,"about_ca_system_score_gemma":0.000440282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003518668,"about_ca_topic_score_gemma":0.000001861976,"domain_scores_codex":[0.9984962,0.00002713673,0.0002931119,0.0006161592,0.0003266379,0.0002407432],"domain_scores_gemma":[0.9982762,0.0001805352,0.000182125,0.001194716,0.00009916842,0.00006729193],"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":[8.458304e-7,0.00001073704,0.00005975916,0.0000364407,0.00001224619,0.000006690519,0.0002758157,0.00002437304,0.000006110291,0.9313087,0.05428988,0.01396843],"study_design_scores_gemma":[0.0001203939,0.0000289927,0.0001131573,0.00007462961,0.000001916139,0.00002055492,0.000001795481,0.01230523,0.00005235479,0.05876846,0.9281403,0.0003722028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001330244,0.0001003761,0.435375,0.00007945528,0.001054355,0.00009608139,0.000001004332,0.0002032989,0.5630772],"genre_scores_gemma":[0.0005932651,0.00001045334,0.04768259,0.0007165271,0.0002561565,0.00000453158,0.0000108506,0.00001386325,0.9507118],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8738504,"threshold_uncertainty_score":0.9979571,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003076559,0.00005527384,0.00009213394,0.00008268175,0.00003302961,0.00001716395,0.0004761524,0.00003377322,0.00005130584],"category_scores_gemma":[0.00005367069,0.00003571379,0.00002497028,0.0002498578,0.00004095035,0.0003238022,0.00008081773,0.00003026139,0.00007004118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002916319,"about_ca_system_score_gemma":0.00003848714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000396424,"about_ca_topic_score_gemma":0.00000406757,"domain_scores_codex":[0.9992378,0.00004213257,0.0002834885,0.0001981901,0.0001258193,0.000112602],"domain_scores_gemma":[0.9993587,0.00009306129,0.00006793423,0.0003959593,0.00006202265,0.00002236417],"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.00002081862,0.0001267483,0.007527313,0.00001492509,0.00000729943,9.215474e-7,0.001442194,0.00004244242,0.07591192,0.6532634,0.0004244806,0.2612175],"study_design_scores_gemma":[0.003128265,0.0002925325,0.2652939,0.0003633994,0.000007893051,0.00003035255,0.0004157786,0.135411,0.4704617,0.02199907,0.1015308,0.001065286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1278735,0.00008774814,0.853763,0.003309077,0.0002408481,0.000114781,8.984151e-7,0.0001323106,0.01447781],"genre_scores_gemma":[0.9747644,0.00002102206,0.02481893,0.00009921792,0.0000173467,0.000003543867,3.307773e-7,0.000002719634,0.0002724828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8468909,"threshold_uncertainty_score":0.1456366,"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#","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001054081,0.00006417493,0.00007018972,0.00002019419,0.00009361072,0.000179079,0.0003539279,0.0000215346,0.00005958016],"category_scores_gemma":[0.00002181408,0.00005402994,0.00001898789,0.0002457152,0.00001172477,0.0004017219,0.00007012529,0.00007675558,0.0001313042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009481976,"about_ca_system_score_gemma":0.0000295317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001487305,"about_ca_topic_score_gemma":9.312149e-7,"domain_scores_codex":[0.9993557,0.00002450224,0.0001162285,0.0002327783,0.0001527058,0.0001180545],"domain_scores_gemma":[0.9995809,0.00005669206,0.00005146731,0.0001839763,0.00005188628,0.00007507376],"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.00003296068,0.0001104589,0.01158739,0.00007128979,0.00006454346,0.00002750766,0.01114329,0.002350559,0.004224965,0.9362267,0.002669969,0.03149042],"study_design_scores_gemma":[0.0006411766,0.000153807,0.005032027,0.00002498959,0.000006489358,0.00002027508,0.00007570184,0.9294941,0.04678554,0.0008561212,0.01659007,0.0003196524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027939,0.00001587033,0.9356786,0.00457852,0.00007747682,0.00008142873,2.14169e-7,0.000348071,0.008940398],"genre_scores_gemma":[0.9571461,0.000001590419,0.04102292,0.001720471,0.00007434795,0.000002597492,0.000001473626,0.000003642363,0.00002685799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9353705,"threshold_uncertainty_score":0.2203277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439055,0.0001005085,0.00009003575,0.00009016156,0.0001499265,0.0002603286,0.0009997251,0.00005426905,0.00002889139],"category_scores_gemma":[0.00007707801,0.00007611993,0.00004517843,0.0005755565,0.00001849081,0.0002960237,0.0001426071,0.0001409869,0.0005112856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000511408,"about_ca_system_score_gemma":0.00005581346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001537095,"about_ca_topic_score_gemma":0.0002405285,"domain_scores_codex":[0.9987954,0.0001467195,0.0002282223,0.0003061137,0.000248588,0.0002749387],"domain_scores_gemma":[0.9989547,0.0002441776,0.00005055558,0.0005977697,0.00008635227,0.00006651479],"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.00003311385,0.001296484,0.005339384,0.0001565128,0.00004530069,0.00003928284,0.05463287,0.07826928,0.005502635,0.6183318,0.1347332,0.1016201],"study_design_scores_gemma":[0.0003340477,0.00007184884,0.02098128,0.0000307103,0.00000188691,0.000007777287,0.0003710252,0.9633825,0.002256487,0.00862406,0.003692928,0.0002453808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294475,0.00002385149,0.8420922,0.02391489,0.0003999436,0.0003727753,3.077397e-7,0.0001486323,0.003599981],"genre_scores_gemma":[0.9791195,5.888441e-7,0.01278615,0.007821329,0.0001102426,0.00005604023,0.00000149722,0.000004219621,0.0001003943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8851133,"threshold_uncertainty_score":0.6571713,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004420082,0.00006036254,0.00005595362,0.0001693244,0.0001467961,0.000119766,0.0008023145,0.00004763745,0.00001550459],"category_scores_gemma":[0.0001301873,0.00004285478,0.00002081065,0.0004860316,0.00005736146,0.0001790535,0.0001061362,0.0002356354,0.00006960504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004990275,"about_ca_system_score_gemma":0.00004222498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009407647,"about_ca_topic_score_gemma":0.0004718503,"domain_scores_codex":[0.998672,0.0001937054,0.0001873809,0.0002706943,0.0003787588,0.0002974567],"domain_scores_gemma":[0.9977569,0.001572214,0.00003448257,0.0004685196,0.0001273463,0.00004053017],"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.000009703869,0.0001419974,0.001261308,0.00002205497,0.000004846613,0.00001104213,0.01017827,0.0008984513,0.0005125304,0.8495315,0.001492497,0.1359358],"study_design_scores_gemma":[0.0009556377,0.0002081655,0.2304605,0.00009741576,0.000002275556,0.00001301949,0.005414028,0.5513763,0.01874714,0.02730615,0.1649425,0.0004769206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.147519,0.000909564,0.7649166,0.05912252,0.0004000042,0.0003952745,3.617479e-7,0.0002595671,0.02647715],"genre_scores_gemma":[0.9844923,0.00005768783,0.01486688,0.0004376451,0.00006709353,0.000007628693,0.000001071694,0.000003557007,0.00006610827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8369734,"threshold_uncertainty_score":0.1747567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008117706,0.00005026646,0.00004993151,0.00003641551,0.0001818513,0.00004467716,0.0001743194,0.00002371595,0.000004153942],"category_scores_gemma":[0.000007513359,0.00004274398,0.000008837067,0.0001642087,0.00003006591,0.0003181112,0.00004851073,0.0000427126,0.00002135636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001092166,"about_ca_system_score_gemma":0.00003255206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003041907,"about_ca_topic_score_gemma":0.000004861936,"domain_scores_codex":[0.9995058,0.00001239712,0.00009227881,0.0002065601,0.00009836698,0.00008461261],"domain_scores_gemma":[0.9995697,0.0000615895,0.00004216175,0.0002392907,0.00005101515,0.0000362254],"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.00002695477,0.0001832116,0.04776954,0.00003241314,0.00004231098,0.000007206211,0.004976184,0.001333366,0.00165029,0.8259996,0.004778518,0.1132004],"study_design_scores_gemma":[0.0004731606,0.000114247,0.2013656,0.0000127108,0.00000336146,0.0002636712,0.00004801528,0.7792275,0.001612838,0.008859203,0.007687142,0.0003325233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02482513,0.00002985704,0.9701888,0.0005684369,0.00003413697,0.0000719798,2.657413e-7,0.0001189239,0.004162492],"genre_scores_gemma":[0.7964653,0.00001792774,0.2029562,0.0003315191,0.00002934645,0.000007464381,0.000001222992,0.000002236669,0.0001888097],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8171404,"threshold_uncertainty_score":0.1743049,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393733,0.00001937544,0.00002068663,0.00002471262,0.0002382246,0.00003619182,0.0005164148,0.000003355048,0.0003198582],"category_scores_gemma":[0.000004285149,0.00002040404,0.00001387811,0.0001996285,0.000003942826,0.00007952058,0.0003540362,0.00005520095,0.00004721059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001546217,"about_ca_system_score_gemma":0.00001583879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007337075,"about_ca_topic_score_gemma":1.597638e-7,"domain_scores_codex":[0.9996435,0.0000263744,0.00004964904,0.0001053808,0.0001119752,0.00006313477],"domain_scores_gemma":[0.9997267,0.00002654408,0.00001442537,0.0002088628,0.000007335687,0.00001610358],"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":[1.880106e-7,0.00001576816,0.00008668315,4.13713e-7,9.741684e-7,0.000001426902,0.0004162911,0.0004203953,0.00007141508,0.9794175,0.005637287,0.01393167],"study_design_scores_gemma":[0.00009116808,0.0000309739,0.0006108406,3.051705e-7,3.507959e-7,0.00002821171,0.0001071282,0.4845918,0.0007184802,0.01893269,0.4947953,0.00009280954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006380949,0.00002774039,0.9298518,0.002520979,0.0004501747,0.00002779497,1.609943e-7,0.0002517639,0.06048865],"genre_scores_gemma":[0.9728751,2.99654e-7,0.02493783,0.001466993,0.00002029034,0.000007258319,3.55311e-7,0.000001025445,0.0006908261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9664941,"threshold_uncertainty_score":0.3502223,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007008757,0.0002664684,0.0003067909,0.0004978052,0.0009330826,0.0005406375,0.001940536,0.0001710556,0.000003433106],"category_scores_gemma":[0.001188481,0.0002472974,0.00004197433,0.001492089,0.0003028543,0.0002864086,0.0007088692,0.000326775,0.00003693324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008928843,"about_ca_system_score_gemma":0.0001276973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002115125,"about_ca_topic_score_gemma":0.0003715283,"domain_scores_codex":[0.9955838,0.002549322,0.0006256526,0.0006235665,0.0002657045,0.0003519784],"domain_scores_gemma":[0.9929316,0.003347061,0.0003433143,0.002865079,0.0004298472,0.00008306906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002421672,0.000298902,0.01881994,0.00005277544,0.0002090248,0.000001162456,0.01114671,0.0006496995,0.007525207,0.2295114,0.01686542,0.7148955],"study_design_scores_gemma":[0.00174005,0.0003550125,0.6455389,0.0001473149,0.00002606803,0.00001274838,0.001692378,0.1844221,0.01548534,0.110813,0.03824377,0.001523231],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7292074,0.001812161,0.2245347,0.03261705,0.004110594,0.002271438,0.0004692802,0.004335428,0.0006419811],"genre_scores_gemma":[0.9964563,0.0006836863,0.002272867,0.0001261727,0.00008545646,0.0001287779,0.0001868129,0.00002214557,0.00003781957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7133723,"threshold_uncertainty_score":0.9999979,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001132445,0.00007634582,0.00006464802,0.00007179072,0.0001252146,0.00005558757,0.0002445391,0.00004044803,0.00003495798],"category_scores_gemma":[0.000002413172,0.00007708255,0.00003302627,0.0002538546,0.00001902356,0.0009651962,0.00004375615,0.00006769132,0.0001453412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003824513,"about_ca_system_score_gemma":0.00001333386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000150937,"about_ca_topic_score_gemma":0.000001357751,"domain_scores_codex":[0.999294,0.00005421176,0.0001643895,0.0001571474,0.0001497005,0.0001805339],"domain_scores_gemma":[0.9995489,0.00007032914,0.00005811942,0.0002180521,0.00004324484,0.00006142798],"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.0000129179,0.0002443681,0.003749391,0.00004379576,0.00002871845,0.000001014743,0.008540191,0.0006068549,0.02067447,0.09396061,0.0002829182,0.8718548],"study_design_scores_gemma":[0.0003385723,0.00004552318,0.0491434,0.000007792165,0.000004113829,0.00001999191,0.0001542549,0.9397661,0.00244742,0.001840695,0.006041452,0.0001906987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1565004,0.0002034461,0.8402795,0.0004996941,0.0005591497,0.0001002589,3.504396e-7,0.000195035,0.001662199],"genre_scores_gemma":[0.9122587,0.00001066068,0.08727104,0.000365853,0.00004335167,0.00000509308,0.000009831904,0.000003871946,0.00003161802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9391592,"threshold_uncertainty_score":0.3143335,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005500216,0.0001102138,0.0001202483,0.00007614695,0.001017331,0.000158889,0.0007883555,0.00003212425,0.001054768],"category_scores_gemma":[0.00002468224,0.0001206111,0.00005907223,0.000521852,0.00002665059,0.0003728849,0.0006706842,0.0001707716,0.0002552805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009321014,"about_ca_system_score_gemma":0.00003755641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009867522,"about_ca_topic_score_gemma":0.000004704383,"domain_scores_codex":[0.9984513,0.0001322792,0.0002696833,0.0004367441,0.0004236493,0.0002863431],"domain_scores_gemma":[0.9991623,0.0001272406,0.0001572312,0.0004402286,0.00004718784,0.0000658053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003298196,0.0004785148,0.006844366,0.00004367777,0.00008046539,0.00002097322,0.01000847,0.006562395,0.02082265,0.2098143,0.6933948,0.05189644],"study_design_scores_gemma":[0.0005147203,0.00007647788,0.0006183333,0.00001269908,0.000005519291,0.00003887171,0.0002266642,0.671489,0.01947512,0.0008867101,0.3062892,0.0003667033],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.401329,0.0009900879,0.5484968,0.007897001,0.001844893,0.0004012877,0.00001205549,0.001013873,0.038015],"genre_scores_gemma":[0.975116,0.000006029114,0.01722275,0.001468345,0.0000662891,0.00004352647,0.00003164659,0.00001162154,0.006033781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6649266,"threshold_uncertainty_score":0.9998584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009981518,0.0002564201,0.0004152988,0.001956398,0.0001004428,0.0004664985,0.001346655,0.0002213326,0.000009273207],"category_scores_gemma":[0.00008065029,0.000251026,0.00009099822,0.001936016,0.0003835328,0.0009834777,0.0003142747,0.0003569439,0.00001586246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225611,"about_ca_system_score_gemma":0.0002598064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092263,"about_ca_topic_score_gemma":0.0001148919,"domain_scores_codex":[0.9976705,0.00003971612,0.0007201781,0.0006674692,0.0006090784,0.0002930034],"domain_scores_gemma":[0.9979046,0.0003059406,0.0004972807,0.0009000838,0.0003145244,0.00007754963],"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.000002512291,0.0000254777,0.001079369,0.00006450499,0.00001332429,0.00000107437,0.0009706878,0.08632438,0.00002528564,0.01293981,0.00000152555,0.8985521],"study_design_scores_gemma":[0.0001565023,0.00005330153,0.004128908,0.0001575887,0.00001374374,0.00000228134,3.889731e-7,0.9791892,0.0006063674,0.01522438,0.0002145286,0.0002527671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001073136,0.0001085573,0.9974265,0.0003360951,0.0003086232,0.0003827061,0.000002444331,0.00006324279,0.0002987711],"genre_scores_gemma":[0.5496694,0.000010887,0.4500287,0.0002077236,0.00003246188,0.0000103498,0.00002778223,0.000005277323,0.000007422328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8982993,"threshold_uncertainty_score":0.9999942,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001961818,0.000117176,0.0001288374,0.00007814665,0.0003693798,0.0003401041,0.0004240183,0.00005925261,0.000005896615],"category_scores_gemma":[0.00001458217,0.00008967645,0.00002320669,0.0003483213,0.0001001215,0.0001916739,0.00001300385,0.0001399617,0.00001722051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001481306,"about_ca_system_score_gemma":0.00002803488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002463072,"about_ca_topic_score_gemma":0.00008810745,"domain_scores_codex":[0.9990429,0.00007173103,0.000156283,0.0003284858,0.0001968027,0.0002038206],"domain_scores_gemma":[0.9991377,0.0000976254,0.0000685247,0.0004987299,0.0001209148,0.00007648346],"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.00008364217,0.0004105229,0.001918726,0.0002502719,0.0002305853,0.0000438041,0.03271397,0.0002238478,0.0002579484,0.05837304,0.0002403135,0.9052534],"study_design_scores_gemma":[0.007438768,0.02171375,0.00945573,0.003365121,0.0004441857,0.003152572,0.07668066,0.4284731,0.01292885,0.007267253,0.4226505,0.006429603],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2294236,0.0005475999,0.766937,0.0006402492,0.0007695035,0.000391731,0.000004005492,0.000554927,0.0007314304],"genre_scores_gemma":[0.9817774,0.00001929803,0.01790486,0.00004983889,0.0001107162,0.00002209184,0.000001960648,0.000007038209,0.0001067874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8988237,"threshold_uncertainty_score":0.3656899,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642051,0.00009561386,0.00007327103,0.0002125095,0.000246822,0.000293648,0.000132847,0.00006011889,0.00000530601],"category_scores_gemma":[0.00003019245,0.000104693,0.00002379257,0.0002769431,0.00004258663,0.002108762,0.00005190022,0.00008702208,0.0000581221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008076976,"about_ca_system_score_gemma":0.00003659328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000136896,"about_ca_topic_score_gemma":7.596322e-7,"domain_scores_codex":[0.998984,0.00002576512,0.0004221932,0.0001253645,0.0002766741,0.0001659371],"domain_scores_gemma":[0.9992904,0.0001161457,0.0002121364,0.0001113611,0.0001966514,0.00007332521],"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.000006971489,0.00001777502,0.0003582583,0.00002566877,0.0000100568,4.888337e-7,0.006500524,0.01104917,0.0001707064,0.2729898,0.0001119928,0.7087586],"study_design_scores_gemma":[0.001506841,0.0001126331,0.07207811,0.00008290101,0.00001117568,0.00006441893,0.006961862,0.8917657,0.006496154,0.0167454,0.003692776,0.0004820397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0726741,0.0000238309,0.9209821,0.0002354407,0.00044095,0.000154303,5.121984e-7,0.0001906512,0.005298161],"genre_scores_gemma":[0.9665322,0.00001043107,0.03303794,0.0003137947,0.00005854759,0.000004659777,0.00002854031,0.000002353041,0.00001155217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8938581,"threshold_uncertainty_score":0.4269256,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757784,0.0001637787,0.0002189801,0.0002426536,0.0003291373,0.0006402568,0.002757514,0.00004615717,0.000019263],"category_scores_gemma":[0.0003346682,0.0001396201,0.00004932423,0.001255673,0.0003947848,0.000662913,0.0008656189,0.0002280917,0.0000453668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000714999,"about_ca_system_score_gemma":0.00006587472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005726842,"about_ca_topic_score_gemma":0.000001992988,"domain_scores_codex":[0.9976758,0.00009697289,0.0003918337,0.00069072,0.000649655,0.0004950088],"domain_scores_gemma":[0.9983058,0.0004299772,0.0001014579,0.000919621,0.00008781463,0.0001553371],"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":[6.377597e-7,0.00002495832,0.0006473273,0.00002077529,7.879929e-7,0.000002318038,0.0006111838,0.001058294,0.0001729647,0.9004303,0.00002394297,0.09700651],"study_design_scores_gemma":[0.0001076325,0.00001486555,0.006516864,0.00002438925,5.037992e-7,0.00003622162,0.000003057551,0.6918923,0.0009102458,0.3001873,0.0001702024,0.0001363737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05634893,0.00001332277,0.9410437,0.0004158521,0.0006664817,0.0001042213,1.713275e-7,0.0001860082,0.001221286],"genre_scores_gemma":[0.615448,4.024462e-7,0.3841208,0.0003433494,0.00008007384,0.000002679253,1.158784e-7,0.000003210796,0.000001350017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.690834,"threshold_uncertainty_score":0.6174011,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001996436,0.0003879115,0.0004119706,0.000203611,0.0003739091,0.0007619083,0.001884365,0.0003003562,0.00003573213],"category_scores_gemma":[0.0002079379,0.0002889501,0.0002032773,0.0002109525,0.0001570193,0.0004262509,0.001059782,0.0004749178,0.00001398713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001721259,"about_ca_system_score_gemma":0.000467994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003091928,"about_ca_topic_score_gemma":0.00001221563,"domain_scores_codex":[0.9971017,0.0004009091,0.0004926315,0.001141741,0.0003495495,0.0005135192],"domain_scores_gemma":[0.9955405,0.00194688,0.0003077232,0.001720584,0.0003453488,0.0001389639],"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.001222448,0.0002427667,0.000416566,0.0007675654,0.0002313396,0.00001271413,0.01446178,0.0007508607,0.0002712108,0.9528128,0.009284471,0.01952549],"study_design_scores_gemma":[0.002571958,0.000919739,0.001136628,0.001874062,0.00006397066,0.00008709424,0.0009813064,0.1293218,0.008182529,0.7285634,0.1233251,0.00297246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03804164,0.0002781268,0.949207,0.006655553,0.001307507,0.0007767658,0.00002798933,0.0007714149,0.002934024],"genre_scores_gemma":[0.9042794,0.00002231823,0.09361584,0.0005782506,0.0004473033,0.0002896082,0.00001187115,0.00003123738,0.0007242445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8662377,"threshold_uncertainty_score":0.9999563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470962,0.0000623628,0.00008500484,0.00004422734,0.00007761575,0.00002230079,0.0005015476,0.00002781766,0.00003689592],"category_scores_gemma":[0.00002526208,0.00003710543,0.00006118726,0.0003006664,0.00002743788,0.000194996,0.0001097771,0.00006799022,0.000009684876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003955871,"about_ca_system_score_gemma":0.00002972456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001740935,"about_ca_topic_score_gemma":0.000006859319,"domain_scores_codex":[0.9994043,0.00005688287,0.000158557,0.000084849,0.0001630979,0.0001323258],"domain_scores_gemma":[0.9991974,0.0003144449,0.0001058642,0.0003019325,0.00004503873,0.00003528217],"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.00001861417,0.0001359013,0.01395641,0.0000125752,0.00004087109,1.157149e-7,0.008245343,0.004242785,0.001495911,0.9689251,0.0007395726,0.002186769],"study_design_scores_gemma":[0.0006102723,0.0004072308,0.08094524,0.00006176861,0.00001242221,0.00001953755,0.001084267,0.8957395,0.0105785,0.01017998,0.00008483822,0.0002764503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3721188,0.00001627552,0.6230464,0.0004676951,0.0002227555,0.00005132808,0.000001142406,0.00002952035,0.004046074],"genre_scores_gemma":[0.9982477,9.537218e-7,0.001494672,0.00015799,0.00008040779,5.824878e-7,4.01102e-7,0.000002576148,0.00001470398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9587452,"threshold_uncertainty_score":0.1513115,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001667139,0.0004728486,0.0004607098,0.0007080988,0.0009844216,0.001410869,0.007849478,0.0003430765,0.00001469659],"category_scores_gemma":[0.0006166637,0.0005061295,0.0001946628,0.0002113536,0.0005597235,0.0007670576,0.0008676068,0.000548019,0.00003791671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003241424,"about_ca_system_score_gemma":0.0007962771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002403669,"about_ca_topic_score_gemma":0.00003315945,"domain_scores_codex":[0.9959538,0.00003153942,0.0007072762,0.001758857,0.0009488437,0.0005996793],"domain_scores_gemma":[0.9939411,0.0008319796,0.0008295195,0.00359819,0.0006502039,0.0001489904],"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.00001581383,0.00006948595,0.00005843229,0.0001156395,0.00001880392,0.00001728209,0.0005849784,0.02945251,0.0002556119,0.1796764,0.0003599901,0.7893751],"study_design_scores_gemma":[0.0005177349,0.00009998244,0.0001105757,0.0002864772,0.000008247403,0.0000142178,1.014875e-7,0.8072386,0.002083523,0.1748011,0.01427921,0.0005602233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002895792,0.0002279308,0.9894514,0.00292565,0.002558595,0.0006838582,0.00001760373,0.000253423,0.003852578],"genre_scores_gemma":[0.1145155,0.00001918451,0.8815135,0.002036121,0.001366021,0.00005258439,0.00004434483,0.00005471186,0.0003979386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7888148,"threshold_uncertainty_score":0.9997391,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001100006,0.0003152917,0.0004183394,0.001028723,0.0001080188,0.0001553162,0.002718584,0.0002615404,0.00001886572],"category_scores_gemma":[0.0001148456,0.0003127799,0.00009292286,0.0007533236,0.000398762,0.0006145011,0.0007069854,0.0004825943,0.00001406504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001766465,"about_ca_system_score_gemma":0.0003849348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005454451,"about_ca_topic_score_gemma":0.00006297691,"domain_scores_codex":[0.9971242,0.0000448005,0.0006970775,0.0009339935,0.0007716228,0.0004283239],"domain_scores_gemma":[0.9979085,0.0002341347,0.0004348558,0.001052508,0.0002866892,0.00008325667],"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.000009810963,0.00006545748,0.0006219093,0.00007808512,0.000008502286,0.00002157475,0.004718386,0.02023907,0.0003214302,0.3701873,0.00001099197,0.6037174],"study_design_scores_gemma":[0.0003643595,0.0001673438,0.0009204415,0.0006862524,0.000005897066,0.0000366642,3.941389e-7,0.5917637,0.01173475,0.3922074,0.001437109,0.0006756762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002388,0.0003798519,0.9947001,0.0001324611,0.001071798,0.0002740661,0.000001650891,0.00007510301,0.003126106],"genre_scores_gemma":[0.7881124,0.00009520625,0.2110998,0.0004157545,0.0001897293,0.00000633461,0.000003793612,0.00002061409,0.00005637113],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7878736,"threshold_uncertainty_score":0.9999324,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007913111,0.0001801695,0.0002213543,0.0001593744,0.00008199784,0.0002677434,0.001133232,0.0001211547,0.00002484527],"category_scores_gemma":[0.00009646443,0.0001742427,0.00005851316,0.0004916175,0.00004030885,0.0006526052,0.0003917474,0.0002884394,0.0002359415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001429312,"about_ca_system_score_gemma":0.0001586508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009500712,"about_ca_topic_score_gemma":0.0001985597,"domain_scores_codex":[0.9981038,0.0001177364,0.0004314664,0.0005426564,0.0003611345,0.0004432233],"domain_scores_gemma":[0.9987476,0.00007514815,0.0001057193,0.0006874775,0.000136313,0.0002476782],"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.0001046154,0.001678721,0.1576685,0.0002644268,0.0001284744,0.0005053148,0.07488374,0.001415815,0.01526844,0.4267498,0.1538255,0.1675066],"study_design_scores_gemma":[0.001845752,0.0001587062,0.03116242,0.0001478249,0.000007349158,0.0001038488,0.0003857508,0.4282484,0.005170096,0.00298062,0.52874,0.001049218],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.358822,0.0006599273,0.5805269,0.01609282,0.003961221,0.0005231738,0.000004527707,0.001003455,0.03840597],"genre_scores_gemma":[0.9562303,0.00003788668,0.03803721,0.003532988,0.0002718406,0.00001677347,0.000007540012,0.00001660382,0.001848829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5974083,"threshold_uncertainty_score":0.7105411,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003820467,0.00006449958,0.0001918778,0.0004084852,0.00001759709,0.00003218355,0.0004315912,0.00004221269,0.0000234501],"category_scores_gemma":[0.00009594701,0.00005707061,0.00004004183,0.001834003,0.00003054802,0.0001645992,0.0001375866,0.00006960827,0.000001798998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003324121,"about_ca_system_score_gemma":0.00005205095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000281876,"about_ca_topic_score_gemma":0.0004168362,"domain_scores_codex":[0.9992171,0.0000902396,0.0001716249,0.000209664,0.0002015765,0.0001098181],"domain_scores_gemma":[0.9993447,0.00008581686,0.00009610831,0.0003035962,0.0001165885,0.00005318232],"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.00004703161,0.0002574087,0.04791614,0.00002289492,0.0006589554,0.000004937674,0.08502174,0.005369504,0.0006864688,0.8403776,0.0008907498,0.01874657],"study_design_scores_gemma":[0.000611566,0.00008223085,0.08195966,0.000007960513,0.00005908402,0.000001598102,0.001205051,0.8657719,0.01611247,0.03329375,0.0006823614,0.0002123241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6115149,0.00007324257,0.3785284,0.0006306088,0.0001974049,0.0001667272,0.000003864637,0.0001124745,0.008772356],"genre_scores_gemma":[0.985494,0.000002770313,0.01433435,0.0001338874,0.00001379998,0.000005099444,0.00000276942,0.000001545502,0.00001181544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8604025,"threshold_uncertainty_score":0.2327272,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001023963,0.0004708188,0.00046545,0.0007467853,0.0003022732,0.0005941858,0.003924977,0.0004009985,0.00003138935],"category_scores_gemma":[0.0001003618,0.0004784936,0.0001340714,0.0007895952,0.0004076652,0.0006951223,0.0009544639,0.0007720168,0.0004249647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004354814,"about_ca_system_score_gemma":0.0009263061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000151113,"about_ca_topic_score_gemma":0.000008078745,"domain_scores_codex":[0.9960549,0.00004566533,0.000616637,0.001733731,0.0009594912,0.0005896073],"domain_scores_gemma":[0.9965,0.0004820884,0.0004057683,0.002148655,0.0003209719,0.0001425344],"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.000008006532,0.00005511279,0.00007667283,0.00009106864,0.000021512,0.00003180495,0.001591714,0.0677839,0.0004965915,0.2461721,0.0001539227,0.6835176],"study_design_scores_gemma":[0.0002060261,0.00006991073,0.0003489684,0.000220296,0.000005094853,0.00004713226,1.663511e-7,0.9640194,0.0008099612,0.0279948,0.005694754,0.0005834732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007623535,0.000287786,0.9849715,0.0009842984,0.00316939,0.0004107654,0.000003765341,0.0009776755,0.009118633],"genre_scores_gemma":[0.4015489,0.00008777015,0.5941693,0.002522347,0.0007377639,0.00001032442,0.00002609769,0.00006821845,0.0008293638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8962355,"threshold_uncertainty_score":0.9997666,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001528541,0.00006462931,0.00006800122,0.00005633629,0.0001630081,0.0009894914,0.0004394747,0.00002623445,0.000002232084],"category_scores_gemma":[0.0001197828,0.00005582994,0.00001926036,0.0001887533,0.00001164071,0.001011978,0.000220621,0.00003558989,0.000004977434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001597283,"about_ca_system_score_gemma":0.00002874502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003201308,"about_ca_topic_score_gemma":0.00001267381,"domain_scores_codex":[0.9994069,0.000008948332,0.00008183389,0.0002674533,0.0000857479,0.0001491149],"domain_scores_gemma":[0.9994618,0.0001472207,0.00003330914,0.0002218478,0.00006763544,0.00006816986],"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.00001333875,0.00004538582,0.008626476,0.00008441376,0.00002065588,0.000002874083,0.005067766,0.0010505,0.001609155,0.8993966,0.003977521,0.08010529],"study_design_scores_gemma":[0.004628428,0.0008413198,0.1197796,0.0003877555,0.00002875703,0.00009433704,0.0009390342,0.2807145,0.2337791,0.09948916,0.2569409,0.002377094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1510815,0.00002048881,0.8370532,0.01117372,0.000161394,0.0002238415,6.667368e-7,0.0001232988,0.0001618685],"genre_scores_gemma":[0.7645288,0.000002709981,0.2340033,0.001181578,0.00005039238,0.00002069567,4.544184e-7,0.000003068681,0.0002089829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7999074,"threshold_uncertainty_score":0.9541689,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004675243,0.00006417445,0.0002045205,0.0001204186,0.0000722694,0.00008970894,0.0002406319,0.00002608735,0.00001404663],"category_scores_gemma":[0.0001337303,0.00006039925,0.00004406116,0.0006436602,0.0000200844,0.0001966636,0.0000732586,0.00004486096,0.000004728016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007957337,"about_ca_system_score_gemma":0.00003264996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050747,"about_ca_topic_score_gemma":0.000004440149,"domain_scores_codex":[0.9992471,0.00002588714,0.0002376094,0.0002314731,0.000107354,0.0001506256],"domain_scores_gemma":[0.9984217,0.001000866,0.0001334571,0.0002656061,0.0001378154,0.00004055028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001216404,0.0001295623,0.6776199,0.0003056568,0.0003662996,5.646161e-7,0.002188228,0.003828303,0.004437679,0.2835065,0.0001033831,0.02750174],"study_design_scores_gemma":[0.0002996076,0.00008126141,0.02641731,0.0000210496,0.00003254009,0.000001445671,0.00006375655,0.969636,0.001940742,0.001329944,0.00009320022,0.00008311601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.501701,0.00003746489,0.4967827,0.00009040858,0.00006378179,0.0001451566,0.000001006339,0.00004964097,0.001128892],"genre_scores_gemma":[0.8849907,0.000001482008,0.1147958,0.0001224424,0.000006720276,0.000005132283,0.000001144151,0.000002812204,0.00007374078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9658077,"threshold_uncertainty_score":0.246301,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002747781,0.00008633764,0.0001030172,0.0002159909,0.00006663508,0.0001861515,0.000205846,0.00004838851,0.000004461532],"category_scores_gemma":[0.0001000733,0.00009663217,0.00003680096,0.0005285994,0.00006786324,0.0008779756,0.00008522354,0.00006406163,0.00004149069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001549613,"about_ca_system_score_gemma":0.0000412131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006171383,"about_ca_topic_score_gemma":0.00004553064,"domain_scores_codex":[0.999074,0.00001779696,0.0002313906,0.000328233,0.0001995573,0.0001489644],"domain_scores_gemma":[0.9992698,0.00009997315,0.00009716879,0.0002858457,0.00008635133,0.0001608017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00006513961,0.000202042,0.07852052,0.00006435303,0.0006309311,0.00003477987,0.05574708,0.003689198,0.0160071,0.3889525,0.0352506,0.4208357],"study_design_scores_gemma":[0.0007353522,0.0001927247,0.4298293,0.00009488832,0.0001663305,0.0000129011,0.001017477,0.4047064,0.03363398,0.0867823,0.04167089,0.001157415],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5131248,0.0001091867,0.4849351,0.0002524005,0.0002096822,0.0000647865,0.000006230458,0.0001070399,0.001190804],"genre_scores_gemma":[0.9811925,0.000001047016,0.01755788,0.0009668421,0.00007426245,0.000002851047,0.00006506113,0.000004204227,0.0001353905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4680677,"threshold_uncertainty_score":0.3940546,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596684,0.00009998948,0.0002237647,0.000268755,0.00008435727,0.00009510845,0.001589153,0.00004422149,0.00001538265],"category_scores_gemma":[0.0001982691,0.00009830991,0.00008557984,0.001430805,0.00004872773,0.0003131249,0.0002580435,0.00008142395,0.00006235818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002944625,"about_ca_system_score_gemma":0.00008455559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001258889,"about_ca_topic_score_gemma":0.00003960709,"domain_scores_codex":[0.9987579,0.00008371214,0.0003405334,0.0003109075,0.0003328243,0.0001741344],"domain_scores_gemma":[0.9979119,0.0003904861,0.0002660413,0.001109565,0.0002045509,0.0001174234],"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.00004601881,0.00142263,0.133358,0.000285891,0.003871353,0.00001999785,0.05043469,0.3314785,0.002178132,0.3756104,0.01664795,0.08464635],"study_design_scores_gemma":[0.0003264497,0.00006425692,0.01425891,0.00001872787,0.0003858276,0.000001985876,0.0005494297,0.9634152,0.001071482,0.003885498,0.01574869,0.000273535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04107443,0.0001887459,0.9556363,0.001146225,0.0002179805,0.0001881239,0.00001970367,0.000141383,0.001387155],"genre_scores_gemma":[0.9344875,0.000005111051,0.06507675,0.0002933066,0.00004465982,0.00002059054,0.00002914519,0.000004602815,0.00003834837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8934131,"threshold_uncertainty_score":0.4008962,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006957702,0.0001594402,0.0002221743,0.0001149838,0.0002105687,0.0005649145,0.0006902261,0.0001235459,0.00001472714],"category_scores_gemma":[0.000217715,0.0001581715,0.00004195336,0.0003715751,0.00002554357,0.0002616472,0.0001281332,0.0003554734,0.00009083203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001318856,"about_ca_system_score_gemma":0.0000665769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006516549,"about_ca_topic_score_gemma":0.00006010127,"domain_scores_codex":[0.9982328,0.0001955736,0.0005204904,0.0004631991,0.0002791832,0.0003087207],"domain_scores_gemma":[0.9987265,0.0003226592,0.0001085141,0.0006882257,0.00008458188,0.00006955584],"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.000008181677,0.000272343,0.006494409,0.00008415557,0.00002835495,0.00004808879,0.01303568,0.1231545,0.0002597022,0.712399,0.007194165,0.1370214],"study_design_scores_gemma":[0.0006034925,0.0000393235,0.0008218377,0.0005034911,0.000001950082,0.00003805061,0.0007146554,0.9124498,0.0005935663,0.0002311189,0.08357846,0.0004242778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4557424,0.002306931,0.4552662,0.02199409,0.00987893,0.001616985,0.000004542454,0.00116128,0.05202865],"genre_scores_gemma":[0.9733783,0.00001927711,0.02358616,0.000989061,0.0007866871,0.00003877546,0.000001994801,0.00001073401,0.001189007],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7892953,"threshold_uncertainty_score":0.6450046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298812,0.0002815424,0.0005587859,0.0001284211,0.0007977419,0.0001408591,0.00245875,0.0001189947,0.000002756653],"category_scores_gemma":[0.0001388366,0.0002292563,0.0002520898,0.0006438864,0.0002365771,0.0004976824,0.0003453025,0.0003093405,0.000004360021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007145733,"about_ca_system_score_gemma":0.0001177236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004326952,"about_ca_topic_score_gemma":0.000004395713,"domain_scores_codex":[0.9971947,0.0003544983,0.0007499369,0.0007211058,0.0005383655,0.0004413902],"domain_scores_gemma":[0.9963914,0.0009781218,0.0004954001,0.001583144,0.0003955432,0.0001563954],"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.000120991,0.002578876,0.002467716,0.01529678,0.0006600659,0.00003462538,0.161032,0.0175788,0.0004762459,0.7877021,0.01060087,0.001450857],"study_design_scores_gemma":[0.0005385778,0.0001357912,0.0005480673,0.0002427375,0.00003333873,0.0001116975,0.0003781111,0.993974,0.0007259071,0.002500714,0.0005278485,0.0002832299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03469697,0.000691336,0.9616899,0.0002329262,0.0009371381,0.001165937,0.00001484494,0.0003378582,0.0002330274],"genre_scores_gemma":[0.9165872,0.00002209169,0.08284151,0.0002129319,0.000217021,0.00007984801,0.00001657488,0.00001684168,0.00000599354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9763952,"threshold_uncertainty_score":0.9348802,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627374,0.000175689,0.0001705654,0.0002813246,0.000930572,0.0009430055,0.0004390231,0.0001041485,0.00001475366],"category_scores_gemma":[0.0001104099,0.000175866,0.00003753343,0.0002446703,0.00009732517,0.0009997059,0.00008706388,0.00021419,0.000003100188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009480961,"about_ca_system_score_gemma":0.0001351158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002206738,"about_ca_topic_score_gemma":0.0001712652,"domain_scores_codex":[0.9986718,0.00008168257,0.0002893429,0.0004703453,0.0001308148,0.0003560344],"domain_scores_gemma":[0.998901,0.0002485199,0.0002832851,0.0004222443,0.00008714193,0.00005778394],"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.00002063451,0.00008711423,0.000279109,0.0000700047,0.00003840469,7.778307e-7,0.002339041,0.0007105275,0.0000813361,0.4133868,0.0004694065,0.5825168],"study_design_scores_gemma":[0.001221796,0.0002694434,0.006915546,0.00009904708,0.00002618086,0.00004093929,0.0001634295,0.8344386,0.0003244664,0.1066107,0.04944905,0.0004407133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01370814,0.0003186529,0.982868,0.001921569,0.0001586195,0.0004458853,0.000004436827,0.0001344547,0.0004402387],"genre_scores_gemma":[0.94618,0.000069061,0.05306107,0.00006321348,0.00009487809,0.0003188478,0.0000444863,0.00001101871,0.0001574626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9324718,"threshold_uncertainty_score":0.9093423,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005506103,0.0004587397,0.001351398,0.0003208532,0.0003512581,0.001021581,0.004239992,0.0004168544,0.00001687676],"category_scores_gemma":[0.002404176,0.0004434227,0.000499481,0.001608853,0.00004417979,0.0008025414,0.00271413,0.001230179,0.0004455366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811701,"about_ca_system_score_gemma":0.0007399134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006756785,"about_ca_topic_score_gemma":0.000002351623,"domain_scores_codex":[0.9946238,0.002729377,0.001199561,0.0005264977,0.0004580863,0.0004626322],"domain_scores_gemma":[0.9937437,0.002430606,0.0008551582,0.002454539,0.0003905391,0.0001254849],"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":[3.677605e-8,0.00001986212,0.000006893825,0.001637705,0.00004442317,0.000003804009,0.0002967954,0.000006686306,4.325241e-9,0.0111736,0.001398991,0.9854112],"study_design_scores_gemma":[0.00006772557,0.00001246427,0.00003938706,0.004795439,0.00003526656,0.00008953377,0.00001671914,0.004327178,5.044724e-7,0.0003037457,0.9898226,0.0004894916],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[9.827178e-7,0.5500168,0.4475371,0.00004510893,0.001468324,0.000168676,0.000005142089,0.0003346042,0.0004233324],"genre_scores_gemma":[0.00004714053,0.9414036,0.05771999,0.0001530133,0.0003297168,0.00000914754,0.0002879278,0.00002098646,0.0000284303],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9884235,"threshold_uncertainty_score":0.9998018,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005481455,0.0004287232,0.0004698755,0.0003934669,0.0003358927,0.0001696023,0.001716519,0.0004313045,0.0001759181],"category_scores_gemma":[0.0002477576,0.0004089835,0.0002845528,0.0001571388,0.0003733371,0.0002313469,0.004146776,0.001155632,0.0004309089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002287062,"about_ca_system_score_gemma":0.0004331807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002553137,"about_ca_topic_score_gemma":0.000007374972,"domain_scores_codex":[0.9965539,0.0004603808,0.000669151,0.001380289,0.0003750376,0.0005612379],"domain_scores_gemma":[0.9968308,0.0008157306,0.0005493065,0.001439206,0.0001953809,0.0001695815],"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.000024249,0.00006825323,0.001360929,0.00005338403,0.00006200206,0.00001806216,0.001282423,0.002569875,0.002252909,0.9811967,0.0003748205,0.01073638],"study_design_scores_gemma":[0.0002842008,0.00002947863,0.005418396,0.0001705092,0.00001876717,0.0001102888,0.00003728906,0.1123153,0.0007744191,0.8783542,0.002024553,0.0004626068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03699733,0.0001175224,0.9525559,0.001620665,0.004719831,0.0003419513,0.00001962554,0.0003882431,0.003238949],"genre_scores_gemma":[0.3204944,0.00004594445,0.6779408,0.0004302252,0.0009512287,0.00006604759,0.00003884578,0.0000278844,0.000004634087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.283497,"threshold_uncertainty_score":0.9998362,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005472595,0.00004861159,0.0000734999,0.00002765138,0.0003030082,0.00003743016,0.05523586,0.00002959969,0.000002809427],"category_scores_gemma":[0.005112044,0.00003889272,0.00006231479,0.0003330212,0.0001444465,0.0001125504,0.02657391,0.0001459773,0.00002355961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001319368,"about_ca_system_score_gemma":0.00002625298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001811129,"about_ca_topic_score_gemma":0.000006714403,"domain_scores_codex":[0.9992601,0.0002496678,0.0001805343,0.0001098838,0.0001161696,0.00008370452],"domain_scores_gemma":[0.9572643,0.0005212607,0.0001423039,0.04195167,0.0000974433,0.00002301778],"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":[5.149901e-7,0.00005468174,0.0006595078,0.000005721328,0.000005702281,4.988161e-9,0.001108575,0.00002414026,0.0001940583,0.9839782,0.01101971,0.002949153],"study_design_scores_gemma":[0.0001040268,0.00001325291,0.002470247,0.00002457534,0.000004322943,0.000003012974,0.00003134455,0.06183207,0.002447324,0.8150738,0.1179169,0.00007911064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.09476382,0.001918991,0.303611,0.5266578,0.002737734,0.0006576134,0.000006986109,0.0006767875,0.06896926],"genre_scores_gemma":[0.8319773,0.00002537957,0.1675996,0.0003411371,0.00002856888,0.000004695314,5.65585e-7,0.000002375294,0.00002038731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7372135,"threshold_uncertainty_score":0.981299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084784,0.00007477033,0.0001316404,0.0005120536,0.0005140603,0.00004598542,0.0005634793,0.0002000806,0.00005063587],"category_scores_gemma":[0.0008027205,0.00008966136,0.00003499061,0.0005502608,0.0004979501,0.0003098756,0.0003581101,0.0004579189,0.000007286917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602531,"about_ca_system_score_gemma":0.0002547952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008250283,"about_ca_topic_score_gemma":0.0001019033,"domain_scores_codex":[0.9990093,0.00003832661,0.0001455758,0.0003231948,0.0002347332,0.000248936],"domain_scores_gemma":[0.9985352,0.0002754353,0.0000957623,0.0004180823,0.0006088365,0.00006667741],"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.00003575637,0.0001389931,0.003485822,0.00005592,0.00003710118,0.00003225911,0.0006700213,0.000004138407,0.008222801,0.9667013,0.003371631,0.01724426],"study_design_scores_gemma":[0.00556891,0.00221805,0.01925691,0.0002219444,0.00003877586,0.0003670393,0.004846558,0.03885938,0.0942361,0.6296361,0.203628,0.001122154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9086646,0.00006202734,0.07359529,0.01296821,0.0001483782,0.001535141,0.00001977171,0.0003518032,0.00265479],"genre_scores_gemma":[0.9412976,0.000009819416,0.05854692,0.0000189931,0.00002539487,0.000004998054,0.00000422819,0.000004426953,0.00008763729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3370652,"threshold_uncertainty_score":0.3953788,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005353291,0.0002763397,0.0004614094,0.0001590154,0.0006858523,0.0006100166,0.003526532,0.0000657092,0.00002369617],"category_scores_gemma":[0.0002976813,0.0002486515,0.00009840626,0.00403436,0.0002418569,0.002559079,0.001231868,0.0002600221,0.000312298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291088,"about_ca_system_score_gemma":0.0002294875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000142793,"about_ca_topic_score_gemma":0.000004872641,"domain_scores_codex":[0.9965975,0.0003102623,0.0005423416,0.000707,0.0008386983,0.001004174],"domain_scores_gemma":[0.9969481,0.0002480857,0.0003686175,0.00140317,0.0005802918,0.0004517913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000643559,0.0016634,0.2144713,0.004833206,0.0001073024,0.000005429948,0.009981973,0.0001659416,0.0005469839,0.133757,0.4002814,0.2341796],"study_design_scores_gemma":[0.000691228,0.0002343973,0.1731955,0.006825457,0.00005793183,0.0003118172,0.00004656611,0.4395944,0.003978887,0.001932023,0.369962,0.003169797],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01486215,0.08665638,0.8879098,0.003251824,0.004037587,0.000819008,0.00001602515,0.000637756,0.001809431],"genre_scores_gemma":[0.9633228,0.007941581,0.02445666,0.003660901,0.0005113262,0.00002944197,0.000009710158,0.0000156978,0.00005187925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9484606,"threshold_uncertainty_score":0.9999966,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135771,0.00006959253,0.0001103923,0.0001202829,0.00002849994,0.00003436786,0.0006435663,0.0000412407,0.000001446482],"category_scores_gemma":[0.00007430737,0.00004599694,0.00002589828,0.0006616632,0.00001753004,0.000259897,0.0000751733,0.0001892458,5.146793e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002459295,"about_ca_system_score_gemma":0.0001146792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006257118,"about_ca_topic_score_gemma":0.0002066111,"domain_scores_codex":[0.9990124,0.00007912092,0.0004069627,0.0001646294,0.0002411027,0.00009576108],"domain_scores_gemma":[0.9990855,0.0005005392,0.000076687,0.0002690856,0.00006161434,0.000006547892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003575588,0.00008088582,0.0002483605,0.0005454124,0.00001858214,0.000002919727,0.478738,0.04134883,0.00007039758,0.3606243,0.000009400091,0.1183093],"study_design_scores_gemma":[0.0001117137,0.00002180309,0.003914707,0.0005149752,0.000002360918,0.000004994897,0.002070083,0.9837919,0.001177609,0.00819727,0.0001091423,0.00008344432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2973065,0.001183253,0.7002565,0.0007398867,0.0001118562,0.0001908765,8.472776e-7,0.00005501014,0.000155318],"genre_scores_gemma":[0.9553778,0.00005350129,0.0445171,0.0000189349,0.000009105058,0.00001250108,0.00000745524,0.000003111901,5.441437e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9424431,"threshold_uncertainty_score":0.1875701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}