{"meta":{"query_hash":"329205527624","filters":{"venue":"IEEE Transactions on Dependable and Secure Computing"},"cohort_total":117,"direct_labels_cover":0,"predictions_cover":117,"exported":117,"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/329205527624","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Dependable+and+Secure+Computing"},"results":[{"id":"W1990935444","doi":"10.1109/tdsc.2011.55","title":"Persuasive Cued Click-Points: Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Password; Usability; Persuasion; Human–computer interaction; Authentication (law); Human-computer interaction in information security; Password policy; Computer security; Cognitive password; Cued speech; Message authentication code; Persuasive technology; World Wide Web; Information security; One-time password; Cryptography; Security service; Software security assurance","score_opus":0.0735171356676938,"score_gpt":0.31125583532713097,"score_spread":0.23773869965943717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990935444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17611398,0.000099756624,0.82279813,0.00008993643,0.00023394071,0.0005194037,0.0000048311804,0.000071591196,0.00006841579],"genre_scores_gemma":[0.9863153,0.000011451624,0.0135474475,0.000055930286,0.000012811064,0.000031820247,0.0000029122004,0.000011806974,0.0000105215095],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820656,0.00041298184,0.00041929958,0.0004145141,0.00034492504,0.00020171337],"domain_scores_gemma":[0.9987796,0.00015994794,0.00020311339,0.00031162726,0.00044539024,0.000100331265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917206,0.00016656675,0.00020006744,0.0002667856,0.00030398983,0.0000763561,0.00022596601,0.00007982394,0.000051215473],"category_scores_gemma":[0.000008486737,0.00016734516,0.000056497167,0.00031875682,0.000046355715,0.0002972227,0.000006494876,0.00012322274,0.000009526185],"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.00016014303,0.0019317517,0.0004039524,0.00056465715,0.00051285315,0.0000064233723,0.6063511,0.0011757099,0.015180152,0.06795909,0.00012274426,0.3056315],"study_design_scores_gemma":[0.0012996078,0.00020330609,0.00043821204,0.00007132413,0.00011345079,0.0000126689965,0.0019013346,0.9207261,0.07092507,0.0040996224,0.000016778833,0.00019248217],"about_ca_topic_score_codex":0.0000822418,"about_ca_topic_score_gemma":0.00005136496,"teacher_disagreement_score":0.9195504,"about_ca_system_score_codex":0.000048310267,"about_ca_system_score_gemma":0.00015068684,"threshold_uncertainty_score":0.68241376},"labels":[],"label_agreement":null},{"id":"W2022774249","doi":"10.1109/tdsc.2013.22","title":"Secure Two-Party Differentially Private Data Release for Vertically Partitioned Data","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":68,"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; McGill University","funders":"Skaggs School of Pharmacy and Pharmaceutical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Differential privacy; Data publishing; Adversary; Protocol (science); Private information retrieval; Secure multi-party computation; Set (abstract data type); Information privacy; Task (project management); Information sensitivity; Computation; Computer security; Data mining; Publishing; Algorithm","score_opus":0.05355360499792926,"score_gpt":0.291247632256955,"score_spread":0.23769402725902572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022774249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027740294,0.00010471986,0.9622771,0.0071593504,0.0006599114,0.0006971583,0.00050458894,0.00081072666,0.000046136236],"genre_scores_gemma":[0.7395296,0.000055740766,0.25976193,0.00028485875,0.00006917424,0.000027911714,0.00022490053,0.000026821479,0.000019094417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685556,0.00010848424,0.00051181094,0.0014692589,0.0003727827,0.000682124],"domain_scores_gemma":[0.9873921,0.0005496355,0.00014612624,0.011577231,0.00013046009,0.00020439846],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00051612646,0.0003325431,0.00034855542,0.00015228984,0.0007228518,0.00067420246,0.01909193,0.00017915388,0.000052171235],"category_scores_gemma":[0.000815738,0.00030979933,0.00005630584,0.00038028375,0.00011586851,0.002240038,0.004394654,0.0005527716,0.00005357774],"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.00018823806,0.0015768075,0.0001901674,0.0006042072,0.0007761351,0.00009161478,0.00048618662,0.005810523,0.010053788,0.0077529545,0.20088382,0.7715855],"study_design_scores_gemma":[0.0009694338,0.00011036073,0.000079462385,0.00009802631,0.000055224355,0.000035769706,0.000021040907,0.9686378,0.004536592,0.022663008,0.0024133786,0.00037985452],"about_ca_topic_score_codex":0.00011078688,"about_ca_topic_score_gemma":0.00013779428,"teacher_disagreement_score":0.9628273,"about_ca_system_score_codex":0.00003855867,"about_ca_system_score_gemma":0.00009336457,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W2093197020","doi":"10.1109/tdsc.2007.70207","title":"A New Biometric Technology Based on Mouse Dynamics","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":366,"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":"Biometrics; Computer science; Artifact (error); Confusion matrix; Word error rate; Data mining; Process (computing); Receiver operating characteristic; Set (abstract data type); False positive rate; Artificial intelligence; Crossover; Detector; Pattern recognition (psychology); Machine learning","score_opus":0.010291304235440307,"score_gpt":0.24082904852713116,"score_spread":0.23053774429169085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093197020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047038957,0.000053537125,0.9506724,0.0007605564,0.00052852253,0.00018926823,0.000004900819,0.00042387436,0.00032802203],"genre_scores_gemma":[0.9821737,0.0000054596,0.017127428,0.00031491244,0.00003317699,0.0000019657055,0.0000017785308,0.000015991362,0.00032563598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844205,0.000037380636,0.00033178247,0.0004865861,0.0003067442,0.00039542335],"domain_scores_gemma":[0.99891734,0.00021681299,0.000097201526,0.00050326594,0.00007378298,0.00019159068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044172764,0.0001992236,0.00021152628,0.0015744102,0.00035115183,0.00017144401,0.00048459406,0.0001792239,0.000012933018],"category_scores_gemma":[0.000009667102,0.00019566447,0.00007878832,0.0022561846,0.000030658986,0.00014950811,0.0000061796545,0.00036077818,0.0000473855],"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.0000669747,0.0007070497,0.00029343908,0.00010236348,0.0000942491,0.00008909676,0.0053050974,0.0078768525,0.0015370203,0.019228455,0.00028513547,0.96441424],"study_design_scores_gemma":[0.00062803377,0.00020341702,0.000043727854,0.00004597576,0.000010228777,0.00004116566,0.000108704706,0.98567915,0.011644999,0.00033194706,0.001023347,0.00023927512],"about_ca_topic_score_codex":0.0000641566,"about_ca_topic_score_gemma":0.000121465644,"teacher_disagreement_score":0.97780234,"about_ca_system_score_codex":0.00009369788,"about_ca_system_score_gemma":0.00007274105,"threshold_uncertainty_score":0.79789656},"labels":[],"label_agreement":null},{"id":"W2106916437","doi":"10.1109/tdsc.2008.21","title":"Error Detection and Fault Tolerance in ECSM Using Input Randomization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Elliptic curve cryptography; Cryptosystem; Fault tolerance; Scalar multiplication; Fault detection and isolation; Error detection and correction; Cryptography; Algorithm; Elliptic curve; Parallel computing; Computer engineering; Public-key cryptography; Mathematics; Distributed computing; Encryption; Artificial intelligence","score_opus":0.017692184813403455,"score_gpt":0.2371697182894762,"score_spread":0.21947753347607274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106916437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47466213,0.00016646615,0.5247909,0.000026720341,0.00017886401,0.00010461739,7.088905e-7,0.00004746625,0.00002212654],"genre_scores_gemma":[0.98834765,0.00014296119,0.0113871405,0.00007212513,0.000028647257,0.0000035875996,3.1773098e-7,0.000009084978,0.000008489201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989008,0.000095460695,0.000247168,0.00037260933,0.00014974778,0.00023424833],"domain_scores_gemma":[0.99953705,0.00013219002,0.00006560002,0.00015653443,0.000038014747,0.000070591756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019974567,0.00015155366,0.0002053099,0.00030290603,0.00058125635,0.00007842324,0.00011697155,0.000105055755,0.0000022221607],"category_scores_gemma":[0.000004393981,0.00014740416,0.000046459052,0.0005621743,0.000059108457,0.00036758548,0.000005033308,0.00029085157,0.0000011849138],"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.00017809679,0.00021315344,0.00060017256,0.000085929794,0.00004434543,0.00011310707,0.006985112,0.8558602,0.009515805,0.000223517,0.000003932727,0.12617667],"study_design_scores_gemma":[0.0020541355,0.000062992774,0.00084133947,0.000070345464,0.000010361455,0.0003708651,0.000070727074,0.9854959,0.010638194,0.00015412788,0.000038060214,0.00019289939],"about_ca_topic_score_codex":0.00015659958,"about_ca_topic_score_gemma":0.00017589993,"teacher_disagreement_score":0.5136855,"about_ca_system_score_codex":0.000022609953,"about_ca_system_score_gemma":0.00002710779,"threshold_uncertainty_score":0.60109675},"labels":[],"label_agreement":null},{"id":"W2147096042","doi":"10.1109/tdsc.2015.2406704","title":"Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":275,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Upload; Encryption; Server; Relevance (law); Information retrieval; Usability; Database; Data mining; Computer security; World Wide Web","score_opus":0.08650531738753572,"score_gpt":0.3112842504318411,"score_spread":0.22477893304430538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147096042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11894594,0.00025246397,0.87850255,0.00030197017,0.0010986357,0.000252837,0.0001314318,0.00041496317,0.00009920449],"genre_scores_gemma":[0.95002615,0.00004807885,0.049402148,0.00018780946,0.00019242882,0.000005285799,0.00009347741,0.000025301966,0.000019294639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967932,0.00021372607,0.00058293215,0.001089491,0.0005981389,0.00072247867],"domain_scores_gemma":[0.99760437,0.00042650758,0.0001668404,0.0011915194,0.00021555083,0.0003952048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014248735,0.000348983,0.00036693027,0.00038027353,0.0009712466,0.0006049813,0.0011672304,0.00018886435,0.000021215901],"category_scores_gemma":[0.000058233178,0.0003458743,0.00010614651,0.0010539006,0.00012683189,0.0013701314,0.000100567355,0.00079623447,0.000017308923],"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.0012682918,0.004674946,0.0056606196,0.0008931948,0.0016253575,0.0011409724,0.049274895,0.11504801,0.016348952,0.07485058,0.012205763,0.7170084],"study_design_scores_gemma":[0.001969133,0.00016474882,0.00024604093,0.000094036775,0.00004572557,0.00011845739,0.0007746449,0.98541796,0.00615452,0.0008123752,0.0036482161,0.00055416196],"about_ca_topic_score_codex":0.00032533339,"about_ca_topic_score_gemma":0.00044829302,"teacher_disagreement_score":0.8703699,"about_ca_system_score_codex":0.000052676805,"about_ca_system_score_gemma":0.00025137904,"threshold_uncertainty_score":0.9998993},"labels":[],"label_agreement":null},{"id":"W2157001542","doi":"10.1109/tdsc.2011.16","title":"Efficient Fault Detection and Diagnosis in Complex Software Systems with Information-Theoretic Monitoring","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Jaccard index; Data mining; Mutual information; Pairwise comparison; Entropy (arrow of time); Component (thermodynamics); Metric (unit); Wilcoxon signed-rank test; Context (archaeology); Inference; Artificial intelligence; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.016077978260016217,"score_gpt":0.21359344813163914,"score_spread":0.1975154698716229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157001542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45125625,0.00006506122,0.54804415,0.000007561582,0.00027698677,0.00020145139,0.000001914122,0.00011497964,0.000031675627],"genre_scores_gemma":[0.99312687,0.000034469478,0.0067506586,0.000015755297,0.00002099879,0.000040109517,4.607047e-7,0.0000082688175,0.0000023865168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879384,0.00007133851,0.00033710914,0.00030041352,0.0002200104,0.0002772598],"domain_scores_gemma":[0.9993002,0.00016019461,0.00010314291,0.0002491671,0.00009368763,0.00009361365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033390432,0.00018489572,0.00021740072,0.00023265243,0.00039154422,0.00016076231,0.0001712254,0.0000951747,0.0000029746582],"category_scores_gemma":[0.000006835315,0.00014984015,0.000029978879,0.00039105339,0.00005918708,0.00040120445,0.000008202574,0.00025304992,0.000006736843],"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.00015975322,0.00039519707,0.054229245,0.0012561795,0.000100854275,0.000039743463,0.031005286,0.57479215,0.000080183236,0.00040765645,0.0000067080796,0.33752704],"study_design_scores_gemma":[0.0010386484,0.00038249456,0.016682252,0.0004896873,0.000023548584,0.00020427827,0.0011073987,0.97558093,0.0039492166,0.0000656139,0.00005753316,0.00041838162],"about_ca_topic_score_codex":0.0003648062,"about_ca_topic_score_gemma":0.000035736644,"teacher_disagreement_score":0.54187065,"about_ca_system_score_codex":0.00006050409,"about_ca_system_score_gemma":0.000026859767,"threshold_uncertainty_score":0.6110304},"labels":[],"label_agreement":null},{"id":"W2158462873","doi":"10.1109/tdsc.2007.1004","title":"A Survey and Analysis of the P3P Protocol's Agents, Adoption, Maintenance, and Future","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scope (computer science); Protocol (science); The Internet; World Wide Web; Computer science; Web survey; Survey data collection; Survey research; Internet privacy; Business; Medicine; Statistics","score_opus":0.02550869483214166,"score_gpt":0.3035000606436103,"score_spread":0.27799136581146866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158462873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526383,0.00021471689,0.43309665,0.000803094,0.00065904355,0.011195698,0.00016447654,0.00010025381,0.0011277582],"genre_scores_gemma":[0.9991969,0.00012963895,0.00033872735,0.00007758179,0.000088508124,0.00010328178,0.00000362004,0.0000065812505,0.000055149856],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987786,0.0002308847,0.00024184382,0.00026985514,0.00023674218,0.0002420634],"domain_scores_gemma":[0.9993039,0.00016819687,0.00012787576,0.00018959447,0.00011471263,0.00009576481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016811732,0.00011498756,0.00019923055,0.00018017234,0.0010438091,0.000084085295,0.00015103225,0.00012488956,0.000025042096],"category_scores_gemma":[0.000033096814,0.00008988258,0.00006170939,0.00094891025,0.00018584887,0.00017396614,0.000011174505,0.00024292065,3.7705894e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010335738,0.0009992375,0.14430413,0.0005989263,0.0020006518,0.000022733157,0.056478582,0.0022304482,0.0005220943,0.0066672815,0.0015282037,0.78361416],"study_design_scores_gemma":[0.002947702,0.0003329426,0.8669171,0.00022155984,0.00092588144,0.000028188975,0.013488065,0.035211127,0.0013895463,0.001361738,0.07623453,0.0009416709],"about_ca_topic_score_codex":0.002439663,"about_ca_topic_score_gemma":0.01794987,"teacher_disagreement_score":0.78267246,"about_ca_system_score_codex":0.000030653526,"about_ca_system_score_gemma":0.00004532202,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W2159205978","doi":"10.1109/tdsc.2014.2302298","title":"SIP Flooding Attack Detection with a Multi-Dimensional Sketch Design","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Denial-of-service attack; Session Initiation Protocol; Flooding (psychology); Computer network; Sketch; Internet traffic; The Internet; Server; Computer security","score_opus":0.024184294823939648,"score_gpt":0.23430183710077823,"score_spread":0.2101175422768386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159205978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14526786,0.000045681154,0.853447,0.000078264675,0.0006009642,0.00020526658,8.485397e-7,0.00029420838,0.000059863924],"genre_scores_gemma":[0.93068147,0.000012263728,0.06889552,0.00022236422,0.00010391255,0.000009228366,5.318523e-7,0.000020516207,0.000054208027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981352,0.00023517694,0.00027867,0.000623181,0.00032485017,0.00040288395],"domain_scores_gemma":[0.9989614,0.00033418482,0.00011307919,0.00032186566,0.00011149541,0.00015797645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057226885,0.0002621695,0.00024107366,0.00021285201,0.0010565453,0.00024184439,0.0002515148,0.00014616353,0.00001750568],"category_scores_gemma":[0.00000775723,0.00023246925,0.000071774004,0.0005178096,0.00004854539,0.0005018981,0.000009653001,0.00050687906,0.000024799469],"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.00012347913,0.00020096487,0.000010854899,0.00003846334,0.000063945845,0.000016800379,0.00083827175,0.67742485,0.0048356103,0.00021041924,0.000048349215,0.316188],"study_design_scores_gemma":[0.0008651973,0.0005343527,0.00004987605,0.00010003894,0.000021593221,0.00022232157,0.000022933216,0.94916797,0.048072506,0.00012165084,0.0005232154,0.0002983357],"about_ca_topic_score_codex":0.00004442912,"about_ca_topic_score_gemma":0.00014684637,"teacher_disagreement_score":0.78541356,"about_ca_system_score_codex":0.000048489623,"about_ca_system_score_gemma":0.000036391404,"threshold_uncertainty_score":0.9479821},"labels":[],"label_agreement":null},{"id":"W2171072531","doi":"10.1109/tdsc.2010.39","title":"Fast and Secure Reauthentications for 3GPP Subscribers during WiMAX-WLAN Handovers","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":38,"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":"Sultan Qaboos University; Academy of Finland; Queensland University of Technology","keywords":"WiMAX; Computer network; Computer science; Roaming; Handover; Interoperability; Wireless network; Wi-Fi; Telecommunications; Wireless; Computer security","score_opus":0.005020432150511949,"score_gpt":0.2012900685172559,"score_spread":0.19626963636674394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171072531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65095437,0.00022391367,0.3462279,0.000077796285,0.0013522052,0.00049603265,0.00008858806,0.00034029866,0.00023890461],"genre_scores_gemma":[0.99684113,0.000092935414,0.002585126,0.00003703601,0.00020769783,0.000038288705,0.0000151484655,0.00007064794,0.0001119731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838954,0.00003161618,0.0003593027,0.00048640594,0.00018364142,0.00054947694],"domain_scores_gemma":[0.9990619,0.00023151468,0.000060767765,0.00034945284,0.00008177972,0.00021461907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002639677,0.00033873427,0.0003309291,0.00016407354,0.0007102946,0.0001721045,0.00015774193,0.0002463663,0.00003751348],"category_scores_gemma":[0.00000987861,0.0003691251,0.00012239465,0.0002259948,0.000111336405,0.00026244108,0.0000061426085,0.0007764685,0.0000053123167],"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.0013395734,0.0015986529,0.0034783997,0.0063060955,0.002547576,0.00012362008,0.054981276,0.57472765,0.18680967,0.006426854,0.0015208663,0.16013977],"study_design_scores_gemma":[0.0036337774,0.00014142417,0.0010259004,0.00019034342,0.00032681238,0.00022094649,0.0009579366,0.9628289,0.02691867,0.000982675,0.0017366688,0.0010359561],"about_ca_topic_score_codex":0.000049717768,"about_ca_topic_score_gemma":0.0008879708,"teacher_disagreement_score":0.38810125,"about_ca_system_score_codex":0.000052240182,"about_ca_system_score_gemma":0.000023448745,"threshold_uncertainty_score":0.9998761},"labels":[],"label_agreement":null},{"id":"W2318549902","doi":"10.1109/tdsc.2016.2548463","title":"Understanding Practical Tradeoffs in HPC Checkpoint-Scheduling Policies","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Exploit; Fault tolerance; Distributed computing; Energy consumption; Software deployment; Supercomputer; Efficient energy use; Embedded system; Reliability engineering; Parallel computing; Operating system; Computer security","score_opus":0.06695110729053493,"score_gpt":0.27851925762470525,"score_spread":0.2115681503341703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318549902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08768769,0.000060326198,0.9032457,0.0071679577,0.0004108332,0.00014447083,0.0000012411405,0.00022677355,0.0010550336],"genre_scores_gemma":[0.97660094,0.000027597667,0.022776013,0.00037342764,0.00008011209,0.000003168942,1.1677506e-7,0.000017705268,0.00012094107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980127,0.00013853816,0.000394915,0.000580818,0.00032401015,0.0005489849],"domain_scores_gemma":[0.9986866,0.0007014718,0.00009963844,0.00033934996,0.000031891912,0.00014101944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006744006,0.00023644269,0.00025363677,0.00032975333,0.00042393914,0.00021289615,0.00032536619,0.00010848402,0.000007812805],"category_scores_gemma":[0.000024777544,0.00018046738,0.00009502034,0.0004902862,0.00007092886,0.00013804187,0.000023293398,0.00035396678,0.000015438845],"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.00017385556,0.00130653,0.0005488975,0.00023195214,0.00035868198,0.00076437526,0.017868962,0.48425314,0.004354316,0.12183298,0.00035438235,0.36795193],"study_design_scores_gemma":[0.001937533,0.00026552516,0.00018167499,0.0006279713,0.00003215525,0.0003429127,0.0017827853,0.9848971,0.004563477,0.0033879683,0.0013214896,0.00065945263],"about_ca_topic_score_codex":0.000065790235,"about_ca_topic_score_gemma":0.000041423067,"teacher_disagreement_score":0.8889132,"about_ca_system_score_codex":0.00019505207,"about_ca_system_score_gemma":0.00005083636,"threshold_uncertainty_score":0.73592466},"labels":[],"label_agreement":null},{"id":"W2343346041","doi":"10.1109/tdsc.2015.2507120","title":"Fast Software Implementations of Bilinear Pairings","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Affine transformation; Parallel computing; Computation; Exponentiation; Software; Computer engineering; Theoretical computer science; Computational science; Algorithm; Mathematics; Programming language","score_opus":0.02342511708385293,"score_gpt":0.257891111118662,"score_spread":0.23446599403480906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343346041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10013301,0.00016624066,0.8989359,0.0001642667,0.00027593327,0.000111568996,0.000010234529,0.00012114064,0.00008169716],"genre_scores_gemma":[0.9168696,0.000017181239,0.08299526,0.000060788527,0.000021809401,0.0000029919443,0.0000010793603,0.000008061454,0.00002327404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989639,0.000051626317,0.00025879723,0.00028192624,0.0002209467,0.00022278201],"domain_scores_gemma":[0.99927014,0.00014814945,0.00007867887,0.0002486716,0.00011858895,0.00013575924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025080994,0.00012701435,0.00016424104,0.00020707506,0.00024010685,0.00007323231,0.0002500259,0.000052356907,0.000008421783],"category_scores_gemma":[0.0000064976634,0.000116487354,0.000082808714,0.0004957563,0.000053298932,0.00022766889,0.00000847458,0.0001731783,0.000005669846],"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.000065980246,0.0009104686,0.00377751,0.00031289787,0.00032475212,0.00007032938,0.019404331,0.16998039,0.0015542312,0.008500684,0.0008423841,0.79425603],"study_design_scores_gemma":[0.0066378955,0.0021515158,0.0035739392,0.00054644083,0.00022342046,0.0005072047,0.0051910547,0.85223365,0.11281982,0.009503386,0.004875127,0.0017365636],"about_ca_topic_score_codex":0.00009401788,"about_ca_topic_score_gemma":0.00006264837,"teacher_disagreement_score":0.8167365,"about_ca_system_score_codex":0.000014154245,"about_ca_system_score_gemma":0.000077981895,"threshold_uncertainty_score":0.47502166},"labels":[],"label_agreement":null},{"id":"W2491068252","doi":"10.1109/tdsc.2016.2596719","title":"Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Bisimulation; Model checking; Theoretical computer science; Time complexity; Fault model; Algorithm","score_opus":0.021828073778649017,"score_gpt":0.2616526338298034,"score_spread":0.2398245600511544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491068252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08383156,0.00004038212,0.91517615,0.00007329884,0.00018090736,0.00015604583,0.000016224001,0.00011698433,0.00040842098],"genre_scores_gemma":[0.7915251,0.00005225695,0.20831032,0.000025432839,0.00001492699,0.000008667465,2.0771188e-7,0.000012081736,0.000050990187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986192,0.000159578,0.0003081071,0.00039165549,0.0002588004,0.00026263698],"domain_scores_gemma":[0.99861157,0.00058511377,0.00015994017,0.00044211323,0.0001082029,0.00009304588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048329672,0.0001725744,0.00025276945,0.00021237475,0.00019902614,0.00005563667,0.00035516897,0.00008834391,0.000009856511],"category_scores_gemma":[0.000019606296,0.00011959381,0.00006258654,0.00039461788,0.000058948306,0.0006835263,0.000005643831,0.00013999439,0.0000065615063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015930626,0.00023591497,0.0000040327577,0.000055035543,0.000081824684,0.000008425459,0.0004940239,0.041644767,0.0066145025,0.0041673523,0.000018119963,0.9465167],"study_design_scores_gemma":[0.00088470976,0.00042766417,0.000026233085,0.0002860783,0.000039342318,0.000069482456,0.000044877874,0.7365299,0.26037747,0.000980498,0.0000678328,0.00026596113],"about_ca_topic_score_codex":0.000027764625,"about_ca_topic_score_gemma":0.0000056609715,"teacher_disagreement_score":0.94625074,"about_ca_system_score_codex":0.000040682055,"about_ca_system_score_gemma":0.000063154686,"threshold_uncertainty_score":0.4876894},"labels":[],"label_agreement":null},{"id":"W2527358790","doi":"10.1109/tdsc.2015.2451614","title":"CPV: Delay-Based Location Verification for the Internet","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; PlanetLab; Geolocation; Computer security; The Internet; Computer network; Adversary; Global Positioning System; Authentication (law); Mobile device; World Wide Web; Telecommunications","score_opus":0.029547940413459393,"score_gpt":0.2546429856409055,"score_spread":0.22509504522744608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527358790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011398979,0.00020126568,0.98668474,0.0006075413,0.00066530483,0.00024521965,0.0000024619708,0.00013509482,0.000059400947],"genre_scores_gemma":[0.98724985,0.000004107692,0.012141134,0.00036505327,0.0000842263,0.000019389665,0.0000044905846,0.000013228572,0.00011850728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987639,0.000070203954,0.00029376257,0.00039286705,0.00023145195,0.00024779973],"domain_scores_gemma":[0.9989496,0.0003326147,0.00011883148,0.00023986699,0.00026360713,0.000095473464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066202035,0.00016426679,0.00016102575,0.00010894602,0.00031300995,0.0002745137,0.00043956126,0.000080641395,0.0000046366763],"category_scores_gemma":[0.00001586613,0.00012585802,0.00009747388,0.00032498743,0.00003690021,0.00021248824,0.000004635459,0.00021748655,0.000015217743],"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.00004041165,0.000097745455,0.000008097063,0.000027262773,0.00007916236,0.000002948768,0.0023700953,0.8945646,0.000028890985,0.02033368,0.0006703713,0.081776716],"study_design_scores_gemma":[0.00045896866,0.00012820691,0.000009890072,0.000039942664,0.000041814965,0.000016035994,0.00020161668,0.99522555,0.001486569,0.00003548488,0.0022051402,0.00015080777],"about_ca_topic_score_codex":0.000050312236,"about_ca_topic_score_gemma":0.00010524406,"teacher_disagreement_score":0.9758509,"about_ca_system_score_codex":0.000057294874,"about_ca_system_score_gemma":0.00009306072,"threshold_uncertainty_score":0.5132341},"labels":[],"label_agreement":null},{"id":"W2552931950","doi":"10.1109/tdsc.2016.2626288","title":"Exploiting Social Network to Enhance Human-to-Human Infection Analysis without Privacy Leakage","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Cloud computing; Social network (sociolinguistics); Overhead (engineering); Information privacy; Computer security; Internet privacy; Social media; Computer network; World Wide Web","score_opus":0.027837269036879244,"score_gpt":0.3138579377599896,"score_spread":0.2860206687231104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552931950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33765393,0.000009394387,0.6588547,0.002247563,0.00023102811,0.00019521153,0.0000064528986,0.0007132374,0.00008846017],"genre_scores_gemma":[0.9284277,0.000007517178,0.07099731,0.0002837603,0.00016782543,0.000024318591,0.0000020266632,0.000025462414,0.000064056854],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99732864,0.00013792024,0.00046079996,0.0010064117,0.0003637378,0.0007025077],"domain_scores_gemma":[0.9971674,0.00020627813,0.00016859366,0.002183406,0.00010811927,0.00016617158],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000646779,0.0003096993,0.00042258087,0.000559165,0.0016904589,0.0003818624,0.0039538075,0.00017122127,0.000021839434],"category_scores_gemma":[0.00022220328,0.0002745607,0.00015169501,0.0019562237,0.00005529164,0.0007688121,0.0010537159,0.00039804867,0.000039471863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007568144,0.0005562407,0.008220288,0.00015572365,0.0016011727,0.000082329745,0.004629611,0.059098568,0.07648746,0.0028766852,0.017562024,0.8286542],"study_design_scores_gemma":[0.0038521907,0.0025738734,0.021948416,0.002330862,0.0013810756,0.00014850053,0.00042746516,0.41402122,0.4608856,0.07513382,0.01020542,0.007091518],"about_ca_topic_score_codex":0.00015827313,"about_ca_topic_score_gemma":0.0003745268,"teacher_disagreement_score":0.8215627,"about_ca_system_score_codex":0.00015030001,"about_ca_system_score_gemma":0.000027567949,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W2744402374","doi":"10.1109/tdsc.2019.2908907","title":"Comparative Analysis and Framework Evaluating Mimicry-Resistant and Invisible Web Authentication Schemes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mimicry; Computer science; Authentication (law); Password; Usability; Computer security; World Wide Web; Multi-factor authentication; Internet privacy; Human–computer interaction; Authentication protocol; Biology","score_opus":0.05214109476560733,"score_gpt":0.327001526575048,"score_spread":0.27486043180944064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744402374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3246584,0.0007760333,0.67289966,0.0007974558,0.00026173433,0.00037879773,0.00002981523,0.0001640194,0.000034088036],"genre_scores_gemma":[0.9674819,0.00016157476,0.032025855,0.00019167867,0.000053583877,0.000023114484,0.00001592445,0.000016764898,0.00002957705],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969981,0.00033558102,0.0006509033,0.0012253548,0.00045787878,0.0003322215],"domain_scores_gemma":[0.9980351,0.00050977373,0.00037478525,0.00061910576,0.00019519997,0.00026607915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006208544,0.00042738672,0.0008031925,0.000507484,0.00066014484,0.0009681108,0.0004562596,0.00031467297,0.000013308119],"category_scores_gemma":[0.000023087623,0.00043538696,0.00014723495,0.00080100645,0.00010925612,0.0002362034,0.00008685099,0.0010023302,0.000008161581],"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.00040716666,0.0014975322,0.0027576238,0.0050718286,0.01385667,0.00008876554,0.77114457,0.02489835,0.032413322,0.04453314,0.0003104699,0.10302058],"study_design_scores_gemma":[0.00031677654,0.0000992631,0.0004838596,0.0003138047,0.0005710465,0.0000115032235,0.0006064372,0.99179703,0.0018732433,0.0033361935,0.00015024096,0.00044059166],"about_ca_topic_score_codex":0.00009963967,"about_ca_topic_score_gemma":0.00010916442,"teacher_disagreement_score":0.9668987,"about_ca_system_score_codex":0.000049433187,"about_ca_system_score_gemma":0.00013406383,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2783908022","doi":"10.1109/tdsc.2018.2791432","title":"Providing Task Allocation and Secure Deduplication for Mobile Crowdsensing via Fog Computing","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Data deduplication; Computer science; Overhead (engineering); Task (project management); Hash function; Mobile computing; Mobile device; Computer network; Crowdsensing; Cryptography; Distributed computing; Computer security; World Wide Web","score_opus":0.018601413574877452,"score_gpt":0.2717896858156896,"score_spread":0.25318827224081214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783908022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124724455,0.0001963561,0.87178606,0.0014170475,0.00048824382,0.00067126955,0.00001117953,0.0006657006,0.000039659673],"genre_scores_gemma":[0.74498105,0.000022021806,0.25467008,0.00016631267,0.000107023494,0.000016858467,0.000006407288,0.000023283577,0.0000069812368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786085,0.00007149662,0.0004082147,0.0009226688,0.000228097,0.0005086752],"domain_scores_gemma":[0.9973031,0.00046235241,0.00021301737,0.0016798081,0.0002364791,0.00010523903],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006336798,0.00028470115,0.00027176278,0.00024914718,0.0013258843,0.0004095913,0.0021374447,0.00021341094,0.0000019351637],"category_scores_gemma":[0.0002380598,0.00029989198,0.000059646198,0.00049659313,0.00015116094,0.00069472706,0.00050526153,0.00036487047,0.0000054897005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046678328,0.00016692687,0.000088670524,0.0002822792,0.00010992391,0.000007044985,0.0022929036,0.004153192,0.032326743,0.0012173417,0.0023321174,0.9569762],"study_design_scores_gemma":[0.00044809125,0.00026153782,0.000038926148,0.00015036238,0.00002721174,0.0001112216,0.00013158868,0.93283814,0.058152847,0.00676523,0.00075286295,0.0003219557],"about_ca_topic_score_codex":0.00005236057,"about_ca_topic_score_gemma":0.00004799562,"teacher_disagreement_score":0.95665425,"about_ca_system_score_codex":0.000086565546,"about_ca_system_score_gemma":0.00005812265,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W2790832484","doi":"10.1109/tdsc.2018.2804394","title":"Anonymity Services Tor, I2P, JonDonym: Classifying in the Dark (Web)","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Anonymity; Computer science; Traffic classification; Network packet; Encryption; Data mining; Feature (linguistics); Computer network; Computer security","score_opus":0.014349558234002236,"score_gpt":0.24609630149119333,"score_spread":0.23174674325719108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790832484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34218386,0.000109724184,0.6556616,0.00031048091,0.00048193164,0.0001280243,0.0000022767447,0.00010939618,0.0010127145],"genre_scores_gemma":[0.9950498,0.000020969625,0.003698628,0.00096800836,0.00019070267,0.0000050715685,0.0000013064961,0.000014097842,0.00005144911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783486,0.00023953801,0.00043060636,0.0006148579,0.00038322105,0.00049694057],"domain_scores_gemma":[0.99902815,0.00030506117,0.00012996193,0.00034550758,0.00010652035,0.00008479446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094034465,0.00026218774,0.00029011135,0.00022036226,0.00076997833,0.00049324695,0.00090829196,0.0001296753,0.000024965115],"category_scores_gemma":[0.000004459672,0.00019863463,0.0001311185,0.00071705854,0.000081918144,0.00043986682,0.000016892183,0.000579388,0.00003050587],"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.00030694756,0.0023886934,0.0028427574,0.0007982159,0.00091283856,0.0008829059,0.13824442,0.1603977,0.0036366887,0.11001191,0.0022905427,0.57728636],"study_design_scores_gemma":[0.0004323191,0.0001443246,0.00023152384,0.0001336124,0.000025714337,0.00008612762,0.00088363886,0.99600846,0.000709827,0.00006834777,0.0010137775,0.0002623278],"about_ca_topic_score_codex":0.00013596006,"about_ca_topic_score_gemma":0.002306602,"teacher_disagreement_score":0.83561075,"about_ca_system_score_codex":0.000043471104,"about_ca_system_score_gemma":0.000055066343,"threshold_uncertainty_score":0.8100085},"labels":[],"label_agreement":null},{"id":"W2808669017","doi":"10.1109/tdsc.2018.2846258","title":"Physical Layer based Message Authentication with Secure Channel Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; China Postdoctoral Science Foundation","keywords":"Computer science; Authentication (law); Message authentication code; Authentication protocol; Computer network; Physical layer; Data Authentication Algorithm; PHY; Hash function; Channel (broadcasting); Theoretical computer science; Computer security; Cryptography; Wireless","score_opus":0.013347861099777187,"score_gpt":0.2423302788624251,"score_spread":0.22898241776264794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808669017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30600294,0.000055135442,0.6923467,0.00011708718,0.00008181524,0.00017289219,0.000015721756,0.00069036294,0.0005173525],"genre_scores_gemma":[0.99508345,0.0000221617,0.004625995,0.00008036772,0.00008345837,0.000022810082,0.000007926506,0.000051446455,0.00002240133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905246,0.0000558672,0.00018281308,0.00025269832,0.00019529006,0.00026088647],"domain_scores_gemma":[0.9992543,0.00011243623,0.000044356548,0.00039364264,0.00010724277,0.00008805745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392589,0.00022311143,0.00021951899,0.00014333703,0.0003439024,0.00008426919,0.0001983831,0.00010592345,0.000022933042],"category_scores_gemma":[0.0000019286758,0.0002090632,0.000051008075,0.00027824694,0.000092899725,0.00016853464,0.0000032205348,0.00037882527,0.000018086459],"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.00063646433,0.0028260073,0.00020727454,0.0017878815,0.0013752219,0.00007139236,0.061595585,0.5922557,0.16169481,0.007122875,0.0030477915,0.16737898],"study_design_scores_gemma":[0.00033355987,0.00013704492,0.000039108614,0.00013781339,0.000038982558,0.000013140976,0.00018333204,0.7940019,0.2042344,0.00016716066,0.00046117438,0.0002524113],"about_ca_topic_score_codex":0.000018361405,"about_ca_topic_score_gemma":0.00009942509,"teacher_disagreement_score":0.6890805,"about_ca_system_score_codex":0.000041456333,"about_ca_system_score_gemma":0.000020170986,"threshold_uncertainty_score":0.852535},"labels":[],"label_agreement":null},{"id":"W2899827171","doi":"10.1109/tdsc.2018.2813891","title":"Guest Editors’ Introduction: Special Issue on Data-Driven Dependability and Security","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dependability; Computer science; Publication; Data security; Computer security; Data integrity; Data science; Software engineering; Encryption","score_opus":0.01463421890371897,"score_gpt":0.25863456485067887,"score_spread":0.2440003459469599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899827171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24113172,0.00009009895,0.68840396,0.0036334693,0.06402836,0.00080256385,0.000087899934,0.0007119694,0.0011099257],"genre_scores_gemma":[0.9289626,0.000031413576,0.00327158,0.00014480574,0.06751322,0.000004413924,0.0000073644896,0.000015251495,0.000049382783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974137,0.00016345887,0.0004179515,0.0011951511,0.00039578133,0.0004139629],"domain_scores_gemma":[0.9980124,0.00023432368,0.00011697609,0.0012666361,0.00017805818,0.00019160773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078945985,0.00029528572,0.00034378667,0.00014044209,0.0010116745,0.00026715128,0.00066747767,0.00019012822,0.00008965585],"category_scores_gemma":[0.000029519077,0.00025885014,0.00005596824,0.00038003983,0.00023840163,0.0008165787,0.000052080773,0.0005297248,0.00010419427],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006535774,0.0023550512,0.003805524,0.0010534208,0.0004958259,0.00010159239,0.01931234,0.00646161,0.00033318982,0.0014176015,0.21149582,0.7525144],"study_design_scores_gemma":[0.0019779056,0.0019013045,0.0014305644,0.00023813563,0.00009605786,0.00046811873,0.00039512248,0.47704563,0.011567024,0.0009165775,0.50263184,0.0013317113],"about_ca_topic_score_codex":0.0000941704,"about_ca_topic_score_gemma":0.00015608848,"teacher_disagreement_score":0.75118273,"about_ca_system_score_codex":0.00006563397,"about_ca_system_score_gemma":0.000075926226,"threshold_uncertainty_score":0.99998635},"labels":[],"label_agreement":null},{"id":"W2906048991","doi":"10.1109/tdsc.2018.2889086","title":"<i>Network Attack Surface</i>: Lifting the Concept of Attack Surface to the Network Level for Evaluating Networks’ Resilience Against Zero-Day Attacks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":33,"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; Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; National Science Foundation","keywords":"Attack surface; Computer science; Resilience (materials science); Abstraction; Network security; Metric (unit); Software; Computer security; Surface (topology); Lift (data mining); Data mining; Mathematics; Engineering","score_opus":0.05072490151960609,"score_gpt":0.3054348580816068,"score_spread":0.25470995656200074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906048991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07366705,0.00034192842,0.9215156,0.0011307448,0.0018377485,0.00094273116,0.000020346066,0.00013219462,0.0004116787],"genre_scores_gemma":[0.9575262,0.00002262651,0.038527157,0.0032611187,0.00046685486,0.000011291793,0.000004678307,0.000027185142,0.00015285546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966158,0.00043226132,0.0008377465,0.0006066593,0.0005621854,0.0009453026],"domain_scores_gemma":[0.9963044,0.0017362228,0.0004283378,0.0008229381,0.0005397985,0.0001683286],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0035865405,0.00036916294,0.0004111949,0.000031819498,0.0028951026,0.00040048253,0.0012602308,0.00014519636,0.00001197058],"category_scores_gemma":[0.000048495902,0.0002652078,0.00017019219,0.0011282836,0.00022627306,0.00047424991,0.000064227424,0.0005754498,0.000019418028],"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.000033598073,0.000024934827,0.00004851533,0.000016485372,0.000037209506,6.916341e-7,0.0056422097,0.95591116,0.000032119653,0.0007516902,0.007962187,0.02953919],"study_design_scores_gemma":[0.00051127514,0.00030234462,0.00011452727,0.00022040836,0.000032441425,0.000013689582,0.000349424,0.9890115,0.0011294548,0.000100181824,0.0078745,0.00034024462],"about_ca_topic_score_codex":0.000041955303,"about_ca_topic_score_gemma":0.00024742412,"teacher_disagreement_score":0.88385916,"about_ca_system_score_codex":0.000050991053,"about_ca_system_score_gemma":0.00014476126,"threshold_uncertainty_score":0.99998003},"labels":[],"label_agreement":null},{"id":"W2938767118","doi":"10.1109/tdsc.2018.2861403","title":"Disclose More and Risk Less: Privacy Preserving Online Social Network Data Sharing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Institute of Chemistry, Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Social network (sociolinguistics); Heuristics; Private information retrieval; Permission; Information privacy; Knapsack problem; Inference; Computer security; Social media; Internet privacy; World Wide Web; Artificial intelligence; Algorithm","score_opus":0.07697807668855826,"score_gpt":0.3012775501062641,"score_spread":0.22429947341770584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938767118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1596867,0.0004625238,0.82659596,0.011869526,0.00023087155,0.00020599086,0.00017850166,0.00073888164,0.000031062355],"genre_scores_gemma":[0.8280205,0.00038872656,0.17095874,0.00032288878,0.00024113756,0.0000032546973,0.000029835805,0.000029165141,0.0000057230536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728787,0.00009527018,0.00039375937,0.001345557,0.0003166363,0.0005609059],"domain_scores_gemma":[0.99570984,0.00028626496,0.00018529892,0.0036048477,0.00004595613,0.00016781449],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004705175,0.00030311244,0.00035065514,0.000085910644,0.0011211929,0.00051459845,0.01370688,0.00017503601,0.0000061195806],"category_scores_gemma":[0.0005585772,0.00030188437,0.00004939741,0.0006107757,0.00010700187,0.001187095,0.008815304,0.0010103846,0.0000030109575],"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.00012390323,0.00044996524,0.0067228316,0.0006026624,0.0006476645,0.00022321576,0.0073944125,0.03417304,0.00041444437,0.0010564132,0.03627939,0.9119121],"study_design_scores_gemma":[0.0004676131,0.000061727325,0.00060483074,0.000104394836,0.000050764582,0.000026617463,0.00026643852,0.9912636,0.0002366063,0.0056826887,0.00089609704,0.0003385906],"about_ca_topic_score_codex":0.00015514628,"about_ca_topic_score_gemma":0.000103708975,"teacher_disagreement_score":0.9570906,"about_ca_system_score_codex":0.000028692979,"about_ca_system_score_gemma":0.000042866708,"threshold_uncertainty_score":0.9999433},"labels":[],"label_agreement":null},{"id":"W2953030092","doi":"10.1109/tdsc.2019.2922958","title":"Efficient and Secure Decision Tree Classification for Cloud-Assisted Online Diagnosis Services","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Decision tree; Outsourcing; Decision tree learning; Classifier (UML); Data mining; Server; Computer security; Machine learning; Artificial intelligence; Computer network","score_opus":0.025495654813636172,"score_gpt":0.2747887559841842,"score_spread":0.249293101170548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953030092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4280419,0.00021462725,0.5688963,0.0015561988,0.00054845854,0.0003623061,0.000059151593,0.0002995502,0.000021485675],"genre_scores_gemma":[0.845501,0.000116547955,0.15412702,0.00014413886,0.00003877126,0.000024624527,0.000015008601,0.000019655343,0.00001321145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799,0.00005714897,0.00038090535,0.0008809938,0.0002985492,0.0003923632],"domain_scores_gemma":[0.99661773,0.0009022149,0.00016960558,0.0020870147,0.000120239856,0.00010316818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037555417,0.00026812602,0.00030343892,0.00025507133,0.0004532561,0.00027797863,0.0031332036,0.00023010604,0.000007645264],"category_scores_gemma":[0.00012345533,0.00024923586,0.00007969156,0.0004873574,0.000049154707,0.00026135155,0.00048887293,0.00035998924,0.00000990654],"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.00010978251,0.00063649565,0.0010309118,0.00042542734,0.000108577784,0.000010301946,0.0006528284,0.01518994,0.0020645533,0.0009558875,0.0016872654,0.977128],"study_design_scores_gemma":[0.00091850874,0.00020828801,0.0018449432,0.00027124694,0.000030253044,0.0000366671,0.00020850995,0.98979104,0.002588715,0.0029578297,0.00085181464,0.00029215953],"about_ca_topic_score_codex":0.00003776317,"about_ca_topic_score_gemma":0.00014424234,"teacher_disagreement_score":0.97683585,"about_ca_system_score_codex":0.000064316155,"about_ca_system_score_gemma":0.000035302164,"threshold_uncertainty_score":0.999996},"labels":[],"label_agreement":null},{"id":"W2981962609","doi":"10.1109/tdsc.2019.2949410","title":"Cree: a Performant Tool for Safety Analysis of Administrative Temporal Role-Based Access Control (ATRBAC) Policies","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Control (management); Access control; Computer security; Artificial intelligence","score_opus":0.02847004653088581,"score_gpt":0.3328800217763086,"score_spread":0.3044099752454228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981962609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5320754,0.000068685535,0.4649968,0.0004107048,0.0001764038,0.000668194,0.00025813785,0.00005208145,0.0012935644],"genre_scores_gemma":[0.9992286,0.000012884095,0.0003180197,0.00018866955,0.00006172986,0.000016625245,0.000012954872,0.000011038237,0.00014945363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855757,0.00012103399,0.0003890677,0.00029117908,0.00028979205,0.00035132992],"domain_scores_gemma":[0.9986914,0.000652264,0.00021019965,0.00015976379,0.00019098741,0.0000953767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501753,0.00017176512,0.00049047533,0.00027042592,0.00076525594,0.00016451764,0.0002557235,0.00012350865,0.00018376549],"category_scores_gemma":[0.000013673624,0.00015366409,0.00027704853,0.000603726,0.000118184274,0.0003470435,0.0000024449494,0.00017772472,0.0000024067692],"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.0049523404,0.0012052977,0.1290302,0.00044863755,0.005978327,0.000011083323,0.027439972,0.6940207,0.0009325569,0.012390991,0.00007615467,0.12351377],"study_design_scores_gemma":[0.0053418777,0.00062788284,0.0141646005,0.00010555809,0.0019218915,0.0000015573227,0.0063391766,0.9645907,0.0023106392,0.0001975316,0.0037645812,0.0006339877],"about_ca_topic_score_codex":0.0023102546,"about_ca_topic_score_gemma":0.0040435777,"teacher_disagreement_score":0.46715322,"about_ca_system_score_codex":0.0000475048,"about_ca_system_score_gemma":0.00025327815,"threshold_uncertainty_score":0.626624},"labels":[],"label_agreement":null},{"id":"W2995900199","doi":"10.1109/tdsc.2019.2960336","title":"VTDP: Privately Sanitizing Fine-grained Vehicle Trajectory Data with Boosted Utility","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","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":"Concordia University","funders":"National Science Foundation","keywords":"Trajectory; Computer science","score_opus":0.03562542510619456,"score_gpt":0.2571573523430928,"score_spread":0.2215319272368982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995900199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.281323,0.00012462283,0.71532583,0.0012855378,0.00033768103,0.00032727048,0.00006442368,0.0008685947,0.000343036],"genre_scores_gemma":[0.9039073,0.000017216025,0.095824845,0.0001404898,0.000024320676,0.0000041432245,0.000018895538,0.000025657493,0.000037125683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973897,0.0001155761,0.00035454132,0.0011707365,0.00040082334,0.0005686666],"domain_scores_gemma":[0.99262345,0.00043328063,0.00013886033,0.0066075325,0.000082606784,0.0001142457],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005756059,0.000315493,0.00034397896,0.00020464121,0.0004458919,0.00029907725,0.009436468,0.00016950128,0.000038161532],"category_scores_gemma":[0.00019742594,0.00028456244,0.000047664715,0.00066825276,0.00010083993,0.0011274323,0.0014124351,0.0007421096,0.000036555994],"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.00052085915,0.0012559787,0.0041448544,0.00088362617,0.0007951817,0.0005116016,0.002078236,0.008353705,0.020604486,0.0012144591,0.015042053,0.944595],"study_design_scores_gemma":[0.0011023895,0.00026329645,0.0007637572,0.00020010836,0.000028190167,0.00012743639,0.00011825876,0.9796949,0.014767064,0.0012749203,0.0011789474,0.00048073535],"about_ca_topic_score_codex":0.000096874595,"about_ca_topic_score_gemma":0.00013556435,"teacher_disagreement_score":0.9713412,"about_ca_system_score_codex":0.00005153831,"about_ca_system_score_gemma":0.0001107826,"threshold_uncertainty_score":0.99996066},"labels":[],"label_agreement":null},{"id":"W3011995057","doi":"10.1109/tdsc.2020.2980255","title":"LVBS: Lightweight Vehicular Blockchain for Secure Data Sharing in Disaster Rescue","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Higher Education Discipline Innovation Project; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Data sharing; Computer security; Schedule; Tracing; Computer network","score_opus":0.03712856388906087,"score_gpt":0.26534051339449843,"score_spread":0.22821194950543755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011995057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10234732,0.00031687407,0.89093274,0.005360549,0.0001537709,0.0004985112,0.00004713512,0.00029284257,0.000050270693],"genre_scores_gemma":[0.96904576,0.000029868323,0.029893454,0.000858201,0.00008371556,0.00003709008,0.000010707038,0.000023720202,0.00001750236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764454,0.000048939848,0.00043413692,0.0012288295,0.00018823336,0.00045529922],"domain_scores_gemma":[0.9983985,0.00017015541,0.00008335707,0.0011008917,0.00005867183,0.00018843528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048013328,0.00026054226,0.000329393,0.00016955733,0.0004638919,0.00016834524,0.0017165003,0.00024208402,0.0000089601335],"category_scores_gemma":[0.000020866835,0.0002569425,0.000072382354,0.0006648531,0.000056134486,0.00022699105,0.00009302877,0.0006288465,0.000008238378],"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.00043469577,0.002563902,0.0010303456,0.0016919933,0.00079358864,0.0004502829,0.047172934,0.26125103,0.00892052,0.17755872,0.0037954277,0.49433655],"study_design_scores_gemma":[0.0007582441,0.00011096945,0.000018209874,0.00007205249,0.000020375408,0.000028867747,0.00018106311,0.9883144,0.004286242,0.0019698727,0.0039340854,0.00030562645],"about_ca_topic_score_codex":0.000039639424,"about_ca_topic_score_gemma":0.0001807041,"teacher_disagreement_score":0.86669844,"about_ca_system_score_codex":0.000031219755,"about_ca_system_score_gemma":0.00005274803,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W3012047389","doi":"10.1109/tdsc.2020.2980273","title":"Improving the Accuracy of IR-Level Fault Injection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fault injection; Benchmark (surveying); Compiler; Software; Abstraction; Optimizing compiler; Crash; Range (aeronautics); Fault (geology); Resilience (materials science); Computer engineering; Assembly language; Embedded system; Programming language","score_opus":0.014512481470188004,"score_gpt":0.21689172212976482,"score_spread":0.20237924065957683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012047389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25657615,0.00021168086,0.7423766,0.00010043662,0.00029202836,0.00015000661,0.0000101676815,0.00016226181,0.000120655124],"genre_scores_gemma":[0.9989276,0.000032100004,0.00080206303,0.00011599577,0.000081902625,0.0000042060497,0.0000012912565,0.00002678668,0.0000080653535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924153,0.00003835692,0.00021965189,0.00016171638,0.00013604116,0.0002026741],"domain_scores_gemma":[0.99941385,0.0003121519,0.000058497775,0.00012466077,0.00003468168,0.000056160738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013339704,0.00013559958,0.00014589206,0.00005284053,0.00020335117,0.000038486607,0.00011486226,0.000074873366,0.000013276866],"category_scores_gemma":[0.000021731112,0.00011723,0.00005632397,0.0002710543,0.000023406772,0.00013770474,0.000001638795,0.00041836346,0.0000054856073],"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.000008454163,0.000009160834,0.0000037876148,0.00008099894,0.00003718871,8.883672e-7,0.0008906163,0.8867655,0.0057296446,0.00003581258,0.000062202234,0.10637574],"study_design_scores_gemma":[0.00024399269,0.00009996167,0.00003743833,0.000019842542,0.000028070883,0.00001687033,0.00014339588,0.952406,0.046606045,0.000018023431,0.00026436534,0.00011600165],"about_ca_topic_score_codex":0.000042554853,"about_ca_topic_score_gemma":0.000025088058,"teacher_disagreement_score":0.7423514,"about_ca_system_score_codex":0.000039361345,"about_ca_system_score_gemma":0.000025274716,"threshold_uncertainty_score":0.47805005},"labels":[],"label_agreement":null},{"id":"W3016293736","doi":"10.1109/tdsc.2020.2986751","title":"Self-Stabilizing Secure Computation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Adversary; Cryptography; Protocol (science); Computation; Adversarial system; Compromise; Cryptographic primitive; Cryptographic protocol; Distributed computing; State (computer science); Computer security; Secure multi-party computation; Algorithm; Artificial intelligence","score_opus":0.017021996208250272,"score_gpt":0.23458530626721635,"score_spread":0.2175633100589661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016293736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024385842,0.00021445703,0.97244865,0.0010403323,0.00049252185,0.00023938177,0.000016575003,0.00059139443,0.00057086395],"genre_scores_gemma":[0.9717587,0.000018997469,0.027465096,0.00062418345,0.00009567499,0.0000047577455,0.0000033437739,0.000016979682,0.000012266494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828476,0.00009492787,0.0003629737,0.00060821197,0.00029480614,0.00035431067],"domain_scores_gemma":[0.9992047,0.00013311283,0.00011669477,0.00021005904,0.00010150276,0.0002339424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958609,0.00023732042,0.00028598786,0.0000718606,0.0005030364,0.0003221741,0.00034626442,0.00011059767,0.000007152832],"category_scores_gemma":[0.0000046907826,0.00023607978,0.00009440886,0.00054586836,0.000022735414,0.0004496778,0.000009624118,0.00038801355,0.00003638214],"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.00010060833,0.00074867497,0.00026582513,0.0012852746,0.00041594493,0.00032452468,0.037125867,0.53162295,0.0033253178,0.014418021,0.0022858826,0.4080811],"study_design_scores_gemma":[0.0005746607,0.00014818892,0.000033647477,0.00006516492,0.000015770369,0.000058081136,0.00022232583,0.9925128,0.0018402218,0.00012882991,0.0041064215,0.0002938925],"about_ca_topic_score_codex":0.000018492034,"about_ca_topic_score_gemma":0.000008259645,"teacher_disagreement_score":0.94737285,"about_ca_system_score_codex":0.00003713612,"about_ca_system_score_gemma":0.00005585903,"threshold_uncertainty_score":0.9627054},"labels":[],"label_agreement":null},{"id":"W3016918724","doi":"10.1109/tdsc.2020.2987793","title":"Achieving Efficient Secure Deduplication With User-Defined Access Control in Cloud","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":61,"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":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Data deduplication; Computer science; Cloud computing; Cloud storage; Access control; Encryption; Computer security; Computer network; Service provider; Security analysis; Database; Service (business); Operating system","score_opus":0.01824822054756901,"score_gpt":0.24635451258394947,"score_spread":0.22810629203638047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016918724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2177966,0.000107823354,0.7777847,0.0033747128,0.00019776955,0.0004083533,0.000031939893,0.00023738117,0.000060736253],"genre_scores_gemma":[0.99136215,0.000014800314,0.0069778943,0.0015074472,0.00008369637,0.000019648827,0.0000065145236,0.000023285462,0.00000456062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978381,0.00013261577,0.00040161223,0.00080655253,0.0003447859,0.00047634428],"domain_scores_gemma":[0.9987441,0.00031110633,0.00014173672,0.00047287624,0.00009220858,0.0002380193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027490832,0.00028466995,0.00033434812,0.00018866513,0.0005042537,0.00043264378,0.0008035927,0.00011935479,0.00001098889],"category_scores_gemma":[0.000017235245,0.00027313665,0.00006901673,0.0011393103,0.00005522031,0.0004890623,0.000026882457,0.0006304861,0.000018048544],"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.00019276192,0.00055334286,0.0013740772,0.00017112568,0.00010749246,0.000091069014,0.0065095266,0.9636748,0.001794984,0.008606629,0.00038502147,0.016539179],"study_design_scores_gemma":[0.0018075106,0.00020409626,0.00073526386,0.00012858979,0.000034482393,0.00006378744,0.00011998183,0.9942328,0.0011263047,0.000050953488,0.0011076349,0.00038862933],"about_ca_topic_score_codex":0.00014328906,"about_ca_topic_score_gemma":0.00031640043,"teacher_disagreement_score":0.77356553,"about_ca_system_score_codex":0.00007931469,"about_ca_system_score_gemma":0.000109862616,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W3037789107","doi":"10.1109/tdsc.2020.3004442","title":"Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"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":"National Key Research and Development Program of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Nearest neighbor search; Data mining; Set (abstract data type); Similarity (geometry); Tree (set theory); Information privacy; Server; Theoretical computer science; Mathematics; Computer security; Artificial intelligence; Image (mathematics); Computer network","score_opus":0.05970768965338365,"score_gpt":0.2883740473154003,"score_spread":0.22866635766201665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037789107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3348744,0.00023053407,0.6635036,0.00072630553,0.00013639711,0.00017544997,0.000115123665,0.00017777583,0.000060409708],"genre_scores_gemma":[0.9783232,0.000088762295,0.020965952,0.0005103069,0.000070656424,0.0000015725213,0.000022593384,0.000015810578,0.0000011071152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975082,0.00018811283,0.00032785823,0.001074116,0.00042043498,0.00048124214],"domain_scores_gemma":[0.9980577,0.00041006703,0.00007718689,0.0010523056,0.000056634428,0.00034607245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006250126,0.00027341073,0.00029943473,0.0001487238,0.0008442547,0.0005468583,0.0014239263,0.00012084651,0.000034198314],"category_scores_gemma":[0.00003525455,0.00027008128,0.00006436367,0.0007030146,0.00007580026,0.00076556054,0.00028911952,0.0007532323,0.0000051813445],"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.00090692914,0.002476534,0.0109755155,0.0034863616,0.0014037673,0.0009667328,0.101305395,0.2633151,0.026408916,0.01924602,0.006256895,0.56325185],"study_design_scores_gemma":[0.0006206185,0.00011495575,0.0011008173,0.00008160327,0.00002893279,0.000038341404,0.00019435026,0.99486834,0.0013665911,0.000101630576,0.0011541817,0.000329634],"about_ca_topic_score_codex":0.00014772818,"about_ca_topic_score_gemma":0.000035606976,"teacher_disagreement_score":0.73155326,"about_ca_system_score_codex":0.00001717867,"about_ca_system_score_gemma":0.00006112406,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W3040569666","doi":"10.1109/tdsc.2021.3114310","title":"The Hermes BFT for Blockchains","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Computer science; Computer network; Node (physics); Bandwidth (computing); Byzantine architecture; Byzantine fault tolerance; Distributed computing; Telecommunications; Fault tolerance; Geography; Engineering","score_opus":0.016019723293701164,"score_gpt":0.25388719399261844,"score_spread":0.23786747069891728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040569666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011460928,0.0017390676,0.98155946,0.0008298668,0.003398707,0.00054017943,0.00007923898,0.00019488644,0.0001976666],"genre_scores_gemma":[0.9902757,0.0001818876,0.00865885,0.00015806721,0.000179557,0.00006702874,0.0000104820965,0.000024920659,0.00044353292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978255,0.000110616515,0.00046103392,0.000821984,0.00029070073,0.00049016933],"domain_scores_gemma":[0.9981628,0.0004892866,0.00020442609,0.0007919214,0.00022630252,0.00012523207],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005059566,0.00034592696,0.0004130115,0.000070187976,0.0013493742,0.0012766639,0.00084581616,0.00027100998,0.00000267716],"category_scores_gemma":[0.000009601222,0.00027757513,0.000272398,0.00020941753,0.000043425513,0.000116756266,0.00003845559,0.0007514781,0.0000026621392],"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.00005512296,0.00038945847,0.000017089847,0.00095488306,0.0007271517,0.00010951043,0.0052051567,0.34965968,0.00032741163,0.010560275,0.00245212,0.6295421],"study_design_scores_gemma":[0.00049435673,0.000075950964,0.00002162026,0.00048258083,0.00004277388,0.000078632664,0.0003758454,0.98178583,0.0019695817,0.0006976169,0.0134886,0.00048660993],"about_ca_topic_score_codex":0.00007361905,"about_ca_topic_score_gemma":0.00019012198,"teacher_disagreement_score":0.9788147,"about_ca_system_score_codex":0.000052819756,"about_ca_system_score_gemma":0.00019636609,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W3088247060","doi":"10.1109/tdsc.2020.3026631","title":"Achieve Efficient and Privacy-Preserving Disease Risk Assessment Over Multi-Outsourced Vertical Datasets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Disease; Internet privacy; Artificial intelligence; Medicine","score_opus":0.02607201367916386,"score_gpt":0.28149764901221347,"score_spread":0.2554256353330496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088247060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1890964,0.00015411244,0.8024042,0.0070758997,0.00019880677,0.00028137417,0.00022969944,0.00054463197,0.000014830856],"genre_scores_gemma":[0.87285686,0.000074124204,0.12655412,0.00043471425,0.00003120509,0.000007961267,0.000016917125,0.00002218765,0.0000019426252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733436,0.00019482017,0.00038008994,0.001112869,0.00044292185,0.0005349631],"domain_scores_gemma":[0.99610823,0.00044066086,0.000098451965,0.0028443474,0.000043510936,0.00046481442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038645475,0.00033105543,0.00031446983,0.00013180653,0.00072085013,0.00045578333,0.00529494,0.00012955774,0.00001727021],"category_scores_gemma":[0.0009937857,0.00031580238,0.000074993186,0.00043691252,0.00011536935,0.000478963,0.0032526664,0.000894672,0.0000095317855],"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.0011459177,0.0045025228,0.017312644,0.002026354,0.0015852097,0.0019158453,0.008967837,0.4361185,0.011927676,0.002858283,0.04105495,0.47058424],"study_design_scores_gemma":[0.0009841128,0.00012155281,0.0027074085,0.00008420673,0.00005561495,0.000013975423,0.000052646,0.99338096,0.0011817021,0.0007083219,0.0003581322,0.0003513546],"about_ca_topic_score_codex":0.00005796108,"about_ca_topic_score_gemma":0.000009278565,"teacher_disagreement_score":0.6837604,"about_ca_system_score_codex":0.000059230588,"about_ca_system_score_gemma":0.00007240064,"threshold_uncertainty_score":0.9999294},"labels":[],"label_agreement":null},{"id":"W3089626165","doi":"10.1109/tdsc.2020.3027579","title":"Enabling Efficient, Secure and Privacy-Preserving Mobile Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Cloud computing; Encryption; Cloud storage; Overhead (engineering); Computer network; Verifiable secret sharing; Scheme (mathematics); Mobile device; Distributed computing; Computer security; Operating system","score_opus":0.0158812799605622,"score_gpt":0.23286554689242162,"score_spread":0.2169842669318594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089626165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30362126,0.00074110244,0.6944149,0.0003048063,0.0003353625,0.00022252541,0.000026123296,0.0002519821,0.00008189508],"genre_scores_gemma":[0.98572797,0.000116306815,0.013507761,0.00046936813,0.00014416344,0.000007333589,0.0000037189982,0.000019729086,0.0000036502527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797654,0.00011080998,0.00032350933,0.00082649954,0.00030308953,0.00045953173],"domain_scores_gemma":[0.9987606,0.00025387845,0.000105477164,0.00047735608,0.000065738284,0.00033699727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031149486,0.0002886161,0.0003053215,0.00015725534,0.0008186664,0.00045005156,0.0006637694,0.00013178504,0.000025743018],"category_scores_gemma":[0.000015707303,0.00028873168,0.000103342114,0.00072344206,0.00006448189,0.0004498067,0.00007428136,0.00061783136,0.000008581872],"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.00037247894,0.0013721626,0.00072390056,0.0019067107,0.00057747983,0.0006269467,0.10844278,0.57954544,0.0149985105,0.02730215,0.0025769016,0.26155454],"study_design_scores_gemma":[0.00085535727,0.0002659989,0.000056132765,0.00010877733,0.00003437486,0.000077009325,0.000644022,0.98624873,0.004772135,0.00046074178,0.005994901,0.00048179962],"about_ca_topic_score_codex":0.000044369925,"about_ca_topic_score_gemma":0.000014468746,"teacher_disagreement_score":0.6821067,"about_ca_system_score_codex":0.000017734894,"about_ca_system_score_gemma":0.000041643794,"threshold_uncertainty_score":0.9999565},"labels":[],"label_agreement":null},{"id":"W3109218172","doi":"10.1109/tdsc.2020.3036641","title":"Identity-Based Provable Data Possession From RSA Assumption for Secure Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Cloud computing; Cloud storage; Data integrity; Outsourcing; Computer security; Theoretical computer science; Database; Encryption; Operating system","score_opus":0.060196595810714855,"score_gpt":0.2966887080416012,"score_spread":0.23649211223088634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109218172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0308692,0.00025693295,0.9627223,0.0026453384,0.0011645985,0.00064038654,0.001231181,0.00044779436,0.00002223972],"genre_scores_gemma":[0.89406383,0.0000215081,0.10421073,0.00093754125,0.00034534148,0.00001600216,0.00035969287,0.000033229757,0.000012122674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727285,0.00014253608,0.00044687337,0.0012061587,0.0004549185,0.00047666684],"domain_scores_gemma":[0.9978443,0.000444276,0.00018783525,0.0011045258,0.0001343465,0.0002847246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004557458,0.0003130192,0.00035063204,0.00012763194,0.0010176895,0.0006512457,0.0014916616,0.00019361907,0.00003411501],"category_scores_gemma":[0.000043092543,0.00033211926,0.00011225074,0.00059477764,0.000050351846,0.0018341191,0.00006982848,0.000560173,0.00003768728],"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.001385266,0.005037118,0.0005045003,0.003051143,0.0016815121,0.00046272355,0.024533127,0.54781973,0.05282699,0.037677675,0.07337215,0.25164807],"study_design_scores_gemma":[0.0011818772,0.00018253904,0.000036763395,0.00012306418,0.00009036076,0.000010218487,0.00011487919,0.9851058,0.0035583654,0.00083594123,0.0083742505,0.00038590867],"about_ca_topic_score_codex":0.00024872483,"about_ca_topic_score_gemma":0.00035558562,"teacher_disagreement_score":0.86319464,"about_ca_system_score_codex":0.000065695174,"about_ca_system_score_gemma":0.00018857427,"threshold_uncertainty_score":0.9999131},"labels":[],"label_agreement":null},{"id":"W3132125973","doi":"10.1109/tdsc.2021.3061611","title":"Efficient and Privacy-Preserving Similarity Range Query Over Encrypted Time Series Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Range query (database); Data mining; Series (stratigraphy); Similarity (geometry); Time series; Cryptography; Information privacy; Range (aeronautics); Query optimization; Information retrieval; Web search query; Sargable; Computer security; Artificial intelligence; Search engine; Machine learning","score_opus":0.02054940420219381,"score_gpt":0.24993961557490932,"score_spread":0.2293902113727155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132125973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19277725,0.00042172195,0.805319,0.000625787,0.00029840655,0.00015534804,0.000042553984,0.0002138312,0.00014611073],"genre_scores_gemma":[0.9635371,0.00006375589,0.03584884,0.00031105636,0.000069066606,0.000003126556,0.000017498289,0.000021806723,0.0001277712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997844,0.0001950641,0.00032021862,0.000889917,0.00036430827,0.00038650236],"domain_scores_gemma":[0.9982094,0.00034949952,0.000095271156,0.0010558396,0.00012738741,0.00016260844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051904115,0.00025521265,0.00028864449,0.00013712666,0.000614709,0.00043816044,0.0006671341,0.00011579602,0.000083368875],"category_scores_gemma":[0.000044204364,0.00026607863,0.000056625115,0.0004931241,0.00006777725,0.00070884544,0.00014910845,0.0004412178,0.00001452408],"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.0005346561,0.0026114874,0.00092365564,0.0017242214,0.00087184395,0.0026555238,0.015275655,0.47490472,0.1927861,0.0033462616,0.004607724,0.29975814],"study_design_scores_gemma":[0.0006848177,0.0000618673,0.00038877703,0.00013971503,0.00003590628,0.0002446215,0.00006061555,0.98451835,0.012638342,0.00025246158,0.0006558569,0.000318644],"about_ca_topic_score_codex":0.00009311507,"about_ca_topic_score_gemma":0.0000647963,"teacher_disagreement_score":0.7707598,"about_ca_system_score_codex":0.000048983627,"about_ca_system_score_gemma":0.00012869987,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W3153416009","doi":"10.1109/tdsc.2021.3072295","title":"SuperSketch: A Multi-Dimensional Reversible Data Structure for Super Host Identification","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Computer science; Host (biology); Identification (biology); Curse of dimensionality; Sketch; Data mining; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.03527887273444228,"score_gpt":0.27241382000644265,"score_spread":0.23713494727200038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153416009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08172208,0.00028971315,0.9164539,0.00038153646,0.00076329184,0.0001617449,0.0001178859,0.00010018881,0.000009655954],"genre_scores_gemma":[0.9371376,0.000014996563,0.06206114,0.00027277158,0.00008551819,0.0000027721117,0.00008492812,0.000017592809,0.00032270545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794024,0.00008934871,0.0003959641,0.0009333253,0.00028559568,0.0003554975],"domain_scores_gemma":[0.9987101,0.00024002857,0.00009419596,0.00057211454,0.00027291043,0.00011064853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038276272,0.00022158212,0.00028334558,0.00013422777,0.0007332198,0.00036260244,0.00064084947,0.00013339141,0.00004947538],"category_scores_gemma":[0.000023014945,0.00021699296,0.00012368987,0.00038518157,0.000033650074,0.0005806523,0.000033265227,0.00032130166,0.000009504939],"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.00018140516,0.001894531,0.00018783171,0.00075107283,0.0020441741,0.00036464317,0.016616918,0.7242413,0.07754255,0.037439346,0.0081956405,0.13054058],"study_design_scores_gemma":[0.0006013124,0.00003493658,0.000038474023,0.00006335027,0.00006914668,0.00010458592,0.0002745991,0.9861183,0.011624823,0.000016304777,0.0008010416,0.00025308903],"about_ca_topic_score_codex":0.000023782988,"about_ca_topic_score_gemma":0.00032915897,"teacher_disagreement_score":0.8554155,"about_ca_system_score_codex":0.00003686032,"about_ca_system_score_gemma":0.00011939261,"threshold_uncertainty_score":0.88487166},"labels":[],"label_agreement":null},{"id":"W3154781724","doi":"10.1109/tdsc.2021.3074146","title":"Secure Password-Protected Encryption Key for Deduplicated Cloud Storage Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Password; Server; Encryption; Data deduplication; Computer security; Computer network; Cloud computing; Authentication (law); S/KEY; Operating system","score_opus":0.019947460979481642,"score_gpt":0.24600901987333149,"score_spread":0.22606155889384985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154781724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049503054,0.00054059166,0.9457837,0.0007470767,0.0019079911,0.00072169193,0.00018326116,0.0005428466,0.00006981426],"genre_scores_gemma":[0.9709315,0.000053490276,0.028343115,0.00014928957,0.00021927839,0.00007788747,0.000058191825,0.000035816534,0.00013147414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973649,0.00020855133,0.00050487445,0.0009624649,0.00035228036,0.00060693873],"domain_scores_gemma":[0.99798185,0.00040724865,0.00017373031,0.000816661,0.00039234984,0.0002281662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036040234,0.00033446832,0.00039055248,0.00019517489,0.0011306496,0.00055265776,0.000521977,0.00025880954,0.000015226779],"category_scores_gemma":[0.00003466552,0.00036586018,0.00016321936,0.0009721391,0.00005182539,0.00045115367,0.000024635425,0.00057624007,0.000025288902],"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.00036693047,0.003601162,0.00008763219,0.0024579787,0.0015358791,0.000843669,0.018821802,0.5778259,0.0778283,0.17617302,0.013412125,0.12704557],"study_design_scores_gemma":[0.0010787847,0.00015567936,0.000035278266,0.00018739687,0.00006364017,0.00043955364,0.0002896545,0.97908527,0.008160446,0.00070198736,0.009288085,0.00051421055],"about_ca_topic_score_codex":0.00011913007,"about_ca_topic_score_gemma":0.00017590751,"teacher_disagreement_score":0.9214284,"about_ca_system_score_codex":0.00013555055,"about_ca_system_score_gemma":0.00019675879,"threshold_uncertainty_score":0.99987936},"labels":[],"label_agreement":null},{"id":"W3191008542","doi":"10.1109/tdsc.2021.3101120","title":"Towards Practical and Privacy-Preserving Multi-Dimensional Range Query Over Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Intersection (aeronautics); Predicate (mathematical logic); Point cloud; Data mining; Theoretical computer science; Range query (database); Big data; Information privacy; Server; Computer security; Algorithm; Information retrieval; Computer network; Artificial intelligence; Search engine","score_opus":0.027779216036727967,"score_gpt":0.2862058883541309,"score_spread":0.25842667231740296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191008542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14814171,0.00059531746,0.8493245,0.0008951003,0.00065733196,0.00011191434,0.000026000824,0.00013783287,0.000110253015],"genre_scores_gemma":[0.84001505,0.0001071237,0.1592735,0.0004854141,0.00008262218,0.0000033184078,0.000004900933,0.000013024882,0.000015061605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981282,0.0001706626,0.00028671898,0.0007013156,0.00033256135,0.00038053925],"domain_scores_gemma":[0.9986801,0.00039467018,0.000074722346,0.00051879516,0.00011285413,0.00021884225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037499508,0.00023132285,0.00026465996,0.00012642494,0.0006080496,0.00035837977,0.00027242623,0.00014472904,0.00005749424],"category_scores_gemma":[0.00003762677,0.00022865522,0.00010510371,0.00042343634,0.0000673063,0.0007404226,0.00007621656,0.000563239,0.000005566013],"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.0009524609,0.00962572,0.0062981653,0.0021781393,0.0021948596,0.007552232,0.034390993,0.023204854,0.025617754,0.25864992,0.013309306,0.6160256],"study_design_scores_gemma":[0.0028810957,0.00017862633,0.0035018136,0.00026835836,0.00009260771,0.0014034531,0.00028131268,0.9668876,0.013197087,0.0053136987,0.005099175,0.00089516776],"about_ca_topic_score_codex":0.00013949157,"about_ca_topic_score_gemma":0.00017823912,"teacher_disagreement_score":0.94368273,"about_ca_system_score_codex":0.00002097566,"about_ca_system_score_gemma":0.00016382552,"threshold_uncertainty_score":0.93242896},"labels":[],"label_agreement":null},{"id":"W3199406030","doi":"10.1109/tdsc.2021.3111328","title":"ExtendedSketch: Fusing Network Traffic for Super Host Identification With a Memory Efficient Sketch","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Host (biology); Computer science; Sketch; Identification (biology); Theoretical computer science; Notation; Parallel computing; Algorithm; Data mining; Mathematics; Arithmetic","score_opus":0.012322603479798702,"score_gpt":0.23114439979145426,"score_spread":0.21882179631165555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199406030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27303106,0.00029231524,0.72549653,0.00020538837,0.0005474928,0.00021463093,0.0000045895895,0.00015541296,0.000052595973],"genre_scores_gemma":[0.97855616,0.000016809754,0.020790687,0.0001972724,0.00017438154,0.000016265018,0.000007744691,0.00003101049,0.00020969982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975421,0.00012418114,0.000499458,0.00088298426,0.00036901596,0.00058228074],"domain_scores_gemma":[0.99872005,0.00031870115,0.0001576734,0.00034473065,0.00031999435,0.00013882895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062435324,0.00030056006,0.00037447698,0.00014588202,0.0010521221,0.00052666676,0.0003355393,0.00012438226,0.00002098967],"category_scores_gemma":[0.000008977229,0.0002738781,0.00019738165,0.000704104,0.000050666822,0.00022634091,0.000010570078,0.00035704658,0.000008649573],"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.000027993778,0.00016998695,0.0000022918862,0.00005459768,0.00012109215,0.00003976359,0.002601436,0.94074124,0.00029079206,0.0027332127,0.00006379729,0.05315382],"study_design_scores_gemma":[0.00065815315,0.000104846236,0.000042501066,0.00016755403,0.00009931709,0.00018276976,0.0005195504,0.993441,0.004198779,0.000010795036,0.00022535922,0.0003493814],"about_ca_topic_score_codex":0.000009308497,"about_ca_topic_score_gemma":0.00021382787,"teacher_disagreement_score":0.7055251,"about_ca_system_score_codex":0.000060260532,"about_ca_system_score_gemma":0.00013249672,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W3207729491","doi":"10.1109/tdsc.2021.3118636","title":"Generative-Adversarial Class-Imbalance Learning for Classifying Cyber-Attacks and Faults - A Cyber-Physical Power System","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":38,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cyber-physical system; Adversarial system; Artificial intelligence; Class (philosophy); Machine learning; Session (web analytics); Perceptron; Scheme (mathematics); Computer security; Data mining; Artificial neural network; Mathematics","score_opus":0.013569973561393354,"score_gpt":0.2459517250997809,"score_spread":0.23238175153838753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207729491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22092003,0.0001735907,0.7767878,0.00023632287,0.0011160268,0.0001990391,0.0000058031037,0.00021095162,0.00035040453],"genre_scores_gemma":[0.99142396,0.000039743445,0.007895332,0.00015043971,0.00029073513,0.000015775104,0.0000034152338,0.000021873739,0.00015872804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802125,0.00020050416,0.0003136023,0.00076773425,0.00026374948,0.0004331373],"domain_scores_gemma":[0.9988856,0.0004050406,0.00013336242,0.00025144208,0.00016906156,0.00015550312],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00028568888,0.00026998555,0.00036694703,0.00010891072,0.0013136376,0.000343399,0.00018304623,0.0001720108,0.0000055420182],"category_scores_gemma":[0.0000145491595,0.00027438666,0.00013413037,0.0003718677,0.000053257078,0.00046759387,0.000021393353,0.0006294124,0.0000059550434],"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.0006142481,0.0010623354,0.00022923181,0.0009812217,0.0007968262,0.00044445644,0.023807859,0.5178787,0.05970923,0.0508707,0.00087236287,0.34273285],"study_design_scores_gemma":[0.0011268328,0.00028569574,0.000038486032,0.00018621823,0.000034670175,0.00023186278,0.00045411638,0.97557646,0.017774181,0.00018420006,0.003769394,0.0003378974],"about_ca_topic_score_codex":0.000020962058,"about_ca_topic_score_gemma":0.00004899195,"teacher_disagreement_score":0.77050394,"about_ca_system_score_codex":0.00008095629,"about_ca_system_score_gemma":0.000078793615,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W3212510710","doi":"10.1109/tdsc.2021.3128073","title":"Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematics; Mathematical proof; Computer science; Discrete mathematics; Theoretical computer science; Arithmetic; Geometry","score_opus":0.011133100045737823,"score_gpt":0.22633361400972168,"score_spread":0.21520051396398387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212510710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2786635,0.0003115924,0.72023696,0.0001255202,0.00018213666,0.00013162047,0.000010592427,0.000102882004,0.00023525166],"genre_scores_gemma":[0.9644845,0.000048747446,0.03530519,0.00009489144,0.000034545228,0.0000058479645,0.0000075502307,0.00001366491,0.000005038234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833953,0.000101378195,0.000319521,0.00058922835,0.00031503427,0.00033528832],"domain_scores_gemma":[0.9986323,0.00017188049,0.00012827394,0.0006930974,0.0002490689,0.00012537613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028033246,0.00021540257,0.00026440225,0.00015859272,0.0004574939,0.000203015,0.00047888904,0.00009856215,0.000011446339],"category_scores_gemma":[0.000014521296,0.00020623088,0.000078244426,0.000983048,0.000055606954,0.00066669896,0.0000371379,0.00039707264,0.0000015160183],"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.00041363502,0.00327292,0.0022568833,0.0032364922,0.0009066495,0.00066032005,0.047404915,0.29619795,0.018690815,0.038914192,0.00033058072,0.5877146],"study_design_scores_gemma":[0.00131696,0.00027072278,0.000505323,0.0007643802,0.00005670683,0.00022741868,0.00067064614,0.7260796,0.26482552,0.0029962182,0.0015662478,0.00072024256],"about_ca_topic_score_codex":0.000043692555,"about_ca_topic_score_gemma":0.00014418153,"teacher_disagreement_score":0.68582106,"about_ca_system_score_codex":0.000023441095,"about_ca_system_score_gemma":0.00013688461,"threshold_uncertainty_score":0.8409851},"labels":[],"label_agreement":null},{"id":"W4206541176","doi":"10.1109/tdsc.2021.3138700","title":"Dataset Characteristics for Reliable Code Authorship Attribution","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software Engineering Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Attribution; Computer science; Coding (social sciences); Source code; Field (mathematics); Robustness (evolution); Code (set theory); Data science; Data mining; Benchmark (surveying); Information retrieval; Set (abstract data type); Artificial intelligence; Programming language","score_opus":0.03607006238654237,"score_gpt":0.2916618682774196,"score_spread":0.2555918058908772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206541176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02467693,0.000100905905,0.97300917,0.00038433133,0.0007775659,0.00016854821,0.0006863444,0.00018983109,0.000006348516],"genre_scores_gemma":[0.9531696,0.000033209482,0.046147823,0.00013045571,0.00008422831,0.000015498497,0.0002254402,0.000019834872,0.00017395258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854535,0.000051581257,0.00023877589,0.00050241605,0.00023778106,0.00042412113],"domain_scores_gemma":[0.9984186,0.000753029,0.00004873564,0.00045326762,0.00017368549,0.00015268198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005016448,0.00015871346,0.00020180564,0.00010610788,0.00044956707,0.00028096486,0.00030516915,0.00011653366,0.000013697178],"category_scores_gemma":[0.00007714914,0.00017293164,0.00005659695,0.00038845398,0.000021737409,0.0002599323,0.000013114781,0.00036963788,0.000016880635],"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.00037159253,0.0022157244,0.0032567703,0.0028574138,0.00087387336,0.0012026591,0.005087922,0.19495767,0.0247669,0.027524022,0.03659662,0.70028883],"study_design_scores_gemma":[0.0009668092,0.00020342079,0.0009783738,0.000181457,0.00003734451,0.00025077767,0.000031106883,0.89973456,0.054964993,0.0005665835,0.041561067,0.00052350236],"about_ca_topic_score_codex":0.000011849776,"about_ca_topic_score_gemma":0.000011078811,"teacher_disagreement_score":0.9284926,"about_ca_system_score_codex":0.000059691698,"about_ca_system_score_gemma":0.00011531672,"threshold_uncertainty_score":0.7051948},"labels":[],"label_agreement":null},{"id":"W4210795501","doi":"10.1109/tdsc.2022.3144991","title":"Enabling Regulatory Compliance and Enforcement in Decentralized Anonymous Payment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","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 Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Cryptocurrency; Anonymity; Enforcement; Computer security; Computer science; Mathematical proof; Payment; Scheme (mathematics); Trusted third party; Internet privacy; Law; World Wide Web","score_opus":0.017490015882048328,"score_gpt":0.24367452065493808,"score_spread":0.22618450477288976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210795501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.291674,0.0007636043,0.70629394,0.0004989631,0.00017642786,0.00031050047,0.000006052981,0.00016439157,0.00011212359],"genre_scores_gemma":[0.9927956,0.00012686456,0.006659099,0.00030706706,0.0000074821114,0.000055541386,0.0000014742785,0.000009399669,0.00003747376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985435,0.00008538768,0.00029158284,0.0005205314,0.00021340296,0.00034560266],"domain_scores_gemma":[0.9993543,0.000096140895,0.00008303972,0.00036380693,0.000024248277,0.000078471145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041912147,0.00016167354,0.00020492978,0.00021773163,0.0008864588,0.000071802155,0.0003473598,0.00006347125,0.000038311384],"category_scores_gemma":[0.0000015743747,0.0001782557,0.00003653243,0.0004595987,0.00005642529,0.00011004368,0.00003904388,0.00047899253,0.0000015597944],"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.000100525845,0.0011170807,0.0009718045,0.00016422544,0.00011991631,0.00014021141,0.008155723,0.16167878,0.0027748283,0.15219925,0.000150185,0.6724275],"study_design_scores_gemma":[0.0018741245,0.0002459746,0.00043543955,0.00006123268,0.000016278367,0.00024010774,0.0008014026,0.9763699,0.006569491,0.005284713,0.007613031,0.00048830523],"about_ca_topic_score_codex":0.000094094175,"about_ca_topic_score_gemma":0.00006292794,"teacher_disagreement_score":0.8146911,"about_ca_system_score_codex":0.00009981443,"about_ca_system_score_gemma":0.00004055276,"threshold_uncertainty_score":0.72690564},"labels":[],"label_agreement":null},{"id":"W4214771680","doi":"10.1109/tdsc.2022.3153759","title":"Towards Efficient and Privacy-Preserving Interval Skyline Queries Over Time Series Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":21,"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":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Skyline; Encryption; Homomorphic encryption; Security analysis; Information privacy; Data mining; Database; Computer security","score_opus":0.019673830660524024,"score_gpt":0.25014859585316107,"score_spread":0.23047476519263704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214771680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060927548,0.0002293583,0.93648064,0.0009482461,0.00059692527,0.00018774609,0.00013793171,0.00021001829,0.00028155706],"genre_scores_gemma":[0.9712871,0.000044512326,0.027622221,0.0002578578,0.00006750863,0.000008147986,0.000044437707,0.000019837697,0.00064838195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983483,0.00010046917,0.0002468947,0.000658982,0.0003397683,0.0003055609],"domain_scores_gemma":[0.9988832,0.00007900639,0.00007761282,0.00084958435,0.000025943355,0.00008466812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053934695,0.00019209819,0.00021074434,0.00015595791,0.00095539994,0.00045807697,0.0013282202,0.000029107852,0.00011930516],"category_scores_gemma":[0.00000826039,0.00019140386,0.000035482124,0.000341171,0.000051304105,0.0008955138,0.0006354056,0.0003237907,0.000005680408],"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.00019985235,0.00090337807,0.00015654898,0.00040382906,0.00047963866,0.000351572,0.009704503,0.12961936,0.0011016645,0.006064841,0.008151985,0.84286284],"study_design_scores_gemma":[0.00039873304,0.00015945689,0.00010773865,0.000032485495,0.000023994917,0.00007548649,0.00020281122,0.9844869,0.00050214323,0.00019608162,0.013562568,0.00025162453],"about_ca_topic_score_codex":0.00009750657,"about_ca_topic_score_gemma":0.000018414608,"teacher_disagreement_score":0.91035956,"about_ca_system_score_codex":0.000029080149,"about_ca_system_score_gemma":0.000035508845,"threshold_uncertainty_score":0.7805223},"labels":[],"label_agreement":null},{"id":"W4226366790","doi":"10.1109/tdsc.2022.3170011","title":"Classifier Calibration: With Application to Threat Scores in Cybersecurity","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","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 Victoria","funders":"","keywords":"Classifier (UML); Computer science; Logistic regression; Artificial intelligence; Calibration; Machine learning; Binary number; Binary classification; Pattern recognition (psychology); Data mining; Statistics; Support vector machine; Mathematics","score_opus":0.008903308616086904,"score_gpt":0.23564501455131684,"score_spread":0.22674170593522994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226366790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03713285,0.000027015623,0.96138,0.0004196771,0.00013429597,0.0004032276,0.000006197854,0.00035227957,0.0001444314],"genre_scores_gemma":[0.96284276,0.0000046037167,0.036578763,0.00036638617,0.000017633756,0.00013117692,0.0000014428628,0.000013486375,0.00004371691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873275,0.000078661644,0.0002031748,0.0004989975,0.0002599327,0.00022651485],"domain_scores_gemma":[0.9994089,0.00008416916,0.00006341021,0.00032243071,0.00003828021,0.00008283119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001961255,0.00014639123,0.00015042642,0.00027027953,0.00055810873,0.000083950086,0.0002865726,0.000040665036,0.000014658382],"category_scores_gemma":[0.0000017938244,0.00014771357,0.000028563973,0.00084544945,0.000022321237,0.00035568414,0.000017760394,0.00039095266,0.0000024346407],"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.00015743995,0.00032228735,0.00040649253,0.000038056372,0.000026229298,0.00006694839,0.0035304357,0.723887,0.0022867024,0.008826098,0.00014195294,0.26031035],"study_design_scores_gemma":[0.0008629349,0.00087956706,0.00041353147,0.000055545228,0.000011740577,0.00027312012,0.00047918703,0.93912935,0.050659142,0.00367668,0.0029462685,0.00061295164],"about_ca_topic_score_codex":0.00013080094,"about_ca_topic_score_gemma":0.00035692396,"teacher_disagreement_score":0.92570996,"about_ca_system_score_codex":0.00011761153,"about_ca_system_score_gemma":0.00004612896,"threshold_uncertainty_score":0.60235846},"labels":[],"label_agreement":null},{"id":"W4237415699","doi":"10.1109/tdsc.2021.3096213","title":"Detecting False Data Injection Attacks in Peer to Peer Energy Trading Using Machine Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Norges Forskningsråd","keywords":"Computer science; Peer-to-peer; Energy (signal processing); Computer security; Artificial intelligence; Computer network","score_opus":0.029732842824567444,"score_gpt":0.2612602721635021,"score_spread":0.23152742933893466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237415699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5077857,0.00032906284,0.4908395,0.0000585583,0.00067951647,0.000052566193,0.000012667575,0.00014087318,0.00010158429],"genre_scores_gemma":[0.9968101,0.00005125177,0.0027474547,0.000062998406,0.00014420963,0.0000022953564,0.00001663666,0.000044433036,0.000120669654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983101,0.000096513555,0.00033441818,0.0004989218,0.00033721118,0.00042283573],"domain_scores_gemma":[0.9992664,0.00018514425,0.00003478896,0.0002839955,0.00009869446,0.00013100174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048573758,0.00023294675,0.0002651896,0.00027721608,0.00047841016,0.00015212307,0.00018282018,0.00014756733,0.000027991919],"category_scores_gemma":[0.000049049595,0.0002644002,0.000049973463,0.0007033549,0.00001799879,0.00031864786,0.000015149837,0.0007615833,0.000003324474],"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.00001371454,0.00003444413,0.00037832296,0.000057297282,0.000032051765,0.00007292949,0.0016908657,0.9635241,0.01114637,0.0000081479975,0.00002363424,0.023018131],"study_design_scores_gemma":[0.00032688706,0.000039209157,0.000060081482,0.00016997464,0.000024698697,0.0002892399,0.00077885785,0.9621387,0.03374483,0.000014059121,0.0021152426,0.0002981984],"about_ca_topic_score_codex":0.00045929395,"about_ca_topic_score_gemma":0.0030801375,"teacher_disagreement_score":0.4890244,"about_ca_system_score_codex":0.00009835596,"about_ca_system_score_gemma":0.00003685286,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W4285070399","doi":"10.1109/tdsc.2022.3171740","title":"Least-Privilege Calls to Amazon Web Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Privilege (computing); Computer science; Cloud computing; Computer security; World Wide Web; Context (archaeology); Database; Operating system","score_opus":0.007378240413672753,"score_gpt":0.22970916153475504,"score_spread":0.2223309211210823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285070399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06965284,0.000061198,0.92774737,0.00042215586,0.0007006195,0.0002851171,0.000021865733,0.00085154845,0.0002572715],"genre_scores_gemma":[0.9621524,0.000011512449,0.036490165,0.0010525278,0.000041715637,0.000047599035,0.0000011302844,0.00002286232,0.000180069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982621,0.00010550734,0.0002672696,0.00061747123,0.00036767634,0.00037994963],"domain_scores_gemma":[0.9991278,0.00011258076,0.000085282314,0.00044456357,0.00006524533,0.0001645362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026990366,0.0002137386,0.00021215335,0.000320286,0.0011032796,0.00014642772,0.0006396016,0.000053015,0.000058874222],"category_scores_gemma":[0.0000019956976,0.00023827422,0.00007642251,0.0007283982,0.000017580167,0.00035505998,0.00005038167,0.0005158887,0.000022780216],"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.00010062701,0.00044526122,0.000064201,0.00015728801,0.00008988996,0.00018054861,0.0048866924,0.46033365,0.027243037,0.002846927,0.0006053368,0.5030466],"study_design_scores_gemma":[0.0008203309,0.0011491623,0.00007076658,0.00009756686,0.000026033063,0.000548813,0.0007125465,0.853663,0.09539794,0.0014711524,0.045076374,0.00096626265],"about_ca_topic_score_codex":0.000073265874,"about_ca_topic_score_gemma":0.000102448714,"teacher_disagreement_score":0.89249957,"about_ca_system_score_codex":0.00010513528,"about_ca_system_score_gemma":0.00004774116,"threshold_uncertainty_score":0.9716541},"labels":[],"label_agreement":null},{"id":"W4292264668","doi":"10.1109/tdsc.2022.3199326","title":"A Comparison of Four Notions of Isomorphism-Based Security for Graphs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Graph homomorphism; Notation; Theoretical computer science; Computer science; Graph; Computational complexity theory; Discrete mathematics; Isomorphism (crystallography); Graph automorphism; Graph property; Adversary; Combinatorics; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.032440064605695824,"score_gpt":0.28622477444507316,"score_spread":0.25378470983937734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292264668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14108998,0.00014839036,0.85741997,0.00016528326,0.00038381005,0.00031359537,0.0003695002,0.000071901995,0.00003757854],"genre_scores_gemma":[0.97414804,0.0000052669197,0.025708709,0.000074807234,0.000010353656,0.000027462069,0.000013637243,0.000010220054,0.0000015267074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.00012401969,0.0004777571,0.0004009583,0.0003311539,0.00026322482],"domain_scores_gemma":[0.9986358,0.00047328894,0.00025784344,0.0004231026,0.0001262764,0.00008367748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043858602,0.00017073519,0.00038373933,0.00036490895,0.0007448713,0.000036037425,0.00049967197,0.000058964757,0.00002817894],"category_scores_gemma":[0.0000062280938,0.00018792384,0.00024573746,0.0008050724,0.00008364399,0.0001721686,0.000017849168,0.00034494375,3.4512738e-7],"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.0008663104,0.009022125,0.0033441097,0.0016488913,0.00063595275,0.000028824072,0.022041405,0.6120437,0.009646621,0.27090397,0.0032890444,0.06652908],"study_design_scores_gemma":[0.0015645113,0.0009835443,0.00014822476,0.000053143707,0.000070402944,0.000023214481,0.00052478706,0.956107,0.027409293,0.011647358,0.0011537242,0.00031478997],"about_ca_topic_score_codex":0.00008551257,"about_ca_topic_score_gemma":0.000053804662,"teacher_disagreement_score":0.83305806,"about_ca_system_score_codex":0.000019715591,"about_ca_system_score_gemma":0.00008519594,"threshold_uncertainty_score":0.7663312},"labels":[],"label_agreement":null},{"id":"W4292971553","doi":"10.1109/tdsc.2022.3200421","title":"Self-Checking Deep Neural Networks for Anomalies and Adversaries in Deployment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Bộ Giáo dục và Ðào tạo; National Research Foundation; Ministry of Education - Singapore; National Research Foundation Singapore; National University of Singapore; Cisco Systems","keywords":"Computer science; Adversarial system; Software deployment; Artificial neural network; Artificial intelligence; Deep neural networks; False alarm; Constant false alarm rate; Machine learning; Domain (mathematical analysis); Margin (machine learning); Software; Data mining; Software engineering","score_opus":0.010293780803748166,"score_gpt":0.23527321206014246,"score_spread":0.2249794312563943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292971553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075247966,0.0004040581,0.92294526,0.0002627082,0.00062353455,0.0002914162,0.00000226219,0.00019048127,0.00003231004],"genre_scores_gemma":[0.9598716,0.00001690796,0.039797775,0.00019936539,0.00004646799,0.000032779513,0.0000015076164,0.000020013198,0.00001362033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851274,0.00015059694,0.00026283544,0.00049163075,0.00019330652,0.00038886027],"domain_scores_gemma":[0.9991897,0.00043100413,0.00009629426,0.00018709454,0.00002618279,0.000069722955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046394923,0.00019267153,0.00022760475,0.00019120595,0.0012366042,0.00017029775,0.00029648948,0.000054330965,0.0000061255614],"category_scores_gemma":[0.0000070480496,0.00021361878,0.000055184904,0.00033249785,0.00003247427,0.00032558796,0.000045224915,0.0005514819,1.8741777e-7],"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.000030265966,0.000048566875,0.0005844286,0.000029397037,0.000023580025,0.00002071139,0.0028033403,0.9425089,0.000007867515,0.0009704583,0.0000033367398,0.052969176],"study_design_scores_gemma":[0.00080395694,0.0001596599,0.00017581791,0.000012930637,0.000018074648,0.000078718804,0.000622348,0.9972519,0.000066258996,0.00021176637,0.0003744535,0.00022406153],"about_ca_topic_score_codex":0.00005665554,"about_ca_topic_score_gemma":0.000089355046,"teacher_disagreement_score":0.8846236,"about_ca_system_score_codex":0.00008617815,"about_ca_system_score_gemma":0.00002520367,"threshold_uncertainty_score":0.9511085},"labels":[],"label_agreement":null},{"id":"W4312335128","doi":"10.1109/tdsc.2022.3216749","title":"Crystal: Enhancing Blockchain Mining Transparency With Quorum Certificate","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Ledger; Certificate; Transparency (behavior); Mathematical proof; Publication; Protocol (science); Theoretical computer science; Business; Medicine; Mathematics; Advertising; Accounting","score_opus":0.021510803081820736,"score_gpt":0.22763578247505784,"score_spread":0.2061249793932371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312335128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2443851,0.00016008195,0.7533836,0.001071634,0.00016803893,0.00022315483,0.0000122453575,0.0004420752,0.00015412539],"genre_scores_gemma":[0.9817036,0.000011482207,0.017822105,0.0002316173,0.000019102094,0.00008323578,0.0000020047332,0.000024623232,0.00010225438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979318,0.00011335119,0.00036770245,0.0007586681,0.00032729606,0.00050121977],"domain_scores_gemma":[0.9989493,0.0001629496,0.00013243014,0.0005861862,0.000052732936,0.00011641454],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045954023,0.00025526935,0.00027010991,0.00028591976,0.0020943338,0.00010766675,0.00067760283,0.00009256084,0.00004218643],"category_scores_gemma":[0.0000018743198,0.0002539945,0.00007221003,0.000888749,0.00007939794,0.00010539766,0.000022041862,0.00071789324,0.00000362816],"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.00021626319,0.0018610628,0.0003588356,0.00023425973,0.00045234722,0.00036119478,0.028696712,0.52548057,0.023422133,0.033731125,0.00038361002,0.38480186],"study_design_scores_gemma":[0.0012641348,0.0007922837,0.0000711111,0.00007692502,0.00006406879,0.00076323736,0.0025359218,0.9495051,0.03840454,0.0015677986,0.004056282,0.00089862756],"about_ca_topic_score_codex":0.00006719228,"about_ca_topic_score_gemma":0.00016069652,"teacher_disagreement_score":0.73731846,"about_ca_system_score_codex":0.0000645628,"about_ca_system_score_gemma":0.00007976855,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W4312438979","doi":"10.1109/tdsc.2022.3217569","title":"Cover Reproducible Steganography via Deep Generative Models","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Steganography; Computer science; Steganalysis; Cover (algebra); Theoretical computer science; Steganography tools; Decoding methods; Cryptography; Embedding; Artificial intelligence; Algorithm; Pattern recognition (psychology); Speech recognition","score_opus":0.01634097675994247,"score_gpt":0.2320379466060755,"score_spread":0.215696969846133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312438979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011187153,0.00034175988,0.9862312,0.00017955243,0.0005240651,0.00026518898,0.000010974367,0.00053875544,0.0007213184],"genre_scores_gemma":[0.91882765,0.000046922785,0.08050444,0.00043354052,0.000034885565,0.000039771687,0.0000027204383,0.000019503203,0.00009057106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979401,0.00018761161,0.0002923693,0.00083418697,0.0003489124,0.00039681362],"domain_scores_gemma":[0.99898803,0.00009649378,0.000114460585,0.0006363549,0.00006544656,0.00009922977],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00043317504,0.00024326638,0.00024022249,0.00037564526,0.0017050895,0.00015287906,0.0005366677,0.000058873913,0.00002233831],"category_scores_gemma":[0.0000011033145,0.00024830797,0.00014885025,0.0008746044,0.000052968557,0.0006445868,0.000034235527,0.0005672628,0.0000026462728],"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.00005345001,0.00025903046,0.000024766594,0.000027763155,0.000101753416,0.00006644863,0.003855535,0.8913401,0.0015783352,0.0057746745,0.0002483229,0.09666984],"study_design_scores_gemma":[0.00037988627,0.0003373959,0.000007641029,0.000018607625,0.000019006191,0.00017702093,0.00010480034,0.94364935,0.030883566,0.02228325,0.0017271425,0.00041231167],"about_ca_topic_score_codex":0.000027274129,"about_ca_topic_score_gemma":0.000006690788,"teacher_disagreement_score":0.9076405,"about_ca_system_score_codex":0.000043001826,"about_ca_system_score_gemma":0.000030598774,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4312617070","doi":"10.1109/tdsc.2022.3227650","title":"Multi-Client Boolean File Retrieval With Adaptable Authorization Switching for Secure Cloud Search Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Program of Shanghai Academic Research Leader; Shanghai Rising-Star Program; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Cloud storage; Initialization; Database; Theoretical computer science; Operating system; Programming language","score_opus":0.016528263604722256,"score_gpt":0.24141054355497776,"score_spread":0.2248822799502555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312617070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0548569,0.00014037282,0.94290715,0.00014973962,0.00060435076,0.00051807024,0.00054029387,0.0002469023,0.000036228474],"genre_scores_gemma":[0.9282238,0.00001409476,0.071307704,0.00018238788,0.0000826395,0.000028211198,0.00009976053,0.000027176822,0.000034257762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977382,0.00015273818,0.00031006776,0.0007752161,0.00050065375,0.00052315934],"domain_scores_gemma":[0.9988738,0.00028416244,0.00012741206,0.0004282256,0.00011940686,0.00016702893],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006378732,0.00026073065,0.00025730187,0.0002550122,0.0025322912,0.0003536524,0.0005917257,0.000081177146,0.00010836134],"category_scores_gemma":[0.0000031476031,0.00025490514,0.00010815499,0.00091009046,0.000027116861,0.00056255737,0.00004193866,0.0006573566,0.000002892595],"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.0015582104,0.002410707,0.0002504591,0.001120684,0.0005298657,0.00013255441,0.0418454,0.8427099,0.005514512,0.027828434,0.0016050986,0.07449416],"study_design_scores_gemma":[0.0012977725,0.0006425326,0.000057380643,0.00007967709,0.000036062356,0.00008853104,0.0017489723,0.9869973,0.0029387875,0.00029900184,0.005423744,0.0003902459],"about_ca_topic_score_codex":0.0001705815,"about_ca_topic_score_gemma":0.00017882553,"teacher_disagreement_score":0.8733669,"about_ca_system_score_codex":0.00006471459,"about_ca_system_score_gemma":0.000103330996,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W4313025490","doi":"10.1109/tdsc.2022.3211870","title":"PRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over Encrypted Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Cloud computing; Query optimization; Information privacy; Data mining; Information retrieval; Computer security","score_opus":0.023735008290448337,"score_gpt":0.25276980778736413,"score_spread":0.2290347994969158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313025490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20260279,0.0003812572,0.7954225,0.0003028305,0.0005700665,0.00023561134,0.00016847673,0.00019008569,0.00012641658],"genre_scores_gemma":[0.9833099,0.000062229,0.01618028,0.00034331335,0.00004271375,0.000008168101,0.000025994474,0.000015049992,0.000012329364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977221,0.00020228534,0.0003106821,0.00092533836,0.0004332218,0.00040635475],"domain_scores_gemma":[0.9980629,0.00028728577,0.000111320216,0.0013361588,0.000037368052,0.00016494033],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007344755,0.00022991485,0.00023964098,0.00025099827,0.0015164553,0.00028087143,0.0013587624,0.000063307474,0.00009106056],"category_scores_gemma":[0.000014484433,0.00024251762,0.000061510094,0.0007048546,0.000059637372,0.00056358834,0.00037232327,0.0006469829,0.0000029892774],"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.00083993113,0.0055458103,0.0027047903,0.0014269007,0.0012386537,0.0013911859,0.049949087,0.31115568,0.009641166,0.07002039,0.03087278,0.5152136],"study_design_scores_gemma":[0.00082289387,0.00013791052,0.00034504646,0.00005217385,0.00003682547,0.00018667967,0.00036903546,0.98446673,0.00048259945,0.000684903,0.01201757,0.0003976279],"about_ca_topic_score_codex":0.00026438228,"about_ca_topic_score_gemma":0.000055547967,"teacher_disagreement_score":0.7807071,"about_ca_system_score_codex":0.000035782847,"about_ca_system_score_gemma":0.00006877515,"threshold_uncertainty_score":0.99978346},"labels":[],"label_agreement":null},{"id":"W4319303304","doi":"10.1109/tdsc.2023.3242653","title":"Hybrid Knowledge and Data Driven Synthesis of Runtime Monitors for Cyber-Physical Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":22,"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":"National Science Foundation of Sri Lanka; Commonwealth of Virginia","keywords":"Computer science; Cyber-physical system; Distributed computing; Computer security; Embedded system; Operating system","score_opus":0.022300808855211143,"score_gpt":0.27854898588577637,"score_spread":0.25624817703056524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319303304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39429322,0.00021678822,0.6040604,0.00013118138,0.0006070978,0.0002800811,0.00011181549,0.0002016198,0.000097799755],"genre_scores_gemma":[0.99719125,0.00004236684,0.0025479663,0.000022516817,0.00012582059,0.0000148777035,0.000009577921,0.000018432384,0.000027175352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986108,0.00007244129,0.00025285975,0.00058728736,0.00017221118,0.0003043958],"domain_scores_gemma":[0.9981486,0.0009895841,0.000095158495,0.0005822193,0.00007969952,0.00010469728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684455,0.0001919491,0.00032404446,0.00022491005,0.00037681925,0.00012723274,0.0006937877,0.00005367051,6.6767427e-7],"category_scores_gemma":[0.0000042936404,0.00017250761,0.000060023627,0.00041510013,0.000037233982,0.00028879897,0.000050457606,0.00016110495,0.000007761584],"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.00017803625,0.0011642396,0.00048748188,0.0040270016,0.0011855046,0.000080274265,0.023647297,0.2067287,0.008818203,0.0069861454,0.0011098324,0.7455873],"study_design_scores_gemma":[0.0002839494,0.000097312906,0.00009464843,0.00020164755,0.000061685234,0.000028685201,0.0002517363,0.9867121,0.011004931,0.00019072341,0.00087875803,0.00019382671],"about_ca_topic_score_codex":0.00013973736,"about_ca_topic_score_gemma":0.00004091661,"teacher_disagreement_score":0.7799834,"about_ca_system_score_codex":0.00000973774,"about_ca_system_score_gemma":0.000039653252,"threshold_uncertainty_score":0.70346564},"labels":[],"label_agreement":null},{"id":"W4319866023","doi":"10.1109/tdsc.2023.3241057","title":"Heterogeneous Differential-Private Federated Learning: Trading Privacy for Utility Truthfully","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Differential privacy; Incentive; Computer science; Private information retrieval; Information privacy; Incentive compatibility; Computer security; Internet privacy; Microeconomics; Data mining; Economics","score_opus":0.038413757963862885,"score_gpt":0.2757849288548905,"score_spread":0.2373711708910276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319866023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29402572,0.00003508998,0.7018098,0.0012318396,0.0005828638,0.0003177435,0.000021719025,0.0019403112,0.000034860528],"genre_scores_gemma":[0.9697984,0.000051093033,0.029914308,0.0000537228,0.000041707845,0.000028483551,0.000017287826,0.00003693268,0.000058100904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974169,0.00012998753,0.00043729393,0.00096949557,0.00029868764,0.000747625],"domain_scores_gemma":[0.99719,0.000626061,0.00014322411,0.0018254602,0.000078472454,0.00013678268],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047787227,0.0003378197,0.0003747157,0.00033920605,0.0013717796,0.00054116006,0.0044745044,0.00022029328,0.000018378933],"category_scores_gemma":[0.00057765254,0.00034129713,0.00015137343,0.00084891834,0.00007397835,0.00040541208,0.0007326482,0.0006310852,0.000018590155],"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.00023792057,0.0005524864,0.0003646056,0.000617045,0.0006133043,0.00023515876,0.0017781192,0.026782706,0.01899735,0.0011210352,0.0105139185,0.93818635],"study_design_scores_gemma":[0.0006594879,0.00017964448,0.00008812105,0.000067047215,0.000021285896,0.00005516885,0.000039160695,0.9480657,0.04063316,0.008799338,0.0010488534,0.0003430382],"about_ca_topic_score_codex":0.000017376107,"about_ca_topic_score_gemma":0.000009540379,"teacher_disagreement_score":0.9378433,"about_ca_system_score_codex":0.000058763293,"about_ca_system_score_gemma":0.000047323836,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W4323519519","doi":"10.1109/tdsc.2023.3253786","title":"Multi-Client Secure and Efficient DPF-Based Keyword Search for Cloud Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Bloom filter; Encryption; Server; Cloud computing; Computer network; Cloud storage; Hash function; Distributed computing; Computer security","score_opus":0.028521564702901975,"score_gpt":0.27460165775526607,"score_spread":0.24608009305236409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323519519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26178524,0.00013989833,0.7363454,0.0002458938,0.000649307,0.00039498642,0.00010635366,0.0003180713,0.000014871771],"genre_scores_gemma":[0.97052985,0.000038377035,0.029107077,0.00017898832,0.00007008273,0.000021381675,0.000017369046,0.000021837473,0.000015043178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789727,0.000104149316,0.00029753338,0.0007862737,0.00032406487,0.00059070386],"domain_scores_gemma":[0.9986341,0.0005161116,0.00006674923,0.00044720413,0.00010205246,0.00023375971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072156166,0.00026839986,0.00027310682,0.0003917125,0.0010177261,0.00030697166,0.00038167127,0.00013741001,0.000007091997],"category_scores_gemma":[0.0000070758388,0.00026147056,0.00013997014,0.0009366655,0.00008717357,0.00016813043,0.000023417275,0.00040666864,0.00001242837],"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.00026996617,0.0013427642,0.00023713573,0.00088880624,0.00021359128,0.00015204451,0.013740659,0.8472229,0.0029765344,0.012578954,0.0012587563,0.11911788],"study_design_scores_gemma":[0.0014317036,0.000211731,0.00020556999,0.000083951316,0.000022086913,0.000018800822,0.00026774136,0.99155873,0.00415536,0.00012614773,0.0016019662,0.00031619097],"about_ca_topic_score_codex":0.0000504044,"about_ca_topic_score_gemma":0.00006347501,"teacher_disagreement_score":0.70874465,"about_ca_system_score_codex":0.000030256584,"about_ca_system_score_gemma":0.00007111459,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W4362496259","doi":"10.1109/tdsc.2023.3263974","title":"Efficient and Accurate Cloud-Assisted Medical Pre-Diagnosis With Privacy Preservation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Encryption; Computer science; Cloud computing; Server; Mahalanobis distance; Tree (set theory); Theoretical computer science; Metric (unit); Data mining; Information retrieval; Algorithm; Artificial intelligence; Mathematics; Computer security; World Wide Web; Combinatorics","score_opus":0.02045732974857327,"score_gpt":0.26307866519701295,"score_spread":0.24262133544843967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362496259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4319866,0.00006504878,0.56672466,0.0005511868,0.00020658893,0.0001630547,0.000012174362,0.0002623575,0.000028323053],"genre_scores_gemma":[0.99412626,0.0001302638,0.005489832,0.0001515244,0.000049541566,0.000024240919,0.0000076677225,0.000012569795,0.000008129245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982118,0.00010140677,0.000264863,0.000575192,0.00048883766,0.00035792575],"domain_scores_gemma":[0.99878484,0.00045924887,0.00008424695,0.00037955845,0.00007177838,0.0002203364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048903725,0.0001999898,0.0002064844,0.0002354072,0.00061263016,0.00026942528,0.00038423983,0.0001221091,0.000016384722],"category_scores_gemma":[0.000020016287,0.00016847404,0.000049456037,0.0011196162,0.00007716418,0.00031395463,0.000030452351,0.00035663333,0.000007253328],"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.000502281,0.0018417722,0.0057853,0.00088582974,0.0005941824,0.00062819116,0.022630101,0.20320162,0.000450728,0.026425848,0.0025862975,0.73446786],"study_design_scores_gemma":[0.0009606237,0.00023420993,0.0069449134,0.000204702,0.000029105888,0.000110400746,0.00009345584,0.98845565,0.0010561942,0.00040782284,0.0012035458,0.00029934561],"about_ca_topic_score_codex":0.000093622635,"about_ca_topic_score_gemma":0.000111469715,"teacher_disagreement_score":0.78525406,"about_ca_system_score_codex":0.000015088075,"about_ca_system_score_gemma":0.00006717545,"threshold_uncertainty_score":0.6870172},"labels":[],"label_agreement":null},{"id":"W4380607095","doi":"10.1109/tdsc.2023.3285590","title":"Multi-Modality Ensemble Distortion for Spatial Steganography With Dynamic Cost Correction","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","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 Victoria","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Pixel; Distortion (music); Steganalysis; Steganography; Computer science; Artificial intelligence; Embedding; Algorithm; Pattern recognition (psychology); Computer vision; Telecommunications","score_opus":0.01697473529321391,"score_gpt":0.2669819941858309,"score_spread":0.250007258892617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380607095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026745258,0.000025637564,0.97056055,0.00012937833,0.0008992226,0.00056463364,0.00001705222,0.001036349,0.00002191984],"genre_scores_gemma":[0.9560291,0.000042234897,0.04368819,0.000044566903,0.00002407952,0.000065388034,0.000013444211,0.000020295443,0.00007269799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998622,0.00006161142,0.00023647158,0.0005227852,0.0001860315,0.00037108897],"domain_scores_gemma":[0.9992426,0.0001697841,0.00011020986,0.00029453446,0.00009545264,0.000087427026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027987888,0.00021504791,0.00020582009,0.00028580657,0.0008121988,0.00014090666,0.00021978565,0.000102464146,7.95337e-7],"category_scores_gemma":[0.000003072003,0.00019429243,0.00011310555,0.0006131188,0.000055456392,0.00038796695,0.000006067351,0.00024563176,0.0000021131248],"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.0003217011,0.00034327531,0.00046656828,0.00017817583,0.00014151716,0.0000330991,0.0022272528,0.09477913,0.0043621226,0.00027974643,0.0001944083,0.896673],"study_design_scores_gemma":[0.0007678897,0.00035692536,0.0008389738,0.00011076126,0.000026405032,0.000040081017,0.000060280552,0.9753353,0.020873642,0.0006392521,0.0006300407,0.0003204682],"about_ca_topic_score_codex":0.00009031523,"about_ca_topic_score_gemma":0.00043645615,"teacher_disagreement_score":0.92928386,"about_ca_system_score_codex":0.00004247325,"about_ca_system_score_gemma":0.000027303153,"threshold_uncertainty_score":0.79230154},"labels":[],"label_agreement":null},{"id":"W4382999347","doi":"10.1109/tdsc.2023.3291715","title":"PHRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over High-Dimensional Data in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Query optimization; Homomorphic encryption; Scheme (mathematics); Range query (database); Information privacy; Outsourcing; Big data; Sargable; Data mining; Private information retrieval; Web search query; Information retrieval; Computer security; Search engine; Mathematics","score_opus":0.023675178659607516,"score_gpt":0.2630985343970592,"score_spread":0.2394233557374517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382999347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5305242,0.00014006745,0.4679108,0.00035398986,0.00063382747,0.00015159285,0.00008128166,0.00017893249,0.000025353751],"genre_scores_gemma":[0.99097914,0.00008509878,0.00860686,0.00020430729,0.00006719114,0.0000031135974,0.000031343054,0.000013397509,0.0000095803925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792033,0.00012049191,0.00032109293,0.00085778954,0.00034464267,0.0004356388],"domain_scores_gemma":[0.99831307,0.00040252277,0.000073322924,0.0010320602,0.000034168093,0.00014487412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160754,0.00021734927,0.00024907233,0.00037882538,0.00046110715,0.00020909705,0.00082677347,0.000109828165,0.000020275278],"category_scores_gemma":[0.000020516716,0.00021660133,0.000046073175,0.001050193,0.000060609666,0.0005392211,0.00020419233,0.0004567523,0.000013632945],"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.00062976684,0.002890144,0.0046564196,0.0014869096,0.00061045255,0.0022286351,0.021757025,0.57143855,0.0073152687,0.055587377,0.026935717,0.3044637],"study_design_scores_gemma":[0.0008885427,0.000052733398,0.002173986,0.00017263439,0.000015736034,0.00005142897,0.000095953415,0.9934218,0.0005025471,0.0012186563,0.0010962979,0.00030968754],"about_ca_topic_score_codex":0.0005400105,"about_ca_topic_score_gemma":0.0002646889,"teacher_disagreement_score":0.46045494,"about_ca_system_score_codex":0.000022573746,"about_ca_system_score_gemma":0.00005277914,"threshold_uncertainty_score":0.88327456},"labels":[],"label_agreement":null},{"id":"W4385322377","doi":"10.1109/tdsc.2023.3299522","title":"False Data Detector for Electrical Vehicles Temporal-Spatial Charging Coordination Secure Against Evasion and Privacy Adversarial Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","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":"Brandon University","funders":"","keywords":"Computer science; Detector; Robustness (evolution); Evasion (ethics); Computer security; Deep learning; Adversarial system; Artificial intelligence; Data mining; Real-time computing; Machine learning; Telecommunications","score_opus":0.03240345502596371,"score_gpt":0.292634949808259,"score_spread":0.2602314947822953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385322377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18105398,0.00007545473,0.816673,0.0005613421,0.0007410786,0.00044060012,0.000028669618,0.00041586178,0.000010005004],"genre_scores_gemma":[0.98081213,0.000045339137,0.01861581,0.00009528964,0.00028856823,0.000013230629,0.00005587722,0.000037050806,0.00003668924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976046,0.00017150737,0.00038656627,0.00094861916,0.00036804483,0.0005206466],"domain_scores_gemma":[0.9982485,0.00077647506,0.00017539308,0.0005457414,0.00010300416,0.00015085281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088474015,0.0002939917,0.0003281013,0.00034906727,0.001166665,0.0003145766,0.0007059326,0.00019502206,0.0000030690755],"category_scores_gemma":[0.00011454049,0.000298389,0.000071136434,0.0006853804,0.00004714077,0.0007970548,0.00008748777,0.0005744339,0.000006123351],"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.00022286431,0.00012853982,0.00051433756,0.00021182558,0.00013754546,0.00005664343,0.0031673359,0.18141434,0.0050774273,0.00055209233,0.000496623,0.8080204],"study_design_scores_gemma":[0.0014830092,0.00016006645,0.00021768661,0.000094725576,0.00003655017,0.000022236245,0.00007998252,0.9941326,0.0017829165,0.00023454944,0.001424374,0.00033134347],"about_ca_topic_score_codex":0.00008876906,"about_ca_topic_score_gemma":0.00006423701,"teacher_disagreement_score":0.8127182,"about_ca_system_score_codex":0.00006978318,"about_ca_system_score_gemma":0.000095758165,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W4386174973","doi":"10.1109/tdsc.2023.3308848","title":"Fast-HotStuff: A Fast and Robust BFT Protocol for Blockchains","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Byzantine fault tolerance; Computer network; Distributed computing; Protocol (science); Throughput; Robustness (evolution); Fault tolerance; Parallel computing; Telecommunications; Wireless","score_opus":0.03179252942926588,"score_gpt":0.2848214308757208,"score_spread":0.25302890144645496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386174973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039240597,0.000011827713,0.9781887,0.00032224628,0.00030266424,0.016621795,0.00005310523,0.00039288882,0.00018272431],"genre_scores_gemma":[0.96515733,0.000005937027,0.014188867,0.0001954806,0.00016400305,0.01936973,0.000005817042,0.000040983432,0.0008718754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983443,0.000048678365,0.00032512634,0.0005989703,0.00021616819,0.00046673082],"domain_scores_gemma":[0.9991817,0.00017279724,0.00009679518,0.00029830562,0.000096970674,0.00015347061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356764,0.00023497391,0.0002784999,0.00016768528,0.000730994,0.0003297583,0.00029142483,0.00011281786,0.000004235181],"category_scores_gemma":[0.000004904276,0.00021758876,0.00008391387,0.00056033075,0.0000403157,0.00022678947,0.000012344815,0.00023048316,0.00001192714],"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.0001420502,0.00041679194,0.00012616804,0.0010739772,0.00019025672,0.000105725914,0.0059489277,0.43805707,0.0011242582,0.0052331323,0.004514282,0.54306734],"study_design_scores_gemma":[0.0014591207,0.00021585917,0.00009203055,0.00019283788,0.000009839338,0.00007388339,0.00023979595,0.9886672,0.0009486565,0.0001713534,0.0076321987,0.00029726294],"about_ca_topic_score_codex":0.000034154804,"about_ca_topic_score_gemma":0.000055115317,"teacher_disagreement_score":0.9639998,"about_ca_system_score_codex":0.000022578895,"about_ca_system_score_gemma":0.000048328926,"threshold_uncertainty_score":0.88730127},"labels":[],"label_agreement":null},{"id":"W4386736466","doi":"10.1109/tdsc.2023.3315457","title":"SwiftParade: Anti-Burst Multipath Validation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Network packet; Multipath propagation; Overhead (engineering); Computer network; Encryption; Network topology; Reliability (semiconductor); Distributed computing; Algorithm; Channel (broadcasting)","score_opus":0.018848902036462726,"score_gpt":0.2532331007049002,"score_spread":0.23438419866843746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386736466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101405546,0.000059448063,0.89656866,0.0003056732,0.00069168996,0.000107372354,0.0000028486763,0.0006647554,0.00019398965],"genre_scores_gemma":[0.9858488,0.00009562445,0.0136475535,0.00010053799,0.000076072385,0.0000047770354,0.0000073431943,0.000016924632,0.00020235544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00006711731,0.00022625377,0.0004443888,0.00022968672,0.00033421983],"domain_scores_gemma":[0.99935365,0.0001495505,0.00008221994,0.00025267393,0.000067693596,0.00009421804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217254,0.00016691064,0.00016730592,0.00022886832,0.0006874609,0.00031658006,0.00025021067,0.00009413834,0.000005501616],"category_scores_gemma":[0.000005341388,0.00016592913,0.000052155192,0.0010159606,0.000026580321,0.00045353046,0.000006791517,0.00023322488,0.000059875536],"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.000006504706,0.00006774451,0.00012106701,0.000046036967,0.000024418787,0.000025417774,0.0012542746,0.86000156,0.00040852625,0.00053717295,0.0002881066,0.13721916],"study_design_scores_gemma":[0.00034507635,0.000049450828,0.00017544963,0.00007637567,0.000011575317,0.000030323821,0.000055216566,0.9912039,0.007192327,0.00028332823,0.00037005608,0.00020691167],"about_ca_topic_score_codex":0.00001370878,"about_ca_topic_score_gemma":0.0000049958076,"teacher_disagreement_score":0.8844433,"about_ca_system_score_codex":0.000022363192,"about_ca_system_score_gemma":0.000039839975,"threshold_uncertainty_score":0.6766394},"labels":[],"label_agreement":null},{"id":"W4387010279","doi":"10.1109/tdsc.2023.3317806","title":"iCAT+: An Interactive Customizable Anonymization Tool Using Automated Translation Through Deep Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Usability; Artificial intelligence; Information retrieval; Convolutional neural network; Data mining; Human–computer interaction","score_opus":0.03981700160834613,"score_gpt":0.3062175476504594,"score_spread":0.2664005460421133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387010279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1211881,0.00005053898,0.87272257,0.00046405345,0.00044117557,0.00023737416,0.000007739383,0.0047871005,0.000101337166],"genre_scores_gemma":[0.7953224,0.000054517343,0.20447654,0.000049631126,0.000027602488,0.000006795043,0.000021292723,0.000028000617,0.000013208375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788994,0.00021102397,0.00037691242,0.0007422495,0.00029867934,0.00048120198],"domain_scores_gemma":[0.9979014,0.00034428504,0.00016154749,0.0014263358,0.0001025704,0.00006385712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046037327,0.00025887822,0.00025931813,0.00036723612,0.000922467,0.00038242867,0.0025348584,0.00020702925,0.000014413017],"category_scores_gemma":[0.00021623107,0.0002769275,0.00006361838,0.0015027891,0.000056422894,0.002369662,0.00028602776,0.0006079977,0.000028439526],"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.000038964114,0.00011875998,0.000049928298,0.000058013728,0.00007819527,0.000041077343,0.0026722879,0.78936845,0.00752845,0.0001739094,0.00030174642,0.19957022],"study_design_scores_gemma":[0.00047439014,0.00010625891,0.000044355616,0.00008685001,0.000022649965,0.000052728243,0.00030127107,0.9858192,0.009766888,0.0028203428,0.00019900245,0.00030607096],"about_ca_topic_score_codex":0.00012868518,"about_ca_topic_score_gemma":0.00003090092,"teacher_disagreement_score":0.6741343,"about_ca_system_score_codex":0.000101976715,"about_ca_system_score_gemma":0.00005202475,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W4388407494","doi":"10.1109/tdsc.2023.3326299","title":"Data Protection: Privacy-Preserving Data Collection With Validation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data collection; Data mining; Protocol (science); Information privacy; Cluster analysis; Provisioning; Data modeling; Data transformation; Inference; Autoencoder; Computer security; Machine learning; Artificial intelligence; Database; Computer network; Deep learning; Data warehouse","score_opus":0.09132404626674043,"score_gpt":0.29774077192926796,"score_spread":0.20641672566252753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388407494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018705957,0.000049091104,0.9700935,0.0074244747,0.00062166667,0.0005306061,0.000130744,0.0023120784,0.00013191151],"genre_scores_gemma":[0.82689965,0.00012913176,0.17243654,0.00006620187,0.000081548744,0.000024768067,0.00020693018,0.000039356073,0.00011586089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702644,0.0001437349,0.00035446024,0.0014544105,0.00052107155,0.0004998887],"domain_scores_gemma":[0.9866646,0.00028410982,0.00016623296,0.0126864035,0.0001035036,0.000095179006],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011054894,0.0002748039,0.00024959262,0.0004512936,0.0011104876,0.00056928257,0.019703414,0.00016898267,0.000014745961],"category_scores_gemma":[0.00074483413,0.00025718092,0.000023809878,0.0023999906,0.00007225501,0.0026638976,0.0068759867,0.0006439999,0.000042564443],"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.00027021213,0.0006284491,0.0004639356,0.0007292228,0.0007318609,0.00034903223,0.0013820445,0.043860618,0.004163698,0.0004418666,0.21959087,0.7273882],"study_design_scores_gemma":[0.00047794185,0.00013690925,0.00009900699,0.0001457012,0.00002829066,0.00014644343,0.00008942455,0.9872087,0.005607332,0.002586221,0.0031575055,0.00031649892],"about_ca_topic_score_codex":0.00017605684,"about_ca_topic_score_gemma":0.0001288181,"teacher_disagreement_score":0.9433481,"about_ca_system_score_codex":0.000067012894,"about_ca_system_score_gemma":0.00012983936,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W4390818924","doi":"10.1109/tdsc.2024.3353548","title":"TrustGuard: GNN-Based Robust and Explainable Trust Evaluation With Dynamicity Support","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Snapshot (computer storage); Aggregate (composite); Graph; Visualization; Layer (electronics); Web of trust; Data mining; Artificial intelligence; Machine learning; Computational trust; Theoretical computer science; Reputation; Database","score_opus":0.01519607042946472,"score_gpt":0.24454544670838999,"score_spread":0.22934937627892527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390818924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10193324,0.00030162843,0.89614165,0.00030383642,0.00041283038,0.00033771867,0.0000072481075,0.00033874047,0.00022312505],"genre_scores_gemma":[0.975674,0.00002833177,0.023941673,0.00017730147,0.000041291834,0.000018542762,0.000004740637,0.000025840189,0.0000882821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981153,0.00009841919,0.0002459439,0.0007372328,0.0003965076,0.00040657664],"domain_scores_gemma":[0.9991381,0.0002567316,0.00005809542,0.00030891338,0.00009808861,0.0001400574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004521134,0.00026784613,0.00022931473,0.00025227314,0.00053900684,0.00039996646,0.0002115858,0.00010471125,0.000025078989],"category_scores_gemma":[0.000003475716,0.00023151608,0.00005878095,0.0006709752,0.00007321144,0.00065243384,0.0000065960544,0.00046514452,0.000004986039],"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.00003724574,0.000054091597,0.00005619694,0.000103405444,0.000043776537,0.00010235934,0.00045469872,0.82273394,0.00011778543,0.00085737836,0.000059682716,0.17537944],"study_design_scores_gemma":[0.00057409937,0.00030579764,0.00008266443,0.00015306972,0.00005620613,0.000178672,0.00007723668,0.99589306,0.0016051051,0.0005085482,0.0002790122,0.00028651644],"about_ca_topic_score_codex":0.000030588984,"about_ca_topic_score_gemma":0.00008479079,"teacher_disagreement_score":0.87374073,"about_ca_system_score_codex":0.00007675513,"about_ca_system_score_gemma":0.00012842019,"threshold_uncertainty_score":0.9440952},"labels":[],"label_agreement":null},{"id":"W4390871494","doi":"10.1109/tdsc.2024.3353827","title":"Privacy-Preserving Anomaly Detection of Encrypted Smart Contract for Blockchain-Based Data Trading","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Smart contract; Overhead (engineering); Database transaction; Code (set theory); Homomorphic encryption; Blockchain; Computer security; Data mining; Set (abstract data type); Database; Programming language","score_opus":0.025544119889675063,"score_gpt":0.2663804616594111,"score_spread":0.24083634176973603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390871494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24293126,0.00052310905,0.75497097,0.00042912242,0.000303057,0.00036724235,0.000048041038,0.0003975676,0.000029635019],"genre_scores_gemma":[0.972744,0.000010505563,0.027077606,0.00006272985,0.000040365423,0.000029072575,0.0000049397113,0.000020405087,0.000010403465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982927,0.000056648525,0.00040527407,0.0007437498,0.00017500237,0.0003266348],"domain_scores_gemma":[0.99802583,0.00073111703,0.00010266633,0.00097163976,0.000090846166,0.00007788477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066515425,0.00020807536,0.0002728225,0.0003471829,0.000478333,0.00014569139,0.0010282062,0.00019642766,0.000007664269],"category_scores_gemma":[0.000022842201,0.00020966372,0.00009727082,0.0006507939,0.00006574064,0.000117556934,0.00002701959,0.0004051525,0.0000016295336],"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.000109801455,0.0006181015,0.000089261244,0.0012654241,0.00043939176,0.00003875965,0.0022684298,0.029199054,0.08041491,0.012568914,0.0001551532,0.8728328],"study_design_scores_gemma":[0.0003806668,0.00013030418,0.000026975262,0.00014333904,0.0000457184,0.00003453142,0.000033199944,0.91559345,0.08135062,0.0012690101,0.00080337137,0.00018882276],"about_ca_topic_score_codex":0.00010878307,"about_ca_topic_score_gemma":0.00011091156,"teacher_disagreement_score":0.8863944,"about_ca_system_score_codex":0.000036336223,"about_ca_system_score_gemma":0.00009709079,"threshold_uncertainty_score":0.85498387},"labels":[],"label_agreement":null},{"id":"W4391620895","doi":"10.1109/tdsc.2024.3363507","title":"Data Poisoning Attacks and Defenses to LDP-Based Privacy-Preserving Crowdsensing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Xiangtan University; National Natural Science Foundation of China","keywords":"Computer science; Differential privacy; Crowdsensing; Computer security; Minification; Identification (biology); Optimization problem; Data mining; Algorithm","score_opus":0.03444357905367922,"score_gpt":0.28811418574858044,"score_spread":0.2536706066949012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391620895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20673068,0.0007149249,0.7900256,0.0009870027,0.0006801812,0.00017015045,0.000016599763,0.00052126125,0.00015360242],"genre_scores_gemma":[0.93935025,0.00001820666,0.059963305,0.0004579754,0.00009170583,0.000002113697,0.000004019137,0.000039109145,0.00007329764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750423,0.00011401822,0.00036067443,0.0011586626,0.00031110502,0.0005512761],"domain_scores_gemma":[0.99781257,0.0007186711,0.00005371362,0.0010871614,0.00007082036,0.00025709317],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006782611,0.0003190249,0.00029927,0.0003615333,0.00093429815,0.0016401506,0.0007047958,0.00011784777,0.000007305474],"category_scores_gemma":[0.000042302916,0.0003160551,0.000063662046,0.0006453452,0.000052654406,0.00065065763,0.00010059586,0.0005278495,0.000015287093],"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.000047012123,0.00011750084,0.00013973196,0.00071774627,0.0001915328,0.0005804507,0.006830469,0.2029941,0.013886452,0.00078935,0.0019636902,0.771742],"study_design_scores_gemma":[0.00022765274,0.00008720641,0.00005555486,0.00093263347,0.000040299386,0.0002725774,0.0001653159,0.9854626,0.008243939,0.000111540074,0.0040082484,0.0003923978],"about_ca_topic_score_codex":0.00013621067,"about_ca_topic_score_gemma":0.00010572379,"teacher_disagreement_score":0.78246856,"about_ca_system_score_codex":0.000045070865,"about_ca_system_score_gemma":0.000110071276,"threshold_uncertainty_score":0.99992913},"labels":[],"label_agreement":null},{"id":"W4392406098","doi":"10.1109/tdsc.2024.3372848","title":"Refereed Delegation of Computation Using Smart Contracts","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delegation; Computer science; Computation; Computer security; Programming language","score_opus":0.01964615092891232,"score_gpt":0.2650183053213561,"score_spread":0.2453721543924438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392406098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25323647,0.00035690924,0.7454421,0.00015281292,0.0003261585,0.00014111376,0.0000049281953,0.00021276828,0.00012671987],"genre_scores_gemma":[0.96244764,0.00002678295,0.03741848,0.00004964809,0.00002706147,0.0000034224825,0.0000017355682,0.000011013032,0.000014233087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998922,0.000053186846,0.0003060714,0.00033343153,0.00016252167,0.00022281865],"domain_scores_gemma":[0.99933136,0.00023133037,0.000077543205,0.00021095149,0.000086545246,0.00006225802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033598804,0.00014134578,0.0001851173,0.0002743439,0.00024784385,0.0001035773,0.00018462392,0.00014766926,0.0000039930624],"category_scores_gemma":[0.000004361807,0.0001414141,0.000060797178,0.0005756667,0.000054055396,0.0003234099,0.0000063697603,0.00031880772,0.0000070920673],"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.000034328314,0.0005541322,0.00011643517,0.00041767416,0.00029733687,0.000033544806,0.00449509,0.11149705,0.026682496,0.15893203,0.00017648589,0.6967634],"study_design_scores_gemma":[0.00017904115,0.000060071197,0.000067797104,0.00010885282,0.000024446654,0.0000854331,0.000058088262,0.97219133,0.024239268,0.0025652703,0.0002778577,0.0001425619],"about_ca_topic_score_codex":0.0000670383,"about_ca_topic_score_gemma":0.000016355649,"teacher_disagreement_score":0.8606942,"about_ca_system_score_codex":0.00004305733,"about_ca_system_score_gemma":0.000058170925,"threshold_uncertainty_score":0.57667},"labels":[],"label_agreement":null},{"id":"W4392477550","doi":"10.1109/tdsc.2024.3372634","title":"FedDMC: Efficient and Robust Federated Learning via Detecting Malicious Clients","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"HIV, Drug Use, Sexual Risk","field":"Medicine","cited_by":38,"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":"Key Research and Development Projects of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Cluster analysis; Data mining; Machine learning; Artificial intelligence; Benchmark (surveying)","score_opus":0.026077161708309052,"score_gpt":0.2941516083026139,"score_spread":0.26807444659430485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392477550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64496857,0.0005433783,0.35293344,0.00011035156,0.0004222054,0.00023498014,0.0000040554523,0.00033425566,0.00044878406],"genre_scores_gemma":[0.99805003,0.000053116735,0.0010360489,0.000109331086,0.0001223384,0.000004645809,0.0000060451343,0.00006661841,0.0005517997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981806,0.00009706071,0.00036051564,0.0006112585,0.00029012904,0.00046038875],"domain_scores_gemma":[0.9992035,0.0002974223,0.000056488872,0.00013502674,0.000076819146,0.00023074658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038919097,0.00028558343,0.00034714813,0.00028171932,0.000756638,0.00025682637,0.00005149945,0.00016807097,0.00004606651],"category_scores_gemma":[0.000021168751,0.00026478086,0.00007716712,0.00043677876,0.000056708668,0.000082258586,0.0000063758475,0.0010536375,0.000046574358],"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.00022042292,0.00027287615,0.00045427258,0.00081420084,0.00032899878,0.00061511144,0.012030731,0.4049992,0.015443088,0.000018756979,0.000060298862,0.564742],"study_design_scores_gemma":[0.00091020076,0.00043086035,0.00010218629,0.0006592595,0.00019055001,0.0009489451,0.0034142847,0.98069614,0.011855823,0.0000075168778,0.00048958696,0.00029464843],"about_ca_topic_score_codex":0.00011828165,"about_ca_topic_score_gemma":0.000057921236,"teacher_disagreement_score":0.57569695,"about_ca_system_score_codex":0.000086234686,"about_ca_system_score_gemma":0.00005709554,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W4392908482","doi":"10.1109/tdsc.2024.3376084","title":"Achieving Practical and Privacy-Preserving kNN Query Over Encrypted Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Information privacy; Query optimization; Data mining; Computer security","score_opus":0.038100542285316945,"score_gpt":0.31124048703686114,"score_spread":0.2731399447515442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392908482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06821641,0.0012506418,0.92800844,0.001003946,0.0006843983,0.00016278622,0.00006319878,0.0004103588,0.00019983486],"genre_scores_gemma":[0.93653405,0.00029429444,0.062839955,0.00018047598,0.0001065739,0.0000028034835,0.0000140117,0.000018808209,0.000009026236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784523,0.00013229344,0.00031173285,0.0009967056,0.00030924848,0.00040477767],"domain_scores_gemma":[0.99783653,0.0008197502,0.000053394684,0.0010654569,0.000035435707,0.00018943405],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000671089,0.0002506185,0.00023515488,0.00025725382,0.00058812276,0.0011091412,0.00078769174,0.0001335323,0.000035551333],"category_scores_gemma":[0.000036469173,0.00023591984,0.0000628732,0.0006088228,0.00007068094,0.0022365302,0.00016478219,0.00075894577,0.000009453893],"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.00015858751,0.0009096025,0.0008959547,0.0018544357,0.00091583154,0.0014259481,0.01245489,0.0019194451,0.006871047,0.17720047,0.008890017,0.7865038],"study_design_scores_gemma":[0.0003366602,0.000093156115,0.0003962513,0.00036375245,0.000067517176,0.00041753682,0.00012510103,0.9837071,0.00064706884,0.0024013014,0.011026854,0.00041771313],"about_ca_topic_score_codex":0.00012465939,"about_ca_topic_score_gemma":0.0000837683,"teacher_disagreement_score":0.9817876,"about_ca_system_score_codex":0.00001964903,"about_ca_system_score_gemma":0.00011393335,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W4394939057","doi":"10.1109/tdsc.2024.3387570","title":"Fast Generation-Based Gradient Leakage Attacks: An Approach to Generate Training Data Directly From the Gradient","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Leakage (economics); Artificial intelligence","score_opus":0.07632921568485775,"score_gpt":0.2941784633937752,"score_spread":0.21784924770891745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394939057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07899029,0.00030285012,0.9173153,0.0007242731,0.001733033,0.00029103545,0.00007261201,0.00041876629,0.0001518089],"genre_scores_gemma":[0.8892749,0.000008957889,0.10946649,0.000565842,0.00050986017,0.000015036748,0.00007962131,0.0000385301,0.000040785613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971257,0.0003382591,0.00036665128,0.0012892401,0.00040526697,0.00047487378],"domain_scores_gemma":[0.99810404,0.00044366322,0.00006732636,0.0011161186,0.00005317202,0.00021570573],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087504106,0.00032826603,0.00026993547,0.00017227157,0.0012106585,0.0011305922,0.0013352057,0.000095280244,0.00001073677],"category_scores_gemma":[0.000017119975,0.00026166879,0.000078467565,0.00068622787,0.000052411207,0.00067491404,0.000042449305,0.0006966232,0.000015024448],"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.000006595473,0.00006868692,0.000008730061,0.000014386395,0.000056953046,0.000022850336,0.006660869,0.8551799,0.00068940746,0.0008525801,0.00017489167,0.13626413],"study_design_scores_gemma":[0.00023668539,0.00007621167,0.000032164793,0.00007980363,0.000046566754,0.000024981435,0.0003612637,0.9961115,0.0011918008,0.00005667018,0.0014591791,0.00032318474],"about_ca_topic_score_codex":0.00035212343,"about_ca_topic_score_gemma":0.00023408266,"teacher_disagreement_score":0.81028455,"about_ca_system_score_codex":0.000074630385,"about_ca_system_score_gemma":0.00014784723,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W4395017388","doi":"10.1109/tdsc.2024.3392424","title":"MaskCrypt: Federated Learning With Selective Homomorphic Encryption","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":57,"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":"Homomorphic encryption; Computer science; Encryption; Computer security; Theoretical computer science","score_opus":0.008515883368515574,"score_gpt":0.21966704186343017,"score_spread":0.2111511584949146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395017388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07477573,0.00042497888,0.92272866,0.00017228682,0.0003743872,0.00016914516,0.000007733074,0.0010058846,0.00034118295],"genre_scores_gemma":[0.99016064,0.00008381836,0.009566507,0.0000740929,0.000056261022,0.000008634778,0.0000047950066,0.000026106838,0.000019162977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983554,0.00011771988,0.00021197095,0.0006747533,0.00027001966,0.00037011926],"domain_scores_gemma":[0.9993196,0.00022380994,0.000047076697,0.00019667674,0.00008797443,0.00012482944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028711616,0.000248069,0.0002039537,0.00030551216,0.0009078769,0.00085385377,0.00021226,0.000111716094,0.000019805737],"category_scores_gemma":[0.0000030842111,0.00021538796,0.00007763829,0.0011506851,0.000056406647,0.0007386187,0.000007089018,0.00081740716,0.00003458577],"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.00031208326,0.0007001911,0.0004086751,0.00068080035,0.0009375083,0.0011478288,0.015649252,0.16987886,0.005927251,0.07723765,0.0008083254,0.72631156],"study_design_scores_gemma":[0.00052070414,0.00059512357,0.00012200053,0.00034097786,0.000053300137,0.00038223193,0.0002996916,0.9834752,0.009603406,0.0017511086,0.002356709,0.00049953413],"about_ca_topic_score_codex":0.00006963041,"about_ca_topic_score_gemma":0.00011699055,"teacher_disagreement_score":0.9153849,"about_ca_system_score_codex":0.000040659223,"about_ca_system_score_gemma":0.00009092534,"threshold_uncertainty_score":0.87832665},"labels":[],"label_agreement":null},{"id":"W4396982365","doi":"10.1109/tdsc.2024.3401836","title":"A Differentially Private Approach for Budgeted Combinatorial Multi-Armed Bandits","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Mathematical economics; Operations research; Economics; Mathematics","score_opus":0.08362743912680343,"score_gpt":0.38310144994046785,"score_spread":0.2994740108136644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396982365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031405695,0.00026882338,0.96454126,0.00009910651,0.0025501798,0.0007521314,0.00009939645,0.00021865881,0.00006476354],"genre_scores_gemma":[0.97627395,0.000025422696,0.022622922,0.000029074065,0.00025891975,0.000048543377,0.000012668081,0.00004591605,0.0006825601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966487,0.00017515071,0.0006100475,0.00097428204,0.001009746,0.00058204],"domain_scores_gemma":[0.9971464,0.0019342488,0.00008662096,0.0003649315,0.0002518112,0.0002159381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012717027,0.0002894265,0.0004255082,0.0005215984,0.0007494877,0.00083048607,0.00047936718,0.00018237665,0.00006753177],"category_scores_gemma":[0.00013907887,0.00022492965,0.00021690819,0.00086964556,0.000112620684,0.0003526081,0.00001339579,0.0005986264,0.000032739557],"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.00087564543,0.0014162536,0.000054267202,0.0005019448,0.00060138886,0.00013273036,0.003883914,0.2139733,0.006813416,0.0020816869,0.001616593,0.7680489],"study_design_scores_gemma":[0.0018267926,0.00022183062,0.000052809206,0.00006201648,0.000037860373,0.000035300476,0.0001828996,0.9820612,0.008303257,0.0032705604,0.0036450778,0.00030038314],"about_ca_topic_score_codex":0.000014245918,"about_ca_topic_score_gemma":0.000014014433,"teacher_disagreement_score":0.94486827,"about_ca_system_score_codex":0.00007258184,"about_ca_system_score_gemma":0.0001083847,"threshold_uncertainty_score":0.9172365},"labels":[],"label_agreement":null},{"id":"W4399146398","doi":"10.1109/tdsc.2024.3406703","title":"RZDD: Risk Zone-Diversified Network Design for Disaster Resilience","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Resilience (materials science); Business; Risk analysis (engineering); Computer science; Environmental resource management; Environmental science; Materials science","score_opus":0.08847330681773843,"score_gpt":0.33946825770511513,"score_spread":0.25099495088737667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399146398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01736258,0.00031933922,0.9772621,0.00020977989,0.0038138623,0.00040587372,0.00006892032,0.00019803378,0.00035956054],"genre_scores_gemma":[0.9655679,0.000026890373,0.031392843,0.00011815556,0.00020514138,0.0000082988945,0.0000031906895,0.00001737831,0.0026602147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968985,0.00024059047,0.00051385834,0.0011531116,0.0007072127,0.00048674503],"domain_scores_gemma":[0.9952127,0.003802588,0.000109483255,0.000617029,0.000113681024,0.00014453847],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0048024277,0.00021330915,0.00025740956,0.00030450118,0.0012337746,0.001403721,0.00057522615,0.00007902294,0.0001000706],"category_scores_gemma":[0.00010811849,0.00016787769,0.00016120796,0.0010267842,0.000091403985,0.00035675184,0.000022242628,0.00029565042,0.00015432609],"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.00006457345,0.000033060864,0.00002131081,0.000019550564,0.000042991778,0.000015261197,0.0010962745,0.65996695,0.000021002768,0.0002886015,0.022069678,0.31636077],"study_design_scores_gemma":[0.0002977149,0.00013375595,0.000034388493,0.00011524957,0.00006744486,0.000015741207,0.0009372341,0.9664252,0.00026655156,0.0033983102,0.028078752,0.00022969791],"about_ca_topic_score_codex":0.000044928107,"about_ca_topic_score_gemma":0.000051913205,"teacher_disagreement_score":0.9482053,"about_ca_system_score_codex":0.000035803314,"about_ca_system_score_gemma":0.000052744952,"threshold_uncertainty_score":0.9996329},"labels":[],"label_agreement":null},{"id":"W4399339292","doi":"10.1109/tdsc.2024.3408816","title":"Efficient and Privacy-Preserving Weighted Range Set Sampling in Cloud","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Range (aeronautics); Computer science; Cloud computing; Set (abstract data type); Privacy protection; Mathematics; Computer security; Engineering","score_opus":0.021307218232329363,"score_gpt":0.27278505826806154,"score_spread":0.2514778400357322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399339292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22076625,0.00047610106,0.77745914,0.00038115418,0.00022589986,0.00018496318,0.000005290569,0.00037324004,0.00012795546],"genre_scores_gemma":[0.9759868,0.00007650481,0.023732133,0.000073320494,0.000048857797,0.00001743238,6.978387e-7,0.000014305217,0.00004998077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879354,0.000044478144,0.0002529625,0.0005096445,0.00014145092,0.00025794993],"domain_scores_gemma":[0.99936634,0.00020572204,0.00003384542,0.00028160954,0.000027697122,0.0000848108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030262672,0.00015859524,0.00015917531,0.00027064022,0.00035258982,0.00031228102,0.00026338632,0.00008913895,0.000011134584],"category_scores_gemma":[0.0000027433884,0.00015269479,0.000049701594,0.0006245972,0.000029411549,0.00013511688,0.000023996,0.00037465358,0.000007052981],"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.0000483563,0.00039541864,0.00026990758,0.00073909387,0.00014094308,0.00015572648,0.014026349,0.12728958,0.0066704517,0.030823627,0.00043092592,0.8190096],"study_design_scores_gemma":[0.00017424069,0.000046876452,0.00009555988,0.00018159061,0.000009251359,0.000080354206,0.000074009244,0.9929265,0.003140617,0.001228415,0.0018564808,0.0001861179],"about_ca_topic_score_codex":0.00008454319,"about_ca_topic_score_gemma":0.000027329039,"teacher_disagreement_score":0.8656369,"about_ca_system_score_codex":0.000042327334,"about_ca_system_score_gemma":0.000029274797,"threshold_uncertainty_score":0.6226713},"labels":[],"label_agreement":null},{"id":"W4399407374","doi":"10.1109/tdsc.2024.3410695","title":"Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler With Realizations","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blockchain; Signature (topology); Key (lock); Compiler; Computer science; Digital signature; Computer security; Programming language; Mathematics; Hash function","score_opus":0.014417922933018117,"score_gpt":0.2550492858964252,"score_spread":0.24063136296340712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399407374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01498555,0.0017259069,0.97937423,0.0022526863,0.0002260775,0.0005660664,0.000055305012,0.0007563691,0.000057793055],"genre_scores_gemma":[0.9591569,0.000057876034,0.040271018,0.0002779619,0.000041440097,0.000039057504,0.00000580287,0.000027781407,0.00012216053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984794,0.000047499772,0.0002452061,0.0007064484,0.00016199188,0.00035945064],"domain_scores_gemma":[0.9989575,0.00036882513,0.000056729838,0.0003790241,0.00010984529,0.0001280407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024840728,0.00027619101,0.0002697708,0.00030150317,0.00083699834,0.00028445717,0.00033829038,0.00027372016,0.000004334487],"category_scores_gemma":[0.0000041326707,0.00022865759,0.000076353215,0.00069514784,0.00012590116,0.00010010369,0.000009017734,0.0006678386,0.0000027197227],"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.00011766775,0.0009266067,0.000083324485,0.00083763234,0.0008213633,0.000120821656,0.010529658,0.17607012,0.0024111995,0.54714876,0.0027794854,0.25815338],"study_design_scores_gemma":[0.0005845633,0.00018807361,0.00004012411,0.00017228669,0.00005276357,0.00015726051,0.000099647616,0.9878251,0.0030836116,0.002364978,0.005110907,0.00032071563],"about_ca_topic_score_codex":0.00003308811,"about_ca_topic_score_gemma":0.00011646462,"teacher_disagreement_score":0.94417137,"about_ca_system_score_codex":0.000032831944,"about_ca_system_score_gemma":0.00006616834,"threshold_uncertainty_score":0.9324386},"labels":[],"label_agreement":null},{"id":"W4400112242","doi":"10.1109/tdsc.2024.3420712","title":"PerfSPEC: Performance Profiling-Based Proactive Security Policy Enforcement for Containers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Information and Cyber Security","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":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Profiling (computer programming); Enforcement; Computer security; Security policy; Business; Computer science; Political science; Law; Operating system","score_opus":0.012232800809437085,"score_gpt":0.2579279129151216,"score_spread":0.24569511210568454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400112242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036690816,0.00009440105,0.9588528,0.0006195686,0.00065473217,0.0006922184,0.000027879392,0.00041391907,0.0019536295],"genre_scores_gemma":[0.9917765,0.000020452515,0.007360522,0.0005496953,0.000109630135,0.000059165617,0.000008944645,0.000016481961,0.000098586446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984792,0.00003956129,0.00033547697,0.00044165234,0.00027332036,0.00043081975],"domain_scores_gemma":[0.9992506,0.00016347526,0.00006506065,0.00025845657,0.00013124497,0.00013115443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004027906,0.00024704277,0.00020463653,0.00032688526,0.00059376995,0.00043534368,0.00029403254,0.0001040725,0.000014101312],"category_scores_gemma":[0.0000058166233,0.00022680665,0.00012893934,0.00046723714,0.000045394496,0.00073473266,0.0000069953094,0.00037274472,0.000015839814],"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.00029948357,0.00048444368,0.000045134468,0.0021642311,0.00042198977,0.000031734697,0.028941883,0.12790038,0.00063549704,0.38259906,0.0005318595,0.4559443],"study_design_scores_gemma":[0.00059445726,0.0002787041,0.0000063882567,0.00010165442,0.000019197902,0.000027294685,0.00022339901,0.9527899,0.04057087,0.0004819076,0.0046351184,0.00027108198],"about_ca_topic_score_codex":0.000053684038,"about_ca_topic_score_gemma":0.000016567468,"teacher_disagreement_score":0.9550857,"about_ca_system_score_codex":0.00015415765,"about_ca_system_score_gemma":0.0003530884,"threshold_uncertainty_score":0.92489064},"labels":[],"label_agreement":null},{"id":"W4400903658","doi":"10.1109/tdsc.2024.3432650","title":"Privacy-Preserving Fine-Grained Data Sharing With Dynamic Service for the Cloud-Edge IoT","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Internet of Things; Enhanced Data Rates for GSM Evolution; Information privacy; Edge computing; Computer security; Data sharing; Service (business); Computer network; Telecommunications; Operating system; Business","score_opus":0.047341628528391355,"score_gpt":0.2973497996101303,"score_spread":0.25000817108173895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400903658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823872,0.0011921643,0.96127623,0.02242294,0.0010770968,0.00059098756,0.00014027084,0.0014188597,0.00005758221],"genre_scores_gemma":[0.8160202,0.00007301208,0.18335375,0.000272583,0.00009893057,0.000034792047,0.00002391668,0.000053672964,0.000069139016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971628,0.000048660517,0.0003688728,0.0014434492,0.0003471686,0.0006290173],"domain_scores_gemma":[0.9895287,0.0013850715,0.00009014831,0.008797579,0.00010654052,0.00009192024],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000966186,0.00035362935,0.0002810966,0.0002219832,0.0009899833,0.0011053436,0.02476379,0.00015461423,0.000011478281],"category_scores_gemma":[0.00037487148,0.00025751363,0.00006686661,0.001144294,0.00007467705,0.0008366861,0.005050353,0.0007935446,0.000011986875],"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.00024038304,0.00037339752,0.000095632335,0.002837894,0.0016079365,0.00030405467,0.003765273,0.07538613,0.0028551596,0.0051755337,0.03965947,0.86769915],"study_design_scores_gemma":[0.0003873299,0.00009277068,0.000021643766,0.0004354283,0.00007408523,0.00013970143,0.00010164398,0.98482877,0.0010663389,0.007922222,0.0045930045,0.00033705795],"about_ca_topic_score_codex":0.00017487184,"about_ca_topic_score_gemma":0.0007242567,"teacher_disagreement_score":0.90944266,"about_ca_system_score_codex":0.000075905504,"about_ca_system_score_gemma":0.00012193678,"threshold_uncertainty_score":0.9999877},"labels":[],"label_agreement":null},{"id":"W4402159510","doi":"10.1109/tdsc.2024.3446587","title":"PulseAnomaly: Unsupervised Anomaly Detection on Avionic Platforms With Seasonality and Trend Modeling in Transformer Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Anomaly Detection Techniques and Applications","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":"McGill University; Queen's University","funders":"Innovation for Defence Excellence and Security","keywords":"Anomaly detection; Avionics; Computer science; Anomaly (physics); Transformer; Data mining; Electrical engineering; Engineering","score_opus":0.014893546637415612,"score_gpt":0.22876703060585732,"score_spread":0.21387348396844172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402159510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36238286,0.00017247346,0.6366756,0.00011523016,0.00007816701,0.00019940718,0.0000041562807,0.00026993683,0.000102131504],"genre_scores_gemma":[0.9969522,0.00014241449,0.0026727507,0.0000894366,0.000038753828,0.000041048424,0.0000022885279,0.000023947267,0.000037198773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984735,0.000030593746,0.00029479884,0.00066522835,0.0001938129,0.0003420571],"domain_scores_gemma":[0.99944186,0.00013510324,0.000033222692,0.00024103784,0.000027873206,0.00012090192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002798227,0.00025297576,0.00021668756,0.00024376121,0.00046226836,0.0003160953,0.00016626257,0.00014543592,0.000006976307],"category_scores_gemma":[9.0174103e-7,0.00021260705,0.000072136325,0.0007679871,0.000040301227,0.00049760053,0.0000038071198,0.00057728327,0.0000025566526],"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.000105283434,0.00018402992,0.000073443865,0.00009963447,0.00006549277,0.00003894298,0.0010479734,0.30021277,0.00047657313,0.0032147933,0.0000031866548,0.69447786],"study_design_scores_gemma":[0.00040995236,0.00029956203,0.00012682016,0.00017205157,0.000022451073,0.00012731511,0.00009900116,0.99425215,0.0035437557,0.00060396286,0.00007820093,0.00026475807],"about_ca_topic_score_codex":0.00010140756,"about_ca_topic_score_gemma":0.0005379899,"teacher_disagreement_score":0.6942131,"about_ca_system_score_codex":0.000077877754,"about_ca_system_score_gemma":0.000040682036,"threshold_uncertainty_score":0.86698633},"labels":[],"label_agreement":null},{"id":"W4402215600","doi":"10.1109/tdsc.2024.3451129","title":"An Attack Exploiting Cyber-Arm Industry","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security","score_opus":0.03578073123567247,"score_gpt":0.32940739890863996,"score_spread":0.29362666767296747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402215600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9015558,0.0014493098,0.0711097,0.0016641826,0.0022603676,0.0002976818,0.000033675573,0.00090999383,0.020719308],"genre_scores_gemma":[0.9983415,0.0001979502,0.00027457756,0.0002019431,0.00046301394,0.000007147764,0.0000019190545,0.000024382423,0.00048755878],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9983949,0.0001599263,0.00022815973,0.00044491017,0.0003160292,0.00045606896],"domain_scores_gemma":[0.99928844,0.00027862715,0.000034683155,0.00014503718,0.000060970542,0.0001922202],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00056939264,0.00018809608,0.00019737048,0.00014301081,0.0019918052,0.00042681108,0.00016242782,0.00027205088,0.00023211597],"category_scores_gemma":[0.000010346676,0.00019354523,0.000093333605,0.00043835747,0.00017681881,0.00047567586,0.00000361107,0.0009364423,0.000040165414],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005275858,0.000642387,0.00033834277,0.00026849398,0.0004261567,0.00034887673,0.27760848,0.0128620835,0.00034648058,0.025516726,0.002212644,0.67937654],"study_design_scores_gemma":[0.002153428,0.0012576868,0.0005283557,0.0031757453,0.0007137731,0.0002423443,0.43045923,0.13200557,0.0074556144,0.007752938,0.41021776,0.004037563],"about_ca_topic_score_codex":0.0011097415,"about_ca_topic_score_gemma":0.0033178309,"teacher_disagreement_score":0.675339,"about_ca_system_score_codex":0.000075774995,"about_ca_system_score_gemma":0.00011751861,"threshold_uncertainty_score":0.99930745},"labels":[],"label_agreement":null},{"id":"W4402215618","doi":"10.1109/tdsc.2024.3454573","title":"Internet-Wide Analysis, Characterization, and Family Attribution of IoT Malware: A Comprehensive Longitudinal Study","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; National Science Foundation","keywords":"Computer science; Malware; Internet of Things; Attribution; Computer security; The Internet; World Wide Web; Psychology","score_opus":0.027617736524223398,"score_gpt":0.27671401672694035,"score_spread":0.24909628020271696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402215618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36792186,0.00022519095,0.63109666,0.000044421955,0.0002028204,0.00020735986,0.0000135600485,0.00028435915,0.0000037964471],"genre_scores_gemma":[0.9913175,0.00007350901,0.0084465975,0.00005160737,0.000020803922,0.00001214205,0.0000057730645,0.000013654206,0.000058398226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984389,0.000100802725,0.00039891072,0.00061604776,0.00023353632,0.0002117898],"domain_scores_gemma":[0.9991373,0.00022224156,0.00010764656,0.00027471504,0.00017958165,0.00007851713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020196998,0.00021524992,0.00034555077,0.0005775755,0.00019865364,0.00020534356,0.00019959334,0.00007893914,0.000008529921],"category_scores_gemma":[0.0000042192,0.00021297172,0.00009631887,0.0012631306,0.000054098455,0.00035355188,0.00001940746,0.00030064,0.000002537203],"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.0002117451,0.0012751421,0.01883428,0.00079088466,0.0037749778,0.00040241354,0.0107497545,0.030556986,0.03774172,0.00461738,0.00008525951,0.89095944],"study_design_scores_gemma":[0.00067560194,0.0011641688,0.07613012,0.00029671428,0.00055980287,0.00014914788,0.00037653244,0.8735743,0.04495797,0.00029482518,0.001165022,0.0006557882],"about_ca_topic_score_codex":0.00008601703,"about_ca_topic_score_gemma":0.000040635798,"teacher_disagreement_score":0.8903037,"about_ca_system_score_codex":0.000048030306,"about_ca_system_score_gemma":0.00003121532,"threshold_uncertainty_score":0.8684735},"labels":[],"label_agreement":null},{"id":"W4402434901","doi":"10.1109/tdsc.2024.3454421","title":"uBOX: A Lightweight and Hardware-Assisted Sandbox for Multicore Embedded Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Sandbox (software development); Computer science; Multi-core processor; Embedded system; Operating system; Computer architecture; Parallel computing; Computer hardware","score_opus":0.0230209657664218,"score_gpt":0.270867056579438,"score_spread":0.2478460908130162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402434901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007603259,0.0028845705,0.9856133,0.00016234936,0.0014241505,0.0008521757,0.000030433825,0.0012170537,0.00021274941],"genre_scores_gemma":[0.96335477,0.00007103528,0.035922617,0.00006526634,0.00011660332,0.00008822137,0.0000026026055,0.000039982613,0.00033892193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978544,0.00015090742,0.00047116607,0.000824832,0.00026416837,0.00043450165],"domain_scores_gemma":[0.9984841,0.00071797747,0.00008576102,0.00041819343,0.000118236414,0.00017574271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006569389,0.00032602664,0.00040814007,0.00034202042,0.0005127668,0.0009773689,0.00034395076,0.00020952312,0.0000027505191],"category_scores_gemma":[0.000009605609,0.00028845202,0.00012566074,0.0004004049,0.00004751887,0.00048142805,0.000011211114,0.00035173798,0.000008076885],"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.00023098069,0.0007715635,0.000063921885,0.009691016,0.0016007962,0.0009591651,0.030095251,0.01271886,0.070918545,0.09461961,0.01410847,0.76422185],"study_design_scores_gemma":[0.00043750068,0.00022179238,0.00000825247,0.000911083,0.000055457505,0.00049787044,0.00014915426,0.9756637,0.017102722,0.00053506426,0.0040227068,0.00039468822],"about_ca_topic_score_codex":0.000056601864,"about_ca_topic_score_gemma":0.000017075105,"teacher_disagreement_score":0.96294487,"about_ca_system_score_codex":0.00006982989,"about_ca_system_score_gemma":0.00007817821,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W4402807503","doi":"10.1109/tdsc.2024.3449641","title":"NeuroYara: Learning to Rank for Yara Rules Generation Through Deep Language Modeling and Discriminative N-Gram Encoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discriminative model; n-gram; Computer science; Encoding (memory); Gram; Rank (graph theory); Artificial intelligence; Language model; Natural language processing; Mathematics","score_opus":0.024654335472194734,"score_gpt":0.2976123308965028,"score_spread":0.27295799542430804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402807503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06033673,0.0030225622,0.9350101,0.00037631928,0.00031464355,0.00028814675,0.0000049980968,0.00060309586,0.000043450247],"genre_scores_gemma":[0.73506147,0.000046730915,0.26459593,0.00013099876,0.00008340143,0.000017665594,0.0000029994824,0.000018338598,0.00004249617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873245,0.000060619797,0.00020828097,0.0005665126,0.0001566865,0.00027543912],"domain_scores_gemma":[0.999479,0.00021580883,0.000035162324,0.00013632391,0.000065274224,0.00006846358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027140626,0.00019754244,0.00018040634,0.00018197972,0.0005994291,0.0007434317,0.00020127743,0.00008011737,0.0000016463408],"category_scores_gemma":[0.000021080228,0.00017870768,0.00005708006,0.00026170994,0.00001932153,0.0006823933,0.000015542448,0.00037989195,0.0000018163222],"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.000022754683,0.00004103633,0.0000014878245,0.0003452738,0.000051910665,0.000059524296,0.041187327,0.15260255,0.028982006,0.0137703065,0.000035485537,0.76290035],"study_design_scores_gemma":[0.00012727702,0.000117370975,2.974488e-7,0.00018708463,0.000024701483,0.000051631432,0.00040383107,0.96532136,0.031648356,0.0018120605,0.0000952454,0.00021076674],"about_ca_topic_score_codex":0.000062275554,"about_ca_topic_score_gemma":0.00003714997,"teacher_disagreement_score":0.8127188,"about_ca_system_score_codex":0.00003705136,"about_ca_system_score_gemma":0.000025386655,"threshold_uncertainty_score":0.72874874},"labels":[],"label_agreement":null},{"id":"W4403320271","doi":"10.1109/tdsc.2024.3478786","title":"Efficiency Boosting of Secure Cross-Platform Recommender Systems Over Sparse Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Computer science; Boosting (machine learning); Recommender system; Machine learning","score_opus":0.05323825191386969,"score_gpt":0.3131218753064908,"score_spread":0.25988362339262117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403320271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023229962,0.0016868828,0.97032505,0.000114506984,0.0024279084,0.00033123174,0.0000657205,0.0005715724,0.0012471797],"genre_scores_gemma":[0.9923586,0.00009815098,0.0071870107,0.000059498998,0.00011460957,0.0000073383694,0.000007808644,0.0000305292,0.00013645746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975831,0.00008431053,0.0006683734,0.00085853285,0.00036563101,0.0004400743],"domain_scores_gemma":[0.99823993,0.00041790947,0.00015691816,0.0009762547,0.00008550985,0.00012346383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010679929,0.00029720768,0.0003934044,0.00029693334,0.0004193705,0.00082236616,0.0009849928,0.00017737587,0.000016802427],"category_scores_gemma":[0.0000074275777,0.00026092996,0.000100102014,0.0005797664,0.000049631995,0.0011120705,0.000056220564,0.0005321757,0.000008737247],"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.000082805476,0.0011504312,0.0009123901,0.00649726,0.0012382488,0.00048727126,0.014447408,0.06513163,0.0037260721,0.059506565,0.015926316,0.8308936],"study_design_scores_gemma":[0.00026620989,0.00013760877,0.00003395812,0.0007855135,0.00002839215,0.00023552593,0.00014540473,0.9864741,0.0032857456,0.0002856118,0.007980585,0.00034133767],"about_ca_topic_score_codex":0.00034795934,"about_ca_topic_score_gemma":0.000034767396,"teacher_disagreement_score":0.9691286,"about_ca_system_score_codex":0.000056138077,"about_ca_system_score_gemma":0.00009612195,"threshold_uncertainty_score":0.99998426},"labels":[],"label_agreement":null},{"id":"W4405717542","doi":"10.1109/tdsc.2024.3521451","title":"Feature Reconstruction Attacks and Countermeasures of DNN Training in Vertical Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Training (meteorology); Feature (linguistics); Computer security; Feature extraction; Artificial intelligence; Multimedia","score_opus":0.015035523475006769,"score_gpt":0.2595993449859744,"score_spread":0.24456382151096764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27980497,0.0004127468,0.71862817,0.00026146515,0.00052757,0.000074040596,9.1622024e-7,0.00013931465,0.00015082808],"genre_scores_gemma":[0.993282,0.000041906456,0.0065438086,0.000026371412,0.000046238736,0.0000020900727,7.235048e-7,0.000015919757,0.000040904746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986913,0.00015966354,0.0002358053,0.00045351082,0.00019773298,0.0002619828],"domain_scores_gemma":[0.99934095,0.00040339315,0.00003986255,0.00010200622,0.000045678196,0.00006810317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696217,0.00017468461,0.00025243626,0.00026071517,0.00031420472,0.00026710666,0.00012659881,0.00014341241,0.0000059662025],"category_scores_gemma":[0.00002903704,0.0001718527,0.000047191323,0.00042344347,0.00007109229,0.0004173498,0.000008775408,0.0009752248,0.0000014176319],"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.00004360105,0.000025730196,0.00054780015,0.00019393343,0.00006967685,0.000092364215,0.0071198903,0.23455591,0.0022746802,0.0012586556,0.000012630227,0.7538051],"study_design_scores_gemma":[0.0003436768,0.0000988825,0.0001985808,0.00053492165,0.000017079712,0.00032298316,0.00059671636,0.9950595,0.0023144258,0.00018147484,0.00015389443,0.00017787816],"about_ca_topic_score_codex":0.000034676847,"about_ca_topic_score_gemma":0.0000638039,"teacher_disagreement_score":0.7605036,"about_ca_system_score_codex":0.00004891661,"about_ca_system_score_gemma":0.000094095856,"threshold_uncertainty_score":0.700795},"labels":[],"label_agreement":null},{"id":"W4405717558","doi":"10.1109/tdsc.2024.3521396","title":"Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Computer security; Cryptography","score_opus":0.011976739952560052,"score_gpt":0.24859856098935149,"score_spread":0.23662182103679144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2630123,0.0006171719,0.7346629,0.00013182375,0.00067947665,0.00019870522,0.000096435724,0.00037714888,0.00022406343],"genre_scores_gemma":[0.9935238,0.00007830843,0.0061573344,0.00012234182,0.00006569388,0.000006762931,0.000020711632,0.000015564357,0.0000094976895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.000091152,0.00034306067,0.00078729197,0.00030499947,0.0003988502],"domain_scores_gemma":[0.9990169,0.00032142908,0.00006427411,0.0003430569,0.00006403512,0.0001903334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041983314,0.00029243328,0.0002445282,0.00028442754,0.00058594777,0.0007257277,0.0002729961,0.0001638634,0.000028339084],"category_scores_gemma":[0.0000052292366,0.0002765093,0.000109636356,0.00087339856,0.000108766966,0.0005565763,0.000019004758,0.0005836584,0.000008906636],"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.00024701134,0.0014081271,0.00037830794,0.0022021881,0.00097629055,0.0011354701,0.028685847,0.09089499,0.011858622,0.28098902,0.0025691653,0.57865494],"study_design_scores_gemma":[0.00059863616,0.0001299241,0.00021795864,0.000371817,0.000048887203,0.00031880816,0.00015351888,0.9879927,0.004316905,0.0033930622,0.0019948513,0.00046294762],"about_ca_topic_score_codex":0.00007860083,"about_ca_topic_score_gemma":0.00003182218,"teacher_disagreement_score":0.8970977,"about_ca_system_score_codex":0.000034017936,"about_ca_system_score_gemma":0.000073527095,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W4405844668","doi":"10.1109/tdsc.2024.3523561","title":"Blockchain-Enabled Secure Offloading for VEC: A Multi-Agent Reinforcement Learning Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Info-communications Media Development Authority; National Natural Science Foundation of China; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Blockchain; Computer science; Reinforcement learning; Distributed computing; Computer network; Computer security; Artificial intelligence","score_opus":0.017978173109979973,"score_gpt":0.25277244002179655,"score_spread":0.23479426691181657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405844668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017439106,0.00079909945,0.97882503,0.00046157194,0.00047539722,0.0007310215,0.00000636074,0.0010418786,0.00022055588],"genre_scores_gemma":[0.925465,0.00005682052,0.073630966,0.0001260071,0.000069496695,0.00014115992,0.000005919583,0.00003263469,0.0004719921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781543,0.00006220324,0.00042019706,0.00089757476,0.0002292769,0.0005752883],"domain_scores_gemma":[0.99894,0.00029766306,0.00008769936,0.0004378834,0.00009643911,0.00014030834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006206996,0.00032485032,0.00031510944,0.00037328736,0.001155335,0.00035635178,0.0005057644,0.000261196,0.0000094584975],"category_scores_gemma":[0.000011187885,0.00031456648,0.00017393308,0.00069195527,0.00006303665,0.00015623718,0.000024249755,0.00084346085,0.000013675042],"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.00002997644,0.00036612962,0.000009606947,0.000577124,0.00034650572,0.000036213885,0.007538938,0.76285076,0.0018344821,0.07251926,0.0003358026,0.1535552],"study_design_scores_gemma":[0.0005630462,0.00016036646,0.0000023779085,0.00014554372,0.000045874433,0.00009744605,0.0002550523,0.9874397,0.0049183522,0.0006715011,0.0053579235,0.00034282997],"about_ca_topic_score_codex":0.000029164119,"about_ca_topic_score_gemma":0.00001147916,"teacher_disagreement_score":0.9080259,"about_ca_system_score_codex":0.000095058196,"about_ca_system_score_gemma":0.00008141395,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W4405906970","doi":"10.1109/tdsc.2024.3523289","title":"ADA-FInfer: Inferring Face Representations From Adaptive Select Frames for High-Visual-Quality Deepfake Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Face recognition and analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Science Foundation for Distinguished Young Scholars of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Face (sociological concept); Quality (philosophy); Face detection; Artificial intelligence; Computer vision; Frame (networking); Facial recognition system; Machine learning; Human–computer interaction; Pattern recognition (psychology); Computer network","score_opus":0.025378356226589485,"score_gpt":0.3025102243596083,"score_spread":0.2771318681330188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405906970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10170205,0.00024438274,0.89631426,0.00028203233,0.00060937705,0.00024774883,0.00005539457,0.00047927967,0.000065469554],"genre_scores_gemma":[0.9802532,0.0000634436,0.01929117,0.0001249632,0.00009719991,0.000032683427,0.000013550477,0.000021421381,0.00010232606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981651,0.00013978942,0.00039069937,0.00073129986,0.00025421267,0.00031893115],"domain_scores_gemma":[0.998514,0.0009128258,0.000083296414,0.00023545996,0.00013393791,0.000120484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031338065,0.00023373502,0.00028471844,0.00030017993,0.00067248597,0.000557273,0.0001888878,0.00013982873,0.000028515584],"category_scores_gemma":[0.00002009301,0.00023469563,0.00019284448,0.0007026887,0.000032131564,0.00060852885,0.000008790675,0.00040054103,0.000027608703],"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.000048679427,0.00021954408,0.000031707288,0.00011291421,0.0005786995,0.000017936944,0.0028985133,0.11383389,0.00742152,0.0028198808,0.000059980124,0.8719567],"study_design_scores_gemma":[0.0003520666,0.00015027003,0.00014518447,0.00011833155,0.0000968722,0.0000113570295,0.0003923956,0.93356407,0.062032603,0.002622989,0.00022031761,0.0002935348],"about_ca_topic_score_codex":0.0006505971,"about_ca_topic_score_gemma":0.0006070302,"teacher_disagreement_score":0.8785512,"about_ca_system_score_codex":0.00007262039,"about_ca_system_score_gemma":0.00006990542,"threshold_uncertainty_score":0.95706105},"labels":[],"label_agreement":null},{"id":"W4406753720","doi":"10.1109/tdsc.2025.3533029","title":"A Proactive Defense Against Model Poisoning Attacks in Federated Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computer security","score_opus":0.010931011662338857,"score_gpt":0.26052253823047294,"score_spread":0.24959152656813408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406753720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12976599,0.000071069415,0.8669236,0.00024041595,0.00030655327,0.00022212694,8.4155226e-7,0.0002770128,0.0021924],"genre_scores_gemma":[0.969343,0.000018574357,0.030042281,0.00025745726,0.000017901528,0.000010872365,0.0000014611812,0.00001948061,0.00028898445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980221,0.00023409374,0.00036649604,0.0006824601,0.0002152882,0.00047956902],"domain_scores_gemma":[0.9991011,0.00040007225,0.000110078756,0.0002215828,0.000087074885,0.000080095124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004903505,0.00027606555,0.0003192447,0.00044802896,0.0009608542,0.00031646198,0.00033148023,0.00016062226,0.0000027187418],"category_scores_gemma":[0.00004455125,0.00029336027,0.00007660376,0.0009010968,0.000040151765,0.0004929917,0.000024779189,0.0013409855,0.0000047352137],"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.000030401228,0.000058490572,0.00019398454,0.000024577974,0.000037984257,0.000030636296,0.0017066075,0.9236761,0.00027540064,0.0010460175,0.0000074131804,0.07291241],"study_design_scores_gemma":[0.0008241033,0.00004586073,0.00007754048,0.00023172093,0.000013852176,0.000013481928,0.0003567061,0.99619085,0.0015571755,0.00037374184,0.000047500598,0.0002674544],"about_ca_topic_score_codex":0.00007234374,"about_ca_topic_score_gemma":0.000084243955,"teacher_disagreement_score":0.839577,"about_ca_system_score_codex":0.00014338386,"about_ca_system_score_gemma":0.0001658181,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W4406856692","doi":"10.1109/tdsc.2025.3535086","title":"Towards Integrated Spatial Crowdsourcing: Online Privacy-Preserving Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Crowdsourcing; Computer science; Selection (genetic algorithm); Information privacy; Internet privacy; World Wide Web; Artificial intelligence","score_opus":0.018961871594725222,"score_gpt":0.2719712461458764,"score_spread":0.2530093745511512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406856692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05269375,0.00013689008,0.9382606,0.005956597,0.00094258087,0.0002510411,0.00002348747,0.001365422,0.00036958934],"genre_scores_gemma":[0.8305298,0.000046284844,0.16898893,0.00025492825,0.00004138042,0.000007417608,0.000008186904,0.000017574554,0.00010547699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769914,0.00013517236,0.0004551974,0.00086405163,0.00030881513,0.0005376206],"domain_scores_gemma":[0.9968391,0.00025846352,0.00012776571,0.0025083653,0.00017293653,0.00009333599],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00042034895,0.00033220428,0.0003403888,0.0005608497,0.00073438266,0.00041562106,0.0072956705,0.00026524064,0.000026155727],"category_scores_gemma":[0.00084366195,0.00032741635,0.000096468335,0.0014257925,0.00007443072,0.0005923228,0.0015524009,0.0009960786,0.000007192948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000597993,0.0004110098,0.0003386506,0.00013637201,0.00020074316,0.000035717487,0.00041034774,0.00848968,0.003482288,0.0007004671,0.009989218,0.97574574],"study_design_scores_gemma":[0.00053753937,0.00010947584,0.00027986648,0.00026378408,0.00002863336,0.0000437637,0.00009151993,0.9426237,0.044570047,0.008868942,0.0022726555,0.00031012524],"about_ca_topic_score_codex":0.00084039726,"about_ca_topic_score_gemma":0.00037367147,"teacher_disagreement_score":0.97543555,"about_ca_system_score_codex":0.00016265869,"about_ca_system_score_gemma":0.0001980337,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W4407371961","doi":"10.1109/tdsc.2025.3540980","title":"Chained HotStuff Under Performance Attack","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security; Computer network","score_opus":0.013662090218344788,"score_gpt":0.2510199759040015,"score_spread":0.2373578856856567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407371961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014223,0.00020116768,0.8663615,0.00047801624,0.0009301861,0.00014630206,0.0000062652507,0.00019619419,0.0015381364],"genre_scores_gemma":[0.99616694,0.0000405595,0.0022623253,0.00048629372,0.00003422698,0.000007327919,0.0000013384213,0.000008053158,0.0009929156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867314,0.000049069746,0.0002846265,0.00046050103,0.00018566876,0.00034697913],"domain_scores_gemma":[0.99929756,0.000096912845,0.00006441473,0.00037890504,0.00007996564,0.000082267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023073956,0.00019649853,0.00023732393,0.00015018595,0.00058516674,0.00022342674,0.0003892155,0.00010043951,0.000007851367],"category_scores_gemma":[0.0000018201025,0.00018494904,0.00007107375,0.0005816262,0.000035009813,0.00030387807,0.000008767588,0.00029772014,0.000021969063],"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.00005831955,0.0005108525,0.00047051994,0.0004999612,0.0003020964,0.00005029091,0.0018806023,0.41699886,0.0011699757,0.02349094,0.0026406136,0.551927],"study_design_scores_gemma":[0.000773955,0.000093774164,0.0006914503,0.000270027,0.000016059026,0.000040109742,0.00014352941,0.98852515,0.0035918707,0.00015587494,0.005400978,0.00029722662],"about_ca_topic_score_codex":0.00003387283,"about_ca_topic_score_gemma":0.00002670987,"teacher_disagreement_score":0.86602473,"about_ca_system_score_codex":0.00004204689,"about_ca_system_score_gemma":0.00006795446,"threshold_uncertainty_score":0.7542003},"labels":[],"label_agreement":null},{"id":"W4407506754","doi":"10.1109/tdsc.2025.3541728","title":"MultiFile View: File-View-Based Isolation in a Single-User Environment to Protect User Data Files","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Computer science; Isolation (microbiology); Operating system; Database","score_opus":0.02059442281346258,"score_gpt":0.2621174401085737,"score_spread":0.2415230172951111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407506754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025755458,0.00010015391,0.9952056,0.0004806376,0.00022272053,0.0008706466,0.00011196346,0.0003702766,0.000062490195],"genre_scores_gemma":[0.6837091,0.000021801216,0.31517702,0.0006077986,0.000021511918,0.00013130797,0.000025564756,0.000021836338,0.00028409416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.00012730944,0.00040277242,0.00084663945,0.00021526836,0.00033047047],"domain_scores_gemma":[0.99855155,0.0003197366,0.000093194474,0.000911364,0.00004167325,0.0000825094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031611547,0.00024611034,0.00025739238,0.00043204383,0.0003163598,0.0001532073,0.00063626346,0.00011906168,0.00009760876],"category_scores_gemma":[0.0000260344,0.00025665283,0.000048182108,0.0006588764,0.00002956216,0.00052115833,0.00004508982,0.00037070466,0.000021591837],"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.00007561006,0.0005564374,0.00003642726,0.00017704764,0.000039092425,0.000028172939,0.0005522789,0.29184395,0.009829383,0.00014371445,0.0025387194,0.6941792],"study_design_scores_gemma":[0.0006341006,0.00021004785,0.00017097034,0.0005346379,0.000014455704,0.000009125195,0.000043818112,0.83987516,0.09048235,0.0002083302,0.06738976,0.0004272602],"about_ca_topic_score_codex":0.00007664253,"about_ca_topic_score_gemma":0.00021783116,"teacher_disagreement_score":0.6937519,"about_ca_system_score_codex":0.00013712933,"about_ca_system_score_gemma":0.000057257566,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W4407638124","doi":"10.1109/tdsc.2025.3542761","title":"New Secure Sparse Inner Product With Applications to Machine Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Product (mathematics); Artificial intelligence; Computer security","score_opus":0.010138908995805496,"score_gpt":0.23928451255183247,"score_spread":0.22914560355602698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407638124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007461968,0.00013416949,0.99597895,0.0011558871,0.00016968082,0.000634609,0.0000032660912,0.0005996743,0.0005775713],"genre_scores_gemma":[0.6610091,0.000010090772,0.3377136,0.00032211703,0.000031707703,0.00004194534,0.0000023725852,0.000014803218,0.00085430825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862236,0.000045547866,0.00023578737,0.0006098118,0.0001991449,0.00028736886],"domain_scores_gemma":[0.9991577,0.00010887606,0.00006954413,0.0003947814,0.00012192737,0.00014714489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016701876,0.00021378256,0.00020158719,0.00038014565,0.0005373347,0.00019619284,0.00038189723,0.000059874834,0.000012660953],"category_scores_gemma":[0.000007687108,0.00019402828,0.000038224887,0.001292329,0.000023254499,0.00020450904,0.000014967251,0.0003874116,0.000010485268],"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.00004617112,0.00016542598,0.00023959274,0.00007522837,0.000102273,0.000010143335,0.001598844,0.67319846,0.00041795758,0.02976481,0.0007649043,0.2936162],"study_design_scores_gemma":[0.0010139238,0.00045448725,0.00010712582,0.00034966788,0.00007678738,0.00011006369,0.000095964286,0.9553249,0.024908425,0.001911631,0.0149458945,0.0007011506],"about_ca_topic_score_codex":0.000101908925,"about_ca_topic_score_gemma":0.000079953374,"teacher_disagreement_score":0.6602629,"about_ca_system_score_codex":0.000045666184,"about_ca_system_score_gemma":0.000117275995,"threshold_uncertainty_score":0.7912244},"labels":[],"label_agreement":null},{"id":"W4409882654","doi":"10.1109/tdsc.2025.3564697","title":"Poisoning as a Post-Protection: Mitigating Membership Privacy Leakage From Gradient and Prediction of Federated Models","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"HIV, Drug Use, Sexual Risk","field":"Medicine","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Leakage (economics); Computer science; Computer security; Privacy protection; Information privacy; Internet privacy","score_opus":0.04057071849102817,"score_gpt":0.2899999680208071,"score_spread":0.2494292495297789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409882654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7275604,0.00026118514,0.27010491,0.00041431605,0.00023183833,0.00040193798,0.00003546939,0.00013139154,0.0008585529],"genre_scores_gemma":[0.9974415,0.00004467929,0.002012824,0.00019424515,0.000056812976,0.000012209583,0.00001901454,0.000027056567,0.00019168323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984369,0.000100745754,0.00046319244,0.00047933965,0.00024286086,0.0002769609],"domain_scores_gemma":[0.9991174,0.0002233554,0.00012996563,0.00019690496,0.0001920189,0.00014035418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023535149,0.00023617795,0.00039539102,0.00025794934,0.00057206943,0.00008772976,0.00006040471,0.0001788083,0.000029922137],"category_scores_gemma":[0.000042014075,0.00023464023,0.00007577733,0.00038211266,0.0000710919,0.00024833332,0.000006924984,0.00058345025,0.0000025577249],"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.003813329,0.0016926582,0.002412883,0.0029114066,0.0027296504,0.00025187727,0.121557884,0.123743765,0.23294255,0.0013662238,0.00016938949,0.5064084],"study_design_scores_gemma":[0.0032004863,0.0008861894,0.0007658422,0.0020184987,0.00043430756,0.00016952916,0.021091739,0.86777365,0.10221534,0.0010921735,0.00006650188,0.00028573678],"about_ca_topic_score_codex":0.0012447998,"about_ca_topic_score_gemma":0.000119746874,"teacher_disagreement_score":0.7440299,"about_ca_system_score_codex":0.00007598168,"about_ca_system_score_gemma":0.000109205655,"threshold_uncertainty_score":0.9568351},"labels":[],"label_agreement":null},{"id":"W4410204358","doi":"10.1109/tdsc.2025.3568160","title":"On Estimating the Strength of Differentially Private Mechanisms in a Black-Box Setting","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Metallurgy and Material Forming","field":"Engineering","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":"Mila - Quebec Artificial Intelligence Institute","funders":"European Commission","keywords":"Black box; Computer science; Artificial intelligence","score_opus":0.005935516813452162,"score_gpt":0.2147835631961579,"score_spread":0.20884804638270574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410204358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50023687,0.000013638677,0.49885058,0.000016678661,0.00044388388,0.00009596805,0.0000031894115,0.000055502234,0.00028367617],"genre_scores_gemma":[0.99368083,0.000009142585,0.0062096785,0.00003115002,0.000017852326,0.000004465574,0.0000014610017,0.000016024731,0.000029399554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991465,0.00004269414,0.0003186917,0.00016598255,0.00010573264,0.00022037745],"domain_scores_gemma":[0.99954337,0.0002230397,0.00004608521,0.00014671743,0.00001446453,0.000026331336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024604684,0.00015956184,0.00021116337,0.00015161693,0.0001776128,0.000043872147,0.000117533076,0.00007595308,0.0000251944],"category_scores_gemma":[0.000009174759,0.00012923835,0.000050689152,0.00019529607,0.000024063702,0.000063681226,0.000004108619,0.00029310273,0.0000022822733],"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.000032915435,0.000054493597,0.000005975932,0.00035587524,0.00008513387,0.0000062760832,0.0010126457,0.92243075,0.021238144,0.008603166,0.0000067724272,0.04616786],"study_design_scores_gemma":[0.00041627584,0.000042450465,0.000053203894,0.0005605792,0.000031868844,0.0000037226262,0.0001320926,0.8561563,0.13952075,0.002927081,0.000020817975,0.00013488792],"about_ca_topic_score_codex":0.000029235793,"about_ca_topic_score_gemma":0.000052105264,"teacher_disagreement_score":0.49344397,"about_ca_system_score_codex":0.00002356659,"about_ca_system_score_gemma":0.000013144931,"threshold_uncertainty_score":0.5270187},"labels":[],"label_agreement":null},{"id":"W4410614229","doi":"10.1109/tdsc.2025.3572527","title":"The Power of Bias: Optimizing Client Selection in Federated Learning With Heterogeneous Differential Privacy","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Differential privacy; Selection (genetic algorithm); Information privacy; Selection bias; Computer network; Computer security; Data mining; Artificial intelligence","score_opus":0.015804476810245365,"score_gpt":0.2497590021081102,"score_spread":0.23395452529786484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410614229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36031675,0.0000768585,0.63857305,0.00052278076,0.00015597134,0.00013202365,9.38446e-7,0.0001724154,0.000049176757],"genre_scores_gemma":[0.9767862,0.00006666893,0.023076313,0.000025676198,0.0000048426004,0.000007445128,7.28531e-7,0.000009683737,0.000022460765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854225,0.00015289267,0.0003308956,0.00043630647,0.00020311424,0.0003345296],"domain_scores_gemma":[0.99860346,0.00041239825,0.0001294579,0.0007451024,0.0000787637,0.000030829706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032056254,0.00017782045,0.00021269785,0.00025144158,0.000726618,0.00027127223,0.0021749996,0.00010512672,0.0000027962112],"category_scores_gemma":[0.00020528903,0.00013369673,0.00004408706,0.0007996642,0.00006938551,0.00020793019,0.0004044639,0.00060139253,7.4235277e-7],"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.0003997697,0.0006182517,0.002289222,0.00018075197,0.0004386711,0.00006370793,0.0018728911,0.6500605,0.008684087,0.00094732514,0.00048334253,0.33396155],"study_design_scores_gemma":[0.0005702542,0.00021463506,0.00020142936,0.00022520134,0.000012395835,0.00003738524,0.00014514392,0.9498695,0.047776375,0.0006715989,0.00011788485,0.00015817104],"about_ca_topic_score_codex":0.00006509304,"about_ca_topic_score_gemma":0.00012731952,"teacher_disagreement_score":0.61646944,"about_ca_system_score_codex":0.00006936748,"about_ca_system_score_gemma":0.00006812983,"threshold_uncertainty_score":0.55886316},"labels":[],"label_agreement":null},{"id":"W4411202919","doi":"10.1109/tdsc.2025.3578676","title":"DGADM-GIS: Deterministic Guided Additive Diffusion Model for Generative Image Steganography","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Steganography; Generative model; Steganography tools; Image (mathematics); Generative grammar; Artificial intelligence; Computer vision; Theoretical computer science","score_opus":0.017328495677911147,"score_gpt":0.27948616283430494,"score_spread":0.26215766715639377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411202919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008594548,0.00007640419,0.9893979,0.00017049597,0.00036311644,0.00052471657,0.000063940155,0.0004190331,0.0003898522],"genre_scores_gemma":[0.74499327,0.000057422465,0.25432238,0.00037542058,0.00002305846,0.00005874624,0.0000051804195,0.000013380259,0.00015115619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835765,0.00007591726,0.000363477,0.0006419715,0.00015981875,0.00040114197],"domain_scores_gemma":[0.9989465,0.00029981445,0.00011270711,0.0003810458,0.00017135037,0.00008856913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021269766,0.0002956245,0.00030304,0.00044167216,0.001000593,0.00023267568,0.0004285018,0.00013188437,0.0000016348862],"category_scores_gemma":[0.000007870655,0.0002772857,0.00019899331,0.00051581464,0.00009542468,0.0004318311,0.000017418568,0.00027959896,7.448772e-7],"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.0004419791,0.0011877156,0.00007630393,0.0006275186,0.00065535516,0.00010512497,0.0111126285,0.116315916,0.024767661,0.050819762,0.0035501362,0.7903399],"study_design_scores_gemma":[0.0005934565,0.00014522388,0.000012857097,0.00017745009,0.00003986012,0.000014591315,0.000056656485,0.9397234,0.043052915,0.01553469,0.00035589933,0.000293016],"about_ca_topic_score_codex":0.0000076155343,"about_ca_topic_score_gemma":0.000020940586,"teacher_disagreement_score":0.8234075,"about_ca_system_score_codex":0.00003258571,"about_ca_system_score_gemma":0.00006437404,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W4411799552","doi":"10.1109/tdsc.2025.3584123","title":"LocalSketch: An Accurate and Efficient Sketch for Range Spread Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Sketch; Range (aeronautics); Estimation; Algorithm; Engineering","score_opus":0.01670780972740703,"score_gpt":0.30358379120529594,"score_spread":0.2868759814778889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411799552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02092848,0.0001859624,0.9772906,0.00029899977,0.0003131487,0.00047623305,0.00002184071,0.00040643034,0.00007836008],"genre_scores_gemma":[0.8044717,0.000029315628,0.19520542,0.00019049172,0.000013517877,0.000028314971,0.000003946861,0.000009768704,0.00004755257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868524,0.00005442838,0.00027766256,0.0005686981,0.00014163065,0.00027231505],"domain_scores_gemma":[0.9989378,0.0003668481,0.00008437581,0.00042015474,0.00009338933,0.00009742951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003037549,0.00019673847,0.00022076245,0.00022086164,0.00056375074,0.00022885206,0.0003344342,0.00009658079,0.0000025865693],"category_scores_gemma":[0.0000120326895,0.00018623803,0.000042363597,0.000314034,0.000046627953,0.0004797815,0.000024199275,0.00020340027,0.0000014112904],"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.000051024028,0.00015676359,0.000008118896,0.00012280644,0.000023697492,0.000004789337,0.0004857125,0.12094339,0.0009757879,0.008470535,0.00013175656,0.86862564],"study_design_scores_gemma":[0.0005285407,0.00011882839,0.00004629023,0.0001575908,0.00001735271,0.00001579602,0.0000405389,0.96595466,0.02707536,0.005410871,0.00044679444,0.00018737526],"about_ca_topic_score_codex":0.000020294015,"about_ca_topic_score_gemma":0.000016613909,"teacher_disagreement_score":0.86843824,"about_ca_system_score_codex":0.00003121176,"about_ca_system_score_gemma":0.000040437433,"threshold_uncertainty_score":0.75945663},"labels":[],"label_agreement":null},{"id":"W4411948507","doi":"10.1109/tdsc.2025.3584924","title":"DTHA: A Digital Twin-Assisted Handover Authentication Scheme for 5G and Beyond","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Handover; Computer network; Scheme (mathematics); Authentication (law); Computer security; Mathematics","score_opus":0.012512298736879927,"score_gpt":0.2757864622452119,"score_spread":0.263274163508332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411948507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015835177,0.00009347277,0.9809782,0.0005736149,0.00025438832,0.0017076056,0.000016590999,0.00017416848,0.00036679805],"genre_scores_gemma":[0.9687738,0.0000058102646,0.030381816,0.00022907997,0.000017420223,0.00022255491,0.0000036620165,0.000010905974,0.00035497991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987186,0.000029550005,0.00029717485,0.0005363472,0.00014998612,0.00026832093],"domain_scores_gemma":[0.9990568,0.00030151897,0.000099529265,0.00033018357,0.00012454296,0.0000874109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017909189,0.00018414948,0.00019999177,0.00017297917,0.00053737604,0.00041312203,0.00024992306,0.00009108449,0.0000037820446],"category_scores_gemma":[0.00002039305,0.00018584666,0.00006815901,0.00035215355,0.00006635265,0.00062610203,0.000009684582,0.00018845666,0.0000042627635],"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.00019997911,0.0009899044,0.00032531656,0.0007198356,0.0003078795,0.000009220916,0.0047836127,0.0021433302,0.008730575,0.25243694,0.00018787516,0.72916555],"study_design_scores_gemma":[0.0030683165,0.00020334827,0.00057431933,0.00024112087,0.000057141195,0.000049911436,0.00017178648,0.8962538,0.034185246,0.061454415,0.0032157206,0.0005248398],"about_ca_topic_score_codex":0.0000035326302,"about_ca_topic_score_gemma":0.000006097359,"teacher_disagreement_score":0.9529386,"about_ca_system_score_codex":0.000040327915,"about_ca_system_score_gemma":0.00006046426,"threshold_uncertainty_score":0.75786066},"labels":[],"label_agreement":null},{"id":"W4413155652","doi":"10.1109/tdsc.2025.3598300","title":"MoiréComm: Secure Screen-Camera Communication Based on Moiré Cryptography","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Moiré pattern; Cryptography; Secure communication; Visual cryptography; Computer security; Computer vision; Encryption; Secret sharing","score_opus":0.009151512800359609,"score_gpt":0.2475717792949426,"score_spread":0.23842026649458298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413155652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050668805,0.00023945463,0.98985785,0.0009499724,0.00026093083,0.0003087022,0.00001199581,0.0007197613,0.0025844714],"genre_scores_gemma":[0.8805555,0.000092718816,0.11795485,0.0013097072,0.000014452965,0.000019947163,0.0000061292108,0.000015095033,0.000031564894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982331,0.00020875846,0.00034976465,0.0005650459,0.00025560148,0.00038776413],"domain_scores_gemma":[0.99831074,0.0004048359,0.000116752046,0.0009630263,0.00010711746,0.00009749681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003580746,0.0003107445,0.00029081077,0.0006738742,0.0011149261,0.0002586361,0.0008223456,0.0001726457,0.0000069655503],"category_scores_gemma":[0.0000046719733,0.00030176385,0.00018732915,0.0010942508,0.00010297762,0.00036808723,0.00001839763,0.00069282815,0.0000031944162],"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.00031908846,0.0014208449,0.0009764746,0.00028384358,0.00033912092,0.000054786058,0.0021012407,0.19229166,0.00095446024,0.11152832,0.0022320123,0.68749815],"study_design_scores_gemma":[0.0012621708,0.0003837267,0.0003933796,0.00085160614,0.000052819094,0.000014969138,0.000093928524,0.9482219,0.023032429,0.018801361,0.0062147644,0.0006769231],"about_ca_topic_score_codex":0.000055351575,"about_ca_topic_score_gemma":0.00004490141,"teacher_disagreement_score":0.87548864,"about_ca_system_score_codex":0.000037774138,"about_ca_system_score_gemma":0.00004744879,"threshold_uncertainty_score":0.99994344},"labels":[],"label_agreement":null},{"id":"W4413468163","doi":"10.1109/tdsc.2025.3598867","title":"BM-PDA: Blockchain Based Multifunctional Private-Preserving Data Aggregation for e-Health Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blockchain; Computer science; Computer security","score_opus":0.026370150529735032,"score_gpt":0.28951189761985874,"score_spread":0.2631417470901237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413468163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013037118,0.0005441984,0.980724,0.0035639275,0.0007564467,0.00080761494,0.00008138165,0.00043685426,0.000048466056],"genre_scores_gemma":[0.94558764,0.000016489563,0.053578924,0.00055026636,0.00004839274,0.000081998034,0.000025209,0.000013205061,0.00009789372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801,0.00010281079,0.00045888056,0.0008395834,0.00019939369,0.00038936714],"domain_scores_gemma":[0.99793446,0.0005151462,0.00017411447,0.0011518828,0.00013556704,0.00008880236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009206162,0.00021829888,0.0002890962,0.00034568497,0.0012528951,0.00018463694,0.0010585826,0.00019512408,0.0000035760643],"category_scores_gemma":[0.000025223917,0.0002248821,0.000061127466,0.00066875434,0.000056264653,0.00013134547,0.000041285362,0.00039607813,0.0000028112593],"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.00009619484,0.00086567504,0.00020750376,0.0010251822,0.0002953763,0.000006395208,0.00069214834,0.4710006,0.00056527264,0.121092975,0.0042525437,0.3999001],"study_design_scores_gemma":[0.0007381669,0.00006984936,0.00003875417,0.0001748621,0.000018237239,0.000010703921,0.00006524924,0.9894184,0.0014492519,0.0013433147,0.0064883702,0.00018485465],"about_ca_topic_score_codex":0.00012927764,"about_ca_topic_score_gemma":0.00009288635,"teacher_disagreement_score":0.9325505,"about_ca_system_score_codex":0.00008522485,"about_ca_system_score_gemma":0.00022663052,"threshold_uncertainty_score":0.9636383},"labels":[],"label_agreement":null},{"id":"W4413786017","doi":"10.1109/tdsc.2025.3603639","title":"I2I Backdoor: Backdoor Attacks Against Image-to-Image Tasks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Backdoor; Computer science; Image (mathematics); Computer security; Artificial intelligence; Computer vision","score_opus":0.008572549446998498,"score_gpt":0.2709500114351712,"score_spread":0.26237746198817274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413786017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020856716,0.000077392404,0.968843,0.001515273,0.001578924,0.00035546764,0.000010158724,0.0004739082,0.006289198],"genre_scores_gemma":[0.83331823,0.00002286807,0.16391349,0.0014687604,0.000104734376,0.000011257383,0.0000032931964,0.000033231387,0.0011241058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972894,0.00020465317,0.00049244927,0.0009768938,0.0003594922,0.0006771213],"domain_scores_gemma":[0.99837697,0.00037065713,0.00012219588,0.00072750164,0.00016936351,0.0002333028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005578585,0.00040586636,0.00043177535,0.00046075124,0.0010620359,0.00056373083,0.0009405309,0.00018120036,0.0000518627],"category_scores_gemma":[0.000042529995,0.00042026915,0.00015974286,0.0011109512,0.00008659384,0.0006641479,0.000059381797,0.0009739314,0.0001594711],"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.000095704374,0.00032830643,0.00010788977,0.00025563245,0.0002471465,0.00021585292,0.002771359,0.5112831,0.008657798,0.004121616,0.0035029096,0.46841267],"study_design_scores_gemma":[0.0013860143,0.00014980279,0.0002481346,0.0003642439,0.00005742164,0.00004335038,0.00028313763,0.9755799,0.011259658,0.00046589025,0.009411149,0.0007512814],"about_ca_topic_score_codex":0.00007775366,"about_ca_topic_score_gemma":0.000040399933,"teacher_disagreement_score":0.81246156,"about_ca_system_score_codex":0.00011498198,"about_ca_system_score_gemma":0.00014082568,"threshold_uncertainty_score":0.99982494},"labels":[],"label_agreement":null},{"id":"W4413925826","doi":"10.1109/tdsc.2025.3605197","title":"WFCAT: Augmenting Website Fingerprinting With Channel-Wise Attention on Timing Features","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Research Foundation Singapore","keywords":"Computer science; Channel (broadcasting); Fingerprint (computing); Computer network; Computer security","score_opus":0.009607949373425033,"score_gpt":0.2412968135845509,"score_spread":0.23168886421112586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089967296,0.00009478334,0.9073422,0.00029915068,0.00034347904,0.00021142144,0.0000019074494,0.000543497,0.0011962893],"genre_scores_gemma":[0.97068554,0.000027665976,0.02866901,0.00030538376,0.000033957705,0.000008575095,0.0000014860199,0.000015470976,0.0002528817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984265,0.000070825736,0.00025818558,0.0006105923,0.00021722185,0.00041664904],"domain_scores_gemma":[0.99920857,0.00017603094,0.000124753,0.00035651374,0.00006928189,0.00006482514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030540957,0.00026858947,0.00023341257,0.00044323102,0.00107254,0.00030447388,0.00034227074,0.00010481447,0.0000014753929],"category_scores_gemma":[0.000003985877,0.00023815033,0.00009900786,0.0006198705,0.000043954773,0.0003943556,0.000017317088,0.0005023317,0.0000025078564],"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.00033298746,0.0006653484,0.00107819,0.00064615614,0.00051029585,0.0002114642,0.004428133,0.15458064,0.010810697,0.013467324,0.0003226006,0.81294614],"study_design_scores_gemma":[0.0027835506,0.0010252,0.003595066,0.006748428,0.00020332825,0.0002673038,0.0005561366,0.7311321,0.2429434,0.0069739623,0.0017939206,0.0019776125],"about_ca_topic_score_codex":0.000025239355,"about_ca_topic_score_gemma":0.000019180716,"teacher_disagreement_score":0.8807183,"about_ca_system_score_codex":0.00003773501,"about_ca_system_score_gemma":0.00002617078,"threshold_uncertainty_score":0.9711489},"labels":[],"label_agreement":null},{"id":"W4414693351","doi":"10.1109/tdsc.2025.3616852","title":"An Algorithm for Persistent Homology Computation Using Homomorphic Encryption","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Topological and Geometric Data Analysis","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":"National Research Council Canada","funders":"","keywords":"Homomorphic encryption; Correctness; Persistent homology; Plaintext; Encryption; Topological data analysis; Robustness (evolution)","score_opus":0.024047477243892276,"score_gpt":0.2898076227512733,"score_spread":0.26576014550738103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414693351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041291304,0.00019084243,0.9574108,0.00020088615,0.00048542116,0.00019559907,0.000020841715,0.00017727539,0.000026998792],"genre_scores_gemma":[0.82589304,0.000017775914,0.17380169,0.00020401434,0.000030064082,0.000006133658,0.000008439605,0.0000061233786,0.000032740907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.000098503355,0.0002712118,0.00053263607,0.00013768431,0.00028902618],"domain_scores_gemma":[0.9992293,0.00023867576,0.000081949984,0.0002360982,0.00012631156,0.00008766681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093421,0.00016320968,0.00025119682,0.00048969925,0.00070691056,0.0001876579,0.000304955,0.0001201872,0.000007266269],"category_scores_gemma":[0.0000056297986,0.00015229161,0.00014608598,0.00095429766,0.0000541126,0.0003272341,0.000007921279,0.00018091779,0.000003340026],"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.000010938647,0.0002467195,0.000016418333,0.00002714975,0.00012750064,0.000009054639,0.00021667447,0.18325473,0.00041970573,0.0021232304,0.000041783973,0.81350607],"study_design_scores_gemma":[0.00044656047,0.0002745483,0.000065862674,0.000023327137,0.00009168992,0.000040325718,0.00014561188,0.9962809,0.0006607175,0.0016393217,0.0001683912,0.000162737],"about_ca_topic_score_codex":0.00011128329,"about_ca_topic_score_gemma":0.000014322183,"teacher_disagreement_score":0.81334335,"about_ca_system_score_codex":0.000053422067,"about_ca_system_score_gemma":0.000046545363,"threshold_uncertainty_score":0.6210272},"labels":[],"label_agreement":null},{"id":"W4415971194","doi":"10.1109/tdsc.2025.3629675","title":"Incentive Mechanism Design for Collaborative Physical Layer Authentication: A Centralized Governance Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Stackelberg competition; Incentive; Authentication (law); Physical layer; Mechanism design; Wireless; Key (lock); Reliability (semiconductor); Layer (electronics)","score_opus":0.02454033996746111,"score_gpt":0.2740580008034,"score_spread":0.24951766083593888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415971194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007746469,0.0012046075,0.9861889,0.00041580907,0.00057032926,0.0024502873,0.00022082312,0.00045574072,0.0007470616],"genre_scores_gemma":[0.9157128,0.0009692316,0.082575254,0.000094532086,0.00006309065,0.00027270577,0.000013663454,0.000067243105,0.00023147762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733263,0.00034194285,0.00064350455,0.00075205596,0.00030748695,0.0006223695],"domain_scores_gemma":[0.99764055,0.000920692,0.000229054,0.0006663029,0.00040188944,0.00014151275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046493777,0.00056448777,0.00072079373,0.00020155674,0.00097598234,0.00029790078,0.00052217505,0.00033748258,0.000018356764],"category_scores_gemma":[0.000020569312,0.00065085466,0.00022147776,0.0010144016,0.0001393564,0.00034746778,0.000016355385,0.00081519334,0.0000058933906],"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.0012338094,0.0037639167,0.00000569228,0.002687773,0.0028107238,0.000009820974,0.04307011,0.4244416,0.022505127,0.41112372,0.0016583463,0.08668934],"study_design_scores_gemma":[0.0015216625,0.00014360853,0.000008579697,0.0005268949,0.00028063476,0.000004279783,0.00094729866,0.83885735,0.1508423,0.005125138,0.0012383838,0.00050388166],"about_ca_topic_score_codex":0.000027957973,"about_ca_topic_score_gemma":0.000010913648,"teacher_disagreement_score":0.9079663,"about_ca_system_score_codex":0.0003361275,"about_ca_system_score_gemma":0.0002102046,"threshold_uncertainty_score":0.9995943},"labels":[],"label_agreement":null},{"id":"W4416078090","doi":"10.1109/tdsc.2025.3630656","title":"Mercury: Practical Cross-Chain Exchange via Trusted Hardware","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Unavailability; Cryptocurrency; Mercury (programming language); Database transaction; Trusted Computing; Trusted third party; Trusted Platform Module; Digital currency","score_opus":0.016823008317178176,"score_gpt":0.29486399051184964,"score_spread":0.27804098219467144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416078090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025755007,0.0019026711,0.96058303,0.0068960516,0.0021061357,0.000977474,0.000058620702,0.0006637195,0.0010573001],"genre_scores_gemma":[0.98272395,0.0004679891,0.014378525,0.001079054,0.00011294857,0.0000718181,0.000005531113,0.000043837703,0.0011163391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507517,0.00035111923,0.0010503132,0.0018742696,0.0004902602,0.0011588419],"domain_scores_gemma":[0.99669963,0.0007621686,0.00033650963,0.0014615984,0.00041949417,0.00032059927],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011586304,0.00075594225,0.0008296656,0.00079436786,0.0028703758,0.0007998515,0.0010237324,0.001076059,0.00017628876],"category_scores_gemma":[0.000039179802,0.00082562317,0.0003052649,0.0022622184,0.00057967677,0.0005712607,0.00007524221,0.0023867683,0.00007588545],"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.00021613736,0.0020367526,0.00017417473,0.00070649525,0.0007347508,0.00028043817,0.0035803814,0.008364724,0.000628645,0.05253837,0.0014750996,0.929264],"study_design_scores_gemma":[0.0017748009,0.00033149988,0.00018864163,0.00038480794,0.00022579616,0.00039681277,0.00023416782,0.96408546,0.011160186,0.005037938,0.015285618,0.00089426135],"about_ca_topic_score_codex":0.00020832091,"about_ca_topic_score_gemma":0.00018059582,"teacher_disagreement_score":0.95696896,"about_ca_system_score_codex":0.00018438327,"about_ca_system_score_gemma":0.0003858557,"threshold_uncertainty_score":0.99991477},"labels":[],"label_agreement":null},{"id":"W4416214608","doi":"10.1109/tdsc.2025.3632657","title":"Feed-Forward Controller-Based Recovery for Robotic Vehicles From Physical Attacks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Controller (irrigation); Spoofing attack; Cyber-physical system; Wireless sensor network; Robot","score_opus":0.009299893048253037,"score_gpt":0.24029752300071325,"score_spread":0.2309976299524602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416214608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22504817,0.0014533054,0.7689748,0.0003558993,0.0029812732,0.000708848,0.0001400851,0.00019414409,0.00014348699],"genre_scores_gemma":[0.99666685,0.00018616661,0.002020691,0.0003281216,0.00044402885,0.000037905185,0.000014314863,0.000062222745,0.0002396858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727535,0.00011884642,0.00064154126,0.00086422864,0.0002921236,0.0008078805],"domain_scores_gemma":[0.99694115,0.0022390666,0.00011353566,0.00036048156,0.00012764965,0.0002181043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025699375,0.000606153,0.0009292578,0.00032303538,0.0011167655,0.00031341516,0.00032222577,0.00041921376,0.000027381224],"category_scores_gemma":[0.000021383747,0.0006383867,0.0005241763,0.00050050294,0.00014903802,0.00023556032,0.000006090677,0.0009600956,0.000021256352],"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.00042593293,0.000342798,0.000028266546,0.00046482682,0.0004840761,0.000010415642,0.00062303693,0.9324086,0.0026205508,0.00011309253,0.00031395498,0.062164467],"study_design_scores_gemma":[0.0035394528,0.00032611366,0.00011540892,0.0009947813,0.0005241364,0.000003971283,0.00032684449,0.9661397,0.025712835,0.0005563107,0.0011669272,0.0005935489],"about_ca_topic_score_codex":0.00016764083,"about_ca_topic_score_gemma":0.0001415158,"teacher_disagreement_score":0.7716187,"about_ca_system_score_codex":0.00015423878,"about_ca_system_score_gemma":0.00017002235,"threshold_uncertainty_score":0.9996067},"labels":[],"label_agreement":null},{"id":"W4416323579","doi":"10.1109/tdsc.2025.3634446","title":"Fed-EHP: Efficient and Heterogeneous Privacy-Preserving Personalized Federated Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hyperion Technologies (Canada)","funders":"Key Research and Development Program of Zhejiang Province; National Natural Science Foundation of China","keywords":"Federated learning; Personalization; Cluster analysis; Inference; Limiting; Information privacy; Heterogeneous network","score_opus":0.01833486361537659,"score_gpt":0.26482997783234685,"score_spread":0.24649511421697026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2573792,0.0039353385,0.7307131,0.0048278123,0.0013141235,0.00059268856,0.000026251279,0.00088596315,0.00032547995],"genre_scores_gemma":[0.9704616,0.0009168938,0.02770518,0.00033144787,0.00005220629,0.000018973837,0.000006295144,0.00006094163,0.0004464692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940135,0.0006101839,0.0010211777,0.0022799806,0.0006778705,0.001397326],"domain_scores_gemma":[0.99440956,0.0011103123,0.00036589857,0.003527253,0.0002819474,0.00030500695],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011646502,0.00089980365,0.00093788427,0.00081794825,0.004084074,0.002188793,0.007908853,0.00064015185,0.00006938071],"category_scores_gemma":[0.001551858,0.0009791278,0.0002238327,0.001703387,0.0004735939,0.0005257245,0.00493552,0.0023782938,0.00001860814],"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.0006183599,0.0011500312,0.0005109978,0.001875889,0.0015201127,0.0006374205,0.0046835886,0.24576984,0.005005808,0.0008051506,0.0040628063,0.73336],"study_design_scores_gemma":[0.0017491317,0.00034961145,0.000048267753,0.0012658961,0.00014930936,0.0002695354,0.0004109065,0.97831905,0.013203522,0.0018029289,0.0016079549,0.00082389044],"about_ca_topic_score_codex":0.00022805828,"about_ca_topic_score_gemma":0.00005652377,"teacher_disagreement_score":0.7325492,"about_ca_system_score_codex":0.00025470645,"about_ca_system_score_gemma":0.00029183598,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W4417131097","doi":"10.1109/tdsc.2025.3641055","title":"NOProbe: A NOP-Based Dynamic Binary Instrumentation Framework Using Binary Rewriting on x86","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Telefonaktiebolaget LM Ericsson; Google","keywords":"x86; Instrumentation (computer programming); Binary number; Code (set theory); Binary translation; Rewriting; Binary code; Trampoline","score_opus":0.01674311255718804,"score_gpt":0.29385212819226453,"score_spread":0.2771090156350765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417131097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493265,0.00051015493,0.84577745,0.00068334845,0.0018870715,0.0007089572,0.000023556444,0.00070317654,0.0003798042],"genre_scores_gemma":[0.7573784,0.00013194355,0.24111077,0.0011413824,0.00006588771,0.000012841037,0.0000096223075,0.00004976489,0.00009939809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950231,0.0005432386,0.0011817466,0.0016556807,0.0006212752,0.0009750064],"domain_scores_gemma":[0.9971641,0.000881585,0.00051260286,0.00090930704,0.0002957712,0.00023667769],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00088335073,0.0008116874,0.0007330772,0.0014086108,0.0028501782,0.0009242331,0.0008146064,0.00061950827,0.00003136738],"category_scores_gemma":[0.000037893835,0.0009373712,0.0002947071,0.0024960116,0.00019228467,0.0005690936,0.000044024928,0.0017587866,0.000018000592],"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.00015575551,0.0005435609,0.000060316892,0.00032537238,0.000107530315,0.00006175518,0.0006087023,0.88974154,0.0011011922,0.0012942781,0.000038953815,0.105961025],"study_design_scores_gemma":[0.0011573518,0.0007361532,0.00007012339,0.0043556322,0.00012524867,0.00003660054,0.00021442596,0.97944635,0.012070701,0.0009277417,0.000070717295,0.00078896736],"about_ca_topic_score_codex":0.00009143853,"about_ca_topic_score_gemma":0.000009485754,"teacher_disagreement_score":0.6080519,"about_ca_system_score_codex":0.00045457733,"about_ca_system_score_gemma":0.000549713,"threshold_uncertainty_score":0.9993077},"labels":[],"label_agreement":null},{"id":"W7081930596","doi":"10.1109/tdsc.2025.3609641","title":"MPKS: Efficient and Privacy-Enhanced Multi-Party Keyword-Oriented Similarity Query in ehealthcare","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Scalability; Encryption; Tree traversal; Homomorphic encryption; Tree (set theory); Cloud computing; Node (physics); Information privacy; Outsourcing; Path (computing)","score_opus":0.014151051307998893,"score_gpt":0.26074085134570607,"score_spread":0.24658980003770717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081930596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2286395,0.0002370068,0.7686938,0.0013276296,0.0003520484,0.00020486566,0.0000036811782,0.00012100956,0.00042043958],"genre_scores_gemma":[0.98965603,0.000041619936,0.009715235,0.00029603558,0.00001334163,0.0000099941235,0.0000019643041,0.0000033738097,0.00026242057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833685,0.00011368025,0.0003448843,0.00065137364,0.00014282009,0.0004103822],"domain_scores_gemma":[0.99914783,0.00022230686,0.000075459815,0.00034864165,0.0000994096,0.000106349435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039242106,0.00021297508,0.0002717736,0.0001737175,0.00049020984,0.00009578707,0.00026823336,0.00015783675,0.000005353966],"category_scores_gemma":[0.00003258731,0.00021081483,0.00005022119,0.0006106328,0.000058572827,0.00011582645,0.000029750367,0.00055075175,0.0000021763303],"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.00021840441,0.0018406244,0.0042102,0.0019070132,0.00018620637,0.00021130004,0.018991591,0.6916985,0.009899483,0.006190892,0.00023623553,0.26440954],"study_design_scores_gemma":[0.0013326778,0.00006560377,0.0018095343,0.00041744506,0.000012816668,0.000025237416,0.00045437508,0.971097,0.022642052,0.0006303847,0.0011874939,0.00032540612],"about_ca_topic_score_codex":0.00011149972,"about_ca_topic_score_gemma":0.00017121367,"teacher_disagreement_score":0.76101655,"about_ca_system_score_codex":0.000050152754,"about_ca_system_score_gemma":0.000086155895,"threshold_uncertainty_score":0.859678},"labels":[],"label_agreement":null},{"id":"W7082636690","doi":"10.1109/tdsc.2025.3612882","title":"Collusion-Resistant Privacy-Preserving Outsourced Training Under Single Cloud With Semi-Honest TEE","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Outsourcing; Cloud computing; Collusion; Training (meteorology); Data modeling; Stochastic gradient descent; Information privacy; Training set; Face (sociological concept)","score_opus":0.018766684188058873,"score_gpt":0.22610690501125622,"score_spread":0.20734022082319734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082636690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12908907,0.00009987085,0.8623297,0.0023556994,0.00041231033,0.00019016957,0.000003301693,0.00027975504,0.005240113],"genre_scores_gemma":[0.9869223,0.000006310865,0.010909147,0.00043313976,0.00005447364,0.000007686511,0.0000017826437,0.000008732841,0.0016564251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809533,0.000089547124,0.00034630662,0.00068667595,0.000266321,0.0005158133],"domain_scores_gemma":[0.9986592,0.00038980888,0.00011877413,0.0005705957,0.00013439533,0.00012724695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034838435,0.00029263136,0.00032766382,0.00016400717,0.0010522369,0.00029669414,0.000676137,0.00015235863,0.000026487627],"category_scores_gemma":[0.000024018776,0.0002599484,0.0000788031,0.000748157,0.00007258346,0.00022365226,0.000048478254,0.0004612668,0.0000040570267],"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.00031769392,0.00074531604,0.00025459396,0.00068637665,0.00049244973,0.0002812745,0.017257378,0.8277821,0.08102289,0.0065391827,0.001073477,0.06354725],"study_design_scores_gemma":[0.0028673485,0.00049714313,0.0004025814,0.0017349542,0.00012583743,0.0002750796,0.0046951063,0.89705706,0.069772914,0.0053258664,0.015993766,0.0012523204],"about_ca_topic_score_codex":0.00005808304,"about_ca_topic_score_gemma":0.00007874776,"teacher_disagreement_score":0.8578332,"about_ca_system_score_codex":0.00006393897,"about_ca_system_score_gemma":0.00013751505,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W7101589494","doi":"10.1109/tdsc.2025.3626379","title":"SXGB: Secure and Efficient Vertical Federated XGBoost via Trusted Execution Environments","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Education and Cultural Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Scheme (mathematics); Encryption; Speedup; Inference; Cloud computing; ENCODE; Information privacy; Data sharing; Cryptography","score_opus":0.012400251836987581,"score_gpt":0.2713866850307167,"score_spread":0.25898643319372916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101589494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7933867,0.0026366971,0.19387862,0.0033953977,0.0024680817,0.00077659404,0.000020878746,0.00010710179,0.0033299269],"genre_scores_gemma":[0.9965011,0.0010674696,0.00009441909,0.00047501456,0.000093877905,0.000012814401,0.0000053072727,0.000015391613,0.0017346226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974261,0.00032635647,0.00051258877,0.00072884094,0.00040131953,0.00060477323],"domain_scores_gemma":[0.9991671,0.00026320457,0.00009087718,0.0001404461,0.00008444129,0.00025397533],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038060066,0.00038947692,0.00041640308,0.00014021776,0.004692934,0.00038104592,0.00013422994,0.00032628243,0.00021582551],"category_scores_gemma":[0.000018686933,0.00037033707,0.00011431689,0.00064519915,0.0004462216,0.00015288885,0.000011720442,0.0006017476,0.000030569365],"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.0013011898,0.006754729,0.0017844818,0.0011788406,0.0031248173,0.00008211237,0.22288355,0.053378854,0.017517291,0.009487695,0.0038945794,0.6786119],"study_design_scores_gemma":[0.009712485,0.0013257355,0.01202121,0.0026751515,0.0023671307,0.00010001445,0.17868279,0.6942489,0.035267666,0.0011037654,0.058644887,0.0038502757],"about_ca_topic_score_codex":0.00044227298,"about_ca_topic_score_gemma":0.0005307853,"teacher_disagreement_score":0.6747616,"about_ca_system_score_codex":0.00022489489,"about_ca_system_score_gemma":0.00011265491,"threshold_uncertainty_score":0.99987483},"labels":[],"label_agreement":null},{"id":"W7104008756","doi":"10.1109/tdsc.2025.3628884","title":"Blockchain-Assisted Conditional Anonymous Authentication and Adaptive Tree-Based Group Key Agreement for VANETs","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Group key; Authentication (law); Key (lock); Anonymity; Mutual authentication; Pseudonym; Key management; Vehicular ad hoc network; Cryptography","score_opus":0.011429981100854228,"score_gpt":0.22951669299222324,"score_spread":0.21808671189136902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104008756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13168369,0.0016323668,0.8634123,0.00029917434,0.0009881918,0.0013569605,0.00022917558,0.00017691137,0.00022121982],"genre_scores_gemma":[0.9908586,0.000078487064,0.008157428,0.00021615013,0.00013897395,0.00009591493,0.000103694874,0.00006773629,0.00028299616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705464,0.00016525124,0.0007629104,0.00088512787,0.0003450158,0.0007870797],"domain_scores_gemma":[0.99818546,0.00084833,0.00017334596,0.00034881692,0.00018954878,0.00025450313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005170907,0.00061680796,0.0006050209,0.00045027622,0.001073092,0.00022697482,0.0001812816,0.0004289925,0.000068503825],"category_scores_gemma":[0.000009957943,0.00072420895,0.00022789562,0.00048304893,0.00014317941,0.00011522121,0.0000072136727,0.00070943177,0.000007108248],"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.00025379876,0.0003392612,0.000016686981,0.00046751733,0.00062508247,0.000019730127,0.0005263529,0.93174267,0.0015701515,0.0010579472,0.00018354245,0.06319723],"study_design_scores_gemma":[0.003681292,0.00045794074,0.0006007908,0.00075966126,0.0006747929,0.000036739722,0.00027493498,0.9883071,0.003213648,0.00043758808,0.0009545446,0.0006009316],"about_ca_topic_score_codex":0.0000515668,"about_ca_topic_score_gemma":0.0004591273,"teacher_disagreement_score":0.8591749,"about_ca_system_score_codex":0.00027739053,"about_ca_system_score_gemma":0.00013501938,"threshold_uncertainty_score":0.9995209},"labels":[],"label_agreement":null},{"id":"W7115907317","doi":"10.1109/tdsc.2025.3645856","title":"Two-Server Offline/Online Private Information Retrieval With Small Client Storage","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Server; Outsourcing; Private information retrieval; Task (project management); File server; Scheme (mathematics); Secret sharing; Sublinear function; Computational complexity theory","score_opus":0.013743955289987881,"score_gpt":0.23959824611586086,"score_spread":0.225854290825873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115907317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701116,0.00036530054,0.71971685,0.00038807746,0.0013810202,0.0005419724,0.00019180271,0.00018446852,0.00021932206],"genre_scores_gemma":[0.9649206,0.00030094638,0.03364172,0.00091574405,0.00009773442,0.0000042737224,0.00005845969,0.000020368117,0.000040182982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636465,0.00023080889,0.0010393371,0.00094557693,0.00058974756,0.0008298906],"domain_scores_gemma":[0.9976102,0.0003027789,0.00039137565,0.001027081,0.0003679158,0.000300655],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00080168707,0.0006424945,0.00061144395,0.000794457,0.0013913204,0.0010161009,0.00084024173,0.00029383544,0.000038235066],"category_scores_gemma":[0.000014818879,0.0006081131,0.00023268219,0.002414775,0.00019993317,0.0018358367,0.000051612915,0.0013800302,0.000018641142],"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.0032613948,0.0036105427,0.0007399499,0.0022664072,0.0013891519,0.00021144791,0.01214648,0.36645475,0.00043503588,0.0661822,0.0003315407,0.5429711],"study_design_scores_gemma":[0.0055695307,0.0010499011,0.0010009746,0.0014444145,0.00035770892,0.00012635188,0.00061848166,0.9723738,0.0051829903,0.00097520195,0.010131219,0.0011694267],"about_ca_topic_score_codex":0.00019491604,"about_ca_topic_score_gemma":0.00045891083,"teacher_disagreement_score":0.6879094,"about_ca_system_score_codex":0.000110359426,"about_ca_system_score_gemma":0.00032924308,"threshold_uncertainty_score":0.99990875},"labels":[],"label_agreement":null},{"id":"W7116407680","doi":"10.1109/tdsc.2025.3646011","title":"Efficient and Secure Data Sharing With Mobile Crowdsensing in Internet of Vehicles","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Data sharing; Information privacy; The Internet; Encryption; Single point of failure; Mobile device; Data security; Protocol (science); Bloom filter; Secure multi-party computation","score_opus":0.01858765233178488,"score_gpt":0.2587873833948896,"score_spread":0.24019973106310472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116407680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50638366,0.0013485869,0.49133044,0.00007546963,0.00036290888,0.00030408255,0.0000104823985,0.000052530915,0.00013185597],"genre_scores_gemma":[0.98992336,0.00010434759,0.009676383,0.00010033291,0.000034362525,0.0000039500683,0.000003130029,0.000035242825,0.00011887185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959619,0.00018684205,0.000920873,0.0018087778,0.00038895156,0.0007326512],"domain_scores_gemma":[0.9974938,0.00050908566,0.0002888237,0.0013725102,0.00016267938,0.00017309003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012092552,0.00053655804,0.00077686465,0.0006829971,0.00055923284,0.00064132427,0.0009050677,0.00026114617,0.000007010974],"category_scores_gemma":[0.000015931364,0.0005277263,0.00007577849,0.0012277997,0.00031422146,0.0002844918,0.0001683362,0.0010452695,0.0000015858216],"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.0002165824,0.00049365574,0.0012610733,0.0010462302,0.00023053512,0.00016206708,0.010422925,0.6418008,0.002205,0.0004669693,0.000033887492,0.34166026],"study_design_scores_gemma":[0.0013676432,0.00028010618,0.0003562874,0.0045318636,0.00012286729,0.00018180654,0.0011132505,0.9793082,0.012115018,0.000051471096,0.00010567375,0.00046582927],"about_ca_topic_score_codex":0.00083939324,"about_ca_topic_score_gemma":0.00047468135,"teacher_disagreement_score":0.48353976,"about_ca_system_score_codex":0.00008740374,"about_ca_system_score_gemma":0.00020649115,"threshold_uncertainty_score":0.9997174},"labels":[],"label_agreement":null},{"id":"W7116888641","doi":"10.1109/tdsc.2025.3647497","title":"TCKKS: An Efficient TEE-Assistance CKKS Scheme Without Bootstrapping","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Homomorphic encryption; Overhead (engineering); Encryption; Scheme (mathematics); Protocol (science); Computation; Multiplication (music); Ciphertext","score_opus":0.01495754377834254,"score_gpt":0.26976911521880276,"score_spread":0.25481157144046024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116888641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17444597,0.0018606494,0.8187677,0.00037275566,0.0024975701,0.00056099833,0.000096003416,0.00035315452,0.0010451465],"genre_scores_gemma":[0.97178954,0.00029218575,0.027098877,0.0005589766,0.00012675127,0.000014965078,0.00000867137,0.00003633124,0.0000736734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944805,0.00036333213,0.0010781443,0.0021228117,0.0006872008,0.0012680368],"domain_scores_gemma":[0.99705297,0.000344348,0.00031641682,0.0015094852,0.00028205727,0.0004946966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001048408,0.0008335427,0.0008280599,0.00082448457,0.0028814038,0.001435025,0.0012613981,0.00045540452,0.000057156798],"category_scores_gemma":[0.000014309247,0.00091166946,0.00036344273,0.0022884924,0.00036334686,0.0009038,0.0000440452,0.001585837,0.00001937616],"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.00090270914,0.006413456,0.0013977146,0.0022201922,0.0014332306,0.000314824,0.015339681,0.27655512,0.0057194056,0.111238204,0.0005516075,0.5779138],"study_design_scores_gemma":[0.0016677902,0.00033672055,0.00055470684,0.0013272087,0.00016118308,0.000071503055,0.0007372143,0.9852391,0.0050997827,0.000775231,0.0030452472,0.0009843527],"about_ca_topic_score_codex":0.00021285132,"about_ca_topic_score_gemma":0.0003177042,"teacher_disagreement_score":0.7973436,"about_ca_system_score_codex":0.00012917063,"about_ca_system_score_gemma":0.0004103982,"threshold_uncertainty_score":0.9996016},"labels":[],"label_agreement":null},{"id":"W7117464464","doi":"10.1109/tdsc.2025.3649054","title":"Cross-Domain Heterogeneous Data Aggregation With Dynamic Group Key Agreement for Hybrid Satellite Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Geostationary orbit; Eavesdropping; Dynamic data; Data aggregator; Key (lock); Adaptability; Data security; Data transmission; Transmission (telecommunications); Satellite","score_opus":0.018923215420367314,"score_gpt":0.27194110649458986,"score_spread":0.25301789107422257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117464464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0426129,0.023157274,0.9297745,0.00012101741,0.0018243336,0.0017081287,0.00027967364,0.00025413482,0.00026799593],"genre_scores_gemma":[0.9829425,0.005732894,0.010324681,0.00010616795,0.00010580823,0.0000659895,0.0003046031,0.00011272408,0.00030463398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627674,0.00023450123,0.0011655254,0.0011482335,0.00034671585,0.0008282947],"domain_scores_gemma":[0.99647844,0.0007147407,0.000284457,0.002117299,0.00021401107,0.00019107164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010002851,0.0006862893,0.00068924594,0.00037639707,0.001237487,0.0007313288,0.0009972577,0.00028120106,0.000032015465],"category_scores_gemma":[0.000007440534,0.0007350318,0.00015800094,0.0006308195,0.00017774926,0.0004613981,0.000035776626,0.00077793765,0.000012175723],"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.00025081076,0.00014605171,0.000094672,0.00071694545,0.000684336,0.00001707315,0.00053491193,0.7082112,0.00018988711,0.00009214439,0.000014886818,0.28904712],"study_design_scores_gemma":[0.0020960642,0.00023061993,0.000084828665,0.0015878351,0.00024738428,0.0001360175,0.00024575417,0.9788345,0.0015502316,0.000104968254,0.0142024215,0.00067935046],"about_ca_topic_score_codex":0.00008204081,"about_ca_topic_score_gemma":0.0006472056,"teacher_disagreement_score":0.9403296,"about_ca_system_score_codex":0.00033417446,"about_ca_system_score_gemma":0.00008653415,"threshold_uncertainty_score":0.99951005},"labels":[],"label_agreement":null},{"id":"W7117536728","doi":"10.1109/tdsc.2025.3649362","title":"KDCS: Achieving Efficient and Privacy-Preserving ($k,d$k,d)-Truss Community Search for Social Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Encryption; Social network (sociolinguistics); Server; Cloud computing; Social network analysis; Tree (set theory); Vertex (graph theory); Information privacy","score_opus":0.0240214184782693,"score_gpt":0.30384515331443596,"score_spread":0.2798237348361667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117536728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36224306,0.00059394236,0.6353607,0.00031409875,0.0002587373,0.0007137457,0.000041326188,0.000098307246,0.00037608758],"genre_scores_gemma":[0.9963961,0.000083556246,0.0027445103,0.00011629736,0.00036598774,0.00004062479,0.000024315099,0.00005877649,0.00016978024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963832,0.00075734005,0.00082934595,0.00078254566,0.00027350214,0.0009741014],"domain_scores_gemma":[0.99703544,0.0016757625,0.00023201428,0.00062995177,0.00024149711,0.00018534414],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015905367,0.00060311076,0.00088855915,0.00040654076,0.006487404,0.0006767137,0.0006515917,0.00028035825,0.00004512233],"category_scores_gemma":[0.0000069356197,0.0006781592,0.00041621603,0.0008379332,0.00023730462,0.00015437801,0.00013312479,0.0021628372,0.0000012705058],"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.00032793864,0.001075059,0.0013616466,0.00080709223,0.001471407,0.0000030482527,0.0067088907,0.57813346,0.00040847439,0.004188595,0.0005375282,0.40497687],"study_design_scores_gemma":[0.0012415872,0.00017975004,0.0005185743,0.00077109435,0.00054978655,0.0000031344623,0.0024261062,0.990544,0.0016212082,0.0006789966,0.0008939325,0.0005717997],"about_ca_topic_score_codex":0.00066956313,"about_ca_topic_score_gemma":0.00011483641,"teacher_disagreement_score":0.63415307,"about_ca_system_score_codex":0.00013107463,"about_ca_system_score_gemma":0.00013855494,"threshold_uncertainty_score":0.999567},"labels":[],"label_agreement":null}]}