{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33801797,0.000015710886,0.6580382,0.000093945164,0.0003440712,0.0025016384,0.00010336605,0.0005220127,0.00036312517],"genre_scores_gemma":[0.99521506,0.000036568832,0.0027819746,0.00009719167,0.000026620168,0.0017183222,0.00007226793,0.000030813804,0.000021194344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986845,0.000056024783,0.00057562796,0.00013798526,0.00025731127,0.00028851148],"domain_scores_gemma":[0.99875647,0.00007804605,0.00012258322,0.0005177502,0.0002827715,0.00024239188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030032522,0.00026347867,0.00024760864,0.00021372744,0.0002883838,0.00019005575,0.0002078419,0.00019727908,0.000021252348],"category_scores_gemma":[0.00001111188,0.00027472267,0.00008321052,0.00036501884,0.00009827493,0.0013860586,0.0000056033064,0.00052278663,0.00007658552],"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.00014414535,0.000094705574,0.000011106293,0.00031766188,0.00009819239,0.0000015203392,0.0056783915,0.8129994,0.0018760181,0.0019704916,0.0007689767,0.17603935],"study_design_scores_gemma":[0.0010932455,0.00011413572,0.00006121122,0.00005377474,0.000024618827,0.00002841353,0.000420101,0.9887536,0.004823023,0.00010010646,0.0041997056,0.0003280591],"about_ca_topic_score_codex":0.000095374584,"about_ca_topic_score_gemma":0.0001727233,"teacher_disagreement_score":0.65719706,"about_ca_system_score_codex":0.00016908688,"about_ca_system_score_gemma":0.00006687373,"threshold_uncertainty_score":0.9999705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024025923,0.000011243333,0.97446483,0.00006236214,0.00018315572,0.00017902887,0.00002200211,0.000122055186,0.0009294243],"genre_scores_gemma":[0.98462725,0.0000699911,0.015231482,0.00003019293,0.0000055025153,0.000025221567,0.0000055261817,0.0000030350072,0.0000017942898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920386,0.000035056764,0.00034119433,0.000115124945,0.00017548067,0.00012929621],"domain_scores_gemma":[0.99941057,0.000025110578,0.00012048358,0.00022066523,0.00015447655,0.00006870947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021309363,0.00010649188,0.0001268354,0.0004395184,0.00008914089,0.000082735445,0.00014146072,0.00007052782,7.8039443e-7],"category_scores_gemma":[0.0000033878548,0.00010549978,0.000054151857,0.00048028206,0.00007484095,0.0019204604,0.000003994943,0.00015958292,0.0000011313549],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026806362,0.00038818788,0.00037452788,0.0002525525,0.000052701387,0.0000034871337,0.028333586,0.030787896,0.0004824228,0.044743005,0.00014124646,0.8941723],"study_design_scores_gemma":[0.00217813,0.00070557155,0.0025798145,0.00014681804,0.00002464807,0.000037219736,0.001117189,0.82327145,0.04198814,0.12565672,0.001627685,0.0006665967],"about_ca_topic_score_codex":0.00019440307,"about_ca_topic_score_gemma":0.00027299425,"teacher_disagreement_score":0.96060133,"about_ca_system_score_codex":0.000024705969,"about_ca_system_score_gemma":0.000029537785,"threshold_uncertainty_score":0.4302156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009068251,0.00002900958,0.9873634,0.00067623745,0.00018345732,0.00022505992,0.00003695883,0.000075582815,0.0023420437],"genre_scores_gemma":[0.95312095,0.000012073617,0.04651445,0.00024436132,0.00003623083,0.000016873975,0.000011626683,0.0000060016323,0.000037420115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990422,0.00000894697,0.0003884886,0.00014394139,0.00021389617,0.0002025194],"domain_scores_gemma":[0.99948263,0.000042277483,0.000095836425,0.0001715967,0.00015685042,0.000050793504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021306613,0.00014649713,0.00018375592,0.00014173824,0.00032986156,0.00015840451,0.0001520644,0.0001487218,0.000004525579],"category_scores_gemma":[0.0000032040198,0.00013324188,0.00011336851,0.00018637735,0.000042933276,0.0013343683,0.000002279703,0.00022126341,0.0000014760967],"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.00008175605,0.00009570728,0.000007475123,0.000499308,0.00006148347,7.004745e-7,0.008324766,0.115212604,0.00042211113,0.029536149,0.00153701,0.84422094],"study_design_scores_gemma":[0.0003215016,0.00005103367,0.000012444458,0.00006102236,0.000018780487,0.0000091503025,0.000059380833,0.9694785,0.009521623,0.019065388,0.0012272011,0.000173978],"about_ca_topic_score_codex":0.000034274955,"about_ca_topic_score_gemma":0.000023230214,"teacher_disagreement_score":0.9440527,"about_ca_system_score_codex":0.000020119465,"about_ca_system_score_gemma":0.000045089848,"threshold_uncertainty_score":0.54334456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4485955,0.0000038844105,0.550703,0.00006503478,0.0001945128,0.00036977962,0.0000025754111,0.00003514914,0.00003058579],"genre_scores_gemma":[0.9989582,0.00004469249,0.00082763843,0.00009390144,0.000016205355,0.000050560597,0.0000031403354,0.0000036659694,0.0000020283724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901813,0.000058732752,0.00041694773,0.00014855948,0.00021228332,0.0001453464],"domain_scores_gemma":[0.9994779,0.000034359673,0.00016248718,0.00012913824,0.00014568673,0.00005039419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021221353,0.00012356363,0.00016063458,0.00025712413,0.00025078357,0.00012870764,0.00009046519,0.000118652686,0.000006328308],"category_scores_gemma":[0.000003369415,0.000119505,0.000030175612,0.0004597611,0.00004003234,0.0019114172,0.000006897979,0.00027707728,0.0000022698255],"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.00010173173,0.00063012406,0.000036754092,0.000068452675,0.00003854117,8.748451e-7,0.027220797,0.010371846,0.00017447058,0.011143944,0.000035233,0.95017725],"study_design_scores_gemma":[0.0012261744,0.0007797971,0.0032941161,0.000023402856,0.000012420624,0.000012827765,0.001854407,0.97607255,0.0016692156,0.014820882,0.000043636464,0.00019054636],"about_ca_topic_score_codex":0.00027438527,"about_ca_topic_score_gemma":0.0008629135,"teacher_disagreement_score":0.96570075,"about_ca_system_score_codex":0.000034943794,"about_ca_system_score_gemma":0.000012169006,"threshold_uncertainty_score":0.48732725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013626429,0.0000067995206,0.98333305,0.00049369194,0.00017671828,0.00034568488,0.000018912433,0.0003438934,0.0016547897],"genre_scores_gemma":[0.9586158,0.00004104927,0.04019571,0.0010614668,0.000014995444,0.000038846334,0.00001029007,0.0000070670126,0.000014791761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.000025795805,0.00029627632,0.00017897405,0.00026634207,0.00023013618],"domain_scores_gemma":[0.9991853,0.00010085821,0.000086129585,0.00034513412,0.00016532636,0.00011721195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011180273,0.00018583155,0.00016316841,0.00020241343,0.00030438366,0.00037548627,0.00022779636,0.00008244482,0.00005294087],"category_scores_gemma":[0.0000075229013,0.00016811029,0.00008483039,0.00027308654,0.00007958749,0.0034586133,0.000004478715,0.00027599072,0.000061299885],"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.00044446113,0.0011083221,0.00007879629,0.0007356841,0.00015388516,0.00002878753,0.012816058,0.061683208,0.015965568,0.033658978,0.01776965,0.8555566],"study_design_scores_gemma":[0.00053873204,0.00029943784,0.0001449995,0.00004796724,0.0000062215,0.000005329936,0.00007581087,0.88715,0.10278087,0.0076103867,0.0010995035,0.00024073238],"about_ca_topic_score_codex":0.000032369022,"about_ca_topic_score_gemma":0.0000014485587,"teacher_disagreement_score":0.9449893,"about_ca_system_score_codex":0.00004145771,"about_ca_system_score_gemma":0.00003123434,"threshold_uncertainty_score":0.6855339},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020871738,0.00000555558,0.98467696,0.000256211,0.00010923325,0.011978742,0.000028073127,0.00024320316,0.0006148349],"genre_scores_gemma":[0.9638114,0.00011294175,0.018080879,0.00022811693,0.00003540478,0.01768676,0.000020102743,0.000018750741,0.0000056687686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.000068970156,0.00037961852,0.00010979864,0.00015061723,0.00018691925],"domain_scores_gemma":[0.9991137,0.00029062363,0.000080809856,0.00022271079,0.00019661362,0.00009558674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269611,0.00018909942,0.00019583678,0.000103152466,0.00028534574,0.00018022498,0.0000671623,0.00013391324,0.000008338768],"category_scores_gemma":[0.000011597433,0.00018463666,0.000038331993,0.00011834035,0.00009887494,0.00080397713,0.0000034795705,0.00026915068,0.000004654855],"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.0014370392,0.0005614344,0.00006496989,0.0025116685,0.00064640766,0.0000016100856,0.05023047,0.10732317,0.00086223794,0.22922847,0.025059808,0.58207273],"study_design_scores_gemma":[0.0010014229,0.0003072423,0.000016456315,0.00006908183,0.000024253533,0.00001071647,0.00021005305,0.91103745,0.019782167,0.0044163857,0.06282557,0.00029922026],"about_ca_topic_score_codex":0.0000075989474,"about_ca_topic_score_gemma":0.000023104589,"teacher_disagreement_score":0.96659607,"about_ca_system_score_codex":0.000043729833,"about_ca_system_score_gemma":0.000022303182,"threshold_uncertainty_score":0.75292647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020421881,0.0000055641026,0.9776477,0.00014131548,0.0011306236,0.00037365608,0.000022506556,0.00016594407,0.0000908066],"genre_scores_gemma":[0.9633076,0.000071982744,0.036142573,0.00032001376,0.0000727466,0.000057087418,0.000013998792,0.000009669114,0.0000043236405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987147,0.00006605574,0.00044473808,0.00024613107,0.0002109225,0.00031746607],"domain_scores_gemma":[0.9990078,0.00025056448,0.00015527618,0.00029222268,0.00016599176,0.0001281314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040522206,0.00020254421,0.00021892789,0.00023274474,0.0002916591,0.00030295615,0.00016481854,0.0002578799,0.0000053832077],"category_scores_gemma":[0.00001783207,0.00020030525,0.00009926468,0.0005017009,0.000079422745,0.00090663787,0.0000054770394,0.00043547587,0.0000070343076],"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.000121756646,0.000050977662,0.0000032751022,0.000042385556,0.000014094821,4.931278e-7,0.00086686714,0.4317817,0.0000054085726,0.055986885,0.000024105178,0.5111021],"study_design_scores_gemma":[0.0006904981,0.00025416396,0.000039899518,0.000050232924,0.0000101993355,0.000018247816,0.00010451308,0.9809305,0.0010536091,0.01569831,0.00092076795,0.00022902635],"about_ca_topic_score_codex":0.000020747864,"about_ca_topic_score_gemma":0.000033564487,"teacher_disagreement_score":0.9428857,"about_ca_system_score_codex":0.000066872126,"about_ca_system_score_gemma":0.00001611683,"threshold_uncertainty_score":0.8168211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847995,0.0000064466153,0.6704739,0.000029625213,0.00016128033,0.000086880646,0.0002679284,0.00008295195,0.00041105066],"genre_scores_gemma":[0.99854475,0.000012158073,0.001119795,0.000053436233,0.000007757286,0.0000059927743,0.00024875675,0.00000546727,0.000001904274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999394,0.000013196228,0.00025474353,0.000073472766,0.00017844343,0.0000861547],"domain_scores_gemma":[0.999409,0.000016388902,0.000047865346,0.00028766718,0.00013566228,0.00010338019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001686388,0.000086026324,0.00010761318,0.00018800363,0.000046656754,0.00005075093,0.000099496385,0.000055335324,0.000034879107],"category_scores_gemma":[0.0000039087768,0.000083038736,0.00003290617,0.00018859157,0.00003684412,0.0005358075,9.540245e-7,0.000090394664,0.000020327949],"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.00008364724,0.00032314946,0.00006736379,0.0002949028,0.00017117825,4.5122036e-7,0.0067981547,0.8486004,0.00045335857,0.00079597806,0.0010757012,0.14133576],"study_design_scores_gemma":[0.0004183528,0.000048573598,0.00012866434,0.000012170273,0.000047466474,0.0000010013118,0.00029508927,0.99276435,0.005247248,0.00021724991,0.0007201159,0.000099712335],"about_ca_topic_score_codex":0.000016565258,"about_ca_topic_score_gemma":0.000014666326,"teacher_disagreement_score":0.6700648,"about_ca_system_score_codex":0.000019821082,"about_ca_system_score_gemma":0.000017717473,"threshold_uncertainty_score":0.33862215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075826077,0.000026998858,0.9906354,0.0005495916,0.00019072914,0.00017536555,0.000032255048,0.00015956193,0.0006474961],"genre_scores_gemma":[0.9739828,0.00004764822,0.024182398,0.0017369258,0.0000195256,0.000009148706,0.00000683047,0.0000053604585,0.000009349915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992059,0.00002947391,0.00018476282,0.00012959492,0.00022623541,0.00022404644],"domain_scores_gemma":[0.9993918,0.00008488662,0.00007011561,0.00020401046,0.00010141869,0.00014778561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002175922,0.00015665231,0.00013532155,0.00013636176,0.00028333653,0.00019701294,0.000113238755,0.000105405816,0.000013643137],"category_scores_gemma":[0.0000110000865,0.000138393,0.000049837283,0.00015908046,0.00012299279,0.0036153079,0.0000048408083,0.0003238137,0.000015646843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009884798,0.00010203114,0.00003775761,0.00006724671,0.000014994035,0.0000017835858,0.0065603876,0.00011218848,0.00009475358,0.014414498,0.0012447023,0.9772508],"study_design_scores_gemma":[0.0025351555,0.0011078531,0.0024443262,0.00020773293,0.000043974935,0.00009880345,0.0010603595,0.89664334,0.059448026,0.010892129,0.02444964,0.0010686723],"about_ca_topic_score_codex":0.00000676457,"about_ca_topic_score_gemma":0.0000028619088,"teacher_disagreement_score":0.97618216,"about_ca_system_score_codex":0.000037649977,"about_ca_system_score_gemma":0.000018813942,"threshold_uncertainty_score":0.5643503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18243387,0.000004160142,0.8148309,0.00027561368,0.0006275317,0.00051375467,0.00012439594,0.00010822388,0.0010815252],"genre_scores_gemma":[0.99760324,0.00008205198,0.0014736047,0.0006711098,0.000034083514,0.00003829488,0.000008609031,0.00001564912,0.00007333807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857587,0.000048687423,0.00045189564,0.00023427368,0.00037486025,0.0003144098],"domain_scores_gemma":[0.998919,0.00031706257,0.00012562929,0.0002746372,0.0001578917,0.00020578167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036266245,0.00019154215,0.00018773208,0.00044555822,0.00045828224,0.00014813841,0.0001348344,0.0001545773,0.000020956139],"category_scores_gemma":[0.00018297334,0.00018639289,0.00009922981,0.0005923118,0.000118882985,0.00042368876,0.000002817757,0.00025011774,0.000031954583],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000977086,0.0007993051,0.00006172193,0.001704618,0.000066325374,0.0000026032756,0.024408912,0.045110635,0.08648355,0.02571906,0.004260121,0.810406],"study_design_scores_gemma":[0.0022072045,0.0007336857,0.00023377748,0.000066464214,0.00006794517,0.000028310662,0.00024963001,0.5321773,0.3388911,0.0060359538,0.118734874,0.00057373085],"about_ca_topic_score_codex":0.000015055002,"about_ca_topic_score_gemma":0.0000060588586,"teacher_disagreement_score":0.8151694,"about_ca_system_score_codex":0.00005327542,"about_ca_system_score_gemma":0.000043647113,"threshold_uncertainty_score":0.76008815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026248232,0.000009477567,0.9694307,0.0011831648,0.0002994979,0.00021739732,0.000257413,0.00033360822,0.0020205514],"genre_scores_gemma":[0.98555684,0.000038621645,0.013634626,0.00054913014,0.000028565973,0.000015235179,0.00016036449,0.0000055781197,0.000011009418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989705,0.000024014775,0.0003467923,0.00020670387,0.00028531207,0.00016665233],"domain_scores_gemma":[0.9987986,0.00019489812,0.00013532773,0.0006689627,0.00009320646,0.00010897429],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001650722,0.00014054649,0.0001282558,0.00013513268,0.00019186079,0.0010767687,0.0004951072,0.000100139194,0.00005970083],"category_scores_gemma":[0.000016481123,0.00013377723,0.00003655914,0.00018280704,0.000051838193,0.011072401,0.000018343442,0.0002865834,0.00019487664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019265171,0.00013683292,0.000068767185,0.000021271164,0.00007514941,0.0000017166535,0.021835199,0.00015217537,0.000052720035,0.047588564,0.008121959,0.9219264],"study_design_scores_gemma":[0.00086286006,0.00014138328,0.0013033856,0.00005665371,0.000023845667,0.000030364024,0.0009629471,0.74853235,0.008550001,0.22365017,0.015155136,0.0007308652],"about_ca_topic_score_codex":0.0002844009,"about_ca_topic_score_gemma":0.000075996206,"teacher_disagreement_score":0.9593086,"about_ca_system_score_codex":0.000023442251,"about_ca_system_score_gemma":0.00003913236,"threshold_uncertainty_score":0.9999602},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7979228,0.00006904637,0.19993846,0.00023860666,0.0005154761,0.00022819533,0.000034214278,0.00007853706,0.00097465067],"genre_scores_gemma":[0.99905837,0.00012244035,0.00048370118,0.00019282439,0.000048790145,0.000011167354,0.000014976521,0.0000061874084,0.000061568295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990492,0.000039911036,0.0002839636,0.00013012932,0.0003617638,0.00013506555],"domain_scores_gemma":[0.99925065,0.0001544736,0.000106900836,0.00017091921,0.00018491117,0.00013213328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039824742,0.00013136707,0.00020764557,0.00043762516,0.00029333244,0.00009416412,0.000030963736,0.000114707116,0.000010157803],"category_scores_gemma":[0.00005521619,0.0001041766,0.000054727076,0.00040702528,0.000043323893,0.0003110365,0.0000014070706,0.00026785806,0.00001616407],"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.0008287045,0.00048406617,0.0040338743,0.0021697707,0.00061780075,0.0000073255665,0.007725321,0.009410649,0.0019168427,0.006929778,0.0011900562,0.9646858],"study_design_scores_gemma":[0.0026358229,0.0018402333,0.0039046325,0.0007108735,0.00043924394,0.00010683124,0.0016080177,0.98194736,0.0032842346,0.0016048516,0.0015015478,0.0004163702],"about_ca_topic_score_codex":0.00007876953,"about_ca_topic_score_gemma":0.0000027773197,"teacher_disagreement_score":0.9725367,"about_ca_system_score_codex":0.00003621066,"about_ca_system_score_gemma":0.000023562214,"threshold_uncertainty_score":0.42481986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13433802,0.000017521466,0.8639073,0.0001208333,0.00085539895,0.00027382257,0.000027907701,0.00012879686,0.00033038878],"genre_scores_gemma":[0.9892306,0.000014960654,0.010163029,0.0004456834,0.000090165086,0.000017684028,0.000021880494,0.000008895211,0.0000071449826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859756,0.00007589156,0.00040193612,0.00022474547,0.00044005865,0.00025983283],"domain_scores_gemma":[0.9989169,0.000046265683,0.00018817626,0.0002352873,0.00042096493,0.00019237617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004421241,0.00020723243,0.00018304058,0.00032032203,0.00033170453,0.00037045506,0.00015952867,0.00012459114,0.000012835157],"category_scores_gemma":[0.000017058335,0.00021289602,0.00007207056,0.0005101927,0.000056624285,0.004365444,0.0000049989317,0.00026710707,0.000025576282],"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.00011739433,0.00023093763,0.000058198155,0.0001590506,0.00018722667,0.000010742118,0.073039494,0.81266564,0.015447209,0.050235227,0.001527608,0.046321265],"study_design_scores_gemma":[0.0006656565,0.00018386068,0.000018592118,0.000027223512,0.000019661684,0.000032714554,0.00011219071,0.9589386,0.02582781,0.013765454,0.00014603404,0.00026221515],"about_ca_topic_score_codex":0.00018563686,"about_ca_topic_score_gemma":0.000028575467,"teacher_disagreement_score":0.85489255,"about_ca_system_score_codex":0.0002504307,"about_ca_system_score_gemma":0.00015760055,"threshold_uncertainty_score":0.8681648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10783279,0.00001753707,0.8853587,0.00008194983,0.00020608869,0.00033897115,0.00008239229,0.00044739107,0.005634183],"genre_scores_gemma":[0.99389297,0.00018362743,0.005403345,0.00025301048,0.00002309266,0.00007758225,0.00014800295,0.000014278285,0.000004072298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989276,0.000021324511,0.0004346092,0.00007890527,0.0003559051,0.00018168491],"domain_scores_gemma":[0.99909896,0.000020889136,0.00009535324,0.0003437661,0.000290373,0.00015065033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020840294,0.00020977734,0.00017480405,0.00025678403,0.00015751563,0.00021245868,0.00012052953,0.00015965887,0.000006925761],"category_scores_gemma":[0.0000033824774,0.00020283557,0.00004051628,0.00024290326,0.000070573195,0.005735985,0.0000031983602,0.0003239173,0.000029745124],"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.00013007708,0.00006880086,0.000027856273,0.0001786368,0.0001685548,8.5393157e-7,0.047402993,0.85335857,0.00013856588,0.024905683,0.00871171,0.06490772],"study_design_scores_gemma":[0.0007698106,0.00011692959,0.000053680753,0.00002687739,0.000025899202,0.000016765958,0.00039945415,0.98463553,0.006010013,0.0028670072,0.004783471,0.0002945565],"about_ca_topic_score_codex":0.00008113355,"about_ca_topic_score_gemma":0.0001347783,"teacher_disagreement_score":0.8860602,"about_ca_system_score_codex":0.00012082173,"about_ca_system_score_gemma":0.00004888605,"threshold_uncertainty_score":0.82713944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21246244,0.0000029050511,0.78677964,0.00005846222,0.00040279707,0.0001156498,0.000009061206,0.00008839878,0.000080641505],"genre_scores_gemma":[0.9867697,0.000005083481,0.01306313,0.00012574682,0.000017573779,0.000007980464,0.0000041044386,0.000004236877,0.0000024390833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991201,0.000029122535,0.00034254557,0.00016215375,0.00020063012,0.0001454054],"domain_scores_gemma":[0.99928206,0.00004929959,0.0001648283,0.00020683333,0.00020827197,0.000088708766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031199522,0.00012784087,0.00015013255,0.00022641332,0.00051277614,0.0004211951,0.00009257639,0.0001063148,0.0000027958697],"category_scores_gemma":[0.000010004371,0.00012227685,0.000060659688,0.00027675065,0.00005143492,0.0014572508,0.000003768337,0.00024760954,0.0000034439397],"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.00013839146,0.00015627523,0.001121846,0.00068571867,0.00019710389,0.000004535835,0.0089524845,0.11952658,0.027036006,0.060596522,0.00002698654,0.78155756],"study_design_scores_gemma":[0.00037696015,0.00003844903,0.00016107113,0.000026767728,0.000025083456,0.000017481854,0.00029471648,0.9771056,0.021557668,0.00013323312,0.00012558707,0.00013738172],"about_ca_topic_score_codex":0.00017751355,"about_ca_topic_score_gemma":0.00024299155,"teacher_disagreement_score":0.857579,"about_ca_system_score_codex":0.00003420517,"about_ca_system_score_gemma":0.00003245504,"threshold_uncertainty_score":0.4986305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75151104,0.000023276238,0.24671105,0.0000028535565,0.000231484,0.00018337608,0.000058621135,0.00010044222,0.001177841],"genre_scores_gemma":[0.9994951,0.000052319232,0.00040790334,0.0000062811323,0.0000014525673,0.000023343462,0.0000075729863,0.0000042381353,0.0000017760484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993902,0.0000074092536,0.00034545484,0.000057272307,0.00009160717,0.000108055734],"domain_scores_gemma":[0.9997071,0.000018213328,0.000054580436,0.00014424764,0.000051164065,0.000024693783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009114048,0.00008692135,0.0001776985,0.0005011084,0.000032594755,0.000009429128,0.000052715146,0.00008584168,0.000013279707],"category_scores_gemma":[0.00000295397,0.000090916416,0.000039197428,0.0005714201,0.00004897865,0.00036847297,7.680334e-7,0.00014026366,0.0000032762825],"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.000030674062,0.000070291,0.0015414436,0.0003468316,0.0005767487,0.0000011802656,0.007908885,0.9728973,0.000046690773,0.0067858356,0.00002541645,0.009768698],"study_design_scores_gemma":[0.0003684983,0.000050125644,0.0027171264,0.000039075174,0.00017705372,0.0000023299651,0.00041011663,0.99299335,0.0019406794,0.0009608107,0.00019703788,0.00014380092],"about_ca_topic_score_codex":0.000046603353,"about_ca_topic_score_gemma":0.00012299378,"teacher_disagreement_score":0.24798405,"about_ca_system_score_codex":0.000040820345,"about_ca_system_score_gemma":0.000004998611,"threshold_uncertainty_score":0.37074637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2187177,0.000030083562,0.78050303,0.00020027213,0.00012740586,0.00012848589,0.000065304266,0.00008050241,0.00014725016],"genre_scores_gemma":[0.9905062,0.00015451475,0.00888391,0.00040920044,0.0000063266875,0.0000029290982,0.000017395298,0.000002034249,0.000017510063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.00002325757,0.0003631096,0.00020900824,0.00032222463,0.0001779395],"domain_scores_gemma":[0.9991794,0.000031841886,0.00013518818,0.00032864886,0.00019015258,0.00013472736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110288,0.00015403227,0.00020294145,0.001665794,0.00034763743,0.0003694315,0.00019432706,0.00012355161,0.0000067588453],"category_scores_gemma":[0.0000061736796,0.00014048793,0.00007626074,0.0034071126,0.000048349226,0.0018950037,0.0000034876568,0.00019725588,0.00000598712],"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.000058127323,0.00015746738,0.00036617546,0.0001699897,0.00030098963,8.713232e-7,0.010244178,0.022775901,0.000106624735,0.056089774,0.0003241141,0.90940577],"study_design_scores_gemma":[0.0003232619,0.000083714156,0.00524589,0.000004822841,0.00006396787,0.000008169312,0.00003849787,0.9902377,0.0011003703,0.0023902846,0.00032567966,0.00017763105],"about_ca_topic_score_codex":0.000016795666,"about_ca_topic_score_gemma":0.000009745016,"teacher_disagreement_score":0.9674618,"about_ca_system_score_codex":0.00003723614,"about_ca_system_score_gemma":0.00002761782,"threshold_uncertainty_score":0.57289314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021756876,0.0000122169395,0.9963638,0.000107924745,0.00035835098,0.00025572005,0.00010339248,0.0002213873,0.00040147832],"genre_scores_gemma":[0.9302107,0.000087257635,0.069494076,0.00013392197,0.000012534674,0.000021039135,0.000029926146,0.000004795494,0.0000057131897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992611,0.00001389082,0.0002561942,0.00018706596,0.000113664595,0.00016809773],"domain_scores_gemma":[0.9993029,0.00006898418,0.00010896102,0.00039448525,0.00005871751,0.00006591144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021141222,0.00012699713,0.00011817712,0.0001703279,0.00040453294,0.0001255877,0.00027104406,0.00008002439,0.000002884932],"category_scores_gemma":[0.000004536077,0.000121092875,0.000040007082,0.00015140163,0.000059223585,0.003173383,0.000013161368,0.00015156908,0.0000017716416],"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.00022271917,0.00013794473,0.0005324151,0.00032030558,0.0001555151,0.0000032325017,0.033949085,0.0011280619,0.000022135924,0.45206508,0.0012131871,0.51025033],"study_design_scores_gemma":[0.00038050796,0.00014787185,0.000115511895,0.000053854987,0.000022496883,0.000024412238,0.00014486481,0.8716958,0.00411183,0.12010903,0.0029406047,0.0002531743],"about_ca_topic_score_codex":0.000029835453,"about_ca_topic_score_gemma":0.000014833023,"teacher_disagreement_score":0.9280351,"about_ca_system_score_codex":0.000013653533,"about_ca_system_score_gemma":0.000015597463,"threshold_uncertainty_score":0.49380243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002224027,0.0000063844464,0.98377544,0.0011681849,0.00213598,0.0010259722,0.00021826057,0.00020195644,0.009243789],"genre_scores_gemma":[0.9642912,0.0000110719375,0.02657883,0.0076691913,0.0000773609,0.00052154606,0.00013786826,0.000018317925,0.0006946215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863935,0.000048303507,0.000641316,0.0001684794,0.00019638777,0.00030617224],"domain_scores_gemma":[0.99855757,0.00032283113,0.00025261324,0.0002867279,0.00034968057,0.00023058661],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026729863,0.00022548706,0.00024259728,0.0003736266,0.00027459805,0.00017267985,0.000104862615,0.00027435838,0.002255471],"category_scores_gemma":[0.000027949201,0.00021748587,0.00015013403,0.00028157968,0.00009154565,0.0014439847,0.0000012648954,0.00028138218,0.001066728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031484186,0.000100942656,0.000034562425,0.000053994412,0.000088478555,2.1619765e-7,0.0063285334,0.00054133486,0.000039644634,0.018700328,0.09742798,0.8763691],"study_design_scores_gemma":[0.017925909,0.0027016483,0.004720088,0.00006219248,0.00019234623,0.00013972723,0.0057585817,0.17609333,0.002660084,0.033817176,0.7545289,0.0014000334],"about_ca_topic_score_codex":0.0002762954,"about_ca_topic_score_gemma":0.000036059293,"teacher_disagreement_score":0.9620672,"about_ca_system_score_codex":0.00004739308,"about_ca_system_score_gemma":0.000060082068,"threshold_uncertainty_score":0.99971104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019549703,0.0000060076986,0.9718235,0.0005299272,0.00095466356,0.00027739597,0.0000355163,0.0003677462,0.0064555313],"genre_scores_gemma":[0.9931415,0.000018230492,0.0057863696,0.0009057665,0.00004056085,0.000010954279,0.000016480064,0.000009065018,0.00007112111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984255,0.000016853666,0.00047916305,0.0002676019,0.00046278938,0.00034808664],"domain_scores_gemma":[0.99883527,0.00007656953,0.00016886977,0.00045822785,0.00024788195,0.00021320368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015644137,0.00026765163,0.00022916259,0.0002858931,0.00027655656,0.00089136505,0.00027066347,0.00014022265,0.0000073168276],"category_scores_gemma":[0.000023257393,0.00026366557,0.00012372613,0.00046146882,0.00014535864,0.0062088147,0.000009030825,0.00035508798,0.00015264598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028047622,0.000042424723,0.00000314523,0.000013331823,0.0000159249,0.000002035935,0.0013862551,0.0002793258,0.000018489809,0.004812534,0.00036203623,0.99303645],"study_design_scores_gemma":[0.004838444,0.002655209,0.0017130051,0.00020896456,0.00009764924,0.0007395478,0.00058531837,0.5438828,0.040675987,0.33797464,0.06397186,0.0026566044],"about_ca_topic_score_codex":0.000008790739,"about_ca_topic_score_gemma":0.000009166758,"teacher_disagreement_score":0.99037987,"about_ca_system_score_codex":0.000079475656,"about_ca_system_score_gemma":0.000044573037,"threshold_uncertainty_score":0.9999816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006865959,0.000014060643,0.9917924,0.00012896697,0.00030405496,0.00037073673,0.00013927213,0.00028376465,0.00010082272],"genre_scores_gemma":[0.78230435,0.000028866078,0.2174117,0.00013264854,0.0000300056,0.00004050892,0.000045452183,0.000004919484,0.0000015200166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991552,0.00001955636,0.0002529146,0.00018300627,0.00011358643,0.00027573443],"domain_scores_gemma":[0.9989708,0.00007107686,0.00012546839,0.00064230605,0.000069280875,0.00012105875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033650736,0.00014351212,0.0001256978,0.00014762752,0.00040380185,0.00016760867,0.0004218613,0.00008081256,0.0000011675826],"category_scores_gemma":[0.000005902692,0.00013459027,0.000047756308,0.00017548609,0.000051208113,0.0070330505,0.000011103564,0.00016505043,0.0000017311994],"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.0002981326,0.000545683,0.00043084729,0.00032393626,0.00020421641,5.241197e-7,0.037561,0.00071657676,0.0030487247,0.22117211,0.0006684048,0.7350299],"study_design_scores_gemma":[0.00039034773,0.00014658549,0.000055722052,0.000022387281,0.0000125428805,0.0000089413315,0.00015830359,0.94034916,0.038592365,0.015600825,0.004405194,0.00025764914],"about_ca_topic_score_codex":0.000017180546,"about_ca_topic_score_gemma":0.0000064535852,"teacher_disagreement_score":0.93963253,"about_ca_system_score_codex":0.000024893929,"about_ca_system_score_gemma":0.000014131897,"threshold_uncertainty_score":0.5488432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096641015,0.0000024193582,0.9869659,0.00007105224,0.0004964529,0.00022283733,0.000018049514,0.00038668592,0.0021724848],"genre_scores_gemma":[0.94204503,0.000036690722,0.057606224,0.00024747328,0.000009141522,0.000031241685,0.000012825504,0.000006182106,0.000005165869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990764,0.000043918106,0.0002910182,0.0001860713,0.00020909547,0.00019348958],"domain_scores_gemma":[0.9993708,0.000031866493,0.000120697354,0.0002879487,0.000112660644,0.00007603908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571534,0.00016616532,0.00012185809,0.00032591334,0.00040168542,0.0001344334,0.00015879647,0.00008926085,0.0000062378617],"category_scores_gemma":[0.0000030395886,0.000149505,0.000082061204,0.000284094,0.00007136053,0.0019336084,0.0000033709086,0.00019600948,0.000007411618],"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.0007875874,0.001149636,0.0007801564,0.0004239817,0.00012634715,0.000018907473,0.04359681,0.030691948,0.0007202143,0.10617229,0.0008075247,0.8147246],"study_design_scores_gemma":[0.00067655905,0.00039973448,0.0012369875,0.00009540523,0.00001712505,0.000012963637,0.00007309953,0.9034263,0.08004187,0.012037766,0.0015824072,0.0003997814],"about_ca_topic_score_codex":0.000042204047,"about_ca_topic_score_gemma":0.0000138260675,"teacher_disagreement_score":0.932381,"about_ca_system_score_codex":0.000035227484,"about_ca_system_score_gemma":0.000011178205,"threshold_uncertainty_score":0.60966367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015444094,7.5974594e-7,0.9818631,0.0009692642,0.00043534,0.00034946293,0.00018960737,0.00032141706,0.0004269641],"genre_scores_gemma":[0.70626944,0.0000010546622,0.2928797,0.00064237666,0.000021912778,0.000117212956,0.000030835374,0.0000064693118,0.000030976695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892914,0.0000072322864,0.00030468867,0.00021133127,0.00029206325,0.00025552078],"domain_scores_gemma":[0.9988826,0.00011722028,0.00010272151,0.00036522586,0.00041720894,0.00011500342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039761496,0.00015937508,0.0001390047,0.00026648003,0.00045850876,0.00031279103,0.00030673918,0.00011506339,0.000018588162],"category_scores_gemma":[0.000042893123,0.00015677545,0.00010798028,0.00028104783,0.00004482296,0.0013091514,0.000008925266,0.0003426879,0.0000069636926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024407123,0.0002423459,0.00011264755,0.0004540658,0.00010066693,0.00000311048,0.015784575,0.0038371414,0.0028045597,0.19007464,0.014661606,0.7716806],"study_design_scores_gemma":[0.0008140178,0.00023916835,0.00014562163,0.000080231475,0.000013160837,0.0000125514935,0.00007082328,0.7133312,0.10481967,0.044309165,0.13558747,0.00057689624],"about_ca_topic_score_codex":0.000016571388,"about_ca_topic_score_gemma":0.000025530006,"teacher_disagreement_score":0.7711037,"about_ca_system_score_codex":0.000016649863,"about_ca_system_score_gemma":0.000029443348,"threshold_uncertainty_score":0.6393118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014214597,0.000028009601,0.98444283,0.000056917157,0.0006299855,0.00022002167,0.000012901563,0.00006591211,0.00032880096],"genre_scores_gemma":[0.9818826,0.000036730657,0.017931104,0.00009143729,0.000019981364,0.000015876378,0.000008073597,0.0000039485503,0.00001029965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895567,0.000050132003,0.00046051186,0.00011470609,0.00024827715,0.00017071805],"domain_scores_gemma":[0.9989806,0.00018746108,0.00022100359,0.00031960913,0.0002266919,0.00006467054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545317,0.00012285146,0.0001950555,0.00010285398,0.00022866648,0.00020506432,0.0003066497,0.00012037611,0.000010452053],"category_scores_gemma":[0.000009097809,0.00010979695,0.000073191826,0.00024408876,0.00007924983,0.0011490278,0.000006088034,0.0003414925,0.000009180454],"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.000034096207,0.000060664133,0.000030982785,0.000046485275,0.00010093262,2.7378434e-7,0.0032797463,0.5455962,0.000020757001,0.43512475,0.0010881209,0.014616983],"study_design_scores_gemma":[0.00021422342,0.00007792974,0.00002846402,0.000030308649,0.000021292812,0.0000089394425,0.000051168594,0.99741423,0.00016284501,0.0009773882,0.0009040054,0.00010919872],"about_ca_topic_score_codex":0.00007345411,"about_ca_topic_score_gemma":0.000100222656,"teacher_disagreement_score":0.96766794,"about_ca_system_score_codex":0.0000142387125,"about_ca_system_score_gemma":0.00003567148,"threshold_uncertainty_score":0.44773898},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0421803,0.00000781066,0.9553387,0.00028791546,0.00028985125,0.00015371988,0.000008156657,0.000053231117,0.0016803136],"genre_scores_gemma":[0.9991914,0.000026334837,0.00047813647,0.00027928874,0.000008731538,0.000005769784,0.0000036194986,0.0000022530212,0.000004487061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903,0.0000955205,0.0003177281,0.00012118428,0.0002817496,0.00015384324],"domain_scores_gemma":[0.9991041,0.00034807328,0.00012589854,0.00020438328,0.00016743976,0.000050152186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007206448,0.00012476556,0.00015481292,0.00010413667,0.00030308348,0.0001455867,0.00023290102,0.00006802111,0.0000026906487],"category_scores_gemma":[0.000011208167,0.00008787514,0.00011830886,0.00023951333,0.00006279764,0.00045133225,0.000001476677,0.00020711253,0.000008223345],"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.00024426574,0.00011143099,0.0000056664494,0.00004386183,0.000054025746,6.8133573e-7,0.0014325922,0.07982245,0.000019920875,0.6652274,0.00015294018,0.25288478],"study_design_scores_gemma":[0.0006018296,0.0006091794,0.00047670846,0.00008201966,0.000018427378,0.0000030169751,0.00007034332,0.9885241,0.0064689564,0.0016303833,0.0013497528,0.00016530912],"about_ca_topic_score_codex":0.000008453291,"about_ca_topic_score_gemma":0.000024093504,"teacher_disagreement_score":0.9570111,"about_ca_system_score_codex":0.00003123266,"about_ca_system_score_gemma":0.00003431252,"threshold_uncertainty_score":0.3583444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17405312,0.000018134771,0.82494706,0.000053285727,0.00010501339,0.00026801118,0.00011659483,0.000240161,0.00019865074],"genre_scores_gemma":[0.99818546,0.00066201313,0.0009960775,0.00003678755,0.000010811998,0.000058551832,0.000028995553,0.000019273146,0.0000020083173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989203,0.00004441584,0.00050519506,0.00011971202,0.00020071675,0.00020964953],"domain_scores_gemma":[0.9991421,0.00012724656,0.00011113837,0.0003532286,0.00018547836,0.000080822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016663583,0.0002101418,0.00027757048,0.000253091,0.000084075335,0.000036642556,0.0001595762,0.00019476203,0.000018224635],"category_scores_gemma":[0.0000054395655,0.00018487495,0.00008479818,0.0003007148,0.00011312549,0.0010959523,0.0000055588166,0.0003127397,0.0000036950487],"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.000112616544,0.00034755404,0.000236193,0.00024759345,0.00009292835,0.0000014705874,0.009513061,0.92777056,0.0004519938,0.004844096,0.0002695807,0.05611238],"study_design_scores_gemma":[0.0007548228,0.000054548655,0.0000970952,0.00012922374,0.0000137524285,0.0000038026103,0.00014238748,0.98726237,0.010595158,0.0005262295,0.00019483126,0.00022579485],"about_ca_topic_score_codex":0.000043488435,"about_ca_topic_score_gemma":0.000112876754,"teacher_disagreement_score":0.8241324,"about_ca_system_score_codex":0.00009159467,"about_ca_system_score_gemma":0.000017217812,"threshold_uncertainty_score":0.7538982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12288923,0.000005630737,0.8759156,0.0005560824,0.0002484145,0.00017568587,0.000024305064,0.000098570745,0.0000864938],"genre_scores_gemma":[0.9985558,0.000078974364,0.0012176062,0.00009424823,0.000008980812,0.000025058247,0.000006295012,0.0000035074013,0.000009547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990236,0.00004857407,0.00039815658,0.00014178065,0.0002673552,0.00012051764],"domain_scores_gemma":[0.99902624,0.000041295378,0.00017624331,0.00041464216,0.0002490915,0.00009249696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025456861,0.00010602586,0.0001233354,0.00026729418,0.00014233182,0.00010575794,0.00021044548,0.00007570065,0.000011664989],"category_scores_gemma":[0.0000061665864,0.00008068103,0.000055732657,0.00023367455,0.00008355871,0.006325261,0.0000021519063,0.00006375136,0.000024905023],"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.000054853008,0.00031986696,0.00039956055,0.0001374915,0.000074414245,2.2255122e-7,0.07506995,0.000044323973,0.0032164543,0.6105557,0.000067489425,0.31005967],"study_design_scores_gemma":[0.00369643,0.0010509372,0.003346137,0.00027542646,0.00008115169,0.000023278226,0.0015918883,0.5923456,0.13246582,0.2505216,0.01352274,0.0010790022],"about_ca_topic_score_codex":0.000016900545,"about_ca_topic_score_gemma":0.000012335213,"teacher_disagreement_score":0.87566656,"about_ca_system_score_codex":0.000016036429,"about_ca_system_score_gemma":0.000026972006,"threshold_uncertainty_score":0.4585662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06446802,0.0000032673936,0.9323178,0.001081904,0.00039219865,0.00019055018,0.00007749574,0.00017900048,0.0012897716],"genre_scores_gemma":[0.992377,0.000029916453,0.0070699984,0.00047039468,0.000023131262,0.000009185895,0.000010265294,0.0000051454194,0.0000049835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.00004556674,0.0003678353,0.00021088264,0.0003364371,0.00023124482],"domain_scores_gemma":[0.9989456,0.00015386945,0.00014301823,0.0005101177,0.00011766486,0.00012975113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029255814,0.00016824219,0.00013846399,0.00021829392,0.00039057242,0.00021735857,0.0002934768,0.000101189486,0.000023891542],"category_scores_gemma":[0.000027356944,0.00012927079,0.00009932774,0.00030104246,0.00006123038,0.0028835072,0.000012956997,0.0001821728,0.00004324512],"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.00020444629,0.00020189649,0.00028926998,0.00013496392,0.000110536195,0.0000034443165,0.02880591,0.0027699713,0.00047209096,0.42365852,0.0034211208,0.53992784],"study_design_scores_gemma":[0.0085259145,0.0012963532,0.00528109,0.00082701084,0.00009588326,0.00009330405,0.0013663985,0.5921584,0.053439595,0.27696168,0.057352018,0.0026023951],"about_ca_topic_score_codex":0.0000686055,"about_ca_topic_score_gemma":0.00003361626,"teacher_disagreement_score":0.92790896,"about_ca_system_score_codex":0.000048307455,"about_ca_system_score_gemma":0.0000237897,"threshold_uncertainty_score":0.5271509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44317684,0.0000132278265,0.556271,0.00017033893,0.00016358843,0.00011039334,0.00005159176,0.000030517189,0.00001248175],"genre_scores_gemma":[0.9940572,0.00008863516,0.0056635095,0.000085124586,0.00002612386,0.000009260117,0.00002838792,0.000008124,0.000033658103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.00002979513,0.0004204781,0.00014474367,0.00028632447,0.00019028386],"domain_scores_gemma":[0.9993459,0.00006567291,0.00011868913,0.00016506873,0.00019203087,0.000112623995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002239138,0.00013360965,0.00021163918,0.00075444655,0.00014559299,0.000028993487,0.000034622542,0.00013947298,0.000027080281],"category_scores_gemma":[0.000016894024,0.000106336396,0.000087120614,0.0005012784,0.000090517286,0.00048379434,0.0000023075816,0.00016894078,0.000022620246],"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.0009129146,0.0018600523,0.027891848,0.00055398874,0.0004335612,0.000019681,0.004141958,0.010172716,0.012186469,0.0005381238,0.00010219529,0.9411865],"study_design_scores_gemma":[0.0038827602,0.00033233158,0.022615701,0.0005345429,0.00022383186,0.000037858194,0.0005149571,0.9615152,0.009567591,0.00024779985,0.00021221579,0.00031523706],"about_ca_topic_score_codex":0.00023618637,"about_ca_topic_score_gemma":0.000035057,"teacher_disagreement_score":0.95134246,"about_ca_system_score_codex":0.00017744511,"about_ca_system_score_gemma":0.00004506309,"threshold_uncertainty_score":0.43362725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037377346,0.000008087715,0.95925707,0.0018682984,0.00057140045,0.00021369444,0.000029335326,0.00015367162,0.00052107754],"genre_scores_gemma":[0.9985997,0.00010430895,0.0006017697,0.000590929,0.000013984555,0.00002321103,0.000004192173,0.0000042826005,0.000057629957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.000052732925,0.00033543172,0.00016492732,0.00028479577,0.00017735329],"domain_scores_gemma":[0.9992075,0.000087853005,0.00011747777,0.000283997,0.00018278418,0.00012036982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023264608,0.00013474794,0.0001293837,0.00019643092,0.0002392104,0.00016137438,0.000175154,0.00010043348,0.000027887383],"category_scores_gemma":[0.0000056544645,0.00009913481,0.0000718374,0.00022819989,0.00007613977,0.0020283689,0.0000030646331,0.000106203035,0.00017253507],"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.00010774849,0.00018387253,0.00004318864,0.00007409618,0.00010916298,0.0000011570048,0.066893086,0.00014061795,0.000476754,0.3954779,0.0024537973,0.5340386],"study_design_scores_gemma":[0.011507631,0.0014097943,0.0031144388,0.0005137618,0.00013933284,0.00020339563,0.003955938,0.51094705,0.05613403,0.28261614,0.12674648,0.0027120106],"about_ca_topic_score_codex":0.00002067121,"about_ca_topic_score_gemma":0.00002382688,"teacher_disagreement_score":0.96122235,"about_ca_system_score_codex":0.00007326852,"about_ca_system_score_gemma":0.000038914168,"threshold_uncertainty_score":0.40426004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008526676,0.000046694175,0.96441394,0.00021808772,0.00035661558,0.032796886,0.0008213278,0.00030159988,0.00019218618],"genre_scores_gemma":[0.93975574,0.00027484068,0.0010858849,0.00008014357,0.00013577746,0.058476653,0.000119767305,0.000050990326,0.000020209178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860185,0.000032644723,0.0005830736,0.00023013089,0.00022480686,0.00032749044],"domain_scores_gemma":[0.9990354,0.00009767051,0.00011468779,0.00041507217,0.0001089823,0.00022818724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003191113,0.00026721272,0.000298229,0.00014655564,0.00036008112,0.0001463457,0.00016492677,0.00020264013,0.000012523431],"category_scores_gemma":[0.0000015352629,0.00020193752,0.000051831164,0.00013942271,0.000054006672,0.001531111,0.00000432877,0.00022119193,0.000005335581],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049968273,0.00020864981,0.000041268166,0.007237636,0.0002694346,0.0000021745602,0.0065486804,0.046161443,0.00010315722,0.003616965,0.031476207,0.9038347],"study_design_scores_gemma":[0.0025036721,0.00032438885,0.00001642043,0.00063757336,0.000031167354,0.000026223406,0.00025025816,0.79235923,0.0007894755,0.00059338,0.20204264,0.00042555688],"about_ca_topic_score_codex":0.000024049268,"about_ca_topic_score_gemma":0.00004267903,"teacher_disagreement_score":0.96332806,"about_ca_system_score_codex":0.000090609894,"about_ca_system_score_gemma":0.00004794294,"threshold_uncertainty_score":0.82347727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06485127,0.0002188886,0.92508346,0.0011392162,0.00047069788,0.001455637,0.0010314222,0.0009750196,0.0047743996],"genre_scores_gemma":[0.99331117,0.003873341,0.001230147,0.000615725,0.00001774277,0.0003358325,0.0005664729,0.000030598683,0.00001898647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984544,0.00007803546,0.00068463426,0.00012891006,0.00040661986,0.0002474036],"domain_scores_gemma":[0.9980166,0.0001030519,0.00024927733,0.0011676588,0.00037137175,0.00009202717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035932948,0.00039203535,0.00029732552,0.0002611656,0.00054066547,0.00036479434,0.00046406616,0.00033244974,0.000046485056],"category_scores_gemma":[0.0000028449329,0.000314737,0.000110788285,0.00020538799,0.0003450439,0.001713104,0.000027248678,0.0011083315,0.00008028614],"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.0010447578,0.0002184153,0.00003760409,0.003806207,0.001502947,0.0000014329796,0.20259783,0.35690594,0.000032768625,0.0040780446,0.065103136,0.36467093],"study_design_scores_gemma":[0.0020003528,0.00035316838,0.0002902118,0.0009445761,0.00027846044,0.000074789976,0.0011495701,0.74395764,0.026495622,0.02409792,0.1983456,0.0020120891],"about_ca_topic_score_codex":0.000110252,"about_ca_topic_score_gemma":0.00036050592,"teacher_disagreement_score":0.9284599,"about_ca_system_score_codex":0.00021530547,"about_ca_system_score_gemma":0.000046373814,"threshold_uncertainty_score":0.9999305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041412324,0.000035059147,0.9570029,0.00014025,0.0005663343,0.0003858049,0.000037704074,0.00014445955,0.00027519802],"genre_scores_gemma":[0.9907699,0.00010211535,0.0087133935,0.0003274433,0.000021919499,0.00002651343,0.000020887532,0.0000054521333,0.0000123274685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874735,0.00006024178,0.00044974277,0.00022541656,0.0003294847,0.00018776607],"domain_scores_gemma":[0.9991017,0.000062686064,0.00017594137,0.00027941633,0.0002804922,0.00009975446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532666,0.00015857439,0.00015628991,0.00191268,0.00034354714,0.0003506938,0.00016590019,0.00015483118,0.000005696943],"category_scores_gemma":[0.000023747527,0.000149654,0.000035636298,0.002210721,0.000095754556,0.0012577699,0.000006354492,0.00018878996,0.000013930118],"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.00026454573,0.0010445899,0.0024233926,0.00084324146,0.00005063406,0.000006846576,0.019235302,0.0011476189,0.00100508,0.054180745,0.0010739296,0.91872406],"study_design_scores_gemma":[0.0006636426,0.00026710896,0.00174716,0.000075676086,0.0000062595977,0.0000096837375,0.00009242686,0.98687273,0.004747586,0.00019205244,0.0051018223,0.00022382745],"about_ca_topic_score_codex":0.00015113474,"about_ca_topic_score_gemma":0.000048883943,"teacher_disagreement_score":0.98572516,"about_ca_system_score_codex":0.0000815229,"about_ca_system_score_gemma":0.000039155388,"threshold_uncertainty_score":0.61027133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4465664,0.000009771116,0.55304766,0.000030996547,0.00018174044,0.000083815925,0.00000724873,0.00003209685,0.00004026794],"genre_scores_gemma":[0.98880714,0.00006329678,0.01105165,0.000059821148,0.000009029547,0.0000032941548,0.0000014968335,0.0000026683795,0.0000016147918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992179,0.00003425162,0.0003322845,0.00013653545,0.00017163716,0.00010737842],"domain_scores_gemma":[0.99934685,0.000054946388,0.00017839922,0.00016693298,0.00018573318,0.00006716317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033477397,0.0000974262,0.00012520491,0.00034474448,0.0003823749,0.00016794365,0.00007653333,0.000081466096,0.000006543282],"category_scores_gemma":[0.000011789243,0.00009516351,0.000024620927,0.00044782093,0.00013843276,0.0010956725,0.000009870789,0.00010782992,0.0000025411211],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023118107,0.0000494227,0.00011872044,0.00027320968,0.00002974864,3.265974e-7,0.012123582,0.000089418914,0.0023143534,0.0050681443,0.000008761219,0.9799012],"study_design_scores_gemma":[0.00032954232,0.00011244737,0.0020804736,0.000047676276,0.000014849788,0.000035213518,0.00028475112,0.96946585,0.024631854,0.0026110383,0.0002506316,0.00013565866],"about_ca_topic_score_codex":0.0001200644,"about_ca_topic_score_gemma":0.000035984984,"teacher_disagreement_score":0.97976553,"about_ca_system_score_codex":0.000022844299,"about_ca_system_score_gemma":0.000022279874,"threshold_uncertainty_score":0.38806552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46478438,0.00013110913,0.5321507,0.00043423616,0.00036447198,0.00066847465,0.00058550865,0.0003116999,0.00056945987],"genre_scores_gemma":[0.9881193,0.00088376086,0.01047579,0.00013737877,0.000031148586,0.000177288,0.00013177603,0.000025943888,0.000017585933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989835,0.000035053425,0.00045615,0.00013870162,0.00014167881,0.00024491697],"domain_scores_gemma":[0.99851215,0.00022868866,0.00008617707,0.00066260254,0.00038228786,0.0001280824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001627849,0.00023219324,0.00022306308,0.00017693847,0.0009195386,0.00016181877,0.00024409048,0.00017745787,0.00002258629],"category_scores_gemma":[0.000013700031,0.00024543412,0.00006284273,0.00026686705,0.00040955897,0.0010019506,0.00001011009,0.0003780893,0.000021406202],"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.0006326832,0.0004186174,0.000048750066,0.0010437585,0.0010560157,0.0000010493292,0.14407878,0.29031217,0.004729569,0.1649413,0.011297673,0.38143963],"study_design_scores_gemma":[0.000831173,0.0002695637,0.000033778208,0.000054465516,0.000044677363,0.000015343961,0.0017768496,0.96390253,0.0027429725,0.0001190855,0.029901521,0.00030804577],"about_ca_topic_score_codex":0.000027385184,"about_ca_topic_score_gemma":0.00044824253,"teacher_disagreement_score":0.67359036,"about_ca_system_score_codex":0.00006823706,"about_ca_system_score_gemma":0.000033762386,"threshold_uncertainty_score":0.99999976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1482794,0.000011592197,0.8497766,0.000619841,0.0004962357,0.0004038428,0.00012311595,0.00014008516,0.00014928535],"genre_scores_gemma":[0.9692067,0.00009450539,0.029938068,0.0005967444,0.00005834508,0.000058566497,0.000033857305,0.00000790095,0.0000053128833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858844,0.00003877494,0.00043317775,0.00030421585,0.00036167985,0.00027367935],"domain_scores_gemma":[0.9989077,0.00007163488,0.00017751078,0.00036685538,0.00033920325,0.00013713044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024562576,0.00023115576,0.00018567969,0.00029111328,0.00079750543,0.00038257567,0.00019351278,0.00012610719,0.000034786102],"category_scores_gemma":[0.000008549632,0.0002145473,0.000063604464,0.00046238254,0.00023286689,0.0018005782,0.0000090841895,0.00025161574,0.000035977642],"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.00007351226,0.00031523572,0.00004553873,0.0001427465,0.00009346598,0.0000017536001,0.042209126,0.00016207503,0.000050441864,0.2661442,0.00046379134,0.69029814],"study_design_scores_gemma":[0.003915523,0.002219494,0.0040215715,0.00012456105,0.000113006114,0.00008823488,0.002176968,0.85015637,0.006243039,0.12318909,0.00665456,0.0010975682],"about_ca_topic_score_codex":0.00011907359,"about_ca_topic_score_gemma":0.00010171555,"teacher_disagreement_score":0.8499943,"about_ca_system_score_codex":0.00004986691,"about_ca_system_score_gemma":0.000058457896,"threshold_uncertainty_score":0.8748985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080000244,0.000016713144,0.9180997,0.00038010866,0.00037136322,0.0006770825,0.0000873146,0.00016808818,0.00019938027],"genre_scores_gemma":[0.96619374,0.00008465933,0.033020027,0.00050927507,0.000034524095,0.00007683166,0.00005786778,0.0000066524685,0.00001642958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.00003206923,0.00032190658,0.00020075768,0.00020518784,0.0001617817],"domain_scores_gemma":[0.99919015,0.00013399695,0.00015571286,0.00021190653,0.0002395031,0.000068734815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042712368,0.00014153539,0.00016182597,0.00016868947,0.00024236176,0.0002560989,0.0001244967,0.00013363632,0.000012745995],"category_scores_gemma":[0.000015454487,0.00013903221,0.00005388364,0.00014420414,0.00003759998,0.0020177264,0.000004776942,0.00018593646,0.000010947253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013594463,0.00004723437,0.000018549115,0.00022107582,0.000044545486,1.8918581e-7,0.006388879,0.000093422685,0.0060564964,0.020051166,0.00014779081,0.9667947],"study_design_scores_gemma":[0.0044058356,0.0014273808,0.0008144086,0.00023894642,0.00007899983,0.00004514612,0.00075442553,0.8112869,0.1254943,0.034290794,0.020231828,0.00093099725],"about_ca_topic_score_codex":0.000014651445,"about_ca_topic_score_gemma":0.00000537239,"teacher_disagreement_score":0.9658637,"about_ca_system_score_codex":0.000028513647,"about_ca_system_score_gemma":0.00003606858,"threshold_uncertainty_score":0.5669569},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60201806,0.0000037357654,0.39719862,0.00004903538,0.000093687915,0.00048093224,0.00008841038,0.000029896755,0.000037644288],"genre_scores_gemma":[0.99878436,0.000006424464,0.0010889006,0.000037463196,0.0000051340253,0.000059132195,0.00000915402,0.0000044612757,0.0000049388123],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99868983,0.000047859117,0.00043828026,0.00018091206,0.00047904966,0.00016405313],"domain_scores_gemma":[0.9986984,0.00027646517,0.000239142,0.00045563158,0.00024179739,0.00008857036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041809006,0.000121369434,0.00022667123,0.0002458029,0.000080159996,0.000053650816,0.00026301833,0.00007484063,0.000007055939],"category_scores_gemma":[0.000042577212,0.000109795736,0.00005086419,0.00049187243,0.000040851723,0.0007768154,0.000014408636,0.0002490709,0.0000046443574],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050678256,0.0035195532,0.20639257,0.0012596734,0.0003824482,0.0000013670775,0.7103786,0.037074022,0.000548939,0.02468816,0.000685382,0.014562492],"study_design_scores_gemma":[0.006561864,0.0061905435,0.5337434,0.00020027877,0.00009218409,0.000025880443,0.046125937,0.30136356,0.078126945,0.024965556,0.0011574418,0.0014464324],"about_ca_topic_score_codex":0.00008578285,"about_ca_topic_score_gemma":0.00008806834,"teacher_disagreement_score":0.6642527,"about_ca_system_score_codex":0.000043751654,"about_ca_system_score_gemma":0.000058351,"threshold_uncertainty_score":0.44773403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11567532,0.000014147459,0.8820529,0.00019884348,0.0007201681,0.00053015305,0.00017419197,0.0001735172,0.0004607832],"genre_scores_gemma":[0.94832426,0.00007600379,0.05117591,0.0003044978,0.000026697686,0.000038905477,0.00004001834,0.000008218156,0.000005493559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987995,0.000025459243,0.0003927612,0.0002493653,0.00024181703,0.00029108571],"domain_scores_gemma":[0.99890405,0.0001345673,0.00015508424,0.00056548044,0.00012888479,0.00011196206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035254285,0.00019151614,0.00020043853,0.00021858315,0.00036451954,0.00044039128,0.00044981146,0.00012987398,0.000019448986],"category_scores_gemma":[0.0000070510073,0.0001890259,0.00013279587,0.00031018603,0.000029831343,0.0035843302,0.000021443844,0.0003208371,0.000018051913],"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.00018789808,0.00016222184,0.00018022586,0.0012333349,0.00013451187,0.0000013923599,0.029942328,0.003534168,0.00018347349,0.7263915,0.0010487082,0.23700026],"study_design_scores_gemma":[0.0022594982,0.00037601282,0.00020483708,0.00018508737,0.00003402986,0.000022474824,0.0009826501,0.61638504,0.0043330425,0.3405405,0.03388702,0.00078980345],"about_ca_topic_score_codex":0.00004886264,"about_ca_topic_score_gemma":0.000026811118,"teacher_disagreement_score":0.83264893,"about_ca_system_score_codex":0.000026953037,"about_ca_system_score_gemma":0.000031790194,"threshold_uncertainty_score":0.77082527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005342526,0.000013930868,0.982161,0.00018056387,0.0052211224,0.0017014132,0.00034062404,0.00033501344,0.0047038267],"genre_scores_gemma":[0.96009153,0.00008822195,0.03859533,0.00029058458,0.00014987518,0.0003520038,0.00036219237,0.000024808838,0.000045451674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977384,0.000042499567,0.00073468,0.00057454425,0.00053179817,0.00037808667],"domain_scores_gemma":[0.9979427,0.00012409958,0.0005099369,0.00083315815,0.0004193938,0.00017074331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042561023,0.0004314864,0.00042746382,0.00045888108,0.00030279646,0.0008171882,0.00049909553,0.00054101745,0.0000018844984],"category_scores_gemma":[0.000025866417,0.00045243555,0.0002819881,0.00027406708,0.0001094549,0.00243741,0.00003455443,0.0008119927,0.00002500363],"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.0002816894,0.00024439028,0.000008692336,0.0017003705,0.0003030309,8.95977e-7,0.009936152,0.531021,0.000024083904,0.027550373,0.002440365,0.42648897],"study_design_scores_gemma":[0.0010643256,0.00016020537,0.000033597906,0.00009767264,0.000049758593,0.000009404558,0.00024219826,0.9872352,0.00090737565,0.0062807593,0.0033990361,0.00052046904],"about_ca_topic_score_codex":0.000019155152,"about_ca_topic_score_gemma":0.000010816493,"teacher_disagreement_score":0.954749,"about_ca_system_score_codex":0.00024763698,"about_ca_system_score_gemma":0.00021051316,"threshold_uncertainty_score":0.99979275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2111469,0.00007560099,0.7875244,0.0004039049,0.000347766,0.00037950554,0.000022542545,0.000056273606,0.000043102504],"genre_scores_gemma":[0.9917961,0.00010210426,0.007822123,0.00019138264,0.000020738302,0.000022767765,0.000019226301,0.000005031355,0.000020566637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991332,0.000017910043,0.00028746427,0.00020496194,0.00018234241,0.00017411579],"domain_scores_gemma":[0.9993754,0.00008988198,0.0001318191,0.00018080142,0.00012410198,0.00009798287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025119245,0.00012898266,0.00012747107,0.00022876481,0.00032404708,0.00033482505,0.000094178744,0.000092077134,0.0000016726079],"category_scores_gemma":[0.000009390365,0.000118404045,0.00003428448,0.00044395213,0.00004731534,0.0010743295,0.0000029912117,0.00014015712,0.0000019739616],"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.0001261963,0.000048166694,0.00011214653,0.00050717883,0.000029261504,2.5328532e-7,0.0065505086,0.016340017,0.003953814,0.0019105765,0.00028275177,0.97013915],"study_design_scores_gemma":[0.0016023926,0.00034811418,0.0024898383,0.00008452731,0.000049094935,0.000042264608,0.00027203764,0.95508736,0.023741428,0.010912443,0.004958384,0.00041212878],"about_ca_topic_score_codex":0.000004187431,"about_ca_topic_score_gemma":0.0000024204733,"teacher_disagreement_score":0.969727,"about_ca_system_score_codex":0.000020616873,"about_ca_system_score_gemma":0.00002241806,"threshold_uncertainty_score":0.4828377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007852719,0.000036519763,0.9877184,0.0021111604,0.0009891458,0.0006816555,0.00013812343,0.00037043772,0.00010183309],"genre_scores_gemma":[0.9478496,0.00023839316,0.047810987,0.003811682,0.00015073795,0.00010041052,0.000021396472,0.000013402285,0.0000034227994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848545,0.0000682172,0.00049419294,0.00031764156,0.00030180087,0.00033271138],"domain_scores_gemma":[0.9984716,0.00034339787,0.00022819253,0.00028952002,0.00040415121,0.0002631428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002280364,0.00026417515,0.00030105148,0.00011340414,0.00065433286,0.000382997,0.00026287278,0.00028820345,0.000017619375],"category_scores_gemma":[0.000045771743,0.00026524044,0.00013705151,0.0008078176,0.000099477744,0.0017367796,0.000010269372,0.0005446637,0.000019353098],"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.0012992043,0.00026115615,0.000025213783,0.00044179332,0.0002807932,0.0000055252635,0.056565873,0.05575733,0.000026921016,0.52375805,0.0075447033,0.35403344],"study_design_scores_gemma":[0.00089671434,0.0005711112,0.0000133291,0.000047017835,0.000027977276,0.000009883414,0.00034631198,0.92578167,0.0017341919,0.0556037,0.01456569,0.00040239826],"about_ca_topic_score_codex":0.000014098108,"about_ca_topic_score_gemma":0.000018798264,"teacher_disagreement_score":0.93999684,"about_ca_system_score_codex":0.00004522402,"about_ca_system_score_gemma":0.000070751186,"threshold_uncertainty_score":0.99998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012739088,5.932214e-7,0.97665316,0.0055235066,0.00021694112,0.010985878,0.0050963443,0.00016487185,0.00008480284],"genre_scores_gemma":[0.96405095,0.000002035541,0.028073248,0.0041233758,0.000056045323,0.0030611174,0.000617281,0.00001373499,0.0000021985632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986876,0.000021617576,0.00036182438,0.00031315853,0.00034414307,0.00027165774],"domain_scores_gemma":[0.9986741,0.00010553829,0.00020081464,0.0006444223,0.00018304437,0.00019210561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015504909,0.00020416308,0.00017455201,0.00010803538,0.00057277334,0.00044986268,0.0006271585,0.00009303572,0.000008382441],"category_scores_gemma":[0.000026549807,0.0001812906,0.000041015086,0.000379827,0.000078238576,0.00271061,0.000023012983,0.00034577833,0.0000071470126],"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.0013275062,0.0011993459,0.00005995466,0.0019493414,0.00066174986,0.000005262438,0.03449349,0.01787998,0.00025127383,0.57228184,0.036821194,0.3330691],"study_design_scores_gemma":[0.0023373538,0.0005294336,0.000035262918,0.000039619168,0.000018549601,0.000015896561,0.00018274006,0.91596216,0.0003575211,0.0020690134,0.07814812,0.00030430546],"about_ca_topic_score_codex":0.000014547808,"about_ca_topic_score_gemma":0.0001273007,"teacher_disagreement_score":0.9627771,"about_ca_system_score_codex":0.000059975344,"about_ca_system_score_gemma":0.00009854232,"threshold_uncertainty_score":0.7392816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18272561,0.000012000803,0.81552494,0.000576166,0.00047269926,0.00024270448,0.0000715036,0.00031980374,0.000054585515],"genre_scores_gemma":[0.9940734,0.000073992065,0.0043157144,0.0014140082,0.00005153443,0.00001688197,0.000035890287,0.000013427859,0.000005144892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853915,0.00003090526,0.0004185019,0.0002438671,0.0004409084,0.00032667912],"domain_scores_gemma":[0.99896085,0.00013592596,0.00012643411,0.00030447566,0.00020068213,0.0002716193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024470058,0.00021956961,0.00019600877,0.00018166061,0.00033848887,0.00047160118,0.000334085,0.00013031145,0.00001152083],"category_scores_gemma":[0.000039323706,0.00022290608,0.00008004243,0.00076230225,0.00006385866,0.0040264064,0.000014181577,0.0004260608,0.000050104703],"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.0011214925,0.00069100526,0.0016615337,0.0022499622,0.0006755874,0.00009118913,0.11091352,0.18616049,0.062147167,0.05317183,0.0030070667,0.57810915],"study_design_scores_gemma":[0.00074846967,0.00024049533,0.0006720927,0.00004547122,0.000018627206,0.00002962097,0.000066418834,0.97478825,0.016790416,0.00056792994,0.0055827177,0.00044951122],"about_ca_topic_score_codex":0.000016289277,"about_ca_topic_score_gemma":0.0000015330063,"teacher_disagreement_score":0.8113478,"about_ca_system_score_codex":0.0000550849,"about_ca_system_score_gemma":0.00008555514,"threshold_uncertainty_score":0.9089846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07102952,0.000036675607,0.9280784,0.00025945788,0.00013626071,0.00015305098,0.000004153274,0.0000840381,0.00021841246],"genre_scores_gemma":[0.9984243,0.00006235796,0.00009943275,0.001354634,0.0000245525,0.000016896947,0.000009312407,0.0000037784332,0.0000047266917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992253,0.000080220685,0.0002480542,0.00013374408,0.00015368749,0.00015895655],"domain_scores_gemma":[0.9996307,0.000086254964,0.00007753395,0.0000793023,0.00004396739,0.000082234284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033028677,0.00011850539,0.00013197707,0.00009273588,0.00027231177,0.00018358116,0.00009857919,0.00007896397,0.000004032688],"category_scores_gemma":[0.0000047648577,0.000118724645,0.000049825176,0.00018088239,0.000040206243,0.0008816721,0.0000048211336,0.00044753513,0.000002904794],"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.00011675923,0.000019258543,0.000045640987,0.000064573964,0.000018078244,0.0000022027793,0.026799535,0.8636956,0.000010306154,0.014118749,0.00005824842,0.095051035],"study_design_scores_gemma":[0.0006247817,0.00013493071,0.000056307057,0.00002188413,0.0000073858564,0.0000026253383,0.00050551695,0.99678487,0.00007151865,0.0005825866,0.0010675631,0.0001400159],"about_ca_topic_score_codex":0.000025196387,"about_ca_topic_score_gemma":0.000012498412,"teacher_disagreement_score":0.927979,"about_ca_system_score_codex":0.000028205453,"about_ca_system_score_gemma":0.000023704219,"threshold_uncertainty_score":0.48414508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598901,0.00003355193,0.43898308,0.0003437346,0.00021098506,0.0001941482,0.00007159643,0.00013811517,0.00013467747],"genre_scores_gemma":[0.998131,0.00012236337,0.0013846969,0.0002733566,0.000017093147,0.000025577872,0.000028998904,0.00001542909,0.0000014943319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.000019496138,0.00037631163,0.00009397346,0.00015444447,0.00017254976],"domain_scores_gemma":[0.9995356,0.000045042183,0.000053228054,0.00019224151,0.000058878937,0.00011497335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000805743,0.00016552879,0.00016273213,0.0001651527,0.00016538317,0.00007492303,0.00010406699,0.000106060324,0.000023958279],"category_scores_gemma":[0.00000833165,0.0001844649,0.000048814647,0.0002921544,0.00006351632,0.0013269811,0.0000021370925,0.0003306337,0.000025099289],"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.000018876386,0.000014611992,0.0000020345433,0.00011359863,0.000013206055,4.861652e-7,0.0077781766,0.98734623,0.00028787163,0.00048586016,0.000102398124,0.0038366558],"study_design_scores_gemma":[0.00044407017,0.00003721398,0.00005753827,0.00003123595,0.000017668039,0.000007062229,0.0005567128,0.9945944,0.0035352379,0.000134281,0.00039379924,0.00019077018],"about_ca_topic_score_codex":0.000040923678,"about_ca_topic_score_gemma":0.00005682078,"teacher_disagreement_score":0.4382409,"about_ca_system_score_codex":0.00008195851,"about_ca_system_score_gemma":0.000021075488,"threshold_uncertainty_score":0.752226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03852684,0.000017647464,0.9575431,0.0022100534,0.00028390586,0.00062125764,0.0005333423,0.00013354729,0.00013030035],"genre_scores_gemma":[0.98631644,0.00028915808,0.011899086,0.0010611407,0.00002137469,0.00011415105,0.00026897312,0.000012026614,0.000017673863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987067,0.000038389975,0.00042068993,0.00035048445,0.0002833329,0.000200381],"domain_scores_gemma":[0.99896157,0.00009878017,0.00019371716,0.00026156646,0.00030777464,0.00017660925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018015655,0.00028784745,0.00030938146,0.00025940783,0.00031374057,0.00046266496,0.00016358469,0.00019737765,0.000011833932],"category_scores_gemma":[0.000007018976,0.00025959304,0.0001355533,0.00019082651,0.000046672794,0.0008653059,0.000014049796,0.0004560753,0.000008161887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032561636,0.00009968524,0.00001996718,0.0012955755,0.0002264524,0.000005709592,0.007035624,0.011333532,0.00007906544,0.00015446356,0.00037412616,0.97905016],"study_design_scores_gemma":[0.001593645,0.00054120587,0.00014794,0.00045870736,0.00021155275,0.000017360204,0.0002789659,0.94867575,0.038583625,0.008265699,0.0004054106,0.0008201129],"about_ca_topic_score_codex":0.000031736352,"about_ca_topic_score_gemma":0.0001509042,"teacher_disagreement_score":0.97823006,"about_ca_system_score_codex":0.00003662446,"about_ca_system_score_gemma":0.000101118545,"threshold_uncertainty_score":0.99998564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036648626,0.000019324443,0.99301076,0.0013729169,0.00026176427,0.000178047,0.000018352555,0.00018478479,0.0012891771],"genre_scores_gemma":[0.98721707,0.00006474286,0.011253453,0.0014062566,0.000025487745,0.000012063102,0.000009428138,0.0000044363564,0.0000070903975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.000029453906,0.0002870398,0.00015344979,0.00023089557,0.00014704592],"domain_scores_gemma":[0.99938864,0.000044754157,0.00012616902,0.0001485186,0.00016572377,0.00012618724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013424671,0.00012424075,0.00011982374,0.00004898095,0.0002810423,0.000314374,0.00013627174,0.00007716504,0.000010625279],"category_scores_gemma":[0.000012465018,0.000118860364,0.000041328974,0.00037502538,0.000050605555,0.002038192,0.0000032258556,0.00017283726,0.000020141484],"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.00018881162,0.00016445073,0.000086392654,0.00047494797,0.00009952801,0.0000049790765,0.043032095,0.10012778,0.00006870239,0.10827805,0.0048980587,0.7425762],"study_design_scores_gemma":[0.00071399315,0.0001860222,0.000014565167,0.000044243432,0.000016678156,0.000012239049,0.00017562909,0.97847885,0.007181721,0.009170237,0.0037488935,0.00025695085],"about_ca_topic_score_codex":0.0000037511256,"about_ca_topic_score_gemma":0.0000013714703,"teacher_disagreement_score":0.98355216,"about_ca_system_score_codex":0.000020867643,"about_ca_system_score_gemma":0.000058127232,"threshold_uncertainty_score":0.4846985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58028185,0.0000015626584,0.41869125,0.00027581648,0.00014708149,0.00017247716,0.00016920887,0.00006884794,0.00019190201],"genre_scores_gemma":[0.996996,0.000013659133,0.00054747256,0.0023907714,0.000018570901,0.0000067041465,0.000016061937,0.000007925852,0.000002854772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999123,0.000063774314,0.0002950217,0.00018086589,0.00017671612,0.00016062814],"domain_scores_gemma":[0.99952644,0.00008696219,0.000115634626,0.000084261956,0.000060883773,0.00012580417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009297636,0.000152329,0.00013946582,0.00011172979,0.00036545354,0.00019515152,0.00006581552,0.00006765669,0.000023650418],"category_scores_gemma":[0.000011529196,0.0001498987,0.000048257993,0.0001442377,0.0001230298,0.00081617536,0.0000028331533,0.0002468786,0.0000092611135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018464488,0.00047677924,0.0002176896,0.0017060868,0.00012719342,0.000037486687,0.11922893,0.055335574,0.16055557,0.002125683,0.0013499506,0.6569926],"study_design_scores_gemma":[0.0011884406,0.00048701974,0.00007008352,0.00006893958,0.000026067115,0.000021476073,0.00035791236,0.53398263,0.4609742,0.00170692,0.00077155966,0.00034476613],"about_ca_topic_score_codex":0.00012294724,"about_ca_topic_score_gemma":0.000055519078,"teacher_disagreement_score":0.65664786,"about_ca_system_score_codex":0.000022012278,"about_ca_system_score_gemma":0.000026064288,"threshold_uncertainty_score":0.6112692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961649,0.000032016273,0.10277518,0.00004625991,0.00018018454,0.00036765842,0.00007467842,0.00005686208,0.00030229543],"genre_scores_gemma":[0.99986047,0.000007093469,0.000084568426,0.000016685974,0.000006542804,0.000016977845,0.0000028411553,0.000004760725,7.0582566e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925494,0.000057014666,0.00025087982,0.000061222214,0.00029857797,0.00007738372],"domain_scores_gemma":[0.99959356,0.00006097979,0.00004500869,0.00009848895,0.00015733564,0.00004462925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045935134,0.00008383577,0.00011050304,0.00014074572,0.000053161355,0.000024725385,0.000045768662,0.00005902552,0.000005759441],"category_scores_gemma":[0.000018721397,0.00007215821,0.000028744893,0.0006261647,0.00004224219,0.00033941344,0.0000013092689,0.000119729666,0.0000020812256],"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.00018764983,0.00012759595,0.003965306,0.0051180627,0.00019446062,8.8362094e-7,0.019239116,0.71147627,0.037892006,0.0012758964,0.00006058567,0.22046217],"study_design_scores_gemma":[0.0006796304,0.000044209282,0.0010545631,0.00006592788,0.000042063373,9.858543e-7,0.00034266806,0.7849329,0.21249473,0.00021248814,0.0000218395,0.00010796713],"about_ca_topic_score_codex":0.000027540733,"about_ca_topic_score_gemma":0.0000127921885,"teacher_disagreement_score":0.22035421,"about_ca_system_score_codex":0.000116519215,"about_ca_system_score_gemma":0.000034136327,"threshold_uncertainty_score":0.29425263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19091873,0.000032054275,0.8068983,0.00042626046,0.000091622336,0.00039643553,0.000047932335,0.00042829482,0.0007603611],"genre_scores_gemma":[0.99802566,0.00027616025,0.0014054453,0.0001237162,0.000010297679,0.000105191495,0.000037463415,0.000015627706,4.1683575e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990936,0.000040519597,0.00037138574,0.00013517059,0.00016835793,0.00019098358],"domain_scores_gemma":[0.99945855,0.000057671004,0.0000883602,0.00018049162,0.000120285826,0.0000946309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102289814,0.00018365054,0.00017273359,0.00021945187,0.00017624898,0.00008377215,0.000105779065,0.00012160596,0.0000058137193],"category_scores_gemma":[0.000008649258,0.0001926197,0.000039546172,0.00040235533,0.00008543474,0.00077626907,0.000003673225,0.0004289522,0.000006836841],"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.00055788254,0.00017601572,0.0000693222,0.0008253345,0.0001370612,0.0000056360373,0.20831703,0.68165755,0.0003911869,0.049085125,0.0005041011,0.058273762],"study_design_scores_gemma":[0.0008003586,0.00026665797,0.00020627068,0.00027792802,0.000026281667,0.000025398609,0.0038244487,0.9816449,0.008278966,0.0039769034,0.00027022892,0.000401635],"about_ca_topic_score_codex":0.000030212925,"about_ca_topic_score_gemma":0.00009147208,"teacher_disagreement_score":0.807107,"about_ca_system_score_codex":0.00014851538,"about_ca_system_score_gemma":0.00002081424,"threshold_uncertainty_score":0.7854803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17590217,0.0000587901,0.82266515,0.00024567253,0.00016699059,0.00039482894,0.00004599531,0.00041723848,0.00010317385],"genre_scores_gemma":[0.99593365,0.00063077756,0.002794929,0.0003065559,0.000054399305,0.000075241616,0.0001775723,0.00002550581,0.0000013588632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988489,0.000054020707,0.0005022221,0.00015674971,0.00022830503,0.0002098005],"domain_scores_gemma":[0.99934256,0.000040449333,0.00009712472,0.00027145137,0.00012271773,0.00012567284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012726866,0.00024006526,0.00025194482,0.00016020174,0.0001545143,0.00010981401,0.00013174649,0.00019643207,0.000017510787],"category_scores_gemma":[0.0000059956046,0.0002712305,0.00008076344,0.00033406634,0.000055253306,0.0012269295,0.0000048334887,0.00052554323,0.000017933975],"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.000073504365,0.00009045471,0.000035710324,0.00013415041,0.000050495448,8.208765e-7,0.02315382,0.78191864,0.0023322112,0.00056657556,0.00029123592,0.19135237],"study_design_scores_gemma":[0.00065008015,0.00006911049,0.00023998442,0.000023288541,0.000013949232,0.0000017674126,0.00010174353,0.98927826,0.007896479,0.0002418069,0.0012144789,0.00026906232],"about_ca_topic_score_codex":0.000040749415,"about_ca_topic_score_gemma":0.0003698147,"teacher_disagreement_score":0.82003146,"about_ca_system_score_codex":0.00008987609,"about_ca_system_score_gemma":0.00001479062,"threshold_uncertainty_score":0.999974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27440158,0.00029877227,0.72231126,0.00036590485,0.00024763247,0.0005382001,0.00010248654,0.0006418416,0.0010923173],"genre_scores_gemma":[0.9975414,0.0008359592,0.00070295687,0.0007846547,0.000021291393,0.00005326816,0.00003975988,0.000018779145,0.0000018850061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898094,0.000038407787,0.000469812,0.000115900075,0.00017051716,0.00022441562],"domain_scores_gemma":[0.9993979,0.00005096602,0.000062311345,0.00024180481,0.00010538338,0.00014166864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117442534,0.00020590528,0.00023389747,0.0001375486,0.000109389526,0.00009332712,0.00014733738,0.00013417953,0.00003336028],"category_scores_gemma":[0.0000040303967,0.00022476661,0.00007749325,0.00025881012,0.000057545356,0.0007206968,0.0000048909305,0.00055851217,0.000017698769],"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.000146011,0.00006638464,0.00010099268,0.00021448165,0.00012173234,0.000007222019,0.019600222,0.93525726,0.00016685783,0.0024700726,0.0013618866,0.040486902],"study_design_scores_gemma":[0.00083130517,0.00006877822,0.000049063205,0.00004160142,0.000017564525,0.000011037765,0.00044649432,0.98727316,0.0057218093,0.00044549716,0.004793612,0.00030006873],"about_ca_topic_score_codex":0.000100749014,"about_ca_topic_score_gemma":0.00020634255,"teacher_disagreement_score":0.7231399,"about_ca_system_score_codex":0.000082625884,"about_ca_system_score_gemma":0.000015095712,"threshold_uncertainty_score":0.9165717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019840024,0.00001025215,0.97760415,0.0007495941,0.00023939704,0.00012470476,0.000013576985,0.00009303246,0.0013252754],"genre_scores_gemma":[0.9936997,0.00013002312,0.0054670996,0.00037986462,0.000011233851,0.000027069387,0.000065274995,0.000003323428,0.00021639663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992803,0.00003658154,0.00023291491,0.00014845216,0.0001805064,0.00012127839],"domain_scores_gemma":[0.9993528,0.000065957734,0.00009134522,0.00014044427,0.00028231175,0.00006712783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001308187,0.00008721615,0.00010560953,0.00011923144,0.0003347402,0.00026528336,0.00006560131,0.00006200415,0.000018512495],"category_scores_gemma":[0.000020273434,0.00009123099,0.00011271708,0.00032058018,0.000021308397,0.0014075219,0.0000024141184,0.00013355401,0.00004539314],"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.000038418173,0.00010251951,0.00006850266,0.00010589979,0.00013005694,0.000002333232,0.0057589742,0.018512152,0.00047650264,0.04533595,0.00045215362,0.92901653],"study_design_scores_gemma":[0.0011967754,0.00014671449,0.0002907044,0.00003659817,0.00005904936,0.000044136967,0.0023616927,0.9392901,0.03205898,0.015786696,0.008424438,0.0003041099],"about_ca_topic_score_codex":0.000016938322,"about_ca_topic_score_gemma":0.00003111766,"teacher_disagreement_score":0.97385967,"about_ca_system_score_codex":0.000022854189,"about_ca_system_score_gemma":0.00003775782,"threshold_uncertainty_score":0.3720292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023124322,0.000030785224,0.97540945,0.00008886049,0.00038571638,0.00037091793,0.000022631222,0.0001841104,0.000383216],"genre_scores_gemma":[0.99903506,0.000058836216,0.00032857407,0.00019457718,0.000051408824,0.00011635919,0.00015668343,0.000016903792,0.000041592106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991676,0.000017819872,0.00029332069,0.000109153814,0.00017042994,0.00024168157],"domain_scores_gemma":[0.99938947,0.00010950165,0.00006070974,0.00014988321,0.00019444313,0.00009601634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011888512,0.00017036518,0.0001915777,0.00007082551,0.00020956923,0.000105909654,0.00004538941,0.00010944642,0.00002487171],"category_scores_gemma":[0.000008076026,0.0001756961,0.00012840479,0.000155407,0.00003370225,0.00037228988,9.830096e-7,0.00027233607,0.000011428325],"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.000035107674,0.000023165574,0.0000014311349,0.000050337043,0.000058255635,2.7253293e-7,0.0005058324,0.9907276,0.000041363528,0.0007684029,0.0004419406,0.0073462785],"study_design_scores_gemma":[0.0011679522,0.00007955569,0.000013792361,0.000029234332,0.00006270779,0.0000028753534,0.00007819354,0.98619276,0.0032108708,0.0005251283,0.008450204,0.00018669516],"about_ca_topic_score_codex":0.000002768039,"about_ca_topic_score_gemma":0.000011812337,"teacher_disagreement_score":0.9759107,"about_ca_system_score_codex":0.00006492301,"about_ca_system_score_gemma":0.00002441818,"threshold_uncertainty_score":0.71646786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044663835,0.00007169163,0.95273805,0.00041779559,0.0006975421,0.0007067536,0.00017397318,0.0002813281,0.00024904442],"genre_scores_gemma":[0.80485463,0.00042500766,0.19415738,0.00022444839,0.00003140572,0.00020334093,0.00008242822,0.000010982087,0.000010389354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985133,0.00011866685,0.00048728188,0.00040056495,0.0002701735,0.00021005767],"domain_scores_gemma":[0.9984061,0.00019590845,0.00028788325,0.00047641995,0.0005400395,0.000093627226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096580683,0.00026914768,0.00031548666,0.00022650968,0.00044862105,0.0011919464,0.00024056608,0.0003153776,0.0000031094266],"category_scores_gemma":[0.000019657457,0.00027972675,0.00014424155,0.00019290534,0.000092441696,0.0015401131,0.000015136914,0.00045356108,0.0000014939951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018844355,0.00038997963,0.0001369528,0.0028686007,0.0005634339,0.000005843959,0.1798255,0.0032676035,0.00026601792,0.031269293,0.00054870284,0.7806696],"study_design_scores_gemma":[0.0029281233,0.00070435094,0.005285155,0.00066132046,0.00020419867,0.000073537514,0.007294556,0.7644302,0.06569962,0.14176457,0.0085653495,0.0023889632],"about_ca_topic_score_codex":0.00005640262,"about_ca_topic_score_gemma":0.000051734605,"teacher_disagreement_score":0.7782807,"about_ca_system_score_codex":0.00007491833,"about_ca_system_score_gemma":0.00012648344,"threshold_uncertainty_score":0.9999655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015179495,0.0000091952015,0.9788421,0.00043493335,0.0034287763,0.0008167748,0.0002898923,0.0001914321,0.00080741587],"genre_scores_gemma":[0.98383856,0.000007734971,0.015242984,0.0005420473,0.000076894095,0.00018038569,0.00005357575,0.000015171283,0.00004263225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998201,0.000102260536,0.0004942753,0.00029916933,0.0005510598,0.00035224622],"domain_scores_gemma":[0.99883807,0.00019572974,0.00020681204,0.0003988998,0.00018175167,0.00017874189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006135356,0.00023342701,0.00025391896,0.00032801833,0.0012923905,0.00027850506,0.00042914768,0.00009113813,0.000019862164],"category_scores_gemma":[0.000029747871,0.0002517038,0.00013515344,0.0003822449,0.000057064466,0.0012938331,0.000024922194,0.00050084636,0.000015711232],"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.00021171395,0.00009162781,0.000016316593,0.00012856716,0.000075406126,0.000005237504,0.015701843,0.8258583,0.0000567682,0.046092793,0.0011437415,0.11061767],"study_design_scores_gemma":[0.001464121,0.00030009297,0.000024230596,0.000017944314,0.000032332406,0.000031692383,0.0018190792,0.9573936,0.0005126532,0.0012388019,0.036777467,0.00038800837],"about_ca_topic_score_codex":0.00012973786,"about_ca_topic_score_gemma":0.000026208654,"teacher_disagreement_score":0.9686591,"about_ca_system_score_codex":0.00019088232,"about_ca_system_score_gemma":0.000110693436,"threshold_uncertainty_score":0.9999935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033880834,0.00004975074,0.96514964,0.00013442738,0.00009593546,0.0003358155,0.000021790423,0.00014161096,0.00019017662],"genre_scores_gemma":[0.9344653,0.00026194524,0.06490409,0.00022359341,0.0000124818425,0.00011184694,0.0000074268246,0.0000059096888,0.000007405616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991878,0.000024424538,0.0002762833,0.00023194542,0.00012703222,0.00015249012],"domain_scores_gemma":[0.99937874,0.00007788856,0.00008731015,0.0001976813,0.00015587323,0.000102482096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022312002,0.00013168361,0.00014122471,0.0002169713,0.0005920815,0.00032773285,0.00007419014,0.00010294675,0.0000014058373],"category_scores_gemma":[0.000011337121,0.0001362564,0.00004749279,0.0005001665,0.000057291538,0.0010463236,0.000008320048,0.00016605578,7.6481507e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040713196,0.000113358816,0.000037116268,0.00025616374,0.000073536714,7.2690887e-7,0.0043118745,0.000798994,0.001093753,0.072282,0.000031739226,0.92096],"study_design_scores_gemma":[0.00096934114,0.00022273521,0.00030117392,0.000021856955,0.000043779728,0.000104741775,0.0008729619,0.9021982,0.0806893,0.01217325,0.0020487914,0.00035388878],"about_ca_topic_score_codex":0.000027514767,"about_ca_topic_score_gemma":0.000007989754,"teacher_disagreement_score":0.92060614,"about_ca_system_score_codex":0.000030265615,"about_ca_system_score_gemma":0.000027567687,"threshold_uncertainty_score":0.5556375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1570893,0.0006421486,0.29434258,0.0005747086,0.007030574,0.00035399405,0.005997834,0.000073672505,0.5338952],"genre_scores_gemma":[0.9960207,0.00027690007,0.00024554494,0.00018992073,0.000006501434,0.000004571758,0.000011130805,0.0000024880444,0.0032422927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942255,0.000002897635,0.00035105794,0.00009944302,0.00002579589,0.000098251825],"domain_scores_gemma":[0.9996127,0.000016142632,0.00013822038,0.0001198793,0.00007550789,0.000037571048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012365311,0.00006251897,0.00017786717,0.00008466352,0.000107361004,0.000044687713,0.00003867558,0.000040993767,0.0009183998],"category_scores_gemma":[0.000008096764,0.00007206256,0.00005515401,0.000120069446,0.000067929825,0.00048441978,0.000002150303,0.00006217464,0.00048223298],"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.00009118376,0.0002795139,0.0015027322,0.00025414495,0.0004261334,0.0000023607954,0.013930513,0.0023197497,0.000029530771,0.9114468,0.055441428,0.014275925],"study_design_scores_gemma":[0.0037717128,0.00018169118,0.001701993,0.000068824265,0.00004645708,0.000020376538,0.007964371,0.026848711,0.014724272,0.08683591,0.8570752,0.00076045905],"about_ca_topic_score_codex":0.0000613033,"about_ca_topic_score_gemma":0.00001237678,"teacher_disagreement_score":0.8389314,"about_ca_system_score_codex":0.0000147372175,"about_ca_system_score_gemma":0.000009567524,"threshold_uncertainty_score":0.9999949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27664188,0.000037914735,0.72144836,0.00095906836,0.00016486619,0.00032959649,0.00022995776,0.000063412575,0.00012491902],"genre_scores_gemma":[0.99769264,0.000033758253,0.0012724478,0.00091954984,0.0000052635687,0.00005942568,0.000013171196,0.0000034060122,3.1986434e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988534,0.000087254986,0.00029049668,0.00021130353,0.00033751523,0.00022003143],"domain_scores_gemma":[0.99925274,0.00009658327,0.00010521893,0.00035793707,0.00007712914,0.00011040828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040297504,0.00013715343,0.0001644213,0.00029134474,0.0006085085,0.0002688993,0.00036602753,0.00004867253,0.000012878493],"category_scores_gemma":[0.0000052672076,0.00012991247,0.000035406138,0.0005581578,0.000069639216,0.0012321749,0.00003882004,0.00046388392,5.53063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018282396,0.0013249234,0.014512204,0.0012242375,0.00020824472,0.000053159216,0.10156291,0.32818747,0.000025321513,0.35823053,0.0013160869,0.19152668],"study_design_scores_gemma":[0.002442193,0.00035647376,0.007514477,0.000035598285,0.000015093687,0.000054994834,0.0009592002,0.9698894,0.000101839345,0.015030786,0.0032297655,0.000370189],"about_ca_topic_score_codex":0.00039109073,"about_ca_topic_score_gemma":0.0003545882,"teacher_disagreement_score":0.7210508,"about_ca_system_score_codex":0.00004933588,"about_ca_system_score_gemma":0.00006475347,"threshold_uncertainty_score":0.5297677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12817915,0.0000055088326,0.86851877,0.0019970532,0.00035630827,0.00023000398,0.000058925663,0.00046080485,0.00019350309],"genre_scores_gemma":[0.9860465,0.00007246281,0.013518714,0.00025493794,0.0000038742032,0.000058069374,0.000033779103,0.000007898521,0.0000037927837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851865,0.00007427709,0.00029425818,0.000249654,0.0005651663,0.00029801024],"domain_scores_gemma":[0.9981956,0.000058133613,0.0001481147,0.0014496765,0.00006272622,0.00008576996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001929253,0.00019376956,0.00017531506,0.00027635696,0.00080338697,0.00022012375,0.0027611714,0.00007132042,0.00004509569],"category_scores_gemma":[0.00007820287,0.00017287472,0.00006251417,0.00050970516,0.00013752806,0.0011964629,0.00055589236,0.0007740987,0.0000079394],"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.00079886697,0.00044361642,0.00018420964,0.00012880558,0.00023873933,0.000019220348,0.0063171126,0.030057937,0.00005517381,0.17568906,0.007297868,0.7787694],"study_design_scores_gemma":[0.0026754355,0.0014755299,0.0004213494,0.000042882028,0.00003398488,0.00009599519,0.00043260324,0.78652835,0.007046019,0.17882808,0.021777421,0.0006423443],"about_ca_topic_score_codex":0.000035277386,"about_ca_topic_score_gemma":0.000005617251,"teacher_disagreement_score":0.8578673,"about_ca_system_score_codex":0.00010983779,"about_ca_system_score_gemma":0.000052413867,"threshold_uncertainty_score":0.7049626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154408375,0.00000579982,0.973578,0.0011915447,0.0012264426,0.0006016483,0.00028982494,0.00039505644,0.0072708926],"genre_scores_gemma":[0.9936785,0.00011407219,0.0026875997,0.0031872657,0.000038029048,0.00008251274,0.00016957312,0.000011884671,0.000030561903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973557,0.00006790876,0.0010442683,0.0002762886,0.00077802193,0.00047782442],"domain_scores_gemma":[0.9976429,0.00014434039,0.00046740368,0.00064403104,0.0007520548,0.00034930912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0005616592,0.000449739,0.00035481682,0.00063672604,0.0007787836,0.0015985635,0.00036400312,0.00032250062,0.000016703216],"category_scores_gemma":[0.000029507071,0.00043628304,0.00016422161,0.0007496106,0.00023501403,0.021064658,0.000006783355,0.0006049196,0.00020637552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079004836,0.000088444904,0.000009956589,0.00014861273,0.00006504248,2.0388022e-7,0.009584702,0.0025737786,0.0000031146085,0.12656298,0.002118305,0.85876584],"study_design_scores_gemma":[0.003619095,0.0012665195,0.00056214,0.00014062805,0.00012299632,0.00012923082,0.001045888,0.7443719,0.008035261,0.110304296,0.1288037,0.0015983406],"about_ca_topic_score_codex":0.00008727339,"about_ca_topic_score_gemma":0.00006848121,"teacher_disagreement_score":0.9782377,"about_ca_system_score_codex":0.00012118439,"about_ca_system_score_gemma":0.00009868461,"threshold_uncertainty_score":0.9998089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154408375,0.00000579982,0.973578,0.0011915447,0.0012264426,0.0006016483,0.00028982494,0.00039505644,0.0072708926],"genre_scores_gemma":[0.9936785,0.00011407219,0.0026875997,0.0031872657,0.000038029048,0.00008251274,0.00016957312,0.000011884671,0.000030561903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973557,0.00006790876,0.0010442683,0.0002762886,0.00077802193,0.00047782442],"domain_scores_gemma":[0.9976429,0.00014434039,0.00046740368,0.00064403104,0.0007520548,0.00034930912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0005616592,0.000449739,0.00035481682,0.00063672604,0.0007787836,0.0015985635,0.00036400312,0.00032250062,0.000016703216],"category_scores_gemma":[0.000029507071,0.00043628304,0.00016422161,0.0007496106,0.00023501403,0.021064658,0.000006783355,0.0006049196,0.00020637552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079004836,0.000088444904,0.000009956589,0.00014861273,0.00006504248,2.0388022e-7,0.009584702,0.0025737786,0.0000031146085,0.12656298,0.002118305,0.85876584],"study_design_scores_gemma":[0.003619095,0.0012665195,0.00056214,0.00014062805,0.00012299632,0.00012923082,0.001045888,0.7443719,0.008035261,0.110304296,0.1288037,0.0015983406],"about_ca_topic_score_codex":0.00008727339,"about_ca_topic_score_gemma":0.00006848121,"teacher_disagreement_score":0.9782377,"about_ca_system_score_codex":0.00012118439,"about_ca_system_score_gemma":0.00009868461,"threshold_uncertainty_score":0.9998089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154408375,0.00000579982,0.973578,0.0011915447,0.0012264426,0.0006016483,0.00028982494,0.00039505644,0.0072708926],"genre_scores_gemma":[0.9936785,0.00011407219,0.0026875997,0.0031872657,0.000038029048,0.00008251274,0.00016957312,0.000011884671,0.000030561903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973557,0.00006790876,0.0010442683,0.0002762886,0.00077802193,0.00047782442],"domain_scores_gemma":[0.9976429,0.00014434039,0.00046740368,0.00064403104,0.0007520548,0.00034930912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0005616592,0.000449739,0.00035481682,0.00063672604,0.0007787836,0.0015985635,0.00036400312,0.00032250062,0.000016703216],"category_scores_gemma":[0.000029507071,0.00043628304,0.00016422161,0.0007496106,0.00023501403,0.021064658,0.000006783355,0.0006049196,0.00020637552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079004836,0.000088444904,0.000009956589,0.00014861273,0.00006504248,2.0388022e-7,0.009584702,0.0025737786,0.0000031146085,0.12656298,0.002118305,0.85876584],"study_design_scores_gemma":[0.003619095,0.0012665195,0.00056214,0.00014062805,0.00012299632,0.00012923082,0.001045888,0.7443719,0.008035261,0.110304296,0.1288037,0.0015983406],"about_ca_topic_score_codex":0.00008727339,"about_ca_topic_score_gemma":0.00006848121,"teacher_disagreement_score":0.9782377,"about_ca_system_score_codex":0.00012118439,"about_ca_system_score_gemma":0.00009868461,"threshold_uncertainty_score":0.9998089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6199136,0.000047359932,0.3760938,0.00010954912,0.00089626375,0.00048505064,0.000034864708,0.00017024795,0.0022492649],"genre_scores_gemma":[0.9993043,0.00014978688,0.00017949007,0.00011874404,0.000017299848,0.00010429901,0.000053546322,0.000012373679,0.000060138926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984217,0.0000541735,0.00051188824,0.00014843527,0.000516451,0.00034733288],"domain_scores_gemma":[0.9995592,0.000049444665,0.00004827617,0.00017577673,0.000052256568,0.000115004405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040912413,0.00019657363,0.00018681858,0.00033412804,0.000519138,0.00006683102,0.00013086434,0.000073088515,0.0001905038],"category_scores_gemma":[0.0000032682499,0.000213174,0.000075705066,0.0003679779,0.00006623496,0.000539478,0.000010863569,0.0007546828,0.000024251867],"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.00006526289,0.000032823526,0.00006780579,0.00006176881,0.000022033388,0.0000024584958,0.006380563,0.98725027,0.000040540952,0.00020156002,0.000605316,0.00526962],"study_design_scores_gemma":[0.0010513271,0.00029537897,0.00027189383,0.000019779533,0.000012614351,0.000026001793,0.002234473,0.9797955,0.0024921976,0.000040930507,0.013477161,0.00028271961],"about_ca_topic_score_codex":0.000106992746,"about_ca_topic_score_gemma":0.000088408204,"teacher_disagreement_score":0.37939072,"about_ca_system_score_codex":0.00026768987,"about_ca_system_score_gemma":0.000036475747,"threshold_uncertainty_score":0.86929834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06927155,0.00004293765,0.9273253,0.00094181387,0.0005048887,0.0003655594,0.00049749465,0.00023447284,0.00081596273],"genre_scores_gemma":[0.9922757,0.00009724983,0.006812008,0.00064834696,0.000021013357,0.000060536146,0.000072716146,0.000008150534,0.000004282538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827325,0.0000947682,0.00040957562,0.00030030264,0.00058930006,0.0003328205],"domain_scores_gemma":[0.99869674,0.000074943906,0.00021166158,0.0006976923,0.00014376602,0.00017519719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043829984,0.0002362751,0.00022308859,0.00029820346,0.0009455109,0.00029101325,0.0006166298,0.000069119356,0.00008514447],"category_scores_gemma":[0.000007683099,0.00022706325,0.00011123436,0.00072267384,0.00010435885,0.0032867012,0.00006134695,0.0006758763,0.000007928638],"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.0013332936,0.0012146356,0.0004539616,0.0008559935,0.0005357977,0.00008975341,0.13197978,0.029214643,0.000052863277,0.691096,0.01420123,0.12897202],"study_design_scores_gemma":[0.00611905,0.002066275,0.000493619,0.0001591618,0.00015511682,0.00053326046,0.007323036,0.6618011,0.0042731785,0.14708097,0.16783212,0.002163118],"about_ca_topic_score_codex":0.00024227712,"about_ca_topic_score_gemma":0.00009603207,"teacher_disagreement_score":0.92300415,"about_ca_system_score_codex":0.00007240507,"about_ca_system_score_gemma":0.00009255575,"threshold_uncertainty_score":0.9259371},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068317786,0.000068976944,0.926036,0.003924318,0.00045578956,0.00025745877,0.000055691115,0.00059094635,0.00029306283],"genre_scores_gemma":[0.9369846,0.0002985466,0.06219562,0.00041156937,0.000006010859,0.00006057881,0.000023290684,0.000008920281,0.000010862151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985748,0.000096327305,0.00034486514,0.00026941203,0.00038851966,0.00032607093],"domain_scores_gemma":[0.99809,0.00017634129,0.00015274622,0.0013971378,0.00008505039,0.00009866817],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004205311,0.00017908783,0.00018756467,0.00021609975,0.0014693018,0.00055299327,0.0025872786,0.0001150039,0.0000638099],"category_scores_gemma":[0.0006523828,0.00019363119,0.000043993008,0.00058510894,0.00008539821,0.0021540846,0.0014052233,0.00092709676,0.0000065771046],"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.00074574514,0.0006243368,0.0012209682,0.0007679985,0.0005998241,0.000047501722,0.035372082,0.045264762,0.000524183,0.11741449,0.09694726,0.70047086],"study_design_scores_gemma":[0.0006302482,0.00017476662,0.00007880061,0.000030941115,0.000011928661,0.000043921824,0.0005716299,0.80805045,0.001650422,0.16356087,0.024902532,0.00029350712],"about_ca_topic_score_codex":0.00009092009,"about_ca_topic_score_gemma":0.0000071797913,"teacher_disagreement_score":0.8686668,"about_ca_system_score_codex":0.00009041459,"about_ca_system_score_gemma":0.00005559694,"threshold_uncertainty_score":0.99983066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031113364,0.000005958888,0.99231815,0.0012508566,0.0017969123,0.00044394156,0.00020787258,0.00023740457,0.00062757934],"genre_scores_gemma":[0.98675495,0.0000118565895,0.012457493,0.0004512494,0.000059788985,0.00007134056,0.0001354471,0.000009464903,0.000048414986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983776,0.00011569855,0.0004054646,0.00031027303,0.000546147,0.00024477518],"domain_scores_gemma":[0.9988257,0.000051602583,0.00020199109,0.00071547297,0.000113898735,0.00009133133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059683673,0.00017251389,0.00017092479,0.00020651301,0.001087206,0.00029184856,0.00076094427,0.000072952775,0.0001276311],"category_scores_gemma":[0.000027151702,0.00018882494,0.000056877947,0.00048461906,0.000042108113,0.0039767674,0.0000788421,0.00065021106,0.000026178122],"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.00026336126,0.00015814573,0.000030107934,0.00012626828,0.00012710426,0.0000068306404,0.015816312,0.8218359,0.00005471922,0.014958726,0.008250302,0.13837226],"study_design_scores_gemma":[0.0009590352,0.00014739705,0.000041533753,0.000007565923,0.000017582503,0.000041464034,0.0003195596,0.9523258,0.00019727764,0.002062873,0.04363949,0.00024039127],"about_ca_topic_score_codex":0.00021898911,"about_ca_topic_score_gemma":0.000018816987,"teacher_disagreement_score":0.9836436,"about_ca_system_score_codex":0.00013374156,"about_ca_system_score_gemma":0.00011228042,"threshold_uncertainty_score":0.83620185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41319478,0.000045452078,0.5793017,0.00041850927,0.000834727,0.00077262835,0.00075949734,0.0012287908,0.0034438733],"genre_scores_gemma":[0.99898463,0.00013611751,0.00016782207,0.00035440837,0.0000109013545,0.0002520724,0.000060306913,0.000020135758,0.000013580645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989024,0.000055514887,0.00035989267,0.0001223735,0.00036113625,0.0001987246],"domain_scores_gemma":[0.9992641,0.00008303167,0.000087248394,0.00042293064,0.000070182265,0.00007246277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026959545,0.0001944511,0.00017324589,0.00029737808,0.0005368136,0.00007799214,0.00019029743,0.00009199738,0.000115127834],"category_scores_gemma":[0.0000058588603,0.00022342325,0.00008296915,0.00028825417,0.00007043676,0.00068304554,0.000007052276,0.00059717445,0.000018696046],"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.00045295438,0.001033414,0.000014046127,0.00089892914,0.00056659296,0.00000422588,0.16710652,0.46053421,0.00084192783,0.28251222,0.019839117,0.06619584],"study_design_scores_gemma":[0.0007784599,0.00026381656,0.00021311072,0.000052819152,0.000043906035,0.000021276792,0.00094110146,0.9347504,0.00885587,0.045904454,0.0075623887,0.0006124265],"about_ca_topic_score_codex":0.000042746466,"about_ca_topic_score_gemma":0.000026440019,"teacher_disagreement_score":0.58578986,"about_ca_system_score_codex":0.00016687215,"about_ca_system_score_gemma":0.000014070233,"threshold_uncertainty_score":0.9110936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025580047,0.00021420103,0.9725692,0.00018607036,0.00007917431,0.00050635973,0.000024131083,0.00039803918,0.00044274246],"genre_scores_gemma":[0.9751147,0.00061242084,0.023940243,0.000055273904,0.000004029236,0.00021880242,0.000030056253,0.000018406632,0.000006085124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990429,0.0000912011,0.0003768118,0.00010742029,0.00017632166,0.00020532732],"domain_scores_gemma":[0.99931383,0.00015517819,0.00008878683,0.00032597774,0.00007343908,0.0000427846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025818284,0.00017611207,0.0001832146,0.00020636525,0.0006468312,0.00006316431,0.00019770123,0.000081924576,0.00002900836],"category_scores_gemma":[0.0000044385547,0.00017602224,0.00002890288,0.00056319655,0.000053592317,0.0009919794,0.000008097512,0.0007106182,0.000002428627],"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.00005921495,0.0000208757,0.000014905818,0.000027131528,0.00001850727,3.844315e-7,0.005693351,0.9534956,0.0000671627,0.0005849134,0.00009117892,0.039926745],"study_design_scores_gemma":[0.0010491805,0.00016766552,0.000056910914,0.00010888585,0.000013077707,0.000015697262,0.0025998435,0.9793976,0.009766105,0.001596295,0.0049103745,0.0003183715],"about_ca_topic_score_codex":0.000015386902,"about_ca_topic_score_gemma":0.00005036119,"teacher_disagreement_score":0.94953465,"about_ca_system_score_codex":0.00014719437,"about_ca_system_score_gemma":0.000023095467,"threshold_uncertainty_score":0.7177979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01751869,0.0000057194643,0.97736067,0.002728158,0.0011757984,0.0003900967,0.00038178038,0.0003102764,0.00012879423],"genre_scores_gemma":[0.9733602,0.000024906896,0.02596379,0.00037989725,0.000010833942,0.00017812438,0.000071406044,0.000005498668,0.0000053541607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887174,0.0000386191,0.00032445704,0.00020634805,0.00034574803,0.00021309307],"domain_scores_gemma":[0.9984292,0.00009798927,0.00013184668,0.0012225821,0.000060059643,0.000058316353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030451306,0.00013433908,0.00013330166,0.00032307458,0.0005831228,0.00018399165,0.0022238954,0.00006689565,0.000017270866],"category_scores_gemma":[0.00012814072,0.00013719175,0.000071101356,0.0004058702,0.000049692542,0.0011494835,0.0005699354,0.00030868812,0.0000052400383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003418325,0.0004286357,0.00004447038,0.00020555916,0.0002550167,0.0000032372134,0.004827274,0.0037210577,0.00019878615,0.15787193,0.11163438,0.7204678],"study_design_scores_gemma":[0.0011000765,0.00066547643,0.00007416255,0.000009721159,0.000022074226,0.00003307665,0.00031313946,0.6982863,0.007089689,0.25274083,0.039345924,0.00031952572],"about_ca_topic_score_codex":0.000023550632,"about_ca_topic_score_gemma":0.000007455576,"teacher_disagreement_score":0.9558415,"about_ca_system_score_codex":0.00017189422,"about_ca_system_score_gemma":0.00002757531,"threshold_uncertainty_score":0.5594517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.315934,0.000040087616,0.6816296,0.0006500443,0.000676675,0.00028777236,0.00033596807,0.00009172082,0.00035414813],"genre_scores_gemma":[0.99739397,0.00007712055,0.0019161846,0.00053623074,0.000010577199,0.00003176734,0.000028847991,0.0000035510843,0.0000017701847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.00007894109,0.0003308048,0.00020787008,0.000318315,0.00021394121],"domain_scores_gemma":[0.99927044,0.00008291186,0.00009613575,0.000403945,0.00004704267,0.00009951454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017904,0.00013756205,0.00014589936,0.000329967,0.00053470564,0.00017354306,0.0003063525,0.000053943724,0.000028066132],"category_scores_gemma":[0.000008659328,0.00014749826,0.000054835546,0.0006091773,0.00006370006,0.0011312243,0.0000543929,0.00042834246,0.0000036679255],"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.0005469729,0.0009194532,0.0013891847,0.00068895234,0.00014327867,0.000045097768,0.2056379,0.08247654,0.00007649618,0.5535257,0.0140141025,0.14053634],"study_design_scores_gemma":[0.0023706139,0.00037129465,0.0013894585,0.000052864994,0.000023366947,0.00012752808,0.0037162164,0.887188,0.0005546719,0.042835962,0.060653508,0.0007164855],"about_ca_topic_score_codex":0.00021402154,"about_ca_topic_score_gemma":0.000078428464,"teacher_disagreement_score":0.80471146,"about_ca_system_score_codex":0.000050579387,"about_ca_system_score_gemma":0.000038894497,"threshold_uncertainty_score":0.6014804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87753105,0.000027861704,0.11684757,0.00017996908,0.0005088136,0.0006005712,0.0004211199,0.00047694825,0.0034060755],"genre_scores_gemma":[0.9995513,0.00014787537,0.00003604978,0.00008009423,0.000011417885,0.000092318536,0.000065710956,0.000012349504,0.0000028621778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988364,0.00006768608,0.00046515776,0.000068695255,0.0003562959,0.00020577892],"domain_scores_gemma":[0.9990614,0.00020244472,0.00015911888,0.00036753097,0.00013974123,0.00006977021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028943844,0.00019366966,0.00019684395,0.00022914166,0.00063611043,0.00010779782,0.00021354378,0.00008194316,0.000021736743],"category_scores_gemma":[0.0000075970866,0.00016568841,0.00015442725,0.0003752044,0.00009137676,0.0011733648,0.000010039155,0.0007180787,0.000012294995],"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.00011765821,0.00008441906,0.00000710841,0.000047401743,0.00012988209,1.6379052e-7,0.019304393,0.9452548,0.00008385549,0.01531353,0.0013092038,0.018347578],"study_design_scores_gemma":[0.00064563524,0.00037941057,0.00018914983,0.000028819197,0.000025608491,0.000014019884,0.0017464301,0.9680513,0.008933921,0.01619549,0.0034786465,0.00031153223],"about_ca_topic_score_codex":0.00010095423,"about_ca_topic_score_gemma":0.000009762051,"teacher_disagreement_score":0.122020245,"about_ca_system_score_codex":0.00022144333,"about_ca_system_score_gemma":0.00003359838,"threshold_uncertainty_score":0.6756577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22921008,0.00002301282,0.7660686,0.0034094732,0.00036531076,0.00020740503,0.000057664492,0.00042100096,0.00023745565],"genre_scores_gemma":[0.9524943,0.00002186648,0.046916664,0.00049060705,0.000009785012,0.00004019482,0.00001703784,0.000007713638,0.0000018330317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846536,0.00008587982,0.0003775364,0.00030769416,0.0004492346,0.0003142997],"domain_scores_gemma":[0.99766135,0.00021451562,0.000085889806,0.0018148865,0.0000907022,0.00013266651],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046031247,0.00018237116,0.00017129749,0.00022177059,0.0013472077,0.00049911696,0.002817328,0.00011411195,0.00002381464],"category_scores_gemma":[0.000673447,0.00019029876,0.000038848197,0.00047896933,0.00011383476,0.0015939648,0.001553026,0.00074645446,0.0000047175986],"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.00044355195,0.00096732995,0.00054029253,0.00039280966,0.00024971008,0.000044320906,0.030360317,0.038817808,0.00039317072,0.13072142,0.018457985,0.7786113],"study_design_scores_gemma":[0.00034305907,0.00020548508,0.0002549676,0.00002140699,0.000009631894,0.000045003642,0.00042968593,0.9229603,0.0012826779,0.07333944,0.00088294665,0.00022539226],"about_ca_topic_score_codex":0.000051883453,"about_ca_topic_score_gemma":0.000013446272,"teacher_disagreement_score":0.8841425,"about_ca_system_score_codex":0.000091069276,"about_ca_system_score_gemma":0.00004992475,"threshold_uncertainty_score":0.9999529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111010745,0.000022343487,0.8875045,0.00019771713,0.0006770556,0.0002711725,0.000034231274,0.00018974884,0.00009247586],"genre_scores_gemma":[0.9989799,0.00008518475,0.00046490072,0.00035693988,0.000021719607,0.000047130758,0.000021863772,0.000006054997,0.000016304462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905485,0.000030593204,0.00030948393,0.00016845035,0.00016035202,0.00027628164],"domain_scores_gemma":[0.99944824,0.00012383715,0.000076938086,0.00019876324,0.000080736376,0.00007149658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538424,0.00013226613,0.00015302104,0.00025743444,0.00034304886,0.00023897381,0.00016559107,0.00009546232,0.0000013336719],"category_scores_gemma":[0.000006592149,0.00013571032,0.00008477262,0.00041998253,0.000026881655,0.0012097793,0.000007075637,0.00024143406,0.000010392875],"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.000096348915,0.000066075314,0.00011213862,0.00013066597,0.000051030253,0.0000065845634,0.007022493,0.81928045,0.000070807415,0.0106351115,0.0009277203,0.1616006],"study_design_scores_gemma":[0.00059721863,0.0000588478,0.000048990627,0.000046585166,0.000006406964,0.000009557973,0.000102355014,0.99514526,0.0004283361,0.0024270792,0.00097225886,0.00015709012],"about_ca_topic_score_codex":0.000101126076,"about_ca_topic_score_gemma":0.00016959985,"teacher_disagreement_score":0.88796914,"about_ca_system_score_codex":0.000051930092,"about_ca_system_score_gemma":0.000027108303,"threshold_uncertainty_score":0.5534106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34254947,0.000031898893,0.6554337,0.00037962932,0.0005004134,0.00025319553,0.00046583157,0.00020525952,0.00018058959],"genre_scores_gemma":[0.99705595,0.0003749189,0.002127334,0.00027069254,0.000017250446,0.000012280158,0.00013574985,0.0000050411263,8.08796e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998524,0.000059927137,0.00041675163,0.00033922342,0.000357687,0.00030237116],"domain_scores_gemma":[0.9985094,0.00016806765,0.000098312834,0.0010174565,0.00007017472,0.00013658221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070699904,0.00018432607,0.00019172265,0.00052658067,0.00032844843,0.0003197249,0.0006431461,0.00012930584,0.000009726105],"category_scores_gemma":[0.000031158692,0.00018386598,0.000048278318,0.00128518,0.000112026806,0.0024645468,0.00010041258,0.00038230157,0.000009182103],"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.0005880039,0.001242666,0.006787846,0.0017555954,0.00036749232,0.00007296935,0.10067565,0.03315406,0.00020597446,0.57794917,0.023094703,0.2541059],"study_design_scores_gemma":[0.0011218821,0.00007286614,0.0096710175,0.00006518886,0.000016457547,0.000012643236,0.0003768555,0.9363697,0.0003123218,0.04639238,0.0052023767,0.0003862628],"about_ca_topic_score_codex":0.00028618684,"about_ca_topic_score_gemma":0.0003044121,"teacher_disagreement_score":0.9032157,"about_ca_system_score_codex":0.000020115072,"about_ca_system_score_gemma":0.00004061695,"threshold_uncertainty_score":0.7497837},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124312855,0.000012644725,0.85602707,0.0016131772,0.0009849817,0.000554974,0.000028274932,0.00064151327,0.015824532],"genre_scores_gemma":[0.9981906,0.00003855242,0.0012037159,0.00040747106,0.000010153295,0.000037109705,0.000008469887,0.0000047513877,0.00009922175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891466,0.0000180929,0.00035392438,0.0001699096,0.00023917039,0.0003042311],"domain_scores_gemma":[0.99944633,0.00006703644,0.00008671409,0.0002294223,0.00008256271,0.000087941255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030945698,0.00014346436,0.00016885351,0.0002695248,0.00018006832,0.00032332196,0.00019667036,0.00008117394,0.0000047941076],"category_scores_gemma":[0.000008887674,0.00013413341,0.00007417503,0.00068931887,0.000075353615,0.0017200635,0.000010346054,0.00023118845,0.00011155713],"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.00004230676,0.000082816674,0.00009499099,0.00009169092,0.000036802554,0.000011763513,0.007691652,0.0211893,0.000009561796,0.098887295,0.0007488205,0.871113],"study_design_scores_gemma":[0.0024613598,0.00025162296,0.0009558601,0.00009794863,0.000013671446,0.000030406365,0.0013896417,0.8635124,0.0021091,0.11762353,0.0109058665,0.00064858113],"about_ca_topic_score_codex":0.000040906376,"about_ca_topic_score_gemma":0.00006647199,"teacher_disagreement_score":0.8738777,"about_ca_system_score_codex":0.000036114317,"about_ca_system_score_gemma":0.00003756908,"threshold_uncertainty_score":0.5469802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26327464,0.00015582304,0.7281821,0.006166245,0.00043823398,0.00039161873,0.00036449984,0.00086546456,0.00016140702],"genre_scores_gemma":[0.95228076,0.00077148457,0.04644413,0.00024514567,0.000018942172,0.00002568803,0.00018263415,0.000013284393,0.000017932838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.000033927136,0.00032435058,0.00034406563,0.00029219667,0.00025214354],"domain_scores_gemma":[0.996755,0.0001252767,0.00011628671,0.002840111,0.00007962827,0.00008371335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046299535,0.00018378631,0.00016826758,0.0003244422,0.0003714018,0.00035501193,0.0025329988,0.00014385983,0.0000057197253],"category_scores_gemma":[0.0003816888,0.00018299789,0.000020203448,0.00062592555,0.00018434953,0.0030641656,0.0017968427,0.000297215,0.000020823883],"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.00070826407,0.0005716345,0.001692991,0.004072063,0.00071609835,0.00004079322,0.02458618,0.006360747,0.001901359,0.056951392,0.19267166,0.7097268],"study_design_scores_gemma":[0.00035223353,0.000050005932,0.0013395207,0.000060311835,0.000010643536,0.000019176081,0.00011265703,0.9669947,0.00032248558,0.029526893,0.0010082519,0.00020314126],"about_ca_topic_score_codex":0.00006151065,"about_ca_topic_score_gemma":0.000024203711,"teacher_disagreement_score":0.96063393,"about_ca_system_score_codex":0.000036545127,"about_ca_system_score_gemma":0.000045470253,"threshold_uncertainty_score":0.7462437},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21706668,0.00003157557,0.7724181,0.0072920085,0.00068165344,0.00040131545,0.0005390786,0.0013187159,0.00025092857],"genre_scores_gemma":[0.975235,0.0003916072,0.023739962,0.00042591966,0.000016150596,0.000017941133,0.00014132705,0.000012506333,0.000019621257],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840933,0.000047099995,0.00041100467,0.00039486348,0.00039799113,0.0003397062],"domain_scores_gemma":[0.9944687,0.0001970245,0.00015970606,0.00495225,0.000109539775,0.000112781796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060277025,0.00020634734,0.00019438383,0.0003890959,0.00042715677,0.0003845676,0.0047673937,0.00017223528,0.000011757918],"category_scores_gemma":[0.00087926444,0.00020193998,0.000037595608,0.0009055786,0.00016267369,0.0021000956,0.0025801228,0.00039412605,0.000043858112],"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.0002120972,0.000272422,0.00025287236,0.00088500255,0.0003518295,0.00006857628,0.010400289,0.00895867,0.0005828161,0.017314862,0.59118074,0.36951983],"study_design_scores_gemma":[0.0005373366,0.000042047202,0.0003642833,0.00006584433,0.000013518759,0.000020722193,0.00013195234,0.96989584,0.001063655,0.021328392,0.0062948363,0.00024156366],"about_ca_topic_score_codex":0.0001363524,"about_ca_topic_score_gemma":0.000032952677,"teacher_disagreement_score":0.9609372,"about_ca_system_score_codex":0.000045896617,"about_ca_system_score_gemma":0.000053628493,"threshold_uncertainty_score":0.88590825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55388945,0.00001861507,0.44001237,0.00016829351,0.002778415,0.00082007266,0.0010492635,0.0007256217,0.0005379282],"genre_scores_gemma":[0.9991605,0.000060212566,0.00018111421,0.00010790091,0.00020205927,0.00017441768,0.000075148404,0.000022359227,0.000016279639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987173,0.000014203576,0.0003751841,0.00017981969,0.0003039905,0.0004094808],"domain_scores_gemma":[0.9990984,0.000259373,0.00004609997,0.00024544948,0.00012124304,0.00022939598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016817234,0.0002443751,0.000278475,0.00025833707,0.00032382732,0.00032377322,0.00013577788,0.00019284319,0.0000056048752],"category_scores_gemma":[0.000023559558,0.00023980928,0.0001386335,0.00053304946,0.00008634894,0.001019263,0.0000043391683,0.00039098188,0.00020393406],"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.00060706434,0.000383251,0.00016673523,0.0030291127,0.0005525512,0.000013833937,0.08618091,0.74120575,0.0002728034,0.103153825,0.0286198,0.035814375],"study_design_scores_gemma":[0.00071681244,0.00023153229,0.000142118,0.00013296312,0.000038658196,0.000012512823,0.0014995075,0.94253486,0.0017034984,0.016702317,0.035750043,0.00053519465],"about_ca_topic_score_codex":0.000017753693,"about_ca_topic_score_gemma":0.000012068138,"teacher_disagreement_score":0.44527107,"about_ca_system_score_codex":0.000061633815,"about_ca_system_score_gemma":0.000025046418,"threshold_uncertainty_score":0.97791386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033926453,0.000018785586,0.9602377,0.0024070314,0.00043719102,0.00021056762,0.00008567215,0.0014477008,0.0012289115],"genre_scores_gemma":[0.98796785,0.00083298574,0.0107997125,0.0002600711,0.000011648999,0.000023066385,0.00007493577,0.000009877183,0.000019869163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998435,0.000051357656,0.00042446668,0.00028879585,0.000402484,0.00039790213],"domain_scores_gemma":[0.9977107,0.00021503026,0.00016239511,0.0016471193,0.00015155469,0.00011318489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052081305,0.00022085407,0.00019742464,0.0004970266,0.0005026329,0.0003833946,0.0027288736,0.00017524784,0.00000779267],"category_scores_gemma":[0.0004734838,0.00021973076,0.00007578856,0.0010181271,0.00015201874,0.0038463888,0.0004782402,0.0007037609,0.000086706095],"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.00008006954,0.00013690091,0.00019800755,0.000475374,0.00020505325,0.000021584658,0.021723606,0.4305405,0.00009809108,0.086676136,0.014972262,0.44487244],"study_design_scores_gemma":[0.00029478205,0.00005749989,0.000012272386,0.000041856903,0.000006795025,0.0000041378976,0.0002744404,0.8672671,0.0014176421,0.1286225,0.0017843595,0.00021662035],"about_ca_topic_score_codex":0.000059105572,"about_ca_topic_score_gemma":0.000045424134,"teacher_disagreement_score":0.95404136,"about_ca_system_score_codex":0.00007059413,"about_ca_system_score_gemma":0.000045754896,"threshold_uncertainty_score":0.8960361},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5578072,0.0000065401255,0.44115126,0.000100748824,0.00016924703,0.00015612533,0.000012984627,0.00007921119,0.00051670923],"genre_scores_gemma":[0.99888474,0.00006241427,0.0009389679,0.000056379125,0.000012268229,0.000014158224,0.000017923163,0.000003403787,0.000009723222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884844,0.000053937805,0.0004055732,0.00014006789,0.00040408713,0.00014790629],"domain_scores_gemma":[0.99930596,0.00007705325,0.00018492229,0.000108452,0.00027814138,0.000045445755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009405263,0.00010366568,0.00013749572,0.0003713218,0.00020202335,0.00013594952,0.00008722139,0.000041197596,0.00001529766],"category_scores_gemma":[0.000006577435,0.00010068459,0.000057726455,0.00051848456,0.000039468836,0.000949632,0.0000065604554,0.00011285379,0.000009602532],"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.000021663169,0.00003223611,0.00041407923,0.00011663997,0.000120582234,6.2199285e-7,0.025413528,0.03799502,0.00004991588,0.23978353,0.00031442533,0.6957378],"study_design_scores_gemma":[0.00040843646,0.000047294427,0.0018591057,0.000026614769,0.000048001657,0.000002506728,0.0009984644,0.99414235,0.0012287945,0.0009331714,0.00019189362,0.00011338146],"about_ca_topic_score_codex":0.000086114305,"about_ca_topic_score_gemma":0.0005116759,"teacher_disagreement_score":0.9561473,"about_ca_system_score_codex":0.000031085125,"about_ca_system_score_gemma":0.00003917491,"threshold_uncertainty_score":0.41057983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06782032,0.000022105669,0.9260236,0.004326873,0.00032186887,0.0002864747,0.00010931915,0.0006605927,0.00042882242],"genre_scores_gemma":[0.9940263,0.0005625363,0.0051383437,0.00016831027,0.0000062796503,0.000029738747,0.00006128681,0.0000042450133,0.0000029663897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988028,0.00003589702,0.0003964755,0.00018730697,0.00034012945,0.00023742756],"domain_scores_gemma":[0.9982692,0.000101644844,0.00015357012,0.0011969123,0.00018304089,0.00009566035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149,0.00017294147,0.00017211518,0.00036554073,0.0004513612,0.00049344153,0.0010610982,0.00016477276,0.0000035266899],"category_scores_gemma":[0.00022136664,0.00016844425,0.000028469265,0.0005872356,0.00019521132,0.007597148,0.00030100302,0.00026652034,0.000028085282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006988519,0.000060406845,0.000768272,0.000463012,0.00007381648,0.0000012891271,0.005349075,0.00033547188,0.000098908444,0.036109105,0.020389182,0.93628156],"study_design_scores_gemma":[0.00047801618,0.00006206421,0.007236111,0.000030819196,0.000012550056,0.000022718801,0.0004357188,0.8523009,0.0013001969,0.1321017,0.005784045,0.00023516643],"about_ca_topic_score_codex":0.000091926326,"about_ca_topic_score_gemma":0.0000332065,"teacher_disagreement_score":0.9360464,"about_ca_system_score_codex":0.000037883783,"about_ca_system_score_gemma":0.00003711573,"threshold_uncertainty_score":0.6868957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016451947,0.00002472224,0.9818936,0.0002676709,0.00018067923,0.00041294418,0.000023031022,0.0003583168,0.00038711817],"genre_scores_gemma":[0.984645,0.000026383972,0.014981819,0.000111894864,0.000016356582,0.00016311363,0.000011296088,0.0000064323112,0.000037722053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992003,0.000018072313,0.00032012488,0.00017302642,0.000115253664,0.00017322155],"domain_scores_gemma":[0.9995605,0.00013482121,0.00006333213,0.00010747268,0.00008360968,0.00005027419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022438022,0.000119121585,0.00011652301,0.00022152014,0.0002836638,0.0002691436,0.00009601363,0.00008857284,0.0000063332764],"category_scores_gemma":[0.000008164997,0.000117952535,0.000067234345,0.00034685453,0.000030383779,0.0012317672,0.0000029133987,0.00028418883,0.0000046802056],"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.00007541568,0.000076263,0.00007588498,0.00031224644,0.00008082439,0.0000024396336,0.022882892,0.05013758,0.00067189755,0.24695031,0.00033965224,0.6783946],"study_design_scores_gemma":[0.0002585901,0.00012464165,0.00022725566,0.000060254817,0.000007758886,0.000009967113,0.00024834348,0.98277926,0.0040749237,0.008416707,0.0036342395,0.00015807693],"about_ca_topic_score_codex":0.00003830997,"about_ca_topic_score_gemma":0.000026923457,"teacher_disagreement_score":0.96819305,"about_ca_system_score_codex":0.00005444595,"about_ca_system_score_gemma":0.000033904784,"threshold_uncertainty_score":0.48099646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011274509,0.00015786389,0.9842083,0.0005930601,0.0006353143,0.0001419965,0.00014106801,0.00034825495,0.002499663],"genre_scores_gemma":[0.9972771,0.000097010176,0.0020654604,0.0004282594,0.000018776502,0.000021181866,0.00001804121,0.0000057829434,0.000068416135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990846,0.000020573163,0.0002725735,0.00017895101,0.00023355847,0.00020973188],"domain_scores_gemma":[0.9994815,0.00004399094,0.000033714776,0.00028204938,0.00006208872,0.00009666773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019379646,0.00013170746,0.00010765876,0.00018540428,0.00022294711,0.00044377826,0.00017804436,0.000093923954,0.000015853944],"category_scores_gemma":[0.0000022999563,0.00012577989,0.000072457085,0.00029697316,0.000024040488,0.003000497,0.000005134692,0.00028474058,0.000041448864],"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.000008253947,0.00008889252,0.0000017803306,0.00017904953,0.00006453834,0.0000055865967,0.0336199,0.009395935,0.00007009573,0.852227,0.0040264167,0.100312576],"study_design_scores_gemma":[0.0001694343,0.00002849417,9.973223e-7,0.000028749957,0.000009580811,0.00001122198,0.00027567983,0.9509498,0.0011711393,0.037287388,0.009920687,0.0001468504],"about_ca_topic_score_codex":0.000048800703,"about_ca_topic_score_gemma":0.000035697,"teacher_disagreement_score":0.98600256,"about_ca_system_score_codex":0.000039190432,"about_ca_system_score_gemma":0.000041961204,"threshold_uncertainty_score":0.5129155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19233653,0.00016857787,0.80222034,0.0039477274,0.00024523409,0.00017941592,0.000013208332,0.00046769303,0.0004212855],"genre_scores_gemma":[0.9787004,0.0002114075,0.020943936,0.0000842595,0.000006404881,0.000017038863,0.00001214555,0.000006078276,0.00001831289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989253,0.000046391564,0.0003375703,0.0002508549,0.00022664471,0.000213184],"domain_scores_gemma":[0.9989777,0.00017801253,0.000071685754,0.0006593182,0.00006815235,0.000045101933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044281888,0.00014102546,0.00012732281,0.00032819854,0.00033617415,0.00085718994,0.0009848297,0.000114262606,0.0000024947517],"category_scores_gemma":[0.00045563062,0.00014125045,0.000025483636,0.00066791486,0.000066313936,0.004174215,0.00026012835,0.0005460648,0.000006909865],"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.00023602271,0.00020451508,0.0015286683,0.0024749683,0.00018989794,0.000044556225,0.045959074,0.023191288,0.0005481505,0.10834513,0.019324878,0.79795283],"study_design_scores_gemma":[0.00027475756,0.00005345751,0.00064871204,0.00026518866,0.0000052831942,0.000008639311,0.00014897651,0.97012264,0.00076471845,0.02115069,0.00636599,0.00019092936],"about_ca_topic_score_codex":0.000029300088,"about_ca_topic_score_gemma":0.00007379201,"teacher_disagreement_score":0.94693136,"about_ca_system_score_codex":0.000075014636,"about_ca_system_score_gemma":0.00003893984,"threshold_uncertainty_score":0.82659024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006868272,0.000043227716,0.98868483,0.0016969038,0.0007252491,0.0002827305,0.00008404646,0.0005343697,0.0010803503],"genre_scores_gemma":[0.997334,0.000025622467,0.0018570275,0.00052491465,0.000013334081,0.00003187068,0.00003871286,0.000008765996,0.00016576552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877393,0.000049304344,0.00039246178,0.00021687352,0.00036023892,0.00020716479],"domain_scores_gemma":[0.9992567,0.00008872206,0.000064513784,0.0003647046,0.00009697748,0.00012841304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030693485,0.00017125599,0.00016906582,0.00031751275,0.00023649105,0.00070494605,0.00024489022,0.00011602684,0.00007112689],"category_scores_gemma":[0.0000032657333,0.00016622695,0.000112295726,0.00045556953,0.00007793081,0.0017315455,0.0000037697846,0.000245979,0.0008485843],"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.00013374376,0.00079394766,0.000010732418,0.0016626326,0.000538891,0.000017048673,0.12694931,0.0019765405,0.0010990974,0.28078514,0.009441329,0.57659155],"study_design_scores_gemma":[0.0002708404,0.000091646936,0.000028910219,0.00007207157,0.000018718109,0.000010201911,0.000028567645,0.9759761,0.00041446357,0.007392933,0.015494239,0.0002012855],"about_ca_topic_score_codex":0.00001869206,"about_ca_topic_score_gemma":0.000014633823,"teacher_disagreement_score":0.9904657,"about_ca_system_score_codex":0.000069291,"about_ca_system_score_gemma":0.00006683096,"threshold_uncertainty_score":0.99992937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406635,0.000006074815,0.7935588,0.00033474958,0.00023462906,0.000979277,0.000099881116,0.0001596548,0.0005606368],"genre_scores_gemma":[0.99901,0.000040341056,0.00020039266,0.0004938796,0.000021383306,0.00021217446,0.0000065604518,0.0000075926096,0.000007675534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878913,0.00011630315,0.00037685345,0.00022512302,0.00035211293,0.00014045875],"domain_scores_gemma":[0.9974482,0.0017835734,0.00011769768,0.0003922929,0.0001362435,0.00012198671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040899843,0.00018625423,0.00014700757,0.00043109915,0.00044442725,0.00029629254,0.00014993889,0.00008619318,0.000037842026],"category_scores_gemma":[0.000116735726,0.00013190985,0.00013077252,0.00072618114,0.0000559951,0.00064284116,0.00000306612,0.00028591004,0.000106841646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018478907,0.0010893261,0.000026370424,0.0001530634,0.00024399473,0.00008555104,0.015640767,0.01921458,0.000040263145,0.022093492,0.0008727969,0.940355],"study_design_scores_gemma":[0.0022260295,0.006260996,0.00050815346,0.00025626007,0.00019034713,0.0015509247,0.0062722615,0.9164703,0.019607067,0.04296885,0.002725965,0.00096286513],"about_ca_topic_score_codex":0.00029103903,"about_ca_topic_score_gemma":0.00011186376,"teacher_disagreement_score":0.93939215,"about_ca_system_score_codex":0.0001677675,"about_ca_system_score_gemma":0.0000967207,"threshold_uncertainty_score":0.5379128},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010403117,0.00013713852,0.9862649,0.00082613307,0.0008373816,0.0003639566,0.0008540875,0.00017950653,0.0001337867],"genre_scores_gemma":[0.9914138,0.00021778994,0.007812144,0.00036996804,0.00005353778,0.000029974317,0.000093141534,0.0000060874527,0.0000035885425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989795,0.000014786518,0.00030434655,0.00033271284,0.00016132176,0.0002073266],"domain_scores_gemma":[0.9988678,0.0001410437,0.000053331354,0.00076286145,0.000074412164,0.00010053439],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047680322,0.00014108692,0.00014671055,0.00019366307,0.0003500144,0.0016922344,0.0008660529,0.00007890917,0.000007696185],"category_scores_gemma":[0.000013429774,0.00012894628,0.000049765717,0.00028708237,0.000053370506,0.007959463,0.00007004592,0.00020795244,0.0000031407696],"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.00026707913,0.00013049351,0.00030792074,0.0024370563,0.00036893642,0.0000072479197,0.016284518,0.0016194457,0.000061389095,0.6908395,0.020357141,0.26731926],"study_design_scores_gemma":[0.00054307125,0.000061854626,0.00009526259,0.0000797349,0.00003016934,0.000018272682,0.000042191303,0.88744,0.00025462353,0.0842054,0.027040794,0.00018859177],"about_ca_topic_score_codex":0.000084894054,"about_ca_topic_score_gemma":0.000046452617,"teacher_disagreement_score":0.9810107,"about_ca_system_score_codex":0.000014386563,"about_ca_system_score_gemma":0.000033297503,"threshold_uncertainty_score":0.9993441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111356445,0.000060413622,0.88518405,0.00035543367,0.00086146884,0.000281861,0.00023381994,0.00036258087,0.0013039226],"genre_scores_gemma":[0.9942725,0.00035801894,0.0048009423,0.00039173517,0.00006904862,0.000037152364,0.000057578516,0.0000096082895,0.0000034750983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985024,0.00004061532,0.0003729707,0.00033160867,0.00044078345,0.00031162854],"domain_scores_gemma":[0.9991116,0.00009239861,0.00008285918,0.0004248232,0.00013087962,0.00015747036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024219078,0.00028265218,0.00022572755,0.00030168306,0.00041802932,0.0005534382,0.0002785015,0.00016696379,0.00003244824],"category_scores_gemma":[0.0000029014302,0.00023916183,0.00011171784,0.0005350285,0.00015937549,0.0037517836,0.000009406702,0.00061429245,0.00002765805],"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.0005081978,0.00021270665,0.00008917421,0.0009420103,0.00022271076,0.0000195262,0.020384327,0.0015896832,0.000090264846,0.06720636,0.0009086331,0.9078264],"study_design_scores_gemma":[0.0021376659,0.0013739449,0.0015732956,0.0004893378,0.00013093739,0.0001520231,0.00044909393,0.9125022,0.036369245,0.019235136,0.024168177,0.0014188949],"about_ca_topic_score_codex":0.0002253075,"about_ca_topic_score_gemma":0.00046565817,"teacher_disagreement_score":0.9109126,"about_ca_system_score_codex":0.000035578578,"about_ca_system_score_gemma":0.0001226085,"threshold_uncertainty_score":0.97527367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013841312,0.00007216341,0.9812859,0.00047908968,0.0014548121,0.00021586487,0.0019517033,0.00045129962,0.00024782497],"genre_scores_gemma":[0.9899929,0.00011008895,0.008902222,0.0004265721,0.000060677212,0.0000054363654,0.00049421744,0.000007108928,7.598757e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983764,0.00004976572,0.00047805253,0.0003922964,0.00039009622,0.00031333187],"domain_scores_gemma":[0.9986021,0.00017625392,0.00007292541,0.0008518861,0.00013008558,0.00016675766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038612453,0.00024126389,0.00021584204,0.00017239517,0.00047512152,0.0008674422,0.0005837549,0.0001636738,0.000024975921],"category_scores_gemma":[0.000015582058,0.0002265075,0.00009699073,0.000693574,0.00016353464,0.004490306,0.000045937923,0.0005546281,0.000023737843],"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.00015756188,0.0002837582,0.00003869108,0.0007482227,0.00032310202,0.000019151123,0.016625974,0.0018731456,0.00015476887,0.6490883,0.010929274,0.31975803],"study_design_scores_gemma":[0.00046039338,0.000121861565,0.00023777828,0.000099196084,0.00004884866,0.000030141771,0.00015556885,0.9176749,0.0016829423,0.044176687,0.034876112,0.00043559354],"about_ca_topic_score_codex":0.000067138826,"about_ca_topic_score_gemma":0.000101525715,"teacher_disagreement_score":0.9761516,"about_ca_system_score_codex":0.000039654304,"about_ca_system_score_gemma":0.00008009473,"threshold_uncertainty_score":0.92367077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45984355,0.00009997512,0.5382524,0.0000042513902,0.00060030667,0.00048653115,0.00024426338,0.00010421834,0.0003645266],"genre_scores_gemma":[0.9996372,0.000081620135,0.0001505841,0.000009711578,0.000008841926,0.000074344345,0.000019273306,0.000009204952,0.000009248938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910605,0.00002091502,0.00043107555,0.00011863047,0.00015422843,0.00016910679],"domain_scores_gemma":[0.9996079,0.00007125679,0.00003751287,0.00013491348,0.00008729685,0.00006108087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026079087,0.00013834507,0.00018200219,0.00025765653,0.00008047361,0.000104113315,0.00005104486,0.00015454402,0.0000037124378],"category_scores_gemma":[0.000004877617,0.0001309328,0.00006630793,0.00035235542,0.000058455946,0.00077983044,7.608527e-7,0.0002842752,0.0000016453398],"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.0006429003,0.00027181994,0.00052184594,0.008408475,0.00023463581,0.00000282727,0.047250047,0.9256119,0.0020437813,0.005404851,0.00025964165,0.009347283],"study_design_scores_gemma":[0.00049175555,0.00016295804,0.00053442427,0.000080196594,0.000014157796,0.0000068893128,0.0010214462,0.9920762,0.00436045,0.00019484921,0.00088209886,0.00017456892],"about_ca_topic_score_codex":0.0001170018,"about_ca_topic_score_gemma":0.00009225485,"teacher_disagreement_score":0.5397936,"about_ca_system_score_codex":0.00008080116,"about_ca_system_score_gemma":0.00002982123,"threshold_uncertainty_score":0.53392845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018977612,0.00006753225,0.97327507,0.0038223222,0.00035154948,0.00022203111,0.00006353424,0.0016897485,0.0015305984],"genre_scores_gemma":[0.8542324,0.00027004987,0.14508408,0.0002880454,0.000011056798,0.00003089765,0.000031585696,0.000015789159,0.00003614777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983002,0.000036585836,0.00047897364,0.00038289063,0.0004070362,0.00039430405],"domain_scores_gemma":[0.9978787,0.00011609008,0.00010477551,0.0016264896,0.00016204173,0.00011195306],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042657967,0.00026905126,0.00021064706,0.00040105477,0.0007157718,0.0013869546,0.0031375203,0.00022853,0.0000049234986],"category_scores_gemma":[0.0003953313,0.00026658093,0.00009391791,0.0006229203,0.00008584103,0.005453537,0.0008233463,0.0009926717,0.000027240601],"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.000012248322,0.000021446633,0.0000034414084,0.00014899785,0.00004771905,0.000003880585,0.0024037976,0.9069618,0.00007877938,0.0055378736,0.008985499,0.07579454],"study_design_scores_gemma":[0.00020951475,0.000038448758,0.0000016839408,0.00014352001,0.000011321154,0.000012622607,0.00011810939,0.929742,0.0012116834,0.067658864,0.0005767927,0.00027548525],"about_ca_topic_score_codex":0.000022459548,"about_ca_topic_score_gemma":0.000014674129,"teacher_disagreement_score":0.8352547,"about_ca_system_score_codex":0.00012867633,"about_ca_system_score_gemma":0.00013680976,"threshold_uncertainty_score":0.99997866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29231143,0.00036910106,0.6973791,0.0005255805,0.005225019,0.00081747223,0.00075384433,0.00087951584,0.0017389552],"genre_scores_gemma":[0.9978255,0.00017240657,0.0014074921,0.00024564168,0.00016403155,0.000083141684,0.000067277324,0.000022457662,0.000012057512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988526,0.000011067041,0.00037806202,0.00015515712,0.0003028359,0.00030026815],"domain_scores_gemma":[0.999346,0.0001680237,0.000032935794,0.00019515883,0.00014282616,0.00011506718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029256416,0.00021019616,0.00016663528,0.00018020473,0.0003070343,0.00033223213,0.00017749221,0.00015582175,0.000024040264],"category_scores_gemma":[0.000015746557,0.0002033486,0.000093614006,0.00034967766,0.000043755274,0.0014693907,0.000006346957,0.00037141115,0.000026433841],"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.00031563014,0.00016033887,0.00008520703,0.01346281,0.001016272,0.000017035238,0.1574377,0.38933575,0.0003757877,0.012413539,0.044839866,0.38054007],"study_design_scores_gemma":[0.0004314347,0.00007907582,0.000057908586,0.00021124225,0.000062972336,0.000041752573,0.0005036078,0.91350085,0.0036343404,0.0031929414,0.07795226,0.00033159292],"about_ca_topic_score_codex":0.000036533525,"about_ca_topic_score_gemma":0.00013682908,"teacher_disagreement_score":0.7055141,"about_ca_system_score_codex":0.000074269694,"about_ca_system_score_gemma":0.000059709895,"threshold_uncertainty_score":0.8292315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23930235,0.002333639,0.7546521,0.0005107343,0.00020747625,0.0005730083,0.0004627907,0.0008556615,0.0011022594],"genre_scores_gemma":[0.98553824,0.009891399,0.004296223,0.00005039277,0.000008763302,0.000036578345,0.00015412581,0.000019276184,0.000005024738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900615,0.00006432543,0.0005020172,0.00012618129,0.00016914622,0.00013215162],"domain_scores_gemma":[0.9990685,0.00021541525,0.000056715442,0.00040592902,0.00015154344,0.00010191445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021947856,0.00020283028,0.00022403203,0.00029625217,0.00022015594,0.0001727095,0.00013250626,0.00020034285,0.000013869986],"category_scores_gemma":[0.000006657572,0.0002023245,0.00004996399,0.00030479167,0.00021343738,0.0008087138,0.0000071430572,0.00047529422,0.0000023081298],"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.000052318752,0.0000982468,0.000013809181,0.001331992,0.000218521,0.0000021390442,0.032666635,0.0025156895,0.005089753,0.017043872,0.0007089714,0.940258],"study_design_scores_gemma":[0.0002587401,0.00009027972,0.0000145593,0.0001779782,0.000054488417,0.000032965258,0.00046598972,0.96372026,0.011127547,0.002477068,0.021361668,0.0002184282],"about_ca_topic_score_codex":0.00007268077,"about_ca_topic_score_gemma":0.00011848926,"teacher_disagreement_score":0.9612046,"about_ca_system_score_codex":0.00005297295,"about_ca_system_score_gemma":0.000027641012,"threshold_uncertainty_score":0.8250554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033789396,0.0000325586,0.9645099,0.00009104061,0.00040291622,0.00018005581,0.000043059794,0.00022276,0.0007282898],"genre_scores_gemma":[0.9854102,0.000014043835,0.014084666,0.0003980304,0.00003820028,0.000014446822,0.000020973694,0.000010468053,0.000008987085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852186,0.00006467669,0.00040229387,0.0003568996,0.0003720293,0.00028223367],"domain_scores_gemma":[0.99926347,0.00015584978,0.000079117315,0.00020728548,0.00014069788,0.0001536111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046410202,0.00024504983,0.00021749435,0.00034206093,0.000391968,0.0007485918,0.00017116359,0.00012242341,0.000005114024],"category_scores_gemma":[0.0000063111565,0.00022068224,0.00012716337,0.00033987334,0.00008856037,0.00096017274,0.0000072788357,0.00045922547,0.00001628324],"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.000030089632,0.00015144826,0.0000019304844,0.00014135093,0.00008143054,0.0000082764755,0.013310581,0.52018493,0.000004105468,0.06641528,0.000073863856,0.39959672],"study_design_scores_gemma":[0.00025202057,0.00016096712,0.000011426321,0.0001051785,0.000031086616,0.000016792526,0.00045115163,0.9981554,0.000112562266,0.000082507504,0.00037259914,0.00024826798],"about_ca_topic_score_codex":0.000012102071,"about_ca_topic_score_gemma":0.000010845736,"teacher_disagreement_score":0.95162076,"about_ca_system_score_codex":0.000063389234,"about_ca_system_score_gemma":0.00005523032,"threshold_uncertainty_score":0.89991605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14031579,0.00002124548,0.85393834,0.0005628844,0.0004087578,0.0019278622,0.000060163507,0.00012901604,0.0026359481],"genre_scores_gemma":[0.9957402,0.00003271835,0.0029458192,0.0007365173,0.0000105666695,0.0004997582,0.000008723526,0.000006697008,0.000019051353],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.000098992234,0.00039583023,0.00026693306,0.00030636362,0.00026845478],"domain_scores_gemma":[0.99919015,0.00020159701,0.000068995716,0.00022762173,0.00013277563,0.00017888087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069213955,0.00022637808,0.00020519856,0.0005942095,0.00020670272,0.0005511436,0.00017124436,0.00012812713,0.0000021525273],"category_scores_gemma":[0.000017545637,0.00020954791,0.00006291629,0.0006865614,0.00008550472,0.0034201667,0.000018093284,0.0004226739,0.0000383836],"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.0016728769,0.00024555373,0.00003226878,0.0004178058,0.00017266828,0.000012771822,0.6077014,0.0077689844,0.000036746602,0.058242276,0.0010058606,0.32269078],"study_design_scores_gemma":[0.0012405727,0.00056644983,0.0040051,0.00013507578,0.000023977249,0.000097544835,0.004388341,0.9766658,0.002056964,0.0040225573,0.0062573566,0.00054027454],"about_ca_topic_score_codex":0.00007842304,"about_ca_topic_score_gemma":0.000049369624,"teacher_disagreement_score":0.9688968,"about_ca_system_score_codex":0.00019993784,"about_ca_system_score_gemma":0.00008812859,"threshold_uncertainty_score":0.85451156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017835532,0.00012161813,0.99534094,0.00039096427,0.0006432671,0.00041097924,0.00004118601,0.00045767784,0.0008098168],"genre_scores_gemma":[0.84337527,0.000391333,0.15554906,0.0004381129,0.000051289626,0.00015142067,0.000019049416,0.000012651031,0.000011829754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891037,0.000024750914,0.00037211392,0.00022091207,0.0001662078,0.00030563874],"domain_scores_gemma":[0.9993971,0.00010588553,0.000057101184,0.0002599487,0.00009844412,0.00008153992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026903235,0.0001892959,0.0001731151,0.00045983502,0.0002577531,0.00048128172,0.00021715325,0.000111350826,0.0000034602347],"category_scores_gemma":[0.00000244062,0.00017054984,0.00015533938,0.00083958835,0.000078796154,0.0032782902,0.000005212536,0.00025961982,0.000006318967],"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.00024934177,0.00019794168,0.00007910698,0.0013167195,0.00021532289,0.000031210635,0.020998277,0.0033317695,0.00026551043,0.5060775,0.008934424,0.45830286],"study_design_scores_gemma":[0.00060805544,0.00034365995,0.000055145236,0.00024163899,0.00002779599,0.000033849672,0.00008078345,0.6055878,0.014004844,0.33067065,0.047840342,0.0005054279],"about_ca_topic_score_codex":0.000011977188,"about_ca_topic_score_gemma":0.000047543275,"teacher_disagreement_score":0.8415917,"about_ca_system_score_codex":0.000026823533,"about_ca_system_score_gemma":0.000026950172,"threshold_uncertainty_score":0.6954821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19715294,0.00006591568,0.80161446,0.00016180874,0.00012662742,0.0003588554,0.000034442703,0.000335189,0.00014975118],"genre_scores_gemma":[0.99613786,0.00056196714,0.003093847,0.000035217356,0.00000431399,0.00011277287,0.000034491888,0.000014623784,0.0000049112655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943143,0.000013572521,0.00022440193,0.00011454627,0.000079529476,0.00013650763],"domain_scores_gemma":[0.99957144,0.00012300648,0.000028915565,0.000109162575,0.00013657214,0.00003087353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009867228,0.00014859467,0.00012885187,0.00028879868,0.00015761968,0.0001135675,0.000048008136,0.0001250315,0.000008409135],"category_scores_gemma":[0.0000069092853,0.00013786253,0.000019016816,0.00049386994,0.0000711494,0.0011666747,0.0000016680148,0.00027531298,0.0000023655628],"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.00013389447,0.000026624253,0.000053848715,0.00033423904,0.00012163073,3.4428115e-7,0.0063109607,0.836268,0.00048734917,0.03918559,0.00006158998,0.117015906],"study_design_scores_gemma":[0.00077472813,0.00019083066,0.00015258638,0.00013082237,0.000019322486,0.000015949292,0.0024324076,0.9805053,0.010675554,0.00391354,0.00091286114,0.00027610938],"about_ca_topic_score_codex":0.000016684622,"about_ca_topic_score_gemma":0.00034624018,"teacher_disagreement_score":0.79898494,"about_ca_system_score_codex":0.00013349282,"about_ca_system_score_gemma":0.000029341389,"threshold_uncertainty_score":0.5621871},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39996448,0.00048684486,0.5949621,0.00007395861,0.0018388921,0.0004680192,0.0000765933,0.00022192861,0.0019071767],"genre_scores_gemma":[0.99966633,0.00017632636,0.00008599976,0.00001433341,0.000011959675,0.00002886108,0.0000070250785,0.0000067508795,0.0000024147907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909097,0.000015898377,0.00039562574,0.00007774758,0.00029125332,0.00012850911],"domain_scores_gemma":[0.999692,0.00004760133,0.000031307067,0.00009195459,0.00009270472,0.00004441952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029072765,0.000111098074,0.00013130403,0.00021178908,0.00006196908,0.00008129722,0.000043769443,0.0000863936,0.0000055741557],"category_scores_gemma":[0.000007424302,0.00010410502,0.00004162123,0.0002675631,0.000047340964,0.00070230896,7.571591e-7,0.0002283815,0.00000728102],"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.000044965047,0.00007843599,0.0002081258,0.00502878,0.00014567627,0.0000061004935,0.032396182,0.9088731,0.0015419902,0.010749682,0.0011462991,0.03978069],"study_design_scores_gemma":[0.00023602361,0.000054062602,0.00020024652,0.00060777285,0.000016975964,0.000010368364,0.00081464427,0.9849695,0.010649175,0.00056778913,0.0017059449,0.00016748076],"about_ca_topic_score_codex":0.000054581873,"about_ca_topic_score_gemma":0.00008361847,"teacher_disagreement_score":0.5997019,"about_ca_system_score_codex":0.000085274085,"about_ca_system_score_gemma":0.000028678016,"threshold_uncertainty_score":0.42452794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380311,0.0000826137,0.05462823,0.004107714,0.00036508168,0.00048666884,0.00012602266,0.00019093596,0.0019816323],"genre_scores_gemma":[0.99836355,0.00022284818,0.00017669624,0.00090588763,0.000020742553,0.00002610522,0.00024105258,0.0000057421485,0.000037387545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994955,0.000022315628,0.00016876066,0.00011061247,0.00010540394,0.00009739938],"domain_scores_gemma":[0.9996971,0.000055857556,0.000036009194,0.00003857165,0.00009353961,0.00007891411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085375366,0.00011699242,0.0001174082,0.00014914531,0.0003000819,0.000082469276,0.000009522243,0.00007840002,0.00010223424],"category_scores_gemma":[0.0000023703458,0.00009407254,0.000025171155,0.00013760019,0.000039516905,0.0005558091,5.632218e-7,0.00022179862,0.000027907197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0114950165,0.002265679,0.0011999183,0.0050161113,0.0040206905,0.00017737369,0.050849263,0.005783111,0.005543074,0.1377213,0.0077906055,0.7681379],"study_design_scores_gemma":[0.013966693,0.007592437,0.011093345,0.0020671326,0.0013787681,0.0009040964,0.0029318063,0.6614122,0.26191175,0.0050726198,0.030450318,0.0012188733],"about_ca_topic_score_codex":0.000007382432,"about_ca_topic_score_gemma":0.000013914704,"teacher_disagreement_score":0.76691896,"about_ca_system_score_codex":0.000058743455,"about_ca_system_score_gemma":0.000037000966,"threshold_uncertainty_score":0.38361666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1443993,0.00009849056,0.85153496,0.0022131703,0.0004901811,0.00031600732,0.00006464205,0.000706434,0.00017683234],"genre_scores_gemma":[0.93592644,0.0001646862,0.06366373,0.00011736042,0.000018834,0.00005417382,0.000038082137,0.000010153964,0.0000065555087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987355,0.000044588625,0.0003733098,0.00031010993,0.00025840354,0.00027812575],"domain_scores_gemma":[0.99865305,0.00030161193,0.00009471243,0.00070113776,0.00017479337,0.000074708056],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074108713,0.00019325233,0.00017758703,0.00023514859,0.00072414544,0.0011237012,0.0009868889,0.00016765777,0.0000033863732],"category_scores_gemma":[0.0005251716,0.00019009197,0.000057607132,0.0003890328,0.000092549446,0.0028135197,0.00024595854,0.0005427147,0.0000045457596],"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.000043373326,0.00003078368,0.000019546123,0.0006589741,0.00010232256,0.0000035536616,0.0043120664,0.017243657,0.000084918196,0.012674455,0.0032074286,0.9616189],"study_design_scores_gemma":[0.00032689085,0.00012664318,0.00001173296,0.00012921137,0.00001555744,0.000018343664,0.00029923458,0.96465415,0.0013296411,0.03114689,0.00172868,0.00021303343],"about_ca_topic_score_codex":0.00001671026,"about_ca_topic_score_gemma":0.000014869119,"teacher_disagreement_score":0.9614059,"about_ca_system_score_codex":0.00006905481,"about_ca_system_score_gemma":0.000064774445,"threshold_uncertainty_score":0.9999132},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4069948,0.00008066482,0.5912638,0.000010478925,0.00071975944,0.00021401489,0.00016716232,0.000286813,0.00026253113],"genre_scores_gemma":[0.9981063,0.00014804679,0.0015072823,0.000019944286,0.00003396868,0.00002426334,0.00014443099,0.000014491879,0.0000012768911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892884,0.000020569869,0.00044450015,0.000190457,0.00021792305,0.00019771382],"domain_scores_gemma":[0.99950963,0.00003936497,0.00003665869,0.0002874408,0.00004943255,0.00007747825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037189873,0.0001691942,0.00018393171,0.00037435017,0.00011386304,0.00006867464,0.00012585871,0.00017700672,0.000006251045],"category_scores_gemma":[0.0000026559683,0.00017320307,0.000050637773,0.00048782237,0.000060816088,0.0020660309,0.0000014693895,0.00043068925,0.000003321857],"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.00009871127,0.00009827558,0.000051732706,0.0009389811,0.000049764094,0.000002043138,0.013735085,0.95132834,0.000222817,0.00023638271,0.00004297293,0.033194914],"study_design_scores_gemma":[0.00036309368,0.00014445299,0.00021056893,0.00008517786,0.000034914494,0.000017948643,0.00094946596,0.99071014,0.00547054,0.000104033905,0.0017157606,0.00019388054],"about_ca_topic_score_codex":0.000101401325,"about_ca_topic_score_gemma":0.00026965977,"teacher_disagreement_score":0.59111154,"about_ca_system_score_codex":0.000058258378,"about_ca_system_score_gemma":0.000053377207,"threshold_uncertainty_score":0.70630157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017233385,0.00010279913,0.9801332,0.00018598576,0.0003842245,0.00016420629,0.000008876918,0.00016751036,0.0016198385],"genre_scores_gemma":[0.9979141,0.000046276695,0.0019239908,0.000045418685,0.00001642324,0.000024983352,0.0000040071254,0.0000044420804,0.00002039887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992771,0.000018962226,0.00028087007,0.00013294163,0.00014455774,0.00014555473],"domain_scores_gemma":[0.99955744,0.00008711777,0.00005695442,0.00014744277,0.00008444121,0.000066619425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001753067,0.00010270449,0.00011212394,0.00014164037,0.00021765337,0.00016902968,0.00012945411,0.000055250915,0.0000058014584],"category_scores_gemma":[0.000002364667,0.000091545975,0.00006928925,0.00042620796,0.00005512708,0.0005468526,0.000004019677,0.00025749012,0.000019178788],"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.000004686629,0.00003245296,0.0000015995022,0.000098924036,0.000018761237,4.797968e-7,0.015628833,0.06722974,0.000044525725,0.120896235,0.000080074446,0.7959637],"study_design_scores_gemma":[0.0001228434,0.00007148293,0.000019797277,0.00004288957,0.0000100099915,0.00001186046,0.00016003923,0.98491734,0.0014447834,0.0054104077,0.007680535,0.000108016364],"about_ca_topic_score_codex":0.000005092142,"about_ca_topic_score_gemma":0.0000059101226,"teacher_disagreement_score":0.98068064,"about_ca_system_score_codex":0.000018944502,"about_ca_system_score_gemma":0.000027550417,"threshold_uncertainty_score":0.37331364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25040907,0.000022724576,0.7454874,0.0019735666,0.00060742564,0.00048441443,0.000030904015,0.0008205096,0.00016397955],"genre_scores_gemma":[0.98979723,0.000071205824,0.009880506,0.000057308058,0.000016000422,0.000079441976,0.000074315874,0.000008717101,0.00001525676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979486,0.00013462147,0.00064426404,0.0004022261,0.00039255363,0.00047775736],"domain_scores_gemma":[0.9976318,0.000102043414,0.00031230823,0.0015735974,0.00029781266,0.000082423394],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006161444,0.00027764458,0.00024394346,0.00048203804,0.0019601844,0.0007294178,0.002380924,0.00023532745,0.0000047275553],"category_scores_gemma":[0.00071536185,0.0002881897,0.0001361727,0.0017172988,0.00010214642,0.0017840515,0.00079835695,0.0009525442,0.0000088854495],"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.0009692952,0.0012400193,0.007669631,0.0038503087,0.0016510106,0.00003575386,0.006820999,0.64868706,0.005506036,0.039322607,0.020359963,0.26388732],"study_design_scores_gemma":[0.0011137885,0.0000963179,0.004758652,0.00035146184,0.00003813515,0.00001831507,0.00046068625,0.9268342,0.004087216,0.061443374,0.00038222864,0.00041560858],"about_ca_topic_score_codex":0.0000653191,"about_ca_topic_score_gemma":0.000018911991,"teacher_disagreement_score":0.73938817,"about_ca_system_score_codex":0.00013398581,"about_ca_system_score_gemma":0.000046458605,"threshold_uncertainty_score":0.999957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003442125,0.000019015171,0.99267125,0.00023359603,0.0005065483,0.0004992392,0.00006518184,0.00028802422,0.0022750366],"genre_scores_gemma":[0.98159075,0.000083909006,0.017394492,0.00074385566,0.000013570208,0.000057969377,0.000018900142,0.0000050322205,0.00009150647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907696,0.000023372691,0.00034910752,0.00018884898,0.00015609208,0.00020559129],"domain_scores_gemma":[0.9992013,0.000092432405,0.0001090616,0.00030308482,0.00023555374,0.00005858678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020695575,0.00017080085,0.00017754073,0.00041254208,0.00042649332,0.00019321348,0.00019836106,0.00011967482,0.0000036863644],"category_scores_gemma":[0.0000059387553,0.00016214054,0.00012189789,0.0005167676,0.000101340585,0.0014816917,0.0000055931173,0.00016184362,0.000005889951],"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.00060282083,0.0003352848,0.00011014213,0.00095491286,0.00043613394,0.000003212142,0.008725966,0.0022875,0.0004297205,0.7414529,0.005438261,0.2392232],"study_design_scores_gemma":[0.0021492247,0.0004767324,0.00030518434,0.00032619637,0.00006632615,0.000017156332,0.00007856711,0.5796221,0.014276804,0.3671906,0.03473901,0.00075211335],"about_ca_topic_score_codex":0.0000058608393,"about_ca_topic_score_gemma":0.0000032386456,"teacher_disagreement_score":0.97814864,"about_ca_system_score_codex":0.000026866655,"about_ca_system_score_gemma":0.000042707037,"threshold_uncertainty_score":0.66119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010164171,0.00001301871,0.98718894,0.00025098957,0.0010072195,0.0004943056,0.00009709567,0.000078282064,0.0007059611],"genre_scores_gemma":[0.98261374,0.00004961813,0.0168677,0.00028313973,0.000016738511,0.000078234974,0.00006286692,0.0000027950143,0.000025172149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989358,0.000057205074,0.00053892576,0.00012922646,0.00019854185,0.00014028986],"domain_scores_gemma":[0.9987656,0.00013320803,0.00029575816,0.00028404678,0.00048029254,0.00004113529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201322,0.0001305166,0.00017697676,0.00040564977,0.00024391468,0.0002036463,0.00017535263,0.000110246896,0.0000025956306],"category_scores_gemma":[0.000039511153,0.00013105542,0.00009015123,0.00039886514,0.000053673695,0.0035326122,0.0000034677735,0.00013311733,0.000004328103],"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.00023698958,0.00009089142,0.000054268436,0.00042934442,0.00014546905,1.2533198e-7,0.019747688,0.008489084,0.0005293026,0.10250478,0.002404665,0.8653674],"study_design_scores_gemma":[0.0013365082,0.00025316747,0.0015046558,0.0000831315,0.000035020188,0.000001878839,0.0007281757,0.9268337,0.051932197,0.014346157,0.0027083,0.00023713615],"about_ca_topic_score_codex":0.00001912787,"about_ca_topic_score_gemma":0.000026067042,"teacher_disagreement_score":0.97244954,"about_ca_system_score_codex":0.000052644733,"about_ca_system_score_gemma":0.00008263297,"threshold_uncertainty_score":0.5344285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019075494,0.000013778926,0.9751178,0.002629288,0.0011093214,0.00036468814,0.00007992806,0.0002033382,0.0014063787],"genre_scores_gemma":[0.98524314,0.000028172642,0.0067589786,0.00785381,0.00003161994,0.00002590446,0.000025580614,0.000005881261,0.000026919284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862987,0.000065328444,0.00038576598,0.00033349474,0.00033600637,0.0002495605],"domain_scores_gemma":[0.99849164,0.00014974324,0.00008834456,0.0009970493,0.0001377574,0.0001354668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032417494,0.00021243951,0.00018695465,0.00045051822,0.00048820506,0.000327437,0.000543155,0.00015295827,0.000015401454],"category_scores_gemma":[0.000022218364,0.00020010486,0.00006908205,0.0007774763,0.0000500995,0.001211239,0.000024142942,0.00047790076,0.00005367146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025152395,0.00008233304,0.0000045109236,0.00011680192,0.00005938178,0.0000025972524,0.0021890295,0.08520654,0.000033653694,0.017410597,0.00664621,0.88799685],"study_design_scores_gemma":[0.0018812484,0.0008668381,0.00040053754,0.00030503958,0.000049207356,0.000019403053,0.00011410307,0.75292,0.025562549,0.047059197,0.17006356,0.0007583825],"about_ca_topic_score_codex":0.0000758443,"about_ca_topic_score_gemma":0.00039516835,"teacher_disagreement_score":0.9683588,"about_ca_system_score_codex":0.00006119693,"about_ca_system_score_gemma":0.00009491757,"threshold_uncertainty_score":0.8160039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013449406,0.0000103668335,0.98005,0.0042789504,0.0006082454,0.00030672253,0.0001397146,0.00043092758,0.00072564936],"genre_scores_gemma":[0.9644204,0.00006971452,0.03504009,0.00033665233,0.000006557399,0.000021372438,0.00008327663,0.0000046229497,0.000017333838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987812,0.00004001587,0.00033357958,0.00031131034,0.0003094178,0.00022447575],"domain_scores_gemma":[0.9960152,0.00010736228,0.00011500397,0.00358986,0.000113370224,0.000059209877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016652109,0.00018166615,0.00018282063,0.00031084075,0.00043697938,0.00034112585,0.0041921646,0.00015502876,0.000008407618],"category_scores_gemma":[0.00016264741,0.00016090875,0.000030222429,0.00069654564,0.00022491967,0.0025457656,0.0007221985,0.00038553766,0.000010556633],"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.0008573564,0.0005894704,0.00022357555,0.00057914294,0.000711903,0.000013361285,0.0043762266,0.0027532065,0.00019612127,0.18775132,0.15281782,0.6491305],"study_design_scores_gemma":[0.0011661419,0.00014680746,0.00016986203,0.00006215894,0.000034288005,0.000024756377,0.00012127274,0.93891084,0.006339602,0.048257194,0.0045409193,0.00022615655],"about_ca_topic_score_codex":0.00009662598,"about_ca_topic_score_gemma":0.00005110699,"teacher_disagreement_score":0.95097095,"about_ca_system_score_codex":0.00006714276,"about_ca_system_score_gemma":0.00013882891,"threshold_uncertainty_score":0.7790154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087485194,0.000051226198,0.9101692,0.00016134117,0.00075531757,0.00023884622,4.9783705e-7,0.00013336028,0.0010050079],"genre_scores_gemma":[0.98321706,0.000022980455,0.016335707,0.00029684804,0.000060026767,0.000008408925,0.0000071577288,0.0000056775457,0.00004615527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.00009369533,0.00047250194,0.0002481116,0.00017621381,0.00034571864],"domain_scores_gemma":[0.9993401,0.00015006417,0.00014424059,0.00018753551,0.0001036812,0.00007433542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074153754,0.00018322811,0.00021915016,0.00033728825,0.00053420407,0.0003180917,0.00016856717,0.00012387853,3.944923e-7],"category_scores_gemma":[0.000015481244,0.00019401859,0.000045956385,0.00069586054,0.000055378874,0.00058250147,0.00002138153,0.0005027509,0.0000020956438],"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.000056404922,0.0001054317,0.0005436867,0.0002843883,0.00006451891,0.0000017349552,0.0351377,0.66448385,0.000024350837,0.011926246,0.00043700295,0.2869347],"study_design_scores_gemma":[0.0008101832,0.000037932885,0.00046338883,0.000111332505,0.000009982928,0.000008445138,0.0003731521,0.9945704,0.00016924343,0.0009168198,0.0023430837,0.00018605804],"about_ca_topic_score_codex":0.00008184932,"about_ca_topic_score_gemma":0.000018344655,"teacher_disagreement_score":0.89573187,"about_ca_system_score_codex":0.00007462336,"about_ca_system_score_gemma":0.000051499293,"threshold_uncertainty_score":0.7911849},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044414657,0.00003535764,0.9903488,0.0022836244,0.001648877,0.00058010954,0.000057809615,0.00022430757,0.00037965225],"genre_scores_gemma":[0.9745838,0.00004527662,0.018148126,0.00706311,0.000059014925,0.000034689645,0.00003260203,0.00000971929,0.000023632012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998576,0.00006482225,0.00047507454,0.00028534778,0.00023622604,0.00036253812],"domain_scores_gemma":[0.9985861,0.00031214842,0.00014328749,0.00043023127,0.0004178783,0.00011036117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027527363,0.00026735023,0.00027818145,0.00027856053,0.0006524614,0.000461272,0.0002569188,0.0002594779,0.000003937275],"category_scores_gemma":[0.000008012201,0.00027400165,0.00014752007,0.00056168804,0.000114592876,0.0012454443,0.0000063755256,0.00045497643,0.000003793038],"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.00018072905,0.000110339875,0.000010682592,0.00021102432,0.0001676843,0.0000026458622,0.0064635747,0.4481081,0.000029216708,0.2254476,0.008156444,0.31111196],"study_design_scores_gemma":[0.0009009298,0.00008337735,0.000008008471,0.000074050506,0.00002799437,0.0000052469736,0.00013664871,0.9805132,0.0032646735,0.010221309,0.0044999947,0.00026457492],"about_ca_topic_score_codex":0.000029048771,"about_ca_topic_score_gemma":0.000078482895,"teacher_disagreement_score":0.9722007,"about_ca_system_score_codex":0.00008656112,"about_ca_system_score_gemma":0.00010818539,"threshold_uncertainty_score":0.9999712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006877704,0.000035521734,0.9841339,0.00080973253,0.0009685003,0.0005439484,0.000020238385,0.00018905189,0.0064214226],"genre_scores_gemma":[0.9952575,0.000036802187,0.0028370393,0.0013951727,0.000011191044,0.000099986064,0.000006873105,0.000004046562,0.00035139028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988414,0.000042394844,0.00047577271,0.00021473416,0.0002186791,0.00020700086],"domain_scores_gemma":[0.99910575,0.00007976963,0.00013011713,0.00042017546,0.00017507843,0.00008910951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037101336,0.00015692294,0.00019985749,0.00033941193,0.00041077702,0.00084675616,0.0005669342,0.000077613826,0.000026917798],"category_scores_gemma":[0.0000068745126,0.00015544225,0.00007375393,0.00065538206,0.0000503437,0.0020473378,0.000024823788,0.00024819505,0.000046369572],"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.00006207976,0.00033921195,0.00010903494,0.0005113191,0.00018466354,0.0000017803052,0.11811524,0.0035480678,0.00003170294,0.5093178,0.0079851225,0.35979393],"study_design_scores_gemma":[0.0013781105,0.0001023094,0.00029940248,0.0001687362,0.00003313561,0.000010991022,0.0012795625,0.8512476,0.0032252562,0.023492772,0.11827622,0.00048590676],"about_ca_topic_score_codex":0.00010894429,"about_ca_topic_score_gemma":0.00011690782,"teacher_disagreement_score":0.9883798,"about_ca_system_score_codex":0.000054524044,"about_ca_system_score_gemma":0.000084079795,"threshold_uncertainty_score":0.81652886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007207193,0.00007305677,0.99740976,0.00046325813,0.00024811205,0.00022960061,0.00019097909,0.00016110524,0.0005034254],"genre_scores_gemma":[0.9278458,0.001124572,0.06949602,0.00095979613,0.000010975453,0.00008569499,0.0001467348,0.000015440617,0.00031497746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931884,0.000021502534,0.00032909677,0.000091324044,0.00007177581,0.00016743322],"domain_scores_gemma":[0.9992838,0.000093631126,0.000045780667,0.00030892956,0.00021303473,0.000054817687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015316556,0.00013761349,0.00016157735,0.00014230332,0.00042246937,0.00013325948,0.00010817315,0.00011697736,0.000025515823],"category_scores_gemma":[0.000010442215,0.00014231677,0.00010763335,0.00030721127,0.000047132617,0.0005706731,0.000002020403,0.00018562969,0.000009453329],"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.0006391468,0.0009877019,0.00033869187,0.002099616,0.0018470496,0.0000017930403,0.030808413,0.84049505,0.010968279,0.02922069,0.0110589815,0.07153459],"study_design_scores_gemma":[0.0006910036,0.000020683538,0.00002466192,0.000035767993,0.000075272845,8.806418e-7,0.00051698985,0.9826455,0.0017703057,0.00039605564,0.013680819,0.00014201876],"about_ca_topic_score_codex":0.00001056494,"about_ca_topic_score_gemma":0.0001435196,"teacher_disagreement_score":0.9279137,"about_ca_system_score_codex":0.00002917488,"about_ca_system_score_gemma":0.000028099852,"threshold_uncertainty_score":0.58035094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1262049,0.000026624597,0.8713529,0.0014440257,0.00039090822,0.0002609725,0.00007849728,0.00006332288,0.00017782164],"genre_scores_gemma":[0.9945002,0.000014997281,0.005097667,0.00033759433,0.0000118636635,0.000011980042,0.000017930322,0.0000023262453,0.000005399759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914354,0.000020723091,0.0002919559,0.000216495,0.0001430342,0.00018425945],"domain_scores_gemma":[0.9993456,0.00012811641,0.000044363485,0.000365264,0.000060589562,0.000056092216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033686328,0.00011577045,0.00013932279,0.00016513535,0.0002099235,0.00020125418,0.00030046722,0.00006632967,5.0625584e-7],"category_scores_gemma":[0.000017694125,0.000106446874,0.00003178062,0.00031266795,0.00004874568,0.00012962964,0.000034144647,0.00015632666,8.345603e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015173841,0.0002539547,0.000077231976,0.00057531154,0.0001157133,0.0000033303986,0.008027632,0.13657285,0.000022687533,0.282078,0.0016219481,0.5704996],"study_design_scores_gemma":[0.00076182926,0.000051842308,0.00026682974,0.000060115017,0.000017014207,0.0000035564774,0.00018377369,0.98749065,0.00015532762,0.004970096,0.0059206733,0.00011826552],"about_ca_topic_score_codex":0.00002908124,"about_ca_topic_score_gemma":0.000024892706,"teacher_disagreement_score":0.8682954,"about_ca_system_score_codex":0.000039459675,"about_ca_system_score_gemma":0.000029131335,"threshold_uncertainty_score":0.43407774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4752961,0.00003256418,0.49296287,0.0017019607,0.0010399714,0.00080613117,0.0000075431913,0.00021643909,0.027936408],"genre_scores_gemma":[0.9971792,0.00007529724,0.00010947864,0.0023353128,0.00002824538,0.0000248154,0.000037925867,0.0000055484165,0.0002041449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.0000071908353,0.0003400364,0.00012920288,0.00019580702,0.00019223391],"domain_scores_gemma":[0.999623,0.00002024687,0.000117659656,0.00012482387,0.000104772924,0.000009515709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020499785,0.00014974915,0.00014730146,0.0004762399,0.00023515063,0.00017002046,0.0000848909,0.000052565993,0.00007490761],"category_scores_gemma":[0.000008031886,0.00013568248,0.00003360712,0.00048913306,0.000056425626,0.0016051085,0.0000058273563,0.00025217514,0.000026540725],"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.0010525786,0.0004063644,0.007055499,0.0016303454,0.0002493209,0.000013444408,0.004922408,0.6029066,0.000024058967,0.26802316,0.0041717496,0.1095445],"study_design_scores_gemma":[0.0036517635,0.00015561453,0.0026308459,0.0005695913,0.00009909396,0.0000026346163,0.007051964,0.8051589,0.00029149573,0.006201904,0.17357552,0.00061063404],"about_ca_topic_score_codex":0.00037429697,"about_ca_topic_score_gemma":0.00034038696,"teacher_disagreement_score":0.52188313,"about_ca_system_score_codex":0.000051409774,"about_ca_system_score_gemma":0.000018491837,"threshold_uncertainty_score":0.5532971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006860506,0.000076977136,0.99164313,0.0002537145,0.00030251456,0.00034637444,0.000047219874,0.0001743604,0.000295198],"genre_scores_gemma":[0.9650337,0.00016087476,0.03397067,0.0007041108,0.000011806603,0.000013883814,0.000096444615,0.0000056412396,0.000002885766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987571,0.00003402144,0.0004907814,0.00022934568,0.00027200588,0.000216715],"domain_scores_gemma":[0.9987749,0.00013697981,0.00021187663,0.00040141272,0.0003975804,0.000077282144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026764805,0.00019255029,0.00017426613,0.00053946266,0.0005862145,0.00055897416,0.0002960063,0.000110871835,6.0042413e-7],"category_scores_gemma":[0.000020598547,0.00017492828,0.000023650855,0.0010981697,0.00006300161,0.008106329,0.000026770269,0.00031887667,0.0000016583983],"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.000048634363,0.00001938913,0.00006545851,0.00018520126,0.00004218768,4.5254546e-7,0.002183925,0.31309518,0.0000033982726,0.017245663,0.000057338846,0.66705316],"study_design_scores_gemma":[0.0006209616,0.000053554733,0.000066211076,0.00010102056,0.000023785346,0.000010735342,0.00024703602,0.9930516,0.00017406038,0.00502149,0.00044141687,0.00018811703],"about_ca_topic_score_codex":0.00005441917,"about_ca_topic_score_gemma":0.00004512365,"teacher_disagreement_score":0.95817316,"about_ca_system_score_codex":0.000034923836,"about_ca_system_score_gemma":0.00006740361,"threshold_uncertainty_score":0.7133368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118083125,0.000013093878,0.9803663,0.005760213,0.0009284604,0.00024622885,0.000045982924,0.00044144024,0.00038995838],"genre_scores_gemma":[0.9540386,0.00009562236,0.04540534,0.00038350173,0.000007997896,0.000027827802,0.000022540624,0.0000038726403,0.000014648135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893475,0.000034955177,0.00035640367,0.00021369256,0.0002466149,0.00021361322],"domain_scores_gemma":[0.99784243,0.00009742076,0.00010826879,0.001773881,0.00012083922,0.000057154382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014192602,0.00016836132,0.00017043058,0.00029195717,0.00029026132,0.0002891047,0.0022822162,0.00016778588,0.000017038956],"category_scores_gemma":[0.0001507473,0.0001613245,0.000066644985,0.00044165432,0.00015000619,0.0019449227,0.00034971006,0.0003259895,0.000020169393],"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.00020959208,0.00024565513,0.0000194586,0.00019150774,0.00021471568,0.0000026143382,0.0016530834,0.010810241,0.000071839655,0.20936032,0.02994343,0.74727756],"study_design_scores_gemma":[0.0010122723,0.00005593973,0.00013216559,0.000051073097,0.000019899733,0.0000067021947,0.00008493309,0.78358895,0.008227118,0.20506516,0.0015625645,0.00019325019],"about_ca_topic_score_codex":0.00003744248,"about_ca_topic_score_gemma":0.00000963173,"teacher_disagreement_score":0.94223034,"about_ca_system_score_codex":0.000096690696,"about_ca_system_score_gemma":0.00006867163,"threshold_uncertainty_score":0.6578622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20381336,0.000027210974,0.7571978,0.008320128,0.0031942418,0.005125395,0.00041272622,0.00014639234,0.02176277],"genre_scores_gemma":[0.99608445,0.000019583107,0.00048042412,0.0024787376,0.000027527738,0.0005354012,0.000070296686,0.0000056852705,0.00029791694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847335,0.0001457469,0.0007986103,0.00012117183,0.00019897087,0.00026214976],"domain_scores_gemma":[0.99844503,0.0005733503,0.00020064645,0.00034399997,0.0004042229,0.00003277575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012754175,0.00011783899,0.00016431462,0.0003261839,0.00083959545,0.000052435345,0.00018482562,0.00017002411,0.000023623868],"category_scores_gemma":[0.0000922223,0.000094062925,0.000051065053,0.0005881233,0.000048706977,0.0008775346,0.000004643587,0.0004478623,0.000031918484],"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.00061855785,0.00025210314,0.0022786348,0.0054628793,0.00014727532,6.0006914e-7,0.13875122,0.0017759756,0.00002770102,0.7568525,0.040322706,0.053509824],"study_design_scores_gemma":[0.0061003845,0.00029793175,0.007010447,0.0012741113,0.00011329604,0.0000052374166,0.06401368,0.14650367,0.00085918844,0.23527704,0.5378687,0.0006763576],"about_ca_topic_score_codex":0.00028618376,"about_ca_topic_score_gemma":0.00027507177,"teacher_disagreement_score":0.7922711,"about_ca_system_score_codex":0.00013641536,"about_ca_system_score_gemma":0.0001842002,"threshold_uncertainty_score":0.64575744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058947606,0.0009241974,0.9781176,0.005002751,0.0008972981,0.00069961377,0.0002136082,0.00093952165,0.007310638],"genre_scores_gemma":[0.98703855,0.0037042939,0.008250119,0.0006505276,0.00002398967,0.000096272954,0.00007020328,0.000030130048,0.00013592927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976717,0.00008018067,0.0011111369,0.00030540823,0.0003902589,0.00044130036],"domain_scores_gemma":[0.99764526,0.00046305804,0.00028604773,0.0011398218,0.00034837986,0.00011742035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037564957,0.00050470594,0.00045173973,0.00074057217,0.0009869636,0.00031872443,0.000524785,0.00067306194,0.00006133765],"category_scores_gemma":[0.00006124132,0.0005890447,0.00016378889,0.00080569496,0.00034605968,0.0016920089,0.000022860599,0.0015334927,0.000040028845],"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.00013397474,0.00010274674,0.000008856779,0.0008777085,0.00037588633,0.0000016120173,0.028496465,0.44183823,0.000038668735,0.115147464,0.0023473166,0.4106311],"study_design_scores_gemma":[0.0015745077,0.00015352781,0.000036684312,0.0008451241,0.00015277453,0.000012488459,0.0035679382,0.66941047,0.013803702,0.103512995,0.20605145,0.0008783562],"about_ca_topic_score_codex":0.00003136072,"about_ca_topic_score_gemma":0.00008322579,"teacher_disagreement_score":0.9811438,"about_ca_system_score_codex":0.00027013908,"about_ca_system_score_gemma":0.000098310375,"threshold_uncertainty_score":0.9996561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010707877,0.00019548803,0.98464924,0.0011814547,0.0015244082,0.0007976445,0.000286794,0.00022647702,0.0004306012],"genre_scores_gemma":[0.9087349,0.00072094373,0.08883048,0.0015131205,0.000030326522,0.0000764235,0.000041141502,0.0000095457235,0.000043080443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976536,0.00011948321,0.0009851907,0.0004723629,0.0003125957,0.00045676465],"domain_scores_gemma":[0.9984348,0.00013598903,0.0002632995,0.0006652473,0.00030928006,0.00019142021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034270887,0.00044177088,0.00041246688,0.0005617616,0.000919621,0.0006002916,0.00044053653,0.00033612893,0.000020386251],"category_scores_gemma":[0.000012215314,0.00044724645,0.00020380052,0.00080674054,0.00013926209,0.0033455708,0.000019107743,0.0006154157,0.00001356634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010637641,0.00012462887,0.00018434811,0.0003238406,0.00013366854,0.000004539362,0.011838498,0.009312668,0.0003653206,0.0031160188,0.0005086059,0.9739815],"study_design_scores_gemma":[0.0010931321,0.00028482528,0.0014377013,0.0010250366,0.00009246782,0.000009536739,0.00015864651,0.8872993,0.03812782,0.06692914,0.0026458832,0.0008965017],"about_ca_topic_score_codex":0.0005881942,"about_ca_topic_score_gemma":0.00022336566,"teacher_disagreement_score":0.973085,"about_ca_system_score_codex":0.000090643385,"about_ca_system_score_gemma":0.000065910725,"threshold_uncertainty_score":0.99979794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005136799,0.000024726765,0.9925462,0.0006646045,0.00055882736,0.00043487144,0.000015076278,0.000054436765,0.0005644379],"genre_scores_gemma":[0.96166843,0.00002887703,0.037529625,0.00034035827,0.000014512852,0.00011266639,0.0000122884,0.00000143691,0.0002917894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922436,0.0000323938,0.00031742378,0.000152111,0.00009262853,0.00018109712],"domain_scores_gemma":[0.9994539,0.00010297677,0.000074514384,0.00018070934,0.00014945987,0.000038443133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040322193,0.00010800233,0.000125058,0.000102849954,0.000309264,0.0002523083,0.00012954861,0.00012491186,0.0000035633143],"category_scores_gemma":[0.000021504882,0.00010758281,0.000044148484,0.00021717414,0.000017085753,0.00081447593,0.0000039023034,0.00014484624,0.000002601262],"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.00027677263,0.0005104776,0.00040287504,0.001328174,0.00013474021,0.0000026781768,0.038553193,0.7089778,0.0014093873,0.13871416,0.013879995,0.09580974],"study_design_scores_gemma":[0.00065676926,0.000044103785,0.000032911794,0.000038430648,0.0000061410938,0.0000022837078,0.00020649204,0.9721947,0.007895036,0.0011769806,0.017635798,0.00011037574],"about_ca_topic_score_codex":0.000033694374,"about_ca_topic_score_gemma":0.00008042132,"teacher_disagreement_score":0.95653164,"about_ca_system_score_codex":0.000030997177,"about_ca_system_score_gemma":0.000048840862,"threshold_uncertainty_score":0.43870997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0636992,0.00015711294,0.93045425,0.0010444525,0.0002349973,0.00042056074,0.00007185725,0.00037523243,0.0035423387],"genre_scores_gemma":[0.97998613,0.001012115,0.018263323,0.0005378237,0.0000055461587,0.000099491626,0.00006689467,0.000009664187,0.000019018384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914414,0.000052628344,0.00044932193,0.00008626229,0.0001154731,0.000152188],"domain_scores_gemma":[0.9990748,0.00008511633,0.000045946013,0.00064896734,0.00009828375,0.000046867164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021662364,0.00014972077,0.00015691356,0.0003042811,0.00026938153,0.00014882418,0.00024978296,0.00017457233,0.00001327466],"category_scores_gemma":[0.000008685306,0.00017278767,0.000050626753,0.00040141697,0.00008566279,0.00082648563,0.000007750762,0.00048138463,0.000012612746],"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.00014787541,0.00084365834,0.0012456488,0.0007631044,0.0003603595,0.000002059764,0.056667395,0.07411408,0.002508645,0.51290685,0.021156652,0.32928365],"study_design_scores_gemma":[0.0011048823,0.00005089388,0.0004948944,0.00010110964,0.00002100928,0.000003993076,0.00062189606,0.87190986,0.015731746,0.004935208,0.10463645,0.0003880816],"about_ca_topic_score_codex":0.00015520638,"about_ca_topic_score_gemma":0.001281927,"teacher_disagreement_score":0.91628695,"about_ca_system_score_codex":0.00009602624,"about_ca_system_score_gemma":0.000031598513,"threshold_uncertainty_score":0.70460767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02767571,0.0000920582,0.9654876,0.0006025392,0.003455546,0.0013794815,0.00079906423,0.00032758407,0.00018041416],"genre_scores_gemma":[0.9951358,0.00020178982,0.0034140288,0.0007339905,0.00008597216,0.00021145455,0.00016823725,0.00001549322,0.00003327062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968577,0.00015585458,0.0012177718,0.0006806671,0.000392964,0.0006950397],"domain_scores_gemma":[0.99715376,0.00033924857,0.0004286564,0.0008777663,0.00090374314,0.00029679696],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008767599,0.00053559826,0.00049988035,0.0004227944,0.001740147,0.00093503634,0.00044433193,0.00056258624,0.000016414751],"category_scores_gemma":[0.000041688014,0.0005847878,0.00034665217,0.0011621605,0.0002429088,0.0044110212,0.000017919132,0.00070164306,0.000014458023],"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.000831408,0.00059623923,0.00009517695,0.0005425598,0.0002249777,6.9394144e-7,0.004254016,0.012957359,0.000049868093,0.009106904,0.00094334834,0.9703975],"study_design_scores_gemma":[0.0020158452,0.0009072347,0.001031343,0.00013252994,0.00020099794,0.000019682406,0.00035324745,0.9691327,0.0030993216,0.010550728,0.011956,0.0006003482],"about_ca_topic_score_codex":0.0005313911,"about_ca_topic_score_gemma":0.0015454934,"teacher_disagreement_score":0.9697971,"about_ca_system_score_codex":0.00034382584,"about_ca_system_score_gemma":0.00022361161,"threshold_uncertainty_score":0.9996604},"labels":[],"label_agreement":null}]}