{"meta":{"query_hash":"329205527624","filters":{"venue":"IEEE Transactions on Dependable and Secure Computing"},"cohort_total":117,"direct_labels_cover":0,"predictions_cover":117,"exported":117,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/329205527624","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Dependable+and+Secure+Computing"},"results":[{"id":"W1990935444","doi":"10.1109/tdsc.2011.55","title":"Persuasive Cued Click-Points: Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Password; Usability; Persuasion; Human–computer interaction; Authentication (law); Human-computer interaction in information security; Password policy; Computer security; Cognitive password; Cued speech; Message authentication code; Persuasive technology; World Wide Web; Information security; One-time password; Cryptography; Security service; Software security assurance","score_opus":0.0735171356676938,"score_gpt":0.31125583532713097,"score_spread":0.23773869965943717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990935444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76682764,0.00025900232,0.22103778,0.00027594602,0.0000773088,0.0045176945,0.00013154684,0.0032127588,0.0036603953],"genre_scores_gemma":[0.84550256,0.00013876377,0.15059212,0.00013950164,0.0000127847425,0.00113331,0.00009257281,0.00015392038,0.002234466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99560815,0.002102712,0.00034450975,0.00030440246,0.0013642549,0.00027585131],"domain_scores_gemma":[0.98159385,0.01186138,0.0011248362,0.0017029446,0.0027929808,0.0009239357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059008757,0.0008749198,0.0005875738,0.000845152,0.00043635664,0.001960997,0.0022092147,0.0018686622,0.0037932051],"category_scores_gemma":[0.023798887,0.0005748483,0.00036749354,0.00035395837,0.00087790185,0.0023125855,0.0013306475,0.0009272533,0.00068674644],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013495596,0.017545624,0.013856865,0.0038145187,0.00047122696,0.001075083,0.011386686,0.023648638,0.2402976,0.014446103,0.0026874861,0.65727454],"study_design_scores_gemma":[0.0071049095,0.07048719,0.028390879,0.00046716025,0.0015253688,0.002144748,0.0028248027,0.28578174,0.56959724,0.0051747197,0.025815193,0.00068602525],"about_ca_topic_score_codex":0.0012308481,"about_ca_topic_score_gemma":0.0006393949,"teacher_disagreement_score":0.0059008757,"about_ca_system_score_codex":0.00079309894,"about_ca_system_score_gemma":0.0013003752,"threshold_uncertainty_score":0.031207204},"labels":[],"label_agreement":null},{"id":"W2022774249","doi":"10.1109/tdsc.2013.22","title":"Secure Two-Party Differentially Private Data Release for Vertically Partitioned Data","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Skaggs School of Pharmacy and Pharmaceutical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Differential privacy; Data publishing; Adversary; Protocol (science); Private information retrieval; Secure multi-party computation; Set (abstract data type); Information privacy; Task (project management); Information sensitivity; Computation; Computer security; Data mining; Publishing; Algorithm","score_opus":0.05355360499792926,"score_gpt":0.291247632256955,"score_spread":0.23769402725902572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022774249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030661859,0.00015667899,0.9671956,0.00046377318,0.000036224163,0.00012957583,0.00008493845,0.0002619899,0.0010094302],"genre_scores_gemma":[0.7397809,0.00022062131,0.25571078,0.00026876805,0.0000655607,0.00041307643,0.0002811195,0.00010100097,0.0031580885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895942,0.0034821471,0.0010005465,0.0014798037,0.0036879482,0.0007553915],"domain_scores_gemma":[0.98032963,0.0075663486,0.0017921958,0.009036517,0.0008800607,0.000395173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076916134,0.0005031106,0.0014693596,0.000560958,0.0016252586,0.0025455784,0.002620495,0.0015944608,0.0013072591],"category_scores_gemma":[0.016321514,0.00061354996,0.0015250369,0.0013952099,0.00228732,0.0055896547,0.0071862517,0.0031944048,0.0005844382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002920257,0.0005401631,0.0044507077,0.00051629014,0.00035679433,0.0020922378,0.0030759461,0.13479008,0.085584894,0.5691652,0.0041260924,0.19238131],"study_design_scores_gemma":[0.0004234312,0.0004336229,0.00086984003,0.000051687002,0.00010039788,0.0016030573,0.00030721969,0.6817957,0.08388801,0.22042009,0.010003561,0.00010329926],"about_ca_topic_score_codex":0.00025563373,"about_ca_topic_score_gemma":0.00020723694,"teacher_disagreement_score":0.0076916134,"about_ca_system_score_codex":0.0012811462,"about_ca_system_score_gemma":0.0016118983,"threshold_uncertainty_score":0.040677607},"labels":[],"label_agreement":null},{"id":"W2093197020","doi":"10.1109/tdsc.2007.70207","title":"A New Biometric Technology Based on Mouse Dynamics","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":366,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Biometrics; Computer science; Artifact (error); Confusion matrix; Word error rate; Data mining; Process (computing); Receiver operating characteristic; Set (abstract data type); False positive rate; Artificial intelligence; Crossover; Detector; Pattern recognition (psychology); Machine learning","score_opus":0.010291304235440307,"score_gpt":0.24082904852713116,"score_spread":0.23053774429169085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093197020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050409425,0.0065715285,0.9291869,0.0008574338,0.0011045977,0.00019882174,0.00082985667,0.0035825153,0.007258988],"genre_scores_gemma":[0.5466178,0.0053236536,0.4295665,0.0020153502,0.000795697,0.0005140174,0.0007616976,0.00021643471,0.014188912],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981383,0.00041081774,0.00010511137,0.00041931687,0.0008450984,0.00008144033],"domain_scores_gemma":[0.9983872,0.0005126573,0.00039320125,0.0002970457,0.00030188236,0.000107997716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010157519,0.0006857445,0.0009209013,0.0014522633,0.0002708549,0.00088323315,0.0010676576,0.0012366351,0.0033364282],"category_scores_gemma":[0.003133136,0.0003169109,0.0004771079,0.0010983392,0.0005690717,0.0023229094,0.0013196165,0.0010304585,0.0016542871],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080047204,0.00018426702,0.010088438,0.0010892921,0.00014424219,0.00042089654,0.00028500098,0.003340505,0.5160074,0.01766711,0.008514796,0.44145757],"study_design_scores_gemma":[0.00031565796,0.0054595056,0.058716286,0.0009651408,0.00065073854,0.020370457,0.0002611733,0.23077843,0.42243555,0.016925817,0.2422626,0.0008586382],"about_ca_topic_score_codex":0.00024234326,"about_ca_topic_score_gemma":0.00026832725,"teacher_disagreement_score":0.0033364282,"about_ca_system_score_codex":0.00030238501,"about_ca_system_score_gemma":0.00022878854,"threshold_uncertainty_score":0.011161447},"labels":[],"label_agreement":null},{"id":"W2106916437","doi":"10.1109/tdsc.2008.21","title":"Error Detection and Fault Tolerance in ECSM Using Input Randomization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Elliptic curve cryptography; Cryptosystem; Fault tolerance; Scalar multiplication; Fault detection and isolation; Error detection and correction; Cryptography; Algorithm; Elliptic curve; Parallel computing; Computer engineering; Public-key cryptography; Mathematics; Distributed computing; Encryption; Artificial intelligence","score_opus":0.017692184813403455,"score_gpt":0.2371697182894762,"score_spread":0.21947753347607274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106916437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23343995,0.0003952536,0.75860345,0.0003255618,0.000083984465,0.00012963756,0.00007451654,0.003284552,0.003663108],"genre_scores_gemma":[0.8760734,0.00009290687,0.12180069,0.000056312776,0.000037382404,0.000058967573,0.00006129325,0.00006273014,0.0017563448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781185,0.0006495021,0.00017910749,0.00042734074,0.0007522682,0.00017991468],"domain_scores_gemma":[0.9939459,0.0020656255,0.001120091,0.002232669,0.0005559657,0.00007988018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775608,0.00041851512,0.00065776176,0.000750844,0.0004964593,0.00084818865,0.0009807387,0.00059178926,0.0015027291],"category_scores_gemma":[0.0074569294,0.00022497596,0.00037336437,0.00082088157,0.0010729632,0.0013384492,0.0010195834,0.00060716644,0.0003643154],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00261063,0.0002868433,0.0061041988,0.00037851257,0.0001121192,0.0009951169,0.0004844552,0.2279192,0.15956102,0.16307017,0.0026020347,0.43587568],"study_design_scores_gemma":[0.0001256738,0.00062305527,0.0011003794,0.00005562761,0.00006222129,0.00084050756,0.000048795082,0.7603351,0.19847764,0.033134237,0.0051455544,0.000051194973],"about_ca_topic_score_codex":0.0002555543,"about_ca_topic_score_gemma":0.000239635,"teacher_disagreement_score":0.0015027291,"about_ca_system_score_codex":0.00069323304,"about_ca_system_score_gemma":0.0008508097,"threshold_uncertainty_score":0.007814169},"labels":[],"label_agreement":null},{"id":"W2147096042","doi":"10.1109/tdsc.2015.2406704","title":"Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":275,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Upload; Encryption; Server; Relevance (law); Information retrieval; Usability; Database; Data mining; Computer security; World Wide Web","score_opus":0.08650531738753572,"score_gpt":0.3112842504318411,"score_spread":0.22477893304430538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147096042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2512833,0.0022353823,0.737183,0.0005566169,0.00012600921,0.0004939297,0.0014432993,0.0016475391,0.0050308746],"genre_scores_gemma":[0.8287355,0.0007077953,0.16578898,0.00017659937,0.00006917861,0.00011413916,0.0010103176,0.0000798271,0.0033177943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726796,0.0004821637,0.00046208987,0.0004180977,0.00095682434,0.0004128777],"domain_scores_gemma":[0.99442166,0.0014427762,0.0006691289,0.0023561895,0.0008283594,0.0002817921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503159,0.00046051215,0.0013622955,0.0011594418,0.0007680148,0.0017241882,0.0011905414,0.0008651126,0.0018200099],"category_scores_gemma":[0.005602187,0.00028429343,0.000680365,0.0023788738,0.0007465378,0.0057885083,0.0031934618,0.00093585026,0.0012499456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038832573,0.0007388895,0.008767775,0.0013007004,0.00031698146,0.0015487174,0.0020502072,0.059811424,0.26601976,0.08083536,0.0121624125,0.56256455],"study_design_scores_gemma":[0.00035964767,0.0010125496,0.0033712955,0.00010393624,0.00018172861,0.0039485884,0.0015113514,0.70498025,0.2004911,0.062132426,0.021677798,0.00022930666],"about_ca_topic_score_codex":0.0016750037,"about_ca_topic_score_gemma":0.001874967,"teacher_disagreement_score":0.0018200099,"about_ca_system_score_codex":0.0008130555,"about_ca_system_score_gemma":0.0016521559,"threshold_uncertainty_score":0.0060884953},"labels":[],"label_agreement":null},{"id":"W2157001542","doi":"10.1109/tdsc.2011.16","title":"Efficient Fault Detection and Diagnosis in Complex Software Systems with Information-Theoretic Monitoring","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Jaccard index; Data mining; Mutual information; Pairwise comparison; Entropy (arrow of time); Component (thermodynamics); Metric (unit); Wilcoxon signed-rank test; Context (archaeology); Inference; Artificial intelligence; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.016077978260016217,"score_gpt":0.21359344813163914,"score_spread":0.1975154698716229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157001542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089413494,0.00027262888,0.908449,0.00031214516,0.000011187968,0.000048121903,0.000045946184,0.00083848205,0.00060902047],"genre_scores_gemma":[0.7934085,0.00012963013,0.20591523,0.0000430142,0.00002695649,0.0000511496,0.00007760179,0.00003822294,0.00030971877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980343,0.000615293,0.00014258246,0.000322677,0.0007756662,0.00010947752],"domain_scores_gemma":[0.9909588,0.005670469,0.0017153184,0.00074972206,0.0007271325,0.00017866911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505256,0.0009449701,0.0010187445,0.002129041,0.0005068876,0.0011173945,0.0011781007,0.00082167867,0.0004470533],"category_scores_gemma":[0.016039748,0.00040957314,0.00039490827,0.001215035,0.0011247558,0.002411582,0.0014085324,0.0008012979,0.00018749165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035294247,0.00024230099,0.018950421,0.0001499678,0.00010227403,0.00024994276,0.0002742665,0.60131955,0.016942125,0.014773721,0.0010166023,0.34562594],"study_design_scores_gemma":[0.000008225984,0.000035163852,0.0014045334,0.0000041537646,0.000006982548,0.00005522278,0.000013407828,0.9855555,0.003881993,0.008869419,0.00015655998,0.000008720731],"about_ca_topic_score_codex":0.0018682771,"about_ca_topic_score_gemma":0.0023878305,"teacher_disagreement_score":0.0021505256,"about_ca_system_score_codex":0.0012008934,"about_ca_system_score_gemma":0.0010975307,"threshold_uncertainty_score":0.011373162},"labels":[],"label_agreement":null},{"id":"W2158462873","doi":"10.1109/tdsc.2007.1004","title":"A Survey and Analysis of the P3P Protocol's Agents, Adoption, Maintenance, and Future","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scope (computer science); Protocol (science); The Internet; World Wide Web; Computer science; Web survey; Survey data collection; Survey research; Internet privacy; Business; Medicine; Statistics","score_opus":0.02550869483214166,"score_gpt":0.3035000606436103,"score_spread":0.27799136581146866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158462873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764703,0.0025154417,0.006032415,0.0026181187,0.000037503116,0.00018371605,0.0014008373,0.00011169392,0.010630095],"genre_scores_gemma":[0.9849338,0.0049307,0.0059766825,0.00072052854,0.000062137115,0.00018336884,0.0013458442,0.000042570362,0.0018045807],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9906087,0.003685731,0.001088051,0.00065249664,0.0035428768,0.0004220798],"domain_scores_gemma":[0.9268456,0.04400361,0.01293154,0.0025772396,0.011814181,0.0018277912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079812985,0.00019123082,0.00025997096,0.0036210727,0.0006186618,0.0014783858,0.00041730423,0.0006748559,0.0013855168],"category_scores_gemma":[0.037176307,0.00029269143,0.00022304006,0.0050851223,0.00061053527,0.0033819636,0.0007064857,0.0010836166,0.0005002145],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012199133,0.00027860893,0.7194306,0.00063680747,0.000054434466,0.00029154308,0.009964855,0.00058920676,0.0033132818,0.0039624586,0.010975546,0.2503806],"study_design_scores_gemma":[0.000009448786,0.0005928557,0.8807428,0.00046977354,0.0000398488,0.0015994753,0.022184595,0.004025281,0.0023909342,0.001116876,0.08674642,0.00008173512],"about_ca_topic_score_codex":0.0024447131,"about_ca_topic_score_gemma":0.001897291,"teacher_disagreement_score":0.0079812985,"about_ca_system_score_codex":0.000753547,"about_ca_system_score_gemma":0.0008793682,"threshold_uncertainty_score":0.042209685},"labels":[],"label_agreement":null},{"id":"W2159205978","doi":"10.1109/tdsc.2014.2302298","title":"SIP Flooding Attack Detection with a Multi-Dimensional Sketch Design","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Denial-of-service attack; Session Initiation Protocol; Flooding (psychology); Computer network; Sketch; Internet traffic; The Internet; Server; Computer security","score_opus":0.024184294823939648,"score_gpt":0.23430183710077823,"score_spread":0.2101175422768386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159205978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04607421,0.00027476833,0.951417,0.000095808,0.000043833068,0.00013593369,0.00007738462,0.0009606853,0.0009203622],"genre_scores_gemma":[0.6742312,0.00025631933,0.32378906,0.00008772874,0.000033013872,0.00019717216,0.00015177477,0.00003568092,0.0012180383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897015,0.00024137397,0.00011578886,0.00019332045,0.0004231541,0.00005627384],"domain_scores_gemma":[0.99797493,0.00055902806,0.0003221812,0.0005632377,0.0004580787,0.00012257283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083483127,0.0004833397,0.000559428,0.0008561009,0.00029896147,0.0008382134,0.0009869369,0.0005567354,0.0011936415],"category_scores_gemma":[0.003838474,0.00031808417,0.00046152712,0.00045687042,0.00069789577,0.0013665616,0.0013230204,0.0004508688,0.00029977804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011362322,0.00016065396,0.007249088,0.0005169193,0.00019850428,0.00046921792,0.00055376487,0.2465261,0.27778202,0.03880202,0.0023528475,0.42425257],"study_design_scores_gemma":[0.00006125194,0.00049089297,0.0010120445,0.000018106246,0.000044857006,0.0004842455,0.0000476805,0.9328556,0.05583041,0.0047698403,0.0043172888,0.000067744004],"about_ca_topic_score_codex":0.00036105787,"about_ca_topic_score_gemma":0.00022067073,"teacher_disagreement_score":0.0011936415,"about_ca_system_score_codex":0.00050736207,"about_ca_system_score_gemma":0.00042085574,"threshold_uncertainty_score":0.004415095},"labels":[],"label_agreement":null},{"id":"W2171072531","doi":"10.1109/tdsc.2010.39","title":"Fast and Secure Reauthentications for 3GPP Subscribers during WiMAX-WLAN Handovers","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Sultan Qaboos University; Academy of Finland; Queensland University of Technology","keywords":"WiMAX; Computer network; Computer science; Roaming; Handover; Interoperability; Wireless network; Wi-Fi; Telecommunications; Wireless; Computer security","score_opus":0.005020432150511949,"score_gpt":0.2012900685172559,"score_spread":0.19626963636674394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171072531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5010715,0.0009922808,0.48909906,0.00033189988,0.00009632767,0.0004650035,0.000072457144,0.001684173,0.0061872113],"genre_scores_gemma":[0.9706214,0.00018509047,0.02783847,0.000035364195,0.0000280219,0.00007625355,0.00004704983,0.000030137198,0.0011382065],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752206,0.0009031256,0.00022570303,0.00016409975,0.00074719667,0.00043777426],"domain_scores_gemma":[0.99573284,0.0012144698,0.0010008503,0.0013778858,0.00058489706,0.00008908664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003434818,0.00050223165,0.00050207414,0.0010125426,0.00094702694,0.0016281372,0.0007932365,0.00089439616,0.0007817492],"category_scores_gemma":[0.0062384526,0.0002806591,0.00031773135,0.0004150237,0.0012335764,0.0021341008,0.001138899,0.0009017835,0.00042917757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002511994,0.00055047206,0.023996232,0.00036742506,0.00025917395,0.0033524875,0.0041410765,0.09273417,0.41752598,0.133553,0.0036113393,0.31739673],"study_design_scores_gemma":[0.00019641081,0.0017485849,0.008487343,0.00009838872,0.00032491155,0.0030683808,0.0019145329,0.43925795,0.4950473,0.024884509,0.024750602,0.00022106977],"about_ca_topic_score_codex":0.00052583666,"about_ca_topic_score_gemma":0.00064931565,"teacher_disagreement_score":0.003434818,"about_ca_system_score_codex":0.00071653887,"about_ca_system_score_gemma":0.0008920429,"threshold_uncertainty_score":0.01816529},"labels":[],"label_agreement":null},{"id":"W2318549902","doi":"10.1109/tdsc.2016.2548463","title":"Understanding Practical Tradeoffs in HPC Checkpoint-Scheduling Policies","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Exploit; Fault tolerance; Distributed computing; Energy consumption; Software deployment; Supercomputer; Efficient energy use; Embedded system; Reliability engineering; Parallel computing; Operating system; Computer security","score_opus":0.06695110729053493,"score_gpt":0.27851925762470525,"score_spread":0.2115681503341703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318549902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72847265,0.001844525,0.2566471,0.0018876058,0.000064834334,0.000115875475,0.00024125639,0.00037466292,0.01035146],"genre_scores_gemma":[0.9870957,0.00028100834,0.012157322,0.000033435375,0.000010875621,0.000024756211,0.00004588783,0.000050025043,0.00030104467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872166,0.0005205794,0.000060740153,0.00015741686,0.00031757468,0.00022211236],"domain_scores_gemma":[0.9908779,0.0072584166,0.0006869522,0.0005981961,0.00047273008,0.000105765765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002855119,0.00069615204,0.00044535808,0.00063693925,0.00046588518,0.0011439201,0.00071765354,0.0007263744,0.0012575616],"category_scores_gemma":[0.018377693,0.00048286904,0.00024318855,0.00077604264,0.0008770048,0.002501999,0.00057126314,0.0010676627,0.00015724363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005818681,0.00005804548,0.0025654687,0.000049070226,0.000012547232,0.000036090583,0.000062893945,0.97677386,0.0025974691,0.008406198,0.00026485758,0.009115309],"study_design_scores_gemma":[0.0000107616015,0.000049790524,0.0017354386,0.000010897961,0.000010014436,0.000028893017,0.0001124235,0.98636043,0.0027947128,0.008506352,0.0003680046,0.00001225806],"about_ca_topic_score_codex":0.0033178017,"about_ca_topic_score_gemma":0.0031689869,"teacher_disagreement_score":0.0033178017,"about_ca_system_score_codex":0.0018802761,"about_ca_system_score_gemma":0.0012721943,"threshold_uncertainty_score":0.015099525},"labels":[],"label_agreement":null},{"id":"W2343346041","doi":"10.1109/tdsc.2015.2507120","title":"Fast Software Implementations of Bilinear Pairings","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Affine transformation; Parallel computing; Computation; Exponentiation; Software; Computer engineering; Theoretical computer science; Computational science; Algorithm; Mathematics; Programming language","score_opus":0.02342511708385293,"score_gpt":0.257891111118662,"score_spread":0.23446599403480906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343346041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13332802,0.0011254064,0.8294403,0.00028503156,0.00021402347,0.00014737363,0.00020102499,0.008779055,0.02647982],"genre_scores_gemma":[0.7917116,0.00053413695,0.20056911,0.00012351677,0.00011043794,0.00021949262,0.0005062459,0.0006347154,0.0055907774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984648,0.00035715464,0.00012307824,0.0001609455,0.0006378037,0.0002562166],"domain_scores_gemma":[0.9982836,0.00042963141,0.0001252276,0.00073960534,0.00037056432,0.000051380168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380956,0.00080662646,0.00055558054,0.0009754318,0.00051806885,0.0015499671,0.00095293554,0.000579875,0.006796766],"category_scores_gemma":[0.0034892987,0.00041211318,0.0006284303,0.000923262,0.000687548,0.002256301,0.0017415995,0.0010718564,0.0024460743],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012426083,0.00033490628,0.0036838886,0.00078857073,0.00011746308,0.0003891804,0.00078921963,0.06735026,0.0942557,0.30813462,0.011915791,0.51099783],"study_design_scores_gemma":[0.00040466627,0.0013684736,0.0017491039,0.00027512293,0.0001046015,0.00071283506,0.00028136914,0.5295763,0.20877138,0.17160712,0.08502851,0.00012051931],"about_ca_topic_score_codex":0.00054254144,"about_ca_topic_score_gemma":0.0005375358,"teacher_disagreement_score":0.006796766,"about_ca_system_score_codex":0.0005744669,"about_ca_system_score_gemma":0.0011187531,"threshold_uncertainty_score":0.022737503},"labels":[],"label_agreement":null},{"id":"W2491068252","doi":"10.1109/tdsc.2016.2596719","title":"Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Bisimulation; Model checking; Theoretical computer science; Time complexity; Fault model; Algorithm","score_opus":0.021828073778649017,"score_gpt":0.2616526338298034,"score_spread":0.2398245600511544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491068252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039165277,0.00009800285,0.95674676,0.000060418177,0.000034394983,0.00007535718,0.00011398285,0.0009634939,0.002742473],"genre_scores_gemma":[0.69523543,0.00020348128,0.30194527,0.000044593184,0.000012536411,0.0002689956,0.0002736464,0.0001516062,0.0018644548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.00011847689,0.000045757002,0.00007801899,0.0001802595,0.000066666005],"domain_scores_gemma":[0.99931896,0.0003473913,0.000109497865,0.00013723465,0.00006799111,0.000018890423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565698,0.0006224426,0.00045752368,0.00034836988,0.00026680302,0.0006657083,0.00070604385,0.00048960245,0.0016822658],"category_scores_gemma":[0.0017035713,0.00031948858,0.0009275242,0.00034742148,0.00067279127,0.0006029389,0.0008208965,0.00058548746,0.00029152344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015133635,0.000053011147,0.00037364612,0.00024160568,0.000030954026,0.00024054464,0.00017967867,0.81872046,0.0421515,0.111403026,0.000301713,0.026152482],"study_design_scores_gemma":[0.00005249187,0.00008631119,0.00005937985,0.000020431573,0.000023829272,0.000041830095,0.000019690495,0.93968946,0.026507134,0.031187443,0.0023006776,0.000011339243],"about_ca_topic_score_codex":0.0013423389,"about_ca_topic_score_gemma":0.0017682196,"teacher_disagreement_score":0.0016822658,"about_ca_system_score_codex":0.0005477165,"about_ca_system_score_gemma":0.0011207509,"threshold_uncertainty_score":0.0056276917},"labels":[],"label_agreement":null},{"id":"W2527358790","doi":"10.1109/tdsc.2015.2451614","title":"CPV: Delay-Based Location Verification for the Internet","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; PlanetLab; Geolocation; Computer security; The Internet; Computer network; Adversary; Global Positioning System; Authentication (law); Mobile device; World Wide Web; Telecommunications","score_opus":0.029547940413459393,"score_gpt":0.2546429856409055,"score_spread":0.22509504522744608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527358790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03165296,0.00031863965,0.95373636,0.00026609807,0.00016344574,0.00030477613,0.00026508188,0.010773114,0.0025194874],"genre_scores_gemma":[0.7926725,0.00016874692,0.20380023,0.0001410463,0.00007190625,0.00019543592,0.0004435879,0.0003050633,0.002201473],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99437416,0.0010900589,0.00035065747,0.0008927867,0.0028281582,0.00046414265],"domain_scores_gemma":[0.9852524,0.0044682208,0.002019064,0.005724924,0.0021448135,0.00039061237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028966775,0.0008722878,0.0009224389,0.0016983157,0.0011450916,0.0019422781,0.0031832731,0.001298478,0.0030930366],"category_scores_gemma":[0.020930566,0.0005004842,0.0005552597,0.0009615756,0.0015355056,0.0040870155,0.004165004,0.0019237623,0.0011225551],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001944331,0.00034784066,0.014190167,0.00051417574,0.0001978739,0.00061424467,0.0005924137,0.1921306,0.0820783,0.08683804,0.014889448,0.6056626],"study_design_scores_gemma":[0.000091380454,0.00030640236,0.0009845493,0.000029109095,0.00003181348,0.0004069899,0.00009003385,0.92952293,0.04132613,0.019874783,0.007277686,0.000058209782],"about_ca_topic_score_codex":0.00334322,"about_ca_topic_score_gemma":0.0026671789,"teacher_disagreement_score":0.00334322,"about_ca_system_score_codex":0.0019581479,"about_ca_system_score_gemma":0.0027200915,"threshold_uncertainty_score":0.015319288},"labels":[],"label_agreement":null},{"id":"W2552931950","doi":"10.1109/tdsc.2016.2626288","title":"Exploiting Social Network to Enhance Human-to-Human Infection Analysis without Privacy Leakage","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Cloud computing; Social network (sociolinguistics); Overhead (engineering); Information privacy; Computer security; Internet privacy; Social media; Computer network; World Wide Web","score_opus":0.027837269036879244,"score_gpt":0.3138579377599896,"score_spread":0.2860206687231104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552931950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07501386,0.00043582125,0.92050296,0.0005011225,0.000044834436,0.00014331895,0.00029381292,0.0005716843,0.0024924965],"genre_scores_gemma":[0.9160015,0.00030919557,0.081905976,0.00011280264,0.00006138907,0.00008690227,0.00036471963,0.000027347829,0.0011301418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795747,0.00083190115,0.00009944667,0.0003557629,0.0005913631,0.00016397079],"domain_scores_gemma":[0.9964498,0.0016451466,0.0005903237,0.0008483597,0.00034801307,0.00011826792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064125,0.00078909635,0.0007052984,0.0016941733,0.00071358215,0.0012034058,0.00080177945,0.0007300193,0.0008863866],"category_scores_gemma":[0.0056669167,0.00027836836,0.0008599771,0.0013786587,0.0006963438,0.0033510225,0.0018069346,0.0008444291,0.00030819818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009847302,0.0006655454,0.0516279,0.00048730898,0.0006259923,0.001565336,0.0012766467,0.3531035,0.045481462,0.081990674,0.006818331,0.45537248],"study_design_scores_gemma":[0.000014211973,0.000085470165,0.002975478,0.00001424492,0.000058103666,0.0004093765,0.0001308016,0.96008044,0.0077948305,0.02603878,0.0023710658,0.000027204504],"about_ca_topic_score_codex":0.0017697563,"about_ca_topic_score_gemma":0.0017525669,"teacher_disagreement_score":0.0017697563,"about_ca_system_score_codex":0.0008155315,"about_ca_system_score_gemma":0.00079047517,"threshold_uncertainty_score":0.008495688},"labels":[],"label_agreement":null},{"id":"W2744402374","doi":"10.1109/tdsc.2019.2908907","title":"Comparative Analysis and Framework Evaluating Mimicry-Resistant and Invisible Web Authentication Schemes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mimicry; Computer science; Authentication (law); Password; Usability; Computer security; World Wide Web; Multi-factor authentication; Internet privacy; Human–computer interaction; Authentication protocol; Biology","score_opus":0.05214109476560733,"score_gpt":0.327001526575048,"score_spread":0.27486043180944064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744402374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312769,0.0059336685,0.32292202,0.00065918267,0.00013745237,0.0008139579,0.00023212636,0.00070243084,0.037322152],"genre_scores_gemma":[0.96715933,0.00068925595,0.030566618,0.000050480525,0.000038875743,0.00009618572,0.00008706869,0.00004449061,0.0012677333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97933483,0.011023696,0.001017185,0.0010176611,0.0065120705,0.0010945573],"domain_scores_gemma":[0.95056516,0.032555286,0.0037753324,0.008999446,0.0034378918,0.0006668371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009833778,0.0008268902,0.0011844316,0.0052574696,0.00096739794,0.0032277927,0.0016136304,0.0015788963,0.0026467445],"category_scores_gemma":[0.032939184,0.0002515415,0.00119723,0.0021816876,0.0028773288,0.004462216,0.002249512,0.0010858715,0.00043471318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033150574,0.0011313376,0.011969327,0.0016261606,0.00040022875,0.000608711,0.00080994866,0.24256703,0.06430506,0.47469392,0.0021728538,0.1964003],"study_design_scores_gemma":[0.00017100887,0.0046268557,0.007042824,0.00026725972,0.00035921225,0.0013210446,0.00087637274,0.8886966,0.035412744,0.052915413,0.008127892,0.0001827569],"about_ca_topic_score_codex":0.0006672375,"about_ca_topic_score_gemma":0.0005139945,"teacher_disagreement_score":0.009833778,"about_ca_system_score_codex":0.0026201399,"about_ca_system_score_gemma":0.00081300514,"threshold_uncertainty_score":0.052006662},"labels":[],"label_agreement":null},{"id":"W2783908022","doi":"10.1109/tdsc.2018.2791432","title":"Providing Task Allocation and Secure Deduplication for Mobile Crowdsensing via Fog Computing","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Data deduplication; Computer science; Overhead (engineering); Task (project management); Hash function; Mobile computing; Mobile device; Computer network; Crowdsensing; Cryptography; Distributed computing; Computer security; World Wide Web","score_opus":0.018601413574877452,"score_gpt":0.2717896858156896,"score_spread":0.25318827224081214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783908022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0562978,0.0008783745,0.9375577,0.0004745498,0.00023630647,0.00024926302,0.00017926403,0.0008144697,0.0033122252],"genre_scores_gemma":[0.91224927,0.00039560857,0.08433688,0.00023878312,0.00009441764,0.00016655179,0.00015874548,0.000051118,0.0023087289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894446,0.00020285253,0.00009352924,0.00023647366,0.00032725334,0.00019553864],"domain_scores_gemma":[0.99786526,0.0004948301,0.00019858262,0.00095370767,0.00036049762,0.00012712694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012376626,0.00074751634,0.0008592465,0.00063519675,0.0015476804,0.0013856693,0.0014371468,0.0009429663,0.0009353769],"category_scores_gemma":[0.0040490907,0.000320001,0.00054254266,0.00085325015,0.00092707225,0.0021484564,0.0032228841,0.00088175276,0.0003824782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017497021,0.0004963674,0.005781089,0.0008042103,0.00027313037,0.0024511034,0.0028131227,0.27651355,0.11566412,0.1369943,0.020647941,0.43581143],"study_design_scores_gemma":[0.00009821315,0.00023144222,0.0009596107,0.00005404019,0.000064014224,0.0008309412,0.0005007493,0.8950841,0.032543506,0.054081943,0.015457768,0.00009369634],"about_ca_topic_score_codex":0.0014287864,"about_ca_topic_score_gemma":0.0019808307,"teacher_disagreement_score":0.0015476804,"about_ca_system_score_codex":0.0007357558,"about_ca_system_score_gemma":0.0014755841,"threshold_uncertainty_score":0.0065454245},"labels":[],"label_agreement":null},{"id":"W2790832484","doi":"10.1109/tdsc.2018.2804394","title":"Anonymity Services Tor, I2P, JonDonym: Classifying in the Dark (Web)","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Anonymity; Computer science; Traffic classification; Network packet; Encryption; Data mining; Feature (linguistics); Computer network; Computer security","score_opus":0.014349558234002236,"score_gpt":0.24609630149119333,"score_spread":0.23174674325719108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790832484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87191284,0.0011222454,0.070399016,0.0007153015,0.00060491747,0.00042512824,0.019664109,0.015997007,0.019159341],"genre_scores_gemma":[0.95305216,0.00034271527,0.021977307,0.00012758987,0.00010651955,0.00014487971,0.018728133,0.00022727702,0.0052933428],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990773,0.00014601399,0.000060829967,0.00020819875,0.00032920047,0.00017839475],"domain_scores_gemma":[0.9987734,0.00031093552,0.00017156922,0.00029739394,0.00031395516,0.00013265961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008752479,0.0011595158,0.0006299636,0.0020847577,0.00077246496,0.0014398189,0.00062575034,0.0007793847,0.0016480874],"category_scores_gemma":[0.002887595,0.000115650386,0.0005656384,0.0012112787,0.0003304125,0.0014109462,0.0010774005,0.0007195601,0.001974025],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003602879,0.0011027195,0.18457267,0.0011928233,0.00036756773,0.001488981,0.0009393801,0.07190211,0.021471944,0.008937346,0.092158794,0.61226285],"study_design_scores_gemma":[0.00006693582,0.0005863532,0.076256245,0.00016651614,0.00015430037,0.0021490946,0.001549354,0.791017,0.06032938,0.011011142,0.0565384,0.00017527865],"about_ca_topic_score_codex":0.005833401,"about_ca_topic_score_gemma":0.0049223215,"teacher_disagreement_score":0.005833401,"about_ca_system_score_codex":0.000771859,"about_ca_system_score_gemma":0.0008392272,"threshold_uncertainty_score":0.011598885},"labels":[],"label_agreement":null},{"id":"W2808669017","doi":"10.1109/tdsc.2018.2846258","title":"Physical Layer based Message Authentication with Secure Channel Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; China Postdoctoral Science Foundation","keywords":"Computer science; Authentication (law); Message authentication code; Authentication protocol; Computer network; Physical layer; Data Authentication Algorithm; PHY; Hash function; Channel (broadcasting); Theoretical computer science; Computer security; Cryptography; Wireless","score_opus":0.013347861099777187,"score_gpt":0.2423302788624251,"score_spread":0.22898241776264794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808669017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024151074,0.00037156907,0.9690618,0.00034319048,0.0000863924,0.00013808429,0.00005500964,0.00037892527,0.0054138983],"genre_scores_gemma":[0.8615959,0.0005850475,0.1324197,0.00018621475,0.00011761937,0.00025066562,0.000084805026,0.000042010128,0.004718018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762505,0.0006417054,0.0001228405,0.0003448309,0.00089633785,0.0003692425],"domain_scores_gemma":[0.99558336,0.0020708032,0.0006132244,0.0009351247,0.0006937589,0.00010382582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015974675,0.00074717304,0.0006240981,0.0008910686,0.0008900096,0.0014319835,0.0011151524,0.0010983454,0.0024450028],"category_scores_gemma":[0.0050592325,0.00028281898,0.00050604664,0.0009475315,0.0024003352,0.0035625326,0.002353356,0.0013899528,0.0008806632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054802006,0.000100047495,0.00097065483,0.00036610043,0.000058580117,0.00041870648,0.00042916634,0.18508917,0.033795066,0.717164,0.001712843,0.05934768],"study_design_scores_gemma":[0.00006348364,0.00025135197,0.00016914801,0.00004835125,0.000046501864,0.0002819643,0.000059450475,0.89693713,0.02533568,0.06949801,0.0072558704,0.000053123007],"about_ca_topic_score_codex":0.0010269216,"about_ca_topic_score_gemma":0.0007385587,"teacher_disagreement_score":0.0024450028,"about_ca_system_score_codex":0.0010356407,"about_ca_system_score_gemma":0.0019169918,"threshold_uncertainty_score":0.008448303},"labels":[],"label_agreement":null},{"id":"W2899827171","doi":"10.1109/tdsc.2018.2813891","title":"Guest Editors’ Introduction: Special Issue on Data-Driven Dependability and Security","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dependability; Computer science; Publication; Data security; Computer security; Data integrity; Data science; Software engineering; Encryption","score_opus":0.01463421890371897,"score_gpt":0.25863456485067887,"score_spread":0.2440003459469599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899827171","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014005603,0.011761412,0.0009475418,0.018727727,0.9644446,0.00002540763,0.00017089308,0.00014424798,0.0036380591],"genre_scores_gemma":[0.0010381053,0.008976577,0.000452718,0.0058711185,0.9708194,0.000037014805,0.00022598372,0.00016563054,0.012413458],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963033,0.00036120927,0.00046054882,0.000920857,0.0015668495,0.00038728435],"domain_scores_gemma":[0.9805878,0.0046677315,0.0013539512,0.00094427686,0.009051723,0.0033944563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044543743,0.0028110913,0.002647296,0.00399258,0.0017975372,0.008005459,0.0024173555,0.0048487103,0.03700458],"category_scores_gemma":[0.014246828,0.0009204135,0.00191837,0.002114553,0.0011805468,0.0049148602,0.0026215818,0.008618122,0.021738907],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039053593,0.000025179259,0.00009232862,0.00027201616,0.000018727882,0.000065688444,0.00001301236,0.00010045727,0.00018449292,0.0008549921,0.97871405,0.019619899],"study_design_scores_gemma":[0.000026735139,0.00006375095,0.00041921024,0.0003280749,0.000033432603,0.00026836593,0.000027325095,0.000387042,0.00026969388,0.0023454519,0.99580485,0.000026162486],"about_ca_topic_score_codex":0.00052518374,"about_ca_topic_score_gemma":0.0011759575,"teacher_disagreement_score":0.03700458,"about_ca_system_score_codex":0.0015951473,"about_ca_system_score_gemma":0.0019832547,"threshold_uncertainty_score":0.12379271},"labels":[],"label_agreement":null},{"id":"W2906048991","doi":"10.1109/tdsc.2018.2889086","title":"<i>Network Attack Surface</i>: Lifting the Concept of Attack Surface to the Network Level for Evaluating Networks’ Resilience Against Zero-Day Attacks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; National Science Foundation","keywords":"Attack surface; Computer science; Resilience (materials science); Abstraction; Network security; Metric (unit); Software; Computer security; Surface (topology); Lift (data mining); Data mining; Mathematics; Engineering","score_opus":0.05072490151960609,"score_gpt":0.3054348580816068,"score_spread":0.25470995656200074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906048991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025999097,0.0003205195,0.9698861,0.00020088322,0.00005622264,0.00007960994,0.00018292753,0.00073135085,0.0025432662],"genre_scores_gemma":[0.82312226,0.00049786974,0.1745122,0.00008729802,0.000065335014,0.00015038041,0.0004590901,0.00015631289,0.0009492178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821544,0.00047666713,0.0001208933,0.00028372143,0.0007162052,0.00018707757],"domain_scores_gemma":[0.99425817,0.0021380743,0.0014054466,0.0010218349,0.00094751955,0.00022895198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017905479,0.0015497517,0.0008472287,0.00225957,0.00042876866,0.0020788289,0.0012165131,0.0009767044,0.0013887811],"category_scores_gemma":[0.008933977,0.00026833723,0.00076052855,0.0017585199,0.0017752909,0.0038478095,0.0017081698,0.0012864143,0.00033883128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001836212,0.00008352355,0.009121401,0.0002840725,0.00013663748,0.0001097915,0.00016036267,0.83086926,0.01714252,0.0512817,0.0032824096,0.087344706],"study_design_scores_gemma":[0.0000044043754,0.00012148174,0.0017142523,0.000027952576,0.00002420363,0.00010951759,0.000067492554,0.9726681,0.0073339897,0.016370868,0.0015254992,0.00003220711],"about_ca_topic_score_codex":0.0025426925,"about_ca_topic_score_gemma":0.0016438694,"teacher_disagreement_score":0.0025426925,"about_ca_system_score_codex":0.0015735833,"about_ca_system_score_gemma":0.0008991311,"threshold_uncertainty_score":0.0114171505},"labels":[],"label_agreement":null},{"id":"W2938767118","doi":"10.1109/tdsc.2018.2861403","title":"Disclose More and Risk Less: Privacy Preserving Online Social Network Data Sharing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Institute of Chemistry, Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Social network (sociolinguistics); Heuristics; Private information retrieval; Permission; Information privacy; Knapsack problem; Inference; Computer security; Social media; Internet privacy; World Wide Web; Artificial intelligence; Algorithm","score_opus":0.07697807668855826,"score_gpt":0.3012775501062641,"score_spread":0.22429947341770584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938767118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061916597,0.0005711683,0.93361425,0.0007844967,0.00004716909,0.00018557697,0.0002468419,0.00048287376,0.0021510292],"genre_scores_gemma":[0.85862577,0.00032981002,0.13858883,0.00025065485,0.00006392653,0.00014360498,0.0003133631,0.00006232597,0.0016217061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99237627,0.0032401008,0.00043062784,0.0012109833,0.0021684915,0.00057364913],"domain_scores_gemma":[0.9917754,0.0029785933,0.0010367249,0.003157243,0.0007112976,0.00034078443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051488504,0.0009741047,0.0018390407,0.0011161068,0.0016548038,0.0024204946,0.003161418,0.001514544,0.001158936],"category_scores_gemma":[0.011139465,0.0005302856,0.0012786924,0.0025742305,0.0014616798,0.00783843,0.0047418475,0.0016789889,0.00036465385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083747675,0.0007143079,0.005448412,0.00032619,0.00032528868,0.0006316415,0.0013932313,0.5604863,0.011022859,0.082140096,0.0054217773,0.33125246],"study_design_scores_gemma":[0.000039289193,0.00009390813,0.0005040324,0.000014865894,0.000041591476,0.00032919442,0.00019838646,0.9362173,0.004781479,0.055256166,0.0024841886,0.00003958458],"about_ca_topic_score_codex":0.0020556385,"about_ca_topic_score_gemma":0.0017135027,"teacher_disagreement_score":0.0051488504,"about_ca_system_score_codex":0.0012277196,"about_ca_system_score_gemma":0.0021178396,"threshold_uncertainty_score":0.027230024},"labels":[],"label_agreement":null},{"id":"W2953030092","doi":"10.1109/tdsc.2019.2922958","title":"Efficient and Secure Decision Tree Classification for Cloud-Assisted Online Diagnosis Services","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Decision tree; Outsourcing; Decision tree learning; Classifier (UML); Data mining; Server; Computer security; Machine learning; Artificial intelligence; Computer network","score_opus":0.025495654813636172,"score_gpt":0.2747887559841842,"score_spread":0.249293101170548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953030092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060737133,0.0005594025,0.9320558,0.0010300577,0.00015098618,0.0003479486,0.00041885124,0.002156855,0.00254297],"genre_scores_gemma":[0.8142841,0.0002946712,0.18169084,0.00020424898,0.00010027151,0.00018345937,0.00080700224,0.000059087342,0.002376389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694353,0.0006865683,0.00032226442,0.00037864628,0.001266463,0.0004025041],"domain_scores_gemma":[0.9958103,0.0012447704,0.00052829203,0.0014758125,0.0007452905,0.00019566361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017973883,0.0004375882,0.0006061612,0.00080519996,0.0011377035,0.0014106131,0.0013165647,0.00091129815,0.0028792706],"category_scores_gemma":[0.005828922,0.00022847619,0.0006239601,0.0010414831,0.0005806673,0.0024709713,0.0018059778,0.0012404603,0.0014995472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024760596,0.0005883311,0.008555751,0.00025502118,0.00015332011,0.0011064102,0.00057349785,0.0898994,0.04835466,0.053427726,0.019742709,0.7748672],"study_design_scores_gemma":[0.00009264036,0.00018221895,0.001936765,0.000037660502,0.000040468254,0.0006648196,0.00017119684,0.92378,0.030436665,0.03390763,0.00870736,0.000042620275],"about_ca_topic_score_codex":0.0018672487,"about_ca_topic_score_gemma":0.0015252045,"teacher_disagreement_score":0.0028792706,"about_ca_system_score_codex":0.001323809,"about_ca_system_score_gemma":0.0018615616,"threshold_uncertainty_score":0.009632111},"labels":[],"label_agreement":null},{"id":"W2981962609","doi":"10.1109/tdsc.2019.2949410","title":"Cree: a Performant Tool for Safety Analysis of Administrative Temporal Role-Based Access Control (ATRBAC) Policies","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Control (management); Access control; Computer security; Artificial intelligence","score_opus":0.02847004653088581,"score_gpt":0.3328800217763086,"score_spread":0.3044099752454228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981962609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016854187,0.0000959695,0.8872201,0.00022066303,0.0000824478,0.00027904398,0.0009428887,0.106942214,0.0025313005],"genre_scores_gemma":[0.08833377,0.00047904102,0.86192495,0.0010206772,0.00017421725,0.0010670826,0.00600842,0.028775563,0.01221632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942703,0.0012488484,0.0006776636,0.0011295287,0.0021566818,0.00051695295],"domain_scores_gemma":[0.9839293,0.010531539,0.0011580457,0.0025326037,0.0015130759,0.00033541324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008069454,0.0025270202,0.0015628441,0.003150855,0.0008788343,0.0037061488,0.004344467,0.0027065948,0.01863272],"category_scores_gemma":[0.02487722,0.0018678514,0.004366211,0.0009550378,0.0026157273,0.0060786167,0.0042947815,0.004165916,0.0071391175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017429797,0.0010207943,0.008674529,0.0034602932,0.0008639989,0.0030892785,0.0026616163,0.103127375,0.041938476,0.25324863,0.16044728,0.4197246],"study_design_scores_gemma":[0.00055732374,0.00034638515,0.001554656,0.0005599682,0.0002430955,0.0018215855,0.0003162072,0.6004309,0.05917807,0.08834405,0.24628587,0.00036190895],"about_ca_topic_score_codex":0.00376859,"about_ca_topic_score_gemma":0.0025766606,"teacher_disagreement_score":0.01863272,"about_ca_system_score_codex":0.0011873659,"about_ca_system_score_gemma":0.0029093332,"threshold_uncertainty_score":0.06233263},"labels":[],"label_agreement":null},{"id":"W2995900199","doi":"10.1109/tdsc.2019.2960336","title":"VTDP: Privately Sanitizing Fine-grained Vehicle Trajectory Data with Boosted Utility","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Science Foundation","keywords":"Trajectory; Computer science","score_opus":0.03562542510619456,"score_gpt":0.2571573523430928,"score_spread":0.2215319272368982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995900199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028330449,0.00021383674,0.9685298,0.00050583377,0.00006410308,0.00013847466,0.0002856961,0.0008279103,0.0011039847],"genre_scores_gemma":[0.84766454,0.000318367,0.14761886,0.0003750298,0.000117436524,0.00021749081,0.00093916024,0.00011793922,0.0026312363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579775,0.0011858189,0.0003029682,0.00081842695,0.0013951472,0.00049996574],"domain_scores_gemma":[0.99014866,0.003646663,0.0008193083,0.0043760287,0.0007106973,0.00029868746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003339831,0.0007274793,0.0012820746,0.00073624466,0.0008561987,0.0016124186,0.0026701714,0.0013094429,0.0011939541],"category_scores_gemma":[0.01424269,0.00050886784,0.001216527,0.0011853979,0.0019328034,0.004243205,0.005850357,0.0027555658,0.00045591657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017502633,0.00031564946,0.006793365,0.00035019938,0.0002889844,0.000858951,0.0007234251,0.4895078,0.041510455,0.20248191,0.010918474,0.24450052],"study_design_scores_gemma":[0.000064501124,0.00015505143,0.00049753534,0.000016862283,0.000031344956,0.00026328815,0.000066635606,0.9180758,0.013520737,0.06390491,0.0033759994,0.000027405682],"about_ca_topic_score_codex":0.0014402199,"about_ca_topic_score_gemma":0.0011549686,"teacher_disagreement_score":0.003339831,"about_ca_system_score_codex":0.0013749368,"about_ca_system_score_gemma":0.0023326878,"threshold_uncertainty_score":0.017662883},"labels":[],"label_agreement":null},{"id":"W3011995057","doi":"10.1109/tdsc.2020.2980255","title":"LVBS: Lightweight Vehicular Blockchain for Secure Data Sharing in Disaster Rescue","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Higher Education Discipline Innovation Project; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Data sharing; Computer security; Schedule; Tracing; Computer network","score_opus":0.03712856388906087,"score_gpt":0.26534051339449843,"score_spread":0.22821194950543755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011995057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07301462,0.00037515373,0.919992,0.0004449749,0.00009553729,0.00021161458,0.00016582136,0.0008189771,0.0048812497],"genre_scores_gemma":[0.9699821,0.00019574075,0.027202066,0.00006345749,0.00001988857,0.00012823484,0.00013175835,0.000025562991,0.0022511552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913543,0.0002724939,0.00005724728,0.00015087526,0.00023345856,0.00015050825],"domain_scores_gemma":[0.99897313,0.00034511354,0.00013290321,0.00019892752,0.00019665214,0.00015328551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011080023,0.00042348393,0.00062482775,0.00038634267,0.00074024143,0.0008272274,0.001144239,0.000632888,0.0029811205],"category_scores_gemma":[0.0025262404,0.00021918192,0.0003112938,0.0006023458,0.0008064025,0.0015219388,0.001960186,0.00081143784,0.0004660624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043414882,0.00013358024,0.0021585706,0.00020052309,0.000044197364,0.00048790005,0.00033420467,0.81535983,0.013866105,0.06578035,0.0027233025,0.09847735],"study_design_scores_gemma":[0.00003965616,0.000080517646,0.0001434561,0.000012863584,0.0000060763264,0.000047838883,0.000033825156,0.97734773,0.0019288138,0.018136814,0.0022120634,0.000010342906],"about_ca_topic_score_codex":0.004555668,"about_ca_topic_score_gemma":0.0046807225,"teacher_disagreement_score":0.004555668,"about_ca_system_score_codex":0.0008199895,"about_ca_system_score_gemma":0.0018396203,"threshold_uncertainty_score":0.00997287},"labels":[],"label_agreement":null},{"id":"W3012047389","doi":"10.1109/tdsc.2020.2980273","title":"Improving the Accuracy of IR-Level Fault Injection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fault injection; Benchmark (surveying); Compiler; Software; Abstraction; Optimizing compiler; Crash; Range (aeronautics); Fault (geology); Resilience (materials science); Computer engineering; Assembly language; Embedded system; Programming language","score_opus":0.014512481470188004,"score_gpt":0.21689172212976482,"score_spread":0.20237924065957683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012047389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34814975,0.0006437498,0.5975482,0.00043683837,0.0002734671,0.00014758515,0.00094391557,0.043313712,0.00854278],"genre_scores_gemma":[0.8915632,0.000073741234,0.10503535,0.00020687355,0.00002734177,0.00007892379,0.0009261382,0.00070586643,0.001382641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724954,0.00029990083,0.00019082754,0.0006386545,0.0013290674,0.0002920309],"domain_scores_gemma":[0.98714894,0.0051983353,0.0016092124,0.0032999346,0.0025644377,0.00017918443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021640705,0.0009721581,0.00080766325,0.0013643171,0.0003951474,0.0011278588,0.0017432501,0.0009146978,0.00181335],"category_scores_gemma":[0.022839487,0.00035561112,0.0005678318,0.0007857142,0.00065692543,0.0015519114,0.00081518345,0.0019806281,0.0009285768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001093519,0.0006637881,0.05608142,0.00047392925,0.00018120265,0.00022872219,0.00032278863,0.4192751,0.12508018,0.005623207,0.005997241,0.38497886],"study_design_scores_gemma":[0.000018219656,0.00027496793,0.0076071094,0.000031562693,0.000027992239,0.00008692287,0.000043088537,0.854232,0.13439694,0.0015914597,0.0016467634,0.000042985193],"about_ca_topic_score_codex":0.003958931,"about_ca_topic_score_gemma":0.0033224232,"teacher_disagreement_score":0.003958931,"about_ca_system_score_codex":0.0008269083,"about_ca_system_score_gemma":0.0009484622,"threshold_uncertainty_score":0.011444807},"labels":[],"label_agreement":null},{"id":"W3016293736","doi":"10.1109/tdsc.2020.2986751","title":"Self-Stabilizing Secure Computation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Adversary; Cryptography; Protocol (science); Computation; Adversarial system; Compromise; Cryptographic primitive; Cryptographic protocol; Distributed computing; State (computer science); Computer security; Secure multi-party computation; Algorithm; Artificial intelligence","score_opus":0.017021996208250272,"score_gpt":0.23458530626721635,"score_spread":0.2175633100589661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016293736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026413381,0.0001513263,0.96105796,0.00036807536,0.00008842035,0.00015189075,0.000058284873,0.0010442879,0.010666329],"genre_scores_gemma":[0.83272666,0.00030009833,0.15500297,0.0002531037,0.00012547716,0.00038756247,0.00014063153,0.00020194682,0.0108614955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793065,0.00037667248,0.00016712763,0.00041988544,0.000862624,0.00024301928],"domain_scores_gemma":[0.9969896,0.00076308066,0.0003281994,0.0013388256,0.00046055324,0.000119739634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995232,0.0004759085,0.00055296835,0.00052902166,0.0008815797,0.0018513624,0.0010161985,0.00084854884,0.0026348825],"category_scores_gemma":[0.004163835,0.0003132041,0.0006762994,0.00046093794,0.0027323205,0.002519597,0.0025330829,0.0014660765,0.00087617576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022554386,0.000086505526,0.00078265613,0.00019382815,0.000053183772,0.00025572485,0.0004523247,0.07100612,0.031327248,0.8504842,0.0024947424,0.04263799],"study_design_scores_gemma":[0.00007764891,0.00022207494,0.00024376488,0.00006319859,0.000056740173,0.00030169415,0.00007711042,0.4999068,0.042193655,0.43397003,0.022843525,0.000043786316],"about_ca_topic_score_codex":0.00031886873,"about_ca_topic_score_gemma":0.00036334858,"teacher_disagreement_score":0.0026348825,"about_ca_system_score_codex":0.0008891332,"about_ca_system_score_gemma":0.0013690256,"threshold_uncertainty_score":0.008814573},"labels":[],"label_agreement":null},{"id":"W3016918724","doi":"10.1109/tdsc.2020.2987793","title":"Achieving Efficient Secure Deduplication With User-Defined Access Control in Cloud","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Data deduplication; Computer science; Cloud computing; Cloud storage; Access control; Encryption; Computer security; Computer network; Service provider; Security analysis; Database; Service (business); Operating system","score_opus":0.01824822054756901,"score_gpt":0.24635451258394947,"score_spread":0.22810629203638047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016918724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114510864,0.002061913,0.87865925,0.0005735339,0.00019986185,0.00032513286,0.00024700083,0.0007782888,0.0026442066],"genre_scores_gemma":[0.9262331,0.0006919697,0.07098154,0.00016756835,0.00010360158,0.0001031051,0.00017833918,0.000035559795,0.0015053276],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99681973,0.0006334343,0.0004103038,0.0005094231,0.0012202036,0.00040687362],"domain_scores_gemma":[0.99346983,0.0017101588,0.00070745836,0.0028212161,0.0010879205,0.0002034063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026123296,0.00064374757,0.001043726,0.0007374177,0.001251849,0.0017509809,0.0014928849,0.0008112372,0.0007294881],"category_scores_gemma":[0.005516861,0.0003988873,0.00063473464,0.0011238873,0.0011441621,0.0034470798,0.0026248156,0.000981523,0.00031721016],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022794262,0.000679209,0.006179134,0.0012998709,0.00041265297,0.0028345403,0.002220603,0.19306023,0.23016426,0.20949614,0.011567782,0.33980608],"study_design_scores_gemma":[0.00023708447,0.0005730268,0.0011192474,0.00009296926,0.00013584034,0.002479276,0.0005082786,0.766956,0.1583918,0.056105215,0.013224099,0.00017718408],"about_ca_topic_score_codex":0.0007064032,"about_ca_topic_score_gemma":0.00077895663,"teacher_disagreement_score":0.0026123296,"about_ca_system_score_codex":0.0006754704,"about_ca_system_score_gemma":0.0018520039,"threshold_uncertainty_score":0.013815463},"labels":[],"label_agreement":null},{"id":"W3037789107","doi":"10.1109/tdsc.2020.3004442","title":"Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Nearest neighbor search; Data mining; Set (abstract data type); Similarity (geometry); Tree (set theory); Information privacy; Server; Theoretical computer science; Mathematics; Computer security; Artificial intelligence; Image (mathematics); Computer network","score_opus":0.05970768965338365,"score_gpt":0.2883740473154003,"score_spread":0.22866635766201665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037789107","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102827005,0.00073690177,0.8913261,0.00034364776,0.0000606155,0.00017777937,0.00044685398,0.00056675175,0.0035142126],"genre_scores_gemma":[0.81835896,0.00057368836,0.1777987,0.00013928865,0.000059382575,0.00012105682,0.0006342495,0.00003090288,0.0022838253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710554,0.00045614797,0.0003545471,0.00037523123,0.0013754194,0.000333192],"domain_scores_gemma":[0.9974511,0.0006465076,0.0003713871,0.0010669415,0.0003710676,0.00009297167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010411509,0.0003787348,0.0012507698,0.0010062908,0.0007907611,0.0012210667,0.0012542546,0.0008187559,0.0011105832],"category_scores_gemma":[0.003955088,0.00025354527,0.0007222521,0.0027557074,0.0006430323,0.0043854793,0.0023585686,0.00085986854,0.00053212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017982293,0.0006781578,0.0060304203,0.0007492068,0.00028436058,0.0011043346,0.0009332774,0.152307,0.1468862,0.17191517,0.009871519,0.50744206],"study_design_scores_gemma":[0.00016379505,0.00046861498,0.0014196215,0.00003746559,0.00008190154,0.0023636757,0.00030694823,0.8394365,0.08241216,0.06456394,0.0086658895,0.00007953158],"about_ca_topic_score_codex":0.00091957295,"about_ca_topic_score_gemma":0.00081991614,"teacher_disagreement_score":0.0012542546,"about_ca_system_score_codex":0.00071596756,"about_ca_system_score_gemma":0.0017283575,"threshold_uncertainty_score":0.005506158},"labels":[],"label_agreement":null},{"id":"W3040569666","doi":"10.1109/tdsc.2021.3114310","title":"The Hermes BFT for Blockchains","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Computer science; Computer network; Node (physics); Bandwidth (computing); Byzantine architecture; Byzantine fault tolerance; Distributed computing; Telecommunications; Fault tolerance; Geography; Engineering","score_opus":0.016019723293701164,"score_gpt":0.25388719399261844,"score_spread":0.23786747069891728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040569666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04782367,0.00056223274,0.91507643,0.0012263217,0.00030005455,0.0004919493,0.0016328073,0.010152505,0.02273399],"genre_scores_gemma":[0.587184,0.00049111445,0.38751584,0.0002703886,0.00012690746,0.00079462456,0.0022037043,0.000790788,0.020622691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998298,0.0005083088,0.00012140567,0.0002297902,0.00064311794,0.00019941683],"domain_scores_gemma":[0.997974,0.0005860623,0.0001303949,0.0008179534,0.0003629383,0.00012861483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022194542,0.0005529863,0.0006369401,0.0006155939,0.0011912992,0.0013253689,0.0011540239,0.0013575623,0.009889216],"category_scores_gemma":[0.006367693,0.00043336683,0.00052521576,0.00088619953,0.0009556317,0.0023476803,0.0018211493,0.0016005633,0.0024368684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008642129,0.00021666562,0.0011148727,0.00044542138,0.000062472194,0.00037741236,0.0003265215,0.45996338,0.022917181,0.2775335,0.025563035,0.21061534],"study_design_scores_gemma":[0.00017442294,0.00013461211,0.00024483225,0.000048648402,0.000014155629,0.000112929316,0.00004266285,0.8119757,0.009397087,0.14526221,0.03255678,0.000035941313],"about_ca_topic_score_codex":0.006687388,"about_ca_topic_score_gemma":0.006071439,"teacher_disagreement_score":0.009889216,"about_ca_system_score_codex":0.0013951906,"about_ca_system_score_gemma":0.0027090826,"threshold_uncertainty_score":0.033082724},"labels":[],"label_agreement":null},{"id":"W3088247060","doi":"10.1109/tdsc.2020.3026631","title":"Achieve Efficient and Privacy-Preserving Disease Risk Assessment Over Multi-Outsourced Vertical Datasets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Disease; Internet privacy; Artificial intelligence; Medicine","score_opus":0.02607201367916386,"score_gpt":0.28149764901221347,"score_spread":0.2554256353330496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088247060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07152871,0.0015453672,0.90729713,0.002958944,0.00017756542,0.00049361895,0.0070786285,0.004536162,0.004383968],"genre_scores_gemma":[0.75518054,0.00086720765,0.22746943,0.000916493,0.00025519053,0.00028709415,0.010245204,0.00021075047,0.0045680185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229527,0.0012681285,0.00074952346,0.0019368099,0.0028358218,0.00091449433],"domain_scores_gemma":[0.991323,0.0017611705,0.00077476865,0.004631209,0.001169211,0.00034064555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052804397,0.0014175511,0.0022667635,0.001941207,0.0016624588,0.004207367,0.0034542424,0.0013495062,0.002674588],"category_scores_gemma":[0.011631628,0.00080244744,0.0022701456,0.004098944,0.0010520087,0.008220458,0.008358264,0.0018326559,0.0010956048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027821672,0.0007191632,0.03443236,0.00073903427,0.000808789,0.0010803869,0.001252941,0.1649851,0.026007254,0.08132138,0.043032046,0.6428394],"study_design_scores_gemma":[0.00012713336,0.00015086132,0.0044898763,0.000041637602,0.00016662,0.000703458,0.0005256639,0.8527919,0.015516599,0.115441054,0.0099729225,0.00007219887],"about_ca_topic_score_codex":0.012976877,"about_ca_topic_score_gemma":0.010434988,"teacher_disagreement_score":0.012976877,"about_ca_system_score_codex":0.0020350658,"about_ca_system_score_gemma":0.005174156,"threshold_uncertainty_score":0.027925968},"labels":[],"label_agreement":null},{"id":"W3089626165","doi":"10.1109/tdsc.2020.3027579","title":"Enabling Efficient, Secure and Privacy-Preserving Mobile Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Cloud computing; Encryption; Cloud storage; Overhead (engineering); Computer network; Verifiable secret sharing; Scheme (mathematics); Mobile device; Distributed computing; Computer security; Operating system","score_opus":0.0158812799605622,"score_gpt":0.23286554689242162,"score_spread":0.2169842669318594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089626165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16159573,0.0031227877,0.82105875,0.0009616992,0.00022789986,0.00038069926,0.00040230528,0.0020437161,0.010206386],"genre_scores_gemma":[0.9428755,0.00075892766,0.05315422,0.000107259526,0.00008433731,0.000074024494,0.00016598887,0.000031648276,0.0027482172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.000085304986,0.00005536885,0.00008693946,0.00034806906,0.00020460285],"domain_scores_gemma":[0.9992404,0.00009934705,0.00010059485,0.0003730003,0.00013970221,0.00004697466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375682,0.00037153135,0.0005213492,0.00051153963,0.0009643321,0.001102243,0.0011146436,0.0006542366,0.0014519092],"category_scores_gemma":[0.0010303918,0.00021928204,0.0003998476,0.0010322719,0.00073712575,0.003043759,0.0026954378,0.0006950307,0.00061334035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014475817,0.0001972193,0.0044742343,0.0007845294,0.00013803662,0.0019486838,0.0007884372,0.06063518,0.35121334,0.24877633,0.013140438,0.31645605],"study_design_scores_gemma":[0.00013753856,0.00043583167,0.0018526529,0.000095893294,0.00011859867,0.0028523328,0.0005143493,0.5999958,0.28799903,0.049276277,0.056584902,0.00013694081],"about_ca_topic_score_codex":0.0012448599,"about_ca_topic_score_gemma":0.001143161,"teacher_disagreement_score":0.0014519092,"about_ca_system_score_codex":0.00075390976,"about_ca_system_score_gemma":0.0012849983,"threshold_uncertainty_score":0.0054700375},"labels":[],"label_agreement":null},{"id":"W3109218172","doi":"10.1109/tdsc.2020.3036641","title":"Identity-Based Provable Data Possession From RSA Assumption for Secure Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Cloud computing; Cloud storage; Data integrity; Outsourcing; Computer security; Theoretical computer science; Database; Encryption; Operating system","score_opus":0.060196595810714855,"score_gpt":0.2966887080416012,"score_spread":0.23649211223088634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109218172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028837752,0.0016351196,0.9454503,0.0019057436,0.0002509604,0.00032598202,0.00067427946,0.0010435167,0.01987623],"genre_scores_gemma":[0.866065,0.0019347892,0.1235875,0.00054224406,0.00040247975,0.00044657945,0.0006250772,0.00019936566,0.006196973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994909,0.0011692783,0.00037934817,0.00079306826,0.0020961948,0.0006531785],"domain_scores_gemma":[0.9950873,0.0016958511,0.0004680542,0.0021702247,0.00043763797,0.00014091717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388898,0.0006357787,0.0011665745,0.0006077547,0.001452822,0.0030177946,0.0018588027,0.0013365657,0.008281551],"category_scores_gemma":[0.008357667,0.00046234345,0.0012417802,0.0013119457,0.0020642143,0.007827997,0.004153821,0.0031560368,0.0027806647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073903333,0.00018392995,0.0010475821,0.0007921781,0.000082378596,0.0010667992,0.0007304777,0.05593862,0.03289246,0.8196891,0.009617029,0.07722039],"study_design_scores_gemma":[0.00015706122,0.00026759022,0.000503229,0.00019674825,0.00007115936,0.0016355966,0.0002998638,0.4879806,0.03627901,0.44391716,0.028548049,0.00014385668],"about_ca_topic_score_codex":0.0006728772,"about_ca_topic_score_gemma":0.000385396,"teacher_disagreement_score":0.008281551,"about_ca_system_score_codex":0.001494559,"about_ca_system_score_gemma":0.002649965,"threshold_uncertainty_score":0.027704597},"labels":[],"label_agreement":null},{"id":"W3132125973","doi":"10.1109/tdsc.2021.3061611","title":"Efficient and Privacy-Preserving Similarity Range Query Over Encrypted Time Series Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Range query (database); Data mining; Series (stratigraphy); Similarity (geometry); Time series; Cryptography; Information privacy; Range (aeronautics); Query optimization; Information retrieval; Web search query; Sargable; Computer security; Artificial intelligence; Search engine; Machine learning","score_opus":0.02054940420219381,"score_gpt":0.24993961557490932,"score_spread":0.2293902113727155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132125973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043444246,0.0006643094,0.9506357,0.0005399126,0.000100135054,0.00019073376,0.000776204,0.00080426066,0.002844639],"genre_scores_gemma":[0.7940673,0.0010141092,0.19793904,0.00047796968,0.00019148328,0.00035155274,0.0020340444,0.00011942491,0.0038050741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964671,0.000559599,0.0005142187,0.0007318649,0.0013906872,0.00033654197],"domain_scores_gemma":[0.9962263,0.0013213046,0.00040798823,0.001369566,0.0005583887,0.00011644154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015135703,0.0005086295,0.0011944335,0.000766291,0.00080957846,0.0018150053,0.0014350907,0.0011593772,0.0019619118],"category_scores_gemma":[0.009136514,0.00028518846,0.0009559141,0.002097002,0.000652268,0.0049643624,0.0028656172,0.0015056918,0.0009733337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014612079,0.00039746953,0.006619377,0.0007913314,0.00020450809,0.0023233618,0.0015898494,0.1845648,0.11048636,0.23598894,0.017984759,0.43758804],"study_design_scores_gemma":[0.00008547455,0.000301902,0.0010916209,0.00003404615,0.00004524522,0.0016031463,0.00040613188,0.87109053,0.03905453,0.07492449,0.011295821,0.00006711899],"about_ca_topic_score_codex":0.0012271678,"about_ca_topic_score_gemma":0.0007899096,"teacher_disagreement_score":0.0019619118,"about_ca_system_score_codex":0.0006960386,"about_ca_system_score_gemma":0.0012396,"threshold_uncertainty_score":0.008004606},"labels":[],"label_agreement":null},{"id":"W3153416009","doi":"10.1109/tdsc.2021.3072295","title":"SuperSketch: A Multi-Dimensional Reversible Data Structure for Super Host Identification","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Computer science; Host (biology); Identification (biology); Curse of dimensionality; Sketch; Data mining; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.03527887273444228,"score_gpt":0.27241382000644265,"score_spread":0.23713494727200038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153416009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049366985,0.00079309853,0.9351793,0.00032302595,0.00018945732,0.0003356298,0.0037313832,0.008317798,0.0017632734],"genre_scores_gemma":[0.41235787,0.00056158815,0.5733971,0.00029393882,0.00011104952,0.0006387607,0.008545986,0.0003083212,0.0037853315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986897,0.00017669212,0.00015060992,0.00028229586,0.0005923281,0.00010844167],"domain_scores_gemma":[0.99469393,0.0010250489,0.0006542416,0.0025344416,0.00088571996,0.00020661997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011527993,0.0008131395,0.0012855602,0.0028143574,0.0008503931,0.001726076,0.0025082224,0.0009331462,0.0028773795],"category_scores_gemma":[0.0076222233,0.0005173018,0.00076219725,0.0034126963,0.0011644639,0.004867445,0.0032118033,0.001451131,0.0014702443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017517661,0.0003638793,0.012315169,0.00056668464,0.00021906132,0.0004729241,0.0006771518,0.122537374,0.041615497,0.06762058,0.018406307,0.7334537],"study_design_scores_gemma":[0.00011108415,0.00047778085,0.0023618026,0.00006811822,0.000050193994,0.00051932014,0.00031169015,0.8854941,0.0470368,0.04345757,0.019941056,0.00017055146],"about_ca_topic_score_codex":0.0027407126,"about_ca_topic_score_gemma":0.0040918575,"teacher_disagreement_score":0.0028773795,"about_ca_system_score_codex":0.0010018282,"about_ca_system_score_gemma":0.001988801,"threshold_uncertainty_score":0.0096257925},"labels":[],"label_agreement":null},{"id":"W3154781724","doi":"10.1109/tdsc.2021.3074146","title":"Secure Password-Protected Encryption Key for Deduplicated Cloud Storage Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Password; Server; Encryption; Data deduplication; Computer security; Computer network; Cloud computing; Authentication (law); S/KEY; Operating system","score_opus":0.019947460979481642,"score_gpt":0.24600901987333149,"score_spread":0.22606155889384985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154781724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07465435,0.0024235656,0.91583997,0.0004394633,0.00028494594,0.00041785376,0.00032207445,0.0013367794,0.0042810184],"genre_scores_gemma":[0.868445,0.0009051258,0.1261479,0.00013100287,0.00007240657,0.00018739974,0.00035613705,0.000051068622,0.0037040024],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.0002559164,0.00020150059,0.00016107217,0.00047525624,0.00012834017],"domain_scores_gemma":[0.9984213,0.00024688264,0.00017827455,0.0007118419,0.00036433496,0.00007736287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000898128,0.00053775,0.0006039258,0.0004718483,0.0006576079,0.0010975186,0.001114933,0.0006122438,0.0019556503],"category_scores_gemma":[0.0022363854,0.00027536496,0.00035178673,0.00050705916,0.00046129903,0.0037606999,0.0015653223,0.000790108,0.0010411182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024418284,0.00052022404,0.0043197474,0.0021708587,0.00028593282,0.0022582961,0.0009800114,0.049579766,0.33937728,0.2530638,0.014132137,0.33087015],"study_design_scores_gemma":[0.00038884915,0.0010716107,0.0017779609,0.00017141676,0.00018479468,0.004170086,0.0003522611,0.5623738,0.30729678,0.055030987,0.06698372,0.0001976786],"about_ca_topic_score_codex":0.00019148407,"about_ca_topic_score_gemma":0.00020598207,"teacher_disagreement_score":0.0019556503,"about_ca_system_score_codex":0.0004223921,"about_ca_system_score_gemma":0.0006678269,"threshold_uncertainty_score":0.006542325},"labels":[],"label_agreement":null},{"id":"W3191008542","doi":"10.1109/tdsc.2021.3101120","title":"Towards Practical and Privacy-Preserving Multi-Dimensional Range Query Over Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Intersection (aeronautics); Predicate (mathematical logic); Point cloud; Data mining; Theoretical computer science; Range query (database); Big data; Information privacy; Server; Computer security; Algorithm; Information retrieval; Computer network; Artificial intelligence; Search engine","score_opus":0.027779216036727967,"score_gpt":0.2862058883541309,"score_spread":0.25842667231740296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191008542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020769553,0.0013770037,0.972179,0.0010723093,0.00012320119,0.00028677494,0.00033901774,0.00073150464,0.0031216382],"genre_scores_gemma":[0.69498444,0.001966881,0.29727054,0.0010377268,0.0003139851,0.00043126268,0.0009297838,0.00009303146,0.002972353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99222213,0.0016963151,0.00071469176,0.0010833682,0.0031789565,0.0011045773],"domain_scores_gemma":[0.9937093,0.0018052462,0.0005098658,0.0025511023,0.0012076001,0.00021683995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033942827,0.00070287404,0.0017583175,0.0009317305,0.0017069596,0.0030236708,0.0027608974,0.0017329314,0.0016706159],"category_scores_gemma":[0.0075750183,0.00043852607,0.0013425255,0.0028840387,0.0012671666,0.008934601,0.0069675557,0.002846949,0.00078400044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020109247,0.0006595308,0.0052146497,0.00096839224,0.00029914684,0.0019408605,0.001769057,0.15141894,0.08240777,0.35033762,0.030409083,0.37256408],"study_design_scores_gemma":[0.00015240494,0.00030526938,0.0007006212,0.00005410358,0.00006865519,0.0019647938,0.00069689314,0.8751464,0.02381474,0.08052998,0.016470186,0.000095870935],"about_ca_topic_score_codex":0.0016716174,"about_ca_topic_score_gemma":0.0010059999,"teacher_disagreement_score":0.0033942827,"about_ca_system_score_codex":0.0011039444,"about_ca_system_score_gemma":0.0021858946,"threshold_uncertainty_score":0.017950833},"labels":[],"label_agreement":null},{"id":"W3199406030","doi":"10.1109/tdsc.2021.3111328","title":"ExtendedSketch: Fusing Network Traffic for Super Host Identification With a Memory Efficient Sketch","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Host (biology); Computer science; Sketch; Identification (biology); Theoretical computer science; Notation; Parallel computing; Algorithm; Data mining; Mathematics; Arithmetic","score_opus":0.012322603479798702,"score_gpt":0.23114439979145426,"score_spread":0.21882179631165555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199406030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08956216,0.0016622845,0.8900773,0.00019596875,0.00023172295,0.0002469785,0.0010140543,0.013478836,0.0035307158],"genre_scores_gemma":[0.68011063,0.00068773027,0.31298625,0.00016639485,0.00007854264,0.00024261087,0.0017953061,0.00047778472,0.0034548116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920756,0.00011006281,0.00007142423,0.00019710747,0.00031452204,0.00009939023],"domain_scores_gemma":[0.9974598,0.0007855963,0.00028850205,0.00091121683,0.0003823409,0.00017262224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067394704,0.0011734617,0.0010060014,0.0013118627,0.00044455702,0.0016554829,0.001639856,0.0008219523,0.003502628],"category_scores_gemma":[0.005988834,0.0004023498,0.00052688597,0.001046814,0.0006682618,0.0029728427,0.002396903,0.0007732526,0.0012675432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015840351,0.00015028947,0.017066017,0.0008631754,0.00017558626,0.0010770385,0.0008061185,0.19608574,0.08132003,0.017442409,0.0111901825,0.6722395],"study_design_scores_gemma":[0.000060775856,0.00020349142,0.0018700368,0.00005838785,0.000044405708,0.00061668776,0.00020432977,0.9486102,0.030712537,0.008593757,0.008948062,0.000077306126],"about_ca_topic_score_codex":0.0017160249,"about_ca_topic_score_gemma":0.0020846762,"teacher_disagreement_score":0.003502628,"about_ca_system_score_codex":0.00051557843,"about_ca_system_score_gemma":0.00080721395,"threshold_uncertainty_score":0.011717498},"labels":[],"label_agreement":null},{"id":"W3207729491","doi":"10.1109/tdsc.2021.3118636","title":"Generative-Adversarial Class-Imbalance Learning for Classifying Cyber-Attacks and Faults - A Cyber-Physical Power System","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cyber-physical system; Adversarial system; Artificial intelligence; Class (philosophy); Machine learning; Session (web analytics); Perceptron; Scheme (mathematics); Computer security; Data mining; Artificial neural network; Mathematics","score_opus":0.013569973561393354,"score_gpt":0.2459517250997809,"score_spread":0.23238175153838753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207729491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17402989,0.0004696593,0.82113135,0.00054579513,0.00011257127,0.00013079411,0.00015981961,0.0011197376,0.0023003304],"genre_scores_gemma":[0.97140956,0.000087012566,0.02726497,0.0001298945,0.000035511013,0.000043741777,0.00021838148,0.00003106979,0.0007799135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.00038858503,0.00004053441,0.00022146903,0.00026780533,0.00011465209],"domain_scores_gemma":[0.9972537,0.0015889151,0.00035618973,0.0003734891,0.0002942532,0.00013345337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002771664,0.000984098,0.0007731771,0.00080255035,0.00038025648,0.00064324494,0.0009956354,0.00066707603,0.0007591712],"category_scores_gemma":[0.004848899,0.00021120564,0.00060121046,0.00044507332,0.0010350266,0.0013940391,0.0012815521,0.0017190941,0.00020641953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033519533,0.00016681179,0.0048139896,0.000048021273,0.000057727066,0.00007302153,0.000089036395,0.89531803,0.0030723694,0.004130556,0.0013956422,0.09049961],"study_design_scores_gemma":[0.0000032179585,0.000023070477,0.00038508524,0.0000023031512,0.000003960437,0.000011090512,0.0000065006407,0.9965779,0.0010891521,0.0017811214,0.00011278552,0.000003700423],"about_ca_topic_score_codex":0.0017845555,"about_ca_topic_score_gemma":0.0012625764,"teacher_disagreement_score":0.002771664,"about_ca_system_score_codex":0.0010260923,"about_ca_system_score_gemma":0.0005624228,"threshold_uncertainty_score":0.014658093},"labels":[],"label_agreement":null},{"id":"W3212510710","doi":"10.1109/tdsc.2021.3128073","title":"Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematics; Mathematical proof; Computer science; Discrete mathematics; Theoretical computer science; Arithmetic; Geometry","score_opus":0.011133100045737823,"score_gpt":0.22633361400972168,"score_spread":0.21520051396398387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212510710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010811419,0.0010646249,0.9499707,0.0017328113,0.00043229677,0.00040358945,0.0017390386,0.014109074,0.019736432],"genre_scores_gemma":[0.62702525,0.0015650922,0.33479166,0.0019131268,0.0005049027,0.0011736165,0.0033093877,0.0020149436,0.027701944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995424,0.0011391857,0.00041963058,0.00078599964,0.0015430067,0.00068828696],"domain_scores_gemma":[0.9894106,0.0022377903,0.0006761457,0.006309765,0.0011092448,0.00025632262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299925,0.0012467068,0.0014367494,0.0011292245,0.0014652197,0.0045336476,0.0037711437,0.0025987977,0.021642417],"category_scores_gemma":[0.017167237,0.0010062692,0.001233809,0.0018904085,0.001932752,0.0073169298,0.0074099586,0.0030672767,0.015757862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014590231,0.00026083126,0.0015868797,0.0014998735,0.00017566193,0.0015401972,0.0011600524,0.05381806,0.02959189,0.6021589,0.091459416,0.21528922],"study_design_scores_gemma":[0.0003724321,0.00036787748,0.0003902091,0.0002837703,0.00013016694,0.0022040666,0.000305744,0.26342097,0.0957345,0.40957835,0.22701214,0.00019972191],"about_ca_topic_score_codex":0.00064780284,"about_ca_topic_score_gemma":0.00061076053,"teacher_disagreement_score":0.021642417,"about_ca_system_score_codex":0.0010855761,"about_ca_system_score_gemma":0.003304523,"threshold_uncertainty_score":0.07240111},"labels":[],"label_agreement":null},{"id":"W4206541176","doi":"10.1109/tdsc.2021.3138700","title":"Dataset Characteristics for Reliable Code Authorship Attribution","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Software Engineering Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Attribution; Computer science; Coding (social sciences); Source code; Field (mathematics); Robustness (evolution); Code (set theory); Data science; Data mining; Benchmark (surveying); Information retrieval; Set (abstract data type); Artificial intelligence; Programming language","score_opus":0.03607006238654237,"score_gpt":0.2916618682774196,"score_spread":0.2555918058908772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206541176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6087066,0.0028931967,0.15509069,0.00595029,0.0015013918,0.0040782522,0.19981243,0.0072114444,0.014755698],"genre_scores_gemma":[0.6287972,0.00044594705,0.14701244,0.0005116315,0.0003250233,0.004613325,0.21647654,0.0005835692,0.001234369],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97141695,0.00794027,0.006367421,0.004792903,0.008388028,0.0010944877],"domain_scores_gemma":[0.85936826,0.0663571,0.010935705,0.03488844,0.026618404,0.0018321038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021742862,0.0010236684,0.0008972662,0.005259944,0.001911995,0.0044279303,0.0020824752,0.002235132,0.0020713215],"category_scores_gemma":[0.16109192,0.00025794443,0.0011331517,0.0066255946,0.0011924919,0.003644193,0.0024533921,0.0019246946,0.0015435456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022594437,0.0016397886,0.4370867,0.0033818048,0.00067139056,0.00092147687,0.002251027,0.024679588,0.022388762,0.017431205,0.14222927,0.34505957],"study_design_scores_gemma":[0.00082164176,0.0012583083,0.4223519,0.0016447832,0.0006689233,0.0032036654,0.004394999,0.17645021,0.06071302,0.053467646,0.274552,0.0004729857],"about_ca_topic_score_codex":0.0018509376,"about_ca_topic_score_gemma":0.0022613497,"teacher_disagreement_score":0.021742862,"about_ca_system_score_codex":0.0015140689,"about_ca_system_score_gemma":0.002771867,"threshold_uncertainty_score":0.114988625},"labels":[],"label_agreement":null},{"id":"W4210795501","doi":"10.1109/tdsc.2022.3144991","title":"Enabling Regulatory Compliance and Enforcement in Decentralized Anonymous Payment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Cryptocurrency; Anonymity; Enforcement; Computer security; Computer science; Mathematical proof; Payment; Scheme (mathematics); Trusted third party; Internet privacy; Law; World Wide Web","score_opus":0.017490015882048328,"score_gpt":0.24367452065493808,"score_spread":0.22618450477288976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210795501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096967764,0.00016573374,0.89309347,0.00078366365,0.00007371657,0.00032493484,0.00006936882,0.002328265,0.006193121],"genre_scores_gemma":[0.905724,0.00012906108,0.09092876,0.00018703284,0.000058356418,0.00021714818,0.00007040115,0.00006775289,0.0026176826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9836912,0.007763291,0.000999435,0.002157641,0.004202068,0.001186347],"domain_scores_gemma":[0.9752401,0.009692067,0.003235581,0.008599587,0.0026381586,0.0005945588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011674344,0.00037370226,0.00079684536,0.0008650829,0.0021831922,0.0027040397,0.0022702073,0.0019959898,0.0013976948],"category_scores_gemma":[0.021497978,0.00059180084,0.000680496,0.0010599863,0.0036202266,0.0048741987,0.0052795233,0.0028592546,0.000554296],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008762525,0.0005664756,0.0048317336,0.0003369517,0.00008653466,0.0010545156,0.0019799322,0.101472035,0.03784882,0.67129636,0.003287185,0.17636316],"study_design_scores_gemma":[0.00028685588,0.0003010843,0.00091824785,0.0001036113,0.000084813924,0.0006873988,0.00023354245,0.70559955,0.052679308,0.21972574,0.019217469,0.00016239709],"about_ca_topic_score_codex":0.0012208796,"about_ca_topic_score_gemma":0.00074315205,"teacher_disagreement_score":0.011674344,"about_ca_system_score_codex":0.0014725835,"about_ca_system_score_gemma":0.0052007954,"threshold_uncertainty_score":0.061740577},"labels":[],"label_agreement":null},{"id":"W4214771680","doi":"10.1109/tdsc.2022.3153759","title":"Towards Efficient and Privacy-Preserving Interval Skyline Queries Over Time Series Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Skyline; Encryption; Homomorphic encryption; Security analysis; Information privacy; Data mining; Database; Computer security","score_opus":0.019673830660524024,"score_gpt":0.25014859585316107,"score_spread":0.23047476519263704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214771680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066802084,0.00034573092,0.929607,0.00047538505,0.000035241792,0.0001570874,0.0004936212,0.000887706,0.0011961029],"genre_scores_gemma":[0.728152,0.0004926062,0.26747808,0.00027429144,0.00014867306,0.00022882213,0.0012292403,0.00009649692,0.001899754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964644,0.0008251667,0.00040376067,0.0005187018,0.0014304591,0.00035750036],"domain_scores_gemma":[0.9942667,0.0016966524,0.000835439,0.0023039114,0.00072971836,0.00016756316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031475662,0.00047729208,0.000998653,0.00084213226,0.00084937754,0.002024919,0.0014503346,0.0010233193,0.0012521603],"category_scores_gemma":[0.0069658672,0.00038662672,0.0008781248,0.0021755788,0.0010921515,0.006520624,0.0034424034,0.00149231,0.00063297764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029752897,0.00048631447,0.0077988133,0.00059211085,0.00033995774,0.0012729944,0.00249249,0.21285377,0.17818482,0.26772746,0.013380558,0.31189546],"study_design_scores_gemma":[0.00019684716,0.00042953077,0.0012456558,0.000024223596,0.00005534006,0.00067643286,0.0006189087,0.85552,0.04866065,0.08363967,0.0088643255,0.000068526555],"about_ca_topic_score_codex":0.0013126977,"about_ca_topic_score_gemma":0.0007952925,"teacher_disagreement_score":0.0031475662,"about_ca_system_score_codex":0.00073322305,"about_ca_system_score_gemma":0.0015199265,"threshold_uncertainty_score":0.016646147},"labels":[],"label_agreement":null},{"id":"W4226366790","doi":"10.1109/tdsc.2022.3170011","title":"Classifier Calibration: With Application to Threat Scores in Cybersecurity","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Classifier (UML); Computer science; Logistic regression; Artificial intelligence; Calibration; Machine learning; Binary number; Binary classification; Pattern recognition (psychology); Data mining; Statistics; Support vector machine; Mathematics","score_opus":0.008903308616086904,"score_gpt":0.23564501455131684,"score_spread":0.22674170593522994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226366790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07356864,0.0010422904,0.9157146,0.0017376038,0.00023661279,0.00031374692,0.0001839629,0.003178238,0.004024334],"genre_scores_gemma":[0.6911133,0.0003632337,0.30534354,0.00039143936,0.0002979435,0.0002885667,0.00038802205,0.00036332879,0.0014506524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98003733,0.010496035,0.0008070293,0.0030653337,0.004863497,0.00073068624],"domain_scores_gemma":[0.934184,0.046202388,0.0041607693,0.005972827,0.008281902,0.0011981251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024188817,0.0019254552,0.0020636527,0.0045858226,0.0014385572,0.0038717533,0.0026421805,0.0038648355,0.0030038073],"category_scores_gemma":[0.12911539,0.0007350774,0.0014664495,0.0042823055,0.0033678096,0.005613757,0.0045567476,0.0065406933,0.0010291482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054480974,0.00045899875,0.033405524,0.00026033467,0.00032514383,0.00025406547,0.0011483327,0.27768275,0.0038078018,0.029286157,0.00667774,0.6461483],"study_design_scores_gemma":[0.0000762664,0.00033635585,0.0059780916,0.00007843367,0.000068460016,0.00024038155,0.00024286903,0.9313058,0.005259344,0.052915476,0.0034209907,0.000077418525],"about_ca_topic_score_codex":0.0030423268,"about_ca_topic_score_gemma":0.0016587442,"teacher_disagreement_score":0.024188817,"about_ca_system_score_codex":0.0023313374,"about_ca_system_score_gemma":0.0017005507,"threshold_uncertainty_score":0.1279242},"labels":[],"label_agreement":null},{"id":"W4237415699","doi":"10.1109/tdsc.2021.3096213","title":"Detecting False Data Injection Attacks in Peer to Peer Energy Trading Using Machine Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Norges Forskningsråd","keywords":"Computer science; Peer-to-peer; Energy (signal processing); Computer security; Artificial intelligence; Computer network","score_opus":0.029732842824567444,"score_gpt":0.2612602721635021,"score_spread":0.23152742933893466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237415699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3818828,0.0009544422,0.6094364,0.0010420579,0.0001504479,0.00019734478,0.0002382414,0.0038865535,0.002211716],"genre_scores_gemma":[0.95780593,0.00007610136,0.04119427,0.00013263618,0.000038091614,0.00004240302,0.00019595423,0.000029681398,0.000484882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703395,0.001077976,0.00021915809,0.00063368975,0.0008123545,0.00022283406],"domain_scores_gemma":[0.9898045,0.0068139415,0.0011221617,0.0010065672,0.0010273992,0.00022544939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210503,0.0010778983,0.0013327168,0.001146646,0.00059160654,0.0017094054,0.001822954,0.0017743921,0.00038353266],"category_scores_gemma":[0.011633296,0.0002297515,0.00049622275,0.0007131019,0.00078069844,0.002835737,0.001246625,0.0020495388,0.00032287545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010206002,0.001098141,0.050696936,0.00016907998,0.00024255105,0.00078595825,0.00024740733,0.55044895,0.009793885,0.0052244035,0.0047494895,0.37552252],"study_design_scores_gemma":[0.000005399809,0.00003602206,0.0006080901,0.000003429471,0.000004895271,0.000058831745,0.000015080437,0.995329,0.0023559658,0.0014191242,0.00015838527,0.000005754928],"about_ca_topic_score_codex":0.0013851236,"about_ca_topic_score_gemma":0.0011001901,"teacher_disagreement_score":0.003210503,"about_ca_system_score_codex":0.00077240716,"about_ca_system_score_gemma":0.000706784,"threshold_uncertainty_score":0.01697892},"labels":[],"label_agreement":null},{"id":"W4285070399","doi":"10.1109/tdsc.2022.3171740","title":"Least-Privilege Calls to Amazon Web Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Privilege (computing); Computer science; Cloud computing; Computer security; World Wide Web; Context (archaeology); Database; Operating system","score_opus":0.007378240413672753,"score_gpt":0.22970916153475504,"score_spread":0.2223309211210823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285070399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48941568,0.0032236911,0.37113938,0.0048013763,0.0005324135,0.00056836987,0.012063051,0.04632927,0.07192679],"genre_scores_gemma":[0.8578263,0.000780826,0.12582071,0.00086157426,0.00021485829,0.00016773089,0.0062124543,0.0026816425,0.005433867],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99297136,0.000958616,0.00061251974,0.00092598045,0.003694816,0.0008366087],"domain_scores_gemma":[0.9804585,0.005881196,0.0029188928,0.007475245,0.0024696921,0.00079658645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022534647,0.0005705299,0.0006976364,0.0021746238,0.001670286,0.002919523,0.0016782208,0.0009300285,0.0038791387],"category_scores_gemma":[0.018310796,0.00059384026,0.00079247,0.0021349348,0.0014769686,0.004324204,0.0019808514,0.0021071406,0.0015720287],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012885992,0.0004829066,0.121097565,0.0011704041,0.00022229989,0.0021340535,0.006130307,0.008400772,0.050860167,0.18783803,0.100470535,0.51990443],"study_design_scores_gemma":[0.00010868388,0.00034442832,0.11295493,0.00049124396,0.00017718427,0.0047266986,0.0021960624,0.13804707,0.12576614,0.12519191,0.48948917,0.00050651154],"about_ca_topic_score_codex":0.009337752,"about_ca_topic_score_gemma":0.010227878,"teacher_disagreement_score":0.009337752,"about_ca_system_score_codex":0.0012147774,"about_ca_system_score_gemma":0.0016840061,"threshold_uncertainty_score":0.018566787},"labels":[],"label_agreement":null},{"id":"W4292264668","doi":"10.1109/tdsc.2022.3199326","title":"A Comparison of Four Notions of Isomorphism-Based Security for Graphs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Graph homomorphism; Notation; Theoretical computer science; Computer science; Graph; Computational complexity theory; Discrete mathematics; Isomorphism (crystallography); Graph automorphism; Graph property; Adversary; Combinatorics; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.032440064605695824,"score_gpt":0.28622477444507316,"score_spread":0.25378470983937734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292264668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08119909,0.0038307167,0.84622496,0.012304522,0.0005427221,0.0005442506,0.00061004935,0.0008639259,0.053879812],"genre_scores_gemma":[0.75928557,0.0038066672,0.22737886,0.0017820676,0.0009324157,0.0005608979,0.0007899341,0.00037658127,0.0050870413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9796912,0.008105482,0.0016556135,0.0037468518,0.0048009693,0.0019999063],"domain_scores_gemma":[0.93974537,0.03373716,0.0052594813,0.01589582,0.0026957064,0.0026663733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01269157,0.0019184421,0.0018710099,0.005692869,0.003183054,0.010578416,0.00474592,0.0048134928,0.005286577],"category_scores_gemma":[0.036450233,0.0013832524,0.0045341034,0.0056520617,0.021031592,0.0359649,0.013715218,0.011113211,0.00076854153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014076721,0.0000741617,0.0005126037,0.00019507372,0.0000435358,0.000042048152,0.0003887426,0.006919639,0.0008037868,0.97851,0.0011289141,0.011240721],"study_design_scores_gemma":[0.000040267078,0.00018418836,0.00069130084,0.00014571333,0.0000739241,0.00028068502,0.00039833033,0.025296938,0.0020555488,0.963078,0.0076733637,0.000081823404],"about_ca_topic_score_codex":0.0012305246,"about_ca_topic_score_gemma":0.00090706814,"teacher_disagreement_score":0.01269157,"about_ca_system_score_codex":0.0060064644,"about_ca_system_score_gemma":0.004147585,"threshold_uncertainty_score":0.067120254},"labels":[],"label_agreement":null},{"id":"W4292971553","doi":"10.1109/tdsc.2022.3200421","title":"Self-Checking Deep Neural Networks for Anomalies and Adversaries in Deployment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Bộ Giáo dục và Ðào tạo; National Research Foundation; Ministry of Education - Singapore; National Research Foundation Singapore; National University of Singapore; Cisco Systems","keywords":"Computer science; Adversarial system; Software deployment; Artificial neural network; Artificial intelligence; Deep neural networks; False alarm; Constant false alarm rate; Machine learning; Domain (mathematical analysis); Margin (machine learning); Software; Data mining; Software engineering","score_opus":0.010293780803748166,"score_gpt":0.23527321206014246,"score_spread":0.2249794312563943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292971553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4342671,0.00095147244,0.5095533,0.0019992953,0.00050253846,0.00016211027,0.00052632747,0.047073215,0.0049645784],"genre_scores_gemma":[0.94454247,0.00013261495,0.05228514,0.00056399556,0.000024018262,0.000058431353,0.00033492694,0.0008403645,0.0012181264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958169,0.0012428539,0.00029390186,0.0011644759,0.0011172658,0.0003645604],"domain_scores_gemma":[0.9791607,0.009525004,0.0021871855,0.006749243,0.0019707107,0.0004071273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048722816,0.001501446,0.0006029796,0.00074401335,0.0005205341,0.0014769153,0.002954406,0.0011472938,0.0015347572],"category_scores_gemma":[0.030007914,0.00086334907,0.00079149386,0.00035278636,0.0020356665,0.004197213,0.0021106508,0.0029392443,0.00060549745],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010438767,0.00026282732,0.05222048,0.0003927036,0.0003008437,0.0013228807,0.0006380698,0.695904,0.04195595,0.0142212305,0.014047042,0.17769004],"study_design_scores_gemma":[0.000025396526,0.00013455008,0.0015746851,0.000041725616,0.000035775312,0.00018438195,0.000055608616,0.9633063,0.025199624,0.0072103515,0.0022020803,0.00002961615],"about_ca_topic_score_codex":0.005301762,"about_ca_topic_score_gemma":0.007389988,"teacher_disagreement_score":0.005301762,"about_ca_system_score_codex":0.0017150929,"about_ca_system_score_gemma":0.002043956,"threshold_uncertainty_score":0.025767386},"labels":[],"label_agreement":null},{"id":"W4312335128","doi":"10.1109/tdsc.2022.3216749","title":"Crystal: Enhancing Blockchain Mining Transparency With Quorum Certificate","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Ledger; Certificate; Transparency (behavior); Mathematical proof; Publication; Protocol (science); Theoretical computer science; Business; Medicine; Mathematics; Advertising; Accounting","score_opus":0.021510803081820736,"score_gpt":0.22763578247505784,"score_spread":0.2061249793932371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312335128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075798705,0.00043464027,0.9043223,0.0012315594,0.00015470192,0.00064621813,0.000232368,0.006906709,0.010272725],"genre_scores_gemma":[0.9026505,0.00022266957,0.09230458,0.00022342792,0.000052937256,0.00024202662,0.00022529755,0.00018137261,0.0038972204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99453187,0.0019479014,0.00027233217,0.00045378934,0.0022279534,0.00056620815],"domain_scores_gemma":[0.98637277,0.004834835,0.0013214169,0.0047652395,0.0019864615,0.00071923673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051784036,0.0005200516,0.0007457607,0.0008585083,0.0012253842,0.0016693176,0.0020277626,0.0013048887,0.00300498],"category_scores_gemma":[0.017623648,0.00040049286,0.00046801366,0.001054034,0.0018022045,0.0045079673,0.0051550386,0.0019425517,0.0008165704],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016806673,0.00067427754,0.0065486846,0.000764437,0.00016649661,0.0008696665,0.0013839565,0.2829638,0.05959419,0.32720867,0.018077938,0.30006725],"study_design_scores_gemma":[0.00022483205,0.00030581735,0.0005258753,0.000045589797,0.0000366841,0.0002658561,0.000112373,0.89006686,0.023785222,0.06877826,0.015785577,0.00006695153],"about_ca_topic_score_codex":0.0032114326,"about_ca_topic_score_gemma":0.0030882163,"teacher_disagreement_score":0.0051784036,"about_ca_system_score_codex":0.001221218,"about_ca_system_score_gemma":0.004996094,"threshold_uncertainty_score":0.027386367},"labels":[],"label_agreement":null},{"id":"W4312438979","doi":"10.1109/tdsc.2022.3217569","title":"Cover Reproducible Steganography via Deep Generative Models","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Steganography; Computer science; Steganalysis; Cover (algebra); Theoretical computer science; Steganography tools; Decoding methods; Cryptography; Embedding; Artificial intelligence; Algorithm; Pattern recognition (psychology); Speech recognition","score_opus":0.01634097675994247,"score_gpt":0.2320379466060755,"score_spread":0.215696969846133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312438979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028995175,0.00051370147,0.9669257,0.00028761322,0.000027500771,0.000023179515,0.00008249739,0.00042965676,0.0027150041],"genre_scores_gemma":[0.891949,0.0008101139,0.09945696,0.00019676065,0.00006401605,0.00012671878,0.00028054786,0.0001649322,0.0069510173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997737,0.000078489655,0.00000834535,0.00004811388,0.00005510353,0.000036277488],"domain_scores_gemma":[0.9991062,0.00065645436,0.000081612816,0.00007249938,0.000053627526,0.00002966653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990282,0.0007108153,0.00063774444,0.00043912992,0.00024655377,0.0007069248,0.0006558466,0.0008863899,0.0014651262],"category_scores_gemma":[0.0016260683,0.00051504915,0.0009526564,0.00033203652,0.0009539947,0.00093384,0.0009795103,0.0012584277,0.0003792522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046664452,0.000019669182,0.000422312,0.000043630287,0.000037545073,0.000090585636,0.000067162095,0.94014865,0.0033011932,0.029913053,0.0005321368,0.02537739],"study_design_scores_gemma":[0.0000022196432,0.000005294489,0.000031658572,0.00000234001,0.000003819763,0.000011129845,0.000001976735,0.99273443,0.00036482798,0.00668873,0.00015090602,0.0000026612815],"about_ca_topic_score_codex":0.003432286,"about_ca_topic_score_gemma":0.0048984257,"teacher_disagreement_score":0.003432286,"about_ca_system_score_codex":0.0007937205,"about_ca_system_score_gemma":0.0005448724,"threshold_uncertainty_score":0.0068246126},"labels":[],"label_agreement":null},{"id":"W4312617070","doi":"10.1109/tdsc.2022.3227650","title":"Multi-Client Boolean File Retrieval With Adaptable Authorization Switching for Secure Cloud Search Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Program of Shanghai Academic Research Leader; Shanghai Rising-Star Program; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Cloud storage; Initialization; Database; Theoretical computer science; Operating system; Programming language","score_opus":0.016528263604722256,"score_gpt":0.24141054355497776,"score_spread":0.2248822799502555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312617070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15784946,0.0031598806,0.7233316,0.0013988828,0.0003550593,0.0011714584,0.00285322,0.08881497,0.0210655],"genre_scores_gemma":[0.83690304,0.0003931987,0.14830792,0.00058927876,0.00012094543,0.00028616984,0.0024230345,0.0008522589,0.010124102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782455,0.00030122636,0.00026053956,0.00036642168,0.000795461,0.00045186022],"domain_scores_gemma":[0.9976737,0.00039631987,0.00011940713,0.0012460737,0.00041936396,0.00014511758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011344721,0.0006430697,0.0012931598,0.0008375599,0.0010435674,0.0022033039,0.0023004233,0.00090948783,0.008736051],"category_scores_gemma":[0.0041191694,0.00034020923,0.000582042,0.00143534,0.00075653486,0.0051842653,0.0028587854,0.0011372403,0.0044797426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049714474,0.0009950597,0.005968352,0.0007682179,0.00023729779,0.001256968,0.00061984174,0.04977603,0.11894565,0.053834658,0.104329415,0.6582972],"study_design_scores_gemma":[0.00043047604,0.0002388461,0.0018651241,0.000034993664,0.00005990477,0.0009234707,0.0002756003,0.86474234,0.0709229,0.024016002,0.03631305,0.00017722927],"about_ca_topic_score_codex":0.005921106,"about_ca_topic_score_gemma":0.0059414324,"teacher_disagreement_score":0.008736051,"about_ca_system_score_codex":0.0014443514,"about_ca_system_score_gemma":0.0019554426,"threshold_uncertainty_score":0.029224992},"labels":[],"label_agreement":null},{"id":"W4313025490","doi":"10.1109/tdsc.2022.3211870","title":"PRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over Encrypted Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Cloud computing; Query optimization; Information privacy; Data mining; Information retrieval; Computer security","score_opus":0.023735008290448337,"score_gpt":0.25276980778736413,"score_spread":0.2290347994969158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313025490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05937933,0.0008099061,0.9314344,0.0005833201,0.00013526618,0.00044039334,0.0012455786,0.0010711534,0.004900624],"genre_scores_gemma":[0.765772,0.0007325711,0.22565947,0.00037707906,0.00008849759,0.00030533955,0.0017282867,0.00010599698,0.0052307807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596137,0.00061021716,0.0004486694,0.00062240864,0.0017707048,0.0005866929],"domain_scores_gemma":[0.99662846,0.00078689895,0.0004100156,0.0014147279,0.0006462048,0.00011364086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121887,0.0004913988,0.0011861117,0.0007847339,0.0010689257,0.0014190814,0.0017382446,0.00087650097,0.0015670544],"category_scores_gemma":[0.0061979224,0.00027556246,0.00077431224,0.0019413502,0.0009909964,0.00547475,0.0033400771,0.0012352172,0.0007261179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025240076,0.00043953842,0.0064296704,0.0009841613,0.00023911275,0.0018120625,0.0018711487,0.19721416,0.12173447,0.20545408,0.02553937,0.43575817],"study_design_scores_gemma":[0.00015931475,0.00036775653,0.0015823672,0.00006187578,0.00006652586,0.0019664643,0.00064464076,0.8424059,0.051041935,0.07928528,0.022265334,0.00015261186],"about_ca_topic_score_codex":0.002896486,"about_ca_topic_score_gemma":0.0029803198,"teacher_disagreement_score":0.002896486,"about_ca_system_score_codex":0.0013042098,"about_ca_system_score_gemma":0.002042371,"threshold_uncertainty_score":0.010112762},"labels":[],"label_agreement":null},{"id":"W4319303304","doi":"10.1109/tdsc.2023.3242653","title":"Hybrid Knowledge and Data Driven Synthesis of Runtime Monitors for Cyber-Physical Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation of Sri Lanka; Commonwealth of Virginia","keywords":"Computer science; Cyber-physical system; Distributed computing; Computer security; Embedded system; Operating system","score_opus":0.022300808855211143,"score_gpt":0.27854898588577637,"score_spread":0.25624817703056524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319303304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023289315,0.00020417811,0.97406787,0.0001344912,0.000020727235,0.00006770929,0.00010907074,0.0011795254,0.0009271548],"genre_scores_gemma":[0.73899865,0.00017180198,0.2592722,0.00012068267,0.000022966406,0.00024265236,0.00029848717,0.0001535758,0.00071894703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983954,0.00041585008,0.00013061201,0.00040994442,0.00051631907,0.00013193642],"domain_scores_gemma":[0.9953483,0.0030967707,0.0004975848,0.0005149239,0.00044479434,0.00009759008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019503235,0.0009902739,0.0007689844,0.00073672127,0.00026639254,0.0014475322,0.001189847,0.00070947706,0.0011535886],"category_scores_gemma":[0.0072376756,0.00050831854,0.0010957725,0.0003067837,0.0008284698,0.0010736524,0.0012430049,0.0011194913,0.00022880668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018158168,0.00009370461,0.0019297921,0.00016857327,0.00006304315,0.00016705274,0.0001427049,0.90348065,0.0126425745,0.010239757,0.00044014363,0.07045043],"study_design_scores_gemma":[0.0000099300405,0.000038760034,0.00014183063,0.000007926876,0.000013175708,0.000016680182,0.000008712307,0.990642,0.004633451,0.004033236,0.0004486164,0.000005660881],"about_ca_topic_score_codex":0.0024044812,"about_ca_topic_score_gemma":0.0035152063,"teacher_disagreement_score":0.0024044812,"about_ca_system_score_codex":0.00093023723,"about_ca_system_score_gemma":0.0017485305,"threshold_uncertainty_score":0.010314405},"labels":[],"label_agreement":null},{"id":"W4319866023","doi":"10.1109/tdsc.2023.3241057","title":"Heterogeneous Differential-Private Federated Learning: Trading Privacy for Utility Truthfully","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Differential privacy; Incentive; Computer science; Private information retrieval; Information privacy; Incentive compatibility; Computer security; Internet privacy; Microeconomics; Data mining; Economics","score_opus":0.038413757963862885,"score_gpt":0.2757849288548905,"score_spread":0.2373711708910276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319866023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027663203,0.00014992677,0.97017574,0.00048966793,0.0000213767,0.00007756491,0.000066986075,0.00034083024,0.0010147416],"genre_scores_gemma":[0.8971995,0.00012135077,0.10066942,0.0004031099,0.000046126024,0.00018065839,0.00012454455,0.00006299127,0.0011922863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896622,0.0048079486,0.0004968587,0.0023231532,0.0018173294,0.0008926355],"domain_scores_gemma":[0.97813714,0.010930674,0.0016151802,0.0067716003,0.0017283083,0.0008170902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012708562,0.001331637,0.0023531558,0.0008826454,0.0011861422,0.003094388,0.004080996,0.0029463784,0.0016455412],"category_scores_gemma":[0.036606576,0.00071789394,0.0011391378,0.001479261,0.0032724987,0.0066406913,0.0054067234,0.0039570383,0.0003991269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093419757,0.0007785997,0.0048218747,0.00026074948,0.00019234052,0.0003351987,0.00054627535,0.6648634,0.0053064097,0.15350133,0.0026498847,0.16580978],"study_design_scores_gemma":[0.000041257677,0.00006979376,0.00014250043,0.000017564354,0.0000150680125,0.000060927232,0.000029100469,0.91532964,0.0017353402,0.08209427,0.0004494959,0.000015052587],"about_ca_topic_score_codex":0.0010419288,"about_ca_topic_score_gemma":0.0009931353,"teacher_disagreement_score":0.012708562,"about_ca_system_score_codex":0.0022128713,"about_ca_system_score_gemma":0.0030196803,"threshold_uncertainty_score":0.06721008},"labels":[],"label_agreement":null},{"id":"W4323519519","doi":"10.1109/tdsc.2023.3253786","title":"Multi-Client Secure and Efficient DPF-Based Keyword Search for Cloud Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Bloom filter; Encryption; Server; Cloud computing; Computer network; Cloud storage; Hash function; Distributed computing; Computer security","score_opus":0.028521564702901975,"score_gpt":0.27460165775526607,"score_spread":0.24608009305236409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323519519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07823107,0.0020084148,0.90955025,0.00052764156,0.00012898877,0.0004209653,0.00034803795,0.0044862903,0.004298435],"genre_scores_gemma":[0.8779344,0.000383081,0.116799474,0.0001485649,0.000051980027,0.00020711741,0.00024720104,0.00008442415,0.004143607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976254,0.00031669743,0.00020839502,0.0003313808,0.0011447204,0.0003735253],"domain_scores_gemma":[0.9975847,0.00037853763,0.00022565393,0.0010692374,0.0005838793,0.00015792127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090179854,0.00064081425,0.0016940065,0.0008524042,0.001731313,0.0016323616,0.0029033374,0.0012694134,0.0030622985],"category_scores_gemma":[0.0025643518,0.00037827762,0.0006709734,0.0018956916,0.00086631934,0.004918371,0.0029672398,0.0010106325,0.0011700623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004322436,0.00047300925,0.0050185653,0.0011772116,0.00030228595,0.0023696676,0.0010097198,0.13982123,0.15273273,0.13091251,0.01930057,0.54256004],"study_design_scores_gemma":[0.00013802639,0.00026120915,0.0006347174,0.000038060636,0.000059329435,0.0016540161,0.0002010123,0.90024143,0.06374465,0.023346692,0.009550161,0.00013072776],"about_ca_topic_score_codex":0.0028715872,"about_ca_topic_score_gemma":0.0020995121,"teacher_disagreement_score":0.0030622985,"about_ca_system_score_codex":0.0020902068,"about_ca_system_score_gemma":0.0022991737,"threshold_uncertainty_score":0.015165567},"labels":[],"label_agreement":null},{"id":"W4362496259","doi":"10.1109/tdsc.2023.3263974","title":"Efficient and Accurate Cloud-Assisted Medical Pre-Diagnosis With Privacy Preservation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Encryption; Computer science; Cloud computing; Server; Mahalanobis distance; Tree (set theory); Theoretical computer science; Metric (unit); Data mining; Information retrieval; Algorithm; Artificial intelligence; Mathematics; Computer security; World Wide Web; Combinatorics","score_opus":0.02045732974857327,"score_gpt":0.26307866519701295,"score_spread":0.24262133544843967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362496259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052119818,0.0013148505,0.9384103,0.0011850657,0.00014389896,0.00027137433,0.0010445435,0.0018899662,0.0036202474],"genre_scores_gemma":[0.7756966,0.00080581516,0.21898893,0.0003546312,0.00013932979,0.00012198262,0.0014631238,0.00006358327,0.0023660033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977962,0.00035943976,0.00021256371,0.00041405956,0.0009505726,0.0002672044],"domain_scores_gemma":[0.996971,0.00065621006,0.00037920746,0.0013760709,0.0004753588,0.00014203867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053742,0.00051996286,0.0010881278,0.0007137355,0.00082349236,0.0017839558,0.0016433077,0.000860726,0.0019448133],"category_scores_gemma":[0.004499879,0.00032175754,0.00087374606,0.0013520573,0.0005859634,0.0025676824,0.003258529,0.0011459275,0.0010126889],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029044796,0.00050965726,0.01836868,0.0006999712,0.00028085883,0.002373722,0.0007338834,0.11034005,0.07070747,0.055771604,0.023734923,0.7135746],"study_design_scores_gemma":[0.00012436154,0.00024211152,0.0032921373,0.000047521702,0.00009219274,0.0032805395,0.00033746994,0.8995686,0.054878626,0.027364463,0.010701928,0.00007002533],"about_ca_topic_score_codex":0.0021424133,"about_ca_topic_score_gemma":0.0022115484,"teacher_disagreement_score":0.0021424133,"about_ca_system_score_codex":0.0009905716,"about_ca_system_score_gemma":0.0024310437,"threshold_uncertainty_score":0.007187128},"labels":[],"label_agreement":null},{"id":"W4380607095","doi":"10.1109/tdsc.2023.3285590","title":"Multi-Modality Ensemble Distortion for Spatial Steganography With Dynamic Cost Correction","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Pixel; Distortion (music); Steganalysis; Steganography; Computer science; Artificial intelligence; Embedding; Algorithm; Pattern recognition (psychology); Computer vision; Telecommunications","score_opus":0.01697473529321391,"score_gpt":0.2669819941858309,"score_spread":0.250007258892617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380607095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032549582,0.00040820538,0.96556,0.00012389263,0.000042849155,0.000026986172,0.000036971054,0.00024226344,0.0010092385],"genre_scores_gemma":[0.7713037,0.00052137894,0.22477348,0.00008983564,0.000058309506,0.00004669643,0.00010382885,0.0000792976,0.0030235087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.00009222274,0.000024655277,0.00010066882,0.0002697472,0.00004294543],"domain_scores_gemma":[0.9993212,0.00018861784,0.00010071136,0.00018045251,0.00017176633,0.000037335558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005840643,0.0006692,0.00061970664,0.00049839524,0.00022378284,0.00051847595,0.00078580517,0.0004896006,0.0007516798],"category_scores_gemma":[0.0018102799,0.00019303123,0.0006704342,0.0003806616,0.0004392197,0.0013448962,0.00084783917,0.0009901314,0.0002048459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037608462,0.00011732331,0.0028260224,0.00017942779,0.00016961133,0.00021532568,0.00012662492,0.46515235,0.11701378,0.027938236,0.0013825665,0.38450256],"study_design_scores_gemma":[0.000003760532,0.00006463518,0.00057248113,0.000005924272,0.000020560585,0.00019218244,0.000010858003,0.97324264,0.022240784,0.0026483254,0.000980663,0.000017209297],"about_ca_topic_score_codex":0.0014308774,"about_ca_topic_score_gemma":0.0018562974,"teacher_disagreement_score":0.0014308774,"about_ca_system_score_codex":0.00077839673,"about_ca_system_score_gemma":0.00039309243,"threshold_uncertainty_score":0.0056476593},"labels":[],"label_agreement":null},{"id":"W4382999347","doi":"10.1109/tdsc.2023.3291715","title":"PHRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over High-Dimensional Data in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Query optimization; Homomorphic encryption; Scheme (mathematics); Range query (database); Information privacy; Outsourcing; Big data; Sargable; Data mining; Private information retrieval; Web search query; Information retrieval; Computer security; Search engine; Mathematics","score_opus":0.023675178659607516,"score_gpt":0.2630985343970592,"score_spread":0.2394233557374517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382999347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06297181,0.0007291824,0.92947453,0.0008140395,0.00011550608,0.00043134473,0.0008303448,0.0012368291,0.0033964228],"genre_scores_gemma":[0.7975739,0.0006271818,0.19588558,0.00048710298,0.00008700979,0.00034045766,0.0010628325,0.00009637151,0.003839497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471503,0.0010109249,0.0005299912,0.00096626737,0.002016062,0.00076164585],"domain_scores_gemma":[0.99521685,0.0011863004,0.0005115543,0.002313667,0.00057858357,0.00019302254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028026523,0.00050113676,0.00147753,0.0006188189,0.0014589716,0.0016994091,0.002329587,0.0013437459,0.0016460598],"category_scores_gemma":[0.006704539,0.00036701915,0.0011025207,0.0019352916,0.0015003083,0.0068993345,0.004709396,0.0017239429,0.00066013215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027053973,0.0005740978,0.0070773135,0.0010216213,0.00030700112,0.0013319112,0.0020475478,0.2430336,0.09847856,0.32213834,0.02164163,0.299643],"study_design_scores_gemma":[0.0001877876,0.00039384633,0.0012696879,0.00004526566,0.000060862483,0.0012307557,0.00040291535,0.8459096,0.037261315,0.10115901,0.011924299,0.00015467801],"about_ca_topic_score_codex":0.002626705,"about_ca_topic_score_gemma":0.0019810335,"teacher_disagreement_score":0.0028026523,"about_ca_system_score_codex":0.0016853655,"about_ca_system_score_gemma":0.0029455086,"threshold_uncertainty_score":0.014822006},"labels":[],"label_agreement":null},{"id":"W4385322377","doi":"10.1109/tdsc.2023.3299522","title":"False Data Detector for Electrical Vehicles Temporal-Spatial Charging Coordination Secure Against Evasion and Privacy Adversarial Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Detector; Robustness (evolution); Evasion (ethics); Computer security; Deep learning; Adversarial system; Artificial intelligence; Data mining; Real-time computing; Machine learning; Telecommunications","score_opus":0.03240345502596371,"score_gpt":0.292634949808259,"score_spread":0.2602314947822953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385322377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096341565,0.00026607845,0.8964334,0.0010595769,0.00010918204,0.00010928048,0.0001796196,0.0020626166,0.0034386863],"genre_scores_gemma":[0.9692835,0.000061205435,0.02880543,0.00024618272,0.000018281797,0.00004244577,0.00011774704,0.000037784754,0.0013873833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702615,0.00079419103,0.0001375013,0.0006034654,0.0009619074,0.00047684627],"domain_scores_gemma":[0.9940222,0.0022685854,0.0007833904,0.0015690394,0.0010884429,0.0002683757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027308916,0.000740609,0.0010274388,0.0006233847,0.0006082692,0.0012116521,0.002134942,0.0013829739,0.0012422374],"category_scores_gemma":[0.0121620735,0.00037241075,0.00064358715,0.00047951107,0.0015098965,0.0029935075,0.003057747,0.0022942524,0.00043035255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007518929,0.00033477572,0.017482102,0.00016655188,0.00016763083,0.00065559876,0.00032713497,0.7130919,0.015219409,0.04143346,0.006770606,0.20359893],"study_design_scores_gemma":[0.0000091019065,0.000054323198,0.00046636126,0.0000064930505,0.000009541135,0.00009478436,0.0000225881,0.9864893,0.006134592,0.0060292063,0.00067208335,0.000011634367],"about_ca_topic_score_codex":0.0019977847,"about_ca_topic_score_gemma":0.0020251386,"teacher_disagreement_score":0.0027308916,"about_ca_system_score_codex":0.0015660796,"about_ca_system_score_gemma":0.0018987057,"threshold_uncertainty_score":0.014442503},"labels":[],"label_agreement":null},{"id":"W4386174973","doi":"10.1109/tdsc.2023.3308848","title":"Fast-HotStuff: A Fast and Robust BFT Protocol for Blockchains","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Byzantine fault tolerance; Computer network; Distributed computing; Protocol (science); Throughput; Robustness (evolution); Fault tolerance; Parallel computing; Telecommunications; Wireless","score_opus":0.03179252942926588,"score_gpt":0.2848214308757208,"score_spread":0.25302890144645496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386174973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031003153,0.00050852465,0.9587707,0.00051951664,0.00017861494,0.00045596287,0.0003867731,0.0027095512,0.005467155],"genre_scores_gemma":[0.7605146,0.0005846482,0.22628456,0.0003416882,0.00012844059,0.0007414292,0.0010079634,0.0003315717,0.01006502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987344,0.00034572472,0.0000982388,0.00017387015,0.0004652807,0.00018255021],"domain_scores_gemma":[0.9978587,0.0005674362,0.00024838484,0.0007457663,0.0003950994,0.00018470052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016390153,0.0005427734,0.0006754491,0.0007573593,0.0011571876,0.00096834725,0.0016264074,0.0014356552,0.0047393683],"category_scores_gemma":[0.003996121,0.0003587455,0.00041588908,0.0008561939,0.0011478476,0.002585815,0.0029225743,0.0015021111,0.0010724247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013764136,0.00021999338,0.0013535606,0.0008447061,0.00014016542,0.0009932219,0.0011261388,0.20464388,0.10284775,0.25277707,0.02085799,0.41281924],"study_design_scores_gemma":[0.00044624507,0.00057564204,0.0004952846,0.0001166398,0.0000543404,0.0006774078,0.00017259677,0.74732465,0.045489866,0.15339506,0.051053025,0.00019923331],"about_ca_topic_score_codex":0.0019316402,"about_ca_topic_score_gemma":0.0018876627,"teacher_disagreement_score":0.0047393683,"about_ca_system_score_codex":0.00070250104,"about_ca_system_score_gemma":0.0015454451,"threshold_uncertainty_score":0.015854776},"labels":[],"label_agreement":null},{"id":"W4386736466","doi":"10.1109/tdsc.2023.3315457","title":"SwiftParade: Anti-Burst Multipath Validation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Network packet; Multipath propagation; Overhead (engineering); Computer network; Encryption; Network topology; Reliability (semiconductor); Distributed computing; Algorithm; Channel (broadcasting)","score_opus":0.018848902036462726,"score_gpt":0.2532331007049002,"score_spread":0.23438419866843746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386736466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08014449,0.0003332011,0.9020091,0.00023639815,0.00015138833,0.00027301404,0.00019489098,0.011023714,0.005633872],"genre_scores_gemma":[0.8067142,0.00024836455,0.18568683,0.0002552451,0.00007468773,0.0001911087,0.0005059718,0.00045224428,0.005871234],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797994,0.00043295725,0.00014116785,0.0002610069,0.00087760476,0.00030728919],"domain_scores_gemma":[0.9943509,0.0011659751,0.00058932404,0.0028749725,0.00088823214,0.00013055532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021588872,0.00055304763,0.0006208937,0.0008633857,0.0008049641,0.0011853944,0.0015831189,0.0009001653,0.0019808966],"category_scores_gemma":[0.0041716862,0.00039396636,0.0006179744,0.0005519129,0.0009360897,0.0032793777,0.002795021,0.001212253,0.0008137291],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025261932,0.0002806509,0.010487589,0.0005216958,0.00029584495,0.0009237306,0.0007792008,0.06047562,0.21081905,0.097234495,0.019793184,0.5958628],"study_design_scores_gemma":[0.00021654725,0.0008085177,0.0025403693,0.000086122585,0.00014804238,0.00228037,0.00020270642,0.58996487,0.32813472,0.03485359,0.04061654,0.00014758314],"about_ca_topic_score_codex":0.0006101793,"about_ca_topic_score_gemma":0.0006402847,"teacher_disagreement_score":0.0021588872,"about_ca_system_score_codex":0.0005410567,"about_ca_system_score_gemma":0.0014978005,"threshold_uncertainty_score":0.011417389},"labels":[],"label_agreement":null},{"id":"W4387010279","doi":"10.1109/tdsc.2023.3317806","title":"iCAT+: An Interactive Customizable Anonymization Tool Using Automated Translation Through Deep Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Usability; Artificial intelligence; Information retrieval; Convolutional neural network; Data mining; Human–computer interaction","score_opus":0.03981700160834613,"score_gpt":0.3062175476504594,"score_spread":0.2664005460421133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387010279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045262272,0.00006418392,0.88248116,0.0004007794,0.00011775365,0.00024562294,0.0017551963,0.10420548,0.0062036375],"genre_scores_gemma":[0.09820804,0.00025106614,0.8679471,0.0007219381,0.00006257319,0.0007115807,0.010245272,0.011000449,0.01085209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973284,0.0007450704,0.00027287196,0.00057803694,0.0008736001,0.00020205133],"domain_scores_gemma":[0.9966606,0.0010305804,0.00029171287,0.0015173166,0.00040282376,0.00009708654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023864724,0.0014708198,0.0006455606,0.0012252581,0.0007573907,0.0025328503,0.0029722957,0.0013536884,0.011494168],"category_scores_gemma":[0.008350446,0.000782556,0.0017868774,0.0012871014,0.0015403844,0.004614964,0.0041666855,0.002845854,0.004723426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008079753,0.00054428884,0.0027717145,0.000889413,0.00025881012,0.001152604,0.0017744555,0.06841717,0.030497449,0.13469137,0.16374902,0.59444565],"study_design_scores_gemma":[0.00013144559,0.00009883266,0.0005321455,0.00012206008,0.000060801645,0.0006261646,0.00027330738,0.63302636,0.055184636,0.08434478,0.22545116,0.00014834022],"about_ca_topic_score_codex":0.003894843,"about_ca_topic_score_gemma":0.0060251323,"teacher_disagreement_score":0.011494168,"about_ca_system_score_codex":0.0017658898,"about_ca_system_score_gemma":0.0022618275,"threshold_uncertainty_score":0.03845179},"labels":[],"label_agreement":null},{"id":"W4388407494","doi":"10.1109/tdsc.2023.3326299","title":"Data Protection: Privacy-Preserving Data Collection With Validation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data collection; Data mining; Protocol (science); Information privacy; Cluster analysis; Provisioning; Data modeling; Data transformation; Inference; Autoencoder; Computer security; Machine learning; Artificial intelligence; Database; Computer network; Deep learning; Data warehouse","score_opus":0.09132404626674043,"score_gpt":0.29774077192926796,"score_spread":0.20641672566252753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388407494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018801877,0.00030522663,0.9737032,0.0014588701,0.00013529645,0.00046819047,0.00029812535,0.002405245,0.0024240138],"genre_scores_gemma":[0.7491013,0.0004547987,0.24262911,0.0017354094,0.00021721733,0.0011777583,0.00089405366,0.0005595485,0.0032307762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9489848,0.018018639,0.005560709,0.00758715,0.017363848,0.0024848157],"domain_scores_gemma":[0.8350928,0.033913508,0.011322755,0.106007196,0.012045489,0.0016183845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026088053,0.0010615436,0.0018492733,0.0015446756,0.002409988,0.006212952,0.0053396435,0.0035571235,0.0018009518],"category_scores_gemma":[0.08484301,0.0011082471,0.0019659419,0.0022334538,0.006557055,0.016018186,0.012649176,0.0068759876,0.0014206553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029622861,0.0009404273,0.020456038,0.0012021695,0.00073703355,0.0017466476,0.0044960645,0.0865714,0.063486606,0.43798926,0.017058862,0.3623532],"study_design_scores_gemma":[0.0002940794,0.0007414044,0.0031392423,0.00048565277,0.0002431915,0.0028852301,0.0009442814,0.50114393,0.17797183,0.2624134,0.049430627,0.00030718814],"about_ca_topic_score_codex":0.0009158126,"about_ca_topic_score_gemma":0.00038464594,"teacher_disagreement_score":0.026088053,"about_ca_system_score_codex":0.0019639332,"about_ca_system_score_gemma":0.0056584273,"threshold_uncertainty_score":0.13796848},"labels":[],"label_agreement":null},{"id":"W4390818924","doi":"10.1109/tdsc.2024.3353548","title":"TrustGuard: GNN-Based Robust and Explainable Trust Evaluation With Dynamicity Support","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Snapshot (computer storage); Aggregate (composite); Graph; Visualization; Layer (electronics); Web of trust; Data mining; Artificial intelligence; Machine learning; Computational trust; Theoretical computer science; Reputation; Database","score_opus":0.01519607042946472,"score_gpt":0.24454544670838999,"score_spread":0.22934937627892527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390818924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033773176,0.00046921012,0.9590176,0.0005732671,0.00009226773,0.00014801514,0.00033126355,0.003780047,0.001815075],"genre_scores_gemma":[0.80313355,0.0003182661,0.19257627,0.0002642679,0.000054797358,0.00015552586,0.0009933608,0.0002765731,0.0022272847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980337,0.00063180184,0.00017118828,0.00044885735,0.0005571635,0.00015722623],"domain_scores_gemma":[0.9956039,0.0018354327,0.0006435191,0.0005819724,0.0010924505,0.00024263748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027479394,0.0012250778,0.00081999105,0.0009993288,0.00047170985,0.0012765129,0.001625884,0.0009933695,0.0017830009],"category_scores_gemma":[0.015450686,0.00043192622,0.00089019665,0.00069866533,0.0008855551,0.003436822,0.001974914,0.001733343,0.00034122262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060294865,0.00016618837,0.0075072926,0.00026237068,0.0001911569,0.0003812621,0.0005114078,0.70887643,0.005750738,0.02368207,0.008800458,0.24326767],"study_design_scores_gemma":[0.000007528433,0.000019672767,0.00019583768,0.0000069996527,0.000011612347,0.000016432918,0.000011820124,0.9928824,0.00058695587,0.005769276,0.00048447508,0.0000070994197],"about_ca_topic_score_codex":0.0151500385,"about_ca_topic_score_gemma":0.017375754,"teacher_disagreement_score":0.0151500385,"about_ca_system_score_codex":0.002441967,"about_ca_system_score_gemma":0.0017113114,"threshold_uncertainty_score":0.03012371},"labels":[],"label_agreement":null},{"id":"W4390871494","doi":"10.1109/tdsc.2024.3353827","title":"Privacy-Preserving Anomaly Detection of Encrypted Smart Contract for Blockchain-Based Data Trading","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Smart contract; Overhead (engineering); Database transaction; Code (set theory); Homomorphic encryption; Blockchain; Computer security; Data mining; Set (abstract data type); Database; Programming language","score_opus":0.025544119889675063,"score_gpt":0.2663804616594111,"score_spread":0.24083634176973603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390871494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19003037,0.00008903585,0.80663824,0.00027217792,0.000024594408,0.00011830821,0.00009324473,0.0013087679,0.0014252489],"genre_scores_gemma":[0.92320794,0.000049609203,0.07553059,0.00004598878,0.000010168451,0.00004716021,0.00010678923,0.000044797198,0.00095706806],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99708587,0.0006120234,0.0001983405,0.00048679166,0.0012960206,0.00032089165],"domain_scores_gemma":[0.9941924,0.002177193,0.00077228615,0.0017136369,0.0009369587,0.00020746727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015950645,0.00032309347,0.0006689385,0.0007109356,0.0007048008,0.0013028893,0.0012132874,0.00080536725,0.00072064943],"category_scores_gemma":[0.007665073,0.0002962623,0.0005529433,0.0006408866,0.0012407003,0.0027338306,0.0017481445,0.00095510605,0.00023784519],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018669971,0.0004306232,0.028728599,0.00024654952,0.00018557542,0.0017330747,0.0012442755,0.29302207,0.14230676,0.15553007,0.0031022232,0.3716032],"study_design_scores_gemma":[0.000021708898,0.000055132143,0.00062362605,0.0000057139364,0.000013560009,0.00021130481,0.000035582714,0.9430889,0.034977064,0.020228896,0.000720792,0.000017783292],"about_ca_topic_score_codex":0.0011678721,"about_ca_topic_score_gemma":0.00088072155,"teacher_disagreement_score":0.0015950645,"about_ca_system_score_codex":0.0008330787,"about_ca_system_score_gemma":0.0016730959,"threshold_uncertainty_score":0.008435607},"labels":[],"label_agreement":null},{"id":"W4391620895","doi":"10.1109/tdsc.2024.3363507","title":"Data Poisoning Attacks and Defenses to LDP-Based Privacy-Preserving Crowdsensing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Xiangtan University; National Natural Science Foundation of China","keywords":"Computer science; Differential privacy; Crowdsensing; Computer security; Minification; Identification (biology); Optimization problem; Data mining; Algorithm","score_opus":0.03444357905367922,"score_gpt":0.28811418574858044,"score_spread":0.2536706066949012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391620895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022360783,0.00036273472,0.9739644,0.00066604186,0.000048246828,0.0001400346,0.000050255243,0.00035519843,0.0020523635],"genre_scores_gemma":[0.91730094,0.0002692872,0.07973913,0.00038399195,0.00005169934,0.00019070735,0.00006898483,0.000043495413,0.0019516804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942449,0.0021719376,0.00027069397,0.0010884656,0.0017710566,0.00045290403],"domain_scores_gemma":[0.99278635,0.0034779003,0.0010454922,0.0017631648,0.00065890595,0.00026815658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033186232,0.0010543504,0.0013128007,0.00082804763,0.0011304385,0.0016492939,0.002224158,0.0021129288,0.0007773819],"category_scores_gemma":[0.012919177,0.00049612316,0.0010243962,0.0008720068,0.002930589,0.0026741566,0.005427906,0.0020271412,0.00027500026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004701938,0.00024489962,0.004248216,0.00047707406,0.00026789826,0.000829151,0.00091309095,0.7159024,0.03232454,0.10953317,0.003003032,0.13178627],"study_design_scores_gemma":[0.000024970741,0.00013269777,0.00035514316,0.000023487904,0.000022391998,0.00023972747,0.000103882456,0.9506754,0.007565009,0.038375743,0.0024570012,0.000024467361],"about_ca_topic_score_codex":0.0010568977,"about_ca_topic_score_gemma":0.00067499734,"teacher_disagreement_score":0.0033186232,"about_ca_system_score_codex":0.0014249784,"about_ca_system_score_gemma":0.0015424907,"threshold_uncertainty_score":0.017550766},"labels":[],"label_agreement":null},{"id":"W4392406098","doi":"10.1109/tdsc.2024.3372848","title":"Refereed Delegation of Computation Using Smart Contracts","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delegation; Computer science; Computation; Computer security; Programming language","score_opus":0.01964615092891232,"score_gpt":0.2650183053213561,"score_spread":0.2453721543924438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392406098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027288951,0.00019442916,0.9565173,0.00076314574,0.00011166874,0.00024755145,0.00008804926,0.00076807605,0.01402084],"genre_scores_gemma":[0.8125725,0.0003117779,0.17232147,0.00033746,0.000115710965,0.0004254382,0.00013748855,0.00018104927,0.013597019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9912583,0.003103534,0.0007336668,0.0012781972,0.0027370832,0.0008891476],"domain_scores_gemma":[0.98669726,0.00350185,0.0008818363,0.0074752383,0.0010001905,0.0004436245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006535899,0.0007290053,0.0010478527,0.0008194267,0.0016751328,0.0033666159,0.0024112046,0.001977444,0.0053206882],"category_scores_gemma":[0.015710153,0.0005253226,0.0012984743,0.0012096525,0.004044121,0.008225604,0.006543699,0.002424055,0.001136675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023047149,0.00007484363,0.00052627217,0.0001158509,0.000044253058,0.0003583746,0.0006029259,0.02311367,0.0058316244,0.9315614,0.0017517996,0.03578852],"study_design_scores_gemma":[0.000121283454,0.00015811557,0.00028752277,0.0000661718,0.000051932606,0.00046133576,0.0001837918,0.21455996,0.027367305,0.7272295,0.029422086,0.00009100541],"about_ca_topic_score_codex":0.0014997049,"about_ca_topic_score_gemma":0.0009618116,"teacher_disagreement_score":0.006535899,"about_ca_system_score_codex":0.00216481,"about_ca_system_score_gemma":0.002421075,"threshold_uncertainty_score":0.034565568},"labels":[],"label_agreement":null},{"id":"W4392477550","doi":"10.1109/tdsc.2024.3372634","title":"FedDMC: Efficient and Robust Federated Learning via Detecting Malicious Clients","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"HIV, Drug Use, Sexual Risk","field":"Medicine","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Key Research and Development Projects of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Cluster analysis; Data mining; Machine learning; Artificial intelligence; Benchmark (surveying)","score_opus":0.026077161708309052,"score_gpt":0.2941516083026139,"score_spread":0.26807444659430485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392477550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0375364,0.00045464028,0.94754606,0.0003987324,0.00008880443,0.00017501386,0.00023406158,0.012576609,0.0009897398],"genre_scores_gemma":[0.72798556,0.00019733816,0.2673489,0.0006402311,0.000071665534,0.00027467622,0.0011513153,0.00034891584,0.0019814454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618477,0.0008947476,0.00026198602,0.0011338415,0.0011242381,0.00040040325],"domain_scores_gemma":[0.99212086,0.0022057146,0.0006601947,0.0028976738,0.001786796,0.00032880149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005198398,0.0017706319,0.0025344926,0.0017226198,0.0012000118,0.0019980844,0.004845531,0.0022291893,0.0009689097],"category_scores_gemma":[0.01636167,0.00068142405,0.0010979678,0.0014468877,0.0015657829,0.0036675956,0.004126717,0.0026024315,0.0007065689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000521548,0.00062846596,0.008936196,0.00015015955,0.00027424816,0.0002597659,0.00017224006,0.54841065,0.006127781,0.006225695,0.010258603,0.41803473],"study_design_scores_gemma":[0.000013858981,0.000029890556,0.00020108173,0.0000048227384,0.000008934745,0.000040585994,0.000011947451,0.9941614,0.0018886451,0.0032507435,0.00037757627,0.0000104910705],"about_ca_topic_score_codex":0.008005758,"about_ca_topic_score_gemma":0.006723776,"teacher_disagreement_score":0.008005758,"about_ca_system_score_codex":0.00183743,"about_ca_system_score_gemma":0.0036769104,"threshold_uncertainty_score":0.027492106},"labels":[],"label_agreement":null},{"id":"W4392908482","doi":"10.1109/tdsc.2024.3376084","title":"Achieving Practical and Privacy-Preserving kNN Query Over Encrypted Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Information privacy; Query optimization; Data mining; Computer security","score_opus":0.038100542285316945,"score_gpt":0.31124048703686114,"score_spread":0.2731399447515442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392908482","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045723263,0.0014466401,0.9326158,0.00230912,0.0002882895,0.00034626923,0.0033076631,0.0027014958,0.011261487],"genre_scores_gemma":[0.7483432,0.0014562935,0.23020045,0.0013106083,0.00033782667,0.00031169428,0.0051886956,0.00038238414,0.012468823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345666,0.0010359421,0.0005901061,0.0011471466,0.0027620473,0.0010080643],"domain_scores_gemma":[0.9947732,0.0014559397,0.00034255482,0.0024577633,0.00083579926,0.00013470757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025710869,0.0011326607,0.0018979252,0.0010270195,0.0017201,0.002924768,0.0021201435,0.0020708002,0.005157861],"category_scores_gemma":[0.011266159,0.0005582934,0.0010639436,0.002909246,0.0014144374,0.0078086182,0.0054617636,0.0022025441,0.0033765147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028181265,0.00069983664,0.004911692,0.0012246759,0.0003455596,0.0017099452,0.0013825997,0.26876774,0.046552807,0.18468149,0.07523421,0.41167125],"study_design_scores_gemma":[0.00011690899,0.0001770243,0.0006881628,0.000050425362,0.000047946283,0.0010856852,0.0006516314,0.80444235,0.022123387,0.15769772,0.012848968,0.00006987369],"about_ca_topic_score_codex":0.0038628532,"about_ca_topic_score_gemma":0.0045450265,"teacher_disagreement_score":0.005157861,"about_ca_system_score_codex":0.0017161383,"about_ca_system_score_gemma":0.0029483752,"threshold_uncertainty_score":0.01725477},"labels":[],"label_agreement":null},{"id":"W4394939057","doi":"10.1109/tdsc.2024.3387570","title":"Fast Generation-Based Gradient Leakage Attacks: An Approach to Generate Training Data Directly From the Gradient","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Leakage (economics); Artificial intelligence","score_opus":0.07632921568485775,"score_gpt":0.2941784633937752,"score_spread":0.21784924770891745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394939057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014082928,0.00020426542,0.9825068,0.0002874068,0.000049465576,0.00008277552,0.00005994086,0.0017576023,0.0009688004],"genre_scores_gemma":[0.6918677,0.00022787982,0.30356616,0.0006134417,0.00008218732,0.00022795764,0.0002025333,0.00027287146,0.0029392957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981832,0.00068720896,0.0001045287,0.0003087481,0.0005610099,0.00015532381],"domain_scores_gemma":[0.9962794,0.001530012,0.00032223007,0.0015407559,0.00023452038,0.00009301224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022302298,0.00084309455,0.0007539209,0.0005933054,0.0004552567,0.00092861184,0.0013395267,0.0012327243,0.001634201],"category_scores_gemma":[0.008360189,0.00041568174,0.000740921,0.0005290028,0.0014761209,0.0023059477,0.0028074007,0.0022799356,0.0007293681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014246344,0.0004204602,0.0027421685,0.00023389437,0.00021044463,0.0003783696,0.0003898736,0.36092123,0.06731509,0.074540555,0.010129569,0.48129362],"study_design_scores_gemma":[0.00005631105,0.00016733972,0.00028992267,0.000019846486,0.000014728642,0.00028203524,0.000021336118,0.9405844,0.031231165,0.023977088,0.0033273639,0.00002837163],"about_ca_topic_score_codex":0.00045945588,"about_ca_topic_score_gemma":0.00048438204,"teacher_disagreement_score":0.0022302298,"about_ca_system_score_codex":0.00055795506,"about_ca_system_score_gemma":0.0009233596,"threshold_uncertainty_score":0.011794686},"labels":[],"label_agreement":null},{"id":"W4395017388","doi":"10.1109/tdsc.2024.3392424","title":"MaskCrypt: Federated Learning With Selective Homomorphic Encryption","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Computer security; Theoretical computer science","score_opus":0.008515883368515574,"score_gpt":0.21966704186343017,"score_spread":0.2111511584949146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395017388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016845148,0.00024357771,0.97369564,0.0005744072,0.00009555347,0.00015849255,0.00023934511,0.004963645,0.0031840785],"genre_scores_gemma":[0.7069952,0.0003060359,0.28416017,0.0007704866,0.000115506096,0.0002762433,0.0006133965,0.00022189472,0.006541077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700075,0.0009060703,0.00023169465,0.00045339172,0.001008585,0.00039949853],"domain_scores_gemma":[0.9956564,0.0009678212,0.00032394045,0.0025331357,0.0003533808,0.00016540826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032334817,0.0006483377,0.0009361967,0.00085790927,0.00076042925,0.0018170244,0.0025403777,0.0017618638,0.003375446],"category_scores_gemma":[0.0069557936,0.0004102965,0.0008772998,0.0010105984,0.0016048363,0.0061797565,0.003646082,0.0021736876,0.0011659025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017254686,0.00075711985,0.00240464,0.00029083854,0.00018617802,0.0005744578,0.00029396423,0.17772469,0.02155549,0.3116611,0.027213233,0.45561284],"study_design_scores_gemma":[0.00012200244,0.00022652569,0.0002868227,0.000029429828,0.000022940529,0.00035286858,0.00003263997,0.81781435,0.022317419,0.15003818,0.008713149,0.000043723703],"about_ca_topic_score_codex":0.00093186233,"about_ca_topic_score_gemma":0.0009160305,"teacher_disagreement_score":0.003375446,"about_ca_system_score_codex":0.0010224311,"about_ca_system_score_gemma":0.0022175405,"threshold_uncertainty_score":0.017100453},"labels":[],"label_agreement":null},{"id":"W4396982365","doi":"10.1109/tdsc.2024.3401836","title":"A Differentially Private Approach for Budgeted Combinatorial Multi-Armed Bandits","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Mathematical economics; Operations research; Economics; Mathematics","score_opus":0.08362743912680343,"score_gpt":0.38310144994046785,"score_spread":0.2994740108136644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396982365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009901292,0.00046689724,0.984624,0.00088093977,0.00007927504,0.00012258961,0.00019890346,0.00026620767,0.003459872],"genre_scores_gemma":[0.789478,0.0012697475,0.19952027,0.0010481963,0.00031543055,0.0007416165,0.0003615053,0.0002470312,0.0070181764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99276614,0.004127656,0.0002960524,0.00096024125,0.0012197014,0.00063012546],"domain_scores_gemma":[0.98082596,0.014077424,0.0016619932,0.002132429,0.0007273376,0.00057493505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008604017,0.0020653985,0.0026257157,0.0010396393,0.0009766718,0.0035271975,0.003538508,0.0029221796,0.00503012],"category_scores_gemma":[0.030869713,0.0010424793,0.0014324446,0.001934621,0.0031191423,0.0047225296,0.0033626857,0.005270358,0.0009804855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054655405,0.00018871675,0.0007970909,0.0002403996,0.000120804514,0.00023682983,0.00020966018,0.69422907,0.0024519812,0.26280382,0.003242824,0.03493227],"study_design_scores_gemma":[0.000060622922,0.00007217835,0.0000986117,0.00004546322,0.000022957982,0.0000647917,0.000021401886,0.8534988,0.0007902019,0.1440376,0.0012616551,0.000025675456],"about_ca_topic_score_codex":0.0013229684,"about_ca_topic_score_gemma":0.0010888485,"teacher_disagreement_score":0.008604017,"about_ca_system_score_codex":0.0030416066,"about_ca_system_score_gemma":0.0026909886,"threshold_uncertainty_score":0.04550296},"labels":[],"label_agreement":null},{"id":"W4399146398","doi":"10.1109/tdsc.2024.3406703","title":"RZDD: Risk Zone-Diversified Network Design for Disaster Resilience","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Resilience (materials science); Business; Risk analysis (engineering); Computer science; Environmental resource management; Environmental science; Materials science","score_opus":0.08847330681773843,"score_gpt":0.33946825770511513,"score_spread":0.25099495088737667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399146398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013657298,0.00020425822,0.9829285,0.00015250963,0.000035289137,0.00008025236,0.000073072064,0.000283195,0.0025854944],"genre_scores_gemma":[0.5462777,0.00038332838,0.44900972,0.00015036846,0.000035975,0.0002492865,0.000261566,0.000115823896,0.0035161518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.00020337371,0.000032242508,0.00010848045,0.00017804177,0.00008971502],"domain_scores_gemma":[0.99931467,0.0002286049,0.00012721171,0.00011077987,0.00015335971,0.000065404834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009730625,0.0010155791,0.00057692645,0.0007526729,0.00050764065,0.0007752709,0.001477466,0.0006624761,0.0031140537],"category_scores_gemma":[0.002006036,0.00037071828,0.0005350556,0.000560297,0.0005901502,0.0012013179,0.0016306784,0.00088496093,0.00045929695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095685755,0.000052378644,0.00075455103,0.0001299327,0.000041821986,0.00013571224,0.0000929296,0.8681576,0.0075720353,0.018665675,0.0029089395,0.10139275],"study_design_scores_gemma":[0.000022888033,0.00013835511,0.00017138626,0.00002413307,0.000021067635,0.00019626252,0.0000560671,0.97271514,0.0036554488,0.017400604,0.0055834143,0.000015151918],"about_ca_topic_score_codex":0.0013107274,"about_ca_topic_score_gemma":0.0021306046,"teacher_disagreement_score":0.0031140537,"about_ca_system_score_codex":0.00096907216,"about_ca_system_score_gemma":0.0009616768,"threshold_uncertainty_score":0.010417521},"labels":[],"label_agreement":null},{"id":"W4399339292","doi":"10.1109/tdsc.2024.3408816","title":"Efficient and Privacy-Preserving Weighted Range Set Sampling in Cloud","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Range (aeronautics); Computer science; Cloud computing; Set (abstract data type); Privacy protection; Mathematics; Computer security; Engineering","score_opus":0.021307218232329363,"score_gpt":0.27278505826806154,"score_spread":0.2514778400357322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399339292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031835746,0.00019871225,0.9654816,0.00025170203,0.000026656866,0.00012784441,0.0001838014,0.00040864546,0.0014852708],"genre_scores_gemma":[0.74137825,0.00030177215,0.25520727,0.00023677354,0.00006351662,0.00028236894,0.0004106111,0.000082291444,0.0020371631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932673,0.0019731435,0.00042728422,0.0010505063,0.0026128753,0.00066880987],"domain_scores_gemma":[0.9910495,0.0036855643,0.00078884634,0.0032965255,0.00084514637,0.00033438287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003701985,0.000522968,0.0014877787,0.00092232204,0.0012923632,0.0018730325,0.0026245147,0.001153482,0.0014304012],"category_scores_gemma":[0.011497934,0.00044975255,0.001187371,0.0024929377,0.0014967852,0.0048339316,0.0042274804,0.001745748,0.0005235725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015778731,0.00030202878,0.0052929833,0.0002804368,0.00017320878,0.00067193015,0.0010625788,0.3439281,0.0323184,0.24889892,0.0052799834,0.36021358],"study_design_scores_gemma":[0.00007157388,0.00014042796,0.00052841066,0.000018817098,0.000027067412,0.0003823338,0.00013931615,0.879367,0.013154919,0.10269481,0.0034331486,0.00004222279],"about_ca_topic_score_codex":0.0015474829,"about_ca_topic_score_gemma":0.0012242665,"teacher_disagreement_score":0.003701985,"about_ca_system_score_codex":0.0013039856,"about_ca_system_score_gemma":0.0019798288,"threshold_uncertainty_score":0.019578218},"labels":[],"label_agreement":null},{"id":"W4399407374","doi":"10.1109/tdsc.2024.3410695","title":"Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler With Realizations","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blockchain; Signature (topology); Key (lock); Compiler; Computer science; Digital signature; Computer security; Programming language; Mathematics; Hash function","score_opus":0.014417922933018117,"score_gpt":0.2550492858964252,"score_spread":0.24063136296340712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399407374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09356582,0.00018475694,0.8957999,0.0005948491,0.00008009576,0.00013186592,0.00014943647,0.0005579392,0.008935379],"genre_scores_gemma":[0.83786744,0.00018335046,0.15473424,0.00011004371,0.000074118514,0.00019277591,0.00017424757,0.00015159465,0.0065122866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853253,0.00039607115,0.00008365678,0.00023054711,0.0005385879,0.0002185057],"domain_scores_gemma":[0.99786395,0.00075535994,0.00023012528,0.0005781833,0.00033842554,0.00023396958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398986,0.00034449322,0.00076835847,0.0005298816,0.0011731286,0.0020348604,0.0007226704,0.00097121747,0.0022537916],"category_scores_gemma":[0.0041210516,0.00028518357,0.00074572937,0.00084245764,0.0026784893,0.0029909387,0.0025287636,0.0020188834,0.00067418633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377676,0.00004723871,0.00026659027,0.00005041105,0.000010221389,0.00014228512,0.00027445404,0.033050153,0.0030589995,0.9480693,0.00082805025,0.014018537],"study_design_scores_gemma":[0.00007126178,0.000106476036,0.00012213385,0.000025383399,0.000016549333,0.000105380175,0.00006392807,0.30885264,0.0063962224,0.6782064,0.0059873303,0.00004631356],"about_ca_topic_score_codex":0.0009222812,"about_ca_topic_score_gemma":0.0008877876,"teacher_disagreement_score":0.0022537916,"about_ca_system_score_codex":0.0014992459,"about_ca_system_score_gemma":0.0019380933,"threshold_uncertainty_score":0.010877848},"labels":[],"label_agreement":null},{"id":"W4400112242","doi":"10.1109/tdsc.2024.3420712","title":"PerfSPEC: Performance Profiling-Based Proactive Security Policy Enforcement for Containers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Profiling (computer programming); Enforcement; Computer security; Security policy; Business; Computer science; Political science; Law; Operating system","score_opus":0.012232800809437085,"score_gpt":0.2579279129151216,"score_spread":0.24569511210568454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400112242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14010856,0.001300584,0.5470066,0.00082641415,0.0006553135,0.00079805934,0.0011593333,0.29931542,0.008829669],"genre_scores_gemma":[0.84324694,0.00038764943,0.14595845,0.00051637884,0.00012556373,0.00023288898,0.002088372,0.003986007,0.0034577283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572587,0.0008706945,0.00038793773,0.00077772234,0.0015879294,0.0006497909],"domain_scores_gemma":[0.99154717,0.0016331009,0.0012691824,0.003553778,0.0015181139,0.00047876613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056484,0.002316284,0.0008110911,0.0014874529,0.00086860976,0.002194756,0.0020685832,0.0008270753,0.0019560189],"category_scores_gemma":[0.01104057,0.0008394171,0.0006423536,0.0007119638,0.00084163446,0.0027212002,0.0019812041,0.0020683373,0.0015791865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024772636,0.0013953405,0.04482619,0.0007219861,0.00031469247,0.00074634503,0.00080947566,0.093090594,0.14513256,0.011703839,0.08737004,0.61141175],"study_design_scores_gemma":[0.00008378376,0.0004887555,0.007821484,0.000072776485,0.00006117493,0.00037911328,0.00015983482,0.8651288,0.0978774,0.004245618,0.02348938,0.00019192931],"about_ca_topic_score_codex":0.0030391004,"about_ca_topic_score_gemma":0.0027930178,"teacher_disagreement_score":0.003056484,"about_ca_system_score_codex":0.0010120991,"about_ca_system_score_gemma":0.0023642224,"threshold_uncertainty_score":0.016164422},"labels":[],"label_agreement":null},{"id":"W4400903658","doi":"10.1109/tdsc.2024.3432650","title":"Privacy-Preserving Fine-Grained Data Sharing With Dynamic Service for the Cloud-Edge IoT","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Internet of Things; Enhanced Data Rates for GSM Evolution; Information privacy; Edge computing; Computer security; Data sharing; Service (business); Computer network; Telecommunications; Operating system; Business","score_opus":0.047341628528391355,"score_gpt":0.2973497996101303,"score_spread":0.25000817108173895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400903658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054666284,0.0004006187,0.9414691,0.00038607142,0.00007156173,0.00011348368,0.00010643404,0.00040132826,0.002385169],"genre_scores_gemma":[0.9411832,0.00018005748,0.057288412,0.00012455031,0.000034429224,0.000054290547,0.00009933235,0.00002499289,0.0010106607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766207,0.00046218166,0.000200724,0.00038643397,0.00085698074,0.00043152767],"domain_scores_gemma":[0.99777824,0.00043386596,0.00024959145,0.0010995239,0.00027801114,0.00016089222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015034713,0.00038263644,0.00076812383,0.0004332906,0.0012298627,0.0014866487,0.0014860139,0.0007060718,0.0010259022],"category_scores_gemma":[0.0028946234,0.00020743207,0.0007605699,0.0012303202,0.0011731626,0.00392075,0.0033002463,0.0011388237,0.00029574105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014260141,0.00040021937,0.0032318204,0.00034100385,0.0001398159,0.00091175025,0.0010374448,0.25201204,0.09670109,0.43850437,0.0066745137,0.1986199],"study_design_scores_gemma":[0.000052509058,0.00017209571,0.0004888461,0.000015202108,0.000031199845,0.00057873526,0.00014736279,0.8959001,0.017470151,0.07732972,0.0077481233,0.00006595307],"about_ca_topic_score_codex":0.0014775863,"about_ca_topic_score_gemma":0.0010950946,"teacher_disagreement_score":0.0015034713,"about_ca_system_score_codex":0.0012534299,"about_ca_system_score_gemma":0.0016726872,"threshold_uncertainty_score":0.009094298},"labels":[],"label_agreement":null},{"id":"W4402159510","doi":"10.1109/tdsc.2024.3446587","title":"PulseAnomaly: Unsupervised Anomaly Detection on Avionic Platforms With Seasonality and Trend Modeling in Transformer Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"Innovation for Defence Excellence and Security","keywords":"Anomaly detection; Avionics; Computer science; Anomaly (physics); Transformer; Data mining; Electrical engineering; Engineering","score_opus":0.014893546637415612,"score_gpt":0.22876703060585732,"score_spread":0.21387348396844172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402159510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24368769,0.0004346896,0.7461841,0.00036921934,0.00008947703,0.00013352295,0.0013195609,0.006417894,0.0013637483],"genre_scores_gemma":[0.87112874,0.00025302533,0.12251795,0.00010007169,0.000085600506,0.000113668815,0.003266469,0.00018343775,0.0023511164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.00008375665,0.000018553492,0.00010025448,0.00006786314,0.00003554358],"domain_scores_gemma":[0.9991522,0.0004952054,0.000115881776,0.000074263204,0.00012475996,0.000037777878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007972927,0.0008760239,0.0005953461,0.0011005601,0.00025228556,0.00049363344,0.001235861,0.0004943539,0.00058970856],"category_scores_gemma":[0.0022088995,0.00026295538,0.00060722,0.00067268935,0.00025974796,0.00084119866,0.0006352766,0.00085306197,0.00029820995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003589926,0.00025876076,0.017593857,0.000074507705,0.000187762,0.00016205125,0.000081493345,0.7663964,0.004136622,0.0019623607,0.0039122943,0.2048749],"study_design_scores_gemma":[0.0000023403622,0.000011395974,0.0004581198,9.109691e-7,0.0000029048774,0.000012285471,0.0000029436803,0.9986462,0.00037286882,0.00034232016,0.0001457133,0.000002014285],"about_ca_topic_score_codex":0.012566381,"about_ca_topic_score_gemma":0.01570269,"teacher_disagreement_score":0.012566381,"about_ca_system_score_codex":0.00069591723,"about_ca_system_score_gemma":0.0006287058,"threshold_uncertainty_score":0.024986506},"labels":[],"label_agreement":null},{"id":"W4402215600","doi":"10.1109/tdsc.2024.3451129","title":"An Attack Exploiting Cyber-Arm Industry","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security","score_opus":0.03578073123567247,"score_gpt":0.32940739890863996,"score_spread":0.29362666767296747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402215600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137093,0.001000525,0.40499976,0.0034305728,0.00017486287,0.0002446867,0.00028807807,0.00038682122,0.075765386],"genre_scores_gemma":[0.98802817,0.00038195818,0.0076510515,0.00009583668,0.000021992168,0.00004265188,0.000045905083,0.000009485379,0.0037229352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954337,0.00014336608,0.000015211698,0.000087335065,0.000120367324,0.00009028277],"domain_scores_gemma":[0.99921966,0.00032521514,0.0002118604,0.00009796004,0.00008452684,0.000060717433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610444,0.000545028,0.00035496405,0.00066600123,0.00059422845,0.0013861286,0.00057359476,0.001454842,0.0025301303],"category_scores_gemma":[0.0014173627,0.00017953345,0.00062111096,0.00034346155,0.0011158951,0.0026117233,0.0013574893,0.0010655172,0.00026468668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017942529,0.0002325438,0.013063163,0.00020042705,0.000057032194,0.0013659182,0.00054897246,0.39663243,0.012225842,0.5361728,0.0036627145,0.035658725],"study_design_scores_gemma":[0.00001462932,0.00024538845,0.0026675418,0.000055186367,0.000021007918,0.000489816,0.0003215045,0.93437535,0.002269301,0.054437198,0.0050650653,0.000038098588],"about_ca_topic_score_codex":0.0034479515,"about_ca_topic_score_gemma":0.0021853612,"teacher_disagreement_score":0.0034479515,"about_ca_system_score_codex":0.0009593305,"about_ca_system_score_gemma":0.00072898174,"threshold_uncertainty_score":0.008464098},"labels":[],"label_agreement":null},{"id":"W4402215618","doi":"10.1109/tdsc.2024.3454573","title":"Internet-Wide Analysis, Characterization, and Family Attribution of IoT Malware: A Comprehensive Longitudinal Study","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; National Science Foundation","keywords":"Computer science; Malware; Internet of Things; Attribution; Computer security; The Internet; World Wide Web; Psychology","score_opus":0.027617736524223398,"score_gpt":0.27671401672694035,"score_spread":0.24909628020271696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402215618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99791163,0.00014668837,0.00064960454,0.00008679005,0.0000073655337,0.000038133927,0.00071994937,0.000010216215,0.00042957556],"genre_scores_gemma":[0.9972709,0.00017102234,0.0005380154,0.000053742613,0.000014201642,0.000062926476,0.0012777513,0.000011580822,0.0005999964],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992569,0.00020283028,0.000060911843,0.0001938675,0.00017007155,0.00011535977],"domain_scores_gemma":[0.99315876,0.0012134438,0.0026643495,0.00093562173,0.0012925267,0.000735344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019804058,0.00026168735,0.00027139334,0.0013521886,0.00096115377,0.00094465236,0.00037699082,0.00051496294,0.0013217655],"category_scores_gemma":[0.0071177445,0.00023251896,0.000360383,0.00074235647,0.0004429792,0.0014945655,0.0010608182,0.0011283192,0.00074585807],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004795843,0.00025706177,0.9909161,0.000011111759,0.000042148316,0.000111392976,0.0008950309,0.000115447016,0.00025028092,0.0001100403,0.00063898065,0.0066044866],"study_design_scores_gemma":[0.0000030432295,0.0002603196,0.9929437,0.000038856535,0.00003901788,0.0006181202,0.001794623,0.001605429,0.00040639655,0.00023271737,0.0020358283,0.00002199531],"about_ca_topic_score_codex":0.0033391945,"about_ca_topic_score_gemma":0.004312384,"teacher_disagreement_score":0.0033391945,"about_ca_system_score_codex":0.00038447985,"about_ca_system_score_gemma":0.00044353312,"threshold_uncertainty_score":0.010473549},"labels":[],"label_agreement":null},{"id":"W4402434901","doi":"10.1109/tdsc.2024.3454421","title":"uBOX: A Lightweight and Hardware-Assisted Sandbox for Multicore Embedded Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Sandbox (software development); Computer science; Multi-core processor; Embedded system; Operating system; Computer architecture; Parallel computing; Computer hardware","score_opus":0.0230209657664218,"score_gpt":0.270867056579438,"score_spread":0.2478460908130162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402434901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050017584,0.0013758492,0.8165009,0.00035072744,0.0004698552,0.0008003967,0.0006296295,0.116740935,0.013114074],"genre_scores_gemma":[0.4671418,0.0009892336,0.4717723,0.00065856386,0.00017748908,0.00087005453,0.002320587,0.0056819315,0.05038815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999086,0.00015602025,0.00007958254,0.000118583965,0.00041620596,0.00014361559],"domain_scores_gemma":[0.99878484,0.00024763192,0.00012678695,0.00041159007,0.00021658515,0.00021261733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009620283,0.0010497641,0.00070098165,0.0008341038,0.0008265001,0.0015343525,0.0024556373,0.00085247605,0.010865588],"category_scores_gemma":[0.0025099898,0.000712185,0.0004886739,0.00041373,0.0005096916,0.0027973745,0.0029229382,0.00093807763,0.0038902985],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003210194,0.000676123,0.005267768,0.0017443921,0.00029656372,0.0009989002,0.00078192353,0.04942133,0.12063239,0.053728346,0.12654114,0.63670087],"study_design_scores_gemma":[0.0004144527,0.00094619335,0.0028127683,0.00027290624,0.00019227833,0.00068913883,0.0002095612,0.45198303,0.17912614,0.022016017,0.34108058,0.00025685428],"about_ca_topic_score_codex":0.0018538303,"about_ca_topic_score_gemma":0.0025346978,"teacher_disagreement_score":0.010865588,"about_ca_system_score_codex":0.0009563859,"about_ca_system_score_gemma":0.0016877804,"threshold_uncertainty_score":0.03634906},"labels":[],"label_agreement":null},{"id":"W4402807503","doi":"10.1109/tdsc.2024.3449641","title":"NeuroYara: Learning to Rank for Yara Rules Generation Through Deep Language Modeling and Discriminative N-Gram Encoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discriminative model; n-gram; Computer science; Encoding (memory); Gram; Rank (graph theory); Artificial intelligence; Language model; Natural language processing; Mathematics","score_opus":0.024654335472194734,"score_gpt":0.2976123308965028,"score_spread":0.27295799542430804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402807503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027084006,0.00072839786,0.9451281,0.0003253325,0.00013398047,0.00017725423,0.0008469588,0.023835067,0.0017409885],"genre_scores_gemma":[0.29172048,0.0005652414,0.694317,0.00060487416,0.00014211582,0.00042427419,0.0045039603,0.0009940434,0.006728032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986958,0.00027552078,0.000119934135,0.00040067837,0.00036412198,0.00014407957],"domain_scores_gemma":[0.9974853,0.0010292036,0.00028943922,0.0004399216,0.00063498865,0.00012121363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424799,0.0016924653,0.0013744949,0.002163565,0.0006468235,0.0019347878,0.0026133547,0.0013605859,0.0030798668],"category_scores_gemma":[0.006230668,0.0006448138,0.0011203415,0.0011441164,0.0006557492,0.0025334118,0.0012510737,0.0023513932,0.003929606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035319716,0.00037716172,0.003253749,0.00020166767,0.000129039,0.00024571468,0.0001617123,0.09618541,0.014022971,0.006400487,0.014025599,0.8646433],"study_design_scores_gemma":[0.000016714506,0.0000713959,0.00023827294,0.000017040953,0.000016703307,0.000080231395,0.000024745235,0.98587555,0.0068672663,0.0050466806,0.0017237125,0.000021713804],"about_ca_topic_score_codex":0.0074434495,"about_ca_topic_score_gemma":0.014235789,"teacher_disagreement_score":0.0074434495,"about_ca_system_score_codex":0.0009652904,"about_ca_system_score_gemma":0.0019902892,"threshold_uncertainty_score":0.0148002505},"labels":[],"label_agreement":null},{"id":"W4403320271","doi":"10.1109/tdsc.2024.3478786","title":"Efficiency Boosting of Secure Cross-Platform Recommender Systems Over Sparse Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Computer science; Boosting (machine learning); Recommender system; Machine learning","score_opus":0.05323825191386969,"score_gpt":0.3131218753064908,"score_spread":0.25988362339262117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403320271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08281006,0.0016764622,0.9048772,0.0013898845,0.00016715594,0.00031897266,0.0005136078,0.001844242,0.0064025167],"genre_scores_gemma":[0.8996212,0.0006802723,0.094370514,0.00033255536,0.00016426691,0.00019263924,0.00047437317,0.0001245016,0.00403961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917393,0.0029912032,0.0004911214,0.0013970012,0.0023594315,0.0010219943],"domain_scores_gemma":[0.97946584,0.009538392,0.0014650864,0.0073780613,0.0015329722,0.0006196184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005355932,0.0015035486,0.002405971,0.000963872,0.0014193808,0.0024981867,0.0028011987,0.0020710328,0.0037028487],"category_scores_gemma":[0.021789707,0.0008818531,0.001265886,0.0014118992,0.0017040499,0.0058654747,0.006523896,0.0028391248,0.0020634849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027001002,0.00047078409,0.0058335788,0.0009357086,0.00050325703,0.00090807513,0.0009770263,0.44328564,0.034247123,0.21778297,0.013457483,0.27889824],"study_design_scores_gemma":[0.000093500836,0.00018643124,0.00048232023,0.00003629207,0.000048942533,0.000346514,0.00009346036,0.94272846,0.007840733,0.045811936,0.002281201,0.000050220468],"about_ca_topic_score_codex":0.0014900905,"about_ca_topic_score_gemma":0.001477039,"teacher_disagreement_score":0.005355932,"about_ca_system_score_codex":0.0014704424,"about_ca_system_score_gemma":0.0027372402,"threshold_uncertainty_score":0.02832526},"labels":[],"label_agreement":null},{"id":"W4405717542","doi":"10.1109/tdsc.2024.3521451","title":"Feature Reconstruction Attacks and Countermeasures of DNN Training in Vertical Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Training (meteorology); Feature (linguistics); Computer security; Feature extraction; Artificial intelligence; Multimedia","score_opus":0.015035523475006769,"score_gpt":0.2595993449859744,"score_spread":0.24456382151096764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30285293,0.00082903163,0.67774653,0.0034622108,0.00034326885,0.00020425339,0.00027023535,0.005666632,0.008624846],"genre_scores_gemma":[0.9534712,0.00008015703,0.04460492,0.00034455652,0.000034152585,0.000049743012,0.00015695751,0.00004713708,0.0012111457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954482,0.0013909953,0.00033218422,0.0008468831,0.001356075,0.0006257198],"domain_scores_gemma":[0.9898974,0.0043559964,0.00081639655,0.003697295,0.00090230716,0.00033073887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047435695,0.0009153216,0.000899869,0.0010232438,0.00094688573,0.0012428523,0.0017868078,0.0022141659,0.0014390429],"category_scores_gemma":[0.020204332,0.0004808128,0.0006310729,0.0006927734,0.0016363957,0.0036043103,0.0031752188,0.0028188697,0.00043562392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030257273,0.00062790356,0.010657373,0.00018181426,0.00025405138,0.0006592452,0.00036300573,0.43211964,0.019601198,0.05819125,0.009389519,0.4649293],"study_design_scores_gemma":[0.000032979773,0.00012201278,0.00074629206,0.000026595972,0.000017261578,0.00014213815,0.00004624617,0.9706654,0.009585309,0.017709078,0.00089276925,0.000013944911],"about_ca_topic_score_codex":0.002064516,"about_ca_topic_score_gemma":0.0017297585,"teacher_disagreement_score":0.0047435695,"about_ca_system_score_codex":0.0016652707,"about_ca_system_score_gemma":0.0017282557,"threshold_uncertainty_score":0.0250867},"labels":[],"label_agreement":null},{"id":"W4405717558","doi":"10.1109/tdsc.2024.3521396","title":"Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Computer security; Cryptography","score_opus":0.011976739952560052,"score_gpt":0.24859856098935149,"score_spread":0.23662182103679144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04395411,0.0003777078,0.94549876,0.0003225617,0.00007568924,0.00023322731,0.0006085451,0.0028799088,0.006049431],"genre_scores_gemma":[0.6891082,0.00041713272,0.30255058,0.00014643588,0.000040898445,0.0002501973,0.0010835201,0.00016675008,0.0062362454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889416,0.00016709638,0.00010090131,0.00018906822,0.00041610503,0.00023276445],"domain_scores_gemma":[0.9983663,0.00031820734,0.00015528714,0.00081542373,0.00026165886,0.000083063744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046932756,0.0007747831,0.00096730987,0.0004968449,0.00086366874,0.0013039378,0.0015084529,0.00075091585,0.0025827535],"category_scores_gemma":[0.0029285944,0.00029685604,0.0005345728,0.00087731227,0.0007902454,0.0028237847,0.004166163,0.0011486356,0.0011844034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096095813,0.00020200912,0.0036375292,0.00065344153,0.00010680164,0.00058403297,0.0009378189,0.42302415,0.043791223,0.12104136,0.017501084,0.38755953],"study_design_scores_gemma":[0.000037114565,0.00012827423,0.0004537276,0.000032644595,0.00002097635,0.00028747812,0.00021890443,0.9443849,0.01674988,0.027585566,0.010055541,0.00004498587],"about_ca_topic_score_codex":0.0040240716,"about_ca_topic_score_gemma":0.0070545175,"teacher_disagreement_score":0.0040240716,"about_ca_system_score_codex":0.00093889394,"about_ca_system_score_gemma":0.0025023024,"threshold_uncertainty_score":0.00864017},"labels":[],"label_agreement":null},{"id":"W4405844668","doi":"10.1109/tdsc.2024.3523561","title":"Blockchain-Enabled Secure Offloading for VEC: A Multi-Agent Reinforcement Learning Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Info-communications Media Development Authority; National Natural Science Foundation of China; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Blockchain; Computer science; Reinforcement learning; Distributed computing; Computer network; Computer security; Artificial intelligence","score_opus":0.017978173109979973,"score_gpt":0.25277244002179655,"score_spread":0.23479426691181657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405844668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045758106,0.0001884844,0.95015115,0.00021978929,0.000042956897,0.0000773517,0.00003459837,0.00029194288,0.0032356344],"genre_scores_gemma":[0.9735388,0.00009199249,0.02420615,0.00005078792,0.00001331438,0.00006039283,0.000032216394,0.000021762891,0.0019845106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993161,0.00018025191,0.000032571817,0.00014887832,0.00015817181,0.00016406254],"domain_scores_gemma":[0.99862385,0.00059033954,0.00021560193,0.00019196782,0.0002332082,0.00014505658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009099,0.0007121097,0.00082728453,0.0003186086,0.00059858547,0.00075309514,0.0011578029,0.0008340485,0.0021404414],"category_scores_gemma":[0.0024198925,0.00026708934,0.00037230286,0.00034789462,0.0010036363,0.0013998023,0.0014999134,0.0010992932,0.0002852771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011320268,0.00006540956,0.00071045704,0.00005176104,0.000025178364,0.00013169165,0.00006514349,0.948355,0.004262039,0.013849093,0.0006612346,0.031709746],"study_design_scores_gemma":[0.0000054830343,0.000023804318,0.000036915328,0.0000020306197,0.0000024497688,0.000012011587,0.000005750507,0.9963529,0.0004499037,0.002933935,0.00017146743,0.000003270727],"about_ca_topic_score_codex":0.0033688978,"about_ca_topic_score_gemma":0.0035881004,"teacher_disagreement_score":0.0033688978,"about_ca_system_score_codex":0.00077486434,"about_ca_system_score_gemma":0.001331523,"threshold_uncertainty_score":0.007160485},"labels":[],"label_agreement":null},{"id":"W4405906970","doi":"10.1109/tdsc.2024.3523289","title":"ADA-FInfer: Inferring Face Representations From Adaptive Select Frames for High-Visual-Quality Deepfake Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Face recognition and analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Science Foundation for Distinguished Young Scholars of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Face (sociological concept); Quality (philosophy); Face detection; Artificial intelligence; Computer vision; Frame (networking); Facial recognition system; Machine learning; Human–computer interaction; Pattern recognition (psychology); Computer network","score_opus":0.025378356226589485,"score_gpt":0.3025102243596083,"score_spread":0.2771318681330188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405906970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016560404,0.00036854594,0.9744733,0.00026154218,0.00013768431,0.00009279105,0.00024921543,0.005949769,0.0019068916],"genre_scores_gemma":[0.4010116,0.0004793907,0.58394706,0.0008260539,0.00016751792,0.00026292866,0.0015989066,0.0012437621,0.010462806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995716,0.00006183392,0.000017368124,0.00013961252,0.00013429401,0.0000752283],"domain_scores_gemma":[0.9994937,0.00018150863,0.000053783613,0.00011931585,0.00010762167,0.0000440923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008847113,0.0017093119,0.00088792044,0.0008710921,0.0004389744,0.0013278655,0.0022689158,0.0015306162,0.006238663],"category_scores_gemma":[0.0035933056,0.00056343334,0.0010284298,0.00033027958,0.00072663673,0.0016226935,0.0014770939,0.002314057,0.0021053737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061727635,0.00019277622,0.0021117534,0.00021761256,0.00015405794,0.0003437391,0.0001838277,0.1653097,0.040421844,0.025955647,0.024667613,0.73982424],"study_design_scores_gemma":[0.00001755343,0.000042050982,0.0002159948,0.000017123062,0.000016427153,0.000079242556,0.000013244553,0.9764746,0.011701819,0.009232475,0.002175881,0.00001361046],"about_ca_topic_score_codex":0.004979604,"about_ca_topic_score_gemma":0.007445085,"teacher_disagreement_score":0.006238663,"about_ca_system_score_codex":0.00097109255,"about_ca_system_score_gemma":0.0010908169,"threshold_uncertainty_score":0.020870447},"labels":[],"label_agreement":null},{"id":"W4406753720","doi":"10.1109/tdsc.2025.3533029","title":"A Proactive Defense Against Model Poisoning Attacks in Federated Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computer security","score_opus":0.010931011662338857,"score_gpt":0.26052253823047294,"score_spread":0.24959152656813408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406753720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15615675,0.0010619711,0.8220938,0.001399008,0.00018524824,0.00023140686,0.00028226408,0.016038477,0.0025510958],"genre_scores_gemma":[0.902976,0.00016717851,0.09408798,0.00062302384,0.00005143333,0.00010165248,0.00041567298,0.00019185709,0.0013851499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970952,0.0007940878,0.00020314218,0.0007849673,0.0007725699,0.00034996937],"domain_scores_gemma":[0.9929021,0.0014685318,0.00064886204,0.0036527205,0.0009983744,0.00032933915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044675763,0.0016413939,0.0015376543,0.00075903453,0.0011052571,0.001998556,0.0028975166,0.001979277,0.00090866326],"category_scores_gemma":[0.0132490415,0.0004888952,0.0010880086,0.0007437826,0.0012997158,0.004368776,0.003740767,0.002684429,0.0007312542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010519288,0.0007064505,0.023319945,0.00025749678,0.00037857864,0.0005336292,0.0005335595,0.5959362,0.017686335,0.01628243,0.012646745,0.3306667],"study_design_scores_gemma":[0.000018766708,0.000097225544,0.0004266502,0.000011539451,0.000018521292,0.00011294269,0.000038669816,0.98799604,0.0045748814,0.0057027354,0.0009880867,0.00001390602],"about_ca_topic_score_codex":0.0031288704,"about_ca_topic_score_gemma":0.0026735768,"teacher_disagreement_score":0.0044675763,"about_ca_system_score_codex":0.0010333341,"about_ca_system_score_gemma":0.0023294007,"threshold_uncertainty_score":0.023627102},"labels":[],"label_agreement":null},{"id":"W4406856692","doi":"10.1109/tdsc.2025.3535086","title":"Towards Integrated Spatial Crowdsourcing: Online Privacy-Preserving Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Crowdsourcing; Computer science; Selection (genetic algorithm); Information privacy; Internet privacy; World Wide Web; Artificial intelligence","score_opus":0.018961871594725222,"score_gpt":0.2719712461458764,"score_spread":0.2530093745511512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406856692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01770639,0.00037388213,0.97725165,0.000639855,0.000056467463,0.00015103334,0.00016684181,0.00058451854,0.0030693815],"genre_scores_gemma":[0.83317083,0.00047195848,0.15897724,0.00069450267,0.00022556446,0.00036695748,0.00039372902,0.00017836965,0.005520799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602216,0.00153457,0.00011509407,0.0009314671,0.00090191816,0.00049487967],"domain_scores_gemma":[0.992997,0.004075111,0.00050161517,0.0014496067,0.0004900574,0.00048654253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043560364,0.0014848674,0.0018286696,0.00063903275,0.0012157451,0.00199121,0.004022986,0.0020509474,0.0027387177],"category_scores_gemma":[0.012828198,0.0007046662,0.0010742449,0.0017028238,0.0020302518,0.0030852156,0.0046227556,0.0023723803,0.0007538964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044020396,0.00024465454,0.0028699636,0.00023945118,0.0001287811,0.00043295024,0.0005367689,0.8332961,0.004276166,0.0434421,0.0059484974,0.10814432],"study_design_scores_gemma":[0.000038171605,0.00006967272,0.00028345943,0.000013691245,0.00001755759,0.00010313343,0.0000743069,0.9571299,0.000992796,0.039297324,0.001962768,0.00001721008],"about_ca_topic_score_codex":0.0045973533,"about_ca_topic_score_gemma":0.004012749,"teacher_disagreement_score":0.0045973533,"about_ca_system_score_codex":0.0014681582,"about_ca_system_score_gemma":0.002701161,"threshold_uncertainty_score":0.023037195},"labels":[],"label_agreement":null},{"id":"W4407371961","doi":"10.1109/tdsc.2025.3540980","title":"Chained HotStuff Under Performance Attack","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security; Computer network","score_opus":0.013662090218344788,"score_gpt":0.2510199759040015,"score_spread":0.2373578856856567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407371961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7895305,0.0015125163,0.19544798,0.00046116253,0.00016464142,0.00034840548,0.00048567553,0.0044172388,0.007631857],"genre_scores_gemma":[0.9825219,0.00017871775,0.015845235,0.00007470832,0.0000146896455,0.000083547915,0.00024583258,0.00012469824,0.00091070886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996225,0.0007013058,0.0002337025,0.0005213407,0.001675812,0.00064287346],"domain_scores_gemma":[0.9871852,0.004412843,0.0015750577,0.0042622243,0.0020564666,0.00050819345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029063937,0.00093954854,0.00082478975,0.0011375861,0.00082716625,0.0012724531,0.0015208053,0.0011316221,0.0019628624],"category_scores_gemma":[0.014767698,0.00024292346,0.00043737717,0.00092647923,0.0015381705,0.0036373602,0.0018645321,0.0012829425,0.0003454659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021667406,0.00045712487,0.017251665,0.00081588957,0.00025966455,0.0007582437,0.0006095911,0.66386265,0.12198549,0.03339146,0.005476044,0.15296553],"study_design_scores_gemma":[0.000070134825,0.0010186647,0.0025611904,0.000041880816,0.00006615347,0.0003203951,0.00016032525,0.9162473,0.06672867,0.009959175,0.0027660683,0.000059996648],"about_ca_topic_score_codex":0.002036681,"about_ca_topic_score_gemma":0.001558691,"teacher_disagreement_score":0.0029063937,"about_ca_system_score_codex":0.0012732841,"about_ca_system_score_gemma":0.0015422828,"threshold_uncertainty_score":0.015370667},"labels":[],"label_agreement":null},{"id":"W4407506754","doi":"10.1109/tdsc.2025.3541728","title":"MultiFile View: File-View-Based Isolation in a Single-User Environment to Protect User Data Files","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Computer science; Isolation (microbiology); Operating system; Database","score_opus":0.02059442281346258,"score_gpt":0.2621174401085737,"score_spread":0.2415230172951111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407506754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015984602,0.00069659285,0.94146115,0.0005404075,0.0002686104,0.00022776937,0.0006374015,0.024897072,0.015286529],"genre_scores_gemma":[0.5442299,0.0010027653,0.42119247,0.0011029928,0.00046973318,0.0005074981,0.003505115,0.005037241,0.022952205],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982988,0.0002429006,0.00007694078,0.00027724143,0.0007483963,0.0003555789],"domain_scores_gemma":[0.9950808,0.00055541063,0.00023944638,0.0030272424,0.0006964875,0.00040055538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014623159,0.0011158607,0.0008599447,0.0011157682,0.0011192327,0.0029619094,0.0036125393,0.0014774019,0.009485597],"category_scores_gemma":[0.0034386446,0.00053753145,0.00093487935,0.00069477776,0.0014494323,0.007625586,0.006255842,0.0025411472,0.0030405151],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019311255,0.00050335174,0.0066917483,0.0006460058,0.00028030228,0.001269789,0.0028850432,0.021257358,0.110000364,0.20025975,0.13211273,0.5221624],"study_design_scores_gemma":[0.0002939062,0.0010534113,0.0044143065,0.00024455818,0.00027852735,0.0028705464,0.0010850449,0.30308127,0.24907403,0.07947976,0.3576095,0.0005151371],"about_ca_topic_score_codex":0.0024213179,"about_ca_topic_score_gemma":0.0027565027,"teacher_disagreement_score":0.009485597,"about_ca_system_score_codex":0.0008615153,"about_ca_system_score_gemma":0.0013568837,"threshold_uncertainty_score":0.0317325},"labels":[],"label_agreement":null},{"id":"W4407638124","doi":"10.1109/tdsc.2025.3542761","title":"New Secure Sparse Inner Product With Applications to Machine Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Product (mathematics); Artificial intelligence; Computer security","score_opus":0.010138908995805496,"score_gpt":0.23928451255183247,"score_spread":0.22914560355602698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407638124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009390961,0.0003662884,0.9836944,0.00065223844,0.000089098656,0.000104647515,0.00015693414,0.0012811444,0.004264342],"genre_scores_gemma":[0.5273408,0.0008538045,0.4603399,0.0008234943,0.00041606033,0.000609398,0.0006460966,0.00070222706,0.008268206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99322987,0.0021460655,0.0004091647,0.0009677916,0.0025663057,0.00068079587],"domain_scores_gemma":[0.9888192,0.0048500677,0.00079536356,0.0041197212,0.0010588442,0.00035678627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043177884,0.0012070823,0.0018146029,0.0011857192,0.0014436742,0.003596361,0.0023180179,0.0019035237,0.005754351],"category_scores_gemma":[0.018153993,0.0007793843,0.0016138002,0.002262977,0.0032209053,0.008698073,0.006176515,0.004766347,0.002677962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040441685,0.00017359018,0.000798712,0.00028282215,0.000072316245,0.0002572962,0.00038521312,0.06797391,0.007840191,0.7880203,0.009254201,0.124537006],"study_design_scores_gemma":[0.00005016938,0.00013122841,0.00012135486,0.000052412153,0.000029407003,0.00027412068,0.000055921522,0.44721845,0.009199502,0.5345895,0.008231298,0.000046682624],"about_ca_topic_score_codex":0.00058699475,"about_ca_topic_score_gemma":0.00056960055,"teacher_disagreement_score":0.005754351,"about_ca_system_score_codex":0.0018402236,"about_ca_system_score_gemma":0.0029113933,"threshold_uncertainty_score":0.022834957},"labels":[],"label_agreement":null},{"id":"W4409882654","doi":"10.1109/tdsc.2025.3564697","title":"Poisoning as a Post-Protection: Mitigating Membership Privacy Leakage From Gradient and Prediction of Federated Models","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"HIV, Drug Use, Sexual Risk","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Leakage (economics); Computer science; Computer security; Privacy protection; Information privacy; Internet privacy","score_opus":0.04057071849102817,"score_gpt":0.2899999680208071,"score_spread":0.2494292495297789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409882654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09958909,0.00016645838,0.8929306,0.0010353824,0.000064210566,0.000078836536,0.00019021316,0.004172571,0.0017726241],"genre_scores_gemma":[0.9210181,0.00005534475,0.07657725,0.00035318316,0.0000444218,0.000061757135,0.00019805829,0.00014949082,0.0015423434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929219,0.0026292235,0.00042603354,0.0015373298,0.001767302,0.00071823434],"domain_scores_gemma":[0.9781992,0.0056156693,0.0016173095,0.012801906,0.0013020457,0.00046391968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066438974,0.0008213472,0.0013817187,0.0006165833,0.0011660807,0.0024417473,0.0030275038,0.002152022,0.0014430961],"category_scores_gemma":[0.027003577,0.0006392953,0.0011471666,0.00078321743,0.0020025508,0.0064819157,0.006142946,0.003463361,0.0006700385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024522762,0.00070960174,0.024813294,0.00021923671,0.00033759628,0.0009271825,0.0014549756,0.46754828,0.03063695,0.111558214,0.009706542,0.34963587],"study_design_scores_gemma":[0.000024658399,0.000090561785,0.00063267525,0.00001603448,0.000018992689,0.00014956624,0.000044849683,0.93724006,0.020147085,0.040272616,0.0013428286,0.000020083591],"about_ca_topic_score_codex":0.0013336348,"about_ca_topic_score_gemma":0.0009914223,"teacher_disagreement_score":0.0066438974,"about_ca_system_score_codex":0.0015204439,"about_ca_system_score_gemma":0.0024029,"threshold_uncertainty_score":0.0351367},"labels":[],"label_agreement":null},{"id":"W4410204358","doi":"10.1109/tdsc.2025.3568160","title":"On Estimating the Strength of Differentially Private Mechanisms in a Black-Box Setting","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Metallurgy and Material Forming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"European Commission","keywords":"Black box; Computer science; Artificial intelligence","score_opus":0.005935516813452162,"score_gpt":0.2147835631961579,"score_spread":0.20884804638270574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410204358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045249563,0.00039230843,0.9514477,0.0007354612,0.00002463553,0.00007500902,0.000100717974,0.0002154046,0.0017592207],"genre_scores_gemma":[0.87817705,0.00068955554,0.119109705,0.00034082713,0.00010483382,0.00018694479,0.00014590312,0.000083604406,0.0011616099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.984259,0.00833511,0.0005049481,0.0022365637,0.0033961756,0.0012681555],"domain_scores_gemma":[0.7293471,0.23912272,0.011304602,0.014411439,0.0036143812,0.002199745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026460953,0.0022256698,0.0026253834,0.0024927373,0.0013013472,0.0036288698,0.0041140416,0.0040722103,0.0022526134],"category_scores_gemma":[0.1803369,0.0016208645,0.0011998421,0.0016475165,0.008206025,0.014868195,0.0076496154,0.006275166,0.0005074508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010641394,0.00019296925,0.006061963,0.00035220073,0.0002459159,0.000402128,0.00040605452,0.6879994,0.008707911,0.25659925,0.00078425667,0.03718369],"study_design_scores_gemma":[0.00003434938,0.00013517038,0.00054547697,0.00006043758,0.000026865451,0.0001824053,0.000048560647,0.9023951,0.0042357775,0.09198916,0.00030750397,0.000039331197],"about_ca_topic_score_codex":0.0008710681,"about_ca_topic_score_gemma":0.00044541009,"teacher_disagreement_score":0.026460953,"about_ca_system_score_codex":0.003520689,"about_ca_system_score_gemma":0.0026233143,"threshold_uncertainty_score":0.13994062},"labels":[],"label_agreement":null},{"id":"W4410614229","doi":"10.1109/tdsc.2025.3572527","title":"The Power of Bias: Optimizing Client Selection in Federated Learning With Heterogeneous Differential Privacy","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Differential privacy; Selection (genetic algorithm); Information privacy; Selection bias; Computer network; Computer security; Data mining; Artificial intelligence","score_opus":0.015804476810245365,"score_gpt":0.2497590021081102,"score_spread":0.23395452529786484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410614229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04462422,0.00038489266,0.9525274,0.00062617194,0.000032522417,0.00007253574,0.00006180529,0.0007641376,0.00090637035],"genre_scores_gemma":[0.9015747,0.0002587385,0.095686294,0.0004178885,0.000052255367,0.00015906082,0.00013457141,0.00011481768,0.0016016653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931734,0.0033786185,0.00027735266,0.0011463937,0.0013522821,0.00067188],"domain_scores_gemma":[0.98545545,0.008329934,0.00091446046,0.003139267,0.0015837919,0.0005771364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009418064,0.0011403256,0.002191834,0.0006435188,0.0009919466,0.002219226,0.003000104,0.001831388,0.001182214],"category_scores_gemma":[0.027656842,0.00056956796,0.00084170024,0.0013967049,0.0020857886,0.0043049376,0.0038638206,0.0028188708,0.00038809184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011727881,0.00038458698,0.007195391,0.0001783192,0.0001907935,0.00032087037,0.00037821435,0.7403624,0.0065455805,0.05308796,0.0039247232,0.18625844],"study_design_scores_gemma":[0.00002769546,0.00006094672,0.00019242636,0.000008851612,0.0000148220215,0.00006190342,0.000028913477,0.97460526,0.0017703116,0.022896271,0.0003227487,0.00000990672],"about_ca_topic_score_codex":0.0021525514,"about_ca_topic_score_gemma":0.0016925756,"teacher_disagreement_score":0.009418064,"about_ca_system_score_codex":0.0021093846,"about_ca_system_score_gemma":0.003091036,"threshold_uncertainty_score":0.049808085},"labels":[],"label_agreement":null},{"id":"W4411202919","doi":"10.1109/tdsc.2025.3578676","title":"DGADM-GIS: Deterministic Guided Additive Diffusion Model for Generative Image Steganography","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Steganography; Generative model; Steganography tools; Image (mathematics); Generative grammar; Artificial intelligence; Computer vision; Theoretical computer science","score_opus":0.017328495677911147,"score_gpt":0.27948616283430494,"score_spread":0.26215766715639377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411202919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007919986,0.00034979457,0.98963505,0.00014799502,0.000025293139,0.000021403539,0.000034074936,0.00024137818,0.0016250393],"genre_scores_gemma":[0.8443059,0.0013205865,0.14521086,0.00024941462,0.0000616365,0.00015357022,0.00016824123,0.00011552777,0.008414413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959546,0.00010322753,0.000017195092,0.000094666495,0.00014374252,0.000045740107],"domain_scores_gemma":[0.9995826,0.00021806521,0.00006064884,0.000059056463,0.00005939077,0.000020241852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043514604,0.0007138593,0.00067072274,0.0004421578,0.00022016655,0.000540769,0.0009793573,0.00081919454,0.0012470945],"category_scores_gemma":[0.0011454168,0.00030615492,0.00082183874,0.0004070625,0.0009014146,0.00089644926,0.00087075855,0.0012328429,0.0004234851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011069169,0.00005106968,0.00080170337,0.00017860363,0.000068191985,0.00026838342,0.00017581636,0.75750136,0.027296456,0.13294019,0.0015915611,0.079015985],"study_design_scores_gemma":[0.0000062320755,0.000030478315,0.00007678699,0.0000074014715,0.000008078791,0.000083429746,0.0000063327766,0.98615277,0.0028902972,0.009564328,0.0011624853,0.00001142478],"about_ca_topic_score_codex":0.0019445488,"about_ca_topic_score_gemma":0.001541871,"teacher_disagreement_score":0.0019445488,"about_ca_system_score_codex":0.0007626597,"about_ca_system_score_gemma":0.00052718964,"threshold_uncertainty_score":0.005533457},"labels":[],"label_agreement":null},{"id":"W4411799552","doi":"10.1109/tdsc.2025.3584123","title":"LocalSketch: An Accurate and Efficient Sketch for Range Spread Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Sketch; Range (aeronautics); Estimation; Algorithm; Engineering","score_opus":0.01670780972740703,"score_gpt":0.30358379120529594,"score_spread":0.2868759814778889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411799552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006793908,0.00054430176,0.98422503,0.00007059669,0.00007908243,0.00010208809,0.0005906602,0.0066038454,0.000990454],"genre_scores_gemma":[0.31804514,0.0010367887,0.6723244,0.00015854661,0.00012579767,0.0004195852,0.0030536493,0.00096872094,0.0038673454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988882,0.00017404476,0.00009939789,0.00020161588,0.00055592594,0.00008080759],"domain_scores_gemma":[0.99592006,0.0014549012,0.00040634125,0.0013319531,0.0006980609,0.00018856642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009198349,0.0011448523,0.0011334907,0.0019111353,0.0003816421,0.0018405697,0.0018931006,0.0008761078,0.0055104657],"category_scores_gemma":[0.013077966,0.0006307735,0.00063994055,0.0018007803,0.00058452174,0.0036199891,0.0029682755,0.0012939785,0.002895378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082903006,0.00010835398,0.0053567267,0.0008754279,0.00015857394,0.0002625789,0.00037192678,0.15581447,0.028796786,0.025027694,0.014582366,0.7678161],"study_design_scores_gemma":[0.00009133158,0.0001372652,0.00097148237,0.000079451565,0.000040615585,0.00033759334,0.00012464463,0.9420238,0.020935886,0.019816212,0.015354425,0.00008715651],"about_ca_topic_score_codex":0.0012792186,"about_ca_topic_score_gemma":0.0018019524,"teacher_disagreement_score":0.0055104657,"about_ca_system_score_codex":0.00044290678,"about_ca_system_score_gemma":0.0009937927,"threshold_uncertainty_score":0.018434405},"labels":[],"label_agreement":null},{"id":"W4411948507","doi":"10.1109/tdsc.2025.3584924","title":"DTHA: A Digital Twin-Assisted Handover Authentication Scheme for 5G and Beyond","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Handover; Computer network; Scheme (mathematics); Authentication (law); Computer security; Mathematics","score_opus":0.012512298736879927,"score_gpt":0.2757864622452119,"score_spread":0.263274163508332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411948507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046795078,0.0014468298,0.9339375,0.0007178266,0.00065359916,0.0004460978,0.00026003987,0.0022172637,0.01352571],"genre_scores_gemma":[0.910652,0.0006863293,0.078645505,0.00036330006,0.00015033725,0.00019357294,0.0003458764,0.00004431002,0.008918825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986002,0.00037596808,0.0001474403,0.00021810098,0.00039376435,0.00026444485],"domain_scores_gemma":[0.998616,0.00024039675,0.000223544,0.00043608222,0.00034005623,0.0001438569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012420133,0.0006257026,0.00069697155,0.0012268294,0.0016387695,0.0012001541,0.0013012071,0.0010187548,0.0034492624],"category_scores_gemma":[0.002242899,0.00026396714,0.0006841518,0.00080186536,0.0012930699,0.003670109,0.0031254054,0.0015578261,0.0010656868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023248813,0.00025219843,0.002176943,0.0006207542,0.00015883149,0.001158104,0.0011651525,0.032830007,0.12027032,0.4900777,0.014096405,0.33486873],"study_design_scores_gemma":[0.00041527807,0.0017812153,0.0013403936,0.00020077323,0.00034563796,0.004102697,0.0004603035,0.66846955,0.105073914,0.11596636,0.10146457,0.00037933],"about_ca_topic_score_codex":0.0011721747,"about_ca_topic_score_gemma":0.0009486851,"teacher_disagreement_score":0.0034492624,"about_ca_system_score_codex":0.00093567197,"about_ca_system_score_gemma":0.0014476755,"threshold_uncertainty_score":0.011538923},"labels":[],"label_agreement":null},{"id":"W4413155652","doi":"10.1109/tdsc.2025.3598300","title":"MoiréComm: Secure Screen-Camera Communication Based on Moiré Cryptography","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Moiré pattern; Cryptography; Secure communication; Visual cryptography; Computer security; Computer vision; Encryption; Secret sharing","score_opus":0.009151512800359609,"score_gpt":0.2475717792949426,"score_spread":0.23842026649458298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413155652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0359941,0.00199175,0.9369542,0.00041134865,0.0002717731,0.00029718975,0.000206846,0.004370317,0.019502472],"genre_scores_gemma":[0.7526772,0.0014408284,0.22474979,0.0007036591,0.0001944918,0.00021635658,0.0005514086,0.00027149776,0.019194692],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999131,0.00016308551,0.00004244419,0.00012016104,0.0004316447,0.00011164972],"domain_scores_gemma":[0.9994228,0.00012411093,0.00011444992,0.00017280944,0.00012830687,0.00003748793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144767,0.0006776808,0.00056380295,0.0005770279,0.00042978616,0.0007642854,0.0008891548,0.0009118654,0.0054982835],"category_scores_gemma":[0.0011655643,0.00022181765,0.00046768232,0.00043149042,0.00055007084,0.0013504378,0.0013767376,0.0010666838,0.002465478],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012114918,0.00025629078,0.0018838965,0.0008043644,0.00017493905,0.0016526395,0.00041371852,0.06699208,0.40782943,0.11647266,0.022932222,0.37937617],"study_design_scores_gemma":[0.00011228234,0.00072354847,0.0010845762,0.00012224172,0.000057290643,0.003204664,0.00008264894,0.6294152,0.30767813,0.013480108,0.043867644,0.00017167853],"about_ca_topic_score_codex":0.0005498436,"about_ca_topic_score_gemma":0.00057421095,"teacher_disagreement_score":0.0054982835,"about_ca_system_score_codex":0.0004800057,"about_ca_system_score_gemma":0.00042635374,"threshold_uncertainty_score":0.018393636},"labels":[],"label_agreement":null},{"id":"W4413468163","doi":"10.1109/tdsc.2025.3598867","title":"BM-PDA: Blockchain Based Multifunctional Private-Preserving Data Aggregation for e-Health Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blockchain; Computer science; Computer security","score_opus":0.026370150529735032,"score_gpt":0.28951189761985874,"score_spread":0.2631417470901237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413468163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057280883,0.0009948154,0.9274638,0.0011705655,0.00020285005,0.0006147287,0.00080078,0.0019428036,0.009528703],"genre_scores_gemma":[0.91592276,0.0005256406,0.07673413,0.0002302829,0.00008003598,0.00036916873,0.00058046385,0.00004311157,0.00551438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980584,0.00056688767,0.00016468855,0.00029768847,0.0006535311,0.0002587764],"domain_scores_gemma":[0.99768484,0.00067154807,0.00028837592,0.0007497607,0.00038302102,0.00022240907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019116685,0.00043143943,0.0006878315,0.0007769849,0.0011715629,0.001267286,0.001312734,0.0009926107,0.0040772683],"category_scores_gemma":[0.0038052967,0.00022579989,0.00039082326,0.0014409977,0.0009262776,0.0026181717,0.0032646428,0.0009985451,0.0010237171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024149204,0.00045798914,0.0068020574,0.00070823554,0.00017386573,0.0018147833,0.0010968194,0.22314347,0.061587684,0.21389344,0.022802558,0.46510413],"study_design_scores_gemma":[0.00025025668,0.00043171603,0.0009021686,0.00007795078,0.000046380505,0.0007971114,0.00013547049,0.84250194,0.023662074,0.10070189,0.030419897,0.0000732444],"about_ca_topic_score_codex":0.0017100533,"about_ca_topic_score_gemma":0.001561666,"teacher_disagreement_score":0.0040772683,"about_ca_system_score_codex":0.00095715583,"about_ca_system_score_gemma":0.0020949675,"threshold_uncertainty_score":0.013639808},"labels":[],"label_agreement":null},{"id":"W4413786017","doi":"10.1109/tdsc.2025.3603639","title":"I2I Backdoor: Backdoor Attacks Against Image-to-Image Tasks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Backdoor; Computer science; Image (mathematics); Computer security; Artificial intelligence; Computer vision","score_opus":0.008572549446998498,"score_gpt":0.2709500114351712,"score_spread":0.26237746198817274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413786017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08430095,0.0010947003,0.90499973,0.00089930056,0.00023620136,0.00024170634,0.00021017181,0.00303394,0.0049833306],"genre_scores_gemma":[0.92583513,0.00036567476,0.070194304,0.0005605737,0.000061959,0.00015758011,0.00018683304,0.00018997933,0.002448086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976394,0.0005653089,0.000107113156,0.00047206625,0.0007712898,0.0004447697],"domain_scores_gemma":[0.9951715,0.0022807806,0.00060708064,0.0013291126,0.00040424927,0.00020729443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021599291,0.0017004496,0.0011389859,0.0006076,0.00076725363,0.001052142,0.0017855775,0.0021154084,0.0019331237],"category_scores_gemma":[0.010047169,0.00053923443,0.0012493173,0.00041424544,0.002378014,0.0031842554,0.004157432,0.0034433275,0.00063657056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016975441,0.00032284722,0.0039082533,0.00050295243,0.00041505616,0.0015922606,0.00051083363,0.6125049,0.097883165,0.069259696,0.011669851,0.1997326],"study_design_scores_gemma":[0.00002370463,0.00016174861,0.0003828135,0.000026721871,0.000028174305,0.00041797032,0.000042670898,0.95168775,0.029751584,0.016082328,0.0013609531,0.000033568016],"about_ca_topic_score_codex":0.0009631009,"about_ca_topic_score_gemma":0.0008380325,"teacher_disagreement_score":0.0021599291,"about_ca_system_score_codex":0.0009858091,"about_ca_system_score_gemma":0.0007791629,"threshold_uncertainty_score":0.011422932},"labels":[],"label_agreement":null},{"id":"W4413925826","doi":"10.1109/tdsc.2025.3605197","title":"WFCAT: Augmenting Website Fingerprinting With Channel-Wise Attention on Timing Features","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Research Foundation Singapore","keywords":"Computer science; Channel (broadcasting); Fingerprint (computing); Computer network; Computer security","score_opus":0.009607949373425033,"score_gpt":0.2412968135845509,"score_spread":0.23168886421112586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3115641,0.0012992434,0.66107893,0.00086915365,0.00040354577,0.00018947008,0.0010364994,0.014374891,0.009184221],"genre_scores_gemma":[0.9462393,0.00028980247,0.046849474,0.0003213259,0.00009281266,0.000060967486,0.0010811936,0.00016605367,0.0048991367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997118,0.000033551416,0.000010469831,0.000090337606,0.00007788487,0.00007587011],"domain_scores_gemma":[0.99938655,0.00016005339,0.00010567931,0.00015861772,0.00013109276,0.000058049758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039438327,0.0012286947,0.00079301774,0.00085916294,0.00028966359,0.000650637,0.0010445706,0.00081549416,0.0013274109],"category_scores_gemma":[0.0015697394,0.00026338745,0.0006123967,0.0005382051,0.0005063518,0.0018386476,0.001046472,0.0014331813,0.00070831197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005376393,0.0005451734,0.012346097,0.00015595621,0.00020566692,0.00030083803,0.0001232974,0.33537275,0.045720752,0.006920099,0.015568064,0.5822037],"study_design_scores_gemma":[0.000007194762,0.00007752527,0.0013245252,0.000006287904,0.000026354595,0.00007965239,0.000011268039,0.98834795,0.006899414,0.0020267293,0.0011793436,0.000013732669],"about_ca_topic_score_codex":0.0062680575,"about_ca_topic_score_gemma":0.0076371343,"teacher_disagreement_score":0.0062680575,"about_ca_system_score_codex":0.0007369772,"about_ca_system_score_gemma":0.00094802317,"threshold_uncertainty_score":0.012463152},"labels":[],"label_agreement":null},{"id":"W4414693351","doi":"10.1109/tdsc.2025.3616852","title":"An Algorithm for Persistent Homology Computation Using Homomorphic Encryption","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Homomorphic encryption; Correctness; Persistent homology; Plaintext; Encryption; Topological data analysis; Robustness (evolution)","score_opus":0.024047477243892276,"score_gpt":0.2898076227512733,"score_spread":0.26576014550738103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414693351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016926352,0.0002008726,0.97662884,0.00049083325,0.00010948701,0.00019073562,0.00022270242,0.0019595767,0.0032705774],"genre_scores_gemma":[0.43508962,0.00020397147,0.5577436,0.00030085852,0.00010778454,0.00040990478,0.0007992085,0.00034012776,0.00500494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767786,0.00038232878,0.00021320886,0.0004256853,0.0009993922,0.00030147634],"domain_scores_gemma":[0.9962644,0.0011009319,0.0002786306,0.0016971828,0.00051056105,0.0001482655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013740499,0.0005691197,0.001091844,0.0010948475,0.001133893,0.0022476697,0.0016355398,0.0011806053,0.0047004423],"category_scores_gemma":[0.0072189136,0.00040851446,0.0012194902,0.001133839,0.0015937802,0.004669436,0.0054639135,0.002106008,0.002278332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006293499,0.00026680596,0.0018839804,0.0003159308,0.00014661255,0.00040570612,0.00081399124,0.07598656,0.028498221,0.40737176,0.017182432,0.46649873],"study_design_scores_gemma":[0.00018384634,0.0003029325,0.0005311,0.000058607926,0.00005570827,0.00070008135,0.00023746953,0.58077466,0.030575184,0.37016207,0.016330333,0.00008808719],"about_ca_topic_score_codex":0.0009843512,"about_ca_topic_score_gemma":0.0010321037,"teacher_disagreement_score":0.0047004423,"about_ca_system_score_codex":0.0012751701,"about_ca_system_score_gemma":0.002293709,"threshold_uncertainty_score":0.0157246},"labels":[],"label_agreement":null},{"id":"W4415971194","doi":"10.1109/tdsc.2025.3629675","title":"Incentive Mechanism Design for Collaborative Physical Layer Authentication: A Centralized Governance Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Stackelberg competition; Incentive; Authentication (law); Physical layer; Mechanism design; Wireless; Key (lock); Reliability (semiconductor); Layer (electronics)","score_opus":0.02454033996746111,"score_gpt":0.2740580008034,"score_spread":0.24951766083593888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415971194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009345883,0.00009330619,0.98873705,0.00016811026,0.000031626045,0.00011126955,0.000015802449,0.00016492854,0.0013320366],"genre_scores_gemma":[0.84416956,0.00014618106,0.1527009,0.00013483601,0.00006867946,0.00029411653,0.00003740203,0.000034174405,0.0024142098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454075,0.0021869587,0.00037811356,0.0013225588,0.0010144942,0.0005571548],"domain_scores_gemma":[0.99329066,0.0024587717,0.0011271165,0.0011982382,0.0013862295,0.00053892855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069067585,0.00088382914,0.0013644419,0.00087728683,0.0012382187,0.0020445143,0.0033288258,0.0014096408,0.002896814],"category_scores_gemma":[0.012949488,0.0005507859,0.0007599946,0.0008521431,0.0016194361,0.003884681,0.0031322453,0.0020541823,0.000479903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005733374,0.00041769206,0.0038964138,0.00026441543,0.00017968567,0.00042735616,0.0006018477,0.51269794,0.017899932,0.2895119,0.0033907704,0.17013873],"study_design_scores_gemma":[0.00008126859,0.00021956186,0.0003218655,0.00002162891,0.000044000066,0.00013286706,0.000043358952,0.95762193,0.003271718,0.03581209,0.0023979219,0.000031816828],"about_ca_topic_score_codex":0.001079449,"about_ca_topic_score_gemma":0.0011568773,"teacher_disagreement_score":0.0069067585,"about_ca_system_score_codex":0.0014358958,"about_ca_system_score_gemma":0.0030033905,"threshold_uncertainty_score":0.03652692},"labels":[],"label_agreement":null},{"id":"W4416078090","doi":"10.1109/tdsc.2025.3630656","title":"Mercury: Practical Cross-Chain Exchange via Trusted Hardware","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Unavailability; Cryptocurrency; Mercury (programming language); Database transaction; Trusted Computing; Trusted third party; Trusted Platform Module; Digital currency","score_opus":0.016823008317178176,"score_gpt":0.29486399051184964,"score_spread":0.27804098219467144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416078090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120373435,0.0006877971,0.82291275,0.00077667244,0.00019078683,0.000478751,0.00025493553,0.026750972,0.02757384],"genre_scores_gemma":[0.8229792,0.0002214229,0.16489024,0.00017727388,0.000037380054,0.00014645913,0.00032762377,0.0006149088,0.010605418],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781114,0.0005838105,0.00010915054,0.00020973467,0.0009008872,0.00038526993],"domain_scores_gemma":[0.99756926,0.00040291352,0.00021448222,0.0013917375,0.0002752176,0.00014637383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014793533,0.00061269186,0.00050935405,0.00045708497,0.00084862276,0.0011671014,0.0017083244,0.00085075945,0.011317948],"category_scores_gemma":[0.003389772,0.00043315903,0.00036686417,0.0005980802,0.0012015542,0.0034080807,0.0038152426,0.0013736717,0.0023639244],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043346668,0.0004994948,0.0045625744,0.000844808,0.00019491503,0.0014324714,0.0011005829,0.106611736,0.09116788,0.22368267,0.03552654,0.5300416],"study_design_scores_gemma":[0.00065373234,0.0011492382,0.001090721,0.00010476279,0.00009027596,0.0009032246,0.00027032042,0.7056871,0.11992904,0.08558808,0.08442209,0.00011141226],"about_ca_topic_score_codex":0.0010481577,"about_ca_topic_score_gemma":0.0013635767,"teacher_disagreement_score":0.011317948,"about_ca_system_score_codex":0.0005510222,"about_ca_system_score_gemma":0.0015414805,"threshold_uncertainty_score":0.0378623},"labels":[],"label_agreement":null},{"id":"W4416214608","doi":"10.1109/tdsc.2025.3632657","title":"Feed-Forward Controller-Based Recovery for Robotic Vehicles From Physical Attacks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Controller (irrigation); Spoofing attack; Cyber-physical system; Wireless sensor network; Robot","score_opus":0.009299893048253037,"score_gpt":0.24029752300071325,"score_spread":0.2309976299524602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416214608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021572884,0.00012965954,0.97040826,0.00012745231,0.00006215577,0.000088882334,0.00002834904,0.0062783514,0.00130398],"genre_scores_gemma":[0.93422323,0.00006112474,0.06356304,0.00014713506,0.000022529552,0.00009141253,0.00007941437,0.00009085231,0.0017212381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991511,0.0001149805,0.000054872104,0.00020799163,0.00032771143,0.00014334866],"domain_scores_gemma":[0.99821126,0.00061817997,0.00029933784,0.0003610886,0.0004403121,0.00006984245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204965,0.0010457041,0.0005880682,0.00055491604,0.00048512366,0.000822783,0.001852123,0.0010153,0.002291871],"category_scores_gemma":[0.0033396026,0.000318987,0.00043333773,0.00017847898,0.0011275853,0.0012147902,0.0011902562,0.0014354186,0.0005949751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038341316,0.00023173048,0.0015077632,0.00017256058,0.00006805701,0.0003476622,0.00020760462,0.7657741,0.03763682,0.005333571,0.002287174,0.18604949],"study_design_scores_gemma":[0.000012684263,0.00011704748,0.00016459936,0.000009127276,0.000009734493,0.000050730574,0.000014228357,0.98330855,0.013843549,0.0017617638,0.0006966253,0.000011349971],"about_ca_topic_score_codex":0.003170203,"about_ca_topic_score_gemma":0.0031027042,"teacher_disagreement_score":0.003170203,"about_ca_system_score_codex":0.0007184946,"about_ca_system_score_gemma":0.0011672471,"threshold_uncertainty_score":0.007667005},"labels":[],"label_agreement":null},{"id":"W4416323579","doi":"10.1109/tdsc.2025.3634446","title":"Fed-EHP: Efficient and Heterogeneous Privacy-Preserving Personalized Federated Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hyperion Technologies (Canada)","funders":"Key Research and Development Program of Zhejiang Province; National Natural Science Foundation of China","keywords":"Federated learning; Personalization; Cluster analysis; Inference; Limiting; Information privacy; Heterogeneous network","score_opus":0.01833486361537659,"score_gpt":0.26482997783234685,"score_spread":0.24649511421697026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014414426,0.00016279651,0.9827391,0.00019411357,0.000024747778,0.000042241365,0.00008851456,0.0016264033,0.00070758385],"genre_scores_gemma":[0.75029993,0.00017107511,0.24593803,0.00040375843,0.000043605203,0.00011436832,0.00046638318,0.00015446506,0.002408424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984718,0.00047603896,0.00007443229,0.00037055483,0.00040844636,0.00019874559],"domain_scores_gemma":[0.99764085,0.0005825249,0.0001271723,0.0013037698,0.00023864693,0.000107083695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028466186,0.00064716354,0.0010322905,0.00054332335,0.0009424745,0.0012345638,0.002784487,0.0011264349,0.0010022627],"category_scores_gemma":[0.0046538264,0.00033458244,0.0007363068,0.00086369214,0.0011552062,0.0034697773,0.003643793,0.0018003286,0.0003265385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005309831,0.0003972814,0.0033098925,0.000132199,0.0002024224,0.00036900776,0.00034929658,0.5910367,0.008704946,0.046641514,0.010598253,0.33772758],"study_design_scores_gemma":[0.000018764473,0.00003221483,0.00019074,0.000005659978,0.00001115118,0.00007881889,0.00003453442,0.96070963,0.0030165496,0.03456369,0.0013281024,0.000010151059],"about_ca_topic_score_codex":0.0028062367,"about_ca_topic_score_gemma":0.0036789232,"teacher_disagreement_score":0.0028466186,"about_ca_system_score_codex":0.0010207731,"about_ca_system_score_gemma":0.0015775409,"threshold_uncertainty_score":0.015054524},"labels":[],"label_agreement":null},{"id":"W4417131097","doi":"10.1109/tdsc.2025.3641055","title":"NOProbe: A NOP-Based Dynamic Binary Instrumentation Framework Using Binary Rewriting on x86","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Telefonaktiebolaget LM Ericsson; Google","keywords":"x86; Instrumentation (computer programming); Binary number; Code (set theory); Binary translation; Rewriting; Binary code; Trampoline","score_opus":0.01674311255718804,"score_gpt":0.29385212819226453,"score_spread":0.2771090156350765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417131097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018385302,0.00046822356,0.8741752,0.00016864296,0.000081847174,0.00016094065,0.00016358144,0.1007516,0.005644639],"genre_scores_gemma":[0.38854316,0.0007150776,0.5774035,0.0006603354,0.0001175452,0.00048064828,0.001105599,0.01724876,0.013725374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988362,0.0002299222,0.00009126026,0.00023409171,0.0004379908,0.00017058608],"domain_scores_gemma":[0.9987709,0.00030713822,0.00012963073,0.00060101144,0.00011016821,0.00008110073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009857293,0.0009302465,0.0007588443,0.0006252391,0.0005754538,0.001352503,0.0030637223,0.00075863244,0.0043974756],"category_scores_gemma":[0.0029584682,0.0008300573,0.00080914306,0.00047650115,0.0011941412,0.0025411195,0.00329284,0.001782557,0.0020697785],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011270782,0.00046835458,0.005183227,0.00085189904,0.00011767081,0.0006742127,0.0011548249,0.04000841,0.1217568,0.10362831,0.04304458,0.68198454],"study_design_scores_gemma":[0.00022262645,0.0005544301,0.0026531047,0.00015732931,0.000119270735,0.00085211033,0.00018100413,0.60127157,0.2007416,0.0438368,0.1491705,0.00023966702],"about_ca_topic_score_codex":0.0016503392,"about_ca_topic_score_gemma":0.0018857833,"teacher_disagreement_score":0.0043974756,"about_ca_system_score_codex":0.00076603505,"about_ca_system_score_gemma":0.0011371748,"threshold_uncertainty_score":0.014711022},"labels":[],"label_agreement":null},{"id":"W7081930596","doi":"10.1109/tdsc.2025.3609641","title":"MPKS: Efficient and Privacy-Enhanced Multi-Party Keyword-Oriented Similarity Query in ehealthcare","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Scalability; Encryption; Tree traversal; Homomorphic encryption; Tree (set theory); Cloud computing; Node (physics); Information privacy; Outsourcing; Path (computing)","score_opus":0.014151051307998893,"score_gpt":0.26074085134570607,"score_spread":0.24658980003770717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081930596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050652005,0.0006095205,0.94328034,0.0008879146,0.00009446215,0.00033908698,0.00023712996,0.00083300204,0.003066578],"genre_scores_gemma":[0.9030796,0.00031449646,0.09367429,0.00030432316,0.00007245445,0.00016169203,0.000281429,0.000033981363,0.0020777048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993739,0.0018925185,0.00049195916,0.00082356465,0.0023626157,0.0006903614],"domain_scores_gemma":[0.99697673,0.0009666,0.00037715925,0.001020605,0.0004915623,0.00016744962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033280158,0.00040901752,0.0010319665,0.0006204968,0.0012263989,0.0015853484,0.0017272836,0.0014851841,0.0015932968],"category_scores_gemma":[0.005807045,0.00027615475,0.00091484206,0.0012912276,0.0013881101,0.005634728,0.004761236,0.0013415816,0.00048380613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021833007,0.0004239191,0.0054963133,0.00080553576,0.00027367834,0.0018144512,0.001897612,0.14971858,0.08288451,0.40750477,0.013485805,0.33351153],"study_design_scores_gemma":[0.00015757605,0.00050897134,0.0011431964,0.000033612043,0.00007943767,0.0015974903,0.000432722,0.850339,0.0326648,0.099957116,0.012966849,0.0001191973],"about_ca_topic_score_codex":0.0015794646,"about_ca_topic_score_gemma":0.00079469633,"teacher_disagreement_score":0.0033280158,"about_ca_system_score_codex":0.0013051075,"about_ca_system_score_gemma":0.001967018,"threshold_uncertainty_score":0.017600417},"labels":[],"label_agreement":null},{"id":"W7082636690","doi":"10.1109/tdsc.2025.3612882","title":"Collusion-Resistant Privacy-Preserving Outsourced Training Under Single Cloud With Semi-Honest TEE","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Outsourcing; Cloud computing; Collusion; Training (meteorology); Data modeling; Stochastic gradient descent; Information privacy; Training set; Face (sociological concept)","score_opus":0.018766684188058873,"score_gpt":0.22610690501125622,"score_spread":0.20734022082319734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082636690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034472127,0.00030295685,0.960381,0.0008506843,0.000072591305,0.00017491344,0.00025118448,0.000748301,0.0027461788],"genre_scores_gemma":[0.92165107,0.00025241668,0.07454772,0.00031786418,0.00007752741,0.00015559111,0.00023345168,0.00008266385,0.0026817159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925053,0.0018986694,0.0004438205,0.0015281246,0.0021282774,0.0014958594],"domain_scores_gemma":[0.98619854,0.0049131145,0.0013314236,0.0059239627,0.0010633648,0.0005695751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042121205,0.0011458233,0.0022828216,0.0005098,0.0013343557,0.002365649,0.0033796579,0.0018744031,0.0020982937],"category_scores_gemma":[0.015512318,0.00068375154,0.0014248515,0.001407469,0.0023574873,0.0064626173,0.0076184124,0.003457596,0.00066102017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023994844,0.00044426354,0.0033865948,0.00053366006,0.00028041244,0.0016054255,0.0014409825,0.5698496,0.028631413,0.25100374,0.008969593,0.13145483],"study_design_scores_gemma":[0.000060666236,0.0000936335,0.00022825127,0.000020094416,0.000025639727,0.0002750832,0.00008514328,0.94220865,0.0079378085,0.04777625,0.0012543488,0.00003441832],"about_ca_topic_score_codex":0.0024523642,"about_ca_topic_score_gemma":0.0016531062,"teacher_disagreement_score":0.0042121205,"about_ca_system_score_codex":0.0016320639,"about_ca_system_score_gemma":0.0034056748,"threshold_uncertainty_score":0.022276103},"labels":[],"label_agreement":null},{"id":"W7101589494","doi":"10.1109/tdsc.2025.3626379","title":"SXGB: Secure and Efficient Vertical Federated XGBoost via Trusted Execution Environments","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Education and Cultural Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Scheme (mathematics); Encryption; Speedup; Inference; Cloud computing; ENCODE; Information privacy; Data sharing; Cryptography","score_opus":0.012400251836987581,"score_gpt":0.2713866850307167,"score_spread":0.25898643319372916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101589494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0693922,0.00038649267,0.9227563,0.0003126354,0.000084876316,0.0001494428,0.00009129516,0.0047992775,0.002027348],"genre_scores_gemma":[0.8591774,0.00012576552,0.13724141,0.0001740985,0.000028132958,0.0001598305,0.00021412275,0.00019348678,0.002685709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979103,0.0005791643,0.000091092144,0.0003260412,0.0005942509,0.000499095],"domain_scores_gemma":[0.9987514,0.00024794645,0.00018318482,0.00050159794,0.00019435424,0.0001214856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019358257,0.00066490244,0.00089011097,0.00046657224,0.0009737618,0.0012544038,0.0019130209,0.001012113,0.0018517553],"category_scores_gemma":[0.003400306,0.00030561863,0.00057195395,0.0006867308,0.0013610629,0.0019315566,0.0029852237,0.001451028,0.00080784416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00344317,0.0004308579,0.0045735342,0.00025557217,0.0002285498,0.0004201959,0.0005613678,0.54891,0.031565838,0.057126615,0.010258235,0.34222603],"study_design_scores_gemma":[0.000086153166,0.00010159887,0.00025826867,0.000012427388,0.000013323541,0.00006796545,0.000041581567,0.9779805,0.006448318,0.013144486,0.0018299266,0.000015426978],"about_ca_topic_score_codex":0.00321848,"about_ca_topic_score_gemma":0.002753326,"teacher_disagreement_score":0.00321848,"about_ca_system_score_codex":0.001066001,"about_ca_system_score_gemma":0.00251803,"threshold_uncertainty_score":0.010237753},"labels":[],"label_agreement":null},{"id":"W7104008756","doi":"10.1109/tdsc.2025.3628884","title":"Blockchain-Assisted Conditional Anonymous Authentication and Adaptive Tree-Based Group Key Agreement for VANETs","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Group key; Authentication (law); Key (lock); Anonymity; Mutual authentication; Pseudonym; Key management; Vehicular ad hoc network; Cryptography","score_opus":0.011429981100854228,"score_gpt":0.22951669299222324,"score_spread":0.21808671189136902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104008756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043354724,0.00024072842,0.95190394,0.00021170329,0.00007015278,0.00012878569,0.000068477384,0.00043876065,0.0035827185],"genre_scores_gemma":[0.96020806,0.00017517371,0.036926035,0.00004227754,0.00002220376,0.00009345164,0.00009967476,0.000015782602,0.002417395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988815,0.0003303123,0.00007469469,0.00019397662,0.00036394942,0.00015564816],"domain_scores_gemma":[0.9990421,0.00030536094,0.00015132659,0.00018098837,0.00024031478,0.00007978604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009225287,0.00031766167,0.0005477178,0.000479814,0.00081635104,0.0007398845,0.0012849199,0.0006029983,0.0018197214],"category_scores_gemma":[0.0019491832,0.00020577027,0.00033559225,0.0007083437,0.0007604861,0.0016011794,0.0018243368,0.00065366976,0.00047213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006769004,0.000183429,0.0014884521,0.00017925371,0.00007598524,0.00047821808,0.00050399924,0.65813845,0.042545065,0.14226682,0.0031089645,0.15035446],"study_design_scores_gemma":[0.000022400776,0.00010109294,0.00008360184,0.0000050115864,0.000008133638,0.00006356393,0.000022741497,0.98338854,0.0035712954,0.010880053,0.0018389721,0.000014561915],"about_ca_topic_score_codex":0.0020511923,"about_ca_topic_score_gemma":0.0022129505,"teacher_disagreement_score":0.0020511923,"about_ca_system_score_codex":0.0006820513,"about_ca_system_score_gemma":0.0015072662,"threshold_uncertainty_score":0.006087601},"labels":[],"label_agreement":null},{"id":"W7115907317","doi":"10.1109/tdsc.2025.3645856","title":"Two-Server Offline/Online Private Information Retrieval With Small Client Storage","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Server; Outsourcing; Private information retrieval; Task (project management); File server; Scheme (mathematics); Secret sharing; Sublinear function; Computational complexity theory","score_opus":0.013743955289987881,"score_gpt":0.23959824611586086,"score_spread":0.225854290825873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115907317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027713386,0.0012436423,0.9488639,0.00072068843,0.00016333735,0.00076092436,0.0003151122,0.008760942,0.011458009],"genre_scores_gemma":[0.65550977,0.00077800354,0.3226971,0.000649567,0.00022783078,0.00083142385,0.0007820686,0.00038528128,0.01813884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636334,0.00057893177,0.00027945242,0.0005971498,0.0016190386,0.00056203676],"domain_scores_gemma":[0.99590164,0.0005527111,0.00028584487,0.0026713603,0.00040325162,0.00018509416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015536937,0.00096182985,0.0021245093,0.00087308313,0.0012539368,0.0024327673,0.004770801,0.0016916429,0.011829074],"category_scores_gemma":[0.0034848712,0.00075619644,0.0010091629,0.00164586,0.0016933026,0.009569283,0.0062970137,0.0025826797,0.007913313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036567184,0.0009934698,0.0018069152,0.0015544886,0.00023768403,0.0012980435,0.0010444482,0.048802756,0.1892757,0.24088724,0.02838442,0.48205808],"study_design_scores_gemma":[0.00064066413,0.0008788406,0.0006952553,0.000110170295,0.00015147087,0.0029510912,0.00041806523,0.7272417,0.14090705,0.07833513,0.047325432,0.0003450943],"about_ca_topic_score_codex":0.0008558754,"about_ca_topic_score_gemma":0.0005772215,"teacher_disagreement_score":0.011829074,"about_ca_system_score_codex":0.0013964556,"about_ca_system_score_gemma":0.0019268896,"threshold_uncertainty_score":0.03957218},"labels":[],"label_agreement":null},{"id":"W7116407680","doi":"10.1109/tdsc.2025.3646011","title":"Efficient and Secure Data Sharing With Mobile Crowdsensing in Internet of Vehicles","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Data sharing; Information privacy; The Internet; Encryption; Single point of failure; Mobile device; Data security; Protocol (science); Bloom filter; Secure multi-party computation","score_opus":0.01858765233178488,"score_gpt":0.2587873833948896,"score_spread":0.24019973106310472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116407680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08451989,0.0004205055,0.9108671,0.00040200833,0.00007598727,0.00013654667,0.000052815863,0.00061854883,0.002906638],"genre_scores_gemma":[0.9572776,0.0001346773,0.040928844,0.00009867288,0.000026045567,0.000068818656,0.00004112066,0.000019900284,0.0014044864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973363,0.0005316195,0.0001663582,0.00053332647,0.0010503258,0.00038208492],"domain_scores_gemma":[0.99827707,0.0005312733,0.00025639596,0.0005558063,0.0002934905,0.00008589663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194775,0.0005643742,0.0009217941,0.0005346717,0.001179855,0.0012374099,0.0018115349,0.001368566,0.0007269834],"category_scores_gemma":[0.0029922228,0.00027037447,0.0007172094,0.0008704943,0.001475312,0.002935704,0.0033153852,0.0009863719,0.00026087026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014633914,0.00025811294,0.00306127,0.0004684482,0.00017417657,0.0017822342,0.0012548629,0.4726396,0.1145372,0.13070244,0.0030196256,0.27063859],"study_design_scores_gemma":[0.00005087517,0.00021846846,0.00026854686,0.000018518444,0.000031837535,0.0003631381,0.00015676678,0.93595815,0.027759124,0.031237762,0.0038858699,0.000050989358],"about_ca_topic_score_codex":0.0019834985,"about_ca_topic_score_gemma":0.0010994907,"teacher_disagreement_score":0.0019834985,"about_ca_system_score_codex":0.0009915805,"about_ca_system_score_gemma":0.0012683746,"threshold_uncertainty_score":0.0071944594},"labels":[],"label_agreement":null},{"id":"W7116888641","doi":"10.1109/tdsc.2025.3647497","title":"TCKKS: An Efficient TEE-Assistance CKKS Scheme Without Bootstrapping","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Homomorphic encryption; Overhead (engineering); Encryption; Scheme (mathematics); Protocol (science); Computation; Multiplication (music); Ciphertext","score_opus":0.01495754377834254,"score_gpt":0.26976911521880276,"score_spread":0.25481157144046024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116888641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15687206,0.0013029837,0.81553394,0.0012046241,0.00050191884,0.0009958714,0.00069104135,0.0030184337,0.019879108],"genre_scores_gemma":[0.9090655,0.0003661312,0.08285937,0.0001753839,0.000066927365,0.0002455085,0.00045677842,0.00008354344,0.0066808057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981495,0.0003774132,0.00017285795,0.0002522972,0.0006303332,0.00041761174],"domain_scores_gemma":[0.998018,0.00033557802,0.00029781758,0.00085777923,0.00032850285,0.00016233622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082642725,0.00054060103,0.0009572898,0.00067079917,0.0011193575,0.0012502994,0.0013447233,0.0009625504,0.003183402],"category_scores_gemma":[0.003226334,0.00029292316,0.0006617842,0.0010358795,0.001166384,0.0041275597,0.0038939517,0.0015972522,0.0010297622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028736782,0.0004475243,0.0024745928,0.0010120592,0.00021042213,0.0014261281,0.0012131034,0.15701407,0.12801772,0.39587277,0.021598855,0.28783908],"study_design_scores_gemma":[0.00055845804,0.00052230695,0.0011374654,0.000110132845,0.00014209769,0.0016979618,0.00041335972,0.80422616,0.056802228,0.091363356,0.042696536,0.00032987545],"about_ca_topic_score_codex":0.0014643283,"about_ca_topic_score_gemma":0.0012169367,"teacher_disagreement_score":0.003183402,"about_ca_system_score_codex":0.0010886105,"about_ca_system_score_gemma":0.002643137,"threshold_uncertainty_score":0.010649502},"labels":[],"label_agreement":null},{"id":"W7117464464","doi":"10.1109/tdsc.2025.3649054","title":"Cross-Domain Heterogeneous Data Aggregation With Dynamic Group Key Agreement for Hybrid Satellite Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Geostationary orbit; Eavesdropping; Dynamic data; Data aggregator; Key (lock); Adaptability; Data security; Data transmission; Transmission (telecommunications); Satellite","score_opus":0.018923215420367314,"score_gpt":0.27194110649458986,"score_spread":0.25301789107422257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117464464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035951555,0.00044853144,0.9607392,0.0001462275,0.000051768504,0.000068457186,0.00002141696,0.0002263628,0.0023464528],"genre_scores_gemma":[0.93283504,0.0002618866,0.065437794,0.00007386682,0.00003659589,0.00008547155,0.00006313092,0.000014465476,0.0011917914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989201,0.0003364831,0.00008419372,0.00021944268,0.00030643537,0.00013341439],"domain_scores_gemma":[0.9991406,0.00028044096,0.00014576681,0.0002396187,0.00014842168,0.000045062454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011007913,0.00040104496,0.0004891383,0.00052313006,0.00082904,0.0008691508,0.000929053,0.0004430284,0.0006995471],"category_scores_gemma":[0.0015181394,0.00019343584,0.00041187616,0.0008047655,0.0007364734,0.0016400309,0.0019952776,0.00066349655,0.00020510584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007213394,0.0001864827,0.00222263,0.00041023284,0.0002510822,0.0012789223,0.0012774894,0.43057156,0.12926999,0.20292154,0.0047378656,0.22615081],"study_design_scores_gemma":[0.000019287267,0.00013966653,0.00026795943,0.000012476356,0.000038065817,0.00022537587,0.000105364124,0.96247727,0.013748771,0.019109188,0.00382681,0.000029869625],"about_ca_topic_score_codex":0.0007633905,"about_ca_topic_score_gemma":0.0007881802,"teacher_disagreement_score":0.0011007913,"about_ca_system_score_codex":0.00082501536,"about_ca_system_score_gemma":0.00059636374,"threshold_uncertainty_score":0.0059859753},"labels":[],"label_agreement":null},{"id":"W7117536728","doi":"10.1109/tdsc.2025.3649362","title":"KDCS: Achieving Efficient and Privacy-Preserving ($k,d$k,d)-Truss Community Search for Social Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Encryption; Social network (sociolinguistics); Server; Cloud computing; Social network analysis; Tree (set theory); Vertex (graph theory); Information privacy","score_opus":0.0240214184782693,"score_gpt":0.30384515331443596,"score_spread":0.2798237348361667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117536728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029891124,0.0006282969,0.9568863,0.0020272653,0.00011516279,0.00063504535,0.0019933144,0.004121333,0.0037021157],"genre_scores_gemma":[0.37651533,0.0007589408,0.60520023,0.0011375344,0.00023896736,0.00076661236,0.0053391587,0.00044355745,0.009599723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942491,0.0015576865,0.0004357586,0.0015057698,0.0017894177,0.0004621121],"domain_scores_gemma":[0.9883052,0.0038938748,0.0010341171,0.0046322695,0.0014178535,0.00071674585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038120667,0.0016484697,0.0030070853,0.0033555129,0.0027935398,0.0040044123,0.007064722,0.0034361472,0.0038571625],"category_scores_gemma":[0.020303011,0.0010308282,0.0024914844,0.005613581,0.0025080708,0.007927828,0.008466413,0.0026033635,0.0025359737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012398418,0.0008005044,0.0044669798,0.0008132721,0.00038238708,0.00038253664,0.000985336,0.3633545,0.01112421,0.16445765,0.062194757,0.389798],"study_design_scores_gemma":[0.00010725923,0.00010067274,0.00029689455,0.00002380307,0.00003689632,0.00019920262,0.000116168594,0.9016299,0.004242197,0.08723655,0.0059713703,0.00003897682],"about_ca_topic_score_codex":0.012562925,"about_ca_topic_score_gemma":0.018246036,"teacher_disagreement_score":0.012562925,"about_ca_system_score_codex":0.003527236,"about_ca_system_score_gemma":0.006262393,"threshold_uncertainty_score":0.02559203},"labels":[],"label_agreement":null}]}