{"meta":{"query_hash":"c206f60a7d7f","filters":{"venue":"IEEE Transactions on Information Forensics and Security"},"cohort_total":123,"direct_labels_cover":1,"predictions_cover":123,"exported":123,"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/c206f60a7d7f","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Information+Forensics+and+Security"},"results":[{"id":"W1516840126","doi":"10.1109/tifs.2015.2446436","title":"Improving wireless secrecy rate via full-duplex relay-assisted protocols","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Full-Duplex Wireless Communications","field":"Engineering","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":"McGill University","funders":"","keywords":"Relay; Jamming; Computer science; Secrecy; Fading; Wireless; Computer network; Transmission (telecommunications); Channel (broadcasting); Secure transmission; Power (physics); Telecommunications; Computer security; Physics","score_opus":0.020106273883353572,"score_gpt":0.23503147559740156,"score_spread":0.214925201714048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516840126","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.07229993,0.0007785449,0.9208959,0.00015561924,0.000041983127,0.00003862072,0.00004356039,0.00025164452,0.00549416],"genre_scores_gemma":[0.95290494,0.0007239738,0.044896904,0.00004273562,0.000025465752,0.000048551352,0.000023962271,0.00002918221,0.0013043204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986041,0.00067900534,0.000067106936,0.00015041544,0.0003507451,0.00014859869],"domain_scores_gemma":[0.99651307,0.0022759994,0.0003231163,0.00040539342,0.00042868662,0.00005367495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064627,0.0007831887,0.00070706464,0.0006334492,0.00042651166,0.0012016137,0.0009812224,0.00068955566,0.0011092911],"category_scores_gemma":[0.004209871,0.0003893495,0.00066631037,0.0007233408,0.0011798481,0.0019334282,0.0013509503,0.0006855031,0.0003395869],"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.00023810402,0.00006907496,0.00086213404,0.00024751254,0.0000989873,0.00038855313,0.00033049306,0.80717474,0.03857635,0.10830499,0.0008119301,0.042897098],"study_design_scores_gemma":[0.000012201436,0.00007370924,0.00008822228,0.000012083496,0.000022338763,0.00012293001,0.000027484013,0.9839431,0.0069677513,0.008102243,0.00060992496,0.00001804088],"about_ca_topic_score_codex":0.0005011029,"about_ca_topic_score_gemma":0.00038612707,"teacher_disagreement_score":0.002064627,"about_ca_system_score_codex":0.0006325467,"about_ca_system_score_gemma":0.00061773235,"threshold_uncertainty_score":0.010918915},"labels":[],"label_agreement":null},{"id":"W1604614341","doi":"10.1109/tifs.2015.2434600","title":"A Strategy of Clustering Modification Directions in Spatial Image Steganography","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":231,"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":"National Key Research and Development Program of China; Binghamton University; Sun Yat-sen University; National Natural Science Foundation of China; McGill University","keywords":"Embedding; Steganalysis; Pixel; Computer science; Steganography; Distortion (music); Cluster analysis; Distortion function; Image (mathematics); Artificial intelligence; Cover (algebra); Pattern recognition (psychology); Exploit; Data mining; Algorithm; Computer security; Telecommunications","score_opus":0.019785680039267017,"score_gpt":0.25303721857959244,"score_spread":0.23325153854032543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604614341","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.0676226,0.00041424812,0.92954767,0.0001202207,0.000039223647,0.000056342495,0.000025945033,0.00025253938,0.00192117],"genre_scores_gemma":[0.68809426,0.0003743964,0.3084177,0.00007139642,0.000026727534,0.00009913999,0.000052348187,0.000039443443,0.0028245186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997925,0.000042620595,0.0000109379425,0.00005280134,0.00008009529,0.000020972198],"domain_scores_gemma":[0.9997614,0.00004708183,0.00004143976,0.000056593162,0.000073556104,0.000019867526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021329918,0.00051617733,0.0003439114,0.0004803256,0.00034299772,0.00029017442,0.0005686523,0.0004581325,0.00048570093],"category_scores_gemma":[0.00062641833,0.00023697055,0.00028584505,0.00046235207,0.0005127735,0.0005489149,0.0005336834,0.00037378672,0.00019881237],"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.00035828273,0.000115735784,0.0018230671,0.00016001632,0.000075519936,0.00020518171,0.00020932555,0.22862123,0.31138048,0.046692617,0.0013121858,0.40904635],"study_design_scores_gemma":[0.000043483986,0.00043138306,0.0021206585,0.000017831893,0.00004864289,0.000673796,0.00007383498,0.87057734,0.107761584,0.010427645,0.007735118,0.00008867865],"about_ca_topic_score_codex":0.0010823605,"about_ca_topic_score_gemma":0.0014412818,"teacher_disagreement_score":0.0010823605,"about_ca_system_score_codex":0.00028977435,"about_ca_system_score_gemma":0.00032059918,"threshold_uncertainty_score":0.002152145},"labels":[],"label_agreement":null},{"id":"W1964850609","doi":"10.1109/tifs.2006.885036","title":"Gaussian Mixture Modeling of Short-Time Fourier Transform Features for Audio Fingerprinting","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Music and Audio Processing","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Pattern recognition (psychology); Mixture model; Centroid; Artificial intelligence; Fingerprint (computing); Speech recognition; Cepstrum; Audio signal; Robustness (evolution); Entropy (arrow of time); Word error rate; Speech coding","score_opus":0.007905369170801714,"score_gpt":0.21482533342175678,"score_spread":0.20691996425095507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964850609","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.021128114,0.0005287189,0.97625196,0.000096681426,0.00007906418,0.000042806485,0.00012784045,0.0010597198,0.00068519096],"genre_scores_gemma":[0.6292579,0.001103005,0.36397672,0.00009554465,0.00010960686,0.00012447915,0.0007851794,0.0002912479,0.00425633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993631,0.00015961948,0.000029069752,0.00011960717,0.0002561816,0.0000725035],"domain_scores_gemma":[0.9988011,0.0006953752,0.000090086935,0.0001480134,0.00023759727,0.000027707252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015091951,0.0008528316,0.0008266639,0.0011023901,0.00026412148,0.00066695403,0.0009155902,0.0008147369,0.001585073],"category_scores_gemma":[0.0043242816,0.00031860525,0.0010515788,0.0010803152,0.0003702177,0.0012884506,0.00041112571,0.0010321249,0.0011223283],"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.00046402437,0.00015478583,0.0032042991,0.00012644642,0.00014146857,0.00016506182,0.00012227158,0.6293078,0.030692363,0.0096820025,0.002616838,0.32332262],"study_design_scores_gemma":[0.000002843613,0.000021119919,0.0006880402,0.0000038344265,0.000011932311,0.000032488413,0.0000065350882,0.99444914,0.0030357833,0.001154065,0.00058143685,0.000012877663],"about_ca_topic_score_codex":0.0065553747,"about_ca_topic_score_gemma":0.0045178877,"teacher_disagreement_score":0.0065553747,"about_ca_system_score_codex":0.0006194031,"about_ca_system_score_gemma":0.00046017166,"threshold_uncertainty_score":0.013034463},"labels":[],"label_agreement":null},{"id":"W1984156542","doi":"10.1109/tifs.2013.2280884","title":"A Study of XSS Worm Propagation and Detection Mechanisms in Online Social Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cross-site scripting; Computer science; Scripting language; Resource (disambiguation); Computer security; Distributed computing; Computer network; World Wide Web; The Internet; Operating system","score_opus":0.009600384868564866,"score_gpt":0.21306882299002194,"score_spread":0.20346843812145707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984156542","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.7462017,0.0008304336,0.24494259,0.0012555238,0.000035668865,0.00021612554,0.00017307365,0.00040571528,0.005939206],"genre_scores_gemma":[0.98966414,0.00028929266,0.009065628,0.00003869685,0.000016659189,0.000057936497,0.000027321548,0.000012800993,0.00082753255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856997,0.00075698626,0.000042753592,0.0002008009,0.00025562505,0.00017385793],"domain_scores_gemma":[0.9752382,0.01870114,0.0036675334,0.00091683527,0.0010524075,0.0004239009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026573895,0.00088582473,0.0007405183,0.002021146,0.0009630714,0.0011719882,0.0016008789,0.0017201386,0.0013331764],"category_scores_gemma":[0.01977852,0.00056754175,0.00069797394,0.0012620372,0.0018090189,0.004109728,0.0009001254,0.0008973393,0.00018606673],"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.0001266048,0.00021456172,0.013083028,0.00014705813,0.000115283015,0.0004185111,0.0006401617,0.89504766,0.0054797307,0.06447673,0.00092318776,0.019327413],"study_design_scores_gemma":[0.000008175047,0.000056859288,0.00082983775,0.000011007023,0.000014638855,0.00011654502,0.00007795437,0.99340147,0.0004603929,0.0047964323,0.0002146981,0.000011951589],"about_ca_topic_score_codex":0.00682506,"about_ca_topic_score_gemma":0.0038190666,"teacher_disagreement_score":0.00682506,"about_ca_system_score_codex":0.0022628661,"about_ca_system_score_gemma":0.0008805345,"threshold_uncertainty_score":0.016418278},"labels":[],"label_agreement":null},{"id":"W1986024748","doi":"10.1109/tifs.2013.2281219","title":"Compressed Binary Image Hashes Based on Semisupervised Spectral Embedding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":23,"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":"Hash function; Computer science; Artificial intelligence; Hamming space; Pattern recognition (psychology); Double hashing; Binary image; Image retrieval; Embedding; Binary number; Hash table; Image (mathematics); Computer vision; Image processing; Algorithm; Hamming code; Mathematics","score_opus":0.009165875793272747,"score_gpt":0.24355840156575415,"score_spread":0.2343925257724814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986024748","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.05406357,0.00017111373,0.94360757,0.00013157837,0.0000562024,0.00008177542,0.0000975211,0.0004855466,0.0013051893],"genre_scores_gemma":[0.5682847,0.0002295531,0.42737573,0.00010136972,0.00009602427,0.00012454498,0.00043376136,0.00008283187,0.0032714624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937195,0.00013698066,0.000031819825,0.00010111858,0.00032170466,0.000036463003],"domain_scores_gemma":[0.99871707,0.0003480845,0.00020739612,0.00033405595,0.00033956696,0.000053813263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474741,0.0004405584,0.00053083274,0.00071974314,0.0002465105,0.0006087898,0.0006626583,0.0005084925,0.0019110835],"category_scores_gemma":[0.003334491,0.00019112891,0.00028570555,0.00068426004,0.0007072608,0.0019465941,0.00096772553,0.00061514345,0.00083378906],"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.0008281085,0.00019156586,0.0013449689,0.00019876016,0.00006859213,0.00021531347,0.00024533342,0.13475086,0.10844346,0.056106325,0.0029230972,0.6946837],"study_design_scores_gemma":[0.000028877374,0.00018539306,0.00058203563,0.000013422977,0.000012732384,0.00038351136,0.00005555033,0.9484597,0.03797957,0.010352619,0.0019158259,0.0000308227],"about_ca_topic_score_codex":0.00041304866,"about_ca_topic_score_gemma":0.0004932518,"teacher_disagreement_score":0.0019110835,"about_ca_system_score_codex":0.00034821298,"about_ca_system_score_gemma":0.00046612878,"threshold_uncertainty_score":0.006393194},"labels":[],"label_agreement":null},{"id":"W1993695587","doi":"10.1109/tifs.2013.2293113","title":"Cooperative Key Agreement for Wireless Networking: Key Rates and Practical Protocol Design","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"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":"Key-agreement protocol; Computer science; Relay; Computer network; Key (lock); Node (physics); Wireless; Pre-shared key; Wireless network; Fading; Protocol (science); Upper and lower bounds; Block (permutation group theory); Key exchange; Public-key cryptography; Key distribution; Computer security; Channel (broadcasting); Telecommunications; Encryption; Mathematics","score_opus":0.025863364892189145,"score_gpt":0.28155960445837236,"score_spread":0.2556962395661832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993695587","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.002323902,0.0004717904,0.9954281,0.0002453457,0.000020353287,0.000093201066,0.000009795191,0.000054994613,0.0013525243],"genre_scores_gemma":[0.40946278,0.002558494,0.583687,0.0002097256,0.00018854387,0.0014645618,0.0000995777,0.00009470415,0.002234675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895639,0.006095188,0.00045131738,0.0008378514,0.0026123535,0.00043949098],"domain_scores_gemma":[0.9879822,0.007440591,0.0010650309,0.002185802,0.0011728152,0.0001535075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012664442,0.001537625,0.0011861828,0.0010818018,0.0010612292,0.0029772979,0.0034967512,0.0025407376,0.0015371661],"category_scores_gemma":[0.027203836,0.001045352,0.00082441693,0.0015915063,0.0041701137,0.007008237,0.0032511961,0.0033031711,0.0007110856],"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.00009997045,0.00007756404,0.0002862608,0.00036236728,0.000053446678,0.00014959417,0.00034700875,0.18093355,0.0061257877,0.7686685,0.00089372136,0.042002283],"study_design_scores_gemma":[0.00006974883,0.00014492884,0.00005698741,0.00009999112,0.0000358551,0.00022015814,0.00007908335,0.6910106,0.005789869,0.296891,0.005555646,0.000046147918],"about_ca_topic_score_codex":0.0005247504,"about_ca_topic_score_gemma":0.00036585794,"teacher_disagreement_score":0.012664442,"about_ca_system_score_codex":0.0025338987,"about_ca_system_score_gemma":0.002268444,"threshold_uncertainty_score":0.066976726},"labels":[],"label_agreement":null},{"id":"W1996077944","doi":"10.1109/tifs.2014.2332816","title":"A Game-Theoretic Framework for Robust Optimal Intrusion Detection in Wireless Sensor Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":52,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Wireless sensor network; Game theory; Robust optimization; Sensitivity (control systems); Robustness (evolution); Mathematical optimization; Stability (learning theory); Complete information; Optimization problem; Wireless; Data mining; Computer network; Machine learning; Mathematical economics; Mathematics; Algorithm","score_opus":0.006799168688328103,"score_gpt":0.20801786137000988,"score_spread":0.20121869268168177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996077944","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.0023418276,0.00022833911,0.9934841,0.00020868439,0.000042492255,0.000057472393,0.00003690436,0.000039731036,0.0035604418],"genre_scores_gemma":[0.68255264,0.0017402077,0.30506426,0.0003428489,0.00025595387,0.001069623,0.00016749327,0.000111836205,0.008695203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971614,0.0014380246,0.00013056272,0.0003793515,0.0006541012,0.0002365435],"domain_scores_gemma":[0.99705935,0.0020559002,0.00034779563,0.00010854957,0.00029839418,0.0001301743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037946124,0.0025867869,0.0018805787,0.0012198857,0.00069768296,0.0025873086,0.0030643751,0.0022515708,0.0024768491],"category_scores_gemma":[0.007161948,0.00089014915,0.0017576047,0.0011918753,0.0034190805,0.00266058,0.002296866,0.0029986254,0.0004001544],"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.000021178796,0.000028944087,0.00009793087,0.0000892994,0.000041911706,0.00010389245,0.00007739607,0.7516288,0.0007663965,0.24090995,0.0005549366,0.005679343],"study_design_scores_gemma":[0.000013131198,0.000046248406,0.000035701923,0.00001732616,0.000011598923,0.000031195537,0.000019536958,0.9230592,0.00014976169,0.07557666,0.0010252901,0.000014417826],"about_ca_topic_score_codex":0.004228934,"about_ca_topic_score_gemma":0.002828188,"teacher_disagreement_score":0.004228934,"about_ca_system_score_codex":0.0029915075,"about_ca_system_score_gemma":0.0025360533,"threshold_uncertainty_score":0.021705031},"labels":[],"label_agreement":null},{"id":"W2015046270","doi":"10.1109/tifs.2015.2415753","title":"An Efficient HOS-Based Gait Authentication of Accelerometer Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Accelerometer; Computer science; Authentication (law); Gait; Feature (linguistics); Acceleration; Data set; Artificial intelligence; Pattern recognition (psychology); Feature vector; Set (abstract data type); Sensor fusion; Feature extraction; Computer vision; Real-time computing; Data mining; Computer security","score_opus":0.03201364679535029,"score_gpt":0.2490443950613319,"score_spread":0.21703074826598162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015046270","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.050163336,0.0004637488,0.9457865,0.00009053116,0.00010861667,0.00009358352,0.00023143442,0.001976862,0.0010853431],"genre_scores_gemma":[0.56363684,0.00044325937,0.42969766,0.00008285366,0.00011896501,0.000107237065,0.0009389261,0.00007167365,0.004902549],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934787,0.00012923767,0.000053103817,0.00012422053,0.0002851156,0.00006041244],"domain_scores_gemma":[0.99950767,0.00009251279,0.00009442304,0.00011794857,0.00016201807,0.000025406662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046553113,0.0005451927,0.0007015855,0.0012249373,0.00024827413,0.00059646094,0.0004675718,0.000433554,0.0011654411],"category_scores_gemma":[0.0014248522,0.00022404862,0.0003977997,0.0009930179,0.0002469245,0.00071941194,0.0008314034,0.0002849045,0.0018035156],"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.00067908486,0.00015173673,0.0030625965,0.00018886787,0.000093375194,0.00024388185,0.00009375594,0.024491113,0.12032811,0.0029749593,0.0029986955,0.8446937],"study_design_scores_gemma":[0.000041244948,0.0004941362,0.008195509,0.00002637153,0.000060446553,0.00070541474,0.000080436104,0.92001736,0.0625191,0.0019328669,0.0058733714,0.00005369279],"about_ca_topic_score_codex":0.00074198766,"about_ca_topic_score_gemma":0.0010838468,"teacher_disagreement_score":0.0012249373,"about_ca_system_score_codex":0.00013718735,"about_ca_system_score_gemma":0.00041419014,"threshold_uncertainty_score":0.0038987994},"labels":[],"label_agreement":null},{"id":"W2017950063","doi":"10.1109/tifs.2012.2190594","title":"Perceptual Image Hashing Based on Shape Contexts and Local Feature Points","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":174,"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":"Artificial intelligence; Computer science; Scale-invariant feature transform; Hash function; Pattern recognition (psychology); Feature (linguistics); Computer vision; Feature detection (computer vision); Feature extraction; Image retrieval; Robustness (evolution); Image (mathematics); Image processing","score_opus":0.009477938299568691,"score_gpt":0.24751285478511176,"score_spread":0.23803491648554306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017950063","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.062215444,0.0011327205,0.93367505,0.00006757886,0.00008859487,0.0001406545,0.00009212558,0.00054117484,0.0020466836],"genre_scores_gemma":[0.6900039,0.0007943717,0.30703372,0.000077045835,0.00012511357,0.00009351219,0.00018039734,0.000063828425,0.0016281194],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999345,0.000119523815,0.00003543855,0.00013578455,0.0003209899,0.000043301705],"domain_scores_gemma":[0.99908125,0.00023821485,0.00014612601,0.00030664675,0.00018131161,0.000046488174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005032792,0.0004919889,0.0006802898,0.0011136758,0.0002462669,0.00050948054,0.00072673644,0.00039227132,0.0013585447],"category_scores_gemma":[0.0024648272,0.00025062414,0.0004570695,0.0010167127,0.00085686316,0.0013899694,0.0011721897,0.00045333887,0.00060923846],"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.0008711466,0.00009603386,0.00201368,0.00043463497,0.00010867138,0.00030280635,0.00023523236,0.044819724,0.23293294,0.02966288,0.0019214925,0.68660074],"study_design_scores_gemma":[0.00014551065,0.0013630844,0.0114160245,0.000064825275,0.00017731264,0.0027322946,0.00023498533,0.75231004,0.19044632,0.027906498,0.012972354,0.0002308098],"about_ca_topic_score_codex":0.00040878015,"about_ca_topic_score_gemma":0.00043957427,"teacher_disagreement_score":0.0013585447,"about_ca_system_score_codex":0.0002588804,"about_ca_system_score_gemma":0.00027657158,"threshold_uncertainty_score":0.0045447946},"labels":[],"label_agreement":null},{"id":"W2019722845","doi":"10.1109/tifs.2014.2361205","title":"Earprint: Transient Evoked Otoacoustic Emission for Biometrics","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Hearing, Cochlea, Tinnitus, Genetics","field":"Neuroscience","cited_by":18,"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; Oklahoma Agricultural Experiment Station","keywords":"Computer science; Biometrics; Spoofing attack; Speech recognition; Modalities; Wavelet; Artificial intelligence; Pattern recognition (psychology); Computer security","score_opus":0.021751102107241013,"score_gpt":0.254467515279824,"score_spread":0.23271641317258296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019722845","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.011275798,0.0063408227,0.9517637,0.0007204937,0.00061802927,0.00019048898,0.0019828277,0.0102096815,0.01689823],"genre_scores_gemma":[0.27320892,0.008353316,0.63547444,0.0013010845,0.0009964068,0.00064146915,0.0051277513,0.0012625459,0.07363407],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992902,0.00011178237,0.00004454761,0.00017775239,0.00033319043,0.0000424855],"domain_scores_gemma":[0.999445,0.00015903992,0.000080740916,0.0001365019,0.00013948504,0.00003917011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918332,0.00079374656,0.00048871,0.0010259525,0.00032173976,0.0009259445,0.0008442835,0.001413581,0.016370753],"category_scores_gemma":[0.0012527985,0.00016611513,0.0003027886,0.0013215364,0.0005511469,0.001083886,0.0009168635,0.00073758006,0.01597765],"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.00065738056,0.00013849896,0.0011653465,0.00075661694,0.00004328101,0.00070560037,0.000093886716,0.0030910298,0.20522085,0.019467803,0.028653802,0.74000585],"study_design_scores_gemma":[0.00015708986,0.000901594,0.012733313,0.00042311646,0.00010106372,0.009474142,0.00021218408,0.16684659,0.29243517,0.044616666,0.47185653,0.00024251902],"about_ca_topic_score_codex":0.00024750715,"about_ca_topic_score_gemma":0.00032412887,"teacher_disagreement_score":0.016370753,"about_ca_system_score_codex":0.0002918783,"about_ca_system_score_gemma":0.00026343568,"threshold_uncertainty_score":0.054765582},"labels":[],"label_agreement":null},{"id":"W2023425418","doi":"10.1109/tifs.2013.2264462","title":"Extracting Spread-Spectrum Hidden Data From Digital Media","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University at Buffalo","keywords":"Computer science; Spread spectrum; Embedding; Host (biology); Autocorrelation; Algorithm; Autocorrelation matrix; Artificial intelligence; Channel (broadcasting); Mathematics; Telecommunications; Statistics","score_opus":0.02086315380313131,"score_gpt":0.23862696085099117,"score_spread":0.21776380704785986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023425418","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.082639925,0.00024843705,0.91612536,0.0001521711,0.00003194048,0.00002510221,0.00003889757,0.00012402043,0.00061417196],"genre_scores_gemma":[0.5911421,0.00073740166,0.40454036,0.00007193329,0.00008969591,0.000040566723,0.00014003403,0.000035351793,0.0032025801],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998173,0.000026693579,0.000009836336,0.00003711087,0.00009305332,0.000015983027],"domain_scores_gemma":[0.99950063,0.00024957638,0.0000877542,0.00008918741,0.000055746885,0.000017046097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032710028,0.0005331803,0.00047076694,0.00054184376,0.00023362761,0.0005542561,0.0005620158,0.0008950432,0.00061538536],"category_scores_gemma":[0.001578858,0.0002194837,0.00034175627,0.0003830036,0.0011165049,0.0014200797,0.0009564939,0.0005300311,0.0003687274],"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.00040488914,0.00012889254,0.0014747961,0.0005291594,0.00007654239,0.0010700624,0.00038098567,0.22753976,0.3912727,0.037677024,0.0006120104,0.3388331],"study_design_scores_gemma":[0.000025647716,0.0001783766,0.00056275155,0.000026614649,0.000024775876,0.00058253476,0.00013407796,0.77265936,0.20444892,0.019393148,0.0019250296,0.00003879088],"about_ca_topic_score_codex":0.00030052065,"about_ca_topic_score_gemma":0.00033020938,"teacher_disagreement_score":0.0008950432,"about_ca_system_score_codex":0.00017694614,"about_ca_system_score_gemma":0.00035356564,"threshold_uncertainty_score":0.0020586848},"labels":[],"label_agreement":null},{"id":"W2031230980","doi":"10.1109/tifs.2014.2360430","title":"On Evaluating ECG Biometric Systems: Session-Dependence and Body Posture","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":91,"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":"Biometrics; Modality (human–computer interaction); Computer science; Session (web analytics); Artificial intelligence; Table (database); Pattern recognition (psychology); Data mining; Speech recognition","score_opus":0.013536534620230125,"score_gpt":0.2808454403465573,"score_spread":0.26730890572632715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031230980","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.6374953,0.005694632,0.34742692,0.00035658205,0.0002306603,0.0003139485,0.0006467804,0.0008056093,0.0070295483],"genre_scores_gemma":[0.9461604,0.0026213478,0.048786648,0.0001193891,0.00015351604,0.00008736126,0.00044092254,0.00006670693,0.0015637073],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99712014,0.0010918555,0.00024592076,0.0004271143,0.0009939456,0.000121053294],"domain_scores_gemma":[0.9908664,0.005912204,0.001092375,0.0006784133,0.0012725625,0.00017808142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003228379,0.00070683385,0.00095997046,0.0011500798,0.00031220747,0.0010589452,0.00050313486,0.0012572244,0.00085770735],"category_scores_gemma":[0.0131165115,0.00014585158,0.00041191818,0.0009774328,0.0003494544,0.0011958389,0.0008677937,0.00041119553,0.000605649],"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.0018601861,0.00033364244,0.07782124,0.00080422516,0.00043163926,0.00048442575,0.0003559981,0.02782013,0.2398506,0.00125246,0.0012207415,0.6477647],"study_design_scores_gemma":[0.000054045042,0.006651335,0.42464608,0.00027200588,0.0007729021,0.0069337822,0.00090587913,0.35393566,0.19677845,0.0034723456,0.005268448,0.00030896324],"about_ca_topic_score_codex":0.0006010145,"about_ca_topic_score_gemma":0.001203517,"teacher_disagreement_score":0.003228379,"about_ca_system_score_codex":0.0001919696,"about_ca_system_score_gemma":0.0002899778,"threshold_uncertainty_score":0.017073512},"labels":[],"label_agreement":null},{"id":"W2061474925","doi":"10.1109/tifs.2015.2428211","title":"Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":37,"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":"Fading; Computer science; Chaotic; Additive white Gaussian noise; Frequency domain; Randomness; Key (lock); Multipath propagation; Algorithm; Wireless; Channel (broadcasting); Electronic engineering; Telecommunications; Mathematics; Artificial intelligence; Statistics; Engineering","score_opus":0.03506988753299073,"score_gpt":0.25382222996129383,"score_spread":0.2187523424283031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061474925","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.16533129,0.00059453334,0.8296878,0.00020268686,0.00006019797,0.00007411909,0.000032401174,0.0002329952,0.0037840232],"genre_scores_gemma":[0.8846046,0.00029968307,0.1139442,0.000030652038,0.00003504039,0.000026677619,0.000030637246,0.000022529257,0.001006045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995065,0.00016012024,0.00002541853,0.00006699344,0.00017144873,0.00006954917],"domain_scores_gemma":[0.99925345,0.00037387898,0.00014508008,0.00012900984,0.000071704395,0.00002689828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006253821,0.0003782113,0.00046622526,0.00041346173,0.00043220402,0.00048428972,0.0003893876,0.00051879254,0.00071981316],"category_scores_gemma":[0.001836692,0.00014465326,0.00023418515,0.00040826295,0.000688507,0.0012650458,0.0009081574,0.00043732772,0.00022314218],"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.0008724452,0.00010292331,0.001987074,0.00036013228,0.00012886227,0.0008913881,0.0005875416,0.27029178,0.26689672,0.16977532,0.0011629602,0.2869428],"study_design_scores_gemma":[0.00009398435,0.00047837052,0.00064179685,0.000038965998,0.000051390354,0.0013534605,0.00009487752,0.826639,0.13946299,0.023327598,0.0077566267,0.00006095473],"about_ca_topic_score_codex":0.00010728756,"about_ca_topic_score_gemma":0.00010547402,"teacher_disagreement_score":0.00071981316,"about_ca_system_score_codex":0.0002893448,"about_ca_system_score_gemma":0.00025344617,"threshold_uncertainty_score":0.0033074021},"labels":[],"label_agreement":null},{"id":"W2088335436","doi":"10.1109/tifs.2015.2407153","title":"Key Generation Over Wiretap Models With Non-Causal Side Information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"Key (lock); Computer science; Channel (broadcasting); Upper and lower bounds; Gaussian; Function (biology); Theoretical computer science; Topology (electrical circuits); Artificial intelligence; Combinatorics; Discrete mathematics; Algorithm; Mathematics; Telecommunications; Physics; Computer security; Mathematical analysis","score_opus":0.01903624676730526,"score_gpt":0.21596368516515427,"score_spread":0.19692743839784901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088335436","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.08489685,0.0005710649,0.9061561,0.00081389624,0.000058624566,0.00007542663,0.00031575313,0.0003686394,0.0067435713],"genre_scores_gemma":[0.96724766,0.0008117299,0.025257692,0.00012370599,0.00008585239,0.00016506053,0.00022749587,0.00010057159,0.005980294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605906,0.0015304731,0.00014275232,0.00064733124,0.0007650946,0.00085543894],"domain_scores_gemma":[0.9638426,0.029523252,0.0027344793,0.0019503167,0.0015526148,0.00039676402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004215486,0.001714982,0.0021061301,0.0010484393,0.0010021758,0.0029453698,0.0023052753,0.0025677409,0.004028183],"category_scores_gemma":[0.018617366,0.0011165083,0.0009191393,0.001959383,0.0035311147,0.009563228,0.003517808,0.0030096066,0.0007594509],"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.00042443202,0.00007585729,0.00035450552,0.00026422113,0.000070625094,0.0005231633,0.00022429434,0.72958636,0.004006278,0.25430992,0.0011784997,0.008981924],"study_design_scores_gemma":[0.000027892762,0.000044184028,0.000049630227,0.00001674633,0.00001856969,0.00006961167,0.000055173656,0.93206716,0.0016305057,0.065632954,0.00036114216,0.000026451436],"about_ca_topic_score_codex":0.002302164,"about_ca_topic_score_gemma":0.0016201732,"teacher_disagreement_score":0.004215486,"about_ca_system_score_codex":0.0026967751,"about_ca_system_score_gemma":0.0020166815,"threshold_uncertainty_score":0.022293866},"labels":[],"label_agreement":null},{"id":"W2095704959","doi":"10.1109/tifs.2010.2097593","title":"A Robust and Fast Video Copy Detection System Using Content-Based Fingerprinting","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Fingerprint (computing); Robustness (evolution); Search engine indexing; Artificial intelligence; Computer vision; Database index; Video processing; Feature extraction; Pattern recognition (psychology)","score_opus":0.018542699867186808,"score_gpt":0.20390949713291573,"score_spread":0.1853667972657289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095704959","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.13879415,0.0019323293,0.84073883,0.00016899922,0.00020996558,0.00040809702,0.00046011843,0.015088616,0.002198863],"genre_scores_gemma":[0.48406258,0.0007707098,0.50925493,0.00019760891,0.00015156144,0.00023205015,0.00079403655,0.00013350489,0.004402995],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992823,0.00006043556,0.000051773593,0.00017020326,0.00036835865,0.00006690946],"domain_scores_gemma":[0.99909794,0.00016105233,0.00014083344,0.0002005386,0.0003475119,0.000052117914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053451274,0.0005250401,0.0012593535,0.0017189574,0.00040779542,0.00081814907,0.0014900764,0.0010025544,0.0013599492],"category_scores_gemma":[0.0017903757,0.00031003478,0.00029983724,0.0010511922,0.00030347583,0.0016500626,0.00065450225,0.0004684319,0.000979074],"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.00066994556,0.000251675,0.0029661085,0.00021349922,0.00008560921,0.00038366727,0.00008465009,0.0048301104,0.3164562,0.0011996037,0.0043725744,0.6684864],"study_design_scores_gemma":[0.00021717056,0.0016456661,0.012103299,0.00007052725,0.00026357968,0.0050196545,0.00009152059,0.45239636,0.51349425,0.001032794,0.0134416465,0.00022348094],"about_ca_topic_score_codex":0.0022759356,"about_ca_topic_score_gemma":0.0012231907,"teacher_disagreement_score":0.0022759356,"about_ca_system_score_codex":0.0005065251,"about_ca_system_score_gemma":0.00058092637,"threshold_uncertainty_score":0.0045494437},"labels":[],"label_agreement":null},{"id":"W2110319577","doi":"10.1109/tifs.2011.2132129","title":"Probabilistic Analysis of Blocking Attack in RFID Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"RFID technology advancements","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 British Columbia","funders":"","keywords":"Computer science; Computer security; Denial-of-service attack; Probabilistic logic; Aloha; Radio-frequency identification; Blocking (statistics); Computer network; Block (permutation group theory); Wireless; The Internet; Telecommunications; Throughput; World Wide Web; Artificial intelligence","score_opus":0.01637802672673409,"score_gpt":0.21443678145114506,"score_spread":0.19805875472441098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110319577","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.06075224,0.00053817127,0.92853075,0.00037671518,0.000033262375,0.000089032816,0.0000843429,0.00031867035,0.009276787],"genre_scores_gemma":[0.97127086,0.0007678677,0.022986546,0.000096757176,0.00007843544,0.0001256371,0.000094397335,0.00007865259,0.0045009246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973258,0.00076669763,0.00010376896,0.0003089336,0.0010150765,0.00047968785],"domain_scores_gemma":[0.9816653,0.012603556,0.002533443,0.0009288906,0.0018346348,0.0004342073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028093103,0.00073585677,0.000984279,0.0014350605,0.00075274426,0.0016147055,0.0015176241,0.0011197105,0.0031858813],"category_scores_gemma":[0.017078688,0.00080607855,0.0008632068,0.0011169044,0.0018082751,0.002626836,0.0017012544,0.0015290449,0.0007468666],"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.00014702277,0.00005429472,0.0039390232,0.00016472522,0.00008514902,0.00033612948,0.00037549558,0.7075643,0.0068347133,0.26256904,0.0015073823,0.01642271],"study_design_scores_gemma":[0.0000051171105,0.000022409526,0.00030500782,0.0000076202336,0.000013462466,0.00008609198,0.00001926268,0.98154885,0.00055448484,0.016950522,0.00047513255,0.000012080481],"about_ca_topic_score_codex":0.0024597568,"about_ca_topic_score_gemma":0.0009844693,"teacher_disagreement_score":0.0031858813,"about_ca_system_score_codex":0.0016934348,"about_ca_system_score_gemma":0.00097373576,"threshold_uncertainty_score":0.014857233},"labels":[],"label_agreement":null},{"id":"W2118407210","doi":"10.1109/tifs.2009.2033227","title":"Multibiometric Cryptosystem: Model Structure and Performance Analysis","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":58,"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":"","keywords":"Biometrics; Cryptosystem; Computer science; Cryptography; Data mining; Security analysis; Pattern recognition (psychology); Artificial intelligence; Computer security; Theoretical computer science","score_opus":0.009882225496413516,"score_gpt":0.2182776658833833,"score_spread":0.20839544038696978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118407210","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.06673508,0.003067398,0.91640687,0.0009877542,0.000055748023,0.00011031375,0.0002442225,0.0005187924,0.01187376],"genre_scores_gemma":[0.95348614,0.0022112129,0.03962396,0.000073507385,0.00009752477,0.00021068443,0.0002545951,0.000059472535,0.0039828755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872005,0.00038037152,0.000041989388,0.00018090085,0.0005188982,0.00015782742],"domain_scores_gemma":[0.9968041,0.0018386147,0.00039160892,0.0003412187,0.00056601706,0.000058425536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239701,0.0006846821,0.00083714136,0.0011094122,0.00057630957,0.0015342414,0.0011366328,0.0012432389,0.0022392513],"category_scores_gemma":[0.005860961,0.0002839792,0.0005438796,0.0012168695,0.001048805,0.0029436636,0.0011195996,0.0015479435,0.00063779665],"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.00015140395,0.000079081445,0.0018760199,0.000106588384,0.00004668115,0.00009006802,0.000113941474,0.78292775,0.002440306,0.18197022,0.0015223292,0.028675634],"study_design_scores_gemma":[0.0000022401098,0.000016918133,0.00010875038,0.0000043871814,0.0000039112792,0.000025719399,0.0000059381714,0.98985225,0.0004186753,0.009326642,0.00022824522,0.0000063661673],"about_ca_topic_score_codex":0.004507327,"about_ca_topic_score_gemma":0.0018205964,"teacher_disagreement_score":0.004507327,"about_ca_system_score_codex":0.0027994476,"about_ca_system_score_gemma":0.0012480363,"threshold_uncertainty_score":0.020311534},"labels":[],"label_agreement":null},{"id":"W2124355377","doi":"10.1109/tifs.2010.2103061","title":"Correlation-and-Bit-Aware Spread Spectrum Embedding for Data Hiding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Information hiding; Decoding methods; Watermark; Robustness (evolution); Embedding; Digital watermarking; Spread spectrum; Correlation; Algorithm; Encoder; Theoretical computer science; Artificial intelligence; Mathematics; Channel (broadcasting); Computer network","score_opus":0.03181307880143064,"score_gpt":0.2589280728127226,"score_spread":0.22711499401129198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124355377","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.035631247,0.0006864538,0.9615463,0.0001271909,0.0000444805,0.000037041504,0.000019004989,0.00018472629,0.0017234766],"genre_scores_gemma":[0.6056614,0.001289488,0.39003798,0.00013589743,0.00009190256,0.00006856408,0.000062919855,0.000044317887,0.002607468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996164,0.00006179966,0.000018430863,0.00004288272,0.00023652035,0.000023884406],"domain_scores_gemma":[0.99946326,0.00020724648,0.00007443831,0.00011144479,0.00012543848,0.000018112241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003360246,0.0006022901,0.00033275777,0.00054365775,0.00026250925,0.00036600308,0.00054820953,0.0005474229,0.0009081851],"category_scores_gemma":[0.0010583098,0.00022041399,0.0004623966,0.00046645015,0.0006315112,0.0012086891,0.00053762546,0.0007456558,0.00029053207],"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.0003096945,0.00013284732,0.0009147261,0.00050585007,0.00012794138,0.00037596643,0.0001971497,0.07905134,0.6033688,0.079487,0.0008836804,0.23464504],"study_design_scores_gemma":[0.000045150362,0.00034657706,0.0007753446,0.000060775164,0.00011477165,0.0009853774,0.000046916764,0.576535,0.40043658,0.012387272,0.008180806,0.00008557385],"about_ca_topic_score_codex":0.00021863736,"about_ca_topic_score_gemma":0.000510174,"teacher_disagreement_score":0.0009081851,"about_ca_system_score_codex":0.00026141256,"about_ca_system_score_gemma":0.00046598577,"threshold_uncertainty_score":0.0030382276},"labels":[],"label_agreement":null},{"id":"W2140316171","doi":"10.1109/tifs.2013.2244884","title":"A New Method for EEG-Based Concealed Information Test","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Deception detection and forensic psychology","field":"Psychology","cited_by":40,"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":"","keywords":"Computer science; Electroencephalography; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Constraint (computer-aided design); Test (biology); Data mining; Machine learning; Mathematics","score_opus":0.013986942506283288,"score_gpt":0.30165586897790736,"score_spread":0.28766892647162406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140316171","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.014521148,0.00014475037,0.9829804,0.00006069026,0.000042755655,0.00019158723,0.00016644354,0.0008001017,0.0010922085],"genre_scores_gemma":[0.22002824,0.0001698697,0.77718943,0.00007952678,0.00004582431,0.0003934896,0.0003800721,0.00006297568,0.0016506305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998621,0.00027106472,0.00010294737,0.00030827522,0.0006292804,0.00006747077],"domain_scores_gemma":[0.9977986,0.0008376918,0.00021436668,0.0003778044,0.0006850953,0.00008635613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011009062,0.00048334434,0.0004828327,0.0016563926,0.00035889365,0.0006450603,0.0010025306,0.00069558865,0.002871194],"category_scores_gemma":[0.005825149,0.0002343109,0.00041509414,0.0008684066,0.00071026344,0.0014807704,0.001149651,0.0008566317,0.0008800602],"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.000424655,0.00018379769,0.005424856,0.00024205576,0.00008044287,0.0003151694,0.0002612003,0.0072739515,0.1102961,0.012419769,0.00207729,0.8610007],"study_design_scores_gemma":[0.00024119082,0.0014008431,0.029607061,0.0001112395,0.00025292824,0.004469908,0.00032850078,0.6716991,0.2381451,0.031629115,0.021779187,0.0003359009],"about_ca_topic_score_codex":0.0010115028,"about_ca_topic_score_gemma":0.0010053603,"teacher_disagreement_score":0.002871194,"about_ca_system_score_codex":0.00033840566,"about_ca_system_score_gemma":0.00079044956,"threshold_uncertainty_score":0.00960505},"labels":[],"label_agreement":null},{"id":"W2147386143","doi":"10.1109/tifs.2009.2024715","title":"Digital image source coder forensics via intrinsic fingerprints","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":77,"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":"","keywords":"Computer science; Digital watermarking; Encoder; Source code; Watermark; Artificial intelligence; Image processing; Computer vision; Coding (social sciences); Fingerprint recognition; Fingerprint (computing); Image (mathematics); Mathematics","score_opus":0.004765004067404885,"score_gpt":0.1949385777863559,"score_spread":0.19017357371895102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147386143","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.14070572,0.0004254159,0.85530394,0.00021709267,0.000028557322,0.00006206614,0.00008387799,0.00094819645,0.0022250896],"genre_scores_gemma":[0.7869829,0.00037155062,0.21142854,0.00005405197,0.000025745407,0.00003161103,0.00009304973,0.00004177195,0.0009707649],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897635,0.00028496666,0.000037891263,0.00009455518,0.0005410735,0.00006515538],"domain_scores_gemma":[0.9968125,0.0015250414,0.00044329546,0.00063947536,0.0005045097,0.000075006916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015451469,0.00040268977,0.00055112405,0.0016773622,0.00032555996,0.00091380003,0.00057309854,0.00096455176,0.0007687891],"category_scores_gemma":[0.009326929,0.00023119962,0.00033664826,0.0006374175,0.00083253626,0.0016438384,0.0012198241,0.00058231753,0.0003339266],"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.00086610665,0.00026135542,0.018230475,0.0003473039,0.00013925138,0.0010952761,0.0004742855,0.12838605,0.13570246,0.052622043,0.0022400704,0.65963525],"study_design_scores_gemma":[0.00002957784,0.00016995633,0.0016995156,0.000052956686,0.00003889788,0.001931448,0.00007395557,0.8217001,0.16120085,0.011051167,0.002009055,0.000042505253],"about_ca_topic_score_codex":0.0004076827,"about_ca_topic_score_gemma":0.00024828597,"teacher_disagreement_score":0.0016773622,"about_ca_system_score_codex":0.00037821254,"about_ca_system_score_gemma":0.0004932134,"threshold_uncertainty_score":0.008171618},"labels":[],"label_agreement":null},{"id":"W2147825527","doi":"10.1109/tifs.2012.2199312","title":"An Improved Multiplicative Spread Spectrum Embedding Scheme for Data Hiding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":58,"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":"Decoding methods; Information hiding; Computer science; Digital watermarking; Spread spectrum; Algorithm; Additive white Gaussian noise; Watermark; Multiplicative function; Embedding; Mathematics; Channel (broadcasting); Telecommunications; Artificial intelligence","score_opus":0.02494352762097511,"score_gpt":0.293655795144361,"score_spread":0.2687122675233859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147825527","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.098709956,0.00057504873,0.89692616,0.00021686647,0.00008830373,0.0000542025,0.000039495484,0.00039162333,0.0029984268],"genre_scores_gemma":[0.7292538,0.00048291116,0.2655572,0.0001168723,0.00008679987,0.00004295762,0.000073365394,0.000030361281,0.004355715],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.000056179466,0.000019485107,0.000049870985,0.00021661233,0.000028153147],"domain_scores_gemma":[0.9997093,0.00007055552,0.000039821694,0.00007120574,0.000095278076,0.000013901621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590456,0.00038928905,0.000280459,0.00039742957,0.00021035249,0.00023673252,0.0005281465,0.0003953386,0.0009723586],"category_scores_gemma":[0.00066603936,0.00014470927,0.00035507523,0.0002802981,0.00032071964,0.0009238357,0.00051900896,0.0004136245,0.0003123602],"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.00031020632,0.00011963649,0.0007744136,0.00027543344,0.00006203381,0.00024630709,0.0001476726,0.038064774,0.6729272,0.03396744,0.0010308016,0.25207415],"study_design_scores_gemma":[0.000055062286,0.00054975954,0.00097114104,0.000029924746,0.00009146533,0.0013956118,0.00003079902,0.6994444,0.28036734,0.006373231,0.010626428,0.000064882144],"about_ca_topic_score_codex":0.00017857243,"about_ca_topic_score_gemma":0.00033764367,"teacher_disagreement_score":0.0009723586,"about_ca_system_score_codex":0.00015792582,"about_ca_system_score_gemma":0.00021697124,"threshold_uncertainty_score":0.003252864},"labels":[],"label_agreement":null},{"id":"W2157410860","doi":"10.1109/tifs.2011.2163627","title":"Robust Image Watermarking Based on Multiscale Gradient Direction Quantization","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":131,"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":"Digital watermarking; Watermark; Quantization (signal processing); Gaussian noise; Robustness (evolution); Wavelet; Mathematics; Scaling; Algorithm; Computer science; Artificial intelligence; Gaussian; Wavelet transform; Sharpening; Discrete wavelet transform; Embedding; Computer vision; Image (mathematics); Physics; Geometry","score_opus":0.019848755717854473,"score_gpt":0.21373640321551068,"score_spread":0.19388764749765622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157410860","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.027302016,0.0013626983,0.9688909,0.00018923485,0.0001139472,0.000050679097,0.000046199108,0.0005749766,0.0014694392],"genre_scores_gemma":[0.5359027,0.0016871948,0.45945364,0.00013914393,0.00018007035,0.000087424014,0.00016844991,0.00007201426,0.002309368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996308,0.00005849005,0.000025005951,0.00006397575,0.00019363308,0.000028099614],"domain_scores_gemma":[0.9996234,0.00008556789,0.000087407476,0.00008105694,0.00010501188,0.000017534523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132129,0.0003801104,0.0005654915,0.00072486687,0.00020474201,0.00048790127,0.00058203953,0.0005327808,0.00079923734],"category_scores_gemma":[0.0012167715,0.00018911329,0.00044986446,0.000815129,0.00045782427,0.0012649676,0.00060483994,0.0005013193,0.00033284407],"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.0002581284,0.00007397784,0.0006046421,0.00020753714,0.000070888746,0.0002755508,0.00008069317,0.08387943,0.4153239,0.038404062,0.0020048437,0.45881623],"study_design_scores_gemma":[0.00006776111,0.00033608338,0.000823706,0.00002398278,0.000046352594,0.0005394675,0.00002017208,0.8515116,0.12865452,0.009122164,0.008778655,0.00007553973],"about_ca_topic_score_codex":0.00047851686,"about_ca_topic_score_gemma":0.00043461745,"teacher_disagreement_score":0.00079923734,"about_ca_system_score_codex":0.00022235104,"about_ca_system_score_gemma":0.0002835666,"threshold_uncertainty_score":0.0026737452},"labels":[],"label_agreement":null},{"id":"W2157897932","doi":"10.1109/tifs.2010.2051255","title":"A Wavelet-PCA-Based Fingerprinting Scheme for Peer-to-Peer Video File Sharing","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Robustness (evolution); Fingerprint (computing); Wavelet; Principal component analysis; Data mining; Artificial intelligence; Pattern recognition (psychology); Embedding; Fingerprint recognition; Representation (politics)","score_opus":0.010893040949861356,"score_gpt":0.24368711026900214,"score_spread":0.2327940693191408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157897932","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.029291943,0.0004951443,0.96679217,0.00014097562,0.00010778002,0.00010809666,0.000105783605,0.00094102934,0.0020171872],"genre_scores_gemma":[0.6363437,0.0006593754,0.35686326,0.00011589192,0.000112950416,0.00017031678,0.00030548364,0.00005454138,0.005374493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993573,0.00009747148,0.000039362287,0.00012222702,0.0002951786,0.00008851846],"domain_scores_gemma":[0.99938285,0.00006989321,0.000058997943,0.00020977277,0.00022856644,0.000049866372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045699978,0.00048888056,0.00074117986,0.0009670316,0.000822716,0.0005511165,0.0010715246,0.0007679877,0.0016990281],"category_scores_gemma":[0.0015121592,0.00020239828,0.00044641068,0.0012597452,0.00043415328,0.0022140048,0.0009800699,0.0006736995,0.0006159475],"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.00055337365,0.00018456126,0.0009081214,0.00017212584,0.00006966993,0.0003260222,0.00020888555,0.054332644,0.12083098,0.027354907,0.006221821,0.78883696],"study_design_scores_gemma":[0.000062644314,0.00039060356,0.0013000007,0.000027324035,0.000053871194,0.0010701267,0.00010157495,0.90427125,0.07200833,0.0075363545,0.013057897,0.0001200365],"about_ca_topic_score_codex":0.00203454,"about_ca_topic_score_gemma":0.001161504,"teacher_disagreement_score":0.00203454,"about_ca_system_score_codex":0.00060571043,"about_ca_system_score_gemma":0.00062635355,"threshold_uncertainty_score":0.0056838393},"labels":[],"label_agreement":null},{"id":"W2165859249","doi":"10.1109/tifs.2010.2094187","title":"Predictable Three-Parameter Design of Network Covert Communication Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Internet Traffic Analysis and Secure E-voting","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Covert channel; Channel (broadcasting); Reliability (semiconductor); Covert; Bit error rate; Measure (data warehouse); Communications system; Real-time computing; Computer network; Data mining; Power (physics)","score_opus":0.011097870456488934,"score_gpt":0.20849418341383935,"score_spread":0.1973963129573504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165859249","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.06927797,0.00020252864,0.9267205,0.00013287802,0.000027714595,0.00017786199,0.00003586005,0.00037237434,0.0030522987],"genre_scores_gemma":[0.94150215,0.00009447822,0.057527103,0.000028741473,0.000015462512,0.00018368609,0.000023820476,0.000038966697,0.0005855102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977824,0.0006398263,0.00009648874,0.00034399136,0.00095316384,0.00018427857],"domain_scores_gemma":[0.99676114,0.0014775922,0.0007006414,0.00043535026,0.00054767093,0.00007762871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015033,0.0006921395,0.0005520794,0.0006582936,0.0005556041,0.00086350826,0.00091337354,0.00067339744,0.0010626459],"category_scores_gemma":[0.005617367,0.0003214574,0.00032273357,0.00026656836,0.0009856678,0.0012032384,0.0009312441,0.00071980833,0.00024192402],"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.0002524518,0.000078038436,0.001630086,0.0002192212,0.00006199018,0.0002040103,0.00027967567,0.83933055,0.06512953,0.035634767,0.0004014595,0.056778185],"study_design_scores_gemma":[0.00002477789,0.0002288539,0.00037404383,0.000019489196,0.000018182378,0.00009641989,0.000025216446,0.96451366,0.026350051,0.0067583993,0.0015686714,0.000022225866],"about_ca_topic_score_codex":0.00036234784,"about_ca_topic_score_gemma":0.00043662067,"teacher_disagreement_score":0.0015033,"about_ca_system_score_codex":0.0011186934,"about_ca_system_score_gemma":0.00057391654,"threshold_uncertainty_score":0.008116722},"labels":[],"label_agreement":null},{"id":"W2168239498","doi":"10.1109/tifs.2009.2031914","title":"The Effectiveness of Receipt-Based Attacks on ThreeBallot","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":17,"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":"Receipt; Ballot; Computer science; Voting; Computer security; Electronic voting; Verifiable secret sharing; Bulletin board; Internet privacy; Secret ballot; World Wide Web; Political science; Law","score_opus":0.007654931469886688,"score_gpt":0.227379152799617,"score_spread":0.21972422132973032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168239498","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.8167235,0.0006840363,0.16414727,0.001006789,0.0001306869,0.00019221878,0.00019922658,0.0014341162,0.01548213],"genre_scores_gemma":[0.99291396,0.000060305792,0.006359801,0.00003580385,0.000010772011,0.000020182195,0.000040634735,0.000027932958,0.00053067406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912971,0.003508427,0.00045863297,0.00073272886,0.0026143224,0.0013887403],"domain_scores_gemma":[0.9519918,0.03034287,0.0050501297,0.009335882,0.002185277,0.0010939976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056557157,0.00079901994,0.0014847373,0.0018188381,0.001604274,0.0019076148,0.0018536107,0.0016324508,0.002025266],"category_scores_gemma":[0.031590264,0.00047184472,0.0008232873,0.00082000904,0.0032885876,0.0045979647,0.0035006646,0.0015914016,0.00057257304],"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.0066520036,0.00079139415,0.01338085,0.0003734476,0.00040816737,0.0005195661,0.00058052293,0.62575823,0.05402338,0.20281279,0.0049679056,0.08973171],"study_design_scores_gemma":[0.00010507375,0.00044166666,0.00087070203,0.000032393073,0.0000452494,0.00031199525,0.00010414376,0.9363984,0.028213996,0.03224614,0.0011806488,0.000049572773],"about_ca_topic_score_codex":0.00087772496,"about_ca_topic_score_gemma":0.0005612602,"teacher_disagreement_score":0.0056557157,"about_ca_system_score_codex":0.001983165,"about_ca_system_score_gemma":0.0014429697,"threshold_uncertainty_score":0.029910684},"labels":[],"label_agreement":null},{"id":"W2358248302","doi":"10.1109/tifs.2016.2566446","title":"Delay-Aware Optimization of Physical Layer Security in Multi-Hop Wireless Body Area Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Computer network; Wireless sensor network; Network topology; Nash equilibrium; Topology (electrical circuits); Node (physics); Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.012678307871622668,"score_gpt":0.2320039779186135,"score_spread":0.21932567004699083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358248302","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.102719314,0.0006071327,0.89313275,0.00030902596,0.000057967238,0.000047178655,0.000031384872,0.00006220774,0.00303305],"genre_scores_gemma":[0.9688062,0.00030352912,0.02917457,0.00003055757,0.000022006414,0.000035794346,0.000014219525,0.000019858475,0.0015932093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.00028680795,0.000018735662,0.0000867959,0.00014487444,0.00011052392],"domain_scores_gemma":[0.9984011,0.001125227,0.00019643872,0.000064034546,0.00013423913,0.000079024314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875656,0.0009471867,0.0006966448,0.0004711681,0.00041106812,0.0009841997,0.0008951387,0.00091687916,0.00077431666],"category_scores_gemma":[0.0032006982,0.00044915723,0.00031853237,0.00050337566,0.0012966229,0.0013336773,0.0011374203,0.00064719864,0.00010899352],"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.000032406148,0.000016187265,0.0001887412,0.000019285158,0.000010329316,0.000029370392,0.000019263116,0.9893405,0.001173775,0.004902099,0.00007844154,0.004189602],"study_design_scores_gemma":[0.000005654832,0.000039343573,0.000071883595,0.0000023904593,0.000004294374,0.000013584824,0.000012619002,0.9965585,0.00040570894,0.0027727636,0.00010958294,0.00000371068],"about_ca_topic_score_codex":0.0014687637,"about_ca_topic_score_gemma":0.001515238,"teacher_disagreement_score":0.0014875656,"about_ca_system_score_codex":0.0010190489,"about_ca_system_score_gemma":0.0011113205,"threshold_uncertainty_score":0.007867098},"labels":[],"label_agreement":null},{"id":"W2397107144","doi":"10.1109/tifs.2016.2570681","title":"An Exploration of Geographic Authentication Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"User Authentication and Security Systems","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 Toronto; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Password; Computer science; Usability; Authentication (law); Password policy; Annotation; Computer security; World Wide Web; Human–computer interaction; One-time password; Artificial intelligence","score_opus":0.01896595752618217,"score_gpt":0.2450381984701023,"score_spread":0.22607224094392014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397107144","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.37348467,0.0016799902,0.5838142,0.0037321472,0.00008134821,0.0006837952,0.00016629254,0.0015405623,0.034817003],"genre_scores_gemma":[0.78769016,0.0007625512,0.20536692,0.00025031564,0.000021023934,0.0002278509,0.0001207967,0.00013280999,0.005427553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280703,0.0048429123,0.00037354522,0.000517565,0.0011330433,0.0003258046],"domain_scores_gemma":[0.98381513,0.009188981,0.0012341763,0.0037730264,0.0015153999,0.00047329048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066996543,0.00063591445,0.00037645875,0.00097450515,0.0013848408,0.0029561003,0.0014315165,0.0016529962,0.0043788864],"category_scores_gemma":[0.016957577,0.0007844465,0.0008340509,0.0010222786,0.00273423,0.008420316,0.0033803054,0.0013448558,0.0007027344],"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.0010454052,0.00061549933,0.012558502,0.0015716411,0.00007547223,0.0010802854,0.03228838,0.018854244,0.0387971,0.6468412,0.004190581,0.24208164],"study_design_scores_gemma":[0.00044487423,0.0043155244,0.008004415,0.0014178284,0.00034570863,0.0066386694,0.018745782,0.20298152,0.062249187,0.23648554,0.45801646,0.0003545599],"about_ca_topic_score_codex":0.001084279,"about_ca_topic_score_gemma":0.0012040976,"teacher_disagreement_score":0.0066996543,"about_ca_system_score_codex":0.0014977376,"about_ca_system_score_gemma":0.0011158383,"threshold_uncertainty_score":0.035431564},"labels":[],"label_agreement":null},{"id":"W2461759357","doi":"10.1109/tifs.2016.2585121","title":"Privacy-Preserving Outsourced Calculation on Floating Point Numbers","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":74,"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; National Research Foundation Singapore","keywords":"Computer science; Outsourcing; Floating point; Information leakage; Point (geometry); Integer (computer science); Computer security; Computer network; Operating system; Mathematics","score_opus":0.00987505309589181,"score_gpt":0.22083730557724554,"score_spread":0.21096225248135372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461759357","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.012929021,0.00047601372,0.97772574,0.00049676304,0.00013914422,0.0001284299,0.00023140345,0.0008118027,0.0070617734],"genre_scores_gemma":[0.61349046,0.0012263315,0.3731117,0.0005825499,0.00025203865,0.00040514523,0.0007890605,0.00046266746,0.009680056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930006,0.0011443996,0.00048258164,0.0008873766,0.003616359,0.00086867675],"domain_scores_gemma":[0.9932381,0.0011729355,0.00040704032,0.004262536,0.0007887433,0.00013049964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028820827,0.0008004596,0.0013804631,0.0008817095,0.001430517,0.0042463266,0.0028878767,0.0011621612,0.004204445],"category_scores_gemma":[0.0091825025,0.0005970496,0.0013031164,0.0019673803,0.0026808851,0.008284712,0.0053025363,0.002853541,0.0014808824],"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.00052894873,0.00009661385,0.0010567979,0.0003233661,0.00010652628,0.0009883214,0.00069767056,0.073110685,0.0154614365,0.7851386,0.008681161,0.11380996],"study_design_scores_gemma":[0.00012207506,0.00015937723,0.00041718638,0.00014702416,0.00007702938,0.0012439158,0.00032222224,0.43650442,0.051836092,0.45935813,0.04968313,0.00012948914],"about_ca_topic_score_codex":0.0020916169,"about_ca_topic_score_gemma":0.0010097793,"teacher_disagreement_score":0.0042463266,"about_ca_system_score_codex":0.0014819807,"about_ca_system_score_gemma":0.0026351518,"threshold_uncertainty_score":0.01524204},"labels":[],"label_agreement":null},{"id":"W2508774639","doi":"10.1109/tifs.2016.2599270","title":"Continuous Authentication Using One-Dimensional Multi-Resolution Local Binary Patterns (1DMRLBP) in ECG Biometrics","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Biometrics; Feature extraction; Word error rate; Pattern recognition (psychology); Authentication (law); Local binary patterns; Artificial intelligence; Feature (linguistics); Feature vector; Quantization (signal processing); Binary number; Computer vision; Histogram; Mathematics; Computer security","score_opus":0.025878552068730607,"score_gpt":0.26995240530167325,"score_spread":0.24407385323294264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508774639","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.16878864,0.0043597985,0.8226517,0.0004677365,0.00024783568,0.00009430397,0.000165316,0.0010966836,0.0021280404],"genre_scores_gemma":[0.72311956,0.0016315754,0.2714406,0.0002719182,0.00009735007,0.000076344004,0.00018367462,0.0000709815,0.003107935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988336,0.0003067559,0.00009298234,0.00026038502,0.00044599868,0.00006028894],"domain_scores_gemma":[0.99899036,0.0004006225,0.00018371122,0.00017046537,0.00022539638,0.00002939214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008634749,0.0003768512,0.00041761243,0.00072330324,0.00019548915,0.0005561713,0.0004239187,0.0008019166,0.0008521355],"category_scores_gemma":[0.0025892647,0.00021598875,0.00033087083,0.0008738647,0.0004098141,0.0010612292,0.0005302719,0.0004984166,0.000502817],"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.0007818705,0.000117254574,0.0037377034,0.00039022695,0.00004846323,0.00053821754,0.00018250455,0.0112512605,0.21677732,0.0025121926,0.0015490185,0.7621139],"study_design_scores_gemma":[0.000107609965,0.001789522,0.038185827,0.00018099368,0.0002003129,0.005925831,0.00019293046,0.4898456,0.44352397,0.0037386902,0.016138578,0.00016998877],"about_ca_topic_score_codex":0.00065191346,"about_ca_topic_score_gemma":0.00066631765,"teacher_disagreement_score":0.0008634749,"about_ca_system_score_codex":0.00017559984,"about_ca_system_score_gemma":0.00018086574,"threshold_uncertainty_score":0.0045665503},"labels":[],"label_agreement":null},{"id":"W2508905069","doi":"10.1109/tifs.2016.2598523","title":"Deceptive Deletion Triggers Under Coercion","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"User Authentication and Security Systems","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Password; Encryption; Computer security; Adversary; On-the-fly encryption; Key (lock); Keystroke logging; Internet privacy","score_opus":0.010788455988856277,"score_gpt":0.21857100159937698,"score_spread":0.2077825456105207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508905069","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.3373986,0.0011742255,0.463354,0.003304321,0.00095723785,0.0010468009,0.0010372164,0.02126533,0.1704622],"genre_scores_gemma":[0.94426334,0.0002573575,0.024817348,0.00085407967,0.00018825823,0.0002975122,0.00037610863,0.0007509986,0.02819507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99194896,0.0012022944,0.0006797908,0.0013057387,0.0037489294,0.0011142143],"domain_scores_gemma":[0.9778455,0.006687253,0.0022489498,0.009619415,0.003054115,0.0005448148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024801816,0.0008788422,0.0007052194,0.0008048456,0.0010535908,0.0027286133,0.0022847154,0.0015912084,0.010302119],"category_scores_gemma":[0.022195028,0.0005240361,0.0005006405,0.00044471535,0.0030663016,0.0058505903,0.0057345107,0.002317125,0.003421372],"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.002712082,0.0005508198,0.02168886,0.0009773285,0.00013539392,0.009497196,0.008980064,0.01525701,0.10709389,0.5461423,0.03390209,0.25306302],"study_design_scores_gemma":[0.00033951865,0.0010240054,0.008056592,0.00064882956,0.00018945616,0.010554708,0.0019991363,0.19134393,0.34446582,0.23584253,0.20509061,0.0004447677],"about_ca_topic_score_codex":0.0010045293,"about_ca_topic_score_gemma":0.00073585537,"teacher_disagreement_score":0.010302119,"about_ca_system_score_codex":0.0007996556,"about_ca_system_score_gemma":0.0011667013,"threshold_uncertainty_score":0.03446406},"labels":[],"label_agreement":null},{"id":"W2556834368","doi":"10.1109/tifs.2016.2631950","title":"Light-Weight and Robust Security-Aware D2D-Assist Data Transmission Protocol for Mobile-Health Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":170,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Protocol (science); Transmission (telecommunications); Cryptographic protocol; Data transmission; Mobile telephony; Mobile computing; Computer security; Cryptography; Mobile radio; Telecommunications","score_opus":0.01897597186219802,"score_gpt":0.25184323639630907,"score_spread":0.23286726453411105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556834368","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.0144699095,0.0014289605,0.97733545,0.0008274134,0.00024830856,0.0005519017,0.000087337066,0.0005734725,0.0044771475],"genre_scores_gemma":[0.856655,0.0012359694,0.13622436,0.0006825928,0.00017290023,0.0007150254,0.00021938082,0.000038459242,0.0040563904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981975,0.0005494582,0.0001955869,0.00022411042,0.000658677,0.00017471306],"domain_scores_gemma":[0.99853694,0.0004678374,0.0002527538,0.00037117745,0.0002874471,0.000083899715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390117,0.0006814571,0.00066631765,0.0008998446,0.00088358537,0.0011375638,0.0012714373,0.0013928966,0.0013917708],"category_scores_gemma":[0.0031188768,0.00030948254,0.00066403934,0.0008187676,0.0012843008,0.00204964,0.0032384803,0.0017094038,0.0005818612],"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.0013281541,0.0003709511,0.0022026652,0.001983815,0.00025397615,0.0023350604,0.0013918768,0.07579012,0.19119538,0.44045264,0.015756171,0.2669392],"study_design_scores_gemma":[0.0004746153,0.0010809103,0.0012802399,0.00030324003,0.00021535877,0.005051073,0.00030442077,0.7429829,0.108747736,0.06111632,0.078139916,0.00030326925],"about_ca_topic_score_codex":0.0005485854,"about_ca_topic_score_gemma":0.00044325544,"teacher_disagreement_score":0.0013928966,"about_ca_system_score_codex":0.0009218512,"about_ca_system_score_gemma":0.0014616298,"threshold_uncertainty_score":0.0073516965},"labels":[],"label_agreement":null},{"id":"W2743047657","doi":"10.1109/tifs.2018.2818650","title":"Covert Communication With Channel-State Information at the Transmitter","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","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":"University of Toronto","funders":"Korea Electric Power Corporation; National Research Foundation of Korea; Ministry of Education","keywords":"Transmitter; Additive white Gaussian noise; Channel (broadcasting); Channel state information; Computer science; Channel capacity; Covert; Key (lock); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Wireless; Computer security; Combinatorics","score_opus":0.007838086871942923,"score_gpt":0.20477804734854915,"score_spread":0.19693996047660622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743047657","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.09482311,0.0010952543,0.8891936,0.0015905822,0.00013876776,0.00008129901,0.00025117083,0.00016485792,0.012661301],"genre_scores_gemma":[0.9551547,0.0009485538,0.039504707,0.00018233416,0.00017105462,0.00012602126,0.00013882104,0.000041843414,0.003731998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997503,0.0007930303,0.0000969777,0.00046672896,0.0007181883,0.00042200106],"domain_scores_gemma":[0.9827722,0.013638649,0.0012966758,0.0014428787,0.00065321947,0.00019637086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024241589,0.0010957494,0.0017479464,0.000823618,0.0011657904,0.0019806884,0.0013567545,0.0027131012,0.002253131],"category_scores_gemma":[0.015850255,0.00066823734,0.0010720525,0.0011312988,0.0035489374,0.005147649,0.0032257314,0.0020345014,0.00038453506],"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.0003281185,0.00007889611,0.0011165672,0.0003458865,0.00010594411,0.0012485916,0.00037019092,0.67055917,0.007697259,0.30069774,0.0015948141,0.015856814],"study_design_scores_gemma":[0.000024424044,0.000048556703,0.00013893281,0.000031036514,0.000026159953,0.00035534133,0.000055070308,0.89823425,0.003616007,0.09668863,0.00075355824,0.000027970138],"about_ca_topic_score_codex":0.000991974,"about_ca_topic_score_gemma":0.0006424222,"teacher_disagreement_score":0.0027131012,"about_ca_system_score_codex":0.0017903552,"about_ca_system_score_gemma":0.0010729019,"threshold_uncertainty_score":0.0129900575},"labels":[],"label_agreement":null},{"id":"W2790644461","doi":"10.1109/tifs.2018.2807790","title":"Normalization and Weighting Techniques Based on Genuine-Impostor Score Fusion in Multi-Biometric Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":59,"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","keywords":"Normalization (sociology); Biometrics; Weighting; Computer science; Word error rate; Pattern recognition (psychology); Artificial intelligence; Fingerprint (computing); Data mining","score_opus":0.019593229606397113,"score_gpt":0.24407388149218626,"score_spread":0.22448065188578914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790644461","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.025496427,0.0005496734,0.97210085,0.000057488705,0.00007544672,0.000052166357,0.000023828485,0.00051930454,0.0011247325],"genre_scores_gemma":[0.45810115,0.00059047213,0.5379786,0.00008496642,0.00010192053,0.00011846486,0.0001707323,0.0001286098,0.0027250727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994113,0.0011476555,0.0004693853,0.0009891654,0.0030324776,0.00024831248],"domain_scores_gemma":[0.99706393,0.00066788663,0.0002708042,0.000745874,0.0011751066,0.00007634815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034252603,0.00091597636,0.0012488579,0.0016233185,0.00063052826,0.0014422766,0.0015698532,0.00091801555,0.0012067828],"category_scores_gemma":[0.007175404,0.00046159726,0.0012077838,0.0016140199,0.0008996642,0.0024157935,0.0017619972,0.001080869,0.00084193],"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.00036240704,0.00017159375,0.002145189,0.00021411778,0.0001921559,0.00017998947,0.0002764746,0.06288078,0.116554044,0.014118061,0.001020858,0.8018843],"study_design_scores_gemma":[0.00002592416,0.00037706,0.0056717726,0.000044355944,0.00017965802,0.00082806544,0.00009413375,0.8434975,0.13200998,0.011532079,0.0055772616,0.00016220551],"about_ca_topic_score_codex":0.0010245494,"about_ca_topic_score_gemma":0.00087079336,"teacher_disagreement_score":0.0034252603,"about_ca_system_score_codex":0.00055237784,"about_ca_system_score_gemma":0.00064321584,"threshold_uncertainty_score":0.018114686},"labels":[],"label_agreement":null},{"id":"W2794104577","doi":"10.1109/tifs.2018.2804890","title":"Liveness Detection and Automatic Template Updating Using Fusion of ECG and Fingerprint","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liveness; Computer science; Biometrics; Fingerprint (computing); Spoofing attack; Artificial intelligence; Fingerprint recognition; Pattern recognition (psychology); Word error rate; Classifier (UML); Computer vision; Speech recognition; Computer security","score_opus":0.0157950947077046,"score_gpt":0.24065781152854857,"score_spread":0.22486271682084397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794104577","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.2164444,0.0017793047,0.77122164,0.0002240579,0.0002971474,0.00021329736,0.0005059143,0.0068083564,0.0025059122],"genre_scores_gemma":[0.7449229,0.00077934156,0.24900544,0.00023082936,0.00015463063,0.00008888569,0.0011901816,0.0001523287,0.003475533],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992335,0.00007978382,0.000052916304,0.00024191031,0.00032368614,0.000068291025],"domain_scores_gemma":[0.9992798,0.00012451663,0.00011525135,0.00019801744,0.00022096383,0.00006147342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006990983,0.00060407515,0.0009079138,0.001171371,0.00021458902,0.0006148551,0.0008445418,0.00097043446,0.0011080628],"category_scores_gemma":[0.001821783,0.00021505254,0.000436485,0.0006227695,0.00021226471,0.000999079,0.0007015096,0.00051244296,0.0009430207],"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.0010578154,0.0002318163,0.0067273728,0.00015252085,0.000098293596,0.00045569806,0.00009547441,0.0039121523,0.25852233,0.00048791384,0.0019633723,0.72629523],"study_design_scores_gemma":[0.00012920625,0.0014550275,0.05291482,0.000065526336,0.00022832907,0.0072042514,0.0001292807,0.5082875,0.41842037,0.001823438,0.009185262,0.00015707202],"about_ca_topic_score_codex":0.00069215504,"about_ca_topic_score_gemma":0.0008948714,"teacher_disagreement_score":0.001171371,"about_ca_system_score_codex":0.00017783142,"about_ca_system_score_gemma":0.00023691406,"threshold_uncertainty_score":0.0037068129},"labels":[],"label_agreement":null},{"id":"W2887675532","doi":"10.1109/tifs.2018.2859593","title":"Wireless-Powered Full-Duplex Relay and Friendly Jamming for Secure Cooperative Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":92,"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":"Shahrekord University","keywords":"Relay; Jamming; Computer science; Wireless; Physical layer; Interference (communication); Secrecy; Channel state information; Channel (broadcasting); Energy (signal processing); Signal-to-noise ratio (imaging); Duplex (building); Computer network; Telecommunications; Mathematics; Computer security; Physics; Statistics; Biology; Genetics","score_opus":0.011202056909237784,"score_gpt":0.23344564312819344,"score_spread":0.22224358621895565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887675532","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.0896544,0.0013395161,0.9006756,0.00015998834,0.000047411322,0.000033360768,0.000056496767,0.0001552344,0.007878072],"genre_scores_gemma":[0.9649282,0.0007121053,0.03254717,0.000058792462,0.000018009418,0.000030961895,0.000032923643,0.0000116819165,0.0016601373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997179,0.000093482646,0.000010967857,0.000045559194,0.0001071229,0.000024884537],"domain_scores_gemma":[0.9996222,0.0001849733,0.0000636705,0.00006913899,0.000048297366,0.000011794314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004330763,0.000313145,0.00034312363,0.00023413134,0.00024649312,0.0005810379,0.0004695242,0.00052808813,0.0011424266],"category_scores_gemma":[0.0008386013,0.00019061913,0.00038409833,0.0003490231,0.000534868,0.0008896425,0.00052433467,0.00039740303,0.00035133475],"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.00021283329,0.00013524521,0.0019372418,0.0004604746,0.000108438086,0.0006728286,0.0003513193,0.57075334,0.15710108,0.19159487,0.0015500933,0.0751223],"study_design_scores_gemma":[0.0000087376175,0.00019304069,0.00056513597,0.000019647627,0.000021371783,0.00037690825,0.000052962405,0.96691966,0.014096772,0.015394608,0.002324023,0.00002720365],"about_ca_topic_score_codex":0.00023032613,"about_ca_topic_score_gemma":0.00039321254,"teacher_disagreement_score":0.0011424266,"about_ca_system_score_codex":0.00034922943,"about_ca_system_score_gemma":0.00030481405,"threshold_uncertainty_score":0.0038217306},"labels":[],"label_agreement":null},{"id":"W2889579243","doi":"10.1109/tifs.2018.2869344","title":"A High Throughput and Secure Authentication-Encryption AES-CCM Algorithm on Asynchronous Multicore Processor","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":39,"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":"Division of Electrical, Communications and Cyber Systems; Agency for Science, Technology and Research; Egg Farmers of Canada","keywords":"Computer science; Advanced Encryption Standard; Encryption; Asynchronous communication; Throughput; Plaintext; AES implementations; Embedded system; Parallel computing; Computer network; Wireless","score_opus":0.008776883584582446,"score_gpt":0.24230064974730744,"score_spread":0.233523766162725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889579243","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.15315135,0.0006803252,0.83370465,0.0003502819,0.0002110567,0.00034088548,0.00014580695,0.0030514318,0.008364222],"genre_scores_gemma":[0.71714026,0.00019176735,0.27703896,0.00014934856,0.00005277139,0.00016603142,0.00021960461,0.000046877645,0.004994373],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958557,0.000054668595,0.0000396421,0.00007843113,0.00018333677,0.00005829751],"domain_scores_gemma":[0.99973565,0.000028259486,0.00003697043,0.000052871706,0.00012216665,0.000024108791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026341534,0.00041677232,0.000312387,0.00034782945,0.0005217395,0.00036704505,0.00091260066,0.00031615587,0.0015894617],"category_scores_gemma":[0.0004529454,0.0001412126,0.00027803733,0.00042142541,0.00022480571,0.0008301163,0.00044477195,0.00044414893,0.00042345037],"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.0013542512,0.00031321455,0.003571974,0.00045770124,0.00010860289,0.0006603109,0.0002191915,0.06596254,0.44173008,0.028452363,0.008899804,0.44827],"study_design_scores_gemma":[0.00028282026,0.0009284164,0.0020077112,0.000024584178,0.00007070072,0.00080445723,0.000056817156,0.7358573,0.23639011,0.0040858346,0.019428609,0.00006262183],"about_ca_topic_score_codex":0.001284401,"about_ca_topic_score_gemma":0.0018441771,"teacher_disagreement_score":0.0015894617,"about_ca_system_score_codex":0.00048221616,"about_ca_system_score_gemma":0.0011125596,"threshold_uncertainty_score":0.005317211},"labels":[],"label_agreement":null},{"id":"W2909023102","doi":"10.1109/tifs.2019.2894031","title":"Characterizing and Evaluating Adversarial Examples for Offline Handwritten Signature Verification","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Science Foundation","keywords":"Computer science; Signature (topology); Adversarial system; Artificial intelligence; Pattern recognition (psychology); Handwriting recognition; Signature recognition; Feature extraction; Speech recognition; Natural language processing","score_opus":0.01713105310537766,"score_gpt":0.2556298412927902,"score_spread":0.23849878818741255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909023102","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.7775654,0.001619418,0.21540345,0.00037644067,0.00014523313,0.0002860747,0.00034871628,0.0012393948,0.003015897],"genre_scores_gemma":[0.9646731,0.00013473199,0.03417819,0.000057170677,0.000027181266,0.000038589726,0.0003130913,0.000045815512,0.00053216965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956637,0.0018096827,0.00027499752,0.00067637966,0.0013086185,0.00026670352],"domain_scores_gemma":[0.97063905,0.022504661,0.0023445864,0.0028563072,0.001174518,0.00048086734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005399348,0.0009129272,0.00088811247,0.00092615845,0.00035555876,0.0009200778,0.0010433715,0.0015620793,0.0008989992],"category_scores_gemma":[0.0273735,0.00027984788,0.0004616162,0.00036984554,0.0013615835,0.0019001168,0.0014072512,0.0009298801,0.00033059367],"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.0013165971,0.00030688677,0.006338254,0.00025133006,0.00014489822,0.0002109041,0.000088499364,0.8972021,0.017994395,0.0038071526,0.0012363173,0.07110268],"study_design_scores_gemma":[0.000016546946,0.0002196824,0.0010591418,0.000015153082,0.000013480606,0.00011766704,0.000021084772,0.9852824,0.011881814,0.001094376,0.00026805312,0.000010454556],"about_ca_topic_score_codex":0.00096788275,"about_ca_topic_score_gemma":0.0009176492,"teacher_disagreement_score":0.005399348,"about_ca_system_score_codex":0.0010757231,"about_ca_system_score_gemma":0.00059785193,"threshold_uncertainty_score":0.028554797},"labels":[],"label_agreement":null},{"id":"W2913576447","doi":"10.1109/tifs.2019.2895963","title":"Large-Scale Empirical Study of Important Features Indicative of Discovered Vulnerabilities to Assess Application Security","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Software Engineering Research","field":"Computer Science","cited_by":39,"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","keywords":"Computer science; Feature selection; Vulnerability (computing); Secure coding; Scale (ratio); Empirical research; Machine learning; Feature (linguistics); Data science; Predictive power; Focus (optics); Selection (genetic algorithm); Data mining; Artificial intelligence; Computer security; Information security; Software security assurance; Statistics","score_opus":0.012251667946967618,"score_gpt":0.28365874951568815,"score_spread":0.2714070815687205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913576447","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.98505634,0.00036853593,0.013033171,0.00011967188,0.000009682165,0.000055485132,0.0006427576,0.00016396581,0.00055047806],"genre_scores_gemma":[0.99330807,0.00008880049,0.005722684,0.00001251048,0.000008226911,0.000030313715,0.0007384038,0.000013648068,0.000077305944],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979486,0.000657369,0.00019512662,0.000357608,0.00070448965,0.00013689128],"domain_scores_gemma":[0.947002,0.040084425,0.0062226425,0.0035409746,0.0026063223,0.0005435942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037871713,0.0009069342,0.0004860619,0.00507532,0.00045007013,0.00070562714,0.00056823646,0.0005140341,0.00058595586],"category_scores_gemma":[0.029216744,0.0001861049,0.00062099734,0.0034910783,0.0006878462,0.0015806381,0.000824908,0.001016292,0.00020202962],"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.00020994425,0.00065670337,0.87102896,0.00022842956,0.00035184104,0.0002859193,0.00033727344,0.033599697,0.004430741,0.00063074613,0.0017450323,0.086494766],"study_design_scores_gemma":[0.00002184234,0.0003841137,0.68555236,0.000065010485,0.0001940688,0.00067296054,0.00050334685,0.3008496,0.007686744,0.0027212128,0.0012991357,0.00004957821],"about_ca_topic_score_codex":0.0015093489,"about_ca_topic_score_gemma":0.0023626585,"teacher_disagreement_score":0.00507532,"about_ca_system_score_codex":0.00043995932,"about_ca_system_score_gemma":0.00047375384,"threshold_uncertainty_score":0.02002871},"labels":[],"label_agreement":null},{"id":"W2921249631","doi":"10.1109/tifs.2019.2903651","title":"Secure Approximate String Matching for Privacy-Preserving Record Linkage","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bloom filter; Computer science; Homomorphic encryption; Approximate string matching; Encryption; Matching (statistics); Theoretical computer science; String searching algorithm; String (physics); Protocol (science); Record linkage; Computer security; Cryptography; Data mining; Pattern matching; Computer network; Artificial intelligence; Mathematics","score_opus":0.009779452813707932,"score_gpt":0.22270519682584808,"score_spread":0.21292574401214015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921249631","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.035129275,0.00018844202,0.96038294,0.00058864726,0.000048168084,0.00016135573,0.00015036293,0.0006703744,0.0026804775],"genre_scores_gemma":[0.7144869,0.0002588819,0.28033695,0.00031637528,0.00009260027,0.00034574862,0.00033837158,0.00011734104,0.0037068748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98507255,0.0049992786,0.001386819,0.0017136204,0.005887142,0.0009405406],"domain_scores_gemma":[0.97764844,0.0071043465,0.0024079382,0.010952431,0.001430649,0.00045614547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076802415,0.00042701958,0.001321137,0.0013359669,0.0016919329,0.0038428192,0.0024503144,0.0025871522,0.0024808084],"category_scores_gemma":[0.023049813,0.00062419125,0.0010678383,0.0027065726,0.0028128093,0.0088570155,0.007874255,0.0027435499,0.0011670153],"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.0011487457,0.0003508953,0.0022686783,0.00032623712,0.00014656482,0.00065779075,0.001385081,0.08436114,0.036015883,0.70244634,0.0039243195,0.16696842],"study_design_scores_gemma":[0.00018139672,0.00038479958,0.00066535105,0.000084446656,0.00008764807,0.0010648475,0.00035518265,0.47165683,0.08994923,0.42247677,0.012971694,0.0001219016],"about_ca_topic_score_codex":0.0002943419,"about_ca_topic_score_gemma":0.00021398955,"teacher_disagreement_score":0.0076802415,"about_ca_system_score_codex":0.0018602011,"about_ca_system_score_gemma":0.0026248032,"threshold_uncertainty_score":0.040617466},"labels":[],"label_agreement":null},{"id":"W2941649104","doi":"10.1109/tifs.2019.2956591","title":"A Robust Approach for Securing Audio Classification Against Adversarial Attacks","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Spectrogram; Artificial intelligence; Codebook; Audio signal; Speech recognition; Deep learning; Smoothing; Pattern recognition (psychology); Preprocessor; Support vector machine; Feature learning; Machine learning; Speech coding; Computer vision","score_opus":0.030064764888993376,"score_gpt":0.2290495888172815,"score_spread":0.19898482392828812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941649104","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.009927457,0.00030348828,0.9870948,0.00011835075,0.00006537538,0.000034415927,0.000040959556,0.0013705797,0.0010445552],"genre_scores_gemma":[0.65736395,0.0006917604,0.3355744,0.00028638347,0.0002203873,0.00012108529,0.0002746557,0.00016297257,0.0053044627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989042,0.00015240534,0.00006385837,0.00020141464,0.0005764774,0.000101647274],"domain_scores_gemma":[0.9989833,0.00027818928,0.00016174755,0.00032178234,0.00020661109,0.000048396938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883538,0.000908542,0.00068926497,0.0009023392,0.0003279021,0.00084465975,0.0011974558,0.0010466689,0.0017565072],"category_scores_gemma":[0.0026573504,0.00035418555,0.00068380893,0.00043580105,0.000848017,0.0012928839,0.0015758909,0.0015540273,0.0011759778],"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.00037694068,0.00011578484,0.00073023373,0.00012791743,0.00010753028,0.0003001289,0.00008578778,0.3738408,0.15544261,0.019398656,0.0040518525,0.44542173],"study_design_scores_gemma":[0.000006504115,0.00010524012,0.0002699185,0.000010858706,0.00001516294,0.00013221172,0.0000116645215,0.9728705,0.02027841,0.0041953013,0.0020882068,0.000015921009],"about_ca_topic_score_codex":0.0008044806,"about_ca_topic_score_gemma":0.0008547136,"teacher_disagreement_score":0.0017565072,"about_ca_system_score_codex":0.0004972895,"about_ca_system_score_gemma":0.0005400713,"threshold_uncertainty_score":0.005876124},"labels":[],"label_agreement":null},{"id":"W2984856130","doi":"10.1109/tifs.2019.2951310","title":"Neural Network Architecture and Transient Evoked Otoacoustic Emission (TEOAE) Biometrics for Identification and Verification","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Speech and Audio Processing","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Computer science; Biometrics; Session (web analytics); Speech recognition; Authentication (law); Replay attack; Identification (biology); Word error rate; Artificial neural network; Transient (computer programming); Pattern recognition (psychology); Artificial intelligence; Computer security","score_opus":0.007772958808412466,"score_gpt":0.21893264493094688,"score_spread":0.2111596861225344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984856130","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.15151885,0.0028524303,0.83747745,0.0006603591,0.00022055858,0.000047045873,0.00016366903,0.0020551116,0.005004527],"genre_scores_gemma":[0.9024824,0.0006568601,0.08981069,0.00020762069,0.000053570187,0.00004537987,0.00025543044,0.00003718694,0.006450888],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995963,0.00007984347,0.000022549768,0.00010962889,0.0001298728,0.00006183852],"domain_scores_gemma":[0.9996612,0.000090429574,0.000046467543,0.000043300122,0.00014193624,0.000016671507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071055087,0.0005989116,0.000300165,0.0003802309,0.00020730749,0.0004451399,0.00060997164,0.0008318694,0.0011141686],"category_scores_gemma":[0.001493832,0.00017092297,0.00029475417,0.00032092916,0.0002503958,0.0008284643,0.0005253006,0.0006865871,0.00055998523],"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.00038772772,0.00021192992,0.0033818004,0.000113318965,0.00014575066,0.0001954577,0.00007725191,0.3159374,0.071245015,0.004124912,0.0028843542,0.60129505],"study_design_scores_gemma":[0.0000036035872,0.00008205083,0.0010216153,0.000009007589,0.000017218596,0.000066361164,0.000009605754,0.9860563,0.010922227,0.00102005,0.0007823154,0.000009664231],"about_ca_topic_score_codex":0.0038302469,"about_ca_topic_score_gemma":0.0041666576,"teacher_disagreement_score":0.0038302469,"about_ca_system_score_codex":0.00054396485,"about_ca_system_score_gemma":0.00046472883,"threshold_uncertainty_score":0.007615924},"labels":[],"label_agreement":null},{"id":"W3005714870","doi":"10.1109/tifs.2020.2973875","title":"A Collaborative Security Framework for Software-Defined Wireless Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Canada Research Chairs","keywords":"Computer science; Intrusion detection system; Wireless sensor network; Forwarding plane; Anomaly detection; Computer network; Software-defined networking; Software; Authentication (law); Computer security; Data mining; Operating system","score_opus":0.009341014738182208,"score_gpt":0.22084125088290169,"score_spread":0.21150023614471947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005714870","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.0022242758,0.00024064425,0.99404943,0.00014759626,0.00006436686,0.00016024646,0.00002794011,0.0013382442,0.001747244],"genre_scores_gemma":[0.19754544,0.0007607391,0.79469883,0.00016449604,0.00012442439,0.0007634314,0.00028579566,0.00021084638,0.0054459968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981521,0.0004497097,0.00016801435,0.00025402458,0.00079721,0.00017895066],"domain_scores_gemma":[0.99911064,0.00020734611,0.00008683916,0.00025805575,0.00021286911,0.00012427694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031939736,0.0009692735,0.0006484449,0.0010166871,0.0010539653,0.0022607108,0.0027372674,0.0015395669,0.0016985654],"category_scores_gemma":[0.002207914,0.00042446723,0.0014896898,0.00053010415,0.0010516649,0.002590659,0.002713994,0.001919877,0.000640508],"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.00017798044,0.00027453102,0.0010143343,0.00028421954,0.00014852328,0.00054202013,0.0005703952,0.2804928,0.012943771,0.5378573,0.007173228,0.15852092],"study_design_scores_gemma":[0.000041666026,0.0001294862,0.00016555567,0.000051850497,0.000047720245,0.00022715286,0.000049313385,0.9169907,0.003944907,0.04063912,0.037673425,0.000039074996],"about_ca_topic_score_codex":0.0042539123,"about_ca_topic_score_gemma":0.0041154996,"teacher_disagreement_score":0.0042539123,"about_ca_system_score_codex":0.0010107481,"about_ca_system_score_gemma":0.002717207,"threshold_uncertainty_score":0.01689154},"labels":[],"label_agreement":null},{"id":"W3010352301","doi":"10.1109/tifs.2020.2978592","title":"Comments on “A Public Auditing Protocol With Novel Dynamic Structure for Cloud Data”","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":9,"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 Scholarship Council; Education Department of Hunan Province","keywords":"Computer science; Computer security; Protocol (science); Audit; Cloud computing; Adversary; Business","score_opus":0.03513486277404401,"score_gpt":0.2722186262365035,"score_spread":0.2370837634624595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010352301","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031537886,0.0008994831,0.015056235,0.93777484,0.024839316,0.0001270228,0.00043584523,0.0005759311,0.017137542],"genre_scores_gemma":[0.04994169,0.0010661158,0.006411704,0.8959887,0.0146569135,0.00025039175,0.00025317882,0.00036337337,0.031067926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9855935,0.005114464,0.0011896095,0.0016191793,0.0048345155,0.0016486594],"domain_scores_gemma":[0.94628423,0.032313757,0.0024805106,0.0024025913,0.015214415,0.0013044729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011881717,0.0009147073,0.00053476193,0.00090693677,0.0057258634,0.0033099472,0.002940329,0.024097987,0.0105508575],"category_scores_gemma":[0.07612533,0.000623884,0.0014727182,0.0010343549,0.004498971,0.0075495453,0.0026256868,0.018819407,0.0052167024],"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.00009957938,0.000022852506,0.00060727075,0.0001144188,0.000017629956,0.00065682357,0.0015013019,0.00061763445,0.0009086209,0.049554005,0.93830407,0.007595885],"study_design_scores_gemma":[0.000045184705,0.00008031473,0.0008485009,0.0002702499,0.00003133918,0.0004412199,0.0018489173,0.0021005808,0.0029091563,0.013488401,0.97776175,0.00017432313],"about_ca_topic_score_codex":0.017736815,"about_ca_topic_score_gemma":0.013250313,"teacher_disagreement_score":0.024097987,"about_ca_system_score_codex":0.00716654,"about_ca_system_score_gemma":0.0056496635,"threshold_uncertainty_score":0.0628373},"labels":[],"label_agreement":null},{"id":"W3010661194","doi":"10.1109/tifs.2020.2980190","title":"<i>CPA</i>: Accurate <i>C</i>ross-<i>P</i>latform Binary <i>A</i>uthorship Characterization Using LDA","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Software Engineering Research","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":"Concordia University","funders":"United Arab Emirates University","keywords":"Computer science; Binary number; Code refactoring; Binary code; Robustness (evolution); Compiler; Code (set theory); Coding (social sciences); Artificial intelligence; Natural language processing; Information retrieval; Set (abstract data type); Programming language; Software; Arithmetic","score_opus":0.028526798185236926,"score_gpt":0.24928584961411068,"score_spread":0.22075905142887375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010661194","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.04023239,0.0009140787,0.64207155,0.0016292061,0.0011945637,0.00068357895,0.048063103,0.23792703,0.027284529],"genre_scores_gemma":[0.3078514,0.0005873502,0.5543268,0.0007856212,0.0005191537,0.00095802353,0.08911522,0.01250446,0.033351954],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971885,0.0003343083,0.00026815204,0.0009327357,0.0010485899,0.00022766039],"domain_scores_gemma":[0.9895064,0.001846532,0.001001803,0.0037931309,0.0035031477,0.00034901543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020762843,0.0020136167,0.0011265079,0.006799058,0.0016302817,0.004685813,0.0016240275,0.001800301,0.023185372],"category_scores_gemma":[0.01739396,0.00077974267,0.00132302,0.003265583,0.0006934402,0.0039620916,0.0031034462,0.0022078382,0.03754347],"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.0004560386,0.00014198889,0.019578036,0.00041504277,0.00013086807,0.00027623563,0.00023332602,0.006866023,0.015093515,0.0073806145,0.36202568,0.5874026],"study_design_scores_gemma":[0.000071341725,0.00008934801,0.019171482,0.00017944598,0.00006312382,0.0009410254,0.00039136637,0.6685562,0.071611,0.028832547,0.2099006,0.0001926087],"about_ca_topic_score_codex":0.006615321,"about_ca_topic_score_gemma":0.0114467405,"teacher_disagreement_score":0.023185372,"about_ca_system_score_codex":0.0012805875,"about_ca_system_score_gemma":0.0017954594,"threshold_uncertainty_score":0.07756281},"labels":[],"label_agreement":null},{"id":"W3011065733","doi":"10.1109/tifs.2020.2980823","title":"Game Theory and Reinforcement Learning Based Secure Edge Caching in Mobile Social Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":95,"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":"Higher Education Discipline Innovation Project; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Stackelberg competition; Computer network; Enhanced Data Rates for GSM Evolution; Service provider; Mobile device; Payment; Edge device; Server; Edge computing; Service (business); Computer security; Telecommunications; World Wide Web; Cloud computing","score_opus":0.00881855331969114,"score_gpt":0.2068326833982626,"score_spread":0.19801413007857147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011065733","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.070525885,0.00074019365,0.9149326,0.0011924988,0.00011594577,0.00012224133,0.0001744552,0.00017894589,0.012017269],"genre_scores_gemma":[0.97358793,0.000413715,0.02052648,0.0001495557,0.00004946873,0.00013843886,0.00007344569,0.00001892407,0.005042037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.0005759698,0.00004425353,0.00022024217,0.00016244115,0.00023964814],"domain_scores_gemma":[0.996874,0.0021932377,0.0003301254,0.000081366496,0.00030777583,0.00021342405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014387812,0.000995846,0.001345255,0.0005760476,0.0006553165,0.001253809,0.0013879972,0.0014141088,0.002749742],"category_scores_gemma":[0.0047317003,0.00040251363,0.00080801814,0.0005418017,0.0015565827,0.001599599,0.0012129176,0.0017322733,0.00026200915],"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.00007222542,0.00007197787,0.0014460107,0.00008803325,0.0000638417,0.0003403035,0.00015449668,0.85835034,0.00074211974,0.12810299,0.0016021173,0.008965556],"study_design_scores_gemma":[0.000009746079,0.000014766147,0.00008701942,0.0000040341915,0.0000063388225,0.000014440949,0.000016371605,0.98354614,0.00004199233,0.01602143,0.00023247152,0.0000052096507],"about_ca_topic_score_codex":0.011639152,"about_ca_topic_score_gemma":0.008004093,"teacher_disagreement_score":0.011639152,"about_ca_system_score_codex":0.0022000032,"about_ca_system_score_gemma":0.001693571,"threshold_uncertainty_score":0.023142815},"labels":[],"label_agreement":null},{"id":"W3016852136","doi":"10.1109/tifs.2020.2986885","title":"In-Band Full-Duplex Discriminatory Channel Estimation Using MMSE","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Full-Duplex Wireless Communications","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":"McGill University","funders":"Hydro-Québec; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Computer science; Channel (broadcasting); Minimum mean square error; Bit error rate; Node (physics); Secrecy; Computer network; Transmission (telecommunications); Equivocation; Estimator; Telecommunications; Computer security; Statistics; Mathematics; Engineering","score_opus":0.019154918150861167,"score_gpt":0.22484675922732275,"score_spread":0.20569184107646157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016852136","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.023217011,0.00028334116,0.9741527,0.00008588982,0.000029336241,0.000025588695,0.00004257056,0.0002908196,0.0018726886],"genre_scores_gemma":[0.6900702,0.0007192841,0.30391392,0.00013875338,0.000051799478,0.00007273857,0.00018227556,0.000042582556,0.004808405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994523,0.00013408168,0.000031558695,0.00012316882,0.00019389653,0.00006502399],"domain_scores_gemma":[0.99936527,0.00028370577,0.00009259307,0.000104986364,0.00013730882,0.000016179405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618677,0.0006801527,0.00064048974,0.0003778241,0.00030735575,0.0006978279,0.0006142275,0.0005364678,0.0011698462],"category_scores_gemma":[0.0023151967,0.000291863,0.00036824035,0.00041301834,0.0005461013,0.0011201767,0.0007592613,0.00055826624,0.00048376815],"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.00067174353,0.00019739853,0.006015733,0.00052102533,0.00023037875,0.0003306144,0.0003699857,0.39190716,0.14560717,0.038349546,0.0025962475,0.41320306],"study_design_scores_gemma":[0.000021770107,0.00014985274,0.0010687169,0.000032969394,0.000040506085,0.0004037498,0.000046670888,0.93549836,0.056495912,0.0035676374,0.0026339898,0.00003987688],"about_ca_topic_score_codex":0.0010758993,"about_ca_topic_score_gemma":0.0016918314,"teacher_disagreement_score":0.0011698462,"about_ca_system_score_codex":0.0003376258,"about_ca_system_score_gemma":0.0007001087,"threshold_uncertainty_score":0.0039135814},"labels":[],"label_agreement":null},{"id":"W3033548601","doi":"10.1109/tifs.2020.3036242","title":"Long Short-Term Memory With Gate and State Level Fusion for Light Field-Based Face Recognition","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","topic":"Face recognition and analysis","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field (mathematics); Context (archaeology); Artificial intelligence; Face (sociological concept); Deep learning; Process (computing); Term (time); Facial recognition system; Long short term memory; Artificial neural network; Recurrent neural network; State (computer science); Sequence (biology); Pattern recognition (psychology); Machine learning; Algorithm","score_opus":0.030537528368764166,"score_gpt":0.24224518165700742,"score_spread":0.21170765328824326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033548601","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.07108332,0.0014861766,0.9189193,0.0003618542,0.00015719,0.000078762445,0.00037649638,0.003923639,0.0036131972],"genre_scores_gemma":[0.8266641,0.0005852136,0.16684169,0.00028528651,0.00005980323,0.000100228965,0.00089864584,0.00009569189,0.004469216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977225,0.000032186006,0.000011595009,0.000066862005,0.000073954885,0.00004309638],"domain_scores_gemma":[0.9998246,0.000056819605,0.000022142962,0.000041349485,0.000044327648,0.00001073163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448784,0.00060157414,0.0004823028,0.00039222324,0.0002112326,0.00048260996,0.00095215003,0.0006614724,0.0021714722],"category_scores_gemma":[0.0010808047,0.00017961358,0.00046818348,0.0004818201,0.00035002423,0.0011549477,0.00072588475,0.0009909316,0.0007847191],"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.00036788173,0.00022533888,0.0012686119,0.00011851988,0.00011066248,0.00012767686,0.00008985597,0.19061741,0.041269563,0.0078666415,0.0052028657,0.75273496],"study_design_scores_gemma":[0.000005922512,0.000079776,0.00032990985,0.000008215414,0.000021943317,0.000039078892,0.000012658513,0.9743147,0.018524464,0.0053206724,0.0013316197,0.00001106376],"about_ca_topic_score_codex":0.0042905216,"about_ca_topic_score_gemma":0.0058352645,"teacher_disagreement_score":0.0042905216,"about_ca_system_score_codex":0.00069766963,"about_ca_system_score_gemma":0.0006930557,"threshold_uncertainty_score":0.008531094},"labels":[],"label_agreement":null},{"id":"W3034257221","doi":"10.1109/tifs.2020.3001669","title":"Atomos: Constant-Size Path Validation Proof","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Network Packet Processing and Optimization","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":"Simon Fraser University","funders":"Zhejiang University; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Mathematical proof; Theoretical computer science; Cryptography; Homomorphic encryption; Encryption; Network packet; Path (computing); Computer network; Distributed computing; Algorithm; Mathematics","score_opus":0.010610844411680276,"score_gpt":0.20873129150892647,"score_spread":0.1981204470972462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034257221","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.04744114,0.0005161076,0.9406269,0.00029723853,0.00011535136,0.00039048755,0.0002968952,0.0058009163,0.0045148362],"genre_scores_gemma":[0.69143975,0.00032356058,0.30344528,0.00020352525,0.00007992435,0.00022155057,0.00048488035,0.00041852848,0.0033829934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969317,0.0007203142,0.00026686012,0.00047527932,0.0013005817,0.00030525163],"domain_scores_gemma":[0.98397857,0.0052457503,0.002013671,0.0068226866,0.0015695838,0.000369711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034549139,0.000545678,0.0005992248,0.000844714,0.0008280902,0.0018214717,0.0020212058,0.00069621875,0.0058152075],"category_scores_gemma":[0.00958157,0.0004718227,0.0006652967,0.00069406896,0.0021269529,0.0058998717,0.003292535,0.0015377004,0.0014824119],"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.0025587783,0.00057725323,0.0046831034,0.0011941207,0.00018733788,0.00061561493,0.00059606024,0.042717304,0.118408486,0.39848837,0.011925562,0.41804808],"study_design_scores_gemma":[0.0007031808,0.0016730626,0.0017501401,0.00018572836,0.00027547634,0.00249052,0.00034418094,0.41645607,0.2743585,0.24864282,0.052930072,0.0001902897],"about_ca_topic_score_codex":0.00037733957,"about_ca_topic_score_gemma":0.0003697905,"teacher_disagreement_score":0.0058152075,"about_ca_system_score_codex":0.0010362002,"about_ca_system_score_gemma":0.0024192997,"threshold_uncertainty_score":0.019453824},"labels":[],"label_agreement":null},{"id":"W3034303608","doi":"10.1109/tifs.2020.3001729","title":"EEG-based Human Recognition Using Steady-State AEPs and Subject-Unique Spatial Filters","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":43,"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; Brain–computer interface; Biometrics; Electroencephalography; Speech recognition; Pattern recognition (psychology); Artificial intelligence; Session (web analytics); Feature extraction; Feature (linguistics); Replicate; Mathematics; Psychology; Statistics; Neuroscience","score_opus":0.03895696316226395,"score_gpt":0.25581474293237455,"score_spread":0.21685777977011061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034303608","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.24271229,0.001811615,0.7484329,0.000116668256,0.00010343383,0.00014097607,0.0003988572,0.0016679022,0.0046154168],"genre_scores_gemma":[0.81827813,0.0017675081,0.17696689,0.00008110448,0.00009731518,0.00013172042,0.00036294005,0.00005540755,0.002258962],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995627,0.0001134617,0.000023216233,0.00011921092,0.00015838386,0.000023033366],"domain_scores_gemma":[0.99969184,0.00012860089,0.000045802448,0.000042633135,0.000075830336,0.000015335183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046661668,0.00039425094,0.00037366417,0.0006868136,0.00009896749,0.00046560614,0.00027286416,0.00050473487,0.0012935756],"category_scores_gemma":[0.001081756,0.00014829011,0.00029900996,0.000692005,0.000290139,0.0007489417,0.0003269319,0.00025723368,0.0007999937],"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.00051453215,0.00013312009,0.0035879018,0.0004161154,0.0001294695,0.00028591105,0.000117087606,0.004407384,0.48916423,0.0015607654,0.0008499142,0.49883354],"study_design_scores_gemma":[0.00011669047,0.0019130356,0.13951926,0.00013736208,0.0003783354,0.0067890207,0.00025007894,0.3179971,0.5185769,0.005078497,0.009088643,0.00015506447],"about_ca_topic_score_codex":0.0002771787,"about_ca_topic_score_gemma":0.0004586007,"teacher_disagreement_score":0.0012935756,"about_ca_system_score_codex":0.00008717627,"about_ca_system_score_gemma":0.00013517735,"threshold_uncertainty_score":0.0043274164},"labels":[],"label_agreement":null},{"id":"W3040629071","doi":"10.1109/tifs.2020.3006313","title":"Evaluation of the Time Stability and Uniqueness in PPG-Based Biometric System","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":76,"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; Royal Bank of Canada","keywords":"Computer science; Biometrics; Software portability; Convolutional neural network; Robustness (evolution); Deep learning; Dynamic time warping; Artificial intelligence; Pattern recognition (psychology); Speech recognition; Real-time computing; Data mining; Machine learning","score_opus":0.019574760674543168,"score_gpt":0.21126779254951134,"score_spread":0.19169303187496817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040629071","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.874843,0.0018004178,0.116939366,0.00023154217,0.00028062382,0.000105857194,0.0011853217,0.0010277705,0.0035861454],"genre_scores_gemma":[0.9831109,0.00026858033,0.01469743,0.000059007543,0.0000550879,0.000034820892,0.00076735613,0.00003064011,0.0009760808],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987544,0.00022886797,0.00009057175,0.00031563998,0.0005049288,0.000105548235],"domain_scores_gemma":[0.9987205,0.0004619802,0.000197227,0.00017654849,0.00037239087,0.00007124712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013052567,0.00047620482,0.00066046196,0.0007180387,0.00024369455,0.00062647025,0.0004410328,0.0009176806,0.0012885389],"category_scores_gemma":[0.005184494,0.000088316985,0.00026132708,0.0003652171,0.00023522193,0.0008310256,0.00080880156,0.00033548314,0.00058448914],"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.0050039156,0.0005202427,0.07896314,0.00087420095,0.000471396,0.0014298635,0.0003158387,0.043226592,0.27928206,0.0020472144,0.0058557796,0.58200985],"study_design_scores_gemma":[0.00007443147,0.0022486188,0.15711553,0.00009318897,0.0002421704,0.0045468556,0.00035519226,0.6341255,0.19529442,0.0013629968,0.004421904,0.00011922574],"about_ca_topic_score_codex":0.00072850497,"about_ca_topic_score_gemma":0.0007756264,"teacher_disagreement_score":0.0013052567,"about_ca_system_score_codex":0.00026402052,"about_ca_system_score_gemma":0.0002603981,"threshold_uncertainty_score":0.006902933},"labels":[],"label_agreement":null},{"id":"W3046608666","doi":"10.1109/tifs.2020.3013210","title":"Secure Interference Exploitation Precoding in MISO Wiretap Channel: Destructive Region Redefinition With Efficient Solutions","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"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 Science and Technology Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; Southeast University","keywords":"Precoding; Computer science; Zero-forcing precoding; Karush–Kuhn–Tucker conditions; Artificial noise; Channel state information; Channel (broadcasting); Convex optimization; Transmitter power output; MIMO; Optimization problem; Interference (communication); Transmitter; Mathematical optimization; Algorithm; Regular polygon; Wireless; Mathematics; Computer network; Telecommunications","score_opus":0.02736995863524533,"score_gpt":0.20817561818918356,"score_spread":0.18080565955393824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046608666","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.0071160193,0.0003062369,0.9877341,0.00013858973,0.00002926627,0.00002811886,0.000021321272,0.00006870006,0.004557689],"genre_scores_gemma":[0.6107853,0.0019761377,0.37795857,0.0003012891,0.00017880827,0.00029504913,0.00012499673,0.00009626675,0.008283528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993407,0.00022841539,0.000024301999,0.0000877831,0.0002307302,0.00008801965],"domain_scores_gemma":[0.99928844,0.00036272625,0.000089642104,0.00010540334,0.00011862428,0.000034997418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008844357,0.0013068999,0.00071484677,0.0004270043,0.0003485677,0.0010331894,0.00090437004,0.00092083775,0.0018177001],"category_scores_gemma":[0.0018692111,0.0003128266,0.00050034706,0.0007099816,0.0012224329,0.0011011305,0.0017363391,0.0015102273,0.00055070635],"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.00017509844,0.00008534007,0.00050712144,0.00023399934,0.00007637166,0.00038249613,0.00031985503,0.55478287,0.02362085,0.3237655,0.0032098843,0.09284065],"study_design_scores_gemma":[0.000013565122,0.000058752554,0.000056485078,0.000017931028,0.000010824437,0.000120499986,0.000039987623,0.96610314,0.0038506384,0.027843084,0.0018716548,0.0000134331785],"about_ca_topic_score_codex":0.00048141793,"about_ca_topic_score_gemma":0.00055527827,"teacher_disagreement_score":0.0018177001,"about_ca_system_score_codex":0.0005231981,"about_ca_system_score_gemma":0.0006885664,"threshold_uncertainty_score":0.0060808063},"labels":[],"label_agreement":null},{"id":"W3094374777","doi":"10.1109/tifs.2020.3032276","title":"Physical-Layer Secret Key Generation via CQI-Mapped Spatial Modulation in Multi-Hop Wiretap Ad-Hoc Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"European Research Council; Engineering and Physical Sciences Research Council; Royal Society","keywords":"Computer science; Physical layer; Computer network; Wireless ad hoc network; Key generation; Secrecy; Key (lock); Wireless; Encryption; Wireless network; Computer security; Telecommunications","score_opus":0.022541335207689993,"score_gpt":0.23433401272891258,"score_spread":0.21179267752122258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094374777","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.099036604,0.00073866395,0.8952214,0.0002182791,0.000046023102,0.000057884667,0.000050068546,0.00017137105,0.00445974],"genre_scores_gemma":[0.97043645,0.00035616444,0.028421767,0.000039521816,0.000017113149,0.000033275246,0.000018235662,0.0000072765506,0.0006701382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994105,0.000260403,0.000021185448,0.00005197913,0.00020130907,0.0000545429],"domain_scores_gemma":[0.99908113,0.0005026867,0.00016675766,0.00012432695,0.00010318564,0.000021961258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082676363,0.00037904183,0.00035299646,0.00035788657,0.00031756118,0.0005486131,0.0005216669,0.00039365867,0.0005370501],"category_scores_gemma":[0.0019280575,0.00018538546,0.00019258451,0.0005664906,0.0012484601,0.00090656837,0.00092610146,0.0004707665,0.00015965855],"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.0003509401,0.0000718099,0.0014380511,0.0003579993,0.00007644387,0.00077164604,0.0004391387,0.69492847,0.084948026,0.14542471,0.0012346903,0.06995804],"study_design_scores_gemma":[0.000011078227,0.00010994705,0.00014308815,0.000014948028,0.000011052057,0.00016572908,0.000038161408,0.97860134,0.0101655945,0.010132115,0.00059053313,0.000016389102],"about_ca_topic_score_codex":0.00034102818,"about_ca_topic_score_gemma":0.0003530801,"teacher_disagreement_score":0.00082676363,"about_ca_system_score_codex":0.00042677217,"about_ca_system_score_gemma":0.00036474183,"threshold_uncertainty_score":0.0043723583},"labels":[],"label_agreement":null},{"id":"W3107219844","doi":"10.1109/tifs.2020.3040877","title":"Secure Content Delivery in Two-Tier Cache-Enabled mmWave Heterogeneous Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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; University of Windsor","funders":"Xidian University; Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Base station; Throughput; Transmission (telecommunications); Resource allocation; Stochastic geometry; Artificial noise; Secrecy; Heterogeneous network; Wireless network; Wireless; Telecommunications; Channel (broadcasting); Transmitter; Computer security","score_opus":0.018655546970566043,"score_gpt":0.21428125752509386,"score_spread":0.19562571055452782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107219844","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.36058635,0.0013448201,0.6329611,0.00038875677,0.00007074563,0.00007252962,0.00015262951,0.00023512845,0.00418792],"genre_scores_gemma":[0.98921096,0.00026464046,0.009605221,0.00005139486,0.00001658827,0.000023439794,0.00002800618,0.000007536252,0.0007920338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991518,0.00025545736,0.000030006495,0.00013646236,0.00019993374,0.00022629548],"domain_scores_gemma":[0.99851376,0.00068561715,0.00028013086,0.00016673292,0.00028247206,0.000071361355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740666,0.00076480274,0.0008078811,0.00056226226,0.0008061773,0.0011275773,0.0010243498,0.00096201315,0.00054558646],"category_scores_gemma":[0.0022491117,0.00031576215,0.00040754766,0.0008697937,0.00096162787,0.0019556372,0.0011705741,0.00044696423,0.00014399517],"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.00051225425,0.00009672914,0.0032619773,0.00014030775,0.00012227906,0.0010820719,0.00019777186,0.9050091,0.02929705,0.036340605,0.0009141678,0.02302561],"study_design_scores_gemma":[0.00000724105,0.00005897342,0.00025874516,0.0000045264355,0.000018593231,0.00010827493,0.000042206288,0.9945756,0.0026096238,0.0020993347,0.00020707116,0.00000978043],"about_ca_topic_score_codex":0.004183001,"about_ca_topic_score_gemma":0.0032710135,"teacher_disagreement_score":0.004183001,"about_ca_system_score_codex":0.0015047801,"about_ca_system_score_gemma":0.0005143483,"threshold_uncertainty_score":0.010917962},"labels":[],"label_agreement":null},{"id":"W3120254887","doi":"10.1109/tifs.2021.3053458","title":"Depth as Attention for Face Representation Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Face recognition and analysis","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"RGB color model; Focus (optics); Pattern recognition (psychology); Deep learning; Face (sociological concept); Convolutional neural network; Facial recognition system; Convolution (computer science)","score_opus":0.015854496879783256,"score_gpt":0.2603825994790686,"score_spread":0.24452810259928537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120254887","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.037996363,0.0042085326,0.9439158,0.00096846704,0.0003239993,0.00013464631,0.0006542295,0.0052981144,0.0064999345],"genre_scores_gemma":[0.76406586,0.0022101754,0.21981914,0.0013292916,0.00040037578,0.0001869081,0.0013598212,0.00026882676,0.01035959],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995751,0.0000631421,0.000015630643,0.00014500476,0.00011843491,0.00008267665],"domain_scores_gemma":[0.99961275,0.00014769597,0.000035315566,0.000074116906,0.00009925261,0.00003096354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005428634,0.0014674844,0.0007493197,0.0009124811,0.00028943614,0.0007215009,0.0017048831,0.0010965191,0.0045903344],"category_scores_gemma":[0.0019909125,0.00035382595,0.00079520425,0.00074434845,0.0004682765,0.0017907335,0.0016291173,0.001386149,0.00094596465],"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.00035585268,0.00015620909,0.0013745334,0.00019199631,0.00010836273,0.0000798891,0.000083165694,0.09321408,0.032348257,0.008861824,0.013750808,0.84947497],"study_design_scores_gemma":[0.000028011546,0.00011223601,0.0010684142,0.000030480598,0.000060074402,0.000107891545,0.000024020723,0.95500803,0.01873087,0.020007232,0.004801706,0.000021048116],"about_ca_topic_score_codex":0.009007139,"about_ca_topic_score_gemma":0.009414919,"teacher_disagreement_score":0.009007139,"about_ca_system_score_codex":0.001333885,"about_ca_system_score_gemma":0.0006545363,"threshold_uncertainty_score":0.017909408},"labels":[],"label_agreement":null},{"id":"W3127329908","doi":"10.1109/tifs.2021.3056206","title":"Reinforcement Learning-Based Physical-Layer Authentication for Controller Area Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":74,"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; Reinforcement learning; Authentication (law); Spoofing attack; Authentication protocol; Computer network; Artificial intelligence; Computer security","score_opus":0.00821658973213008,"score_gpt":0.20622638871690946,"score_spread":0.19800979898477938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127329908","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.04864463,0.00038777513,0.9476016,0.00021201685,0.000066669796,0.000052307372,0.000028027078,0.0009369024,0.0020700688],"genre_scores_gemma":[0.97353685,0.00006502256,0.025139175,0.000053721105,0.0000144333935,0.000026815673,0.000025293617,0.0000130935405,0.0011256681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948573,0.00013548287,0.000031367716,0.00011903781,0.00013037166,0.00009801013],"domain_scores_gemma":[0.9987451,0.0006092273,0.00016546062,0.00016429328,0.0002489158,0.000066881716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010620165,0.00056438305,0.00066889776,0.00025627873,0.00036259092,0.00044788886,0.0009829309,0.0006198242,0.0015311211],"category_scores_gemma":[0.0030625283,0.00020148695,0.00025831506,0.00023805436,0.00083587965,0.0011091982,0.00089636474,0.001164397,0.0002762327],"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.00024977874,0.000115948176,0.0011931867,0.00005731525,0.00003245293,0.000061341234,0.000054316508,0.88326585,0.005126122,0.007941545,0.0008656,0.10103658],"study_design_scores_gemma":[0.0000057909565,0.000025228717,0.00007877853,0.0000018762387,0.0000025007964,0.0000075636794,0.0000022307015,0.9976203,0.00072282663,0.001408683,0.00012140474,0.0000027962858],"about_ca_topic_score_codex":0.0036802918,"about_ca_topic_score_gemma":0.0026503773,"teacher_disagreement_score":0.0036802918,"about_ca_system_score_codex":0.000935352,"about_ca_system_score_gemma":0.0010472519,"threshold_uncertainty_score":0.007317722},"labels":[],"label_agreement":null},{"id":"W3137858533","doi":"10.1109/tifs.2021.3107157","title":"Unsupervised and Self-Adaptative Techniques for Cross-Domain Person Re-Identification","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","topic":"Video Surveillance and Tracking Methods","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":"Artificial Intelligence in Medicine (Canada)","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Overfitting; Artificial intelligence; Machine learning; Identification (biology); Generalization; Task (project management); Feature (linguistics); Domain (mathematical analysis); Function (biology); Annotation; Adaptation (eye); Pattern recognition (psychology); Artificial neural network","score_opus":0.026237316399433202,"score_gpt":0.2951894032612501,"score_spread":0.2689520868618169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137858533","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.017809227,0.0005549576,0.9767553,0.00010784815,0.00012821596,0.00007379294,0.00008776928,0.0029286938,0.0015542543],"genre_scores_gemma":[0.3852896,0.00064378005,0.60017294,0.00044601675,0.00016725197,0.00019702231,0.0010795392,0.00073869136,0.011265182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983707,0.00038971577,0.0000702574,0.00067135505,0.00032029185,0.00017776657],"domain_scores_gemma":[0.99822587,0.00033459353,0.00021338598,0.000778892,0.00035746983,0.00008984378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00224119,0.0018273568,0.0015577697,0.0015230755,0.00072205433,0.0008764543,0.0032744408,0.0017814212,0.0023838594],"category_scores_gemma":[0.0042483835,0.00077696686,0.001635659,0.0012606082,0.00084922503,0.0023620483,0.0024761045,0.0022235275,0.003251938],"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.00029175897,0.00030312946,0.0029762876,0.00014017477,0.00027753707,0.0002760954,0.00026349706,0.13755353,0.024467554,0.0046489555,0.008915513,0.8198859],"study_design_scores_gemma":[0.000011847658,0.000100026664,0.0013735748,0.000021302916,0.00004022555,0.00043652116,0.00008625847,0.9726739,0.015912503,0.004751024,0.004550245,0.000042663345],"about_ca_topic_score_codex":0.002665187,"about_ca_topic_score_gemma":0.00415054,"teacher_disagreement_score":0.0032744408,"about_ca_system_score_codex":0.0005464254,"about_ca_system_score_gemma":0.0008355006,"threshold_uncertainty_score":0.011852682},"labels":[],"label_agreement":null},{"id":"W3138128528","doi":"10.1109/tifs.2022.3175603","title":"Multidiscriminator Sobolev Defense-GAN Against Adversarial Attacks for End-to-End Speech Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":16,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; End-to-end principle; Adversarial system; Computer security; Computer network; Artificial intelligence","score_opus":0.013017597229911864,"score_gpt":0.24394094372140002,"score_spread":0.23092334649148816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138128528","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.023855753,0.00039215022,0.97175986,0.00028784788,0.000061270934,0.000041600684,0.000052145766,0.0012313892,0.0023179897],"genre_scores_gemma":[0.86063814,0.00024263731,0.13306142,0.00035964514,0.000054557404,0.00009310171,0.00017766799,0.00015130964,0.0052215196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927455,0.00024066474,0.000028707007,0.00012479546,0.00024142656,0.000089819616],"domain_scores_gemma":[0.99880946,0.000678013,0.00009452694,0.00021199773,0.000147724,0.000058236583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014281023,0.0010887231,0.00080758904,0.00041761604,0.00035752324,0.00058181345,0.0010151066,0.0013255039,0.0015790113],"category_scores_gemma":[0.0030130881,0.00030541647,0.0005102304,0.00021322681,0.0009271168,0.0011172062,0.0019490552,0.0021170217,0.00065135205],"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.00031942717,0.00006721689,0.000724689,0.00008276954,0.000079370824,0.00020449977,0.00011040059,0.81096846,0.023044037,0.029826725,0.0030611798,0.13151132],"study_design_scores_gemma":[0.0000040767495,0.000033838962,0.00006223706,0.0000051075012,0.0000043213404,0.000056689973,0.0000055049004,0.9912958,0.004215426,0.0038198503,0.0004908105,0.000006235996],"about_ca_topic_score_codex":0.00061995175,"about_ca_topic_score_gemma":0.0007075894,"teacher_disagreement_score":0.0015790113,"about_ca_system_score_codex":0.0006653516,"about_ca_system_score_gemma":0.0006137043,"threshold_uncertainty_score":0.007552564},"labels":[],"label_agreement":null},{"id":"W3212441542","doi":"10.1109/tifs.2021.3125608","title":"UN-AVOIDS: Unsupervised and Nonparametric Approach for Visualizing Outliers and Invariant Detection Scoring","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":17,"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":"Anomaly detection; Visualization; Nonparametric statistics; Novelty detection; Outlier; Margin (machine learning); Pattern recognition (psychology); Data visualization; Invariant (physics)","score_opus":0.012292075696533896,"score_gpt":0.2286216271770909,"score_spread":0.216329551480557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212441542","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.02869182,0.00032710042,0.96155447,0.00023176652,0.00005282699,0.00011880689,0.00068057625,0.007101297,0.001241371],"genre_scores_gemma":[0.2897878,0.00030829836,0.7055699,0.00009564757,0.00006877624,0.00026904795,0.0016474514,0.00097009935,0.0012829605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968875,0.0009873026,0.00027481216,0.0005817363,0.0010214495,0.0002472674],"domain_scores_gemma":[0.9917207,0.003639339,0.0012245991,0.0011433377,0.0019436167,0.000328562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540237,0.0016950084,0.0013608056,0.00746756,0.0007099728,0.0034009444,0.001923722,0.001474265,0.002261766],"category_scores_gemma":[0.0167383,0.00039241774,0.0012138677,0.0030871066,0.0010913532,0.0026503003,0.0028435858,0.0016257416,0.0009294314],"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.0006058481,0.00027719102,0.025090767,0.0007161475,0.00028442047,0.00035061105,0.001971342,0.08395744,0.02053313,0.025429761,0.014653102,0.8261302],"study_design_scores_gemma":[0.000049743678,0.00019111467,0.011336422,0.00011570727,0.00006259524,0.0005473943,0.00082667975,0.91854155,0.020920146,0.034371555,0.012847785,0.00018930883],"about_ca_topic_score_codex":0.003503094,"about_ca_topic_score_gemma":0.0050334856,"teacher_disagreement_score":0.00746756,"about_ca_system_score_codex":0.0009153041,"about_ca_system_score_gemma":0.0013423369,"threshold_uncertainty_score":0.024011314},"labels":[],"label_agreement":null},{"id":"W4205931382","doi":"10.1109/tifs.2021.3135112","title":"Table of Contents","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Table (database); Information retrieval; Database","score_opus":0.025281519700048088,"score_gpt":0.1945376614592603,"score_spread":0.16925614175921222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205931382","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062531896,0.004135785,0.005720306,0.0034804158,0.010217217,0.0008068063,0.077714324,0.0036189975,0.8936808],"genre_scores_gemma":[0.003549785,0.004810159,0.0035828862,0.0029844677,0.0033500483,0.00070140575,0.06967982,0.0018022534,0.9095393],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993777,0.00007740102,0.00003316273,0.00010764561,0.00034952266,0.00005457587],"domain_scores_gemma":[0.9963959,0.00070917263,0.00015612724,0.0004391326,0.0018686332,0.0004310885],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006951526,0.0010879645,0.0009673416,0.005249197,0.0015115546,0.004055607,0.0015155785,0.0010513093,0.8504352],"category_scores_gemma":[0.008241366,0.00033461337,0.00051956903,0.0035935135,0.0003488864,0.0021307485,0.0017559236,0.0010559553,0.81116706],"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.000014728464,0.000026728569,0.00010904127,0.00015301141,0.0000036472995,0.000015490332,0.000008256389,0.00012726012,0.00013881105,0.001225815,0.95076036,0.047416873],"study_design_scores_gemma":[0.000007051616,0.000013853757,0.000298652,0.00018909089,0.000005819662,0.000033515113,0.000022629521,0.00012907958,0.00018406418,0.001747377,0.99736136,0.000007560029],"about_ca_topic_score_codex":0.004001576,"about_ca_topic_score_gemma":0.005369455,"teacher_disagreement_score":0.1495648,"about_ca_system_score_codex":0.0014336229,"about_ca_system_score_gemma":0.0026632815,"threshold_uncertainty_score":0.21333605},"labels":[],"label_agreement":null},{"id":"W4212851045","doi":"10.1109/tifs.2022.3152395","title":"Efficient and Privacy-Preserving Similarity Query With Access Control in eHealthcare","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"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; Similarity (geometry); Query optimization; Information retrieval; Information privacy; Query expansion; Data mining; Artificial intelligence; Computer security","score_opus":0.010564409672217816,"score_gpt":0.23399056112468486,"score_spread":0.22342615145246705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212851045","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.025050292,0.0005214047,0.97026056,0.0006317824,0.000043245404,0.00034545996,0.00023804874,0.0008865739,0.002022665],"genre_scores_gemma":[0.7064987,0.00048664835,0.28838173,0.00054618425,0.00013456674,0.00045621739,0.0007580538,0.00007058507,0.0026673265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98996043,0.0032099392,0.0010653402,0.0014763017,0.0034144248,0.0008735619],"domain_scores_gemma":[0.99418664,0.002329559,0.00055004004,0.0017876312,0.0008731766,0.00027289163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005592828,0.00049775594,0.0016778174,0.0015567747,0.0011724193,0.0022604289,0.0031441522,0.0016833481,0.0013783613],"category_scores_gemma":[0.009708027,0.000366675,0.0012574035,0.003670986,0.0016665022,0.0068171523,0.00513304,0.0015014482,0.0004509563],"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.0020920031,0.00081121305,0.00421728,0.0005470437,0.00023293121,0.00092398224,0.0019405576,0.10381303,0.041353077,0.37782565,0.012088076,0.45415515],"study_design_scores_gemma":[0.0002505831,0.00050503114,0.0010369031,0.000037433303,0.00009708367,0.001003406,0.00034371865,0.8161105,0.024422482,0.14369649,0.012377295,0.00011906994],"about_ca_topic_score_codex":0.0028655545,"about_ca_topic_score_gemma":0.0009721733,"teacher_disagreement_score":0.005592828,"about_ca_system_score_codex":0.0016659764,"about_ca_system_score_gemma":0.0017876645,"threshold_uncertainty_score":0.02957803},"labels":[],"label_agreement":null},{"id":"W4226159313","doi":"10.1109/tifs.2022.3198283","title":"Towards Private Learning on Decentralized Graphs With Local Differential Privacy","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":84,"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":"Hong Kong Polytechnic University; Research Grants Council, University Grants Committee","keywords":"Differential privacy; Computer science; Theoretical computer science; Social graph; Graph; Information privacy; Artificial intelligence; Machine learning; Computer security; Data mining; Social media; World Wide Web","score_opus":0.011427697457889687,"score_gpt":0.2249037720772502,"score_spread":0.21347607461936052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226159313","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.017128138,0.00012340247,0.98049253,0.00067544245,0.000016096197,0.00004204524,0.0001236106,0.00031046552,0.0010881878],"genre_scores_gemma":[0.7873044,0.00036749916,0.20716482,0.0007174803,0.000111301,0.00018957799,0.0004803961,0.00020635685,0.0034580985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945304,0.0023613062,0.00016067925,0.0014577244,0.0011108544,0.00037905882],"domain_scores_gemma":[0.9831592,0.009621902,0.0014657578,0.004189542,0.0010883788,0.0004753283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057644127,0.0009646938,0.0014378908,0.0008618696,0.0011235708,0.0022296528,0.0028377953,0.0020409012,0.0014251636],"category_scores_gemma":[0.025494486,0.0007447096,0.0009589746,0.0012005201,0.0034188644,0.007467154,0.0054978556,0.0040688314,0.00038782536],"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.0002471328,0.00011566764,0.0021918484,0.000140866,0.000080299396,0.00019494757,0.00042519436,0.68248934,0.0032132796,0.23914364,0.0038043745,0.06795349],"study_design_scores_gemma":[0.00001706093,0.000024856789,0.00015913646,0.000009223794,0.000006865781,0.000047847552,0.0000349931,0.81692004,0.0010511385,0.1808102,0.0009096694,0.000009016296],"about_ca_topic_score_codex":0.0021773726,"about_ca_topic_score_gemma":0.0027434141,"teacher_disagreement_score":0.0057644127,"about_ca_system_score_codex":0.002664756,"about_ca_system_score_gemma":0.002231461,"threshold_uncertainty_score":0.030485451},"labels":[],"label_agreement":null},{"id":"W4248917891","doi":"10.1109/tifs.2014.2323186","title":"IEEE Transactions on Information Forensics and Security publication information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital and Cyber Forensics","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":"Canadian Standards Association; University of Toronto","funders":"","keywords":"Computer science; Computer security; Information security; Computer forensics; Network forensics; Internet privacy; World Wide Web; Digital forensics","score_opus":0.006970783366807788,"score_gpt":0.19656277491155122,"score_spread":0.18959199154474343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248917891","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023534039,0.060257815,0.3397112,0.030358167,0.029985484,0.0011046494,0.0052995314,0.0044711563,0.50527805],"genre_scores_gemma":[0.3065787,0.06232301,0.17456977,0.0046465956,0.010955532,0.00063433644,0.016331889,0.00086165575,0.4230986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970782,0.0006359807,0.00021219956,0.00023244014,0.001640625,0.00020065147],"domain_scores_gemma":[0.99387014,0.0012848387,0.00024943607,0.0018947785,0.002371401,0.0003294519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003480719,0.0009672444,0.0009946352,0.004491921,0.0015799287,0.005486016,0.0011642239,0.002622108,0.079621755],"category_scores_gemma":[0.010160221,0.00037835338,0.00080025557,0.0026081768,0.0013399126,0.0043611955,0.0026476774,0.001782433,0.03011599],"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.00035680112,0.00017387523,0.0022944845,0.00041276604,0.000112983405,0.0005760815,0.00019345863,0.0024333477,0.003628372,0.058056887,0.3007641,0.63099694],"study_design_scores_gemma":[0.000054493543,0.00016224764,0.0024811628,0.0006322384,0.000119808254,0.0024614667,0.00041006008,0.027442671,0.006615191,0.069052905,0.89050597,0.00006177502],"about_ca_topic_score_codex":0.0010002619,"about_ca_topic_score_gemma":0.001161016,"teacher_disagreement_score":0.079621755,"about_ca_system_score_codex":0.00095748005,"about_ca_system_score_gemma":0.0025764522,"threshold_uncertainty_score":0.26636136},"labels":[],"label_agreement":null},{"id":"W4251493287","doi":"10.1109/tifs.2014.2311199","title":"IEEE Transactions on Information Forensics and Security publication information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital and Cyber Forensics","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":"Canadian Standards Association","funders":"","keywords":"Computer science; Information security; Computer security; Information security management; Computer forensics; Internet privacy; Information retrieval; Digital forensics; Security information and event management; Cloud computing security; Cloud computing","score_opus":0.006970783366807788,"score_gpt":0.19656277491155122,"score_spread":0.18959199154474343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251493287","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023534039,0.060257815,0.3397112,0.030358167,0.029985484,0.0011046494,0.0052995314,0.0044711563,0.50527805],"genre_scores_gemma":[0.3065787,0.06232301,0.17456977,0.0046465956,0.010955532,0.00063433644,0.016331889,0.00086165575,0.4230986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970782,0.0006359807,0.00021219956,0.00023244014,0.001640625,0.00020065147],"domain_scores_gemma":[0.99387014,0.0012848387,0.00024943607,0.0018947785,0.002371401,0.0003294519],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003480719,0.0009672444,0.0009946352,0.004491921,0.0015799287,0.005486016,0.0011642239,0.002622108,0.079621755],"category_scores_gemma":[0.010160221,0.00037835338,0.00080025557,0.0026081768,0.0013399126,0.0043611955,0.0026476774,0.001782433,0.03011599],"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.00035680112,0.00017387523,0.0022944845,0.00041276604,0.000112983405,0.0005760815,0.00019345863,0.0024333477,0.003628372,0.058056887,0.3007641,0.63099694],"study_design_scores_gemma":[0.000054493543,0.00016224764,0.0024811628,0.0006322384,0.000119808254,0.0024614667,0.00041006008,0.027442671,0.006615191,0.069052905,0.89050597,0.00006177502],"about_ca_topic_score_codex":0.0010002619,"about_ca_topic_score_gemma":0.001161016,"teacher_disagreement_score":0.92037827,"about_ca_system_score_codex":0.00095748005,"about_ca_system_score_gemma":0.0025764522,"threshold_uncertainty_score":0.26636136},"labels":[],"label_agreement":null},{"id":"W4253621427","doi":"10.1109/tifs.2014.2311195","title":"IEEE Transactions on Information Forensics and Security publication information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital and Cyber Forensics","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":"Canadian Standards Association","funders":"","keywords":"Computer science; Computer security; Information security; Computer forensics; Network forensics; Digital forensics","score_opus":0.006970783366807788,"score_gpt":0.19656277491155122,"score_spread":0.18959199154474343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253621427","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023534039,0.060257815,0.3397112,0.030358167,0.029985484,0.0011046494,0.0052995314,0.0044711563,0.50527805],"genre_scores_gemma":[0.3065787,0.06232301,0.17456977,0.0046465956,0.010955532,0.00063433644,0.016331889,0.00086165575,0.4230986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970782,0.0006359807,0.00021219956,0.00023244014,0.001640625,0.00020065147],"domain_scores_gemma":[0.99387014,0.0012848387,0.00024943607,0.0018947785,0.002371401,0.0003294519],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003480719,0.0009672444,0.0009946352,0.004491921,0.0015799287,0.005486016,0.0011642239,0.002622108,0.079621755],"category_scores_gemma":[0.010160221,0.00037835338,0.00080025557,0.0026081768,0.0013399126,0.0043611955,0.0026476774,0.001782433,0.03011599],"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.00035680112,0.00017387523,0.0022944845,0.00041276604,0.000112983405,0.0005760815,0.00019345863,0.0024333477,0.003628372,0.058056887,0.3007641,0.63099694],"study_design_scores_gemma":[0.000054493543,0.00016224764,0.0024811628,0.0006322384,0.000119808254,0.0024614667,0.00041006008,0.027442671,0.006615191,0.069052905,0.89050597,0.00006177502],"about_ca_topic_score_codex":0.0010002619,"about_ca_topic_score_gemma":0.001161016,"teacher_disagreement_score":0.92037827,"about_ca_system_score_codex":0.00095748005,"about_ca_system_score_gemma":0.0025764522,"threshold_uncertainty_score":0.26636136},"labels":[],"label_agreement":null},{"id":"W4285116599","doi":"10.1109/tifs.2022.3173728","title":"Attack-Resilient Optimal PMU Placement via Reinforcement Learning Guided Tree Search in Smart Grids","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","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 New Brunswick; Concordia University","funders":"National Natural Science Foundation of China","keywords":"Observability; Reinforcement learning; Computer science; Smart grid; Phasor; Smart meter; Tree (set theory); Units of measurement; Installation; Grid; Real-time computing; Artificial intelligence; Electric power system; Engineering; Power (physics)","score_opus":0.01222098638477174,"score_gpt":0.22932889213517507,"score_spread":0.21710790575040334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285116599","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.061709087,0.00064312,0.93472415,0.00023279428,0.00004739526,0.000048558093,0.000031251846,0.0005050257,0.002058626],"genre_scores_gemma":[0.9488445,0.00019494568,0.049612045,0.00008683997,0.000020972031,0.000073646945,0.00003897545,0.000026998252,0.001101097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996724,0.00011486082,0.000016329132,0.00006176471,0.000069773334,0.000064975946],"domain_scores_gemma":[0.9991014,0.00056124653,0.00013103813,0.00003554342,0.00010907209,0.00006176211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005899,0.000726644,0.0012332081,0.0004208337,0.00035303095,0.0004804577,0.00066861504,0.0007710885,0.0010489428],"category_scores_gemma":[0.0021574784,0.00040728645,0.00041020024,0.00041210966,0.0006393584,0.00076169806,0.00063024554,0.0007898411,0.00014324034],"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.000039440183,0.000021402926,0.0002850658,0.00002369786,0.00001278021,0.00004031204,0.000023266248,0.9827534,0.00063446775,0.0015719134,0.00026364907,0.0143305855],"study_design_scores_gemma":[0.000004915896,0.000016822556,0.000031388026,0.000001730946,0.00000259362,0.0000052047444,0.00000284779,0.99908245,0.000104691426,0.00069273904,0.000053186704,0.0000014542536],"about_ca_topic_score_codex":0.0072006835,"about_ca_topic_score_gemma":0.003912197,"teacher_disagreement_score":0.0072006835,"about_ca_system_score_codex":0.00057550153,"about_ca_system_score_gemma":0.0012086424,"threshold_uncertainty_score":0.014317572},"labels":[],"label_agreement":null},{"id":"W4285154716","doi":"10.1109/tifs.2022.3188147","title":"Toward Privacy-Preserving Aggregate Reverse Skyline Query With Strong Security","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","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 Sciences and Engineering Research Council of Canada","keywords":"Computer science; Sargable; Query optimization; Online aggregation; Web query classification; Web search query; Skyline; Encryption; Query expansion; Range query (database); Bloom filter; Query language; Information retrieval; RDF query language; Database; Data mining; Computer network; Search engine","score_opus":0.01286306222578367,"score_gpt":0.21446288907127098,"score_spread":0.2015998268454873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285154716","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.061000958,0.00055882265,0.93224925,0.0010917212,0.00005667387,0.00025662917,0.0003452896,0.0014195573,0.003021121],"genre_scores_gemma":[0.8330235,0.00043037377,0.1625101,0.0005207419,0.00014199397,0.00022325922,0.00053080346,0.00010172442,0.0025175153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99198455,0.0021002803,0.0006081418,0.0011596493,0.003142142,0.0010051887],"domain_scores_gemma":[0.9905439,0.0028076835,0.0010762371,0.003787569,0.0014795368,0.00030508012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004450418,0.000724301,0.0017140883,0.0010510435,0.0016431952,0.0033134287,0.0020997778,0.0017490933,0.0016060821],"category_scores_gemma":[0.008957685,0.0005110623,0.0011492738,0.0024995047,0.0022736238,0.009217183,0.0063058315,0.0022887364,0.0007934936],"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.002821367,0.0005074773,0.006928535,0.0006516875,0.0003002227,0.0018168751,0.0026753594,0.1579221,0.14315635,0.4248315,0.015582895,0.24280564],"study_design_scores_gemma":[0.00017373121,0.00030249543,0.000697541,0.00003197996,0.00008700228,0.0015676946,0.0006645938,0.8241644,0.04913115,0.113229774,0.00984536,0.00010430819],"about_ca_topic_score_codex":0.0012557183,"about_ca_topic_score_gemma":0.00079156505,"teacher_disagreement_score":0.004450418,"about_ca_system_score_codex":0.0015350612,"about_ca_system_score_gemma":0.0027803946,"threshold_uncertainty_score":0.023536384},"labels":[],"label_agreement":null},{"id":"W4285218634","doi":"10.1109/tifs.2022.3176191","title":"PVD-FL: A Privacy-Preserving and Verifiable Decentralized Federated Learning Framework","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":104,"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":"Science Foundation of Ministry of Education of China; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Verifiable secret sharing; Deep learning; Computer security; Federated learning; Artificial intelligence; Information privacy; Data integrity; Distributed computing; Threat model; Machine learning","score_opus":0.013501337965179598,"score_gpt":0.23807430934514803,"score_spread":0.22457297137996843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285218634","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.0055931043,0.00011310542,0.9920443,0.00026519984,0.000025833202,0.00006133545,0.00010701348,0.0011182295,0.00067183375],"genre_scores_gemma":[0.63648784,0.00022066888,0.35932484,0.0004127224,0.000065863125,0.00028090386,0.00049989234,0.00013085712,0.0025764178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996935,0.0008895673,0.00016877132,0.0007435424,0.00087492686,0.00038820642],"domain_scores_gemma":[0.9966202,0.001129906,0.0003004682,0.0012323873,0.0005084645,0.00020855147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041926173,0.00064557017,0.0011280887,0.0007824994,0.0012019086,0.0018633832,0.004040957,0.001788111,0.0022210048],"category_scores_gemma":[0.0072193067,0.00050973974,0.0008428121,0.00082920864,0.0018045788,0.0046274113,0.00444211,0.0027289104,0.0005470262],"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.00066813274,0.00027190725,0.0016214824,0.00019742001,0.00012514516,0.00041418322,0.0002621296,0.5975666,0.009314844,0.15131819,0.008889461,0.22935054],"study_design_scores_gemma":[0.000040509338,0.000037821817,0.000061851715,0.0000071098575,0.0000084047315,0.00005551727,0.000015931697,0.95395595,0.002281574,0.042092804,0.0014282403,0.0000142689105],"about_ca_topic_score_codex":0.0034412798,"about_ca_topic_score_gemma":0.0038268857,"teacher_disagreement_score":0.0041926173,"about_ca_system_score_codex":0.0019136865,"about_ca_system_score_gemma":0.0040798406,"threshold_uncertainty_score":0.022172987},"labels":[],"label_agreement":null},{"id":"W4285267503","doi":"10.1109/tifs.2022.3186791","title":"Guided Erasable Adversarial Attack (GEAA) Toward Shared Data Protection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; National Laboratory of Pattern Recognition; National Natural Science Foundation of China","keywords":"Computer science; Adversarial system; Robustness (evolution); Computer security; Watermark; Implementation; Noise reduction; Deep learning; Data mining; Artificial intelligence; Embedding","score_opus":0.053612762451441566,"score_gpt":0.2779557731531623,"score_spread":0.22434301070172072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285267503","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.021128,0.00035698054,0.97322696,0.00043237407,0.00008157277,0.00006802711,0.000075474854,0.0006964189,0.003934073],"genre_scores_gemma":[0.80853164,0.00043518428,0.18403254,0.00053932925,0.00008738017,0.00014672455,0.0001912472,0.00018346989,0.005852452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979317,0.0006134142,0.00009780233,0.0003646512,0.0007534812,0.000238929],"domain_scores_gemma":[0.9964694,0.0015231314,0.00033452202,0.0012094494,0.00032945463,0.00013419717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062983,0.0010976132,0.00082373846,0.00058595696,0.00057302864,0.0011055729,0.0013712922,0.0018475226,0.0026396208],"category_scores_gemma":[0.0058908784,0.0003577858,0.00085515185,0.00039178398,0.002115183,0.0024711792,0.004038814,0.0027610732,0.00081175874],"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.0005711027,0.0001401686,0.001907434,0.00019963627,0.00021201474,0.0006694194,0.00031870033,0.5942028,0.06270987,0.1616158,0.006721849,0.17073125],"study_design_scores_gemma":[0.00002323478,0.00011165687,0.0002931869,0.000035056608,0.000024804393,0.0003691277,0.00003610467,0.9261998,0.023976652,0.044064492,0.004835296,0.00003064663],"about_ca_topic_score_codex":0.0005013728,"about_ca_topic_score_gemma":0.000534201,"teacher_disagreement_score":0.0026396208,"about_ca_system_score_codex":0.00060058705,"about_ca_system_score_gemma":0.0007773819,"threshold_uncertainty_score":0.009552777},"labels":[],"label_agreement":null},{"id":"W4292969453","doi":"10.1109/tifs.2022.3201386","title":"On Message Authentication Channel Capacity Over a Wiretap Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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; Channel (broadcasting); Computer network; Code word; Secrecy; Alice and Bob; Message authentication code; Channel capacity; Authentication (law); Key (lock); Topology (electrical circuits); Coding (social sciences); Transmitter; Decoding methods; Computer security; Telecommunications; Mathematics; Cryptography; Combinatorics; Alice (programming language)","score_opus":0.011732698473157617,"score_gpt":0.20909324173522306,"score_spread":0.19736054326206545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292969453","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.09351928,0.0017462263,0.856653,0.0015665183,0.0002503572,0.00012839636,0.00076623406,0.0009413584,0.044428717],"genre_scores_gemma":[0.9731472,0.0011770639,0.017376726,0.00018416064,0.00014763091,0.00017106207,0.00020420976,0.000084646905,0.0075071966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770665,0.0006703432,0.000064357824,0.00040820127,0.0005921549,0.00055821566],"domain_scores_gemma":[0.9956019,0.0021185966,0.00049972394,0.0007485822,0.00082991464,0.00020117922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963386,0.0012181358,0.0011547105,0.0011540381,0.0013942783,0.002020947,0.0016699051,0.0013654552,0.0064057265],"category_scores_gemma":[0.004643234,0.00044252927,0.0007753988,0.0015681463,0.0027195455,0.0056733983,0.002222435,0.0022092063,0.0011952575],"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.00030085424,0.000059763093,0.00039288666,0.00024590627,0.00004433455,0.0004479258,0.00026741705,0.22218166,0.006943114,0.7543965,0.004197957,0.010521596],"study_design_scores_gemma":[0.00003323222,0.00009617933,0.00012881034,0.000037311678,0.00003425447,0.0002004704,0.00007275709,0.858283,0.0031517707,0.13356766,0.004332088,0.00006244319],"about_ca_topic_score_codex":0.0044445377,"about_ca_topic_score_gemma":0.0016355935,"teacher_disagreement_score":0.0064057265,"about_ca_system_score_codex":0.0026904806,"about_ca_system_score_gemma":0.0017441706,"threshold_uncertainty_score":0.02142936},"labels":[],"label_agreement":null},{"id":"W4293731246","doi":"10.1109/tifs.2022.3202693","title":"Secure Transmission in NOMA-Aided Multiuser Visible Light Communication Broadcasting Network With Cooperative Precoding Design","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Computer science; Visible light communication; Transmission (telecommunications); Geometric programming; Maximization; Zero-forcing precoding; Transmitter power output; Spectral efficiency; Mathematical optimization; Algorithm; Channel (broadcasting); Computer network; Telecommunications; Mathematics; Transmitter","score_opus":0.011390988245482481,"score_gpt":0.20745660664867777,"score_spread":0.19606561840319528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293731246","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.039176952,0.000744374,0.95474356,0.00024227228,0.00004718697,0.00004001778,0.000038283066,0.0001231213,0.004844277],"genre_scores_gemma":[0.9278977,0.000995813,0.06724572,0.00011179192,0.000060663406,0.00014809756,0.0000612779,0.000024107605,0.0034548675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903154,0.00033846078,0.000027737547,0.00015620707,0.00032130536,0.00012475858],"domain_scores_gemma":[0.99901545,0.0005495842,0.00012778405,0.000063694635,0.00021157727,0.000031866075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007303349,0.00085901393,0.0007302945,0.00036983512,0.00041456343,0.0010091243,0.0009034683,0.00090540294,0.0010565378],"category_scores_gemma":[0.00193257,0.00040566252,0.000516384,0.00067650306,0.001055662,0.0010361124,0.0009903352,0.000693736,0.00031841153],"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.00011831188,0.000044247423,0.00074688107,0.00014219174,0.00006214635,0.00026066235,0.00019136143,0.9333456,0.01095704,0.025985159,0.0006761825,0.027470196],"study_design_scores_gemma":[0.000005451289,0.000044396013,0.0000533864,0.000003532361,0.000008119215,0.000035891255,0.000016042044,0.99689686,0.0008344482,0.001893792,0.0002031126,0.0000050522167],"about_ca_topic_score_codex":0.0029900572,"about_ca_topic_score_gemma":0.002487282,"teacher_disagreement_score":0.0029900572,"about_ca_system_score_codex":0.0008901716,"about_ca_system_score_gemma":0.0009684995,"threshold_uncertainty_score":0.00645864},"labels":[],"label_agreement":null},{"id":"W4296437225","doi":"10.1109/tifs.2022.3207911","title":"Differentially Private Set Intersection for Asymmetrical ID Alignment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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":"Queen's University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Intersection (aeronautics); Set (abstract data type); Artificial intelligence","score_opus":0.019417630802919653,"score_gpt":0.2465127371693638,"score_spread":0.22709510636644414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296437225","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.037663076,0.00031858298,0.9511546,0.0004871871,0.00012511156,0.0002792747,0.00029516817,0.0014281522,0.00824888],"genre_scores_gemma":[0.87900126,0.00020803642,0.113439426,0.00039409052,0.000087966015,0.00040241357,0.00049701723,0.000108188906,0.005861634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99301696,0.0015588243,0.0006478346,0.0015467961,0.0021744603,0.0010551317],"domain_scores_gemma":[0.99158466,0.001813294,0.00091137376,0.0044370806,0.00090093544,0.00035264858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033628773,0.0006792992,0.0014033822,0.0009966495,0.0020757825,0.0027234035,0.002802875,0.0016247784,0.0039434023],"category_scores_gemma":[0.009762759,0.00049669977,0.0009025249,0.0017486829,0.0022656529,0.00725483,0.010245367,0.002593946,0.0014656243],"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.0015968271,0.00034546436,0.0033164753,0.0003703838,0.00015169405,0.0006145766,0.001583799,0.06695644,0.041984834,0.65046185,0.008391239,0.22422636],"study_design_scores_gemma":[0.00014639195,0.00043634305,0.00076116057,0.00010145469,0.00012206987,0.0010542,0.0004834297,0.48529294,0.09138815,0.3887001,0.031343676,0.00017012749],"about_ca_topic_score_codex":0.0006145835,"about_ca_topic_score_gemma":0.00055178924,"teacher_disagreement_score":0.0039434023,"about_ca_system_score_codex":0.0022086096,"about_ca_system_score_gemma":0.0029457929,"threshold_uncertainty_score":0.017784834},"labels":[],"label_agreement":null},{"id":"W4312544130","doi":"10.1109/tifs.2022.3231785","title":"SetRkNN: Efficient and Privacy-Preserving Set Reverse kNN Query in Cloud","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"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; China Postdoctoral Science Foundation; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Homomorphic encryption; Information privacy; Outsourcing; Private information retrieval; Bloom filter; Set (abstract data type); Data mining; Computer security; Computer network","score_opus":0.010277479024432103,"score_gpt":0.21780201262614662,"score_spread":0.20752453360171452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312544130","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.10776809,0.001240644,0.87937695,0.00077237183,0.00016778598,0.0005794764,0.0014310658,0.0026512786,0.0060123587],"genre_scores_gemma":[0.6912748,0.00053418457,0.30048183,0.00040946886,0.000075401425,0.00024389055,0.0019248253,0.0001300811,0.0049255034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959699,0.0005953781,0.00036525488,0.00073820574,0.0018486253,0.00048278706],"domain_scores_gemma":[0.9969867,0.0005147244,0.00026783685,0.0016461303,0.00044034104,0.00014419106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019438158,0.00049959216,0.0015948731,0.00096604857,0.0017024899,0.001702755,0.0024148237,0.0011660969,0.0021576982],"category_scores_gemma":[0.0043092486,0.00033776427,0.00088816916,0.002701947,0.0011969187,0.006329467,0.00433245,0.0011529295,0.0007455755],"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.0032344195,0.0007013823,0.006563935,0.0007799356,0.00027427002,0.000980934,0.0017921778,0.17296568,0.0777338,0.15170725,0.026108874,0.5571574],"study_design_scores_gemma":[0.00022008333,0.00043909822,0.0017503179,0.000045200068,0.00007566382,0.0013608524,0.0007660612,0.84865564,0.04557907,0.081404075,0.01954338,0.00016060892],"about_ca_topic_score_codex":0.005688784,"about_ca_topic_score_gemma":0.005961826,"teacher_disagreement_score":0.005688784,"about_ca_system_score_codex":0.0019619574,"about_ca_system_score_gemma":0.002638672,"threshold_uncertainty_score":0.014235079},"labels":[],"label_agreement":null},{"id":"W4312903180","doi":"10.1109/tifs.2022.3212198","title":"The Impact of Side Information on Physical Layer Security Under Correlated Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"European Regional Development Fund; Consejería de Economía, Innovación, Ciencia y Empleo, Junta de Andalucía","keywords":"Fading; Transmitter; Physical layer; Computer science; Secrecy; Outage probability; Channel state information; Copula (linguistics); Fading distribution; Computer network; Telecommunications; Computer security; Wireless; Channel (broadcasting); Mathematics; Econometrics; Rayleigh fading","score_opus":0.011208790775914017,"score_gpt":0.2447430772286412,"score_spread":0.23353428645272717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312903180","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.39772642,0.002133311,0.585046,0.0007856917,0.00013697178,0.000084086234,0.00037271125,0.0004674354,0.013247382],"genre_scores_gemma":[0.9918578,0.0008689374,0.0065808916,0.000058391215,0.000040774055,0.000019729421,0.000040931376,0.000035670557,0.00049681833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964386,0.0013158991,0.00011972472,0.00039299973,0.0009617386,0.0007710413],"domain_scores_gemma":[0.9533962,0.036588077,0.0038712332,0.0029659788,0.002728845,0.00044967153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036877354,0.0020992234,0.0016316669,0.000828762,0.000863649,0.001964022,0.00086220924,0.0011496991,0.001858035],"category_scores_gemma":[0.02535267,0.0006960933,0.000652388,0.0007953872,0.0028526508,0.0036236905,0.0019490469,0.0018835587,0.00039704482],"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.00029143618,0.00006899729,0.0040061423,0.00023682391,0.00012999795,0.001024345,0.00013621224,0.9257635,0.017240793,0.038591173,0.0005426441,0.0119678555],"study_design_scores_gemma":[0.000012181611,0.00020087809,0.0014305862,0.000060831844,0.00009303194,0.00061571837,0.00008293653,0.9719002,0.014296118,0.010995775,0.00026604332,0.000045668174],"about_ca_topic_score_codex":0.0012808242,"about_ca_topic_score_gemma":0.0011885512,"teacher_disagreement_score":0.0036877354,"about_ca_system_score_codex":0.0012655068,"about_ca_system_score_gemma":0.0015416134,"threshold_uncertainty_score":0.019502878},"labels":[],"label_agreement":null},{"id":"W4313547868","doi":"10.1109/tifs.2022.3232955","title":"SGBoost: An Efficient and Privacy-Preserving Vertical Federated Tree Boosting Framework","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Boosting (machine learning); Raw data; Federated learning; Tree (set theory); Information privacy; Data mining; Machine learning; Artificial intelligence; Computer security","score_opus":0.017551152705072553,"score_gpt":0.24821392346664678,"score_spread":0.23066277076157424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313547868","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.009888051,0.00028032405,0.9874068,0.0001747019,0.000048792146,0.00006191833,0.0001116825,0.0011871591,0.00084062695],"genre_scores_gemma":[0.5478563,0.00038133343,0.44648004,0.00042365276,0.00013352137,0.00026238526,0.000846315,0.0003175822,0.0032988228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813735,0.00053996337,0.00006929624,0.00030721136,0.0006424867,0.00030365222],"domain_scores_gemma":[0.99890244,0.00031679843,0.00011076164,0.00029498013,0.0002691817,0.00010583433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00284273,0.0006992869,0.0019788654,0.0007438078,0.001027402,0.001172751,0.0030638187,0.0012391614,0.0017308013],"category_scores_gemma":[0.0038326455,0.0004523715,0.00095882517,0.0012743317,0.0009986778,0.002354702,0.0021782583,0.0017233596,0.0007807059],"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.0008826135,0.0003469281,0.0031493101,0.00024612373,0.00022939255,0.0002186316,0.0002597798,0.5441832,0.011872734,0.051955767,0.017958125,0.36869738],"study_design_scores_gemma":[0.00003559104,0.000050134295,0.00016409362,0.000008220236,0.000014971725,0.00006550966,0.000018254199,0.9743224,0.0017700635,0.020897985,0.0026396192,0.000013203534],"about_ca_topic_score_codex":0.004227348,"about_ca_topic_score_gemma":0.0039083078,"teacher_disagreement_score":0.004227348,"about_ca_system_score_codex":0.0009835009,"about_ca_system_score_gemma":0.002945538,"threshold_uncertainty_score":0.01503396},"labels":[],"label_agreement":null},{"id":"W4317796724","doi":"10.1109/tifs.2023.3235152","title":"Incentivizing Secure Edge Caching for Scalable Coded Videos in Heterogeneous Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Caching and Content Delivery","field":"Computer Science","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":"Queen's University","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Scalability; Computer network; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence; Database","score_opus":0.013180621257575055,"score_gpt":0.22270010562418044,"score_spread":0.2095194843666054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317796724","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.10814549,0.00045890667,0.8829229,0.00085723033,0.00007503837,0.00011390771,0.000080026,0.00020517882,0.007141383],"genre_scores_gemma":[0.9715631,0.00020890012,0.0267977,0.00009500619,0.00002314192,0.000044698943,0.000030772862,0.000015538291,0.0012211251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880826,0.00055079284,0.000042940464,0.00015369493,0.00024329679,0.00020099043],"domain_scores_gemma":[0.9977919,0.0013266248,0.000264603,0.00029834444,0.00020651314,0.000111997455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394541,0.0005937251,0.00065612077,0.00032561272,0.0006178739,0.001154252,0.0010414087,0.0012334096,0.0010705716],"category_scores_gemma":[0.0050600586,0.00026914306,0.0003879248,0.0005352793,0.0009786283,0.0019165046,0.001736197,0.001092575,0.00016860645],"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.00039158732,0.0001378091,0.0019446815,0.00018355587,0.00006857477,0.00096873887,0.00022730068,0.6888088,0.021871433,0.23861279,0.003421003,0.043363787],"study_design_scores_gemma":[0.000015642292,0.00002926127,0.00010953535,0.000008327262,0.000009739429,0.00009027395,0.000030702562,0.97927654,0.0015909367,0.018136539,0.0006925013,0.000010049281],"about_ca_topic_score_codex":0.0020181108,"about_ca_topic_score_gemma":0.0029367958,"teacher_disagreement_score":0.0020181108,"about_ca_system_score_codex":0.0012918629,"about_ca_system_score_gemma":0.0014329698,"threshold_uncertainty_score":0.009373128},"labels":[],"label_agreement":null},{"id":"W4360993846","doi":"10.1109/tifs.2023.3262147","title":"PGSim: Efficient and Privacy-Preserving Graph Similarity Query Over Encrypted Data in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"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 Basic Research Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Theoretical computer science; Encryption; Graph database; Data mining; Graph; Computer security","score_opus":0.019783120723265313,"score_gpt":0.2517840148312841,"score_spread":0.23200089410801877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360993846","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.12414901,0.00042565164,0.8655102,0.0010017507,0.00008918209,0.00039482577,0.00086944044,0.0032304635,0.004329437],"genre_scores_gemma":[0.876715,0.00021974748,0.119642705,0.0002431353,0.000039983966,0.00010252474,0.0007228685,0.000075334174,0.0022386864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974921,0.00050656375,0.00019976385,0.00040655752,0.0010643065,0.00033084143],"domain_scores_gemma":[0.9966575,0.00072979165,0.00032481027,0.0017586562,0.00038090235,0.00014831242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017495089,0.0003952565,0.0008397948,0.0007930294,0.0010397543,0.0014359567,0.0015602814,0.0010688672,0.0015346169],"category_scores_gemma":[0.0043362756,0.00024240935,0.0007062195,0.0015691067,0.0010984527,0.0049899085,0.0033160914,0.001045481,0.0005421798],"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.0025058761,0.0005924833,0.006887135,0.0004397113,0.00022247383,0.0016096644,0.0013568073,0.15482287,0.097287685,0.2780177,0.02241795,0.43383965],"study_design_scores_gemma":[0.00017419497,0.0003404511,0.0014890011,0.000025701795,0.000047952384,0.0012174217,0.00042050285,0.81203425,0.06895089,0.10462731,0.010593109,0.000079250494],"about_ca_topic_score_codex":0.0022442609,"about_ca_topic_score_gemma":0.001595101,"teacher_disagreement_score":0.0022442609,"about_ca_system_score_codex":0.0013800366,"about_ca_system_score_gemma":0.002074321,"threshold_uncertainty_score":0.010012925},"labels":[],"label_agreement":null},{"id":"W4377235660","doi":"10.1109/tifs.2023.3277688","title":"PLCPrint: Fingerprinting Memory Attacks in Programmable Logic Controllers","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":13,"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":"Defence Science and Technology Laboratory; Defence and Security Accelerator; Engineering and Physical Sciences Research Council; New Brunswick Innovation Foundation","keywords":"Computer science; Exploit; Context (archaeology); Embedded system; Programmable logic controller; Memory management; Memory address; Computer hardware; Computer security; Semiconductor memory; Operating system","score_opus":0.01171028407935982,"score_gpt":0.22178775666151265,"score_spread":0.21007747258215284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377235660","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.35827726,0.000714614,0.62559,0.00026237412,0.000111297144,0.00015002627,0.00037090632,0.009624776,0.004898698],"genre_scores_gemma":[0.9237486,0.00013912182,0.07402861,0.000084460386,0.000019030766,0.00004193428,0.00019714808,0.0000910484,0.0016499957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992914,0.00011983903,0.000038034585,0.00014001492,0.00033261138,0.00007807271],"domain_scores_gemma":[0.9986625,0.00037090544,0.00031155758,0.00042181768,0.00018014896,0.00005316039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129593,0.0004669137,0.0003094781,0.0009934399,0.00029571203,0.0006766617,0.0006664495,0.00072550337,0.0013134605],"category_scores_gemma":[0.003325006,0.00014002515,0.00020093251,0.0005492239,0.0005120258,0.0012357138,0.0009378948,0.0005446941,0.00049911975],"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.00091403327,0.00024437305,0.015711464,0.00021838004,0.00008141143,0.0006916818,0.00036387873,0.109665185,0.13714646,0.006742044,0.0042272992,0.72399384],"study_design_scores_gemma":[0.00005571763,0.0006930274,0.008550197,0.000043575066,0.000039441915,0.0014932364,0.0001886133,0.7715456,0.20317966,0.006366428,0.0077856323,0.00005889255],"about_ca_topic_score_codex":0.000725127,"about_ca_topic_score_gemma":0.0009515923,"teacher_disagreement_score":0.0013134605,"about_ca_system_score_codex":0.00033534886,"about_ca_system_score_gemma":0.00043047624,"threshold_uncertainty_score":0.004393935},"labels":[],"label_agreement":null},{"id":"W4379033843","doi":"10.1109/tifs.2023.3282133","title":"Efficient and Privacy-Preserving Arbitrary Polygon Range Query Scheme Over Dynamic and Time-Series Location Data","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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":"University of New Brunswick","funders":"Natural Science Basic Research Program of Shaanxi Province; Higher Education Discipline Innovation Project; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Range query (database); Polygon (computer graphics); Homomorphic encryption; Location-based service; Encryption; Query optimization; Query expansion; Web query classification; Data mining; Ciphertext; Web search query; Theoretical computer science; Information retrieval; Database; Computer security; Computer network; Search engine","score_opus":0.016764517960406292,"score_gpt":0.2501808607666379,"score_spread":0.23341634280623164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379033843","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.102938555,0.0011627545,0.8835751,0.0009615462,0.00016027407,0.0005224113,0.0016932351,0.0023634206,0.0066227815],"genre_scores_gemma":[0.8839072,0.0007715624,0.10835156,0.00034311254,0.000108299384,0.0003714342,0.0025039804,0.00009263592,0.0035501872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994269,0.00081752904,0.000605293,0.0010257658,0.0024854778,0.0007968975],"domain_scores_gemma":[0.9952461,0.0010075439,0.0004762499,0.0022462967,0.0008127784,0.00021095655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019400553,0.0005953461,0.0015962997,0.0010356348,0.0014046805,0.0017792475,0.0024867675,0.0012489561,0.0016747835],"category_scores_gemma":[0.006352494,0.0003314091,0.0012508484,0.0028070682,0.00093948765,0.006746277,0.004882511,0.0014400842,0.0007367332],"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.0029409262,0.0005980084,0.012029266,0.0010568723,0.0004499619,0.0026544286,0.0029124876,0.19542287,0.14071782,0.21050146,0.029197112,0.4015188],"study_design_scores_gemma":[0.00030768686,0.0005750552,0.00257655,0.00004238636,0.00015642021,0.0027634331,0.000790102,0.86778146,0.052329917,0.04729802,0.025177881,0.00020109226],"about_ca_topic_score_codex":0.0030830356,"about_ca_topic_score_gemma":0.0014801451,"teacher_disagreement_score":0.0030830356,"about_ca_system_score_codex":0.0012857879,"about_ca_system_score_gemma":0.0020766568,"threshold_uncertainty_score":0.010260105},"labels":[],"label_agreement":null},{"id":"W4383503594","doi":"10.1109/tifs.2023.3293416","title":"Efficient and Privacy-Preserving Aggregated Reverse kNN Query Over Crowd-Sensed Data","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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 New Brunswick","funders":"Natural Science Basic Research Program of Shaanxi Province; Higher Education Discipline Innovation Project; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Scheme (mathematics); Information privacy; Random oracle; Oracle; Private information retrieval; Query optimization; Web query classification; Privacy software; Data mining; Web search query; Information retrieval; Encryption; Computer security; Public-key cryptography; Search engine","score_opus":0.028232991543894453,"score_gpt":0.26343712403882247,"score_spread":0.23520413249492803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383503594","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.07106642,0.00079403236,0.9220258,0.0007024825,0.00011816912,0.0003260923,0.0007578132,0.0012874645,0.0029217894],"genre_scores_gemma":[0.85493684,0.0003496039,0.14035356,0.00039043895,0.000087473025,0.00024009967,0.000831308,0.000069609734,0.0027410686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99289715,0.00157249,0.0006178357,0.0014986442,0.0026742863,0.0007395213],"domain_scores_gemma":[0.99165124,0.0030361903,0.0008904214,0.0028531863,0.0012605421,0.000308454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518202,0.0008266952,0.0018984518,0.00091760105,0.0017131381,0.001881806,0.0023438605,0.001743446,0.0013154723],"category_scores_gemma":[0.013120494,0.0004167844,0.00091634126,0.0017630275,0.0015306758,0.0051129046,0.005394951,0.0014638717,0.0005656538],"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.0033209869,0.0004435875,0.013196207,0.0009994141,0.00032818512,0.0017075056,0.003256023,0.36098668,0.08725785,0.09801134,0.013871014,0.4166212],"study_design_scores_gemma":[0.000103577935,0.00025989796,0.0014351184,0.00003738455,0.000060811282,0.0008111853,0.0008824286,0.9164499,0.023160614,0.050548617,0.0061354702,0.000114977156],"about_ca_topic_score_codex":0.0031881763,"about_ca_topic_score_gemma":0.0030151731,"teacher_disagreement_score":0.003518202,"about_ca_system_score_codex":0.0013627295,"about_ca_system_score_gemma":0.0022972133,"threshold_uncertainty_score":0.018606305},"labels":[],"label_agreement":null},{"id":"W4386108495","doi":"10.1109/tifs.2023.3305916","title":"A Smart Digital Twin Enabled Security Framework for Vehicle-to-Grid Cyber-Physical Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Science Foundation","keywords":"Computer science; Cyber-physical system; Smart grid; Distributed computing; Reinforcement learning; Electric power system; Embedded system; Grid; Industrial control system; Computer security; Real-time computing; Control (management); Artificial intelligence; Operating system; Engineering; Power (physics)","score_opus":0.008210083045696667,"score_gpt":0.21926560237596582,"score_spread":0.21105551933026914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386108495","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.007436606,0.00031857865,0.98759997,0.00022956077,0.000057634865,0.0000410026,0.00008708242,0.0014856661,0.002743852],"genre_scores_gemma":[0.7147036,0.00060730736,0.27864885,0.00020409543,0.000054148124,0.00016432953,0.00038857566,0.00019283693,0.0050362432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.000063409934,0.000017113769,0.00006485017,0.00009285585,0.000037498623],"domain_scores_gemma":[0.99979955,0.00005893463,0.000026700944,0.000034371384,0.000051859013,0.000028643828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124218,0.0006236789,0.00044377672,0.000407001,0.00031640552,0.00091903424,0.0010003509,0.0007389819,0.0023661868],"category_scores_gemma":[0.001044189,0.00022196639,0.00048859965,0.00022736787,0.00074950967,0.0014142515,0.001517059,0.0010255998,0.00043431117],"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.00007778677,0.00003720736,0.00065870467,0.00008213155,0.000029328954,0.00020543279,0.000078842226,0.87778735,0.004426165,0.042762414,0.002217428,0.07163721],"study_design_scores_gemma":[0.0000030243848,0.000016347502,0.00004808126,0.000004220131,0.0000032666455,0.00001933244,0.000005444448,0.993327,0.0005567918,0.0046045366,0.0014085751,0.0000033467343],"about_ca_topic_score_codex":0.0052892757,"about_ca_topic_score_gemma":0.0056343996,"teacher_disagreement_score":0.0052892757,"about_ca_system_score_codex":0.0007490844,"about_ca_system_score_gemma":0.0011550174,"threshold_uncertainty_score":0.010517001},"labels":[],"label_agreement":null},{"id":"W4387665628","doi":"10.1109/tifs.2023.3324772","title":"Gradient-Leaks: Enabling Black-Box Membership Inference Attacks Against Machine Learning Models","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Inference; Black box; Construct (python library); Artificial intelligence; Autoencoder; Machine learning; A priori and a posteriori; Key (lock); Data mining; Data modeling; Deep learning; Computer security; Database","score_opus":0.042437543553757576,"score_gpt":0.26156342862842813,"score_spread":0.21912588507467057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387665628","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.07272583,0.00048130835,0.91800123,0.0011355303,0.00010546959,0.000106178355,0.0002008804,0.0050847013,0.0021588649],"genre_scores_gemma":[0.9277846,0.00016893995,0.0697095,0.00047304892,0.00006677777,0.00007108402,0.00016620074,0.0002631661,0.0012966875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410456,0.0021337548,0.00035035665,0.00080773263,0.0020982453,0.00050536735],"domain_scores_gemma":[0.9864746,0.005715293,0.0011303995,0.0057391915,0.0006591839,0.00028150185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004444059,0.0008750524,0.0011096346,0.0007184161,0.0007895785,0.0019015924,0.0018320201,0.0021451805,0.0016490638],"category_scores_gemma":[0.028642304,0.0005741075,0.0008892743,0.00066811184,0.0026732436,0.0064186896,0.0068660015,0.0037348755,0.0006529229],"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.0016557426,0.00041746115,0.010721479,0.00040694803,0.0003785793,0.0010660661,0.0016019122,0.37539384,0.044276915,0.24320911,0.012553672,0.30831832],"study_design_scores_gemma":[0.000032115157,0.00010520939,0.00045887663,0.000032512224,0.000021095002,0.00025729847,0.00006296639,0.8891024,0.020937003,0.08646359,0.0024892022,0.000037808324],"about_ca_topic_score_codex":0.0007983426,"about_ca_topic_score_gemma":0.0006202242,"teacher_disagreement_score":0.004444059,"about_ca_system_score_codex":0.00083965674,"about_ca_system_score_gemma":0.0011236035,"threshold_uncertainty_score":0.023502707},"labels":[],"label_agreement":null},{"id":"W4388262486","doi":"10.1109/tifs.2023.3327662","title":"WFDefProxy: Real World Implementation and Evaluation of Website Fingerprinting Defenses","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Internet Traffic Analysis and Secure E-voting","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":"Simon Fraser University","funders":"Innovation and Technology Commission","keywords":"Computer science; Computer security; World Wide Web; Internet privacy","score_opus":0.021888224082215243,"score_gpt":0.2890661372611371,"score_spread":0.26717791317892187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388262486","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.94000125,0.000547462,0.028517887,0.0006396245,0.00025483203,0.00035299914,0.0020302802,0.020892665,0.0067630108],"genre_scores_gemma":[0.9730646,0.00017027983,0.02244392,0.00017697303,0.00001761383,0.00012733998,0.0025873708,0.00047865906,0.0009331597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964588,0.0011899924,0.00024053447,0.00053488,0.001046682,0.000529113],"domain_scores_gemma":[0.99255306,0.0027313305,0.00052917626,0.0027700714,0.001073379,0.0003429857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457721,0.0009409075,0.00055889314,0.0015254463,0.0007717086,0.0012465452,0.0022916126,0.0013917701,0.0011055418],"category_scores_gemma":[0.013169589,0.0004108554,0.00042322624,0.0010460354,0.0014006271,0.0029351457,0.0013807504,0.0016927554,0.0005052003],"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.00523643,0.0033835191,0.0640301,0.0012082922,0.00047028245,0.001368763,0.0015000479,0.55262655,0.056226913,0.025541155,0.07416647,0.21424149],"study_design_scores_gemma":[0.0003523914,0.0018525206,0.014948843,0.00008598306,0.00009213812,0.0006322788,0.00054841,0.8935004,0.068971,0.0033594107,0.015528913,0.0001277189],"about_ca_topic_score_codex":0.005063997,"about_ca_topic_score_gemma":0.003990235,"teacher_disagreement_score":0.005063997,"about_ca_system_score_codex":0.0018415686,"about_ca_system_score_gemma":0.0010757282,"threshold_uncertainty_score":0.023575008},"labels":[],"label_agreement":null},{"id":"W4389332325","doi":"10.1109/tifs.2023.3340094","title":"Classification Utility, Fairness, and Compactness via Tunable Information Bottleneck and Rényi Measures","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Information bottleneck method; Compact space; Computer science; Categorical variable; Bottleneck; Representation (politics); Key (lock); Artificial intelligence; Mutual information; Machine learning; Data mining; Mathematics","score_opus":0.03020638483047152,"score_gpt":0.25098607887466207,"score_spread":0.22077969404419054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389332325","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.044778556,0.00043150267,0.9514818,0.0006639499,0.000032709366,0.000058561305,0.000049156268,0.00016975895,0.0023340844],"genre_scores_gemma":[0.8086234,0.0005384989,0.1860705,0.00040179162,0.00017614452,0.00032105553,0.00015076659,0.00019299547,0.0035248648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923179,0.004012403,0.00035714102,0.001057065,0.0017364679,0.0005190971],"domain_scores_gemma":[0.95498717,0.03408396,0.0032479684,0.0044083386,0.0021228592,0.0011497304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01889143,0.0013172558,0.0019470998,0.0020541032,0.0014585534,0.003973074,0.0029104343,0.0021474417,0.0019070467],"category_scores_gemma":[0.07313343,0.00075502525,0.0010011061,0.0015217396,0.0061933924,0.009360528,0.0060367603,0.0035522678,0.00035963548],"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.0004228884,0.00014222482,0.0035167946,0.00018911168,0.00010388227,0.00018003653,0.00048350674,0.39518118,0.004243976,0.5300928,0.0012416177,0.064202026],"study_design_scores_gemma":[0.000020447074,0.000081267055,0.0004963847,0.000031149237,0.000019005516,0.00006742946,0.000038149123,0.77072185,0.0027886366,0.2250745,0.000629987,0.00003120954],"about_ca_topic_score_codex":0.0015808376,"about_ca_topic_score_gemma":0.0012762783,"teacher_disagreement_score":0.01889143,"about_ca_system_score_codex":0.0038022792,"about_ca_system_score_gemma":0.002228293,"threshold_uncertainty_score":0.09990859},"labels":[],"label_agreement":null},{"id":"W4390603833","doi":"10.1109/tifs.2024.3350389","title":"Manipulating Pre-Trained Encoder for Targeted Poisoning Attacks in Contrastive Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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":"Simon Fraser University","funders":"Wuhan Yellow Crane Talents Program; National Natural Science Foundation of China","keywords":"Computer science; Encoder; Classifier (UML); Artificial intelligence; Downstream (manufacturing); Feature learning; Machine learning; Pattern recognition (psychology); Autoencoder; Deep learning; Data mining","score_opus":0.008793565095512209,"score_gpt":0.2516754333139183,"score_spread":0.24288186821840607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390603833","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.07876066,0.000373372,0.91764855,0.00042143042,0.000051969753,0.00009376358,0.000054998734,0.0012289456,0.0013663418],"genre_scores_gemma":[0.85605675,0.00021085788,0.14087678,0.00042459977,0.000049693717,0.00014532295,0.00017050846,0.000114533694,0.0019509547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874324,0.00040949945,0.00006946055,0.00030107386,0.00035065116,0.00012612755],"domain_scores_gemma":[0.99596393,0.002268717,0.00042753652,0.0007449897,0.00047063475,0.00012414939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026994324,0.0013078892,0.00093202485,0.0004894443,0.00043261852,0.0008646729,0.0014283207,0.0012967971,0.0010683286],"category_scores_gemma":[0.011606707,0.0004635557,0.0005304855,0.00030067938,0.0018836717,0.0025287108,0.0021315932,0.0026786495,0.0004791442],"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.0007134128,0.00052470237,0.009748218,0.0002305022,0.0001497451,0.0004870877,0.00037073722,0.560879,0.05134977,0.03393989,0.0034047004,0.33820224],"study_design_scores_gemma":[0.000014583558,0.00013660059,0.00028569688,0.000010288781,0.000014109308,0.00008461129,0.000013067158,0.98222566,0.011406757,0.0052985046,0.00049962936,0.000010422518],"about_ca_topic_score_codex":0.0012684284,"about_ca_topic_score_gemma":0.0013600269,"teacher_disagreement_score":0.0026994324,"about_ca_system_score_codex":0.0009857988,"about_ca_system_score_gemma":0.001042316,"threshold_uncertainty_score":0.014276147},"labels":[],"label_agreement":null},{"id":"W4392405447","doi":"10.1109/tifs.2024.3372809","title":"(Security) Assertions by Large Language Models","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Topic Modeling","field":"Computer Science","cited_by":70,"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":"Office of Naval Research; Intel Corporation","keywords":"Computer science; Programming language; Natural language processing","score_opus":0.00911134536940814,"score_gpt":0.23101535780912044,"score_spread":0.2219040124397123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392405447","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.012220568,0.00023199653,0.9772988,0.00074789085,0.00006130342,0.00031444227,0.0011561966,0.004717401,0.0032515025],"genre_scores_gemma":[0.20949616,0.00047337014,0.7809645,0.00039107585,0.00011358565,0.00095038913,0.0030853704,0.001325519,0.0032000442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9883795,0.0055551897,0.00082618615,0.0011871081,0.003664903,0.00038706523],"domain_scores_gemma":[0.9561854,0.030739216,0.0025768701,0.006948658,0.0032238662,0.00032597515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008669131,0.0016052054,0.0005853594,0.0020185893,0.00078298163,0.003795202,0.0024789835,0.0014591904,0.005678999],"category_scores_gemma":[0.04247289,0.0011674984,0.0027657314,0.0012187323,0.002132152,0.0067197545,0.0033637388,0.00264258,0.0015658857],"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.0003601798,0.00030502863,0.0040933415,0.0007879883,0.00014755779,0.0006493682,0.001977353,0.31011432,0.009341063,0.5622144,0.013317616,0.09669181],"study_design_scores_gemma":[0.0000947432,0.000111162546,0.00028259293,0.00020119897,0.00006883314,0.0002285698,0.00020240062,0.7328943,0.008105324,0.2279138,0.02985405,0.000043006297],"about_ca_topic_score_codex":0.004542458,"about_ca_topic_score_gemma":0.008139155,"teacher_disagreement_score":0.008669131,"about_ca_system_score_codex":0.001786074,"about_ca_system_score_gemma":0.0026416967,"threshold_uncertainty_score":0.045847356},"labels":[],"label_agreement":null},{"id":"W4392904898","doi":"10.1109/tifs.2024.3378006","title":"Efficiently Achieving Privacy Preservation and Poisoning Attack Resistance in Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Computer science; Computer security; Information privacy; Resistance (ecology); Internet privacy; Privacy protection","score_opus":0.018164686551748948,"score_gpt":0.2566793680673577,"score_spread":0.23851468151560876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392904898","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.060803734,0.00024987172,0.93598133,0.00030430983,0.000030992214,0.00009536747,0.000099736964,0.0014637886,0.0009707792],"genre_scores_gemma":[0.911158,0.000113330345,0.08710295,0.00013955713,0.000025410902,0.00009127824,0.00016079986,0.000041994856,0.001166696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99397236,0.0017210149,0.0005048992,0.0013775947,0.0017399952,0.00068413705],"domain_scores_gemma":[0.98992187,0.0028632835,0.000924173,0.004948089,0.0009882037,0.00035441938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046985997,0.0008574055,0.0019560514,0.0010350286,0.001439171,0.0020674327,0.0030363898,0.0021222723,0.0008770157],"category_scores_gemma":[0.014490514,0.00047605665,0.0011392909,0.0016960276,0.0019220583,0.0060192607,0.0052361186,0.002179966,0.00036826948],"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.001666877,0.00054233393,0.0071420907,0.0002633729,0.0002937479,0.0007312458,0.0008133167,0.47852117,0.019667866,0.08557532,0.004016764,0.40076593],"study_design_scores_gemma":[0.000049877654,0.00012932667,0.00039449742,0.000014951087,0.00003683153,0.0003307143,0.00008526452,0.9343024,0.014451903,0.04912955,0.0010420291,0.00003255751],"about_ca_topic_score_codex":0.0010894518,"about_ca_topic_score_gemma":0.0007445031,"teacher_disagreement_score":0.0046985997,"about_ca_system_score_codex":0.0015845629,"about_ca_system_score_gemma":0.0023200181,"threshold_uncertainty_score":0.024848878},"labels":[],"label_agreement":null},{"id":"W4394585962","doi":"10.1109/tifs.2024.3386350","title":"Dynamic Group Time-Based One-Time Passwords","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"User Authentication and Security Systems","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 New Brunswick","funders":"Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Computer science; Cryptography; Revocation; Password; Merkle tree; Cryptographic nonce; Cryptographic primitive; Computer security; Hash function; Anonymity; Group (periodic table); Encryption; Cryptographic protocol; Cryptographic hash function","score_opus":0.00634998364424822,"score_gpt":0.2108544576823584,"score_spread":0.20450447403811017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394585962","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.051978152,0.00034385582,0.9299479,0.00042316737,0.00025203542,0.0003426365,0.0003671211,0.0019753466,0.014369816],"genre_scores_gemma":[0.8358503,0.0004079784,0.14783967,0.00028822105,0.00015506467,0.00043399472,0.00066714024,0.00021368415,0.014143962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752134,0.0005071878,0.00029988072,0.00046391517,0.000754105,0.00045347487],"domain_scores_gemma":[0.9951493,0.00054263935,0.0005037798,0.0029410003,0.00047004086,0.00039317046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013922289,0.0005810449,0.00071974314,0.0005745879,0.0010019052,0.0017581452,0.0016718458,0.00132084,0.0063602338],"category_scores_gemma":[0.004734326,0.000368286,0.0006968593,0.0008410624,0.001546714,0.0065198303,0.004377211,0.0021317343,0.0029486457],"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.0011311608,0.00019767409,0.0021962028,0.00042538138,0.00004765763,0.0008708445,0.0015407013,0.012755626,0.0640461,0.7551188,0.0070662973,0.15460351],"study_design_scores_gemma":[0.00030627503,0.0012264386,0.0014740033,0.00028654156,0.00012796723,0.004477439,0.0008855401,0.18416995,0.14510737,0.4411297,0.22052692,0.00028183777],"about_ca_topic_score_codex":0.0002332457,"about_ca_topic_score_gemma":0.00019177623,"teacher_disagreement_score":0.0063602338,"about_ca_system_score_codex":0.0007017453,"about_ca_system_score_gemma":0.0010005701,"threshold_uncertainty_score":0.02127707},"labels":[],"label_agreement":null},{"id":"W4394938944","doi":"10.1109/tifs.2024.3390990","title":"On the Impact of Voice Anonymization on Speech Diagnostic Applications: A Case Study on COVID-19 Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de la recherche scientifique","keywords":"Computer science; Speech recognition; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Medicine","score_opus":0.021931389801271156,"score_gpt":0.28886692742062026,"score_spread":0.2669355376193491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394938944","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.81162196,0.006858955,0.15962529,0.0060113287,0.0013188724,0.0008050254,0.0018948958,0.0043581296,0.0075055053],"genre_scores_gemma":[0.9504455,0.0010648385,0.04323019,0.0011464707,0.00023946888,0.00012875661,0.0019157876,0.00021067214,0.0016183192],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9858568,0.0071209017,0.0010579936,0.0018839255,0.003404009,0.00067641074],"domain_scores_gemma":[0.9651559,0.025011767,0.0019267913,0.0047076214,0.0026749354,0.0005229661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008816604,0.0010667075,0.00085150555,0.0013145937,0.0014658651,0.0019603597,0.0014047794,0.002499821,0.0007859995],"category_scores_gemma":[0.04105953,0.00025641095,0.0005080161,0.0009283645,0.0018646572,0.0023554796,0.0026154872,0.0018209751,0.0008431214],"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.005224491,0.0013302405,0.1087086,0.002641526,0.0008077605,0.013773278,0.0055883704,0.11419209,0.073798515,0.015359335,0.04344323,0.6151326],"study_design_scores_gemma":[0.00039849532,0.0028368293,0.060148954,0.0010042026,0.00065064454,0.03403681,0.0061194464,0.48515156,0.29777926,0.026900096,0.08453027,0.00044336813],"about_ca_topic_score_codex":0.0021412107,"about_ca_topic_score_gemma":0.0021784946,"teacher_disagreement_score":0.008816604,"about_ca_system_score_codex":0.0010281933,"about_ca_system_score_gemma":0.00086618774,"threshold_uncertainty_score":0.046627223},"labels":[],"label_agreement":null},{"id":"W4396535419","doi":"10.1109/tifs.2024.3394678","title":"Revocable and Privacy-Preserving Bilateral Access Control for Cloud Data Sharing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","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":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer security; Access control; Information privacy; Internet privacy; Data sharing; Operating system","score_opus":0.03604402686750368,"score_gpt":0.28956397093915315,"score_spread":0.25351994407164946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396535419","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.02618914,0.00032061985,0.96994656,0.00023425976,0.000056996934,0.00012890673,0.000067542256,0.00041145875,0.0026445857],"genre_scores_gemma":[0.9217819,0.00023428156,0.074708916,0.00017788372,0.0000636656,0.00014706224,0.00009851894,0.000040261442,0.0027475695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993775,0.0017477482,0.00044421628,0.0013144747,0.0019887679,0.00072979444],"domain_scores_gemma":[0.9960828,0.00092597737,0.0006656195,0.0014905693,0.00061551644,0.00021944758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031990223,0.0005602783,0.001055488,0.0005272314,0.0011419337,0.0018158944,0.002401652,0.0011384918,0.0019398088],"category_scores_gemma":[0.00590427,0.00031351094,0.0010216613,0.0007684174,0.0015067109,0.0049720774,0.0033165766,0.0017630275,0.00047859552],"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.0014817914,0.00033138096,0.0024769113,0.0004788103,0.00025828835,0.00074958126,0.0014548129,0.16085999,0.06925638,0.5010208,0.0038863963,0.25774488],"study_design_scores_gemma":[0.00015885015,0.00028460973,0.00044714415,0.000035083645,0.00007298961,0.00073146506,0.00019613712,0.83818805,0.02108369,0.12619664,0.012478701,0.00012662345],"about_ca_topic_score_codex":0.0014566365,"about_ca_topic_score_gemma":0.0008510525,"teacher_disagreement_score":0.0031990223,"about_ca_system_score_codex":0.0011068275,"about_ca_system_score_gemma":0.0015409323,"threshold_uncertainty_score":0.016918242},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4396575008","doi":"10.1109/tifs.2024.3396384","title":"Performance Enhanced Secure Spatial Keyword Similarity Query With Arbitrary Spatial Ranges","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","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":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Range query (database); Encryption; Overhead (engineering); Spatial query; Scheme (mathematics); Data mining; Similarity (geometry); Web search query; Theoretical computer science; Information retrieval; Web query classification; Computer security; Search engine; Image (mathematics); Artificial intelligence","score_opus":0.005573976300173532,"score_gpt":0.19731588815720846,"score_spread":0.19174191185703493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396575008","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.51086086,0.0026689789,0.46962813,0.00110024,0.00019814335,0.00041951725,0.00039921296,0.0034758598,0.011248996],"genre_scores_gemma":[0.9712676,0.000258535,0.027070025,0.00008194444,0.000032733242,0.00004610808,0.00015326943,0.00002592615,0.0010638138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634284,0.00061046425,0.00035517494,0.0003774572,0.0016633393,0.00065080513],"domain_scores_gemma":[0.99547064,0.0015415538,0.00048522456,0.0015357533,0.000735579,0.00023124156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020704258,0.00046379794,0.0014023139,0.00069206604,0.00093998056,0.0013631599,0.0011767396,0.00092690263,0.0024810007],"category_scores_gemma":[0.005689763,0.00022907386,0.0005076791,0.0012143534,0.00088647194,0.0049662967,0.0031731925,0.0009291295,0.0005951861],"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.008751301,0.0011178473,0.012714212,0.00093833485,0.00034165158,0.0017503833,0.0013933064,0.25366476,0.2728851,0.09840681,0.011013387,0.33702287],"study_design_scores_gemma":[0.00027636637,0.00071427156,0.0011350104,0.0000184854,0.00007188713,0.0015425714,0.0002883776,0.9145673,0.0657971,0.011601481,0.0038973142,0.00008977986],"about_ca_topic_score_codex":0.0021017713,"about_ca_topic_score_gemma":0.001100068,"teacher_disagreement_score":0.0024810007,"about_ca_system_score_codex":0.0011684769,"about_ca_system_score_gemma":0.0018233523,"threshold_uncertainty_score":0.010949612},"labels":[],"label_agreement":null},{"id":"W4399573658","doi":"10.1109/tifs.2024.3413630","title":"Secure Similarity Queries Over Vertically Distributed Data via TEE-Enhanced Cloud Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"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; Similarity (geometry); Distributed database; Distributed computing; Information retrieval; Artificial intelligence; Operating system","score_opus":0.012001385470473276,"score_gpt":0.24599303702627817,"score_spread":0.2339916515558049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399573658","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.074272655,0.00024896633,0.9207111,0.00052318483,0.000047728783,0.00020446374,0.000112487505,0.0006745776,0.0032048025],"genre_scores_gemma":[0.89388174,0.00013886362,0.10431631,0.00011868361,0.000038538903,0.000087858425,0.00012478129,0.000037122,0.001256112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954184,0.0010440886,0.000296626,0.00052092655,0.0021281985,0.00059171196],"domain_scores_gemma":[0.99421084,0.0013957267,0.0007217908,0.0026224968,0.0008119353,0.00023717637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023849811,0.0004109874,0.00087148027,0.00064774044,0.0011083574,0.0017909092,0.0013690783,0.0008349753,0.0012751968],"category_scores_gemma":[0.0075741936,0.00028617174,0.0006190107,0.0013601319,0.0016049966,0.004363743,0.0046409625,0.0014506909,0.00045919121],"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.0016351312,0.0004841874,0.0045250347,0.00024906412,0.00011598615,0.0008662163,0.001082756,0.34371153,0.09969799,0.33396432,0.005406551,0.20826118],"study_design_scores_gemma":[0.00007559083,0.0001825552,0.00038324326,0.000011982835,0.000016191543,0.000353006,0.00015547477,0.9239688,0.026582973,0.04446464,0.0037717442,0.00003383857],"about_ca_topic_score_codex":0.0013988301,"about_ca_topic_score_gemma":0.0009897895,"teacher_disagreement_score":0.0023849811,"about_ca_system_score_codex":0.0012667002,"about_ca_system_score_gemma":0.0019724418,"threshold_uncertainty_score":0.012613118},"labels":[],"label_agreement":null},{"id":"W4400075135","doi":"10.1109/tifs.2024.3420075","title":"A Feasibility Area Approach for Early Stage Detection of Stealthy Infiltrated Cyberattacks in Power Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Stage (stratigraphy); Computer security; Power (physics); Computer network; Geology","score_opus":0.012961524949351632,"score_gpt":0.2249406619072696,"score_spread":0.21197913695791798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400075135","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.03048528,0.00019414072,0.96742994,0.00011739753,0.000024576855,0.00011787398,0.000055894827,0.00035455785,0.0012203071],"genre_scores_gemma":[0.7074414,0.0002326871,0.2901234,0.000052812564,0.000044511507,0.00021589869,0.0001704752,0.000029382709,0.0016894728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.00016868873,0.00005538499,0.0001551087,0.00021899986,0.00006635376],"domain_scores_gemma":[0.99811816,0.00092873,0.000346228,0.00009563536,0.0004491036,0.00006217026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011066034,0.0008118562,0.00067071634,0.0024731054,0.0004839556,0.000976703,0.00074256834,0.0007774719,0.002075639],"category_scores_gemma":[0.004326939,0.00035636048,0.0006346893,0.0010378027,0.00051281607,0.0014539473,0.0008054613,0.000774936,0.00035455328],"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.0004211754,0.0002612909,0.020036263,0.00031794203,0.000114066184,0.0005191511,0.0003508721,0.3051853,0.031023316,0.014010953,0.0020538366,0.6257058],"study_design_scores_gemma":[0.00000927282,0.00018093825,0.0036730175,0.000020000716,0.00001805865,0.00018226975,0.00006890183,0.9879188,0.004085615,0.0028632358,0.0009582452,0.00002165947],"about_ca_topic_score_codex":0.0029625217,"about_ca_topic_score_gemma":0.0024294679,"teacher_disagreement_score":0.0029625217,"about_ca_system_score_codex":0.0004583129,"about_ca_system_score_gemma":0.00096744957,"threshold_uncertainty_score":0.0069437027},"labels":[],"label_agreement":null},{"id":"W4400076000","doi":"10.1109/tifs.2024.3420126","title":"A Robust Privacy-Preserving Federated Learning Model Against Model Poisoning Attacks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":319,"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; University of Calgary; University of Guelph","funders":"","keywords":"Computer science; Computer security; Data modeling; Privacy protection; Information privacy; Internet privacy; Database","score_opus":0.030518082486588372,"score_gpt":0.25237823814701515,"score_spread":0.22186015566042677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400076000","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.019895988,0.00011868059,0.9779286,0.00035438003,0.000019309182,0.00005595338,0.00007590025,0.0006361672,0.00091504],"genre_scores_gemma":[0.88475716,0.00017698861,0.1107933,0.00019072824,0.00003068499,0.00011762424,0.0001590424,0.00007522424,0.0036992717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971783,0.0007901447,0.0001665922,0.00072395656,0.00082980614,0.00031117495],"domain_scores_gemma":[0.9951467,0.0015141133,0.0006703112,0.0016440891,0.0008340408,0.00019076286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035081462,0.0007601047,0.0015018164,0.00082463335,0.00076837384,0.0021604975,0.0029911688,0.0018210436,0.0014058274],"category_scores_gemma":[0.008913195,0.00042615994,0.001033177,0.0009801595,0.001778775,0.004590895,0.0027864326,0.0020422896,0.0006595907],"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.00031347608,0.00013988973,0.001192454,0.00006259251,0.00007164184,0.00020643054,0.00012432654,0.87869817,0.004600761,0.05678089,0.0014819575,0.056327436],"study_design_scores_gemma":[0.000007638172,0.000029049588,0.000053991767,0.000004639019,0.0000069699727,0.000050149647,0.000007263727,0.9854004,0.0013874831,0.012767432,0.00027742123,0.0000075542116],"about_ca_topic_score_codex":0.0018282841,"about_ca_topic_score_gemma":0.0012183157,"teacher_disagreement_score":0.0035081462,"about_ca_system_score_codex":0.0014514503,"about_ca_system_score_gemma":0.0022901131,"threshold_uncertainty_score":0.018553078},"labels":[],"label_agreement":null},{"id":"W4400276571","doi":"10.1109/tifs.2024.3422876","title":"PrivGrid: Privacy-Preserving Individual Load Forecasting Service for Smart Grid","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","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 Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Smart grid; Service (business); Information privacy; Privacy protection; Computer security","score_opus":0.018390169221594446,"score_gpt":0.21957092706769007,"score_spread":0.20118075784609563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400276571","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.056210134,0.00033912706,0.8665495,0.001956672,0.00029004004,0.00040063178,0.001354205,0.054310653,0.018589167],"genre_scores_gemma":[0.9003939,0.00025882086,0.07897793,0.0008983468,0.00014241617,0.00033251723,0.0018456432,0.0012326686,0.01591777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986487,0.00031033834,0.00008342047,0.00017575367,0.00057719316,0.00020457353],"domain_scores_gemma":[0.99789953,0.00030240553,0.000189484,0.0012311969,0.0002576616,0.0001196397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014822016,0.00057896407,0.00059529074,0.00058857375,0.0009623666,0.0015392386,0.0012649195,0.0010356945,0.007817283],"category_scores_gemma":[0.0034633311,0.00027752883,0.0004044508,0.0007508072,0.0012461441,0.003912136,0.0044846046,0.0018322931,0.0038384774],"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.0034079324,0.0006042814,0.007665216,0.00043039172,0.00017302764,0.0016409816,0.0017269219,0.049642757,0.055607457,0.2759185,0.16200127,0.44118124],"study_design_scores_gemma":[0.00029068204,0.00045353608,0.0016077893,0.0000621803,0.00006199408,0.0010135188,0.00044455865,0.65219176,0.07903608,0.16809982,0.09659951,0.0001384701],"about_ca_topic_score_codex":0.0008213452,"about_ca_topic_score_gemma":0.0008559761,"teacher_disagreement_score":0.007817283,"about_ca_system_score_codex":0.0008015285,"about_ca_system_score_gemma":0.0015920071,"threshold_uncertainty_score":0.026151478},"labels":[],"label_agreement":null},{"id":"W4401211760","doi":"10.1109/tifs.2024.3436885","title":"Integrated Communications and Security: RIS-Assisted Simultaneous Transmission and Generation of Secret Keys","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; European Commission; Queen's University; Southeast University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Transmission (telecommunications); Computer security; Computer network; Telecommunications","score_opus":0.018774333083553595,"score_gpt":0.2432424407792955,"score_spread":0.2244681076957419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211760","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.02996511,0.00024263455,0.9623479,0.00024881662,0.00005886788,0.000049107308,0.00002100016,0.00023924398,0.0068273484],"genre_scores_gemma":[0.9160611,0.00019555235,0.080874756,0.00013247099,0.000035488705,0.000077203054,0.000030780266,0.00002094429,0.0025716017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935156,0.000137431,0.000026936605,0.00014404581,0.00021902345,0.000121069104],"domain_scores_gemma":[0.9996049,0.00011190217,0.00009420465,0.00008190615,0.00007716777,0.000029806204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054711464,0.00062450924,0.000429426,0.00029945155,0.0003229207,0.0008139306,0.0010836724,0.000732413,0.00145581],"category_scores_gemma":[0.0009451192,0.00024104082,0.00041837431,0.00036120674,0.00093534176,0.0014302417,0.0012520608,0.00085725635,0.00037903266],"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.0003347546,0.00015595021,0.0016952422,0.00022355282,0.00009233861,0.0004525587,0.00027931287,0.59751093,0.13097875,0.13140436,0.0020826885,0.13478956],"study_design_scores_gemma":[0.000017357637,0.00018000088,0.00014379006,0.00000820447,0.000016854385,0.00012959723,0.000020621728,0.9740242,0.012667521,0.010637471,0.0021396736,0.000014652087],"about_ca_topic_score_codex":0.0006471222,"about_ca_topic_score_gemma":0.0007276242,"teacher_disagreement_score":0.00145581,"about_ca_system_score_codex":0.00064480124,"about_ca_system_score_gemma":0.00082310016,"threshold_uncertainty_score":0.0048701763},"labels":[],"label_agreement":null},{"id":"W4401211782","doi":"10.1109/tifs.2024.3436818","title":"RUDOLF: An Efficient and Adaptive Defense Approach Against Website Fingerprinting Attacks Based on Soft Actor-Critic Algorithm","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Internet Traffic Analysis and Secure E-voting","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":"Simon Fraser University","funders":"","keywords":"Computer science; Computer security; Algorithm","score_opus":0.01045495760058686,"score_gpt":0.2223370493265828,"score_spread":0.21188209172599592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211782","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.014676288,0.00034115778,0.97929126,0.00030422505,0.00008611493,0.00008331388,0.000035069606,0.0016013823,0.0035812643],"genre_scores_gemma":[0.84991306,0.0002547081,0.14199564,0.0004423566,0.00007208902,0.00027057534,0.00013872812,0.00020235457,0.0067103542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993212,0.00020054764,0.000029495452,0.00016085789,0.00014969801,0.00013804947],"domain_scores_gemma":[0.9987758,0.0006445466,0.00015025331,0.000096040494,0.00022747845,0.000105798616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801007,0.0014591904,0.001375625,0.00066330814,0.0004212814,0.0008031988,0.0017188642,0.0015034318,0.002325269],"category_scores_gemma":[0.0034654054,0.0005313587,0.0007436012,0.00026214583,0.001125736,0.00077959633,0.00122666,0.0020371568,0.00052782847],"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.000064666696,0.00003967628,0.00080768846,0.000050514383,0.000055577162,0.000100888436,0.000045071847,0.95214957,0.0018197999,0.0057183877,0.0016372062,0.03751108],"study_design_scores_gemma":[0.0000078623425,0.000016258604,0.00003682011,0.000003282448,0.0000040424115,0.000011155274,0.0000025860281,0.998574,0.00022070776,0.0008835445,0.00023600506,0.0000036350195],"about_ca_topic_score_codex":0.005263323,"about_ca_topic_score_gemma":0.004648321,"teacher_disagreement_score":0.005263323,"about_ca_system_score_codex":0.00086812954,"about_ca_system_score_gemma":0.0015103725,"threshold_uncertainty_score":0.0104653835},"labels":[],"label_agreement":null},{"id":"W4401879875","doi":"10.1109/tifs.2024.3449038","title":"ACE-WARP: A Cost-Effective Approach to Proactive and Non-Disruptive Incident Response in Kubernetes Clusters","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Information and Cyber 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":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.008421502743420389,"score_gpt":0.23991891585669195,"score_spread":0.23149741311327157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401879875","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.14863592,0.0006209068,0.8295806,0.00088631647,0.0002218009,0.00037513365,0.0002419286,0.010236656,0.0092007285],"genre_scores_gemma":[0.8486496,0.00013649558,0.14838856,0.00014811977,0.000026413276,0.00012714005,0.00018446853,0.00022439809,0.0021147977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942964,0.00015066472,0.000031666397,0.00009453802,0.00014639487,0.00014701384],"domain_scores_gemma":[0.99931633,0.00027039417,0.000086169195,0.00009652858,0.00011111823,0.00011942069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009148094,0.001267297,0.00067648117,0.000452207,0.00065066956,0.0010331972,0.0014789207,0.0007857277,0.0020992414],"category_scores_gemma":[0.0018751133,0.00031836904,0.00046991603,0.00035216523,0.0005383588,0.00097179046,0.0016818943,0.0010865021,0.00035023468],"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.00030371,0.000141238,0.0017684484,0.00013425517,0.000056220095,0.00020858062,0.000062205945,0.9105612,0.008881507,0.0028778235,0.0035391476,0.07146561],"study_design_scores_gemma":[0.00001890141,0.000060372484,0.00035332044,0.0000045144966,0.0000114086615,0.00004135829,0.00004810946,0.9948769,0.002489102,0.001094797,0.0009909574,0.000010240829],"about_ca_topic_score_codex":0.004459137,"about_ca_topic_score_gemma":0.0044846702,"teacher_disagreement_score":0.004459137,"about_ca_system_score_codex":0.00073152327,"about_ca_system_score_gemma":0.0011206681,"threshold_uncertainty_score":0.00886637},"labels":[],"label_agreement":null},{"id":"W4402593024","doi":"10.1109/tifs.2024.3463547","title":"LiDiNet: A Lightweight Deep Invertible Network for Image-in-Image Steganography","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":15,"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":"Computer science; Steganography; Image (mathematics); Artificial intelligence; Computer vision; Steganography tools","score_opus":0.007437965867502502,"score_gpt":0.230467002183926,"score_spread":0.22302903631642348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402593024","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.041514553,0.0007339923,0.95005023,0.00019970587,0.00008740609,0.00007030783,0.00013091811,0.002511846,0.004701006],"genre_scores_gemma":[0.6754947,0.00078922824,0.31278878,0.00035302818,0.000059748952,0.00014315447,0.00059642235,0.00018311483,0.009591859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998435,0.0000215162,0.0000080323,0.000033486373,0.000062677944,0.00003077771],"domain_scores_gemma":[0.9998317,0.000055136796,0.000024986943,0.00003421211,0.000038047347,0.000015872221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859034,0.000504756,0.00037434624,0.00034446252,0.00019360319,0.00033081818,0.0008976404,0.00050368236,0.0014597505],"category_scores_gemma":[0.0006598017,0.00021166526,0.00031974268,0.0002122113,0.00040569695,0.0008554653,0.0010081994,0.0008629601,0.0004994998],"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.00042977015,0.00021454487,0.001873716,0.00030268126,0.00014756032,0.00041414064,0.0001489047,0.22089098,0.22130615,0.018678004,0.0057713278,0.52982235],"study_design_scores_gemma":[0.000018702414,0.0001483482,0.0004430995,0.000017637183,0.000027334961,0.00019892269,0.000016619146,0.9478563,0.0420295,0.003513913,0.005708816,0.000020769397],"about_ca_topic_score_codex":0.0014448192,"about_ca_topic_score_gemma":0.0031689857,"teacher_disagreement_score":0.0014597505,"about_ca_system_score_codex":0.00039981102,"about_ca_system_score_gemma":0.0004162712,"threshold_uncertainty_score":0.004883349},"labels":[],"label_agreement":null},{"id":"W4402981213","doi":"10.1109/tifs.2024.3471429","title":"Power Allocation and Decoding Order Selection for Secrecy Fairness in Downlink Cooperative NOMA With Untrusted Receivers Under Imperfect SIC","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"National Research Council of Science and Technology; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Noma; Computer science; Secrecy; Decoding methods; Telecommunications link; Imperfect; Selection (genetic algorithm); Power (physics); Computer network; Interference (communication); Computer security; Telecommunications","score_opus":0.0065465363098652736,"score_gpt":0.22052952699157682,"score_spread":0.21398299068171156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402981213","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.0750191,0.000451082,0.91791844,0.0003312351,0.00004856123,0.000057613404,0.00006222518,0.00016692534,0.00594481],"genre_scores_gemma":[0.9655285,0.00024467934,0.03300828,0.000065277345,0.000040234314,0.000041860138,0.000021882133,0.000020602463,0.0010285953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977512,0.0011004108,0.00006769405,0.00019669069,0.0004914621,0.00039252976],"domain_scores_gemma":[0.99695253,0.0019830707,0.00033942037,0.00030379952,0.00029201602,0.0001291765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628137,0.00095603155,0.0011024289,0.00064214336,0.0009189892,0.001668131,0.0009227528,0.00076445844,0.0009982793],"category_scores_gemma":[0.0077526164,0.0004714774,0.00048048224,0.0008575582,0.0020440435,0.0012360782,0.0016111456,0.00096193794,0.00027762252],"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.00017553483,0.000051018356,0.0007712397,0.000046800156,0.000033021453,0.00016240869,0.00012617378,0.92583954,0.00422289,0.05204138,0.0005426266,0.015987294],"study_design_scores_gemma":[0.000014192811,0.000032067983,0.00010239369,0.000007732064,0.000010426659,0.00004593969,0.000028048433,0.9874614,0.0015116939,0.010560655,0.00021490852,0.0000104637365],"about_ca_topic_score_codex":0.0027033596,"about_ca_topic_score_gemma":0.0034152644,"teacher_disagreement_score":0.0027033596,"about_ca_system_score_codex":0.0013759315,"about_ca_system_score_gemma":0.0026783694,"threshold_uncertainty_score":0.013899088},"labels":[],"label_agreement":null},{"id":"W4403331925","doi":"10.1109/tifs.2024.3477269","title":"Mitigating Propagation of Cyber-Attacks in Wide-Area Measurement Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"Concordia University; Lakehead University","funders":"Public Safety Canada","keywords":"Computer science; Computer security","score_opus":0.011533143710938188,"score_gpt":0.20128776259451686,"score_spread":0.18975461888357867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403331925","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.08690938,0.0002794736,0.9108328,0.00021260764,0.000017524932,0.000043859676,0.000021771726,0.0002872294,0.0013953273],"genre_scores_gemma":[0.97182155,0.0001443205,0.027604561,0.00003610532,0.00001148738,0.000028196242,0.00002157461,0.000011565515,0.00032067826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928385,0.0002640645,0.000027410913,0.00010840616,0.0002026024,0.000113709924],"domain_scores_gemma":[0.9978886,0.0013042074,0.00044729465,0.00007372022,0.00022261665,0.00006359379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012920807,0.00082913914,0.00065863814,0.0006684911,0.00034112297,0.00074062386,0.0005830909,0.00071581925,0.00037809738],"category_scores_gemma":[0.004528232,0.000294669,0.00030864542,0.00034261355,0.00067906943,0.0010492296,0.0007878795,0.00096978614,0.00006529238],"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.000030389463,0.000023897976,0.0008096545,0.000025864998,0.000013215022,0.000026654452,0.00002126272,0.98017794,0.0009965998,0.0015771764,0.00007648804,0.01622085],"study_design_scores_gemma":[0.0000019153583,0.000023497503,0.00019208003,0.0000028823601,0.0000025300337,0.000007863805,0.000006424528,0.99871314,0.000446401,0.0005539266,0.000047347403,0.0000019396073],"about_ca_topic_score_codex":0.004889464,"about_ca_topic_score_gemma":0.0030660524,"teacher_disagreement_score":0.004889464,"about_ca_system_score_codex":0.00078351377,"about_ca_system_score_gemma":0.0012606358,"threshold_uncertainty_score":0.009721994},"labels":[],"label_agreement":null},{"id":"W4403919398","doi":"10.1109/tifs.2024.3488500","title":"Eyes on Federated Recommendation: Targeted Poisoning With Competition and Its Mitigation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Pharmacology and Obesity Treatment","field":"Medicine","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Competition (biology); Computer security","score_opus":0.009486922414118616,"score_gpt":0.2565432482598259,"score_spread":0.24705632584570728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403919398","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.13080497,0.0014799186,0.8322452,0.0052147135,0.00044957007,0.00036672532,0.0002753614,0.008450173,0.020713374],"genre_scores_gemma":[0.9044951,0.00035561383,0.08502771,0.0018401501,0.00014593528,0.000111466106,0.00021532795,0.0001586533,0.0076500913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918801,0.0027932816,0.00034950452,0.0013897419,0.0028771772,0.0007101414],"domain_scores_gemma":[0.98434746,0.00403531,0.0014460582,0.007281052,0.0023077286,0.0005825119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004890385,0.0014844538,0.001546968,0.0015629253,0.0021481763,0.002855183,0.0025790317,0.0049014897,0.0018335773],"category_scores_gemma":[0.015284305,0.0005964985,0.0014540282,0.0014733494,0.0020876087,0.0065816827,0.0040722876,0.0038480454,0.0011611047],"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.0024096954,0.0010529369,0.03182238,0.00038652352,0.0010824355,0.002471714,0.0022260675,0.17305137,0.049127672,0.14472623,0.046798874,0.5448442],"study_design_scores_gemma":[0.000097413096,0.00055808586,0.0033731272,0.00006932953,0.0001625303,0.0022379025,0.00034316545,0.889939,0.028777502,0.05122835,0.023076337,0.00013722849],"about_ca_topic_score_codex":0.0044021644,"about_ca_topic_score_gemma":0.0025244062,"teacher_disagreement_score":0.0049014897,"about_ca_system_score_codex":0.001691721,"about_ca_system_score_gemma":0.0013147308,"threshold_uncertainty_score":0.025863111},"labels":[],"label_agreement":null},{"id":"W4404036747","doi":"10.1109/tifs.2024.3490861","title":"Evaluating Security and Robustness for Split Federated Learning Against Poisoning Attacks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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 New Brunswick; Queen's University","funders":"","keywords":"Computer science; Robustness (evolution); Computer security","score_opus":0.03187958657872434,"score_gpt":0.3032457607121363,"score_spread":0.27136617413341196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404036747","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.8365387,0.0011363721,0.15533234,0.0009804682,0.00012269718,0.00023900796,0.00036206303,0.002287735,0.0030006492],"genre_scores_gemma":[0.9816611,0.00008797848,0.017682262,0.000074473995,0.000011877366,0.000043089007,0.00018307599,0.000034160734,0.0002221128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921985,0.0032417334,0.0005695165,0.0013034337,0.0018283682,0.00085845706],"domain_scores_gemma":[0.9638706,0.020641059,0.0032354537,0.0087412745,0.0024412167,0.0010705147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011297587,0.0011192758,0.00092483714,0.0012745447,0.00091299857,0.0016292584,0.0015891191,0.0019917854,0.0007139453],"category_scores_gemma":[0.04366061,0.0003577254,0.0009251032,0.00077104114,0.0025819931,0.003444922,0.0030640184,0.0018745564,0.00024951095],"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.0016845702,0.0003888986,0.022864355,0.00019730057,0.0003189581,0.00015113487,0.00016994704,0.90728813,0.00758543,0.008458524,0.0014034853,0.049489263],"study_design_scores_gemma":[0.00004726736,0.00029130033,0.0012502103,0.000021663824,0.000027002983,0.000069072805,0.0000669017,0.9873958,0.0065310225,0.004030697,0.00025413436,0.000014978756],"about_ca_topic_score_codex":0.002773635,"about_ca_topic_score_gemma":0.0014008665,"teacher_disagreement_score":0.011297587,"about_ca_system_score_codex":0.0017198749,"about_ca_system_score_gemma":0.0018252243,"threshold_uncertainty_score":0.059748054},"labels":[],"label_agreement":null},{"id":"W4405270678","doi":"10.1109/tifs.2024.3515809","title":"Detection of False Data Injection Attacks in Smart Grids: An Optimal Transport-Based Reliable Self-Training Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":9,"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; Training (meteorology); Training set; Computer security; Artificial intelligence; Data mining","score_opus":0.01726655817685072,"score_gpt":0.22754120213783102,"score_spread":0.2102746439609803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405270678","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.050697632,0.00015508306,0.94716537,0.00025135814,0.000025462088,0.000041966832,0.000033042084,0.00078841625,0.00084162434],"genre_scores_gemma":[0.8751241,0.00014031811,0.1222762,0.00025130663,0.000058457772,0.00008071774,0.0001932009,0.00009910336,0.0017766424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991516,0.00022327453,0.000057296606,0.00020573214,0.00023822799,0.0001238635],"domain_scores_gemma":[0.99775887,0.00093290256,0.0003519809,0.0004055874,0.00042980257,0.00012082463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019234694,0.0009310127,0.0010696608,0.0009139438,0.00044258943,0.00065780664,0.0016506347,0.001181736,0.0006993598],"category_scores_gemma":[0.00604148,0.0004693148,0.0006211045,0.0005416194,0.0012643937,0.002327654,0.0020892236,0.0013260727,0.00031035062],"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.0004921565,0.00023282284,0.0063824253,0.00012225394,0.00007381576,0.00030691462,0.00031077868,0.59807265,0.022019152,0.009738567,0.002062229,0.36018628],"study_design_scores_gemma":[0.0000045054976,0.000036128316,0.00029078836,0.0000045852566,0.0000057985408,0.000049109913,0.000015332758,0.994356,0.0031417352,0.0018929496,0.00019765962,0.0000054988664],"about_ca_topic_score_codex":0.0016219527,"about_ca_topic_score_gemma":0.0014208448,"teacher_disagreement_score":0.0019234694,"about_ca_system_score_codex":0.0005637449,"about_ca_system_score_gemma":0.00096483115,"threshold_uncertainty_score":0.010172427},"labels":[],"label_agreement":null},{"id":"W4405633082","doi":"10.1109/tifs.2024.3520863","title":"zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Training","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":19,"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; Zero-knowledge proof; Mathematical proof; Zero (linguistics); Artificial intelligence; Computer security; Cryptography; Mathematics","score_opus":0.01283229624321787,"score_gpt":0.23863970107056853,"score_spread":0.22580740482735068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405633082","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.0096978145,0.00073800376,0.9716581,0.0013311263,0.00028101832,0.00020454134,0.0004159296,0.007924775,0.007748709],"genre_scores_gemma":[0.4634336,0.0010248313,0.51969004,0.0017748867,0.00043484068,0.0006723152,0.0010180247,0.0024154487,0.009535976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98491675,0.0045289337,0.0010294302,0.0021006165,0.0058231046,0.0016010477],"domain_scores_gemma":[0.9563152,0.027809104,0.0021212134,0.010456414,0.002640469,0.0006574635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007634283,0.0014516169,0.0014373693,0.0017187119,0.0018706092,0.0066528977,0.0048165726,0.002274828,0.01638325],"category_scores_gemma":[0.05258766,0.0016941024,0.002715692,0.0012845399,0.004851937,0.012144549,0.010038622,0.0062005483,0.004164195],"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.0006093458,0.00019978888,0.001184692,0.0009616801,0.0001484923,0.00059455866,0.0006408765,0.051824432,0.013771479,0.690728,0.019424574,0.21991205],"study_design_scores_gemma":[0.00021147636,0.00015693692,0.00016350637,0.00025187098,0.000091541275,0.00034591267,0.0000796163,0.23592655,0.02546115,0.71409,0.023124473,0.00009693004],"about_ca_topic_score_codex":0.0014016205,"about_ca_topic_score_gemma":0.002177385,"teacher_disagreement_score":0.01638325,"about_ca_system_score_codex":0.0033529194,"about_ca_system_score_gemma":0.005619266,"threshold_uncertainty_score":0.054807484},"labels":[],"label_agreement":null},{"id":"W4406949434","doi":"10.1109/tifs.2025.3536612","title":"Protecting Your Attention During Distributed Graph Learning: Efficient Privacy-Preserving Federated Graph Attention Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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":"Queen's University","funders":"Japan Society for the Promotion of Science; China Scholarship Council","keywords":"Computer science; Graph; Information privacy; Theoretical computer science; Privacy protection; Computer security","score_opus":0.012537259317445483,"score_gpt":0.23817500290755142,"score_spread":0.22563774359010594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949434","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.035055332,0.00022080209,0.9610018,0.0005441639,0.000037623067,0.00009158859,0.0001353615,0.0015373167,0.0013759565],"genre_scores_gemma":[0.79790777,0.00019519294,0.19650085,0.00051040255,0.00007052269,0.00016738973,0.00058204116,0.0002219403,0.0038438633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980166,0.00058849424,0.00007800703,0.000586068,0.0005079359,0.0002229212],"domain_scores_gemma":[0.9954665,0.0018143386,0.00035771824,0.0015554718,0.0005294781,0.0002765395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247405,0.00091531425,0.0011060148,0.0009426357,0.0011139542,0.0013771672,0.0029666275,0.0015236463,0.002491162],"category_scores_gemma":[0.011988166,0.00046142592,0.0008483083,0.00119331,0.0013881762,0.004792185,0.004523761,0.002099723,0.000534554],"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.0005887951,0.00035502674,0.0036971923,0.00018883978,0.00011699911,0.00034554573,0.0007000772,0.4298513,0.015637597,0.05600936,0.010272467,0.48223683],"study_design_scores_gemma":[0.000018068053,0.000057587302,0.00030823395,0.000006868207,0.000015698186,0.00008766506,0.00004778022,0.9578697,0.004171133,0.036203966,0.0012039036,0.000009310452],"about_ca_topic_score_codex":0.0038729103,"about_ca_topic_score_gemma":0.0061021787,"teacher_disagreement_score":0.0038729103,"about_ca_system_score_codex":0.0019303252,"about_ca_system_score_gemma":0.0017731502,"threshold_uncertainty_score":0.014005542},"labels":[],"label_agreement":null},{"id":"W4407317465","doi":"10.1109/tifs.2025.3540290","title":"No Time for Remodulation: A PHY Steganographic Symbiotic Channel Over Constant Envelope","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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; Constant (computer programming); Channel (broadcasting); PHY; Envelope (radar); Frequency-shift keying; Telecommunications; Physical layer; Demodulation; Wireless; Radar","score_opus":0.006821709376889425,"score_gpt":0.22263905279013396,"score_spread":0.21581734341324454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407317465","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.5422647,0.00036379806,0.446387,0.0002794361,0.000114630915,0.000151187,0.00007563054,0.0035963668,0.006767192],"genre_scores_gemma":[0.9561099,0.00006576544,0.040912174,0.00009800899,0.0000127449675,0.000043599073,0.0000460911,0.000060748356,0.002650993],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954516,0.00013855382,0.000016795217,0.00008775886,0.000115536306,0.00009614189],"domain_scores_gemma":[0.99910164,0.00032820503,0.00012775521,0.00023557825,0.00013312367,0.00007367059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059100357,0.00044752317,0.0003062609,0.00030148774,0.00024131837,0.00048378683,0.00045968566,0.0005011186,0.001944643],"category_scores_gemma":[0.001056404,0.00013451105,0.00020765231,0.00018533987,0.0006128238,0.0011234307,0.0007483955,0.0003953081,0.00036409026],"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.0026881907,0.0005142451,0.0035022234,0.0002892461,0.000098430166,0.00084293773,0.00043273316,0.030602073,0.75388694,0.019038694,0.0018763347,0.18622795],"study_design_scores_gemma":[0.00021689862,0.00292168,0.0035347475,0.000039446495,0.0000941804,0.0012438544,0.00012342271,0.39381266,0.58512765,0.0031044565,0.009690691,0.00009035405],"about_ca_topic_score_codex":0.00026891936,"about_ca_topic_score_gemma":0.0002596628,"teacher_disagreement_score":0.001944643,"about_ca_system_score_codex":0.00020346616,"about_ca_system_score_gemma":0.00021560873,"threshold_uncertainty_score":0.0065054297},"labels":[],"label_agreement":null},{"id":"W4407575086","doi":"10.1109/tifs.2025.3541969","title":"Adaptive Generation of Privileged Intermediate Information for Visible-Infrared Person Re-Identification","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Computer science; Identification (biology); Infrared; Artificial intelligence; Optics; Physics","score_opus":0.027943136538506403,"score_gpt":0.2756919817106899,"score_spread":0.2477488451721835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407575086","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.07371737,0.00021039342,0.91961443,0.00025317082,0.00006833693,0.00008811718,0.00021635446,0.0025162697,0.003315496],"genre_scores_gemma":[0.72694814,0.00016697869,0.2663836,0.00034754333,0.000037331465,0.00014521714,0.0013651702,0.00024109085,0.0043649296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.00021267582,0.000025368574,0.00026693873,0.00014747381,0.00014409344],"domain_scores_gemma":[0.99883336,0.00039652165,0.00009485901,0.000430609,0.0001746439,0.00006989304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803269,0.0008001751,0.00072739157,0.0006538467,0.0005428005,0.0007921582,0.002456593,0.0013220394,0.0029646775],"category_scores_gemma":[0.0041975155,0.0005748135,0.0010224808,0.00052084285,0.0009675131,0.0028690202,0.0033678608,0.0022702115,0.0014217707],"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.0006910486,0.00072065287,0.006755342,0.00012734358,0.00012074046,0.00030603,0.0005818777,0.30998042,0.036415584,0.02199424,0.009494025,0.6128127],"study_design_scores_gemma":[0.000013285115,0.0001250439,0.0009135852,0.000019884938,0.000018059725,0.000113028516,0.00007560363,0.9586206,0.026510326,0.010713518,0.0028537696,0.000023341887],"about_ca_topic_score_codex":0.0018170512,"about_ca_topic_score_gemma":0.0025604812,"teacher_disagreement_score":0.0029646775,"about_ca_system_score_codex":0.0005999071,"about_ca_system_score_gemma":0.00087408157,"threshold_uncertainty_score":0.009917855},"labels":[],"label_agreement":null},{"id":"W4407832005","doi":"10.1109/tifs.2025.3544485","title":"HSM-Based Architecture to Detect Insider Attacks on Server-Side Data","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Network Security and Intrusion Detection","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Insider threat; Client-side; Architecture; Side channel attack; Computer security; Server-side; Insider; Cryptography; Server; Computer network; Operating system","score_opus":0.015480531839314101,"score_gpt":0.24976820287568693,"score_spread":0.23428767103637282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407832005","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.26958194,0.0026214106,0.67510015,0.00058121164,0.00043058337,0.00078901416,0.0008429513,0.038865574,0.011187191],"genre_scores_gemma":[0.87850034,0.0002336179,0.11384959,0.00033839545,0.00012191697,0.00014296857,0.0006973405,0.00010610042,0.006009772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888116,0.00019778353,0.000115064824,0.00022058666,0.00044592505,0.0001395544],"domain_scores_gemma":[0.99823666,0.00019507241,0.00022322289,0.0007060912,0.0005382892,0.000100644094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671873,0.0005620139,0.0005445804,0.0015286519,0.00044596303,0.001000573,0.001282198,0.00065673166,0.0032297987],"category_scores_gemma":[0.0013282374,0.0003164692,0.0003633496,0.0006550545,0.0005760973,0.0020177825,0.0011482413,0.00063385564,0.0016219661],"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.0028816953,0.00072763726,0.02697934,0.0011018727,0.00047156203,0.00076867227,0.00061424036,0.03392434,0.3137656,0.030632066,0.022952944,0.5651801],"study_design_scores_gemma":[0.00015352019,0.002357636,0.01574517,0.00011242858,0.00028925008,0.0010593287,0.00018512594,0.6225938,0.30577484,0.008095271,0.043482207,0.00015143816],"about_ca_topic_score_codex":0.0011423653,"about_ca_topic_score_gemma":0.0010465686,"teacher_disagreement_score":0.0032297987,"about_ca_system_score_codex":0.0010217514,"about_ca_system_score_gemma":0.00086931395,"threshold_uncertainty_score":0.010804772},"labels":[],"label_agreement":null},{"id":"W4408325434","doi":"10.1109/tifs.2025.3550064","title":"COKV: Key-Value Data Collection With Condensed Local Differential Privacy","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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; University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Differential privacy; Computer science; Key (lock); Data collection; Information privacy; Value (mathematics); Computer security; Data mining; Statistics; Mathematics","score_opus":0.016035426349796555,"score_gpt":0.24907557083450169,"score_spread":0.23304014448470514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408325434","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.012905437,0.00038517144,0.9832792,0.0003307075,0.000073247604,0.00022313208,0.00025830782,0.0010063411,0.0015383918],"genre_scores_gemma":[0.72289103,0.00046687477,0.2709145,0.0005587437,0.00016291343,0.00049145374,0.0008940343,0.000229382,0.0033912072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897922,0.003035313,0.0007991175,0.0016719204,0.0038584706,0.0008428989],"domain_scores_gemma":[0.98476505,0.0038675615,0.0012416895,0.007956785,0.0017544561,0.00041446034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964032,0.00066108163,0.0014982803,0.0012468867,0.0015622862,0.0029472385,0.003146045,0.0014398729,0.0022158762],"category_scores_gemma":[0.021490676,0.00058190944,0.00093821384,0.0033775065,0.002476863,0.009194363,0.009407873,0.0025991055,0.0009510869],"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.0015277838,0.00032590138,0.0058467523,0.0007171479,0.000332192,0.00068087113,0.0017455718,0.10291016,0.04353288,0.37927574,0.01582505,0.44728002],"study_design_scores_gemma":[0.00019472152,0.00036687212,0.001260823,0.00008859943,0.00010025184,0.0015812771,0.0005443559,0.6458552,0.047426075,0.28100556,0.021389678,0.00018667987],"about_ca_topic_score_codex":0.00086322037,"about_ca_topic_score_gemma":0.0006836108,"teacher_disagreement_score":0.004964032,"about_ca_system_score_codex":0.001592202,"about_ca_system_score_gemma":0.0024998828,"threshold_uncertainty_score":0.026252687},"labels":[],"label_agreement":null},{"id":"W4409020031","doi":"10.1109/tifs.2025.3550812","title":"Blockchain-Enabled Computing Offloading and Resource Allocation in Multi-UAVs MEC Network: A Stackelberg Game Learning Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":10,"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":"National Key Research and Development Program of China; Natural Science Foundation of Hunan Province; Natural Sciences and Engineering Research Council of Canada; Key Laboratory of Intelligent Multimedia Technology; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Resource allocation; Computer network; Resource management (computing); Server; Game based learning; Distributed computing; Multimedia","score_opus":0.011475897177911762,"score_gpt":0.22788554105962375,"score_spread":0.216409643881712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409020031","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.06280764,0.00028983425,0.93045753,0.00043026294,0.00005115786,0.00011320992,0.000070691014,0.00015166638,0.0056280084],"genre_scores_gemma":[0.9633283,0.000238499,0.033177447,0.00009795683,0.00002496995,0.00011366269,0.000060651495,0.000020661826,0.002937845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993419,0.00019083114,0.00002408565,0.00014017565,0.00012168386,0.00018140182],"domain_scores_gemma":[0.9988784,0.00069160387,0.00011598666,0.000060341576,0.00014951827,0.00010411106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010205815,0.00083453226,0.0011208005,0.00037608875,0.0007368216,0.0010457155,0.0012039647,0.0010526853,0.0024476433],"category_scores_gemma":[0.0020846534,0.00036498602,0.0005182034,0.00052028464,0.0010718803,0.0016373441,0.0014222554,0.0011427951,0.00019240244],"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.00006298676,0.000037322687,0.00039045804,0.000034243996,0.000016452197,0.00008555413,0.000045408087,0.9771261,0.00092191045,0.010770693,0.00047793225,0.0100309355],"study_design_scores_gemma":[0.0000058974624,0.000013621142,0.000025828329,0.0000015849587,0.0000024695357,0.0000066480893,0.000007380298,0.9969735,0.00014731754,0.0027082937,0.000105421444,0.0000020913953],"about_ca_topic_score_codex":0.009952013,"about_ca_topic_score_gemma":0.008536244,"teacher_disagreement_score":0.009952013,"about_ca_system_score_codex":0.00132744,"about_ca_system_score_gemma":0.0023637535,"threshold_uncertainty_score":0.019788146},"labels":[],"label_agreement":null},{"id":"W4410358938","doi":"10.1109/tifs.2025.3570202","title":"Generative AI Based Secure Wireless Sensing for ISAC Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":130,"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; National Research Foundation Singapore; National Research Foundation of Korea; Ministry of Education","keywords":"Computer science; Wireless; Wireless network; Computer network; Generative grammar; Computer security; Artificial intelligence; Telecommunications","score_opus":0.00733626976435155,"score_gpt":0.23311691411423485,"score_spread":0.2257806443498833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410358938","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.022323793,0.00019827887,0.9737099,0.00026142676,0.00004354778,0.000033124474,0.00006249405,0.00047129215,0.0028961974],"genre_scores_gemma":[0.91403514,0.00022818502,0.08135156,0.000227813,0.000037057715,0.00007179476,0.00013360224,0.00006792777,0.003846897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936205,0.0001380227,0.000025422518,0.00020697762,0.00018740608,0.000080167076],"domain_scores_gemma":[0.9984635,0.00090942596,0.0001677734,0.0002195211,0.00016986117,0.00006993369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115778,0.0005854445,0.0006773366,0.0005215247,0.0005597368,0.000793953,0.0010265533,0.0007503901,0.0016691795],"category_scores_gemma":[0.0024380186,0.00035918286,0.0006545597,0.0004928699,0.0014222147,0.001022926,0.0015447764,0.0012042623,0.0003783267],"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.00014192931,0.00005135895,0.0012762801,0.00008221997,0.00004687828,0.00023008836,0.00023318431,0.83592856,0.017348208,0.070934616,0.0013705291,0.07235621],"study_design_scores_gemma":[0.000003773316,0.000014020144,0.0000963421,0.0000026382118,0.0000044653993,0.000037034173,0.000008574266,0.9914226,0.00094062637,0.007113943,0.00035068786,0.000005418708],"about_ca_topic_score_codex":0.0038527567,"about_ca_topic_score_gemma":0.0044933474,"teacher_disagreement_score":0.0038527567,"about_ca_system_score_codex":0.0009882131,"about_ca_system_score_gemma":0.00082038296,"threshold_uncertainty_score":0.007660687},"labels":[],"label_agreement":null},{"id":"W4412404454","doi":"10.1109/tifs.2025.3589008","title":"FOADA: Toward Robust Open-World Mobile App Fingerprinting","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"User Authentication and Security Systems","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":"","keywords":"Computer science; Computer security","score_opus":0.017562076330190596,"score_gpt":0.2510692596947295,"score_spread":0.23350718336453888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412404454","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.12560064,0.0019458247,0.8440382,0.00065052026,0.00029374086,0.00017553623,0.00065216323,0.022471284,0.0041721016],"genre_scores_gemma":[0.83167,0.00073967176,0.16041803,0.0005194644,0.0001740694,0.00012726084,0.0012762027,0.00038688173,0.004688398],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976533,0.00038028896,0.00010356395,0.0005345176,0.0010016442,0.0003266942],"domain_scores_gemma":[0.99651814,0.001091243,0.0005005408,0.001027401,0.0006888877,0.00017373334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737604,0.0015207011,0.0014696913,0.0020947184,0.0004853475,0.0015931157,0.0018777881,0.0019177336,0.00097267417],"category_scores_gemma":[0.00797446,0.0004602302,0.00077785726,0.00073818304,0.00083200657,0.003478725,0.0028343527,0.002285021,0.0020646192],"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.00090256264,0.0007542833,0.012364878,0.00021192379,0.0002028422,0.00054063194,0.00024802834,0.12835784,0.07313188,0.007270119,0.011860795,0.76415426],"study_design_scores_gemma":[0.00002067855,0.0001859487,0.0020078938,0.000027780847,0.000029771827,0.0004232869,0.00005431212,0.9540243,0.029922102,0.007914104,0.0053458926,0.000043876214],"about_ca_topic_score_codex":0.0026346794,"about_ca_topic_score_gemma":0.0021654807,"teacher_disagreement_score":0.0026346794,"about_ca_system_score_codex":0.0006481061,"about_ca_system_score_gemma":0.0008800308,"threshold_uncertainty_score":0.009380639},"labels":[],"label_agreement":null},{"id":"W4412748127","doi":"10.1109/tifs.2025.3594198","title":"Multi-User Key Rate Optimization for Near-Field Extremely Large-Scale Antenna Array Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Antenna Design and Analysis","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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Computer science; Key (lock); Antenna (radio); Scale (ratio); Telecommunications; Computer security; Physics","score_opus":0.011590284374296485,"score_gpt":0.2302309787438307,"score_spread":0.2186406943695342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412748127","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.013243987,0.00078909844,0.98096,0.00025262195,0.000037443624,0.00004094962,0.000050868817,0.000105123356,0.0045199096],"genre_scores_gemma":[0.82764643,0.0016272878,0.1614618,0.00019605816,0.000087116096,0.00028122964,0.00014155613,0.00012549743,0.008433056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943155,0.00021534914,0.000019437302,0.00010152766,0.00015281816,0.00007927277],"domain_scores_gemma":[0.99899906,0.0006700175,0.00012106277,0.000044892568,0.00013381042,0.00003110282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012155928,0.0010876522,0.0009475021,0.00035350196,0.00036433054,0.0011077067,0.00073255604,0.0009913335,0.0028548408],"category_scores_gemma":[0.0028172254,0.0005467771,0.0005449075,0.0007292924,0.0009008513,0.0012742716,0.0009969177,0.0013581158,0.000566472],"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.000033800025,0.000030669384,0.00016470296,0.00007973323,0.000018422184,0.0000569919,0.000035563135,0.9730497,0.002426839,0.012369787,0.0006903709,0.011043365],"study_design_scores_gemma":[0.0000027291371,0.000012221769,0.000026621326,0.0000041440035,0.0000022333124,0.000007775745,0.0000063018324,0.9976152,0.00029950365,0.0018172703,0.00020300674,0.0000030355648],"about_ca_topic_score_codex":0.0023193106,"about_ca_topic_score_gemma":0.0024260231,"teacher_disagreement_score":0.0028548408,"about_ca_system_score_codex":0.00133663,"about_ca_system_score_gemma":0.0012426724,"threshold_uncertainty_score":0.009698033},"labels":[],"label_agreement":null},{"id":"W4413104855","doi":"10.1109/tifs.2025.3597501","title":"Toward Efficient and Secure Hypercube Tree Building for Vertically Distributed Data in Cloud","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cloud Computing and Resource Management","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":"Computer science; Cloud computing; Hypercube; Distributed computing; Distributed database; Tree (set theory); Computer security; Parallel computing; Operating system","score_opus":0.015350023241434162,"score_gpt":0.2452531821420352,"score_spread":0.22990315890060103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413104855","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.056528445,0.00035342117,0.9382927,0.0005291955,0.000053547712,0.00024160958,0.00017289963,0.00076348655,0.0030646638],"genre_scores_gemma":[0.67666835,0.0003383509,0.32028204,0.00017272623,0.000038290502,0.00022458311,0.00041373665,0.000075029886,0.0017869077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735886,0.000754318,0.0002118003,0.00030283144,0.0010280173,0.00034428437],"domain_scores_gemma":[0.99679476,0.0006335791,0.00037571986,0.0015202005,0.0004949424,0.00018078025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018337754,0.0004070726,0.00075988454,0.00081032474,0.0016485725,0.0017403042,0.0015103424,0.0008979513,0.001307614],"category_scores_gemma":[0.003960968,0.00034163636,0.00080850645,0.0017770207,0.0015072117,0.0046344427,0.004515921,0.0013825129,0.0005133496],"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.000992632,0.0003011203,0.0038069403,0.00035963004,0.000120382494,0.00058515155,0.0012569632,0.29694524,0.08023619,0.36279276,0.0100930575,0.24250996],"study_design_scores_gemma":[0.00009627432,0.00016555752,0.00038724547,0.000022663531,0.000022264767,0.0002682829,0.0002850428,0.88014376,0.031075872,0.07913431,0.0083493795,0.000049464987],"about_ca_topic_score_codex":0.0020190254,"about_ca_topic_score_gemma":0.0015056323,"teacher_disagreement_score":0.0020190254,"about_ca_system_score_codex":0.0014986299,"about_ca_system_score_gemma":0.0026886822,"threshold_uncertainty_score":0.010873318},"labels":[],"label_agreement":null},{"id":"W4413213080","doi":"10.1109/tifs.2025.3595415","title":"Online Reward Poisoning in Reinforcement Learning With Convergence Guarantee","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Huawei Technologies (Canada)","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Convergence (economics); Reinforcement; Artificial intelligence; Computer security; Machine learning","score_opus":0.008356554127959817,"score_gpt":0.20871228746563864,"score_spread":0.2003557333376788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413213080","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.02320155,0.0005925269,0.971193,0.0005561747,0.00005093787,0.00010853758,0.000043158157,0.0011499138,0.0031041172],"genre_scores_gemma":[0.8901171,0.00030230352,0.10577298,0.00031488424,0.0000730168,0.00020502944,0.00009068405,0.00017014243,0.00295388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980982,0.00076966744,0.000087193584,0.00038572674,0.00039124995,0.00026794578],"domain_scores_gemma":[0.98952395,0.008127934,0.0006488357,0.00060272065,0.00073191215,0.0003646302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004677458,0.00135455,0.0019070839,0.000545062,0.00064977503,0.001317941,0.0019850875,0.0020640336,0.002819843],"category_scores_gemma":[0.017748706,0.0006335606,0.0005083731,0.00050647854,0.002182919,0.0020943068,0.0022306459,0.0033012533,0.00066400954],"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.00027590315,0.0001340335,0.0011826645,0.00014275033,0.000041305917,0.00013846488,0.00011383272,0.9230765,0.00095809385,0.026601464,0.001429951,0.045904912],"study_design_scores_gemma":[0.000026133042,0.000042392072,0.0000408061,0.000009542251,0.0000039912766,0.000022335475,0.0000055875494,0.99030554,0.00028728193,0.009060589,0.00019237211,0.0000033859542],"about_ca_topic_score_codex":0.0026173785,"about_ca_topic_score_gemma":0.0016241936,"teacher_disagreement_score":0.004677458,"about_ca_system_score_codex":0.0016182684,"about_ca_system_score_gemma":0.00247969,"threshold_uncertainty_score":0.02473706},"labels":[],"label_agreement":null},{"id":"W4413417378","doi":"10.1109/tifs.2025.3598474","title":"Improving Ethereum Mixing Address Linking With Tensor Computation, Neighbor Data Utilization, and Asymmetric Information Modeling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computation; Mixing (physics); Tensor (intrinsic definition); Data modeling; Data mining; Theoretical computer science; Algorithm; Mathematics; Database","score_opus":0.024396067251862885,"score_gpt":0.2579054771110968,"score_spread":0.2335094098592339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413417378","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.12200791,0.00046663458,0.87114716,0.00034802937,0.00006176014,0.000072016905,0.00021948933,0.0025797193,0.0030972697],"genre_scores_gemma":[0.85950136,0.00027261488,0.13502787,0.00013242762,0.000058889225,0.00005417684,0.00072669715,0.00015978773,0.004066105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993193,0.00017456281,0.000038131748,0.00015074496,0.0002161543,0.00010120258],"domain_scores_gemma":[0.9988275,0.00033081966,0.00024235039,0.00030590736,0.00022056093,0.000072876035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576022,0.0009081414,0.0007988578,0.0014896891,0.00066223333,0.0013050243,0.0009992146,0.0007918001,0.0015545299],"category_scores_gemma":[0.0041485853,0.00029768585,0.0005496963,0.0011409601,0.0006832617,0.0036437947,0.0015447873,0.0011000024,0.00061907084],"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.00043708098,0.0002749751,0.009876714,0.00014260458,0.000103329956,0.00027226648,0.0002720871,0.4554467,0.015439302,0.03524023,0.0048750676,0.47761962],"study_design_scores_gemma":[0.0000035337073,0.000022437558,0.00025690012,0.000003943948,0.000007671962,0.000031033418,0.000019447387,0.9900446,0.0031207667,0.0058162617,0.0006656705,0.000007785036],"about_ca_topic_score_codex":0.004831643,"about_ca_topic_score_gemma":0.007168634,"teacher_disagreement_score":0.004831643,"about_ca_system_score_codex":0.00082088896,"about_ca_system_score_gemma":0.001112874,"threshold_uncertainty_score":0.009607017},"labels":[],"label_agreement":null},{"id":"W4414271167","doi":"10.1109/tifs.2025.3611115","title":"Optimized Sparse Vector Aggregation Under Local Differential Privacy","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","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; Queen's University","funders":"","keywords":"Differential privacy; Byte; Scheme (mathematics); Dimension (graph theory); Crowdsourcing; Set (abstract data type); Information privacy; Cover (algebra); Differential (mechanical device)","score_opus":0.014318629085382657,"score_gpt":0.2433072681940363,"score_spread":0.22898863910865366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414271167","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.030584516,0.00022755048,0.96655864,0.00047797852,0.00004477928,0.00009328692,0.00024302013,0.0006140981,0.001156203],"genre_scores_gemma":[0.85701644,0.0002474147,0.13807857,0.00040184078,0.00012100052,0.00019540743,0.00056911266,0.00005866904,0.0033116047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431604,0.002121897,0.00033702713,0.0011451019,0.0014662733,0.0006136959],"domain_scores_gemma":[0.992023,0.0036210823,0.000834579,0.0025773293,0.00070242246,0.00024154584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003247096,0.0009928609,0.0021113337,0.0006607972,0.0009346068,0.0015689558,0.0027351298,0.00134861,0.0013489723],"category_scores_gemma":[0.0132572735,0.0005098556,0.000882386,0.002200757,0.0012873956,0.0036560718,0.004569661,0.0017274636,0.0004862612],"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.0020998495,0.00033647643,0.0045090043,0.00033234162,0.00025396238,0.00056291244,0.00094795425,0.47991428,0.02903698,0.15162681,0.00928344,0.321096],"study_design_scores_gemma":[0.00004955068,0.00011343811,0.00030592235,0.000007746566,0.000020479929,0.0001435029,0.00004436902,0.95803654,0.0044838483,0.03580336,0.00096931274,0.000022084567],"about_ca_topic_score_codex":0.0016914619,"about_ca_topic_score_gemma":0.0016723282,"teacher_disagreement_score":0.003247096,"about_ca_system_score_codex":0.001409271,"about_ca_system_score_gemma":0.0015835591,"threshold_uncertainty_score":0.017172515},"labels":[],"label_agreement":null},{"id":"W4414604198","doi":"10.1109/tifs.2025.3615515","title":"Privacy-Preserving Authentication for Unlinkable Avatars in the Metaverse","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Innovation in Digital Healthcare Systems","field":"Health Professions","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":"Concordia University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metaverse; Anonymity; Avatar; Authentication (law); Overhead (engineering); Cryptography; Service (business); Protocol (science)","score_opus":0.03988622023648978,"score_gpt":0.37954263072422356,"score_spread":0.33965641048773376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414604198","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.07429924,0.00021616,0.9108601,0.00059517607,0.00019152522,0.00027950385,0.00012672151,0.002178424,0.01125315],"genre_scores_gemma":[0.8908843,0.0002033936,0.09740077,0.00017168344,0.00009083417,0.00027948522,0.00021038062,0.00018270552,0.01057651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99224526,0.0027357277,0.0008781189,0.00092670304,0.0023500598,0.0008640759],"domain_scores_gemma":[0.9838991,0.0032801873,0.0016219408,0.008731704,0.0016155173,0.0008515605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058737076,0.000830946,0.0012244921,0.0009938835,0.0022649309,0.0053416723,0.002264572,0.0026883818,0.00417472],"category_scores_gemma":[0.013263499,0.0007097434,0.0016819047,0.0010418543,0.0037542062,0.01195895,0.011898882,0.0031914923,0.0023239471],"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.0015471843,0.00030790173,0.0053030453,0.00033573684,0.000106216066,0.0017557212,0.005252939,0.022549164,0.05268466,0.81998724,0.0039226483,0.086247586],"study_design_scores_gemma":[0.00028844725,0.00082395517,0.0011269519,0.00024018504,0.00016131782,0.0025045883,0.001348979,0.41666123,0.12608074,0.38798448,0.06253501,0.0002440998],"about_ca_topic_score_codex":0.0007001971,"about_ca_topic_score_gemma":0.00049472303,"teacher_disagreement_score":0.0058737076,"about_ca_system_score_codex":0.0012091715,"about_ca_system_score_gemma":0.0020322467,"threshold_uncertainty_score":0.031063497},"labels":[],"label_agreement":null},{"id":"W4416286437","doi":"10.1109/tifs.2025.3633576","title":"Rethinking Secure Resource Allocation: When NOMA Meets Finite Blocklength","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Wireless Communication Technologies","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":"Memorial University of Newfoundland","funders":"Science and Technology Innovation 2025 Major Project of Ningbo; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Secrecy; Noma; Decoding methods; Transmission (telecommunications); Telecommunications link; Secure transmission; Throughput; Base station; Resource allocation","score_opus":0.009853650887080094,"score_gpt":0.2181044270048691,"score_spread":0.208250776117789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416286437","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.040807273,0.0004476503,0.95133233,0.0006523975,0.000076418284,0.000047123198,0.000057028697,0.000118520366,0.0064612096],"genre_scores_gemma":[0.9195876,0.00078631204,0.07695447,0.0002043816,0.00011698363,0.00010537322,0.00005249304,0.00006136052,0.0021310574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786973,0.00097550487,0.00006668916,0.0002709414,0.0005038777,0.00031321016],"domain_scores_gemma":[0.99601763,0.0027301735,0.00040137168,0.0004015237,0.00031660494,0.0001328296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021172916,0.0009016533,0.0010187028,0.00037960868,0.0008454545,0.001693205,0.00095007126,0.0010768946,0.0014703331],"category_scores_gemma":[0.0115275085,0.00057886087,0.00042398798,0.00065669446,0.0022217806,0.0031295842,0.0019030212,0.0015570023,0.0004440173],"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.00022396183,0.000045670982,0.0014776979,0.00015423249,0.00004554128,0.0008928502,0.00022395885,0.8206444,0.012936002,0.13438125,0.0013381358,0.027636264],"study_design_scores_gemma":[0.000012813915,0.000051904626,0.00024079069,0.000021043608,0.0000089401055,0.00016033526,0.00004966126,0.9700633,0.0018575704,0.026515685,0.0010019449,0.000016068143],"about_ca_topic_score_codex":0.0027025368,"about_ca_topic_score_gemma":0.0023989312,"teacher_disagreement_score":0.0027025368,"about_ca_system_score_codex":0.00096997886,"about_ca_system_score_gemma":0.0016567183,"threshold_uncertainty_score":0.011197448},"labels":[],"label_agreement":null},{"id":"W4416513631","doi":"10.1109/tifs.2025.3636020","title":"MantleMark: Migrating Watermarks From Multi-View Images to Radiance Fields via Frequency Modulation","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Information Forensics and Security","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":"Artificial Intelligence in Medicine (Canada)","funders":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Digital watermarking; Radiance; Watermark; Representation (politics); Iterative reconstruction; Key (lock); Modulation (music); Gaussian","score_opus":0.009249974885947842,"score_gpt":0.2437747784267723,"score_spread":0.23452480354082447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513631","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.034712207,0.00029699813,0.9619306,0.00016400966,0.00006899026,0.00004080067,0.000043220538,0.0009690945,0.0017740617],"genre_scores_gemma":[0.44860747,0.00081151817,0.54339725,0.0002217129,0.00009813599,0.00007746762,0.0001979154,0.00021154538,0.0063770064],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997857,0.000027127051,0.000009493791,0.000043427524,0.00010915897,0.00002503278],"domain_scores_gemma":[0.9995503,0.00007479169,0.00008429483,0.00020536993,0.00005536827,0.000029854076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031418414,0.00050444534,0.00031922487,0.0005094898,0.00023430733,0.00066479476,0.0006015595,0.0006493612,0.001304562],"category_scores_gemma":[0.0012457424,0.00021313554,0.00037897192,0.00040079156,0.0007522581,0.0015792127,0.001287243,0.00071718585,0.00062981504],"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.00030999372,0.00008189425,0.00070964126,0.00013968663,0.000033405297,0.0003590288,0.00025804175,0.033717524,0.4710328,0.039911997,0.0026889849,0.4507569],"study_design_scores_gemma":[0.000064371736,0.0004413701,0.0011535934,0.00006060686,0.000049170885,0.0015805986,0.00015781571,0.50425166,0.4348592,0.02594353,0.031338714,0.000099314],"about_ca_topic_score_codex":0.00040224224,"about_ca_topic_score_gemma":0.00053949765,"teacher_disagreement_score":0.001304562,"about_ca_system_score_codex":0.00020455194,"about_ca_system_score_gemma":0.00027856906,"threshold_uncertainty_score":0.0043641925},"labels":[],"label_agreement":null},{"id":"W7083285335","doi":"10.1109/tifs.2025.3614468","title":"Precoding Design for Key Generation in Extremely Large-Scale MIMO Near-Field Multi-User Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Geochemistry and Geologic Mapping","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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China Stem Cell and Translational Research; Engineering and Physical Sciences Research Council; Department for the Economy; Canada Excellence Research Chairs, Government of Canada; National Natural Science Foundation of China; Queen's University Belfast; Natural Sciences and Engineering Research Council of Canada; Queen's University; European Commission","keywords":"Eavesdropping; Precoding; Artificial noise; Key generation; Randomness; Key (lock); Base station; Physical layer; Noise (video); MIMO","score_opus":0.025641121143042508,"score_gpt":0.24062837174232815,"score_spread":0.21498725059928564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083285335","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.005567988,0.00014318184,0.9928773,0.000057887006,0.000019109071,0.000018824729,0.000010983531,0.000042329353,0.0012623799],"genre_scores_gemma":[0.67597127,0.00075689255,0.3194274,0.00014240686,0.00007859602,0.00019994889,0.0000746413,0.000034947992,0.0033139335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950206,0.00017574154,0.000023672426,0.00008526841,0.00017026487,0.000042920896],"domain_scores_gemma":[0.9995222,0.00020669673,0.00008391789,0.000050818402,0.00011762644,0.000018747178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907479,0.00054799614,0.00038907386,0.00021785081,0.00027206042,0.00056914246,0.0004945099,0.0005582479,0.0011668836],"category_scores_gemma":[0.0014544305,0.00025105535,0.00025508908,0.0003744192,0.0005644315,0.00078485964,0.00062389474,0.0005388288,0.00044602697],"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.000117430725,0.000052429892,0.00053202774,0.0002336358,0.000049586535,0.00017491754,0.0001956172,0.7768097,0.04591861,0.0739498,0.0015135319,0.1004527],"study_design_scores_gemma":[0.000009968008,0.00007774032,0.00009706416,0.000010136305,0.000006611715,0.000060430986,0.00001831807,0.9894293,0.0036161917,0.005263764,0.0013993111,0.000011190149],"about_ca_topic_score_codex":0.0005645598,"about_ca_topic_score_gemma":0.00070123485,"teacher_disagreement_score":0.0011668836,"about_ca_system_score_codex":0.00042444293,"about_ca_system_score_gemma":0.00056459184,"threshold_uncertainty_score":0.0039036274},"labels":[],"label_agreement":null},{"id":"W7092205663","doi":"10.1109/tifs.2025.3622317","title":"Polar-Domain Multi-User Key Generation in Near-Field Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Department for the Economy","keywords":"Telecommunications link; Precoding; Channel state information; Decorrelation; MIMO; Base station; Channel (broadcasting); Key generation; Physical layer; Overhead (engineering)","score_opus":0.014276607840664474,"score_gpt":0.2513515399323341,"score_spread":0.23707493209166963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092205663","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.014512284,0.0010298443,0.97952193,0.00022703737,0.00006207436,0.000032215426,0.00005722814,0.00018801178,0.004369375],"genre_scores_gemma":[0.8136346,0.00202576,0.18000866,0.00023444796,0.00009754157,0.00009250722,0.00012084448,0.000049759525,0.0037359106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994504,0.00021513825,0.000020627398,0.0000836001,0.00016359928,0.00006669231],"domain_scores_gemma":[0.999311,0.0003579195,0.00008074711,0.00012431288,0.00010207644,0.000023881094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008789825,0.0005235266,0.0004489592,0.0002787157,0.00032599666,0.00077530375,0.0006269846,0.00069009117,0.0016295555],"category_scores_gemma":[0.0018260715,0.00030562386,0.00028390205,0.0005872773,0.00087396585,0.0015733638,0.0009541838,0.0009723628,0.0005820597],"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.0002556312,0.00008527705,0.0009959745,0.0003268301,0.000039492435,0.00032692705,0.00017958881,0.6529099,0.026292786,0.17157982,0.0032900996,0.14371768],"study_design_scores_gemma":[0.000008347197,0.000060905062,0.00013259584,0.000022515862,0.0000071620975,0.0001148499,0.000027375696,0.9712242,0.00581877,0.019641586,0.0029245138,0.000017196533],"about_ca_topic_score_codex":0.00087673654,"about_ca_topic_score_gemma":0.001299308,"teacher_disagreement_score":0.0016295555,"about_ca_system_score_codex":0.00060858787,"about_ca_system_score_gemma":0.00079857465,"threshold_uncertainty_score":0.005451441},"labels":[],"label_agreement":null},{"id":"W7108688089","doi":"10.1109/tifs.2025.3640828","title":"PUL-Inter-Slice Defender: An Anomaly Detection Solution for Distributed Slice Mobility Attacks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Software-Defined Networks and 5G","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":"Ericsson (Canada); Concordia University","funders":"Concordia University","keywords":"Testbed; Anomaly detection; Denial-of-service attack; Robustness (evolution); Quality of service; Key (lock); Server; Network security","score_opus":0.013267122848174792,"score_gpt":0.24907198604662614,"score_spread":0.23580486319845134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108688089","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.08025639,0.00038083186,0.90621126,0.00043634576,0.0001488682,0.00011157222,0.00015754897,0.01083518,0.0014621001],"genre_scores_gemma":[0.8307278,0.00013386393,0.16541615,0.0004943045,0.00008392144,0.00009998609,0.0005561825,0.00026218864,0.002225665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988813,0.00025548952,0.000063210355,0.00035091356,0.00031005437,0.00013900796],"domain_scores_gemma":[0.9977435,0.00077235,0.0003093349,0.00057332666,0.00048030977,0.00012118535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015697852,0.0011279689,0.0009660752,0.00067961746,0.00052575447,0.0007652277,0.00194925,0.0012503339,0.00072544493],"category_scores_gemma":[0.0046391236,0.00030833308,0.00066584663,0.00032430288,0.00077086117,0.0017683888,0.0018708424,0.0019090044,0.0005038067],"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.00077289855,0.00067267753,0.017808815,0.00014814833,0.00029218677,0.0003668419,0.00029647604,0.32930806,0.037870914,0.007259311,0.009790504,0.59541315],"study_design_scores_gemma":[0.000020484067,0.00019193103,0.00104012,0.000008131635,0.000022239017,0.0001233471,0.000030534447,0.9858278,0.009088515,0.0022923257,0.0013371278,0.00001736369],"about_ca_topic_score_codex":0.0015892015,"about_ca_topic_score_gemma":0.0021995616,"teacher_disagreement_score":0.00194925,"about_ca_system_score_codex":0.000602448,"about_ca_system_score_gemma":0.0009371802,"threshold_uncertainty_score":0.008301973},"labels":[],"label_agreement":null}]}