{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":47,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":47,"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":"aae29d033469","filters":{"venue":"International Journal of Information Security"}},"results":[{"id":"W2013613544","doi":"10.1007/s102070100002","title":"The Elliptic Curve Digital Signature Algorithm (ECDSA)","year":2001,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Elliptic curve cryptography; Elliptic curve point multiplication; Post-quantum cryptography; Algorithm; Curve25519; Computer science; Hessian form of an elliptic curve; Digital Signature Algorithm; Tripling-oriented Doche–Icart–Kohel curve; Digital signature; Schoof's algorithm; NIST; Elliptic curve; Discrete logarithm; ElGamal signature scheme; Cryptography; Mathematics; Public-key cryptography; Hash function; Blind signature; Encryption; Pure mathematics; Computer security; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.004100972361733678,"gpt":0.2268713816543628,"spread":0.2227704092926291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004991014,0.00009558118,0.00009627147,0.0002369654,0.0001379667,0.00111997,0.001458624,0.00005832359,0.00001321089],"category_scores_gemma":[0.0001676159,0.00006178924,0.0001697427,0.0002921681,0.00006204489,0.004704982,0.0001380196,0.000322388,0.00004839119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004697496,"about_ca_system_score_gemma":0.00008481037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003401187,"about_ca_topic_score_gemma":0.000001353217,"domain_scores_codex":[0.9983374,0.00003248261,0.0005663498,0.0000589231,0.0008569825,0.0001478043],"domain_scores_gemma":[0.997987,0.0002047976,0.0005075847,0.0001647164,0.001051801,0.00008413567],"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.00007343487,0.0001274016,0.001561168,0.000005070308,0.0002723102,0.0000960811,0.004661753,0.0002801313,0.00001194141,0.1371631,0.006566596,0.849181],"study_design_scores_gemma":[0.00168476,0.0002443317,0.01091452,0.00009244442,0.00001541602,0.002940906,0.0007557034,0.06586606,0.0004393824,0.1343029,0.7823927,0.0003509257],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02200514,0.0006487983,0.9597526,0.008689934,0.003820628,0.0001097826,0.00001990875,0.00005051726,0.004902689],"genre_scores_gemma":[0.9934317,0.0005750403,0.005139044,0.0004897139,0.0003292246,0.000001538975,0.000007088487,0.00000287504,0.00002370415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9714266,"threshold_uncertainty_score":0.999917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020915469","doi":"10.1007/s10207-007-0049-3","title":"Alambic: a privacy-preserving recommender system for electronic commerce","year":2008,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Recommender system; Computer science; Personally identifiable information; Collaborative filtering; Cryptography; Information sensitivity; Internet privacy; Computer security; Privacy protection; Private information retrieval; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01681907589208641,"gpt":0.2592471856976533,"spread":0.2424281098055668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197536,0.00008735635,0.0001310397,0.0002742635,0.000129711,0.0001896283,0.001322129,0.00005601885,0.00000976132],"category_scores_gemma":[0.000217056,0.00008056576,0.0001326332,0.0001412071,0.00001375335,0.004148132,0.0001537486,0.0002226018,0.00001439259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003118986,"about_ca_system_score_gemma":0.0001505762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002076585,"about_ca_topic_score_gemma":0.000001925217,"domain_scores_codex":[0.998623,0.00004735454,0.0005918821,0.00006538333,0.0005132182,0.0001592244],"domain_scores_gemma":[0.9979109,0.0001319234,0.0006432526,0.0001756174,0.001076057,0.00006227565],"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.001247184,0.0005086897,0.007493738,0.0003459378,0.00140166,0.00006379541,0.07087353,0.003068331,0.0007970712,0.6522142,0.1734715,0.08851442],"study_design_scores_gemma":[0.006112775,0.0008168786,0.01494926,0.0003483313,0.00003359881,0.007217307,0.001071204,0.3158173,0.008254106,0.02478252,0.6199415,0.0006552331],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06586192,0.00005823976,0.9254875,0.003848563,0.002495833,0.0001450306,0.000007504047,0.00007254577,0.002022859],"genre_scores_gemma":[0.9936792,0.00004747047,0.005366042,0.0006235322,0.0002554643,0.000005921471,0.000007358521,0.000003561124,0.00001145696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9278173,"threshold_uncertainty_score":0.3285376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124945516","doi":"10.1007/s10207-009-0080-7","title":"User interface design affects security: patterns in click-based graphical passwords","year":2009,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs","keywords":"Password; Computer science; Cognitive password; Human–computer interaction; Authentication (law); User interface; Graphical user interface; Point (geometry); Predictability; Computer security; Password strength; World Wide Web; One-time password; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01099152372863563,"gpt":0.2751963090421394,"spread":0.2642047853135037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530109,0.0001965703,0.0002906113,0.001017048,0.00004631311,0.0005583889,0.001721099,0.0001379199,0.00003472778],"category_scores_gemma":[0.0002441097,0.0001802362,0.0001886833,0.0004601887,0.00003098738,0.00383748,0.00008920504,0.0005031285,0.0000411026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001962456,"about_ca_system_score_gemma":0.0001882388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001844653,"about_ca_topic_score_gemma":0.00001905443,"domain_scores_codex":[0.9970351,0.0002772477,0.001107392,0.0001526397,0.001179161,0.0002484372],"domain_scores_gemma":[0.9977055,0.0001968891,0.0008170199,0.0003014699,0.0008099178,0.0001692599],"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.001929666,0.004931476,0.06802056,0.0003062782,0.0007376093,0.0006164526,0.3525239,0.006342018,0.0009159932,0.440722,0.0310216,0.09193242],"study_design_scores_gemma":[0.01004538,0.00144699,0.09590267,0.00118906,0.00003556653,0.000767745,0.001119805,0.7581555,0.01182443,0.06789101,0.05034829,0.001273553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2347085,0.00004860674,0.753473,0.009538915,0.001486502,0.0002621456,0.00001189829,0.00006864395,0.0004017434],"genre_scores_gemma":[0.9957488,0.00003265853,0.001853567,0.002222719,0.0001201424,0.000004648089,0.0000088631,0.00000455369,0.000004103147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7610402,"threshold_uncertainty_score":0.7349817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2968669983","doi":"10.1007/s10207-019-00462-x","title":"Enhancing challenge-based collaborative intrusion detection networks against insider attacks using blockchain","year":2019,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Horizon 2020 Framework Programme","keywords":"Computer science; Insider; Computer security; Robustness (evolution); Blockchain; Insider threat; Intrusion detection system; Scheme (mathematics); Cryptography; Anonymity; Intrusion","retraction":null,"screen_n_in":null,"score":{"opus":0.00770568017608599,"gpt":0.2446842222516152,"spread":0.2369785420755292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105893,0.0001916194,0.0002547129,0.00065237,0.0001459405,0.0003854667,0.0007394972,0.0001843321,0.00006042396],"category_scores_gemma":[0.0001601525,0.0001823833,0.0001542439,0.0005781047,0.00003232969,0.00327876,0.0001887499,0.0005425291,0.00004069911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00039547,"about_ca_system_score_gemma":0.0002342135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001788337,"about_ca_topic_score_gemma":0.00003687377,"domain_scores_codex":[0.9974496,0.0001673625,0.00104697,0.0001540947,0.0009638504,0.0002181146],"domain_scores_gemma":[0.9959121,0.0001489646,0.001354769,0.0002297909,0.002239352,0.0001150626],"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.0008798993,0.0003475187,0.0005170003,0.0000797636,0.0003530127,0.00004552401,0.01204895,0.7913017,0.007868406,0.01188381,0.0003967493,0.1742776],"study_design_scores_gemma":[0.001318325,0.0002562042,0.0001982222,0.0002105182,0.000008109448,0.00008093949,0.0003133004,0.9701225,0.01830212,0.001232542,0.007729584,0.0002276346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4424462,0.00009638218,0.552016,0.0005498113,0.004061996,0.0001801317,0.000003348251,0.00004748963,0.0005986575],"genre_scores_gemma":[0.9938869,0.0001010126,0.00449446,0.001028653,0.0004695835,0.000002677013,0.000006366457,0.000007364471,0.000002990499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5514407,"threshold_uncertainty_score":0.7437375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126888608","doi":"10.1007/s10207-007-0025-y","title":"A familiarity-based trust model for effective selection of sellers in multiagent e-commerce systems","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Computer science; Feeling; Order (exchange); Selection (genetic algorithm); Affect (linguistics); Similarity (geometry); Artificial intelligence; Psychology; Business; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01428129202086808,"gpt":0.3277341679274069,"spread":0.3134528759065388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551789,0.00007264499,0.0001717804,0.0003598507,0.00007829416,0.00006422973,0.0002713604,0.00009345956,0.000008450802],"category_scores_gemma":[0.000509843,0.00006828641,0.000118116,0.000190513,0.00005355087,0.001308084,0.00001250448,0.0001675603,0.000001651777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004120955,"about_ca_system_score_gemma":0.0002162298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009037089,"about_ca_topic_score_gemma":0.0006453344,"domain_scores_codex":[0.9983762,0.00007225008,0.0007390396,0.00004664439,0.0006265477,0.0001393416],"domain_scores_gemma":[0.9972439,0.0003273883,0.0007629546,0.00003553868,0.001565858,0.00006439225],"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.006841097,0.001184297,0.2160593,0.0003316347,0.000611298,0.00001200701,0.1410339,0.4046442,0.000399473,0.1629685,0.001617721,0.06429654],"study_design_scores_gemma":[0.003842971,0.000113841,0.0263958,0.0001237,0.00002205868,0.000005962237,0.006189881,0.9561613,0.0004940159,0.001385657,0.005129947,0.0001349139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6094683,0.00003216631,0.3854883,0.0005261764,0.0008969627,0.0005518468,0.00003958899,0.0000124506,0.002984196],"genre_scores_gemma":[0.9988763,0.00001772996,0.0007868941,0.0001450643,0.0001420439,0.0000100783,0.000008178969,0.000002862105,0.0000108198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.551517,"threshold_uncertainty_score":0.2784639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985828174","doi":"10.1007/s10207-013-0196-7","title":"Delay-sensitive approaches for anonymizing numerical streaming data","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tuple; Anonymity; Data stream; Data stream mining; Context (archaeology); Information loss; Cryptography; k-anonymity; Confidentiality; Information sensitivity; Data mining; Distributed computing; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05658973227708992,"gpt":0.2961990819411522,"spread":0.2396093496640623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006766128,0.0001078419,0.0001528226,0.000284535,0.00006309396,0.0005391944,0.0180907,0.00007495532,0.00001421294],"category_scores_gemma":[0.01039888,0.00009435892,0.000064073,0.000156595,0.00004133596,0.01275803,0.01719535,0.0002440932,0.00003040656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001144377,"about_ca_system_score_gemma":0.0001039069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003049456,"about_ca_topic_score_gemma":8.528819e-7,"domain_scores_codex":[0.9985096,0.00002660724,0.0005820772,0.0001320142,0.0005834676,0.0001662005],"domain_scores_gemma":[0.9963321,0.0002602417,0.000735277,0.001609145,0.001000813,0.00006239203],"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.00005471142,0.000173751,0.0003790069,0.00003039627,0.0003382529,0.00001538182,0.001197008,0.0002425472,0.00006696288,0.04601337,0.2756741,0.6758145],"study_design_scores_gemma":[0.0005855509,0.00006789733,0.0008444336,0.00004929996,0.000006829639,0.0002829318,0.0004023353,0.90813,0.001003896,0.07735547,0.01112694,0.0001443744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02092189,0.00002311103,0.961523,0.01580241,0.0007312043,0.0001668736,0.00009758741,0.00007648912,0.0006574251],"genre_scores_gemma":[0.6258036,0.00001543062,0.3737607,0.0002253472,0.0001024031,0.000005181347,0.00008309977,0.000002955403,0.00000129078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9078875,"threshold_uncertainty_score":0.997937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146941523","doi":"10.1007/s10207-011-0129-2","title":"Generalizing cryptosystems based on the subset sum problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptosystem; Discrete logarithm; Computer science; Homomorphic encryption; Homomorphism; Hybrid cryptosystem; Cryptography; Subset sum problem; Lattice problem; Theoretical computer science; Random oracle; Oracle; Scheme (mathematics); Public-key cryptography; Encryption; Discrete mathematics; Computer security; Mathematics; Algorithm; Knapsack problem","retraction":null,"screen_n_in":null,"score":{"opus":0.02287297124473265,"gpt":0.2337281931038352,"spread":0.2108552218591025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122408,0.0001119832,0.0001183853,0.0003489596,0.0000962475,0.000333404,0.001742609,0.00005102008,0.00008913266],"category_scores_gemma":[0.0001122524,0.00007452635,0.0001580435,0.0002489471,0.00003848838,0.003134069,0.0001125759,0.0002644098,0.00004158448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000545698,"about_ca_system_score_gemma":0.0001033883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004702541,"about_ca_topic_score_gemma":0.000007674533,"domain_scores_codex":[0.9981543,0.0001013117,0.0006643054,0.00007600828,0.0008663851,0.0001376613],"domain_scores_gemma":[0.9979576,0.0001153396,0.0007191875,0.0002806607,0.0008488261,0.00007839855],"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.00007914197,0.000113665,0.0012963,0.00001121265,0.00006142731,0.00001179742,0.006129684,0.0001380602,0.0000251306,0.9824396,0.007095397,0.002598529],"study_design_scores_gemma":[0.005030589,0.001086042,0.0229004,0.0007411375,0.00004842973,0.00079386,0.00202598,0.2594642,0.01686696,0.3184472,0.3714089,0.001186245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05268029,0.00004447497,0.9177172,0.004145108,0.002500288,0.00024052,0.00008062704,0.00007120771,0.02252032],"genre_scores_gemma":[0.9827388,0.00001496473,0.01514132,0.001950153,0.0001338522,0.000004517628,0.00001319562,0.00000260517,5.769587e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9300585,"threshold_uncertainty_score":0.323823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044457569","doi":"10.1007/s10207-013-0222-9","title":"ARITO: Cyber-attack response system using accurate risk impact tolerance","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Component (thermodynamics); Response time; Mechanism (biology); Computer security; Intrusion detection system; Selection (genetic algorithm); Demand response; Risk analysis (engineering); Reliability engineering; Machine learning; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01299187673278287,"gpt":0.2833191509168625,"spread":0.2703272741840796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385337,0.0001602507,0.0002148707,0.0004599271,0.0001532339,0.000912463,0.001130642,0.0001042578,0.00009421786],"category_scores_gemma":[0.0003144718,0.0001330118,0.0002183034,0.0003399837,0.00003404193,0.01092388,0.0001752169,0.0004389501,0.0001925153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004714811,"about_ca_system_score_gemma":0.0001925136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002876582,"about_ca_topic_score_gemma":0.000005160836,"domain_scores_codex":[0.9974896,0.0002721575,0.00103778,0.0001035178,0.0008925517,0.0002044028],"domain_scores_gemma":[0.9957718,0.0001908825,0.001580626,0.0002416258,0.00206106,0.0001540563],"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.008130526,0.001029137,0.01385158,0.0002821342,0.002499065,0.0002919348,0.05835205,0.4933409,0.006624432,0.0541833,0.08950488,0.27191],"study_design_scores_gemma":[0.001150897,0.0002283795,0.02000144,0.0002181485,0.0000126915,0.001266347,0.0003061213,0.9632758,0.001471073,0.00195419,0.009857925,0.0002569957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7779344,0.00004816346,0.218318,0.0004852133,0.002558541,0.0001298687,0.00001505218,0.00005254298,0.000458265],"genre_scores_gemma":[0.9943206,0.00005045511,0.005035157,0.0002591919,0.0003186956,0.000003156168,0.000002737467,0.000004548172,0.000005448568],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4699349,"threshold_uncertainty_score":0.8798902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092147670","doi":"10.1007/s10207-020-00522-7","title":"Risk assessment of cyber-attacks on telemetry-enabled cardiac implantable electronic devices (CIED)","year":2020,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Montreal Heart Institute; Polytechnique Montréal","funders":"","keywords":"Computer security; Damages; Computer science; Risk analysis (engineering); The Internet; Risk assessment; NIST; Reputation; Cryptography; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.005042278435166607,"gpt":0.2453541111381495,"spread":0.2403118327029829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141249,0.0001442985,0.0002913627,0.0002243266,0.00003518642,0.00009652863,0.0004344503,0.00007998864,0.00008730122],"category_scores_gemma":[0.00009455158,0.00013409,0.0001579856,0.0001994845,0.00001771297,0.001450136,0.00004483777,0.0005920588,0.00002067469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000266128,"about_ca_system_score_gemma":0.0001163935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001753207,"about_ca_topic_score_gemma":0.000005864081,"domain_scores_codex":[0.9980838,0.00004917982,0.0008517228,0.00005830091,0.0007552049,0.000201842],"domain_scores_gemma":[0.9984329,0.0001299952,0.000624514,0.000093111,0.0006136845,0.0001057339],"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.0004819312,0.0001635125,0.04626973,0.0002905099,0.003271237,0.00001727698,0.005690946,0.8327288,0.001023318,0.02137814,0.06283495,0.02584966],"study_design_scores_gemma":[0.004585863,0.001042027,0.07350431,0.0004795886,0.0002453409,0.0001366483,0.001746235,0.6346638,0.02189968,0.001995869,0.2587626,0.0009380852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9482439,0.0002220795,0.02426999,0.0005381461,0.001497254,0.000195979,0.0002469005,0.00008704374,0.02469876],"genre_scores_gemma":[0.9983065,0.0005132243,0.0005008614,0.0002627787,0.0003553857,0.000002843514,0.00004604102,0.00001081186,0.000001557157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.198065,"threshold_uncertainty_score":0.5468031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3041392953","doi":"10.1007/s10207-020-00511-w","title":"A secure architecture for TCP/UDP-based cloud communications","year":2020,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Cloud computing; Computer network; Computer security; Datagram; Transport Layer Security; Encryption; Cloud computing security; Cryptographic protocol; Cryptography; Network packet; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01827435196548375,"gpt":0.2771084918569842,"spread":0.2588341398915004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422652,0.0001208838,0.0001685369,0.0002493701,0.0001018196,0.000346454,0.002934591,0.00007111055,0.00001977436],"category_scores_gemma":[0.0004024564,0.0001092511,0.000253654,0.000304106,0.0000607024,0.00235154,0.0002686243,0.0003513644,0.0000141318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000042052,"about_ca_system_score_gemma":0.0001923579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005833087,"about_ca_topic_score_gemma":0.000006820301,"domain_scores_codex":[0.9984378,0.00006132029,0.0006924765,0.00008965924,0.000584761,0.0001339631],"domain_scores_gemma":[0.9972988,0.0002324308,0.0006976494,0.0003598646,0.001244462,0.0001668105],"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.000422272,0.0002279901,0.0003014613,0.00008649142,0.0002404917,0.00001004543,0.01747306,0.001283957,0.0001104064,0.9077721,0.03611415,0.03595756],"study_design_scores_gemma":[0.002283523,0.0002806128,0.0003190949,0.00006264415,0.00001917948,0.0000954724,0.0002721613,0.09691198,0.0009344064,0.05548811,0.8430973,0.0002355608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002512765,0.00009814755,0.9541693,0.04149532,0.0007272607,0.0001665417,0.0002460156,0.00005155549,0.0005330407],"genre_scores_gemma":[0.8527318,0.00004147844,0.1380119,0.008700782,0.0003692579,0.000008479442,0.0001318862,0.000004247088,2.327461e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.852284,"threshold_uncertainty_score":0.545325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552194903","doi":"10.1007/s10207-016-0348-7","title":"Secure modular password authentication for the web using channel bindings","year":2016,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Australian Research Council; Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Password; Computer security; Authentication protocol; Transport Layer Security; Computer network; Authenticated Key Exchange; S/KEY; Challenge–response authentication; Key exchange; Public-key cryptography; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01731594830506188,"gpt":0.2980167009624887,"spread":0.2807007526574268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029063,0.0001331999,0.0001424919,0.0003018383,0.0001488939,0.00028004,0.001707394,0.00007010581,0.0000224767],"category_scores_gemma":[0.0005987078,0.00007980022,0.0001713044,0.0002153647,0.00006877916,0.005453112,0.0001796931,0.0001382845,0.00002303585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002306382,"about_ca_system_score_gemma":0.0001823851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002248102,"about_ca_topic_score_gemma":0.000001075508,"domain_scores_codex":[0.9980387,0.000047937,0.0008231694,0.0001138599,0.0007912399,0.0001850745],"domain_scores_gemma":[0.995894,0.0003243599,0.001305953,0.000299141,0.002095364,0.00008116449],"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.0001524445,0.000133575,0.0001840038,0.00003268763,0.0002444929,0.000002545482,0.00707995,0.0007546685,0.005098687,0.9474406,0.000780503,0.03809581],"study_design_scores_gemma":[0.003213298,0.0001347417,0.0009837128,0.0002606885,0.00003901638,0.0002637852,0.0003303758,0.4607128,0.01335982,0.4511788,0.0691805,0.0003424451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01104118,0.00002468508,0.9756233,0.01091709,0.001302352,0.0009621063,0.00004060992,0.00003690311,0.0000518505],"genre_scores_gemma":[0.9845297,0.00004203209,0.01458621,0.0004699901,0.0002474239,0.0001019231,0.000003698634,0.000006361457,0.00001265457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9734885,"threshold_uncertainty_score":0.3953374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411282933","doi":"10.1007/s10207-025-01072-6","title":"Synthetic data: revisiting the privacy-utility trade-off","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cryptography; Computer security; Information privacy; Internet privacy; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.02532597158437543,"gpt":0.3101578134501034,"spread":0.284831841865728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002615,0.0001091775,0.0001548956,0.0002944128,0.0001215027,0.0006589999,0.04548853,0.00007129383,0.00002143366],"category_scores_gemma":[0.03598119,0.0000781771,0.00007752095,0.000371514,0.00009559357,0.007397539,0.03519906,0.000503583,0.00001577732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000122299,"about_ca_system_score_gemma":0.0002118543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008351421,"about_ca_topic_score_gemma":0.000001042303,"domain_scores_codex":[0.9979295,0.0001053409,0.0008948777,0.00014318,0.0007749236,0.0001521979],"domain_scores_gemma":[0.9940979,0.0004492739,0.0007769184,0.004101095,0.0005393987,0.00003540285],"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.00003715015,0.00004305656,0.0008714764,0.00003803746,0.0002029199,0.00001365485,0.0008017828,0.00001911124,0.00001766101,0.05856123,0.2611621,0.6782318],"study_design_scores_gemma":[0.0005181535,0.0000190844,0.007080869,0.0002941253,0.00001845349,0.0002311635,0.0002493582,0.3228143,0.0008512863,0.2502811,0.4174976,0.0001445253],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007237799,0.0004492115,0.6778744,0.3059039,0.002447171,0.0001532837,0.00008613375,0.0001478336,0.005700206],"genre_scores_gemma":[0.9677798,0.0002493128,0.0304282,0.001357079,0.0001542989,0.000001950566,0.00002387652,0.000002123609,0.000003347513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.960542,"threshold_uncertainty_score":0.9726041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141380111","doi":"10.1007/s10207-006-0081-8","title":"A monitoring system for detecting repeated packets with applications to computer worms","year":2006,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Denial-of-service attack; Network packet; Computer network; Bloom filter; The Internet; Network security; Network monitoring; Network topology; Computer security; Real-time computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.008521373689565254,"gpt":0.2443180292043502,"spread":0.235796655514785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005271951,0.0001094507,0.0001439635,0.0003872394,0.0001446093,0.0004323187,0.0006503272,0.00005486837,0.000001943967],"category_scores_gemma":[0.00002564926,0.00009031456,0.00008652555,0.0003471722,0.00001256529,0.002348725,0.00008971726,0.0001598986,0.00001456832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002264759,"about_ca_system_score_gemma":0.00005844196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002222619,"about_ca_topic_score_gemma":0.000007721417,"domain_scores_codex":[0.9984676,0.00002533234,0.0006958262,0.0001029889,0.000558237,0.0001500786],"domain_scores_gemma":[0.9973031,0.00008940763,0.0006550626,0.0001592004,0.00171191,0.00008130126],"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.001056803,0.000304056,0.003018467,0.0002180121,0.0004060724,0.00003389495,0.007602012,0.05242634,0.001200248,0.1800328,0.00318384,0.7505175],"study_design_scores_gemma":[0.01079264,0.003030602,0.02188939,0.003037365,0.0001070859,0.0052738,0.001962685,0.5371291,0.1538764,0.0256108,0.2353582,0.001931969],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08947328,0.00001665139,0.9082482,0.0004474056,0.001111064,0.0002741814,0.000005865012,0.00008132457,0.0003419978],"genre_scores_gemma":[0.9326804,0.000003710635,0.06614616,0.00010747,0.001014811,0.00003516364,0.000004495259,0.000004498934,0.000003351993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8432071,"threshold_uncertainty_score":0.4168859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402002228","doi":"10.1007/s10207-024-00903-2","title":"Adversarial robustness of deep reinforcement learning-based intrusion detection","year":2024,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Adversarial system; Intrusion detection system; Reinforcement learning; Artificial intelligence; Machine learning; Robustness (evolution); Deep learning; Adversarial machine learning; Overfitting; Deep neural networks; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.005763070019284183,"gpt":0.2554729891537023,"spread":0.2497099191344181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061933,0.0001290819,0.0001788992,0.000763929,0.00006976924,0.0002797088,0.0008870538,0.00009331703,0.00008851142],"category_scores_gemma":[0.0005935732,0.0001165164,0.0001777366,0.00036529,0.00004175288,0.00415891,0.0001914624,0.0005447277,0.00001705432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002604386,"about_ca_system_score_gemma":0.0002032041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002029692,"about_ca_topic_score_gemma":0.000003566553,"domain_scores_codex":[0.9976096,0.0001025006,0.0009454245,0.00009718997,0.001115239,0.0001300717],"domain_scores_gemma":[0.9976616,0.0001919898,0.0008186151,0.0001354855,0.001125816,0.00006650866],"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.0001215973,0.00001813835,0.00004368833,0.00004091502,0.00007134599,0.00001031034,0.001644558,0.9379971,0.00009751489,0.007651515,0.00005645154,0.05224684],"study_design_scores_gemma":[0.0007180458,0.0001609899,0.0001457522,0.000133279,0.00001411341,0.00007923875,0.0001273048,0.9876842,0.002944012,0.0006409987,0.007244474,0.0001076151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01098117,0.00004511337,0.9819736,0.0006669182,0.005564378,0.00008039641,9.363828e-7,0.00006919288,0.0006182688],"genre_scores_gemma":[0.9925175,0.00001676742,0.006948248,0.00007752457,0.0004155931,0.00000192407,0.00001074806,0.000005493521,0.00000623812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9815363,"threshold_uncertainty_score":0.4751402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389791575","doi":"10.1007/s10207-023-00790-z","title":"Detection, characterization, and profiling DoH Malicious traffic using statistical pattern recognition","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Profiling (computer programming); Computer science; Computer security; Data mining; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01625480221771067,"gpt":0.257742658488794,"spread":0.2414878562710834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965519,0.0001074082,0.0001358723,0.0005808097,0.0001321044,0.0003985346,0.000323933,0.00008143474,0.00002658398],"category_scores_gemma":[0.0001779731,0.0001051148,0.00005162845,0.0004008172,0.00003385894,0.003794509,0.0001073442,0.000231689,0.00004684084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009016824,"about_ca_system_score_gemma":0.00006259886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000105825,"about_ca_topic_score_gemma":0.000004737397,"domain_scores_codex":[0.9983686,0.00008275423,0.0007207743,0.0001022486,0.0005792328,0.0001463883],"domain_scores_gemma":[0.9981462,0.00008091621,0.0005920185,0.00009072872,0.001000465,0.00008967728],"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.00006834143,0.00004184593,0.0002649419,0.0000286239,0.00006934592,0.00002514063,0.003189167,0.0008265098,0.002054214,0.00118871,0.0001352025,0.9921079],"study_design_scores_gemma":[0.0009957084,0.0001756426,0.007107489,0.0001083867,0.00001677933,0.001077084,0.0002240394,0.9720201,0.008125583,0.004137996,0.005757067,0.0002540895],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4732576,0.000005567364,0.5249031,0.0003170344,0.001345734,0.00006631033,0.0000252568,0.00005859332,0.0000207321],"genre_scores_gemma":[0.9964997,0.0001424845,0.002559363,0.0003443466,0.0003672299,0.00000306341,0.00007683204,0.000004965478,0.000002021848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9918539,"threshold_uncertainty_score":0.4286459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808756028","doi":"10.1007/s10207-018-0412-6","title":"Mobile botnets meet social networks: design and analysis of a new type of botnet","year":2018,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Botnet; Malware; Exploit; Computer science; Computer security; The Internet; Popularity; Phishing; Computer network; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01789766609591484,"gpt":0.2879049886149598,"spread":0.2700073225190449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330897,0.00008079997,0.0002429073,0.0005750737,0.00004872462,0.00008431642,0.0005282402,0.00007723238,0.00006785813],"category_scores_gemma":[0.00008382494,0.00007354926,0.0001192356,0.0007661798,0.00007869619,0.001781053,0.0001251525,0.0001105534,0.000002118908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003772299,"about_ca_system_score_gemma":0.000109041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003165114,"about_ca_topic_score_gemma":0.000008330813,"domain_scores_codex":[0.9984649,0.00007416255,0.0007679897,0.00006467807,0.0005365522,0.00009174551],"domain_scores_gemma":[0.9971199,0.00007826389,0.001104071,0.0001009201,0.00153207,0.00006475798],"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.00364845,0.0006853795,0.004965488,0.00008687353,0.008821332,0.00001618263,0.1364704,0.09482974,0.001243228,0.1888775,0.09952588,0.4608296],"study_design_scores_gemma":[0.001036995,0.00115245,0.006773317,0.000060164,0.0001786187,0.00006269529,0.0001817551,0.9611269,0.003378757,0.009932642,0.01594451,0.0001712019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1440074,0.0001495836,0.8542659,0.000166648,0.0009031987,0.00008165595,0.0000057003,0.00001165572,0.0004082143],"genre_scores_gemma":[0.9891708,0.0001697719,0.01021633,0.0001718782,0.0002589266,6.217695e-7,0.000004689085,0.000001862489,0.00000508227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8662972,"threshold_uncertainty_score":0.2999252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404734879","doi":"10.1007/s10207-024-00935-8","title":"Analysis of machine learning-based approaches for securing the Internet of Things in the smart industry: a multivocal state of knowledge review","year":2024,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Internet of Things; State (computer science); Cryptography; The Internet; Computer security; Data science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0247317080774481,"gpt":0.2818980023388269,"spread":0.2571662942613788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003263616,0.00009611773,0.0002886475,0.0006674366,0.00002529711,0.00007967986,0.001014186,0.00006142839,0.00001553413],"category_scores_gemma":[0.00035966,0.0000585813,0.0003081064,0.001012774,0.00006822848,0.001294331,0.000107926,0.0005848148,7.977225e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000553017,"about_ca_system_score_gemma":0.0001192212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008520328,"about_ca_topic_score_gemma":0.00004535816,"domain_scores_codex":[0.9979268,0.0002116343,0.001140267,0.00007529511,0.0005583686,0.00008760988],"domain_scores_gemma":[0.9975826,0.0005812267,0.0009954401,0.0001417758,0.0006758912,0.00002304818],"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.0008602081,0.001016948,0.005227224,0.004649823,0.004371989,0.00001171729,0.212247,0.1201602,0.00007744532,0.08754448,0.002366285,0.5614668],"study_design_scores_gemma":[0.0002998787,0.0001400121,0.001101006,0.001018956,0.00009492174,0.00001595985,0.0001478382,0.9866671,0.0008956866,0.001057747,0.008504431,0.00005644354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2045034,0.006544475,0.781792,0.004816869,0.001027146,0.00060351,0.00005689837,0.00002565408,0.0006300409],"genre_scores_gemma":[0.9987621,0.0003626306,0.0005837329,0.0002328293,0.00002953769,0.000007535746,0.00001478196,0.000002520686,0.000004275861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8665069,"threshold_uncertainty_score":0.2540762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072056539","doi":"10.1007/s10207-008-0063-0","title":"Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions","year":2008,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Computer network; Message authentication code; Authentication (law); Channel (broadcasting); Cryptographic hash function; Hash chain; Computer security; Key (lock); Protocol (science); Context (archaeology); SHA-2; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01407461739347074,"gpt":0.2708106332347779,"spread":0.2567360158413071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860321,0.0001952018,0.0002435659,0.0009977709,0.0002096131,0.0003430803,0.001229426,0.00007797068,0.00007076388],"category_scores_gemma":[0.0004941908,0.0001740239,0.0002350494,0.0003788012,0.00006456125,0.005230049,0.0001252584,0.000421279,0.0002470644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00039395,"about_ca_system_score_gemma":0.0002564944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002830562,"about_ca_topic_score_gemma":0.0000076608,"domain_scores_codex":[0.9969199,0.0001937733,0.001149979,0.0001748428,0.001382691,0.0001788628],"domain_scores_gemma":[0.9954599,0.0003049949,0.00134794,0.000380123,0.002350075,0.0001569341],"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.00751392,0.006817246,0.002270584,0.0001900388,0.001905135,0.0004377124,0.7284297,0.01364359,0.00419859,0.1570815,0.05622049,0.02129159],"study_design_scores_gemma":[0.005884616,0.0007721665,0.01342199,0.0005963247,0.00004202261,0.0006970509,0.002360305,0.9187071,0.007701162,0.007321617,0.04186259,0.0006330841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2599535,0.00003531544,0.7167621,0.008085296,0.006343606,0.0004418218,0.00008542735,0.0001552452,0.008137685],"genre_scores_gemma":[0.997821,0.00001766925,0.0008331806,0.001021085,0.0001730422,0.00001281083,0.00004431894,0.000007424786,0.0000694465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9050635,"threshold_uncertainty_score":0.7096489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991891819","doi":"10.1007/s10207-011-0147-0","title":"Token-based graphical password authentication","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The King's University; University of Alberta","funders":"","keywords":"Password; Computer science; Cognitive password; One-time password; Password policy; Password strength; Hash function; S/KEY; Computer security; Cryptographic hash function","retraction":null,"screen_n_in":null,"score":{"opus":0.01702914417975478,"gpt":0.245957586467046,"spread":0.2289284422872913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774356,0.0001066024,0.0001433621,0.0005595183,0.00005146558,0.0002403275,0.001500311,0.00007481217,0.0001073475],"category_scores_gemma":[0.0001726704,0.00009409859,0.0001631322,0.000266975,0.00004442432,0.003219727,0.00007937081,0.0002004709,0.00012139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282704,"about_ca_system_score_gemma":0.0001450734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000183797,"about_ca_topic_score_gemma":0.000003173451,"domain_scores_codex":[0.9979054,0.00008407216,0.0009083926,0.00008368922,0.0008878224,0.0001306325],"domain_scores_gemma":[0.9972196,0.00005853685,0.0008176639,0.0002588408,0.001515875,0.0001295142],"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.0001834463,0.0006762504,0.006875345,0.00004226802,0.0002631432,0.0000282849,0.1425919,0.00001437616,0.0001697277,0.8248385,0.004638103,0.01967866],"study_design_scores_gemma":[0.007274888,0.0007371662,0.1335525,0.0003852267,0.00008839159,0.0009084222,0.001791886,0.4320566,0.016784,0.1971873,0.2079887,0.001244932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1313836,0.00004316728,0.8531275,0.005038423,0.003911089,0.0001988801,0.00001408816,0.0001213942,0.006161858],"genre_scores_gemma":[0.9935995,0.00001244135,0.005308388,0.0009651468,0.00009112876,0.000004091884,0.00000933211,0.000003110709,0.000006900572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8622159,"threshold_uncertainty_score":0.3837229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410580511","doi":"10.1007/s10207-025-01055-7","title":"Cyber defense in OCPP for EV charging security risks","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Zarqa University; Trent University; Nottingham Trent University; Centre International de Recherche sur le Cancer","keywords":"Computer security; Computer science; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.005992425785708422,"gpt":0.2760773228590938,"spread":0.2700848970733854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007955444,0.0001171503,0.0001770732,0.0006949977,0.00003043002,0.0001013715,0.0003385268,0.00009601756,0.0000268396],"category_scores_gemma":[0.0004231028,0.0001225929,0.0001179975,0.0002130399,0.00001733546,0.001491533,0.00001375558,0.0003552002,0.00001205208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005631348,"about_ca_system_score_gemma":0.0001104743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001465602,"about_ca_topic_score_gemma":0.00002588802,"domain_scores_codex":[0.9986421,0.00002962175,0.0007670616,0.00005045185,0.0003334341,0.000177329],"domain_scores_gemma":[0.9988611,0.0002171272,0.0002459947,0.00009016274,0.0005430626,0.00004250183],"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.0004883545,0.0001699133,0.005425391,0.0003727725,0.0007517526,0.00001496882,0.01124783,0.7619576,0.0003475988,0.1460425,0.0247132,0.04846812],"study_design_scores_gemma":[0.004111721,0.00007591719,0.008063662,0.0003174577,0.00003598251,0.00007869209,0.0004299811,0.8029813,0.007233645,0.04779045,0.1285435,0.0003377334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.878827,0.0006274226,0.09782551,0.001247458,0.005073605,0.00048492,0.00009080162,0.0001091975,0.01571409],"genre_scores_gemma":[0.9988048,0.0001195893,0.000548272,0.0003314825,0.0001460689,0.00001345237,0.00002266091,0.000007107827,0.000006556396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1199778,"threshold_uncertainty_score":0.4999195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3042666497","doi":"10.1007/s10207-020-00515-6","title":"A quantitative assessment of security risks based on a multifaceted classification approach","year":2020,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Information and Cyber Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Risk assessment; Cryptography; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05714892510202779,"gpt":0.3471846735578932,"spread":0.2900357484558654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009522322,0.0001665669,0.0002784669,0.0004337049,0.0000633444,0.0002294773,0.001282108,0.00009807487,0.00003912083],"category_scores_gemma":[0.0004575698,0.000148325,0.0002085597,0.0004396362,0.00005933045,0.003875163,0.0001116287,0.0004562317,0.00002580175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001583865,"about_ca_system_score_gemma":0.0003595359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001527533,"about_ca_topic_score_gemma":7.374428e-7,"domain_scores_codex":[0.9967796,0.0001614463,0.001302815,0.0001192326,0.001493903,0.0001429654],"domain_scores_gemma":[0.9952269,0.0001549725,0.001927691,0.0002209743,0.002306281,0.0001631393],"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.0006982541,0.0009045734,0.002129756,0.0001869079,0.0002947123,0.000008420003,0.06450891,0.02549379,0.0002979247,0.8918117,0.002995617,0.01066947],"study_design_scores_gemma":[0.001604813,0.0003621007,0.007725704,0.00004036079,0.000009773857,0.00001351044,0.00144644,0.9835668,0.0007942019,0.001092021,0.003199068,0.0001452056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0467224,0.000009742486,0.929803,0.005161392,0.0005669094,0.0002515747,0.00007110646,0.00005596625,0.01735787],"genre_scores_gemma":[0.9542497,0.00001292463,0.04321374,0.002406025,0.00005650117,0.000006016658,0.00005089307,0.000003697628,5.295632e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.958073,"threshold_uncertainty_score":0.604852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2311740434","doi":"10.1007/s10207-016-0314-4","title":"A formal modeling and analysis approach for access control rules, policies, and their combinations","year":2016,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Representation (politics); Markup language; Formal verification; Formal methods; XACML; Model checking; Abstract state machines; Formal specification; Formal language; Access control; Theoretical computer science; State (computer science); Finite-state machine; Programming language; XML; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01980190779401123,"gpt":0.3155002896277506,"spread":0.2956983818337393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009377871,0.00007355527,0.0001751483,0.0004114851,0.0002378365,0.0004036817,0.000324724,0.00005643259,0.00001395842],"category_scores_gemma":[0.0003400301,0.00004691362,0.0001039985,0.0001239032,0.00009637217,0.005333672,0.00005166416,0.00006644577,4.616929e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007654053,"about_ca_system_score_gemma":0.00009756561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002532475,"about_ca_topic_score_gemma":0.00008272478,"domain_scores_codex":[0.9990095,0.00004465409,0.0004370254,0.00005056287,0.0003217137,0.0001365278],"domain_scores_gemma":[0.9981149,0.0002000487,0.0004100795,0.00004238401,0.001138284,0.00009428302],"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.0004485028,0.0001765127,0.02970611,0.00002536089,0.002135078,5.635998e-7,0.02752154,0.001480468,0.00001522572,0.8405412,0.0003226884,0.09762668],"study_design_scores_gemma":[0.01649514,0.0001691259,0.03042166,0.00008566327,0.0005799411,0.00004896093,0.0115994,0.7852046,0.00004956976,0.1259926,0.02880499,0.0005484162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1402323,0.00008178046,0.8518739,0.004547477,0.0001377345,0.0001672586,0.0002143633,0.00001181665,0.002733298],"genre_scores_gemma":[0.9987462,0.0001981377,0.0005204949,0.0003529026,0.0001456741,0.000009275353,0.00001656216,0.000002091863,0.00000867708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8585138,"threshold_uncertainty_score":0.3892712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985317073","doi":"10.1007/s10207-007-0023-0","title":"Integrating software specifications into intrusion detection","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Unified Modeling Language; Intrusion detection system; Finite-state machine; Programming language; Software; Context (archaeology); State (computer science); Specification language; Software engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01196021126481714,"gpt":0.2549680585818327,"spread":0.2430078473170156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764941,0.0001339237,0.0001504395,0.0007950481,0.0001963361,0.0003874507,0.001085674,0.0001183914,0.00005650174],"category_scores_gemma":[0.0007000482,0.0001220942,0.000148458,0.0005214422,0.00004318594,0.006063376,0.0001933853,0.0004736661,0.00007421809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003255671,"about_ca_system_score_gemma":0.00008839778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004429638,"about_ca_topic_score_gemma":0.00007974815,"domain_scores_codex":[0.9976024,0.00005600638,0.001139124,0.0001083692,0.0009186055,0.0001754736],"domain_scores_gemma":[0.9963967,0.000181237,0.001068163,0.0002175399,0.002008156,0.0001282678],"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.0001500388,0.00009966602,0.0002987158,0.00001260557,0.00006686209,0.00001546669,0.009312822,0.0002044035,0.001720061,0.07104371,0.001020312,0.9160553],"study_design_scores_gemma":[0.003383641,0.0009314726,0.0171646,0.0004347551,0.00003802598,0.002477164,0.003234221,0.06108265,0.1511554,0.2114618,0.5475838,0.001052498],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0585669,0.00004881834,0.9349132,0.0009299463,0.003905704,0.00008767228,0.000001963882,0.00008512705,0.001460661],"genre_scores_gemma":[0.9487526,0.00007795193,0.05003049,0.0005010297,0.0006187055,0.000001676909,0.000007556993,0.00000436188,0.000005659571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9150028,"threshold_uncertainty_score":0.4978857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127630071","doi":"10.1007/s10207-013-0197-6","title":"A comprehensive study of queue management as a DoS counter-measure","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Timeout; Computer science; Computer network; Computer security; Denial-of-service attack; Service (business); Stateless protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.00801507349359151,"gpt":0.2468286478262466,"spread":0.238813574332655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839992,0.0001105431,0.0001816168,0.0004369926,0.00005392391,0.0002661137,0.001019562,0.00004900652,0.0001582375],"category_scores_gemma":[0.00003739135,0.00009592859,0.00009834203,0.0002488284,0.00002575298,0.00426595,0.0002284075,0.0002238778,0.000105462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009278532,"about_ca_system_score_gemma":0.00004530263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001757956,"about_ca_topic_score_gemma":0.000008509824,"domain_scores_codex":[0.9976995,0.00008273689,0.000881407,0.00008027439,0.001145912,0.0001101481],"domain_scores_gemma":[0.9962406,0.00005317979,0.0009140156,0.0001943008,0.00252448,0.00007348277],"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.001240928,0.005384565,0.003040409,0.0003220489,0.003588685,0.0002100741,0.1532551,0.007271963,0.0007844545,0.2287335,0.0525385,0.5436298],"study_design_scores_gemma":[0.03300937,0.01097511,0.1410388,0.001814751,0.0002176415,0.004098733,0.05673599,0.2465891,0.007888352,0.1532839,0.3421342,0.002214039],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9329414,0.00005023581,0.05805635,0.0009428648,0.002027581,0.0004789395,0.000003623981,0.00003355743,0.005465442],"genre_scores_gemma":[0.998073,0.00005619082,0.001171443,0.0005781426,0.00009591863,0.000009538735,0.000001739836,0.000002500991,0.00001146455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5414158,"threshold_uncertainty_score":0.3911854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388125065","doi":"10.1007/s10207-023-00759-y","title":"A survey on run-time packers and mitigation techniques","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Malware; Unpacking; Computer science; Ransomware; Malware analysis; Reverse engineering; Computer security; Identification (biology); Feature engineering; Cryptovirology; Encryption; Botnet; Data science; Artificial intelligence; World Wide Web; Operating system; Deep learning","retraction":null,"screen_n_in":null,"score":{"opus":0.008417021042561864,"gpt":0.2784693653436233,"spread":0.2700523443010615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041351,0.0000890768,0.0001139724,0.0007015629,0.00005098974,0.000208993,0.0005079964,0.00005869124,0.000009345818],"category_scores_gemma":[0.0005177131,0.00008239079,0.00005054414,0.0003534992,0.00003359342,0.003265622,0.0001237752,0.0001802961,0.00006856101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009842833,"about_ca_system_score_gemma":0.00005042394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001531814,"about_ca_topic_score_gemma":0.000002815458,"domain_scores_codex":[0.9986926,0.00006597884,0.0004814521,0.00007393098,0.0005883619,0.00009767044],"domain_scores_gemma":[0.9981552,0.0001802867,0.0005111002,0.0001229411,0.000967327,0.00006314152],"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.00040036,0.0001494564,0.003604426,0.00004379874,0.0002587947,0.00008082538,0.007933415,0.0003750343,0.002815803,0.07623507,0.08085486,0.8272482],"study_design_scores_gemma":[0.002811623,0.001995061,0.2476785,0.0006740463,0.00001849488,0.00092702,0.0004103682,0.07487708,0.3065412,0.2128107,0.1499689,0.001287127],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1914243,0.00002249193,0.7982951,0.005013106,0.001340435,0.0003246888,0.00009286731,0.001021072,0.002465847],"genre_scores_gemma":[0.9865662,0.0001226136,0.01241479,0.0007420178,0.00008481562,0.000005793581,0.00003375134,0.000004904061,0.00002509241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8259611,"threshold_uncertainty_score":0.3359799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000323983","doi":"10.1007/s10207-011-0138-1","title":"Concrete- and abstract-based access control","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thornhill Medical (Canada); Université du Québec en Outaouais","funders":"CA Technologies","keywords":"Computer science; Role-based access control; Access control; Predicate (mathematical logic); Predicate abstraction; Theoretical computer science; Privilege (computing); Liveness; Abstraction; Cardinality (data modeling); Programming language; Control (management); Computer security; Artificial intelligence; Model checking; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.02543066036074359,"gpt":0.3194726787613704,"spread":0.2940420184006268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007411308,0.0000576265,0.0001090181,0.0001686411,0.00009713528,0.0002592631,0.0004601448,0.00005735639,0.0005800129],"category_scores_gemma":[0.000356445,0.00004946008,0.00006022781,0.00005579225,0.0001214211,0.003975393,0.00002251536,0.0001393699,0.00001657347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004964339,"about_ca_system_score_gemma":0.0001866513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000597494,"about_ca_topic_score_gemma":0.00005860296,"domain_scores_codex":[0.9988737,0.00003917041,0.0004236258,0.000033123,0.0005336605,0.00009674018],"domain_scores_gemma":[0.9981301,0.0001081883,0.0005828353,0.00003846795,0.001037575,0.0001028565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.003135883,0.0001616532,0.1729156,0.00005524204,0.0008440994,0.0001164223,0.09155332,0.00007561305,0.00007195809,0.6178671,0.006990334,0.1062128],"study_design_scores_gemma":[0.01567028,0.0002875682,0.5674557,0.0002117474,0.0001330386,0.00008413754,0.009439923,0.0022063,0.00127855,0.04513663,0.357391,0.0007051313],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7477637,0.000164872,0.01302095,0.006985371,0.002757699,0.0002907056,0.00008047798,0.00005319252,0.2288831],"genre_scores_gemma":[0.9982784,0.00003762031,0.0001517937,0.001311166,0.0002097393,0.000001619829,0.000002629465,0.00000175822,0.000005291029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5727304,"threshold_uncertainty_score":0.6350734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041388850","doi":"10.1007/s10207-015-0278-9","title":"Preventing sensitive relationships disclosure for better social media preservation","year":2015,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Social media; Internet privacy; Enabling; Relevance (law); Information sharing; Key (lock); Private information retrieval; Information sensitivity; Social network (sociolinguistics); Information protection policy; Cryptography; Information privacy; Computer security; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.06401141018800097,"gpt":0.3070950346957376,"spread":0.2430836245077367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.002023907,0.0001009998,0.000141362,0.0003356027,0.0001030192,0.0003292053,0.006168652,0.0001170571,0.000003011098],"category_scores_gemma":[0.04176809,0.00009360426,0.0001001326,0.0002107902,0.0000430721,0.01003735,0.004606581,0.0003530846,0.00001244005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002003193,"about_ca_system_score_gemma":0.0001593066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004437385,"about_ca_topic_score_gemma":0.000006581905,"domain_scores_codex":[0.998049,0.00009993166,0.0007338084,0.00009184543,0.0008820908,0.000143317],"domain_scores_gemma":[0.9954336,0.0004629769,0.001015171,0.0005193368,0.002503728,0.00006518087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002812304,0.0001721237,0.005702147,0.00005175434,0.0003997051,0.00001778657,0.03573347,0.0002227602,0.0001050095,0.1182978,0.7786138,0.06040243],"study_design_scores_gemma":[0.001784281,0.000065202,0.009232393,0.00008005825,0.00001844345,0.0001139373,0.001409027,0.07293691,0.002125451,0.8873239,0.0246852,0.0002252237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07685965,0.00002295481,0.8582968,0.06187028,0.001892141,0.0001779083,0.00009560932,0.000108931,0.0006757324],"genre_scores_gemma":[0.8500332,0.000004652762,0.1491513,0.0002967271,0.0004076551,0.000007140408,0.00009217151,0.000004207388,0.000002886672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7731736,"threshold_uncertainty_score":0.9992085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378587114","doi":"10.1007/s10207-023-00701-2","title":"An effective attack scenario construction model based on identification of attack steps and stages","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Soundness; Intrusion detection system; Identification (biology); Computer security; Attack model; Completeness (order theory); Construct (python library); Data mining; Network security; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01296152833438818,"gpt":0.2888177537856274,"spread":0.2758562254512392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086004,0.0001043652,0.0001525677,0.0006977281,0.00008435899,0.0002373599,0.0004829982,0.00008118608,0.000008554437],"category_scores_gemma":[0.000153221,0.00009823119,0.00007531558,0.0003531789,0.00006788207,0.004037717,0.00006444959,0.000218601,0.00001662364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009720028,"about_ca_system_score_gemma":0.00007672692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006761479,"about_ca_topic_score_gemma":0.000003153757,"domain_scores_codex":[0.9981605,0.0001041571,0.000749334,0.0001094788,0.0007728973,0.0001036031],"domain_scores_gemma":[0.9974954,0.0001308168,0.0009640759,0.0001833945,0.00114995,0.00007642259],"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.0006666605,0.0002679835,0.00232713,0.0001081922,0.0001442484,0.000009322673,0.009255692,0.6888742,0.002583961,0.04989683,0.002311832,0.2435539],"study_design_scores_gemma":[0.0006810601,0.0002461708,0.009225524,0.00006834272,0.000006490863,0.0000342886,0.0001121442,0.9798128,0.005914597,0.003308683,0.000498277,0.00009159556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.643028,0.000007828963,0.3549601,0.0006340081,0.0009659881,0.0001440181,0.00002543966,0.00004926484,0.000185276],"genre_scores_gemma":[0.9971196,0.0000630498,0.002504144,0.0001935303,0.00008896616,0.0000042129,0.00001959072,0.000003443263,0.000003486032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3540915,"threshold_uncertainty_score":0.4005752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2730411761","doi":"10.1007/s10207-017-0384-y","title":"Optimal noise functions for location privacy on continuous regions","year":2017,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Obfuscation; Noise (video); Computer science; Function (biology); Limit (mathematics); Space (punctuation); Differential privacy; Topology (electrical circuits); Discrete mathematics; Mathematics; Theoretical computer science; Combinatorics; Algorithm; Computer security; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0277695902356638,"gpt":0.3084297444768912,"spread":0.2806601542412274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006697763,0.0001132871,0.0001482273,0.0003671343,0.0003135053,0.0009292468,0.01751887,0.00009129883,0.000008844341],"category_scores_gemma":[0.02661751,0.0001035842,0.0001149817,0.00008306831,0.00008413483,0.007176782,0.006087177,0.0002647571,0.00004844683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001722325,"about_ca_system_score_gemma":0.0001578233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299133,"about_ca_topic_score_gemma":0.000001763343,"domain_scores_codex":[0.998508,0.00002127055,0.0006108485,0.0001125838,0.0005959201,0.0001513885],"domain_scores_gemma":[0.9940057,0.0001608075,0.001462021,0.002282645,0.002023041,0.00006582624],"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.0003665005,0.0003228518,0.0009967629,0.00003646182,0.0003078078,0.00001737119,0.001533807,0.001393866,0.000117714,0.2167763,0.6954151,0.08271547],"study_design_scores_gemma":[0.004528564,0.0007758062,0.01479115,0.0004069382,0.00003716048,0.000484603,0.0004109637,0.2491878,0.004108178,0.3161646,0.408553,0.0005511605],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0188682,0.00001472812,0.9163331,0.06074384,0.002435342,0.000176716,0.00005944372,0.00009096318,0.001277649],"genre_scores_gemma":[0.8901038,0.00003519591,0.1091457,0.0004283137,0.0002157112,0.0000140498,0.00002970071,0.000004292079,0.00002319479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8712356,"threshold_uncertainty_score":0.9877968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013328030","doi":"10.1007/s10207-009-0088-z","title":"Uncertain inference control in privacy protection","year":2009,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; York University","funders":"","keywords":"Context (archaeology); Computer science; Inference; Enabling; Key (lock); Control (management); Computer security; Cryptography; Context awareness; Information privacy; Context management; Risk analysis (engineering); Data science; Ubiquitous computing; Human–computer interaction; Artificial intelligence; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01899064050931341,"gpt":0.2893987264470002,"spread":0.2704080859376867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009202496,0.00009883487,0.000175168,0.0006192521,0.00002955654,0.0003304774,0.0008675478,0.00006435435,0.00001886719],"category_scores_gemma":[0.0004971459,0.00009174366,0.00008699314,0.0002833645,0.00001398146,0.00692951,0.00004581133,0.0002935209,0.00004376897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002496903,"about_ca_system_score_gemma":0.0001810089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004010063,"about_ca_topic_score_gemma":0.000009072113,"domain_scores_codex":[0.9980782,0.0001065232,0.000911978,0.00006593974,0.0007142821,0.0001230805],"domain_scores_gemma":[0.9975546,0.0001027405,0.0008954324,0.0001390583,0.001242694,0.00006546515],"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.0004291916,0.0004831619,0.004781242,0.00002527758,0.0001285103,0.00006876702,0.02104376,0.001936766,0.001560965,0.03916974,0.0012706,0.929102],"study_design_scores_gemma":[0.02092848,0.001608272,0.2116999,0.001309264,0.00002504037,0.003186613,0.001570146,0.4992665,0.007657582,0.1078,0.1435535,0.001394698],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09777985,0.00002372477,0.8941976,0.005606966,0.0008905594,0.000215492,0.000006033496,0.00003772753,0.001242046],"genre_scores_gemma":[0.9974726,0.00001290753,0.001269682,0.00111805,0.000114261,0.000005015997,0.000002434031,0.00000139151,0.000003656448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9277073,"threshold_uncertainty_score":0.5023727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012114007","doi":"10.1007/s10207-012-0178-1","title":"Evaluation in the absence of absolute ground truth: toward reliable evaluation methodology for scan detectors","year":2012,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Ground truth; Computer science; Detector; Intrusion detection system; Data mining; Artificial intelligence; Intrusion; Common ground; Machine learning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0960749425709773,"gpt":0.3628560966939349,"spread":0.2667811541229576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01981306,0.0001032634,0.0001798233,0.0004760491,0.00006360431,0.0001178783,0.0009340544,0.00009584439,0.00004945262],"category_scores_gemma":[0.002312922,0.00008038746,0.0001328459,0.0003729532,0.00004096819,0.004888661,0.00007214852,0.0002287676,0.000005764693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003155268,"about_ca_system_score_gemma":0.0002364071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007494709,"about_ca_topic_score_gemma":0.00002230371,"domain_scores_codex":[0.9962898,0.0005776449,0.001015243,0.00008126469,0.001847607,0.0001883802],"domain_scores_gemma":[0.9948103,0.000721288,0.001188603,0.0001832707,0.003046988,0.00004951423],"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.0007074769,0.0005399211,0.001502749,0.0001023616,0.0003399374,0.000001379555,0.08476801,0.01527179,0.0008477797,0.23866,0.003037351,0.6542212],"study_design_scores_gemma":[0.004129479,0.0006004903,0.06824093,0.0001830786,0.0001105823,0.0003453579,0.002418743,0.7068066,0.006351615,0.1955405,0.01492899,0.0003436429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5391954,0.0004559424,0.4510855,0.001280496,0.006287549,0.0006438562,0.00001003213,0.00001435455,0.001026887],"genre_scores_gemma":[0.9890027,0.00006990483,0.01030405,0.0002451714,0.0003334885,0.00003080962,0.00001041974,0.000002766774,6.941729e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6915348,"threshold_uncertainty_score":0.686685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086224011","doi":"10.1007/s10207-015-0275-z","title":"A uniform approach for access control and business models with explicit rule realization","year":2015,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Access control; Computer science; Role-based access control; Business rule; Computer access control; Realization (probability); Representation (politics); Control (management); Physical access; Business process; Computer security; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03466014063651989,"gpt":0.3164250984426362,"spread":0.2817649578061163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008606181,0.00007281966,0.0001383683,0.0001867103,0.0001108214,0.0004596352,0.0003655671,0.00005773132,0.000005138731],"category_scores_gemma":[0.000275833,0.00005564909,0.00003182795,0.0001487618,0.00005890979,0.007611949,0.00002790671,0.00007473317,7.009548e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001107771,"about_ca_system_score_gemma":0.0003234337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004415206,"about_ca_topic_score_gemma":0.00007162727,"domain_scores_codex":[0.9987714,0.00003518835,0.0003755828,0.00004872504,0.0006607527,0.0001084075],"domain_scores_gemma":[0.9953981,0.00005797168,0.0005647389,0.0000440821,0.003813936,0.0001211614],"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.001682746,0.0001214454,0.005047114,0.00003378457,0.0001864051,0.000002417401,0.02425708,0.02227273,9.993104e-7,0.934082,0.001491416,0.01082187],"study_design_scores_gemma":[0.02798222,0.0003336677,0.009173477,0.0001821852,0.0001899421,0.0001760699,0.02359667,0.452902,0.00003636706,0.392029,0.09270621,0.0006922507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01554228,0.00004846152,0.9591705,0.001720674,0.0002570742,0.0002777406,0.00004175796,0.00001712572,0.02292444],"genre_scores_gemma":[0.9962845,0.00007235495,0.002844722,0.0004396249,0.0002918206,0.0000150977,0.00003558362,0.000003628695,0.00001260344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9807423,"threshold_uncertainty_score":0.551848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406914778","doi":"10.1007/s10207-025-00987-4","title":"An exploratory study on domain knowledge infusion in deep learning for automated threat defense","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; National Research Council Canada; Research and Productivity Council; University of Toronto","funders":"National Research Council Canada","keywords":"Computer science; Domain (mathematical analysis); Computer security; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01155881554980757,"gpt":0.300009676123055,"spread":0.2884508605732474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149468,0.0001222837,0.0001775483,0.001020322,0.0001252821,0.0002805129,0.0007633071,0.00008452667,0.000008165374],"category_scores_gemma":[0.0002105294,0.0001124892,0.00008580063,0.0004403459,0.00001838839,0.003601892,0.0001225404,0.0003522692,0.00001476291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002430506,"about_ca_system_score_gemma":0.0001161227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007113199,"about_ca_topic_score_gemma":0.0000888527,"domain_scores_codex":[0.9983125,0.0002207299,0.0007953709,0.0001138069,0.0004208534,0.0001367057],"domain_scores_gemma":[0.9981568,0.000181613,0.0004620481,0.0001594944,0.0009800695,0.00006001706],"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.003244893,0.004931798,0.01243741,0.0001018797,0.0004210381,0.00006837664,0.2786656,0.06244142,0.0006727311,0.2470928,0.004069502,0.3858526],"study_design_scores_gemma":[0.006542227,0.002391414,0.02119307,0.0003609909,0.00001427876,0.00005136276,0.008508313,0.8996836,0.001147307,0.03689209,0.02287662,0.000338758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7173102,0.0000486238,0.2788408,0.0004159859,0.001871533,0.0003042027,0.000001682771,0.0001230808,0.001083851],"genre_scores_gemma":[0.9981602,0.00002846719,0.001373361,0.0003061767,0.0001012126,0.00001664357,0.000007210607,0.000003197961,0.000003569854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8372421,"threshold_uncertainty_score":0.4587175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406016888","doi":"10.1007/s10207-024-00976-z","title":"A new method for securing binary deep neural networks against model replication attacks using magnetic tunnel junctions","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"Computer science; Replication (statistics); Artificial neural network; Cryptography; Binary number; Artificial intelligence; Computer security; Virology; Medicine; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01576238653082289,"gpt":0.3375861203679243,"spread":0.3218237338371014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009952976,0.0001550246,0.000200856,0.0006233216,0.0001877639,0.0003637565,0.001159802,0.0001041597,0.000007569167],"category_scores_gemma":[0.0005611384,0.0001571158,0.00019065,0.0003909944,0.00001900912,0.003795874,0.0002964781,0.0004199289,0.000001509836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000299667,"about_ca_system_score_gemma":0.0002528364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002352413,"about_ca_topic_score_gemma":0.000004412961,"domain_scores_codex":[0.9981633,0.00008072764,0.0009302779,0.0001693009,0.0004647036,0.0001916674],"domain_scores_gemma":[0.9973249,0.0002056493,0.0008678334,0.0003175524,0.001189526,0.00009450996],"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.00006598343,0.00001806962,0.00008525739,0.00001136336,0.00004966192,0.000001519055,0.0009630907,0.8926038,0.00006530028,0.02401013,0.000595125,0.08153076],"study_design_scores_gemma":[0.0009354351,0.00004095547,0.0002619905,0.00006058236,0.00002491461,0.00006006872,0.0001000852,0.9872231,0.00006084242,0.009626538,0.001479947,0.0001255367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003917488,0.0000972194,0.9906269,0.002216772,0.002346909,0.0001975524,0.000003867871,0.00005602956,0.0005372629],"genre_scores_gemma":[0.4855046,0.00001834419,0.513015,0.001110123,0.000290825,0.000006171211,0.00001684242,0.000006463182,0.00003168735],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4815871,"threshold_uncertainty_score":0.6406994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410876142","doi":"10.1007/s10207-025-01066-4","title":"A Data-centric approach for safe and secure large language models against threatening and toxic content","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Cryptography; Computer security; Internet privacy","retraction":null,"screen_n_in":null,"score":{"opus":0.02298082640046019,"gpt":0.2729595508045289,"spread":0.2499787244040688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503217,0.00007987649,0.0001217889,0.0002844502,0.00007927926,0.0003263124,0.0005212439,0.00004973054,0.000001217858],"category_scores_gemma":[0.0001172608,0.00006767852,0.00003635996,0.0001166017,0.00001559465,0.003284036,0.0002484657,0.0001389027,6.299811e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006100207,"about_ca_system_score_gemma":0.00006553856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007581378,"about_ca_topic_score_gemma":0.000003424847,"domain_scores_codex":[0.9991101,0.00002349466,0.0003894735,0.00009613139,0.0002698276,0.0001109909],"domain_scores_gemma":[0.9990396,0.00005121658,0.0002814775,0.0001375451,0.0004351902,0.00005492387],"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.0005352306,0.0003148319,0.0009368197,0.0002950072,0.0007825797,0.00002903887,0.02143326,0.001810759,0.0006524885,0.6310655,0.004179295,0.3379652],"study_design_scores_gemma":[0.002266628,0.00006122565,0.0003709709,0.00008782477,0.0000177904,0.0001499783,0.001476222,0.974417,0.0007007282,0.005319181,0.01500811,0.0001243199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06102405,0.000482263,0.9354936,0.0006338308,0.0003563643,0.0001441581,0.00008723266,0.00001939479,0.001759134],"genre_scores_gemma":[0.9711754,0.0002400441,0.02775321,0.000678547,0.00006200976,0.000003589442,0.00006553019,0.0000019553,0.00001975609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9726062,"threshold_uncertainty_score":0.3146638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360866285","doi":"10.1007/s10207-023-00678-y","title":"A typology of secure multicast communication over 5 G/6 G networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Signcryption; Pragmatic General Multicast; Xcast; Public-key cryptography; Encryption; IP multicast; Protocol Independent Multicast; Digital signature; Cryptography; Computer security; Hash function","retraction":null,"screen_n_in":null,"score":{"opus":0.007796838734247098,"gpt":0.2748874079315022,"spread":0.2670905691972552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008104485,0.0000816289,0.0001536828,0.0005327527,0.00004717842,0.0001086953,0.001419742,0.00008213355,0.00004272913],"category_scores_gemma":[0.0002037919,0.00007462002,0.0001324864,0.0005181938,0.00007272496,0.003017274,0.0003387322,0.0002583995,0.00002189816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003309738,"about_ca_system_score_gemma":0.00006212522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002654288,"about_ca_topic_score_gemma":0.00001021972,"domain_scores_codex":[0.9985045,0.0000787122,0.0007250273,0.00005755407,0.0005147688,0.0001194788],"domain_scores_gemma":[0.9976816,0.000195879,0.0008049228,0.0002849317,0.0009704184,0.00006228634],"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.0001121019,0.0001132598,0.002837947,0.00001977581,0.0001687633,0.00001117088,0.008344668,0.001807214,0.0000429845,0.9572839,0.0157725,0.01348568],"study_design_scores_gemma":[0.004983282,0.00040171,0.1132922,0.0003230001,0.00004265879,0.0005526454,0.002244639,0.5874165,0.001174474,0.1619007,0.1270928,0.0005754003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2492841,0.000223853,0.7400827,0.00414092,0.002629068,0.0001822165,0.0001193498,0.000122473,0.003215299],"genre_scores_gemma":[0.9935416,0.0003209097,0.005688113,0.0003093178,0.00007368092,0.000001575082,0.00006175244,0.000002205653,8.361021e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7953832,"threshold_uncertainty_score":0.3042916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408285997","doi":"10.1007/s10207-025-01011-5","title":"Understanding the impact of IoT security patterns on CPU usage and energy consumption: a dynamic approach for selecting patterns with deep reinforcement learning","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Green IT and Sustainability","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Energy consumption; Internet of Things; Consumption (sociology); Computer security; Cryptography; Energy (signal processing); Embedded system; Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01342992712764962,"gpt":0.2630482604153592,"spread":0.2496183332877096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249605,0.0001329885,0.0001772733,0.0002752622,0.00009805061,0.0001088357,0.0001870257,0.00005662433,0.00001833341],"category_scores_gemma":[0.00008503285,0.00009270897,0.0001097092,0.00009801481,0.0000371777,0.00045605,0.0000343851,0.0002773744,1.208905e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006390357,"about_ca_system_score_gemma":0.00006105301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005702867,"about_ca_topic_score_gemma":0.00003340664,"domain_scores_codex":[0.9989036,0.00003980183,0.0005346122,0.00005958804,0.0003212747,0.0001411258],"domain_scores_gemma":[0.9989205,0.0001900539,0.000328181,0.00007856917,0.0004415296,0.00004114804],"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.000603678,0.00006082651,0.1039271,0.0005064823,0.0008788262,0.000002213862,0.01078587,0.8702015,0.00002956497,0.008515025,0.00006385268,0.00442511],"study_design_scores_gemma":[0.001461157,0.0002894419,0.02052649,0.0002075276,0.00003577209,0.00005563724,0.004636693,0.9705823,0.0002054123,0.001774068,0.00008470049,0.0001407836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4583553,0.00001936387,0.5408498,0.00004562828,0.0000823786,0.00008535176,0.000009511817,0.0000125881,0.0005400865],"genre_scores_gemma":[0.9996916,0.00005735065,0.0001384774,0.00003558273,0.00002917713,0.000008435417,0.0000290956,0.000005610955,0.000004684179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5413363,"threshold_uncertainty_score":0.3780562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026847288","doi":"10.1007/s10207-006-0084-5","title":"Hierarchical time-based information release","year":2006,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Confidentiality; Computer science; Bidding; Encryption; Computer security; Cryptography; Business information; Information sensitivity; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.003301582137732803,"gpt":0.2164810489158409,"spread":0.2131794667781081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006419375,0.0001180889,0.0001417064,0.0007026112,0.00007196663,0.0005900055,0.001197165,0.00007757083,0.00008027775],"category_scores_gemma":[0.0001879342,0.0001064562,0.0001779582,0.0003193167,0.00005019208,0.01214881,0.0001187172,0.0002867297,0.0001956159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000870424,"about_ca_system_score_gemma":0.0002024996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000417568,"about_ca_topic_score_gemma":0.000002582155,"domain_scores_codex":[0.9977489,0.00005748344,0.0009562038,0.00005951235,0.001029236,0.0001486797],"domain_scores_gemma":[0.9975297,0.0001074061,0.0007998755,0.0002105865,0.001252862,0.00009959525],"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.0002938988,0.0002822487,0.001003096,0.00002861147,0.00007285385,0.00002508745,0.001424248,0.002399934,0.00007072976,0.9045684,0.04608004,0.04375089],"study_design_scores_gemma":[0.004323367,0.000271519,0.01502972,0.0001150502,0.00001971722,0.0004156481,0.0000799129,0.1876381,0.003197879,0.1588024,0.6295975,0.000509085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03361001,0.00002633928,0.9549303,0.00370308,0.0009941489,0.00009813907,0.00009696219,0.00007747771,0.006463566],"genre_scores_gemma":[0.9713336,0.000009800079,0.02654155,0.001679899,0.0002316146,0.000002344699,0.0001973738,0.000002208116,0.000001598223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9377236,"threshold_uncertainty_score":0.8807597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021082070","doi":"10.1007/s10207-007-0047-5","title":"Discretionary capability confinement","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Annotation; Extensibility; Cryptography; Distributed computing; Access control; Programming language; Software engineering; Operating system; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.005381315075705473,"gpt":0.258682177015339,"spread":0.2533008619396335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433967,0.00007142894,0.00010931,0.0001707504,0.00003864784,0.0001690135,0.0008339487,0.00003982034,0.00004870473],"category_scores_gemma":[0.0001263913,0.00005973087,0.00009412179,0.0001284227,0.00002847504,0.002651829,0.00008574117,0.0001427217,0.00003350934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000125491,"about_ca_system_score_gemma":0.00008530672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002086877,"about_ca_topic_score_gemma":0.000005161574,"domain_scores_codex":[0.9981884,0.00002239426,0.000831213,0.00005409366,0.0007910078,0.0001128652],"domain_scores_gemma":[0.9977543,0.00006036811,0.0006024947,0.0001372872,0.001357298,0.00008821143],"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.0002043944,0.000317458,0.005680007,0.00003515131,0.000205223,0.00008128319,0.008066192,0.000364985,0.0002293459,0.8207996,0.01705591,0.1469604],"study_design_scores_gemma":[0.002591754,0.0002147308,0.1046846,0.0001481412,0.000008978958,0.001004328,0.001136892,0.01808626,0.003063434,0.02333099,0.845354,0.0003758522],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03639401,0.00004147474,0.9488086,0.002411389,0.002170436,0.00006821251,0.00002521011,0.00002259446,0.01005815],"genre_scores_gemma":[0.9944249,0.000009728361,0.004869876,0.00050056,0.0001696667,7.592214e-7,0.00001430459,0.000001089903,0.000009060239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9580309,"threshold_uncertainty_score":0.2435754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2924389930","doi":"10.1007/s10207-019-00431-4","title":"Secure and trusted partial grey-box verification","year":2019,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; Component (thermodynamics); Encryption; Process (computing); Black box; Model checking; Software engineering; Embedded system; Computer security; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.004447922146211844,"gpt":0.2464692546969732,"spread":0.2420213325507614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607881,0.00008248167,0.0001128152,0.0002919371,0.00003094332,0.0002226871,0.0005485631,0.00006122231,0.00004128194],"category_scores_gemma":[0.0001328159,0.00007638942,0.00005436058,0.000142468,0.00002124153,0.005737848,0.0001044545,0.0001939494,0.00004352477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008540834,"about_ca_system_score_gemma":0.00005869412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004650934,"about_ca_topic_score_gemma":6.261274e-7,"domain_scores_codex":[0.9987872,0.00003232095,0.0005120725,0.00007608629,0.0005065139,0.00008585805],"domain_scores_gemma":[0.9981084,0.00004528274,0.0006362324,0.0001518547,0.0009971363,0.00006102406],"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.0004850431,0.0001801977,0.00519742,0.00008624183,0.0002611126,0.0000268184,0.01513123,0.0009103321,0.004305697,0.6367608,0.004065646,0.3325895],"study_design_scores_gemma":[0.005822981,0.001113113,0.02618158,0.0003053628,0.00002931644,0.002784549,0.001171336,0.1168805,0.1783841,0.1039642,0.5623532,0.001009769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1584913,0.00003530263,0.8369692,0.001432319,0.00148641,0.0001373469,0.00000776798,0.00009534567,0.001344964],"genre_scores_gemma":[0.9820212,0.00005627186,0.01739377,0.0004186948,0.00008864841,0.000002633526,0.000005108004,0.000002655393,0.00001098386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8235299,"threshold_uncertainty_score":0.4159801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4377023325","doi":"10.1007/s10207-023-00702-1","title":"Analysis of OSPU security effect and data assembly verification under semi-network OS architecture","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer security model; Security service; Data security; Distributed System Security Architecture; Security testing; Computer security; Enterprise information security architecture; Cloud computing security; Security information and event management; Information security; Operating system; Encryption; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0185723678339966,"gpt":0.3108662369331934,"spread":0.2922938690991967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002706871,0.0001418221,0.0003223754,0.0009225724,0.0001009905,0.0002989153,0.001996261,0.0001025364,0.00001546898],"category_scores_gemma":[0.0004463075,0.0001304974,0.0001416582,0.001657844,0.00005888732,0.002607116,0.0005696106,0.0003180349,0.00001291032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006741631,"about_ca_system_score_gemma":0.0001103193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000261753,"about_ca_topic_score_gemma":0.00001050438,"domain_scores_codex":[0.9975135,0.0001864791,0.0009863548,0.0001919898,0.0009472001,0.0001744313],"domain_scores_gemma":[0.9966222,0.0006146848,0.001238741,0.0005780754,0.0008510827,0.00009523966],"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.0006878084,0.000429339,0.05125553,0.0004560535,0.01041514,0.00004624738,0.05236921,0.3140113,0.0008096796,0.3655188,0.02593055,0.1780703],"study_design_scores_gemma":[0.0008400105,0.0001122537,0.07108193,0.0001065801,0.0002008759,0.00008618097,0.0002582635,0.9037547,0.0006467183,0.01204401,0.01063023,0.000238265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4391792,0.0001221032,0.5560527,0.002408675,0.001372531,0.0001608529,0.00009401474,0.00009341892,0.0005164813],"genre_scores_gemma":[0.9967517,0.0001427414,0.002403778,0.0002775946,0.0001927907,0.000002054655,0.0002233474,0.000003868887,0.000002175641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5897433,"threshold_uncertainty_score":0.5321528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393442760","doi":"10.1007/s10207-024-00839-7","title":"Attribute inference privacy protection for pre-trained models","year":2024,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Manitoba","funders":"","keywords":"Inference; Computer science; Privacy protection; Computer security; Internet privacy; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04155114652596329,"gpt":0.3321570768340595,"spread":0.2906059303080962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009457544,0.0001179351,0.000135869,0.0005413779,0.00005588321,0.0008283941,0.01050796,0.0001023624,0.000009304981],"category_scores_gemma":[0.009440517,0.0001024505,0.0001244289,0.0002972913,0.0000354442,0.0123187,0.005679816,0.000334203,0.00001563085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002361708,"about_ca_system_score_gemma":0.0002457705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001076555,"about_ca_topic_score_gemma":0.000001146101,"domain_scores_codex":[0.9982822,0.00002753924,0.0007206413,0.0001229015,0.0006882722,0.000158479],"domain_scores_gemma":[0.997284,0.0001843626,0.0004197744,0.0008368969,0.001222291,0.0000527093],"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.0002499672,0.0001645049,0.00008648449,0.0003590818,0.0005830316,0.000034558,0.007194496,0.003733263,0.0006523897,0.4853732,0.1507097,0.3508593],"study_design_scores_gemma":[0.000260696,0.00007412794,0.00009179027,0.0001219084,0.000004279609,0.00009879914,0.00002088012,0.5498512,0.001582796,0.4297901,0.01802333,0.00008009857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008013323,0.00008255676,0.9612163,0.02794873,0.001929762,0.0002613787,0.00008795151,0.0002639373,0.0001960886],"genre_scores_gemma":[0.8970383,0.00007705568,0.1024883,0.0001796868,0.0001535912,0.00002629997,0.00002610139,0.000004367168,0.000006252584],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.889025,"threshold_uncertainty_score":0.9989034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386742716","doi":"10.1007/s10207-023-00744-5","title":"Pepal: Penalizing multimedia breaches and partial leakages","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"National Science Foundation","keywords":"Computer science; Communication source; Computer security; Oblivious transfer; Cryptocurrency; Cryptography; Protocol (science); Computer network; Public-key cryptography; Key (lock); Adversarial system; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01379885153005691,"gpt":0.2807438770143954,"spread":0.2669450254843385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005385761,0.00007450386,0.00009827025,0.0004389159,0.00005752956,0.0002371143,0.0005613275,0.00003932686,0.000003969272],"category_scores_gemma":[0.0001022997,0.00006334699,0.00006788921,0.0001881353,0.00004061371,0.003783476,0.0001750599,0.0001489707,0.00001128892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002184482,"about_ca_system_score_gemma":0.00002652118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007221428,"about_ca_topic_score_gemma":6.763815e-7,"domain_scores_codex":[0.9989691,0.00003096455,0.0004043102,0.00005626856,0.0004314017,0.0001079182],"domain_scores_gemma":[0.9990593,0.00008707205,0.00034478,0.00008648278,0.0003630148,0.00005938849],"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.0002053267,0.0001399604,0.01954095,0.00009404978,0.0004405085,0.0001666117,0.07623164,0.0005295152,0.001169696,0.176993,0.01465211,0.7098366],"study_design_scores_gemma":[0.004391165,0.0005249393,0.08963974,0.0006641853,0.00004093732,0.001996206,0.002532861,0.3095113,0.04932605,0.1939828,0.346242,0.001147932],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2272368,0.0001031171,0.7647595,0.004182198,0.001760563,0.0001194101,0.0000168663,0.0003842883,0.001437224],"genre_scores_gemma":[0.9837308,0.0002361386,0.01566132,0.0002370792,0.0001193599,0.00000205992,0.000007238756,0.00000221994,0.000003805219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7564939,"threshold_uncertainty_score":0.2742929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3069894190","doi":"10.1007/s10207-021-00560-9","title":"Password guessers under a microscope: an in-depth analysis to inform deployments","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Information Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Password; Leverage (statistics); Computer science; Set (abstract data type); Password strength; Cognitive password; Password cracking; Computer security; Training set; Artificial intelligence; One-time password","retraction":null,"screen_n_in":null,"score":{"opus":0.02151955549784666,"gpt":0.3258799366654564,"spread":0.3043603811676098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001240591,0.000268029,0.0005393748,0.002495963,0.00005541648,0.002004141,0.003047545,0.0002250723,0.00005503177],"category_scores_gemma":[0.0001640095,0.0002678293,0.0003803352,0.001243336,0.00002370582,0.005019224,0.001061387,0.0006924848,0.00004387816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005668454,"about_ca_system_score_gemma":0.0005987544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002603088,"about_ca_topic_score_gemma":0.0006229037,"domain_scores_codex":[0.9957664,0.0001544824,0.001948805,0.0002424986,0.00164574,0.000242048],"domain_scores_gemma":[0.9949047,0.00005763739,0.001536286,0.0006268405,0.002586516,0.0002880085],"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.0004105351,0.002080243,0.04468628,0.0004253494,0.01025444,0.0002333346,0.7942561,0.08077787,0.0003113103,0.03870328,0.004687961,0.0231733],"study_design_scores_gemma":[0.005254433,0.0003980698,0.279814,0.001592522,0.000606223,0.0003985664,0.01426299,0.6411921,0.003383422,0.01506788,0.03556837,0.002461347],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6666002,0.00007379879,0.32441,0.004464647,0.003301468,0.0003248599,0.00004517746,0.00005564157,0.0007242187],"genre_scores_gemma":[0.9930497,0.00007058252,0.004609728,0.001960331,0.0001028002,0.00001480676,0.0001696205,0.000007632269,0.00001474905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7799931,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416242031","doi":"10.1007/s10207-025-01156-3","title":"A deep learning-based vulnerability detection in blockchain smart contracts using masked attention and control flow graph analysis","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"York University","keywords":"Control flow graph; Cryptocurrency; Timestamp; Deep learning; Opcode; Key (lock); Graph; Vulnerability (computing); Reliability (semiconductor)","retraction":null,"screen_n_in":null,"score":{"opus":0.004444173080824017,"gpt":0.2455051076285228,"spread":0.2410609345476988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001538082,0.0001209834,0.0002637315,0.001785691,0.0001198385,0.0001757069,0.0004831724,0.0001514813,0.000006138607],"category_scores_gemma":[0.000368227,0.000120046,0.0001584172,0.001135687,0.00007439706,0.0007699035,0.00006798571,0.000479212,0.000001126635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001890232,"about_ca_system_score_gemma":0.00008391039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101336,"about_ca_topic_score_gemma":0.0002185387,"domain_scores_codex":[0.9983297,0.0001718677,0.0008510445,0.0001408049,0.0003646192,0.000141939],"domain_scores_gemma":[0.9979827,0.0001880247,0.0006551472,0.0001791869,0.0009425386,0.00005235299],"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.0007821803,0.0009318171,0.200503,0.00009377226,0.002233682,0.00003216036,0.003237351,0.5248995,0.001968316,0.05014963,0.00002101734,0.2151476],"study_design_scores_gemma":[0.001597676,0.00003838289,0.06084662,0.00002462699,0.00006331898,0.00001887421,0.00008653526,0.9269646,0.0006470797,0.009376459,0.000245511,0.00009030163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3906924,0.00004637677,0.6079414,0.0009903486,0.00016458,0.000102471,0.000002759092,0.00002655524,0.00003306081],"genre_scores_gemma":[0.9948456,0.00001389845,0.004782517,0.0003227821,0.0000168842,0.000009944738,0.0000056568,0.000001742801,9.804896e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6041532,"threshold_uncertainty_score":0.4895334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2463836678","doi":"10.1007/s10207-016-0341-1","title":"HiveSec: security in resource-constrained wireless networks inspired by beehives and bee swarms","year":2016,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Boeing","keywords":"Computer science; Computer security; Security testing; Cryptography; Security through obscurity; Logical security; Computer security model; Wireless; Wireless security; Key (lock); Resource (disambiguation); Wireless network; Security convergence; Cloud computing security; Security service; Security information and event management; Software security assurance; Network security policy; Computer network; Information security; Telecommunications; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.005406614865520223,"gpt":0.2428398990751442,"spread":0.237433284209624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008350224,0.0001539055,0.0002166936,0.0005668503,0.00007395115,0.00028635,0.0008369872,0.00008625844,0.00004230284],"category_scores_gemma":[0.000123075,0.0001175677,0.00009899336,0.000283893,0.0001328475,0.003976589,0.0002136741,0.0002399955,0.000003216159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009743273,"about_ca_system_score_gemma":0.00008542045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003796646,"about_ca_topic_score_gemma":0.00004178538,"domain_scores_codex":[0.9979275,0.0001047365,0.0009957999,0.0001344508,0.0006143423,0.0002232106],"domain_scores_gemma":[0.998347,0.0002388879,0.0006926632,0.0001352239,0.0004470737,0.000139102],"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.0005155611,0.0005966426,0.02990864,0.00005101437,0.0004254919,0.0000865624,0.04349349,0.0001299341,0.00209698,0.5296475,0.01984592,0.3732022],"study_design_scores_gemma":[0.04066984,0.001643294,0.08344627,0.001716683,0.00008185989,0.002445299,0.0107514,0.1590103,0.01093146,0.354161,0.3321234,0.003019183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5970587,0.0001710159,0.3949576,0.00650106,0.0004668211,0.0001713728,0.00009295643,0.00003148448,0.0005489335],"genre_scores_gemma":[0.9977088,0.0003168383,0.001214443,0.0006411424,0.0000892633,0.000004933634,0.00001782215,0.000003875375,0.000002904523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4006501,"threshold_uncertainty_score":0.4794271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409858799","doi":"10.1007/s10207-025-01048-6","title":"Correction: An exploratory study on domain knowledge infusion in deep learning for automated threat defense","year":2025,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; National Research Council Canada; Research and Productivity Council; University of Toronto","funders":"National Research Council Canada","keywords":"Computer science; Domain (mathematical analysis); Exploratory research; Computer security; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.0124825359158885,"gpt":0.2949284097672933,"spread":0.2824458738514048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142253,0.0001296572,0.0001847118,0.00103135,0.0001558321,0.0002846977,0.0006456438,0.00009211528,0.00001081582],"category_scores_gemma":[0.0002999821,0.000121678,0.00009099536,0.0005154751,0.00001977174,0.003720228,0.0001338819,0.0004134978,0.00001585183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002988635,"about_ca_system_score_gemma":0.0001318302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009842333,"about_ca_topic_score_gemma":0.0001537971,"domain_scores_codex":[0.9982642,0.0002332,0.000815466,0.000123889,0.000426401,0.000136873],"domain_scores_gemma":[0.9979457,0.0002317597,0.0004940562,0.0001530684,0.001113909,0.00006154784],"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.00377541,0.004765512,0.01087064,0.00008161047,0.0004325857,0.00006369855,0.2615411,0.0720235,0.000270954,0.1101957,0.0149268,0.5210525],"study_design_scores_gemma":[0.004602845,0.001974933,0.01613202,0.000327861,0.00001235136,0.00007680169,0.008166525,0.9240811,0.0007149217,0.01513042,0.02851057,0.0002696861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6423437,0.00006071511,0.3459292,0.0005074602,0.008003167,0.0004066236,0.000001588173,0.0001897614,0.002557801],"genre_scores_gemma":[0.9986555,0.00003039761,0.0008353458,0.0002851613,0.0001490798,0.00001956857,0.000007868652,0.000003480247,0.00001361161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8520576,"threshold_uncertainty_score":0.4961883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}