{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":117,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":117,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"329205527624","filters":{"venue":"IEEE Transactions on Dependable and Secure Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01029130423544031,"gpt":0.2408290485271312,"spread":0.2305377442916909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004417276,0.0001992236,0.0002115263,0.00157441,0.0003511518,0.000171444,0.0004845941,0.0001792239,0.00001293302],"category_scores_gemma":[0.000009667102,0.0001956645,0.00007878832,0.002256185,0.00003065899,0.0001495081,0.000006179655,0.0003607782,0.0000473855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009369788,"about_ca_system_score_gemma":0.00007274105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000641566,"about_ca_topic_score_gemma":0.0001214656,"domain_scores_codex":[0.9984421,0.00003738064,0.0003317825,0.0004865861,0.0003067442,0.0003954234],"domain_scores_gemma":[0.9989173,0.000216813,0.00009720153,0.0005032659,0.00007378298,0.0001915907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000669747,0.0007070497,0.0002934391,0.0001023635,0.0000942491,0.00008909676,0.005305097,0.007876853,0.00153702,0.01922845,0.0002851355,0.9644142],"study_design_scores_gemma":[0.0006280338,0.000203417,0.00004372785,0.00004597576,0.00001022878,0.00004116566,0.0001087047,0.9856791,0.011645,0.0003319471,0.001023347,0.0002392751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04703896,0.00005353713,0.9506724,0.0007605564,0.0005285225,0.0001892682,0.000004900819,0.0004238744,0.000328022],"genre_scores_gemma":[0.9821737,0.0000054596,0.01712743,0.0003149124,0.00003317699,0.000001965705,0.000001778531,0.00001599136,0.000325636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9778023,"threshold_uncertainty_score":0.7978966,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08650531738753572,"gpt":0.3112842504318411,"spread":0.2247789330443054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001424873,0.000348983,0.0003669303,0.0003802735,0.0009712466,0.0006049813,0.00116723,0.0001888643,0.0000212159],"category_scores_gemma":[0.00005823318,0.0003458743,0.0001061465,0.001053901,0.0001268319,0.001370131,0.0001005674,0.0007962345,0.00001730892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005267681,"about_ca_system_score_gemma":0.000251379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003253334,"about_ca_topic_score_gemma":0.000448293,"domain_scores_codex":[0.9967932,0.0002137261,0.0005829321,0.001089491,0.0005981389,0.0007224787],"domain_scores_gemma":[0.9976044,0.0004265076,0.0001668404,0.001191519,0.0002155508,0.0003952048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001268292,0.004674946,0.00566062,0.0008931948,0.001625358,0.001140972,0.0492749,0.115048,0.01634895,0.07485058,0.01220576,0.7170084],"study_design_scores_gemma":[0.001969133,0.0001647488,0.0002460409,0.00009403678,0.00004572557,0.0001184574,0.0007746449,0.985418,0.00615452,0.0008123752,0.003648216,0.000554162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1189459,0.000252464,0.8785025,0.0003019702,0.001098636,0.000252837,0.0001314318,0.0004149632,0.00009920449],"genre_scores_gemma":[0.9500262,0.00004807885,0.04940215,0.0001878095,0.0001924288,0.000005285799,0.00009347741,0.00002530197,0.00001929464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8703699,"threshold_uncertainty_score":0.9998993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03712856388906087,"gpt":0.2653405133944984,"spread":0.2282119495054376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004801333,0.0002605423,0.000329393,0.0001695573,0.0004638919,0.0001683452,0.0017165,0.000242084,0.000008960134],"category_scores_gemma":[0.00002086684,0.0002569425,0.00007238235,0.0006648531,0.00005613449,0.000226991,0.00009302877,0.0006288465,0.000008238378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003121976,"about_ca_system_score_gemma":0.00005274803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003963942,"about_ca_topic_score_gemma":0.0001807041,"domain_scores_codex":[0.9976445,0.00004893985,0.0004341369,0.001228829,0.0001882334,0.0004552992],"domain_scores_gemma":[0.9983985,0.0001701554,0.00008335707,0.001100892,0.00005867183,0.0001884353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004346958,0.002563902,0.001030346,0.001691993,0.0007935886,0.0004502829,0.04717293,0.261251,0.00892052,0.1775587,0.003795428,0.4943365],"study_design_scores_gemma":[0.0007582441,0.0001109694,0.00001820987,0.00007205249,0.00002037541,0.00002886775,0.0001810631,0.9883144,0.004286242,0.001969873,0.003934085,0.0003056265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1023473,0.0003168741,0.8909327,0.005360549,0.0001537709,0.0004985112,0.00004713512,0.0002928426,0.00005027069],"genre_scores_gemma":[0.9690458,0.00002986832,0.02989345,0.000858201,0.00008371556,0.00003709008,0.00001070704,0.0000237202,0.00001750236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8666984,"threshold_uncertainty_score":0.9999883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0735171356676938,"gpt":0.311255835327131,"spread":0.2377386996594372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391721,0.0001665668,0.0002000674,0.0002667856,0.0003039898,0.0000763561,0.000225966,0.00007982394,0.00005121547],"category_scores_gemma":[0.000008486737,0.0001673452,0.00005649717,0.0003187568,0.00004635572,0.0002972227,0.000006494876,0.0001232227,0.000009526185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004831027,"about_ca_system_score_gemma":0.0001506868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000822418,"about_ca_topic_score_gemma":0.00005136496,"domain_scores_codex":[0.9982066,0.0004129818,0.0004192996,0.0004145141,0.000344925,0.0002017134],"domain_scores_gemma":[0.9987796,0.0001599479,0.0002031134,0.0003116273,0.0004453902,0.0001003313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000160143,0.001931752,0.0004039524,0.0005646572,0.0005128531,0.000006423372,0.6063511,0.00117571,0.01518015,0.06795909,0.0001227443,0.3056315],"study_design_scores_gemma":[0.001299608,0.0002033061,0.000438212,0.00007132413,0.0001134508,0.000012669,0.001901335,0.9207261,0.07092507,0.004099622,0.00001677883,0.0001924822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.176114,0.00009975662,0.8227981,0.00008993643,0.0002339407,0.0005194037,0.00000483118,0.0000715912,0.00006841579],"genre_scores_gemma":[0.9863153,0.00001145162,0.01354745,0.00005593029,0.00001281106,0.00003182025,0.0000029122,0.00001180697,0.00001052151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9195504,"threshold_uncertainty_score":0.6824138,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02549565481363617,"gpt":0.2747887559841842,"spread":0.249293101170548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003755542,0.000268126,0.0003034389,0.0002550713,0.0004532561,0.0002779786,0.003133204,0.000230106,0.000007645264],"category_scores_gemma":[0.0001234553,0.0002492359,0.00007969156,0.0004873574,0.00004915471,0.0002613516,0.0004888729,0.0003599892,0.00000990654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006431615,"about_ca_system_score_gemma":0.00003530216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003776317,"about_ca_topic_score_gemma":0.0001442423,"domain_scores_codex":[0.99799,0.00005714897,0.0003809053,0.0008809938,0.0002985492,0.0003923632],"domain_scores_gemma":[0.9966177,0.0009022149,0.0001696056,0.002087015,0.0001202399,0.0001031682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001097825,0.0006364956,0.001030912,0.0004254273,0.0001085778,0.00001030195,0.0006528284,0.01518994,0.002064553,0.0009558875,0.001687265,0.977128],"study_design_scores_gemma":[0.0009185087,0.000208288,0.001844943,0.0002712469,0.00003025304,0.0000366671,0.00020851,0.989791,0.002588715,0.00295783,0.0008518146,0.0002921595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4280419,0.0002146272,0.5688963,0.001556199,0.0005484585,0.0003623061,0.00005915159,0.0002995502,0.00002148568],"genre_scores_gemma":[0.845501,0.000116548,0.154127,0.0001441389,0.00003877126,0.00002462453,0.0000150086,0.00001965534,0.00001321145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9768358,"threshold_uncertainty_score":0.999996,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01860141357487745,"gpt":0.2717896858156896,"spread":0.2531882722408121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006336798,0.0002847011,0.0002717628,0.0002491472,0.001325884,0.0004095913,0.002137445,0.0002134109,0.000001935164],"category_scores_gemma":[0.0002380598,0.000299892,0.0000596462,0.0004965931,0.0001511609,0.0006947271,0.0005052615,0.0003648705,0.0000054897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008656555,"about_ca_system_score_gemma":0.00005812265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005236057,"about_ca_topic_score_gemma":0.00004799562,"domain_scores_codex":[0.9978608,0.00007149662,0.0004082147,0.0009226688,0.000228097,0.0005086752],"domain_scores_gemma":[0.9973031,0.0004623524,0.0002130174,0.001679808,0.0002364791,0.000105239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004667833,0.0001669269,0.00008867052,0.0002822792,0.0001099239,0.000007044985,0.002292904,0.004153192,0.03232674,0.001217342,0.002332117,0.9569762],"study_design_scores_gemma":[0.0004480912,0.0002615378,0.00003892615,0.0001503624,0.00002721174,0.0001112216,0.0001315887,0.9328381,0.05815285,0.00676523,0.000752863,0.0003219557],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1247245,0.0001963561,0.8717861,0.001417047,0.0004882438,0.0006712695,0.00001117953,0.0006657006,0.00003965967],"genre_scores_gemma":[0.7449811,0.00002202181,0.2546701,0.0001663127,0.0001070235,0.00001685847,0.000006407288,0.00002328358,0.000006981237],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9566543,"threshold_uncertainty_score":0.9999743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01434955823400224,"gpt":0.2460963014911933,"spread":0.2317467432571911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009403446,0.0002621877,0.0002901113,0.0002203623,0.0007699783,0.0004932469,0.000908292,0.0001296753,0.00002496511],"category_scores_gemma":[0.000004459672,0.0001986346,0.0001311185,0.0007170585,0.00008191814,0.0004398668,0.00001689218,0.000579388,0.00003050587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000434711,"about_ca_system_score_gemma":0.00005506634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001359601,"about_ca_topic_score_gemma":0.002306602,"domain_scores_codex":[0.9978349,0.000239538,0.0004306064,0.0006148579,0.000383221,0.0004969406],"domain_scores_gemma":[0.9990281,0.0003050612,0.0001299619,0.0003455076,0.0001065203,0.00008479446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003069476,0.002388693,0.002842757,0.0007982159,0.0009128386,0.0008829059,0.1382444,0.1603977,0.003636689,0.1100119,0.002290543,0.5772864],"study_design_scores_gemma":[0.0004323191,0.0001443246,0.0002315238,0.0001336124,0.00002571434,0.00008612762,0.0008836389,0.9960085,0.000709827,0.00006834777,0.001013777,0.0002623278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3421839,0.0001097242,0.6556616,0.0003104809,0.0004819316,0.0001280243,0.000002276745,0.0001093962,0.001012714],"genre_scores_gemma":[0.9950498,0.00002096962,0.003698628,0.0009680084,0.0001907027,0.000005071568,0.000001306496,0.00001409784,0.00005144911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8356107,"threshold_uncertainty_score":0.8100085,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02054940420219381,"gpt":0.2499396155749093,"spread":0.2293902113727155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005190411,0.0002552127,0.0002886445,0.0001371267,0.000614709,0.0004381604,0.0006671341,0.000115796,0.00008336888],"category_scores_gemma":[0.00004420436,0.0002660786,0.00005662511,0.0004931241,0.00006777725,0.0007088454,0.0001491085,0.0004412178,0.00001452408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004898363,"about_ca_system_score_gemma":0.0001286999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009311507,"about_ca_topic_score_gemma":0.0000647963,"domain_scores_codex":[0.997844,0.0001950641,0.0003202186,0.000889917,0.0003643083,0.0003865024],"domain_scores_gemma":[0.9982094,0.0003494995,0.00009527116,0.00105584,0.0001273874,0.0001626084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005346561,0.002611487,0.0009236556,0.001724221,0.0008718439,0.002655524,0.01527566,0.4749047,0.1927861,0.003346262,0.004607724,0.2997581],"study_design_scores_gemma":[0.0006848177,0.0000618673,0.000388777,0.000139715,0.00003590628,0.0002446215,0.00006061555,0.9845183,0.01263834,0.0002524616,0.0006558569,0.000318644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1927772,0.000421722,0.805319,0.000625787,0.0002984066,0.000155348,0.00004255398,0.0002138312,0.0001461107],"genre_scores_gemma":[0.9635371,0.00006375589,0.03584884,0.0003110564,0.00006906661,0.000003126556,0.00001749829,0.00002180672,0.0001277712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7707598,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01994746097948164,"gpt":0.2460090198733315,"spread":0.2260615588938499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003604023,0.0003344683,0.0003905525,0.0001951749,0.00113065,0.0005526578,0.000521977,0.0002588095,0.00001522678],"category_scores_gemma":[0.00003466552,0.0003658602,0.0001632194,0.0009721391,0.00005182539,0.0004511537,0.00002463542,0.0005762401,0.0000252889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001355506,"about_ca_system_score_gemma":0.0001967588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001191301,"about_ca_topic_score_gemma":0.0001759075,"domain_scores_codex":[0.9973649,0.0002085513,0.0005048744,0.0009624649,0.0003522804,0.0006069387],"domain_scores_gemma":[0.9979818,0.0004072486,0.0001737303,0.000816661,0.0003923498,0.0002281662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003669305,0.003601162,0.00008763219,0.002457979,0.001535879,0.000843669,0.0188218,0.5778259,0.0778283,0.176173,0.01341213,0.1270456],"study_design_scores_gemma":[0.001078785,0.0001556794,0.00003527827,0.0001873969,0.00006364017,0.0004395536,0.0002896545,0.9790853,0.008160446,0.0007019874,0.009288085,0.0005142106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04950305,0.0005405917,0.9457837,0.0007470767,0.001907991,0.0007216919,0.0001832612,0.0005428466,0.00006981426],"genre_scores_gemma":[0.9709315,0.00005349028,0.02834312,0.0001492896,0.0002192784,0.00007788747,0.00005819182,0.00003581653,0.0001314741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9214284,"threshold_uncertainty_score":0.9998794,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02550869483214166,"gpt":0.3035000606436103,"spread":0.2779913658114687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001681173,0.0001149876,0.0001992305,0.0001801723,0.001043809,0.0000840853,0.0001510322,0.0001248896,0.0000250421],"category_scores_gemma":[0.00003309681,0.00008988258,0.00006170939,0.0009489103,0.0001858489,0.0001739661,0.0000111745,0.0002429207,3.770589e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003065353,"about_ca_system_score_gemma":0.00004532202,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002439663,"about_ca_topic_score_gemma":0.01794987,"domain_scores_codex":[0.9987786,0.0002308847,0.0002418438,0.0002698551,0.0002367422,0.0002420634],"domain_scores_gemma":[0.9993039,0.0001681969,0.0001278758,0.0001895945,0.0001147126,0.00009576481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001033574,0.0009992375,0.1443041,0.0005989263,0.002000652,0.00002273316,0.05647858,0.002230448,0.0005220943,0.006667282,0.001528204,0.7836142],"study_design_scores_gemma":[0.002947702,0.0003329426,0.8669171,0.0002215598,0.0009258814,0.00002818898,0.01348807,0.03521113,0.001389546,0.001361738,0.07623453,0.0009416709],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5526383,0.0002147169,0.4330966,0.000803094,0.0006590436,0.0111957,0.0001644765,0.0001002538,0.001127758],"genre_scores_gemma":[0.9991969,0.000129639,0.0003387273,0.00007758179,0.00008850812,0.0001032818,0.00000362004,0.000006581251,0.00005514986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7826725,"threshold_uncertainty_score":0.99997,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05355360499792926,"gpt":0.291247632256955,"spread":0.2376940272590257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005161265,0.0003325431,0.0003485554,0.0001522898,0.0007228518,0.0006742025,0.01909193,0.0001791539,0.00005217124],"category_scores_gemma":[0.000815738,0.0003097993,0.00005630584,0.0003802837,0.0001158685,0.002240038,0.004394654,0.0005527716,0.00005357774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003855867,"about_ca_system_score_gemma":0.00009336457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001107869,"about_ca_topic_score_gemma":0.0001377943,"domain_scores_codex":[0.9968556,0.0001084842,0.0005118109,0.001469259,0.0003727827,0.000682124],"domain_scores_gemma":[0.9873921,0.0005496355,0.0001461262,0.01157723,0.0001304601,0.0002043985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001882381,0.001576807,0.0001901674,0.0006042072,0.0007761351,0.00009161478,0.0004861866,0.005810523,0.01005379,0.007752954,0.2008838,0.7715855],"study_design_scores_gemma":[0.0009694338,0.0001103607,0.00007946238,0.00009802631,0.00005522435,0.00003576971,0.00002104091,0.9686378,0.004536592,0.02266301,0.002413379,0.0003798545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02774029,0.0001047199,0.9622771,0.00715935,0.0006599114,0.0006971583,0.0005045889,0.0008107267,0.00004613624],"genre_scores_gemma":[0.7395296,0.00005574077,0.2597619,0.0002848587,0.00006917424,0.00002791171,0.0002249005,0.00002682148,0.00001909442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9628273,"threshold_uncertainty_score":0.9999354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01824822054756901,"gpt":0.2463545125839495,"spread":0.2281062920363805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002749083,0.0002846699,0.0003343481,0.0001886651,0.0005042537,0.0004326438,0.0008035927,0.0001193548,0.00001098889],"category_scores_gemma":[0.00001723524,0.0002731367,0.00006901673,0.00113931,0.00005522031,0.0004890623,0.00002688246,0.0006304861,0.00001804854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007931469,"about_ca_system_score_gemma":0.0001098626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001432891,"about_ca_topic_score_gemma":0.0003164004,"domain_scores_codex":[0.9978381,0.0001326158,0.0004016122,0.0008065525,0.0003447859,0.0004763443],"domain_scores_gemma":[0.9987441,0.0003111063,0.0001417367,0.0004728762,0.00009220858,0.0002380193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001927619,0.0005533429,0.001374077,0.0001711257,0.0001074925,0.00009106901,0.006509527,0.9636748,0.001794984,0.008606629,0.0003850215,0.01653918],"study_design_scores_gemma":[0.001807511,0.0002040963,0.0007352639,0.0001285898,0.00003448239,0.00006378744,0.0001199818,0.9942328,0.001126305,0.00005095349,0.001107635,0.0003886293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2177966,0.0001078234,0.7777847,0.003374713,0.0001977696,0.0004083533,0.00003193989,0.0002373812,0.00006073625],"genre_scores_gemma":[0.9913622,0.00001480031,0.006977894,0.001507447,0.00008369637,0.00001964883,0.000006514524,0.00002328546,0.00000456062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7735655,"threshold_uncertainty_score":0.9999721,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Computer security; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008515883368515574,"gpt":0.2196670418634302,"spread":0.2111511584949146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002871162,0.000248069,0.0002039537,0.0003055122,0.0009078769,0.0008538538,0.00021226,0.0001117161,0.00001980574],"category_scores_gemma":[0.000003084211,0.000215388,0.00007763829,0.001150685,0.00005640665,0.0007386187,0.000007089018,0.0008174072,0.00003458577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004065922,"about_ca_system_score_gemma":0.00009092534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006963041,"about_ca_topic_score_gemma":0.0001169906,"domain_scores_codex":[0.9983554,0.0001177199,0.000211971,0.0006747533,0.0002700197,0.0003701193],"domain_scores_gemma":[0.9993196,0.0002238099,0.0000470767,0.0001966767,0.00008797443,0.0001248294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003120833,0.0007001911,0.0004086751,0.0006808004,0.0009375083,0.001147829,0.01564925,0.1698789,0.005927251,0.07723765,0.0008083254,0.7263116],"study_design_scores_gemma":[0.0005207041,0.0005951236,0.0001220005,0.0003409779,0.00005330014,0.0003822319,0.0002996916,0.9834752,0.009603406,0.001751109,0.002356709,0.0004995341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07477573,0.0004249789,0.9227287,0.0001722868,0.0003743872,0.0001691452,0.000007733074,0.001005885,0.000341183],"genre_scores_gemma":[0.9901606,0.00008381836,0.009566507,0.0000740929,0.00005626102,0.000008634778,0.000004795007,0.00002610684,0.00001916298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9153849,"threshold_uncertainty_score":0.8783267,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.01334786109977719,"gpt":0.2423302788624251,"spread":0.2289824177626479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392589,0.0002231114,0.000219519,0.000143337,0.0003439024,0.00008426919,0.0001983831,0.0001059234,0.00002293304],"category_scores_gemma":[0.000001928676,0.0002090632,0.00005100808,0.0002782469,0.00009289973,0.0001685346,0.000003220535,0.0003788253,0.00001808646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004145633,"about_ca_system_score_gemma":0.00002017099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000183614,"about_ca_topic_score_gemma":0.00009942509,"domain_scores_codex":[0.9990525,0.0000558672,0.0001828131,0.0002526983,0.0001952901,0.0002608865],"domain_scores_gemma":[0.9992543,0.0001124362,0.00004435655,0.0003936426,0.0001072428,0.00008805745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006364643,0.002826007,0.0002072745,0.001787881,0.001375222,0.00007139236,0.06159559,0.5922557,0.1616948,0.007122875,0.003047792,0.167379],"study_design_scores_gemma":[0.0003335599,0.0001370449,0.00003910861,0.0001378134,0.00003898256,0.00001314098,0.000183332,0.7940019,0.2042344,0.0001671607,0.0004611744,0.0002524113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3060029,0.00005513544,0.6923467,0.0001170872,0.00008181524,0.0001728922,0.00001572176,0.0006903629,0.0005173525],"genre_scores_gemma":[0.9950835,0.0000221617,0.004625995,0.00008036772,0.00008345837,0.00002281008,0.000007926506,0.00005144646,0.00002240133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6890805,"threshold_uncertainty_score":0.852535,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02418429482393965,"gpt":0.2343018371007782,"spread":0.2101175422768386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722689,0.0002621695,0.0002410737,0.000212852,0.001056545,0.0002418444,0.0002515148,0.0001461635,0.00001750568],"category_scores_gemma":[0.00000775723,0.0002324692,0.000071774,0.0005178096,0.00004854539,0.0005018981,0.000009653001,0.0005068791,0.00002479947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004848962,"about_ca_system_score_gemma":0.0000363914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004442912,"about_ca_topic_score_gemma":0.0001468464,"domain_scores_codex":[0.9981352,0.0002351769,0.00027867,0.000623181,0.0003248502,0.0004028839],"domain_scores_gemma":[0.9989614,0.0003341848,0.0001130792,0.0003218657,0.0001114954,0.0001579765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001234791,0.0002009649,0.0000108549,0.00003846334,0.00006394584,0.00001680038,0.0008382717,0.6774248,0.00483561,0.0002104192,0.00004834921,0.316188],"study_design_scores_gemma":[0.0008651973,0.0005343527,0.00004987605,0.0001000389,0.00002159322,0.0002223216,0.00002293322,0.949168,0.04807251,0.0001216508,0.0005232154,0.0002983357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1452679,0.00004568115,0.853447,0.00007826467,0.0006009642,0.0002052666,8.485397e-7,0.0002942084,0.00005986392],"genre_scores_gemma":[0.9306815,0.00001226373,0.06889552,0.0002223642,0.0001039125,0.000009228366,5.318523e-7,0.00002051621,0.00005420803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7854136,"threshold_uncertainty_score":0.9479821,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03179252942926588,"gpt":0.2848214308757208,"spread":0.253028901446455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356764,0.0002349739,0.0002784999,0.0001676853,0.000730994,0.0003297583,0.0002914248,0.0001128179,0.000004235181],"category_scores_gemma":[0.000004904276,0.0002175888,0.00008391387,0.0005603308,0.0000403157,0.0002267895,0.00001234482,0.0002304832,0.00001192714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225789,"about_ca_system_score_gemma":0.00004832893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000341548,"about_ca_topic_score_gemma":0.00005511532,"domain_scores_codex":[0.9983443,0.00004867836,0.0003251263,0.0005989703,0.0002161682,0.0004667308],"domain_scores_gemma":[0.9991817,0.0001727972,0.00009679518,0.0002983056,0.00009697067,0.0001534706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001420502,0.0004167919,0.000126168,0.001073977,0.0001902567,0.0001057259,0.005948928,0.4380571,0.001124258,0.005233132,0.004514282,0.5430673],"study_design_scores_gemma":[0.001459121,0.0002158592,0.00009203055,0.0001928379,0.000009839338,0.00007388339,0.0002397959,0.9886672,0.0009486565,0.0001713534,0.007632199,0.0002972629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00392406,0.00001182771,0.9781887,0.0003222463,0.0003026642,0.01662179,0.00005310523,0.0003928888,0.0001827243],"genre_scores_gemma":[0.9651573,0.000005937027,0.01418887,0.0001954806,0.0001640031,0.01936973,0.000005817042,0.00004098343,0.0008718754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9639998,"threshold_uncertainty_score":0.8873013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02777921603672797,"gpt":0.2862058883541309,"spread":0.258426672317403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749951,0.0002313228,0.00026466,0.0001264249,0.0006080496,0.0003583798,0.0002724262,0.000144729,0.00005749424],"category_scores_gemma":[0.00003762677,0.0002286552,0.0001051037,0.0004234363,0.0000673063,0.0007404226,0.00007621656,0.000563239,0.000005566013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002097566,"about_ca_system_score_gemma":0.0001638255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001394916,"about_ca_topic_score_gemma":0.0001782391,"domain_scores_codex":[0.9981282,0.0001706626,0.000286719,0.0007013156,0.0003325614,0.0003805392],"domain_scores_gemma":[0.9986801,0.0003946702,0.00007472235,0.0005187952,0.0001128541,0.0002188423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009524609,0.00962572,0.006298165,0.002178139,0.00219486,0.007552232,0.03439099,0.02320485,0.02561775,0.2586499,0.01330931,0.6160256],"study_design_scores_gemma":[0.002881096,0.0001786263,0.003501814,0.0002683584,0.00009260771,0.001403453,0.0002813127,0.9668876,0.01319709,0.005313699,0.005099175,0.0008951678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1481417,0.0005953175,0.8493245,0.0008951003,0.000657332,0.0001119143,0.00002600082,0.0001378329,0.000110253],"genre_scores_gemma":[0.8400151,0.0001071237,0.1592735,0.0004854141,0.00008262218,0.000003318408,0.000004900933,0.00001302488,0.00001506161],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9436827,"threshold_uncertainty_score":0.932429,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02783726903687924,"gpt":0.3138579377599896,"spread":0.2860206687231104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000646779,0.0003096993,0.0004225809,0.000559165,0.001690459,0.0003818624,0.003953808,0.0001712213,0.00002183943],"category_scores_gemma":[0.0002222033,0.0002745607,0.000151695,0.001956224,0.00005529164,0.0007688121,0.001053716,0.0003980487,0.00003947186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001503,"about_ca_system_score_gemma":0.00002756795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001582731,"about_ca_topic_score_gemma":0.0003745268,"domain_scores_codex":[0.9973286,0.0001379202,0.0004608,0.001006412,0.0003637378,0.0007025077],"domain_scores_gemma":[0.9971674,0.0002062781,0.0001685937,0.002183406,0.0001081193,0.0001661716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007568144,0.0005562407,0.008220288,0.0001557237,0.001601173,0.00008232975,0.004629611,0.05909857,0.07648746,0.002876685,0.01756202,0.8286542],"study_design_scores_gemma":[0.003852191,0.002573873,0.02194842,0.002330862,0.001381076,0.0001485005,0.0004274652,0.4140212,0.4608856,0.07513382,0.01020542,0.007091518],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3376539,0.000009394387,0.6588547,0.002247563,0.0002310281,0.0001952115,0.000006452899,0.0007132374,0.00008846017],"genre_scores_gemma":[0.9284277,0.000007517178,0.07099731,0.0002837603,0.0001678254,0.00002431859,0.000002026663,0.00002546241,0.00006405685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8215627,"threshold_uncertainty_score":0.9999707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03841375796386289,"gpt":0.2757849288548905,"spread":0.2373711708910276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004778723,0.0003378197,0.0003747157,0.000339206,0.00137178,0.0005411601,0.004474504,0.0002202933,0.00001837893],"category_scores_gemma":[0.0005776525,0.0003412971,0.0001513734,0.0008489183,0.00007397835,0.0004054121,0.0007326482,0.0006310852,0.00001859016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005876329,"about_ca_system_score_gemma":0.00004732384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001737611,"about_ca_topic_score_gemma":0.000009540379,"domain_scores_codex":[0.9974169,0.0001299875,0.0004372939,0.0009694956,0.0002986876,0.000747625],"domain_scores_gemma":[0.99719,0.000626061,0.0001432241,0.00182546,0.00007847245,0.0001367827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002379206,0.0005524864,0.0003646056,0.000617045,0.0006133043,0.0002351588,0.001778119,0.02678271,0.01899735,0.001121035,0.01051392,0.9381863],"study_design_scores_gemma":[0.0006594879,0.0001796445,0.00008812105,0.00006704721,0.0000212859,0.00005516885,0.0000391607,0.9480657,0.04063316,0.008799338,0.001048853,0.0003430382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2940257,0.00003508998,0.7018098,0.00123184,0.0005828638,0.0003177435,0.00002171902,0.001940311,0.00003486053],"genre_scores_gemma":[0.9697984,0.00005109303,0.02991431,0.0000537228,0.00004170784,0.00002848355,0.00001728783,0.00003693268,0.0000581009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9378433,"threshold_uncertainty_score":0.9999283,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01749001588204833,"gpt":0.2436745206549381,"spread":0.2261845047728898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191215,0.0001616735,0.0002049298,0.0002177316,0.0008864588,0.00007180215,0.0003473598,0.00006347125,0.00003831138],"category_scores_gemma":[0.000001574375,0.0001782557,0.00003653243,0.0004595987,0.00005642529,0.0001100437,0.00003904388,0.0004789925,0.000001559794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009981443,"about_ca_system_score_gemma":0.00004055276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009409418,"about_ca_topic_score_gemma":0.00006292794,"domain_scores_codex":[0.9985435,0.00008538768,0.0002915828,0.0005205314,0.000213403,0.0003456027],"domain_scores_gemma":[0.9993543,0.0000961409,0.00008303972,0.0003638069,0.00002424828,0.00007847114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001005258,0.001117081,0.0009718045,0.0001642254,0.0001199163,0.0001402114,0.008155723,0.1616788,0.002774828,0.1521993,0.000150185,0.6724275],"study_design_scores_gemma":[0.001874125,0.0002459746,0.0004354395,0.00006123268,0.00001627837,0.0002401077,0.0008014026,0.9763699,0.006569491,0.005284713,0.007613031,0.0004883052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.291674,0.0007636043,0.7062939,0.0004989631,0.0001764279,0.0003105005,0.000006052981,0.0001643916,0.0001121236],"genre_scores_gemma":[0.9927956,0.0001268646,0.006659099,0.0003070671,0.000007482111,0.00005554139,0.000001474279,0.000009399669,0.00003747376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8146911,"threshold_uncertainty_score":0.7269056,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.02852156470290198,"gpt":0.2746016577552661,"spread":0.2460800930523641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007215617,0.0002683999,0.0002731068,0.0003917125,0.001017726,0.0003069717,0.0003816713,0.00013741,0.000007091997],"category_scores_gemma":[0.000007075839,0.0002614706,0.0001399701,0.0009366655,0.00008717357,0.0001681304,0.00002341727,0.0004066686,0.00001242837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003025658,"about_ca_system_score_gemma":0.00007111459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000504044,"about_ca_topic_score_gemma":0.00006347501,"domain_scores_codex":[0.9978973,0.0001041493,0.0002975334,0.0007862737,0.0003240649,0.0005907039],"domain_scores_gemma":[0.9986341,0.0005161116,0.00006674923,0.0004472041,0.0001020525,0.0002337597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002699662,0.001342764,0.0002371357,0.0008888062,0.0002135913,0.0001520445,0.01374066,0.8472229,0.002976534,0.01257895,0.001258756,0.1191179],"study_design_scores_gemma":[0.001431704,0.000211731,0.00020557,0.00008395132,0.00002208691,0.00001880082,0.0002677414,0.9915587,0.00415536,0.0001261477,0.001601966,0.000316191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2617852,0.0001398983,0.7363454,0.0002458938,0.000649307,0.0003949864,0.0001063537,0.0003180713,0.00001487177],"genre_scores_gemma":[0.9705299,0.00003837703,0.02910708,0.0001789883,0.00007008273,0.00002138167,0.00001736905,0.00002183747,0.00001504318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7087446,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01519607042946472,"gpt":0.24454544670839,"spread":0.2293493762789253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004521134,0.0002678461,0.0002293147,0.0002522731,0.0005390068,0.0003999665,0.0002115858,0.0001047113,0.00002507899],"category_scores_gemma":[0.000003475716,0.0002315161,0.00005878095,0.0006709752,0.00007321144,0.0006524338,0.000006596054,0.0004651445,0.000004986039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007675513,"about_ca_system_score_gemma":0.0001284202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003058898,"about_ca_topic_score_gemma":0.00008479079,"domain_scores_codex":[0.9981153,0.00009841919,0.0002459439,0.0007372328,0.0003965076,0.0004065766],"domain_scores_gemma":[0.9991381,0.0002567316,0.00005809542,0.0003089134,0.00009808861,0.0001400574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003724574,0.0000540916,0.00005619694,0.0001034054,0.00004377654,0.0001023593,0.0004546987,0.8227339,0.0001177854,0.0008573784,0.00005968272,0.1753794],"study_design_scores_gemma":[0.0005740994,0.0003057976,0.00008266443,0.0001530697,0.00005620613,0.000178672,0.00007723668,0.9958931,0.001605105,0.0005085482,0.0002790122,0.0002865164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019332,0.0003016284,0.8961416,0.0003038364,0.0004128304,0.0003377187,0.000007248108,0.0003387405,0.0002231251],"genre_scores_gemma":[0.975674,0.00002833177,0.02394167,0.0001773015,0.00004129183,0.00001854276,0.000004740637,0.00002584019,0.0000882821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8737407,"threshold_uncertainty_score":0.9440952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02607716170830905,"gpt":0.2941516083026139,"spread":0.2680744465943048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000389191,0.0002855834,0.0003471481,0.0002817193,0.000756638,0.0002568264,0.00005149945,0.000168071,0.00004606651],"category_scores_gemma":[0.00002116875,0.0002647809,0.00007716712,0.0004367788,0.00005670867,0.00008225859,0.000006375848,0.001053637,0.00004657436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008623469,"about_ca_system_score_gemma":0.00005709554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001182816,"about_ca_topic_score_gemma":0.00005792124,"domain_scores_codex":[0.9981806,0.00009706071,0.0003605156,0.0006112585,0.000290129,0.0004603888],"domain_scores_gemma":[0.9992035,0.0002974223,0.00005648887,0.0001350267,0.00007681915,0.0002307466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002204229,0.0002728761,0.0004542726,0.0008142008,0.0003289988,0.0006151114,0.01203073,0.4049992,0.01544309,0.00001875698,0.00006029886,0.564742],"study_design_scores_gemma":[0.0009102008,0.0004308604,0.0001021863,0.0006592595,0.00019055,0.0009489451,0.003414285,0.9806961,0.01185582,0.000007516878,0.000489587,0.0002946484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6449686,0.0005433783,0.3529334,0.0001103516,0.0004222054,0.0002349801,0.000004055452,0.0003342557,0.0004487841],"genre_scores_gemma":[0.99805,0.00005311674,0.001036049,0.0001093311,0.0001223384,0.000004645809,0.000006045134,0.00006661841,0.0005517997],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5756969,"threshold_uncertainty_score":0.9999804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01607797826001622,"gpt":0.2135934481316391,"spread":0.1975154698716229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339043,0.0001848957,0.0002174007,0.0002326524,0.0003915442,0.0001607623,0.0001712254,0.0000951747,0.000002974658],"category_scores_gemma":[0.000006835315,0.0001498402,0.00002997888,0.0003910534,0.00005918708,0.0004012045,0.000008202574,0.0002530499,0.000006736843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006050409,"about_ca_system_score_gemma":0.00002685977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003648062,"about_ca_topic_score_gemma":0.00003573664,"domain_scores_codex":[0.9987938,0.00007133851,0.0003371091,0.0003004135,0.0002200104,0.0002772598],"domain_scores_gemma":[0.9993002,0.0001601946,0.0001031429,0.0002491671,0.00009368763,0.00009361365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001597532,0.0003951971,0.05422924,0.00125618,0.0001008543,0.00003974346,0.03100529,0.5747921,0.00008018324,0.0004076565,0.00000670808,0.337527],"study_design_scores_gemma":[0.001038648,0.0003824946,0.01668225,0.0004896873,0.00002354858,0.0002042783,0.001107399,0.9755809,0.003949217,0.0000656139,0.00005753316,0.0004183816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4512562,0.00006506122,0.5480441,0.000007561582,0.0002769868,0.0002014514,0.000001914122,0.0001149796,0.00003167563],"genre_scores_gemma":[0.9931269,0.00003446948,0.006750659,0.0000157553,0.00002099879,0.00004010952,4.607047e-7,0.000008268818,0.000002386517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5418707,"threshold_uncertainty_score":0.6110304,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01356997356139335,"gpt":0.2459517250997809,"spread":0.2323817515383875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002856889,0.0002699856,0.000366947,0.0001089107,0.001313638,0.000343399,0.0001830462,0.0001720108,0.000005542018],"category_scores_gemma":[0.00001454916,0.0002743867,0.0001341304,0.0003718677,0.00005325708,0.0004675939,0.00002139335,0.0006294124,0.000005955043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008095629,"about_ca_system_score_gemma":0.00007879362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002096206,"about_ca_topic_score_gemma":0.00004899195,"domain_scores_codex":[0.9980212,0.0002005042,0.0003136023,0.0007677343,0.0002637495,0.0004331373],"domain_scores_gemma":[0.9988856,0.0004050406,0.0001333624,0.0002514421,0.0001690616,0.0001555031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006142481,0.001062335,0.0002292318,0.0009812217,0.0007968262,0.0004444564,0.02380786,0.5178787,0.05970923,0.0508707,0.0008723629,0.3427328],"study_design_scores_gemma":[0.001126833,0.0002856957,0.00003848603,0.0001862182,0.00003467017,0.0002318628,0.0004541164,0.9755765,0.01777418,0.0001842001,0.003769394,0.0003378974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.22092,0.0001735907,0.7767878,0.0002363229,0.001116027,0.0001990391,0.000005803104,0.0002109516,0.0003504045],"genre_scores_gemma":[0.991424,0.00003974345,0.007895332,0.0001504397,0.0002907351,0.0000157751,0.000003415234,0.00002187374,0.000158728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7705039,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005020432150511949,"gpt":0.2012900685172559,"spread":0.1962696363667439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002639677,0.0003387343,0.0003309291,0.0001640735,0.0007102946,0.0001721045,0.0001577419,0.0002463663,0.00003751348],"category_scores_gemma":[0.00000987861,0.0003691251,0.0001223946,0.0002259948,0.0001113364,0.0002624411,0.000006142609,0.0007764685,0.000005312317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005224018,"about_ca_system_score_gemma":0.00002344875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004971777,"about_ca_topic_score_gemma":0.0008879708,"domain_scores_codex":[0.9983895,0.00003161618,0.0003593027,0.0004864059,0.0001836414,0.0005494769],"domain_scores_gemma":[0.9990619,0.0002315147,0.00006076776,0.0003494528,0.00008177972,0.0002146191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001339573,0.001598653,0.0034784,0.006306096,0.002547576,0.0001236201,0.05498128,0.5747277,0.1868097,0.006426854,0.001520866,0.1601398],"study_design_scores_gemma":[0.003633777,0.0001414242,0.0010259,0.0001903434,0.0003268124,0.0002209465,0.0009579366,0.9628289,0.02691867,0.000982675,0.001736669,0.001035956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6509544,0.0002239137,0.3462279,0.00007779629,0.001352205,0.0004960326,0.00008858806,0.0003402987,0.0002389046],"genre_scores_gemma":[0.9968411,0.00009293541,0.002585126,0.00003703601,0.0002076978,0.0000382887,0.00001514847,0.00007064794,0.0001119731],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3881012,"threshold_uncertainty_score":0.9998761,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01769218481340346,"gpt":0.2371697182894762,"spread":0.2194775334760727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997457,0.0001515537,0.0002053099,0.000302906,0.0005812563,0.00007842324,0.0001169715,0.0001050558,0.000002222161],"category_scores_gemma":[0.000004393981,0.0001474042,0.00004645905,0.0005621743,0.00005910846,0.0003675855,0.000005033308,0.0002908516,0.000001184914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002260995,"about_ca_system_score_gemma":0.00002710779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001565996,"about_ca_topic_score_gemma":0.0001758999,"domain_scores_codex":[0.9989008,0.00009546069,0.000247168,0.0003726093,0.0001497478,0.0002342483],"domain_scores_gemma":[0.9995371,0.00013219,0.00006560002,0.0001565344,0.00003801475,0.00007059176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001780968,0.0002131534,0.0006001726,0.00008592979,0.00004434543,0.0001131071,0.006985112,0.8558602,0.009515805,0.000223517,0.000003932727,0.1261767],"study_design_scores_gemma":[0.002054136,0.00006299277,0.0008413395,0.00007034546,0.00001036145,0.0003708651,0.00007072707,0.9854959,0.01063819,0.0001541279,0.00003806021,0.0001928994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4746621,0.0001664662,0.5247909,0.00002672034,0.000178864,0.0001046174,7.088905e-7,0.00004746625,0.00002212654],"genre_scores_gemma":[0.9883476,0.0001429612,0.01138714,0.00007212513,0.00002864726,0.0000035876,3.17731e-7,0.000009084978,0.000008489201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5136855,"threshold_uncertainty_score":0.6010967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.06019659581071485,"gpt":0.2966887080416012,"spread":0.2364921122308863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004557458,0.0003130192,0.000350632,0.0001276319,0.001017689,0.0006512457,0.001491662,0.0001936191,0.00003411501],"category_scores_gemma":[0.00004309254,0.0003321193,0.0001122507,0.0005947776,0.00005035185,0.001834119,0.00006982848,0.000560173,0.00003768728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006569517,"about_ca_system_score_gemma":0.0001885743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002487248,"about_ca_topic_score_gemma":0.0003555856,"domain_scores_codex":[0.9972728,0.0001425361,0.0004468734,0.001206159,0.0004549185,0.0004766668],"domain_scores_gemma":[0.9978443,0.000444276,0.0001878352,0.001104526,0.0001343465,0.0002847246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001385266,0.005037118,0.0005045003,0.003051143,0.001681512,0.0004627235,0.02453313,0.5478197,0.05282699,0.03767768,0.07337215,0.2516481],"study_design_scores_gemma":[0.001181877,0.000182539,0.00003676339,0.0001230642,0.00009036076,0.00001021849,0.0001148792,0.9851058,0.003558365,0.0008359412,0.00837425,0.0003859087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0308692,0.000256933,0.9627223,0.002645338,0.001164599,0.0006403865,0.001231181,0.0004477944,0.00002223972],"genre_scores_gemma":[0.8940638,0.0000215081,0.1042107,0.0009375412,0.0003453415,0.00001600216,0.0003596929,0.00003322976,0.00001212267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8631946,"threshold_uncertainty_score":0.9999131,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05970768965338365,"gpt":0.2883740473154003,"spread":0.2286663576620167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006250126,0.0002734107,0.0002994347,0.0001487238,0.0008442547,0.0005468583,0.001423926,0.0001208465,0.00003419831],"category_scores_gemma":[0.00003525455,0.0002700813,0.00006436367,0.0007030146,0.00007580026,0.0007655605,0.0002891195,0.0007532323,0.000005181344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001717867,"about_ca_system_score_gemma":0.00006112406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001477282,"about_ca_topic_score_gemma":0.00003560698,"domain_scores_codex":[0.9975082,0.0001881128,0.0003278582,0.001074116,0.000420435,0.0004812421],"domain_scores_gemma":[0.9980577,0.000410067,0.00007718689,0.001052306,0.00005663443,0.0003460725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009069291,0.002476534,0.01097552,0.003486362,0.001403767,0.0009667328,0.1013054,0.2633151,0.02640892,0.01924602,0.006256895,0.5632519],"study_design_scores_gemma":[0.0006206185,0.0001149558,0.001100817,0.00008160327,0.00002893279,0.0000383414,0.0001943503,0.9948683,0.001366591,0.0001016306,0.001154182,0.000329634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3348744,0.0002305341,0.6635036,0.0007263055,0.0001363971,0.00017545,0.0001151237,0.0001777758,0.00006040971],"genre_scores_gemma":[0.9783232,0.0000887623,0.02096595,0.0005103069,0.00007065642,0.000001572521,0.00002259338,0.00001581058,0.000001107115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7315533,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05072490151960609,"gpt":0.3054348580816068,"spread":0.2547099565620007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00358654,0.0003691629,0.0004111949,0.0000318195,0.002895103,0.0004004825,0.001260231,0.0001451964,0.00001197058],"category_scores_gemma":[0.0000484959,0.0002652078,0.0001701922,0.001128284,0.0002262731,0.0004742499,0.00006422742,0.0005754498,0.00001941803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005099105,"about_ca_system_score_gemma":0.0001447613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000419553,"about_ca_topic_score_gemma":0.0002474241,"domain_scores_codex":[0.9966158,0.0004322613,0.0008377465,0.0006066593,0.0005621854,0.0009453026],"domain_scores_gemma":[0.9963044,0.001736223,0.0004283378,0.0008229381,0.0005397985,0.0001683286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003359807,0.00002493483,0.00004851533,0.00001648537,0.00003720951,6.916341e-7,0.00564221,0.9559112,0.00003211965,0.0007516902,0.007962187,0.02953919],"study_design_scores_gemma":[0.0005112751,0.0003023446,0.0001145273,0.0002204084,0.00003244142,0.00001368958,0.000349424,0.9890115,0.001129455,0.0001001818,0.0078745,0.0003402446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07366705,0.0003419284,0.9215156,0.001130745,0.001837748,0.0009427312,0.00002034607,0.0001321946,0.0004116787],"genre_scores_gemma":[0.9575262,0.00002262651,0.03852716,0.003261119,0.0004668549,0.00001129179,0.000004678307,0.00002718514,0.0001528555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8838592,"threshold_uncertainty_score":0.99998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0123226034797987,"gpt":0.2311443997914543,"spread":0.2188217963116555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006243532,0.0003005601,0.000374477,0.000145882,0.001052122,0.0005266668,0.0003355393,0.0001243823,0.00002098967],"category_scores_gemma":[0.000008977229,0.0002738781,0.0001973817,0.000704104,0.00005066682,0.0002263409,0.00001057008,0.0003570466,0.000008649573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006026053,"about_ca_system_score_gemma":0.0001324967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009308497,"about_ca_topic_score_gemma":0.0002138279,"domain_scores_codex":[0.9975421,0.0001241811,0.000499458,0.0008829843,0.000369016,0.0005822807],"domain_scores_gemma":[0.99872,0.0003187011,0.0001576734,0.0003447307,0.0003199943,0.000138829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002799378,0.0001699869,0.000002291886,0.00005459768,0.0001210921,0.00003976359,0.002601436,0.9407412,0.0002907921,0.002733213,0.00006379729,0.05315382],"study_design_scores_gemma":[0.0006581531,0.0001048462,0.00004250107,0.000167554,0.00009931709,0.0001827698,0.0005195504,0.993441,0.004198779,0.00001079504,0.0002253592,0.0003493814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2730311,0.0002923152,0.7254965,0.0002053884,0.0005474928,0.0002146309,0.000004589589,0.000155413,0.00005259597],"genre_scores_gemma":[0.9785562,0.00001680975,0.02079069,0.0001972724,0.0001743815,0.00001626502,0.000007744691,0.00003101049,0.0002096998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7055251,"threshold_uncertainty_score":0.9999713,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; PlanetLab; Geolocation; Computer security; The Internet; Computer network; Adversary; Global Positioning System; Authentication (law); Mobile device; World Wide Web; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02954794041345939,"gpt":0.2546429856409055,"spread":0.2250950452274461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006620203,0.0001642668,0.0001610257,0.000108946,0.00031301,0.0002745137,0.0004395613,0.0000806414,0.000004636676],"category_scores_gemma":[0.00001586613,0.000125858,0.00009747388,0.0003249874,0.00003690021,0.0002124882,0.000004635459,0.0002174866,0.00001521774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005729487,"about_ca_system_score_gemma":0.00009306072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005031224,"about_ca_topic_score_gemma":0.0001052441,"domain_scores_codex":[0.9987639,0.00007020395,0.0002937626,0.000392867,0.000231452,0.0002477997],"domain_scores_gemma":[0.9989496,0.0003326147,0.0001188315,0.000239867,0.0002636071,0.00009547346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004041165,0.00009774545,0.000008097063,0.00002726277,0.00007916236,0.000002948768,0.002370095,0.8945646,0.00002889099,0.02033368,0.0006703713,0.08177672],"study_design_scores_gemma":[0.0004589687,0.0001282069,0.000009890072,0.00003994266,0.00004181496,0.00001603599,0.0002016167,0.9952255,0.001486569,0.00003548488,0.00220514,0.0001508078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01139898,0.0002012657,0.9866847,0.0006075413,0.0006653048,0.0002452196,0.000002461971,0.0001350948,0.00005940095],"genre_scores_gemma":[0.9872499,0.000004107692,0.01214113,0.0003650533,0.0000842263,0.00001938966,0.000004490585,0.00001322857,0.0001185073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9758509,"threshold_uncertainty_score":0.5132341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07697807668855826,"gpt":0.3012775501062641,"spread":0.2242994734177058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004705175,0.0003031124,0.0003506551,0.00008591064,0.001121193,0.0005145984,0.01370688,0.000175036,0.000006119581],"category_scores_gemma":[0.0005585772,0.0003018844,0.00004939741,0.0006107757,0.0001070019,0.001187095,0.008815304,0.001010385,0.000003010957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869298,"about_ca_system_score_gemma":0.00004286671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001551463,"about_ca_topic_score_gemma":0.000103709,"domain_scores_codex":[0.9972879,0.00009527018,0.0003937594,0.001345557,0.0003166363,0.0005609059],"domain_scores_gemma":[0.9957098,0.000286265,0.0001852989,0.003604848,0.00004595613,0.0001678145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001239032,0.0004499652,0.006722832,0.0006026624,0.0006476645,0.0002232158,0.007394413,0.03417304,0.0004144444,0.001056413,0.03627939,0.9119121],"study_design_scores_gemma":[0.0004676131,0.00006172733,0.0006048307,0.0001043948,0.00005076458,0.00002661746,0.0002664385,0.9912636,0.0002366063,0.005682689,0.000896097,0.0003385906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1596867,0.0004625238,0.826596,0.01186953,0.0002308715,0.0002059909,0.0001785017,0.0007388816,0.00003106235],"genre_scores_gemma":[0.8280205,0.0003887266,0.1709587,0.0003228888,0.0002411376,0.000003254697,0.0000298358,0.00002916514,0.000005723054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9570906,"threshold_uncertainty_score":0.9999433,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02554411988967506,"gpt":0.2663804616594111,"spread":0.240836341769736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651542,0.0002080754,0.0002728225,0.0003471829,0.000478333,0.0001456914,0.001028206,0.0001964277,0.000007664269],"category_scores_gemma":[0.0000228422,0.0002096637,0.00009727082,0.0006507939,0.00006574064,0.0001175569,0.00002701959,0.0004051525,0.000001629534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003633622,"about_ca_system_score_gemma":0.00009709079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001087831,"about_ca_topic_score_gemma":0.0001109116,"domain_scores_codex":[0.9982927,0.00005664853,0.0004052741,0.0007437498,0.0001750024,0.0003266348],"domain_scores_gemma":[0.9980258,0.000731117,0.0001026663,0.0009716398,0.00009084617,0.00007788477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001098015,0.0006181015,0.00008926124,0.001265424,0.0004393918,0.00003875965,0.00226843,0.02919905,0.08041491,0.01256891,0.0001551532,0.8728328],"study_design_scores_gemma":[0.0003806668,0.0001303042,0.00002697526,0.000143339,0.0000457184,0.00003453142,0.00003319994,0.9155934,0.08135062,0.00126901,0.0008033714,0.0001888228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2429313,0.000523109,0.754971,0.0004291224,0.000303057,0.0003672423,0.00004804104,0.0003975676,0.00002963502],"genre_scores_gemma":[0.972744,0.00001050556,0.02707761,0.00006272985,0.00004036542,0.00002907257,0.000004939711,0.00002040509,0.00001040347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863944,"threshold_uncertainty_score":0.8549839,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04734162852839136,"gpt":0.2973497996101303,"spread":0.250008171081739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000966186,0.0003536294,0.0002810966,0.0002219832,0.0009899833,0.001105344,0.02476379,0.0001546142,0.00001147828],"category_scores_gemma":[0.0003748715,0.0002575136,0.00006686661,0.001144294,0.00007467705,0.0008366861,0.005050353,0.0007935446,0.00001198687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000759055,"about_ca_system_score_gemma":0.0001219368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001748718,"about_ca_topic_score_gemma":0.0007242567,"domain_scores_codex":[0.9971628,0.00004866052,0.0003688728,0.001443449,0.0003471686,0.0006290173],"domain_scores_gemma":[0.9895287,0.001385072,0.00009014831,0.008797579,0.0001065405,0.00009192024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000240383,0.0003733975,0.00009563233,0.002837894,0.001607936,0.0003040547,0.003765273,0.07538613,0.00285516,0.005175534,0.03965947,0.8676991],"study_design_scores_gemma":[0.0003873299,0.00009277068,0.00002164377,0.0004354283,0.00007408523,0.0001397014,0.000101644,0.9848288,0.001066339,0.007922222,0.004593004,0.000337058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01182387,0.001192164,0.9612762,0.02242294,0.001077097,0.0005909876,0.0001402708,0.00141886,0.00005758221],"genre_scores_gemma":[0.8160202,0.00007301208,0.1833538,0.000272583,0.00009893057,0.00003479205,0.00002391668,0.00005367296,0.00006913902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9094427,"threshold_uncertainty_score":0.9999877,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03527887273444228,"gpt":0.2724138200064427,"spread":0.2371349472720004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827627,0.0002215821,0.0002833456,0.0001342278,0.0007332198,0.0003626024,0.0006408495,0.0001333914,0.00004947538],"category_scores_gemma":[0.00002301495,0.000216993,0.0001236899,0.0003851816,0.00003365007,0.0005806523,0.00003326523,0.0003213017,0.000009504939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003686032,"about_ca_system_score_gemma":0.0001193926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002378299,"about_ca_topic_score_gemma":0.000329159,"domain_scores_codex":[0.9979402,0.00008934871,0.0003959641,0.0009333253,0.0002855957,0.0003554975],"domain_scores_gemma":[0.9987101,0.0002400286,0.00009419596,0.0005721145,0.0002729104,0.0001106485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001814052,0.001894531,0.0001878317,0.0007510728,0.002044174,0.0003646432,0.01661692,0.7242413,0.07754255,0.03743935,0.008195641,0.1305406],"study_design_scores_gemma":[0.0006013124,0.00003493658,0.00003847402,0.00006335027,0.00006914668,0.0001045859,0.0002745991,0.9861183,0.01162482,0.00001630478,0.0008010416,0.000253089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08172208,0.0002897131,0.9164539,0.0003815365,0.0007632918,0.0001617449,0.0001178859,0.0001001888,0.000009655954],"genre_scores_gemma":[0.9371376,0.00001499656,0.06206114,0.0002727716,0.00008551819,0.000002772112,0.00008492812,0.00001759281,0.0003227055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8554155,"threshold_uncertainty_score":0.8848717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Affine transformation; Parallel computing; Computation; Exponentiation; Software; Computer engineering; Theoretical computer science; Computational science; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02342511708385293,"gpt":0.257891111118662,"spread":0.2344659940348091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002508099,0.0001270144,0.000164241,0.0002070751,0.0002401068,0.00007323231,0.0002500259,0.00005235691,0.000008421783],"category_scores_gemma":[0.000006497663,0.0001164874,0.00008280871,0.0004957563,0.00005329893,0.0002276689,0.00000847458,0.0001731783,0.000005669846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001415425,"about_ca_system_score_gemma":0.00007798189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009401788,"about_ca_topic_score_gemma":0.00006264837,"domain_scores_codex":[0.9989639,0.00005162632,0.0002587972,0.0002819262,0.0002209467,0.000222782],"domain_scores_gemma":[0.9992701,0.0001481495,0.00007867887,0.0002486716,0.0001185889,0.0001357592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006598025,0.0009104686,0.00377751,0.0003128979,0.0003247521,0.00007032938,0.01940433,0.1699804,0.001554231,0.008500684,0.0008423841,0.794256],"study_design_scores_gemma":[0.006637895,0.002151516,0.003573939,0.0005464408,0.0002234205,0.0005072047,0.005191055,0.8522336,0.1128198,0.009503386,0.004875127,0.001736564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.100133,0.0001662407,0.8989359,0.0001642667,0.0002759333,0.000111569,0.00001023453,0.0001211406,0.00008169716],"genre_scores_gemma":[0.9168696,0.00001718124,0.08299526,0.00006078853,0.0000218094,0.000002991944,0.00000107936,0.000008061454,0.00002327404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8167365,"threshold_uncertainty_score":0.4750217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02973284282456744,"gpt":0.2612602721635021,"spread":0.2315274293389347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004857376,0.0002329468,0.0002651896,0.0002772161,0.0004784102,0.0001521231,0.0001828202,0.0001475673,0.00002799192],"category_scores_gemma":[0.00004904959,0.0002644002,0.00004997346,0.0007033549,0.00001799879,0.0003186479,0.00001514984,0.0007615833,0.000003324474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009835596,"about_ca_system_score_gemma":0.00003685286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000459294,"about_ca_topic_score_gemma":0.003080138,"domain_scores_codex":[0.9983101,0.00009651356,0.0003344182,0.0004989218,0.0003372112,0.0004228357],"domain_scores_gemma":[0.9992664,0.0001851443,0.00003478896,0.0002839955,0.00009869446,0.0001310017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001371454,0.00003444413,0.000378323,0.00005729728,0.00003205176,0.00007292949,0.001690866,0.9635241,0.01114637,0.000008147998,0.00002363424,0.02301813],"study_design_scores_gemma":[0.0003268871,0.00003920916,0.00006008148,0.0001699746,0.0000246987,0.0002892399,0.0007788579,0.9621387,0.03374483,0.00001405912,0.002115243,0.0002981984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5077857,0.0003290628,0.4908395,0.0000585583,0.0006795165,0.00005256619,0.00001266757,0.0001408732,0.0001015843],"genre_scores_gemma":[0.9968101,0.00005125177,0.002747455,0.00006299841,0.0001442096,0.000002295356,0.00001663666,0.00004443304,0.0001206697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4890244,"threshold_uncertainty_score":0.9999808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02607201367916386,"gpt":0.2814976490122135,"spread":0.2554256353330496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003864547,0.0003310554,0.0003144698,0.0001318065,0.0007208501,0.0004557833,0.00529494,0.0001295577,0.00001727021],"category_scores_gemma":[0.0009937857,0.0003158024,0.00007499319,0.0004369125,0.0001153694,0.000478963,0.003252666,0.000894672,0.000009531786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005923059,"about_ca_system_score_gemma":0.00007240064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005796108,"about_ca_topic_score_gemma":0.000009278565,"domain_scores_codex":[0.9973344,0.0001948202,0.0003800899,0.001112869,0.0004429219,0.0005349631],"domain_scores_gemma":[0.9961082,0.0004406609,0.00009845196,0.002844347,0.00004351094,0.0004648144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001145918,0.004502523,0.01731264,0.002026354,0.00158521,0.001915845,0.008967837,0.4361185,0.01192768,0.002858283,0.04105495,0.4705842],"study_design_scores_gemma":[0.0009841128,0.0001215528,0.002707409,0.00008420673,0.00005561495,0.00001397542,0.000052646,0.993381,0.001181702,0.0007083219,0.0003581322,0.0003513546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1890964,0.0001541124,0.8024042,0.0070759,0.0001988068,0.0002813742,0.0002296994,0.000544632,0.00001483086],"genre_scores_gemma":[0.8728569,0.0000741242,0.1265541,0.0004347143,0.00003120509,0.000007961267,0.00001691713,0.00002218765,0.000001942625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6837604,"threshold_uncertainty_score":0.9999294,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0158812799605622,"gpt":0.2328655468924216,"spread":0.2169842669318594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003114949,0.0002886161,0.0003053215,0.0001572553,0.0008186664,0.0004500516,0.0006637694,0.000131785,0.00002574302],"category_scores_gemma":[0.0000157073,0.0002887317,0.0001033421,0.0007234421,0.00006448189,0.0004498067,0.00007428136,0.0006178314,0.000008581872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001773489,"about_ca_system_score_gemma":0.00004164379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004436992,"about_ca_topic_score_gemma":0.00001446875,"domain_scores_codex":[0.9979765,0.00011081,0.0003235093,0.0008264995,0.0003030895,0.0004595317],"domain_scores_gemma":[0.9987606,0.0002538784,0.0001054772,0.0004773561,0.00006573828,0.0003369973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003724789,0.001372163,0.0007239006,0.001906711,0.0005774798,0.0006269467,0.1084428,0.5795454,0.01499851,0.02730215,0.002576902,0.2615545],"study_design_scores_gemma":[0.0008553573,0.0002659989,0.00005613277,0.0001087773,0.00003437486,0.00007700932,0.000644022,0.9862487,0.004772135,0.0004607418,0.005994901,0.0004817996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3036213,0.0007411024,0.6944149,0.0003048063,0.0003353625,0.0002225254,0.0000261233,0.0002519821,0.00008189508],"genre_scores_gemma":[0.985728,0.0001163068,0.01350776,0.0004693681,0.0001441634,0.000007333589,0.000003718998,0.00001972909,0.000003650253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6821067,"threshold_uncertainty_score":0.9999565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02230080885521114,"gpt":0.2785489858857764,"spread":0.2562481770305652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684455,0.0001919491,0.0003240445,0.0002249101,0.0003768193,0.0001272327,0.0006937877,0.00005367051,6.676743e-7],"category_scores_gemma":[0.00000429364,0.0001725076,0.00006002363,0.0004151001,0.00003723398,0.000288799,0.00005045761,0.000161105,0.000007761584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000973774,"about_ca_system_score_gemma":0.00003965325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001397374,"about_ca_topic_score_gemma":0.00004091661,"domain_scores_codex":[0.9986108,0.00007244129,0.0002528598,0.0005872874,0.0001722112,0.0003043958],"domain_scores_gemma":[0.9981486,0.0009895841,0.0000951585,0.0005822193,0.00007969952,0.0001046973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001780363,0.00116424,0.0004874819,0.004027002,0.001185505,0.00008027427,0.0236473,0.2067287,0.008818203,0.006986145,0.001109832,0.7455873],"study_design_scores_gemma":[0.0002839494,0.00009731291,0.00009464843,0.0002016475,0.00006168523,0.0000286852,0.0002517363,0.9867121,0.01100493,0.0001907234,0.000878758,0.0001938267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3942932,0.0002167882,0.6040604,0.0001311814,0.0006070978,0.0002800811,0.0001118155,0.0002016198,0.00009779976],"genre_scores_gemma":[0.9971913,0.00004236684,0.002547966,0.00002251682,0.0001258206,0.0000148777,0.000009577921,0.00001843238,0.00002717535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7799834,"threshold_uncertainty_score":0.7034656,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01634097675994247,"gpt":0.2320379466060755,"spread":0.215696969846133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000433175,0.0002432664,0.0002402225,0.0003756453,0.001705089,0.0001528791,0.0005366677,0.00005887391,0.00002233831],"category_scores_gemma":[0.000001103315,0.000248308,0.0001488502,0.0008746044,0.00005296856,0.0006445868,0.00003423553,0.0005672628,0.000002646273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004300183,"about_ca_system_score_gemma":0.00003059877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002727413,"about_ca_topic_score_gemma":0.000006690788,"domain_scores_codex":[0.9979401,0.0001876116,0.0002923693,0.000834187,0.0003489124,0.0003968136],"domain_scores_gemma":[0.998988,0.00009649378,0.0001144606,0.0006363549,0.00006544656,0.00009922977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005345001,0.0002590305,0.00002476659,0.00002776316,0.0001017534,0.00006644863,0.003855535,0.8913401,0.001578335,0.005774674,0.0002483229,0.09666984],"study_design_scores_gemma":[0.0003798863,0.0003373959,0.000007641029,0.00001860762,0.00001900619,0.0001770209,0.0001048003,0.9436494,0.03088357,0.02228325,0.001727142,0.0004123117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01118715,0.0003417599,0.9862312,0.0001795524,0.0005240651,0.000265189,0.00001097437,0.0005387554,0.0007213184],"genre_scores_gemma":[0.9188277,0.00004692279,0.08050444,0.0004335405,0.00003488556,0.00003977169,0.000002720438,0.0000195032,0.00009057106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9076405,"threshold_uncertainty_score":0.9999969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01967383066052402,"gpt":0.2501485958531611,"spread":0.230474765192637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393469,0.0001920982,0.0002107443,0.0001559579,0.0009553999,0.000458077,0.00132822,0.00002910785,0.0001193052],"category_scores_gemma":[0.00000826039,0.0001914039,0.00003548212,0.000341171,0.0000513041,0.0008955138,0.0006354056,0.0003237907,0.000005680408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002908015,"about_ca_system_score_gemma":0.00003550885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009750657,"about_ca_topic_score_gemma":0.00001841461,"domain_scores_codex":[0.9983483,0.0001004692,0.0002468947,0.000658982,0.0003397683,0.0003055609],"domain_scores_gemma":[0.9988832,0.00007900639,0.00007761282,0.0008495844,0.00002594335,0.00008466812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001998524,0.0009033781,0.000156549,0.0004038291,0.0004796387,0.000351572,0.009704503,0.1296194,0.001101665,0.006064841,0.008151985,0.8428628],"study_design_scores_gemma":[0.000398733,0.0001594569,0.0001077386,0.0000324855,0.00002399492,0.00007548649,0.0002028112,0.9844869,0.0005021432,0.0001960816,0.01356257,0.0002516245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06092755,0.0002293583,0.9364806,0.0009482461,0.0005969253,0.0001877461,0.0001379317,0.0002100183,0.0002815571],"genre_scores_gemma":[0.9712871,0.00004451233,0.02762222,0.0002578578,0.00006750863,0.000008147986,0.00004443771,0.0000198377,0.0006483819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9103596,"threshold_uncertainty_score":0.7805223,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Xiangtan University; National Natural Science Foundation of China","keywords":"Computer science; Differential privacy; Crowdsensing; Computer security; Minification; Identification (biology); Optimization problem; Data mining; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03444357905367922,"gpt":0.2881141857485804,"spread":0.2536706066949012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006782611,0.0003190249,0.00029927,0.0003615333,0.0009342982,0.001640151,0.0007047958,0.0001178478,0.000007305474],"category_scores_gemma":[0.00004230292,0.0003160551,0.00006366205,0.0006453452,0.00005265441,0.0006506576,0.0001005959,0.0005278495,0.00001528709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004507086,"about_ca_system_score_gemma":0.0001100713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001362107,"about_ca_topic_score_gemma":0.0001057238,"domain_scores_codex":[0.9975042,0.0001140182,0.0003606744,0.001158663,0.000311105,0.0005512761],"domain_scores_gemma":[0.9978126,0.0007186711,0.00005371362,0.001087161,0.00007082036,0.0002570932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004701212,0.0001175008,0.000139732,0.0007177463,0.0001915328,0.0005804507,0.006830469,0.2029941,0.01388645,0.00078935,0.00196369,0.771742],"study_design_scores_gemma":[0.0002276527,0.00008720641,0.00005555486,0.0009326335,0.00004029939,0.0002725774,0.0001653159,0.9854626,0.008243939,0.0001115401,0.004008248,0.0003923978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2067307,0.0007149249,0.7900256,0.0009870027,0.0006801812,0.0001701505,0.00001659976,0.0005212612,0.0001536024],"genre_scores_gemma":[0.9393502,0.00001820666,0.0599633,0.0004579754,0.00009170583,0.000002113697,0.000004019137,0.00003910915,0.00007329764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7824686,"threshold_uncertainty_score":0.9999291,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06695110729053493,"gpt":0.2785192576247053,"spread":0.2115681503341703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006744006,0.0002364427,0.0002536368,0.0003297533,0.0004239391,0.0002128961,0.0003253662,0.000108484,0.000007812805],"category_scores_gemma":[0.00002477754,0.0001804674,0.00009502034,0.0004902862,0.00007092886,0.0001380419,0.0000232934,0.0003539668,0.00001543885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001950521,"about_ca_system_score_gemma":0.00005083636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006579023,"about_ca_topic_score_gemma":0.00004142307,"domain_scores_codex":[0.9980127,0.0001385382,0.000394915,0.000580818,0.0003240102,0.0005489849],"domain_scores_gemma":[0.9986866,0.0007014718,0.00009963844,0.00033935,0.00003189191,0.0001410194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001738556,0.00130653,0.0005488975,0.0002319521,0.000358682,0.0007643753,0.01786896,0.4842531,0.004354316,0.121833,0.0003543824,0.3679519],"study_design_scores_gemma":[0.001937533,0.0002655252,0.000181675,0.0006279713,0.00003215525,0.0003429127,0.001782785,0.9848971,0.004563477,0.003387968,0.00132149,0.0006594526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08768769,0.0000603262,0.9032457,0.007167958,0.0004108332,0.0001444708,0.00000124114,0.0002267736,0.001055034],"genre_scores_gemma":[0.9766009,0.00002759767,0.02277601,0.0003734276,0.00008011209,0.000003168942,1.167751e-7,0.00001770527,0.0001209411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8889132,"threshold_uncertainty_score":0.7359247,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03810054228531694,"gpt":0.3112404870368611,"spread":0.2731399447515442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000671089,0.0002506185,0.0002351549,0.0002572538,0.0005881228,0.001109141,0.0007876917,0.0001335323,0.00003555133],"category_scores_gemma":[0.00003646917,0.0002359198,0.0000628732,0.0006088228,0.00007068094,0.00223653,0.0001647822,0.0007589458,0.000009453893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001964903,"about_ca_system_score_gemma":0.0001139333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001246594,"about_ca_topic_score_gemma":0.0000837683,"domain_scores_codex":[0.9978452,0.0001322934,0.0003117328,0.0009967056,0.0003092485,0.0004047777],"domain_scores_gemma":[0.9978365,0.0008197502,0.00005339468,0.001065457,0.00003543571,0.0001894341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001585875,0.0009096025,0.0008959547,0.001854436,0.0009158315,0.001425948,0.01245489,0.001919445,0.006871047,0.1772005,0.008890017,0.7865038],"study_design_scores_gemma":[0.0003366602,0.00009315612,0.0003962513,0.0003637524,0.00006751718,0.0004175368,0.000125101,0.9837071,0.0006470688,0.002401301,0.01102685,0.0004177131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06821641,0.001250642,0.9280084,0.001003946,0.0006843983,0.0001627862,0.00006319878,0.0004103588,0.0001998349],"genre_scores_gemma":[0.936534,0.0002942944,0.06283996,0.000180476,0.0001065739,0.000002803484,0.0000140117,0.00001880821,0.000009026236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9817876,"threshold_uncertainty_score":0.9999278,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02045732974857327,"gpt":0.263078665197013,"spread":0.2426213354484397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890373,0.0001999898,0.0002064844,0.0002354072,0.0006126302,0.0002694253,0.0003842398,0.0001221091,0.00001638472],"category_scores_gemma":[0.00002001629,0.000168474,0.00004945604,0.001119616,0.00007716418,0.0003139546,0.00003045235,0.0003566333,0.000007253328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001508808,"about_ca_system_score_gemma":0.00006717545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009362264,"about_ca_topic_score_gemma":0.0001114697,"domain_scores_codex":[0.9982118,0.0001014068,0.000264863,0.000575192,0.0004888377,0.0003579257],"domain_scores_gemma":[0.9987848,0.0004592489,0.00008424695,0.0003795584,0.00007177838,0.0002203364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000502281,0.001841772,0.0057853,0.0008858297,0.0005941824,0.0006281912,0.0226301,0.2032016,0.000450728,0.02642585,0.002586297,0.7344679],"study_design_scores_gemma":[0.0009606237,0.0002342099,0.006944913,0.000204702,0.00002910589,0.0001104007,0.00009345584,0.9884557,0.001056194,0.0004078228,0.001203546,0.0002993456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4319866,0.00006504878,0.5667247,0.0005511868,0.0002065889,0.0001630547,0.00001217436,0.0002623575,0.00002832305],"genre_scores_gemma":[0.9941263,0.0001302638,0.005489832,0.0001515244,0.00004954157,0.00002424092,0.000007667722,0.0000125698,0.000008129245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7852541,"threshold_uncertainty_score":0.6870172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02847004653088581,"gpt":0.3328800217763086,"spread":0.3044099752454228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501753,0.0001717651,0.0004904753,0.0002704259,0.0007652559,0.0001645176,0.0002557235,0.0001235087,0.0001837655],"category_scores_gemma":[0.00001367362,0.0001536641,0.0002770485,0.000603726,0.0001181843,0.0003470435,0.000002444949,0.0001777247,0.000002406769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000475048,"about_ca_system_score_gemma":0.0002532782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002310255,"about_ca_topic_score_gemma":0.004043578,"domain_scores_codex":[0.9985576,0.000121034,0.0003890677,0.0002911791,0.000289792,0.0003513299],"domain_scores_gemma":[0.9986914,0.000652264,0.0002101997,0.0001597638,0.0001909874,0.0000953767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00495234,0.001205298,0.1290302,0.0004486376,0.005978327,0.00001108332,0.02743997,0.6940207,0.0009325569,0.01239099,0.00007615467,0.1235138],"study_design_scores_gemma":[0.005341878,0.0006278828,0.0141646,0.0001055581,0.001921891,0.000001557323,0.006339177,0.9645907,0.002310639,0.0001975316,0.003764581,0.0006339877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5320754,0.00006868553,0.4649968,0.0004107048,0.0001764038,0.000668194,0.0002581379,0.00005208145,0.001293564],"genre_scores_gemma":[0.9992286,0.00001288409,0.0003180197,0.0001886696,0.00006172986,0.00001662524,0.00001295487,0.00001103824,0.0001494536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4671532,"threshold_uncertainty_score":0.626624,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01142998110085423,"gpt":0.2295166929922232,"spread":0.218086711891369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005170907,0.000616808,0.0006050209,0.0004502762,0.001073092,0.0002269748,0.0001812816,0.0004289925,0.00006850382],"category_scores_gemma":[0.000009957943,0.0007242089,0.0002278956,0.0004830489,0.0001431794,0.0001152212,0.000007213673,0.0007094318,0.000007108248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002773905,"about_ca_system_score_gemma":0.0001350194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000515668,"about_ca_topic_score_gemma":0.0004591273,"domain_scores_codex":[0.9970546,0.0001652512,0.0007629104,0.0008851279,0.0003450158,0.0007870797],"domain_scores_gemma":[0.9981855,0.00084833,0.000173346,0.0003488169,0.0001895488,0.0002545031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002537988,0.0003392612,0.00001668698,0.0004675173,0.0006250825,0.00001973013,0.0005263529,0.9317427,0.001570152,0.001057947,0.0001835424,0.06319723],"study_design_scores_gemma":[0.003681292,0.0004579407,0.0006007908,0.0007596613,0.0006747929,0.00003673972,0.000274935,0.9883071,0.003213648,0.0004375881,0.0009545446,0.0006009316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1316837,0.001632367,0.8634123,0.0002991743,0.0009881918,0.001356961,0.0002291756,0.0001769114,0.0002212198],"genre_scores_gemma":[0.9908586,0.00007848706,0.008157428,0.0002161501,0.0001389739,0.00009591493,0.0001036949,0.00006773629,0.0002829962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8591749,"threshold_uncertainty_score":0.9995209,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02367517865960752,"gpt":0.2630985343970592,"spread":0.2394233557374517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916075,0.0002173493,0.0002490723,0.0003788254,0.0004611071,0.0002090971,0.0008267735,0.0001098282,0.00002027528],"category_scores_gemma":[0.00002051672,0.0002166013,0.00004607318,0.001050193,0.00006060967,0.0005392211,0.0002041923,0.0004567523,0.00001363295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002257375,"about_ca_system_score_gemma":0.00005277914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005400105,"about_ca_topic_score_gemma":0.0002646889,"domain_scores_codex":[0.9979203,0.0001204919,0.0003210929,0.0008577895,0.0003446427,0.0004356388],"domain_scores_gemma":[0.9983131,0.0004025228,0.00007332292,0.00103206,0.00003416809,0.0001448741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006297668,0.002890144,0.00465642,0.00148691,0.0006104526,0.002228635,0.02175703,0.5714386,0.007315269,0.05558738,0.02693572,0.3044637],"study_design_scores_gemma":[0.0008885427,0.0000527334,0.002173986,0.0001726344,0.00001573603,0.00005142897,0.00009595342,0.9934218,0.0005025471,0.001218656,0.001096298,0.0003096875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5305242,0.0001400675,0.4679108,0.0003539899,0.0006338275,0.0001515928,0.00008128166,0.0001789325,0.00002535375],"genre_scores_gemma":[0.9909791,0.00008509878,0.00860686,0.0002043073,0.00006719114,0.000003113597,0.00003134305,0.00001339751,0.000009580393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4604549,"threshold_uncertainty_score":0.8832746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}