{"meta":{"query_hash":"c3a841edb613","filters":{"venue":"Journal of Computer Security"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c3a841edb613","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computer+Security"},"results":[{"id":"W1627695629","doi":"10.3233/jcs-2010-0411","title":"Exploiting predictability in click-based graphical passwords","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Carleton University","funders":"","keywords":"Password; Computer science; Set (abstract data type); Predictability; Markov chain; Context (archaeology); Cardinality (data modeling); Field (mathematics); Data mining; Image (mathematics); Theoretical computer science; Artificial intelligence; Machine learning; Computer security; Programming language; Mathematics","score_opus":0.029034769906996303,"score_gpt":0.2412165982529087,"score_spread":0.2121818283459124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627695629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92116535,0.00019835478,0.07483086,0.0002357245,0.00002627755,0.00009920544,0.00038167802,0.0015666642,0.0014960131],"genre_scores_gemma":[0.9969779,0.00002260038,0.0026778316,0.000016409307,0.0000046181226,0.000009717503,0.00010665889,0.000018589342,0.00016568137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967276,0.0009844723,0.00018253436,0.0006200879,0.0010586426,0.00042666146],"domain_scores_gemma":[0.96221095,0.021896882,0.00452766,0.009148632,0.001252638,0.00096318306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030243318,0.00083845865,0.0010400203,0.0014933605,0.0005237255,0.0012973716,0.0008925727,0.0010562375,0.0019060558],"category_scores_gemma":[0.029821094,0.00050537876,0.0008136213,0.0006967856,0.0015091549,0.0037198777,0.0019618426,0.0014962472,0.0005920192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045628417,0.0011362295,0.25153744,0.0006749036,0.0005528902,0.0015264697,0.0017067979,0.43509224,0.09228949,0.022743743,0.004810408,0.1833666],"study_design_scores_gemma":[0.000038592963,0.0006698558,0.031301502,0.000021547456,0.000040125895,0.0007931305,0.00008624244,0.9417927,0.016659644,0.0080079585,0.0005195433,0.00006918879],"about_ca_topic_score_codex":0.0019215515,"about_ca_topic_score_gemma":0.0021534367,"teacher_disagreement_score":0.0030243318,"about_ca_system_score_codex":0.00082413846,"about_ca_system_score_gemma":0.0005485135,"threshold_uncertainty_score":0.01599437},"labels":[],"label_agreement":null},{"id":"W1749166516","doi":"10.3233/jcs-2008-16204","title":"Approximate autoregressive modeling for network attack detection","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Defense Advanced Research Projects Agency; Atlantic Canada Opportunities Agency","keywords":"Autoregressive model; Computer science; STAR model; Autoregressive integrated moving average; Econometrics; Mathematics; Time series; Machine learning","score_opus":0.029567384811236566,"score_gpt":0.25406067920162606,"score_spread":0.2244932943903895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749166516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004988459,0.0006476727,0.9930311,0.00014210978,0.000049404392,0.000007896881,0.000064726555,0.00040435308,0.0006642939],"genre_scores_gemma":[0.61959094,0.0041702897,0.35956714,0.00025720478,0.0005471237,0.00016161181,0.0011538602,0.00028825057,0.014263604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00032669213,0.00003257403,0.00011251451,0.00020608616,0.000046757297],"domain_scores_gemma":[0.99835014,0.0011442722,0.00014019595,0.0001652462,0.00017497374,0.00002521813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012719393,0.0006365145,0.0008726444,0.0006412071,0.00021856253,0.00082506886,0.00071690435,0.00077023887,0.0016682422],"category_scores_gemma":[0.005355993,0.00041225995,0.0006299228,0.0009674693,0.00030105864,0.0011685676,0.0005562842,0.0015118432,0.00096182985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096511554,0.00005522913,0.0011624204,0.00009372178,0.00013280887,0.00006287258,0.00006148317,0.7994013,0.002837578,0.033539753,0.0026264891,0.15992992],"study_design_scores_gemma":[0.0000022272234,0.000009511055,0.00015463482,0.0000028901875,0.0000056547638,0.0000060653224,0.0000026551768,0.9945024,0.00017684407,0.0045640776,0.0005693286,0.0000037078942],"about_ca_topic_score_codex":0.0055980682,"about_ca_topic_score_gemma":0.0041790497,"teacher_disagreement_score":0.0055980682,"about_ca_system_score_codex":0.00041168754,"about_ca_system_score_gemma":0.00058004167,"threshold_uncertainty_score":0.011130989},"labels":[],"label_agreement":null},{"id":"W1893507969","doi":"10.3233/jcs-140514","title":"<i>k</i> -jump: A strategy to design publicly-known algorithms for privacy preserving micro-data disclosure","year":2015,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Generalization; Jump; Algorithm; Adversarial system; Data mining; Artificial intelligence; Mathematics","score_opus":0.14104985709097678,"score_gpt":0.33637696126704797,"score_spread":0.1953271041760712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893507969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033589125,0.00009790643,0.96226346,0.0008213364,0.000031168394,0.00016144704,0.000048131402,0.0009149328,0.0020724132],"genre_scores_gemma":[0.67796814,0.00011315216,0.3189285,0.00039815358,0.00007069445,0.00024406663,0.00011508793,0.00020033465,0.00196189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909277,0.0039396347,0.00062725024,0.0017196304,0.0018763576,0.0009095213],"domain_scores_gemma":[0.95374525,0.025538089,0.0037077912,0.013124349,0.0026541739,0.0012302692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011098176,0.00083626556,0.0014462983,0.0013629185,0.0014743614,0.003906786,0.0041094823,0.0029629613,0.0024269337],"category_scores_gemma":[0.040750623,0.0007288612,0.0015661811,0.0011375292,0.004497417,0.008150811,0.006121609,0.003992168,0.0009021337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014230051,0.00056570483,0.004624042,0.00033858453,0.00018298255,0.00019152829,0.00076775916,0.20397124,0.015771294,0.60276717,0.006289138,0.16310766],"study_design_scores_gemma":[0.00007800067,0.00018327561,0.00019312567,0.000030301204,0.00003285136,0.00014768564,0.00007340396,0.77514666,0.011353231,0.21116908,0.0015542028,0.000038129005],"about_ca_topic_score_codex":0.00046101862,"about_ca_topic_score_gemma":0.00035404513,"teacher_disagreement_score":0.011098176,"about_ca_system_score_codex":0.0025199554,"about_ca_system_score_gemma":0.0031674707,"threshold_uncertainty_score":0.05869347},"labels":[],"label_agreement":null},{"id":"W1921007510","doi":"10.3233/jcs-2008-16203","title":"Privacy policy enforcement in enterprises with identity management solutions","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Privacy policy; Enforcement; Personally identifiable information; Privacy by Design; Leverage (statistics); Identity management; Information privacy; Privacy software; Computer security; Internet privacy; Business; Identity (music); Law enforcement; Computer science; Business process; Knowledge management; Access control; Work in process; Law; Marketing","score_opus":0.021296075387698538,"score_gpt":0.3022430145189302,"score_spread":0.2809469391312317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921007510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0348967,0.00033668597,0.9428911,0.004244248,0.000080828526,0.0005637758,0.00004987324,0.0022875634,0.014649178],"genre_scores_gemma":[0.3928041,0.00040048847,0.5971167,0.0009867965,0.00008118779,0.00039968285,0.00015149085,0.00021240258,0.007847195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97478116,0.010279106,0.0024411837,0.0029276048,0.007677633,0.0018932474],"domain_scores_gemma":[0.97427386,0.008521017,0.0027924993,0.0109877065,0.0026867306,0.0007382217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023578053,0.0004837891,0.0007730334,0.0010736883,0.003377739,0.009514896,0.0027844447,0.0040842644,0.0023945589],"category_scores_gemma":[0.025931077,0.0010684361,0.0011523772,0.0015809663,0.0048554055,0.013155969,0.006878046,0.005116381,0.0012424464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030675158,0.0007790885,0.008107673,0.00038013238,0.00014724869,0.001055789,0.0068939812,0.021230273,0.0133951325,0.73360026,0.007092066,0.2070116],"study_design_scores_gemma":[0.00025117924,0.00026854625,0.0022036643,0.0005429002,0.00019506975,0.0012540495,0.0029200697,0.30062857,0.046962354,0.49213138,0.15248118,0.00016092518],"about_ca_topic_score_codex":0.0033438795,"about_ca_topic_score_gemma":0.0017298334,"teacher_disagreement_score":0.023578053,"about_ca_system_score_codex":0.002099591,"about_ca_system_score_gemma":0.0066031083,"threshold_uncertainty_score":0.12469411},"labels":[],"label_agreement":null},{"id":"W1921112198","doi":"10.3233/jcs-2012-0454","title":"Behavior-based access control for distributed healthcare systems","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; McMaster University","funders":"","keywords":"Computer science; Access control; Interoperability; Computer security; Role-based access control; Workflow; Database; World Wide Web","score_opus":0.02832447320771687,"score_gpt":0.3376463927683689,"score_spread":0.309321919560652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921112198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04434077,0.00016432023,0.9476322,0.00069321773,0.0000282491,0.000172294,0.00007506316,0.0011337037,0.0057602865],"genre_scores_gemma":[0.9113155,0.00015375754,0.08454826,0.00009286391,0.000027532793,0.00024496805,0.00013588689,0.00007172984,0.0034096115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941095,0.0022101148,0.0005289964,0.0009261157,0.0018397243,0.00038554517],"domain_scores_gemma":[0.994131,0.0025880174,0.0007555923,0.00132145,0.00093272416,0.00027115617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004768327,0.0004815283,0.00053847453,0.0009954575,0.0008682263,0.0035489595,0.0013529905,0.0010533475,0.0016655957],"category_scores_gemma":[0.010260725,0.00038677108,0.0010077553,0.00047542882,0.0028660847,0.0031119967,0.0015471441,0.0011359546,0.0003195574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024865931,0.00027443454,0.0066710724,0.00013605489,0.00013635689,0.00045240935,0.0014712935,0.34114778,0.009037718,0.5873056,0.0015162807,0.05160235],"study_design_scores_gemma":[0.000038078415,0.00006590382,0.0007037478,0.000022025952,0.000032659154,0.0001087831,0.00009579498,0.8874489,0.0023297481,0.10603986,0.0030858642,0.000028648547],"about_ca_topic_score_codex":0.012073635,"about_ca_topic_score_gemma":0.0052257623,"teacher_disagreement_score":0.012073635,"about_ca_system_score_codex":0.0033888717,"about_ca_system_score_gemma":0.0024795767,"threshold_uncertainty_score":0.025217652},"labels":[],"label_agreement":null},{"id":"W1922844761","doi":"10.3233/jcs-140502","title":"Modular protections against non-control data attacks","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Soundness; Memory safety; Separation logic; Compiler; Programming language; Pointer (user interface); Data type; Modular design; Artificial intelligence","score_opus":0.02096124297612106,"score_gpt":0.2637338178031622,"score_spread":0.24277257482704112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922844761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08590085,0.00066852866,0.87358177,0.00055196026,0.00017219115,0.00030024114,0.00016461243,0.031895753,0.006764103],"genre_scores_gemma":[0.7081659,0.00040915716,0.27841583,0.0008230346,0.00017709742,0.0003491704,0.00027729617,0.003681446,0.0077010817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949576,0.0010033326,0.00034156092,0.0010099903,0.0018690446,0.000818427],"domain_scores_gemma":[0.9863355,0.002850173,0.0015187708,0.0074213073,0.0014597576,0.00041444864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00436149,0.001216052,0.0011311775,0.001540721,0.0010306018,0.0019468146,0.003637217,0.001242173,0.003375613],"category_scores_gemma":[0.009071229,0.0011951727,0.0019722034,0.00063390186,0.0033273755,0.003993109,0.004606777,0.0027765315,0.0019520164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034114597,0.0006347281,0.010034829,0.0013404269,0.00036207473,0.0013675744,0.0025839065,0.086211614,0.27824563,0.27489984,0.013414968,0.32749298],"study_design_scores_gemma":[0.0005730309,0.0015551259,0.004914644,0.00039158922,0.00053030543,0.0015520746,0.0002529093,0.43732482,0.34039178,0.12886646,0.08326514,0.00038217058],"about_ca_topic_score_codex":0.0013095626,"about_ca_topic_score_gemma":0.0012047229,"teacher_disagreement_score":0.00436149,"about_ca_system_score_codex":0.0011091385,"about_ca_system_score_gemma":0.0020594266,"threshold_uncertainty_score":0.023066044},"labels":[],"label_agreement":null},{"id":"W2123193503","doi":"10.3233/jcs-2007-15401","title":"Parity-based inference control for multi-dimensional range sum queries","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Science Foundation","keywords":"Inference; Computer science; Range (aeronautics); Parity (physics); Statistical inference; Subtraction; Control (management); Theoretical computer science; Discrete mathematics; Mathematics; Statistics; Artificial intelligence; Arithmetic","score_opus":0.02731855282240219,"score_gpt":0.29240019902335673,"score_spread":0.26508164620095453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123193503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033703256,0.0003693132,0.9600653,0.0006637932,0.000071759234,0.00016964987,0.0002462701,0.002456048,0.0022545832],"genre_scores_gemma":[0.66680956,0.000319718,0.328038,0.0007793042,0.00028748493,0.00036301423,0.000747452,0.0005952173,0.0020601903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9771752,0.0059614684,0.0020282865,0.004266733,0.008728404,0.0018399945],"domain_scores_gemma":[0.90881145,0.06599919,0.0043990687,0.013098495,0.0066715986,0.0010201852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015108389,0.0010219135,0.0019344868,0.002191587,0.0016740065,0.003943206,0.005187104,0.0014077774,0.0033494208],"category_scores_gemma":[0.07667094,0.0010047087,0.0017790918,0.002035116,0.0038095831,0.010464883,0.0057729096,0.0038541004,0.0006644866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027349151,0.00060214975,0.01766119,0.00086935936,0.00042663154,0.0008448465,0.0016543453,0.16083074,0.029725788,0.29535744,0.008841534,0.48045105],"study_design_scores_gemma":[0.00017630096,0.00015400842,0.0008750737,0.000040885374,0.00014289531,0.0002999917,0.00013413114,0.78682554,0.02490075,0.18352771,0.0028390877,0.00008367712],"about_ca_topic_score_codex":0.0049889497,"about_ca_topic_score_gemma":0.0033878784,"teacher_disagreement_score":0.015108389,"about_ca_system_score_codex":0.0026706336,"about_ca_system_score_gemma":0.0037255774,"threshold_uncertainty_score":0.079901755},"labels":[],"label_agreement":null},{"id":"W2124689666","doi":"10.3233/jcs-2010-0412","title":"Leveraging personal devices for stronger password authentication from untrusted computers","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Password; Computer science; Computer security; Authentication (law); Email authentication; One-time password; Phishing; Usability; Chip Authentication Program; Database transaction; Personally identifiable information; Mobile device; Multi-factor authentication; The Internet; Internet privacy; World Wide Web; Authentication protocol; Database; Human–computer interaction","score_opus":0.040194010136475486,"score_gpt":0.2474682426283154,"score_spread":0.2072742324918399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124689666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17485659,0.008022761,0.74123096,0.0029398475,0.0012156173,0.0007185218,0.0002255274,0.0059723556,0.06481787],"genre_scores_gemma":[0.84970343,0.0029598558,0.12738392,0.000989436,0.00066894275,0.00021820448,0.00024263018,0.00017004058,0.017663527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99673414,0.0009689714,0.00036252008,0.0004335995,0.0011942338,0.00030656447],"domain_scores_gemma":[0.9900102,0.0018745648,0.00096317986,0.0057081487,0.0011280383,0.00031589388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015780703,0.0008590787,0.00067570346,0.0011037352,0.00091157306,0.0023706825,0.0018046898,0.0016521243,0.0075640716],"category_scores_gemma":[0.006740592,0.0006453715,0.00080532546,0.0009936269,0.001152335,0.007782565,0.0049141115,0.0020251665,0.0063726366],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015868909,0.0005846796,0.012986572,0.0020636609,0.0003019502,0.0027926855,0.0018393015,0.0048528397,0.18550827,0.12205145,0.018941488,0.6464903],"study_design_scores_gemma":[0.00048096676,0.0043439525,0.020131318,0.0015293293,0.0008257106,0.01974375,0.001027637,0.14882146,0.32620427,0.0810565,0.3952552,0.00057994644],"about_ca_topic_score_codex":0.00017928028,"about_ca_topic_score_gemma":0.0003325935,"teacher_disagreement_score":0.0075640716,"about_ca_system_score_codex":0.0002864059,"about_ca_system_score_gemma":0.00037989483,"threshold_uncertainty_score":0.025304317},"labels":[],"label_agreement":null},{"id":"W2605875060","doi":"10.3233/jcs-16857","title":"Diet-ESP: IP layer security for IoT","year":2017,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Computer science; Byte; Overhead (engineering); Computer network; Network packet; Payload (computing); Header; Internet of Things; Embedded system; Computer hardware; Operating system","score_opus":0.030621225521485964,"score_gpt":0.2975834882665042,"score_spread":0.2669622627450183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605875060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044337697,0.00519698,0.85438895,0.0013211444,0.00095810095,0.00092196144,0.0010114773,0.021693854,0.07016989],"genre_scores_gemma":[0.68430364,0.0055653704,0.2620337,0.0021560101,0.0006008376,0.0010814891,0.0048072897,0.0015169468,0.03793473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.00012763504,0.000107210246,0.000093800365,0.00047778728,0.00015073789],"domain_scores_gemma":[0.99931335,0.00013036186,0.000077292774,0.00023973967,0.00019212968,0.0000471299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011391942,0.0008923805,0.00033997642,0.0008710897,0.0004459692,0.0014900047,0.0010534804,0.001173763,0.004421045],"category_scores_gemma":[0.0020253188,0.00029639393,0.0005238416,0.00042821682,0.0006855946,0.00259889,0.0020673433,0.0018998927,0.0023535173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010964432,0.00039774727,0.0025258304,0.0012900145,0.00014154322,0.0009285788,0.00037732048,0.016584434,0.14618103,0.15116973,0.05137536,0.6279321],"study_design_scores_gemma":[0.00022937235,0.0013424121,0.0043409863,0.00075416587,0.00020488948,0.0034831774,0.00023521147,0.19639237,0.24603884,0.07949379,0.4672884,0.00019637012],"about_ca_topic_score_codex":0.00033321875,"about_ca_topic_score_gemma":0.00021444728,"teacher_disagreement_score":0.004421045,"about_ca_system_score_codex":0.00046827854,"about_ca_system_score_gemma":0.0007182012,"threshold_uncertainty_score":0.014789879},"labels":[],"label_agreement":null},{"id":"W2608745566","doi":"10.3233/jcs-16847","title":"On the security and usability of dynamic cognitive game CAPTCHAs","year":2017,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Usability; Computer science; CAPTCHA; Human–computer interaction; Computer security","score_opus":0.016622711525566058,"score_gpt":0.2756021559657522,"score_spread":0.25897944444018617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608745566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.907131,0.00085865724,0.06182031,0.00063700724,0.00008356801,0.0005944252,0.00006648113,0.0005111497,0.028297292],"genre_scores_gemma":[0.9911635,0.00016483184,0.007492889,0.00008049782,0.000011845752,0.00006985326,0.000036557773,0.000048286278,0.000931754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99184716,0.004257265,0.00040301954,0.00049095234,0.0024700307,0.0005315806],"domain_scores_gemma":[0.9339221,0.049285036,0.0035050374,0.003951948,0.008430011,0.00090582116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00512823,0.0012919214,0.00047126558,0.0013676703,0.0009260014,0.0035236413,0.0010233109,0.0010127062,0.0026433393],"category_scores_gemma":[0.053323574,0.0004556285,0.0004807172,0.00043832965,0.0024975997,0.003463873,0.0012083558,0.0012902853,0.0004223458],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062600262,0.002823736,0.10119443,0.00389875,0.00068556576,0.002587872,0.033599377,0.04363031,0.12099322,0.064687535,0.008696881,0.61094236],"study_design_scores_gemma":[0.00048704096,0.019777384,0.18028383,0.0024976875,0.0011200537,0.008352166,0.024022466,0.5621288,0.122358054,0.04232877,0.03556163,0.0010820954],"about_ca_topic_score_codex":0.0032650337,"about_ca_topic_score_gemma":0.0019880447,"teacher_disagreement_score":0.00512823,"about_ca_system_score_codex":0.0011203346,"about_ca_system_score_gemma":0.0006549478,"threshold_uncertainty_score":0.027121007},"labels":[],"label_agreement":null},{"id":"W2789589593","doi":"10.3233/jcs-171106","title":"Surviving unpatchable vulnerabilities through heterogeneous network hardening options","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Information and Cyber Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Army Research Office; Office of Naval Research; Concordia University","keywords":"Computer science; Hardening (computing); Computer security; Materials science; Composite material","score_opus":0.015468499814574104,"score_gpt":0.2501281810025684,"score_spread":0.2346596811879943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789589593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893047,0.0006161342,0.50041586,0.0004809302,0.000052790412,0.00023847651,0.00006601476,0.00062116166,0.008203902],"genre_scores_gemma":[0.9693382,0.00014141563,0.029332155,0.00006310664,0.00001015028,0.000050888462,0.000021595546,0.000036588273,0.001005894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990351,0.00026056374,0.00004386045,0.00016971563,0.00018936921,0.0003014903],"domain_scores_gemma":[0.9982496,0.0007558227,0.00032783256,0.00032735677,0.00013150505,0.00020783608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484605,0.0014701785,0.00076111004,0.00095492136,0.0006011635,0.0013898006,0.0015651428,0.0010569053,0.0018737662],"category_scores_gemma":[0.0033319595,0.00038709716,0.0007209538,0.00047586494,0.0011102003,0.0029639418,0.0028166843,0.0013281369,0.00015330489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012858729,0.00012482532,0.0011371324,0.00005719041,0.00005261879,0.00017399467,0.0000859826,0.95172995,0.010260568,0.008735813,0.00030693103,0.027206358],"study_design_scores_gemma":[0.00002461865,0.00014545638,0.00036942225,0.000014729025,0.000046275847,0.00006873776,0.00008953943,0.98595375,0.0038540948,0.008886858,0.0005304055,0.000016106229],"about_ca_topic_score_codex":0.0013822305,"about_ca_topic_score_gemma":0.0013600438,"teacher_disagreement_score":0.0018737662,"about_ca_system_score_codex":0.0008327414,"about_ca_system_score_gemma":0.00079870335,"threshold_uncertainty_score":0.007851422},"labels":[],"label_agreement":null},{"id":"W2789789243","doi":"10.3233/jcs-171103","title":"HardIDX: Practical and secure index with SGX in a malicious environment","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Memory footprint; Software; Code (set theory); Index (typography); Information leakage; Computer security; Operating system; Embedded system; World Wide Web; Set (abstract data type)","score_opus":0.007252090349492954,"score_gpt":0.2338831207959884,"score_spread":0.22663103044649544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789789243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20615278,0.0022972324,0.72797716,0.0010586465,0.00031573666,0.000685379,0.0006950908,0.031993553,0.028824436],"genre_scores_gemma":[0.8277217,0.00044071785,0.15786994,0.00026262124,0.00005757459,0.00019008959,0.0006715324,0.00083857897,0.01194734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998104,0.00019832313,0.00019849077,0.00020895839,0.0010113914,0.0002788431],"domain_scores_gemma":[0.9975084,0.0004570662,0.00022075944,0.0014101473,0.0002695842,0.00013409607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243445,0.0005688786,0.00062351994,0.0006805112,0.0008366952,0.002216707,0.0017755885,0.00088494224,0.004203958],"category_scores_gemma":[0.0037566165,0.00045372688,0.00049901917,0.00057350483,0.0015559478,0.005088356,0.0041517997,0.0012737504,0.0019497966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039048772,0.0006587646,0.01208094,0.0013000868,0.00023297752,0.0021887566,0.0019726944,0.038995463,0.17534544,0.32918385,0.0459175,0.3882187],"study_design_scores_gemma":[0.0004499816,0.0011643919,0.00274225,0.00019905544,0.00011963007,0.0030260955,0.0004143069,0.566916,0.24864139,0.08689693,0.0892667,0.00016331124],"about_ca_topic_score_codex":0.0010107562,"about_ca_topic_score_gemma":0.000876372,"teacher_disagreement_score":0.004203958,"about_ca_system_score_codex":0.001099307,"about_ca_system_score_gemma":0.0014829132,"threshold_uncertainty_score":0.014063597},"labels":[],"label_agreement":null},{"id":"W2903853604","doi":"10.3233/jcs-181137","title":"Learning probabilistic dependencies among events for proactive security auditing in clouds","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Audit; Computer science; Probabilistic logic; Computer security; Artificial intelligence; Business; Accounting","score_opus":0.012271776939325432,"score_gpt":0.24709455094213426,"score_spread":0.23482277400280882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903853604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07064054,0.00020664261,0.92153776,0.00076046365,0.00003433225,0.00013367677,0.0004111872,0.005260986,0.0010144679],"genre_scores_gemma":[0.78783965,0.00030618347,0.20852053,0.00023610076,0.00006222868,0.00015994157,0.0009869594,0.0002427897,0.0016455548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993156,0.00014583113,0.000053049505,0.00019004864,0.00019971532,0.00009588132],"domain_scores_gemma":[0.99632746,0.0023767713,0.0005129433,0.00031853718,0.00031847856,0.00014581972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011767262,0.0008867321,0.00054336886,0.0009053124,0.0006009716,0.0010627309,0.0010128142,0.0004993865,0.0016136871],"category_scores_gemma":[0.0074430513,0.0005650936,0.0007504016,0.0006997775,0.0006566991,0.0024133308,0.0013104634,0.0019377548,0.0006058095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004712633,0.00035187398,0.019582955,0.00018353591,0.000058782123,0.0004294598,0.00027990746,0.67512155,0.008922692,0.008618193,0.0050880956,0.28089175],"study_design_scores_gemma":[0.0000043214563,0.000014050262,0.0007076571,0.0000063982084,0.0000054941966,0.000022100663,0.000023416398,0.9916477,0.001924117,0.005291713,0.0003459835,0.0000069261796],"about_ca_topic_score_codex":0.009881451,"about_ca_topic_score_gemma":0.0144477375,"teacher_disagreement_score":0.009881451,"about_ca_system_score_codex":0.001199023,"about_ca_system_score_gemma":0.003107407,"threshold_uncertainty_score":0.019647837},"labels":[],"label_agreement":null},{"id":"W2952391640","doi":"10.3233/jcs-191306","title":"Mitigating the insider threat of remote administrators in clouds through maintenance task assignments","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer security; Cloud computing; Credential; Insider; Task (project management); Computer science; Downtime; Privilege (computing); Insider threat; Internet privacy; Engineering","score_opus":0.0168734904852838,"score_gpt":0.26860243249639526,"score_spread":0.25172894201111146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952391640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4318537,0.00084755436,0.5565721,0.0008808558,0.00010622326,0.00029166898,0.000105674924,0.0006582727,0.008683924],"genre_scores_gemma":[0.9731204,0.00013098848,0.025703467,0.000044177108,0.000018002029,0.00003830513,0.000025856332,0.00003812582,0.000880658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998541,0.0005084718,0.000049806695,0.00018161113,0.00026312663,0.0004560538],"domain_scores_gemma":[0.9976285,0.00083197124,0.000589488,0.0002937264,0.00027304675,0.0003832029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00172786,0.0011175015,0.0006724973,0.0004519579,0.00096367684,0.0016149806,0.0014196456,0.0009009475,0.0017105124],"category_scores_gemma":[0.004510683,0.00042660988,0.00038483282,0.0004773044,0.0007425468,0.0020182503,0.001652038,0.0012009335,0.00023605142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019894671,0.00015095556,0.0027562492,0.00009306738,0.000022288932,0.00019960121,0.00015968949,0.9559717,0.004829739,0.006476251,0.0010670406,0.028074339],"study_design_scores_gemma":[0.00001524952,0.00010783392,0.00089312845,0.000015792535,0.000023618606,0.00010839989,0.0001410484,0.99210536,0.0016293536,0.0040789717,0.00086916337,0.000012016975],"about_ca_topic_score_codex":0.0055197547,"about_ca_topic_score_gemma":0.0069058947,"teacher_disagreement_score":0.0055197547,"about_ca_system_score_codex":0.001099926,"about_ca_system_score_gemma":0.0022439437,"threshold_uncertainty_score":0.010975242},"labels":[],"label_agreement":null},{"id":"W2975826887","doi":"10.3233/jcs-191292","title":"Decoupling coding habits from functionality for effective binary authorship attribution","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Binary number; Code refactoring; Source code; Coding (social sciences); Binary code; Compiler; Reverse engineering; Programming language; Software","score_opus":0.01485298257875823,"score_gpt":0.2771072211113607,"score_spread":0.2622542385326025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975826887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2058464,0.0010701391,0.66277677,0.0011538385,0.0005790466,0.0006036311,0.0052473117,0.11333102,0.009391808],"genre_scores_gemma":[0.6540418,0.00043395278,0.32017156,0.00050053134,0.00021410787,0.00043070014,0.010902754,0.0056993896,0.0076051666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99354386,0.0010033076,0.00097154005,0.0019027998,0.0022155598,0.00036294415],"domain_scores_gemma":[0.9686941,0.0092270225,0.0060169664,0.010588472,0.0047459216,0.0007276302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040532253,0.0010047547,0.0011166311,0.0047709206,0.0010252201,0.0033504728,0.0012850116,0.0012046575,0.0029442317],"category_scores_gemma":[0.04175685,0.00067217316,0.00065973436,0.0030950045,0.0011103553,0.0070304526,0.004259519,0.0015797926,0.0044239885],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006529423,0.000360513,0.09225866,0.0009225797,0.0001123572,0.00045910664,0.0023912103,0.005956659,0.027427765,0.009376639,0.03648286,0.8235987],"study_design_scores_gemma":[0.00012858715,0.0003306578,0.06946644,0.0005354126,0.00018149197,0.002360484,0.0017132418,0.5456227,0.17577809,0.08385024,0.119516194,0.0005163701],"about_ca_topic_score_codex":0.0011540629,"about_ca_topic_score_gemma":0.0024103848,"teacher_disagreement_score":0.0047709206,"about_ca_system_score_codex":0.00083942397,"about_ca_system_score_gemma":0.001959535,"threshold_uncertainty_score":0.021435738},"labels":[],"label_agreement":null},{"id":"W2989588798","doi":"10.3233/jcs-191346","title":"Multilayer ransomware detection using grouped registry key operations, file entropy and file signature monitoring","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Victoria","funders":"","keywords":"Ransomware; Computer science; Encryption; Signature (topology); Data mining; Entropy (arrow of time); Key (lock); Computer security; Malware; Mathematics","score_opus":0.007981079758762184,"score_gpt":0.2453106957023075,"score_spread":0.23732961594354532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989588798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900947,0.00065374724,0.40036863,0.0002493986,0.00009150622,0.00019083724,0.001131553,0.0044774534,0.0027421643],"genre_scores_gemma":[0.9481311,0.00022135163,0.04913412,0.000041506184,0.00003763981,0.000059491496,0.0010363873,0.000048677204,0.0012896406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895966,0.00011370741,0.00008563103,0.00024462826,0.00043316785,0.00016327803],"domain_scores_gemma":[0.9983719,0.00026842853,0.000590796,0.00030853474,0.0003730392,0.00008743119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151171,0.0010651164,0.0008978068,0.0027541863,0.00027832907,0.0008644167,0.0007163826,0.00054541434,0.0007795101],"category_scores_gemma":[0.0030682466,0.00021114199,0.000673895,0.001332845,0.00041317096,0.0018589966,0.0008462314,0.00053803995,0.0007525707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011035146,0.0005622921,0.1381564,0.00019644115,0.00022854735,0.0011153417,0.00032959692,0.11449461,0.053970702,0.0029885834,0.004710278,0.68214375],"study_design_scores_gemma":[0.000008301985,0.00024145158,0.047066312,0.000024323523,0.000050311002,0.00089131924,0.00013930263,0.92201906,0.026433902,0.0013487319,0.0017248109,0.000052134576],"about_ca_topic_score_codex":0.0026174618,"about_ca_topic_score_gemma":0.003249463,"teacher_disagreement_score":0.0027541863,"about_ca_system_score_codex":0.00046831623,"about_ca_system_score_gemma":0.00042957318,"threshold_uncertainty_score":0.005204499},"labels":[],"label_agreement":null},{"id":"W3089926615","doi":"10.3233/jcs-191416","title":"EQRC: A secure QR code-based E-coupon framework supporting online and offline transactions","year":2020,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"QR Code Applications and Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Coupon; Computer security; Information leakage; Code (set theory); Cryptography; Security analysis; Computer engineering","score_opus":0.01849363933795797,"score_gpt":0.26847070344670115,"score_spread":0.24997706410874318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089926615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041543,0.0004749076,0.97703654,0.00021167296,0.00010216019,0.000535995,0.00015716958,0.0057791485,0.0056609684],"genre_scores_gemma":[0.42820272,0.0006938507,0.5479667,0.00036600485,0.0001250015,0.0006282465,0.00071445794,0.00037505443,0.020927941],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997647,0.000569602,0.00016736209,0.00031006636,0.0010102452,0.00029567277],"domain_scores_gemma":[0.9982327,0.00028684805,0.00020662369,0.0006277392,0.00047923386,0.00016688672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014689722,0.0007206426,0.0009478566,0.0009248772,0.00082854397,0.0015246172,0.0024235512,0.0016292359,0.0077663283],"category_scores_gemma":[0.0031851728,0.00040004455,0.0007181362,0.00070382486,0.0011611024,0.0022910447,0.002613284,0.0014181377,0.0031399555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030688974,0.000491184,0.0022708282,0.00091648404,0.00014022004,0.0027881605,0.0010401638,0.06258178,0.09415861,0.31675902,0.024913233,0.4908715],"study_design_scores_gemma":[0.00035138315,0.001051751,0.0011263107,0.00018151349,0.000098971235,0.0032615128,0.00022442777,0.7597543,0.068696305,0.04525511,0.11967636,0.00032213534],"about_ca_topic_score_codex":0.0025059127,"about_ca_topic_score_gemma":0.0014212696,"teacher_disagreement_score":0.0077663283,"about_ca_system_score_codex":0.0006221309,"about_ca_system_score_gemma":0.0015648089,"threshold_uncertainty_score":0.025981009},"labels":[],"label_agreement":null},{"id":"W4210598630","doi":"10.3233/jcs-210094","title":"Adversarial examples for network intrusion detection systems","year":2022,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Adversarial system; Exploit; Adversary; Intrusion detection system; Artificial intelligence; Robustness (evolution); Machine learning; Pattern recognition (psychology); Computer security","score_opus":0.01233739287635993,"score_gpt":0.2411539419570545,"score_spread":0.22881654908069457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210598630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036289096,0.0006195264,0.95674217,0.00055027514,0.00008913819,0.00014907181,0.00009886422,0.0012106047,0.004251325],"genre_scores_gemma":[0.838695,0.00038267463,0.15683998,0.00022440935,0.000072105286,0.00018595532,0.00016928744,0.000109071625,0.0033215801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981975,0.0007077851,0.00008674292,0.00027924663,0.00061673374,0.000111971414],"domain_scores_gemma":[0.9933785,0.004685306,0.00046439195,0.00090781046,0.00042264402,0.00014130687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020074875,0.00068836886,0.0006890601,0.00061891275,0.00040852925,0.001062932,0.0011531617,0.001130324,0.0032018805],"category_scores_gemma":[0.01163483,0.00038198553,0.00055853266,0.00031026482,0.0015441763,0.0019504683,0.0024737264,0.002144002,0.0005260146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017911142,0.000050826067,0.0007777115,0.000104922285,0.000034520366,0.000077484976,0.00007657889,0.8937285,0.0044845613,0.034170166,0.0015861873,0.064729504],"study_design_scores_gemma":[0.0000073800575,0.00004073368,0.00010569584,0.000010087891,0.0000041983785,0.00004011666,0.000009802784,0.9849289,0.0019589504,0.011761474,0.0011253217,0.0000072400276],"about_ca_topic_score_codex":0.00086864,"about_ca_topic_score_gemma":0.00075647427,"teacher_disagreement_score":0.0032018805,"about_ca_system_score_codex":0.0008889299,"about_ca_system_score_gemma":0.00046950116,"threshold_uncertainty_score":0.010711312},"labels":[],"label_agreement":null}]}