{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":20,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":20,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"f2646b840afe","filters":{"venue":"IET Information Security"}},"results":[{"id":"W1999728176","doi":"10.1049/iet-ifs.2014.0099","title":"High accuracy android malware detection using ensemble learning","year":2015,"lang":"en","type":"article","venue":"IET Information Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Malware; Android malware; Computer science; Ensemble learning; Android (operating system); Machine learning; Artificial intelligence; Computer security; Operating system","authors":[{"name":"Suleiman Y. Yerima","is_ca":true},{"name":"Sakir Sezer","is_ca":true},{"name":"Igor Muttik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02087862960961052,"gpt":0.2689254753340033,"spread":0.2480468457243928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220928,0.0009005067,0.001147475,0.001673604,0.000557854,0.0008539439,0.0007369028,0.0007682911,0.0004511431],"category_scores_gemma":[0.003146484,0.0003503439,0.000734716,0.0007413749,0.0001994553,0.001352193,0.0008561719,0.0009768459,0.0004454326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004215938,"about_ca_system_score_gemma":0.0004661626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003563538,"about_ca_topic_score_gemma":0.00516081,"domain_scores_codex":[0.9990978,0.0001709881,0.0000492413,0.0002005772,0.0003681235,0.0001133321],"domain_scores_gemma":[0.9981878,0.000713215,0.0001481596,0.000304898,0.0005882024,0.00005769793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002650277,0.0003734373,0.02691609,0.00004733823,0.0002960926,0.0002548185,0.0001279457,0.2876241,0.022284,0.0009406446,0.002963032,0.6579074],"study_design_scores_gemma":[0.000001983075,0.00003881293,0.001751924,0.000002914261,0.00001511601,0.00005998013,0.00001063919,0.9939685,0.003548811,0.0003527986,0.0002406332,0.000007921171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4066254,0.0005711757,0.58525,0.0002961234,0.0001148514,0.00007834556,0.0002660452,0.003728169,0.003069946],"genre_scores_gemma":[0.9205081,0.0001367722,0.07736647,0.00005534476,0.00004398436,0.00003102594,0.000366278,0.00003614592,0.001455843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003563538,"threshold_uncertainty_score":0.007085621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985322847","doi":"10.1049/iet-ifs.2009.0098","title":"Unconditionally secure social secret sharing scheme","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Scheme (mathematics); Secret sharing; Computer security; Computer science; Internet privacy; Commitment scheme; Cryptography; Mathematics; Law; Political science","authors":[{"name":"Mehrdad Nojoumian","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Morgan Grainger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00596736023236297,"gpt":0.2309052199674665,"spread":0.2249378597351035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002447753,0.0006570485,0.001058384,0.0007650823,0.001692893,0.002125553,0.00190727,0.001704017,0.004843028],"category_scores_gemma":[0.005147993,0.0004164774,0.0008971137,0.001212289,0.002374146,0.004092738,0.005834828,0.002074494,0.001859078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001540025,"about_ca_system_score_gemma":0.002453621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000513574,"about_ca_topic_score_gemma":0.0004476671,"domain_scores_codex":[0.9953969,0.001360697,0.0003227815,0.0005751003,0.00159286,0.0007515813],"domain_scores_gemma":[0.9953122,0.001105561,0.0006819266,0.001898418,0.0006158376,0.0003861458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003422477,0.0001187161,0.0004758891,0.0001586991,0.00006124565,0.0003403717,0.0007910752,0.02414486,0.01260004,0.9043791,0.003991666,0.05259604],"study_design_scores_gemma":[0.0002774122,0.0004661626,0.0005752361,0.0001111295,0.0001331465,0.001287741,0.0002104109,0.3303972,0.0207375,0.5797957,0.06579685,0.0002115895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05366813,0.0003391464,0.9230009,0.001440827,0.0002117213,0.0003603284,0.0003457708,0.0008656348,0.01976753],"genre_scores_gemma":[0.880071,0.0002713789,0.1017214,0.0002971667,0.0001473091,0.000340705,0.0002493286,0.00005080356,0.01685099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004843028,"threshold_uncertainty_score":0.01620156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047892990","doi":"10.1049/iet-ifs.2009.0197","title":"Physical layer assisted authentication for distributed <i>ad hoc</i> wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China","keywords":"Computer network; Computer science; Authentication (law); Authentication protocol; Physical layer; Overhead (engineering); Message authentication code; Wireless ad hoc network; Public-key cryptography; Cryptography; Distributed computing; Wireless; Computer security; Encryption; Telecommunications","authors":[{"name":"Haiying Wen","is_ca":true},{"name":"Pin-Han Ho","is_ca":true},{"name":"Chun Qi","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01024070838657051,"gpt":0.2508163790439364,"spread":0.2405756706573659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073673,0.0003203887,0.0003212411,0.0003197421,0.000488731,0.000760912,0.0009274159,0.0004657478,0.001100051],"category_scores_gemma":[0.001926522,0.0001685197,0.0003159211,0.0003178401,0.0007434431,0.001806764,0.0007842971,0.000827486,0.0004087045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004664439,"about_ca_system_score_gemma":0.0006764508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004104954,"about_ca_topic_score_gemma":0.0004533453,"domain_scores_codex":[0.9992731,0.0002711377,0.00005302596,0.0000656715,0.0002663833,0.00007073233],"domain_scores_gemma":[0.9990859,0.0002690905,0.0001352862,0.0002546692,0.0002156708,0.00003932301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007619421,0.0002011803,0.002711321,0.0008079557,0.0001350888,0.0007054983,0.0006807414,0.1001696,0.2117035,0.2571782,0.00993182,0.4150131],"study_design_scores_gemma":[0.00008454317,0.0007085853,0.0009479138,0.00006261666,0.00009831528,0.0007230924,0.0001454936,0.840977,0.0763674,0.04156302,0.03824967,0.00007236894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01766111,0.000790317,0.9774581,0.0002787069,0.0001474923,0.00006695565,0.00002540773,0.0006569427,0.002914923],"genre_scores_gemma":[0.8787656,0.0007250293,0.1157595,0.0001032372,0.0001395423,0.00009197656,0.00007973371,0.00003753946,0.004297717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001100051,"threshold_uncertainty_score":0.005678177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058559153","doi":"10.1049/iet-ifs.2011.0033","title":"On the sliding property of SNOW 3G and SNOW 2.0","year":2011,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Stream cipher; Snow; Key (lock); Computer science; Cipher; Property (philosophy); Mathematical proof; Set (abstract data type); Theoretical computer science; Cryptography; Algorithm; Mathematics; Computer security; Meteorology; Programming language; Geography","authors":[{"name":"Aleksandar Kircanski","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03536933605050085,"gpt":0.2419125381930435,"spread":0.2065432021425427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00195316,0.0004432641,0.0006758486,0.0009851514,0.0009755828,0.001670596,0.0005444395,0.0007600507,0.002881177],"category_scores_gemma":[0.01209817,0.0003733612,0.0009114397,0.0008484866,0.004092267,0.004470774,0.002093049,0.001484621,0.0004883629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007680704,"about_ca_system_score_gemma":0.0009760169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007283172,"about_ca_topic_score_gemma":0.0004134444,"domain_scores_codex":[0.9971934,0.0006787014,0.0002015427,0.0004589657,0.000985018,0.0004824312],"domain_scores_gemma":[0.9905578,0.004955614,0.0012269,0.002554421,0.0004809595,0.0002242847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00132789,0.000108622,0.004767058,0.0001838004,0.00006102285,0.0008209974,0.001037373,0.02834041,0.0248544,0.899746,0.001797649,0.03695476],"study_design_scores_gemma":[0.0001593906,0.001040402,0.004479119,0.0001611836,0.0001023427,0.002223797,0.0005399636,0.2115171,0.06084436,0.7037134,0.01509898,0.0001199549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6127793,0.0008164535,0.3352863,0.0008538757,0.0001329143,0.0002138344,0.0002422842,0.0004774407,0.04919751],"genre_scores_gemma":[0.9805089,0.0002410935,0.0161988,0.0001154507,0.00005570177,0.00007932106,0.0001376915,0.00007317944,0.002589763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002881177,"threshold_uncertainty_score":0.01032937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024893480","doi":"10.1049/iet-ifs.2010.0059","title":"Scalable fragile watermarking for image authentication","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Digital watermarking; Computer science; JPEG 2000; Scalability; Image compression; Data compression; Authentication (law); Image quality; Artificial intelligence; Computer vision; File size; Scaling; Image (mathematics); Image processing; Computer security; Mathematics; Database","authors":[{"name":"Angela Piper","is_ca":false},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0074016298531846,"gpt":0.2359610088897392,"spread":0.2285593790365546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003286789,0.0004725216,0.0003465873,0.0006880662,0.0003299957,0.0007006887,0.0004925043,0.0009107401,0.006336309],"category_scores_gemma":[0.001145167,0.0001833923,0.0003728209,0.000814893,0.0005938202,0.001499263,0.0006231964,0.0008696425,0.001790987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004806476,"about_ca_system_score_gemma":0.000293015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005537194,"about_ca_topic_score_gemma":0.0004676959,"domain_scores_codex":[0.9996587,0.00005012372,0.00001495222,0.00005228481,0.0001940167,0.0000300318],"domain_scores_gemma":[0.9996131,0.0001369547,0.00006010816,0.00009614375,0.00007991886,0.00001375988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002362386,0.00006947258,0.0003000198,0.0005078895,0.00006555982,0.0005016237,0.0001505286,0.04851046,0.1867585,0.1686249,0.01731206,0.5769629],"study_design_scores_gemma":[0.00009318088,0.0004097606,0.001060139,0.0002193181,0.00006353269,0.001463552,0.0000821971,0.6223255,0.0906603,0.1407152,0.1427529,0.000154385],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01332261,0.01087701,0.9508563,0.0009515347,0.0004214763,0.0001498997,0.0001617959,0.002430931,0.02082846],"genre_scores_gemma":[0.5548368,0.0123949,0.403054,0.0003868355,0.0007169952,0.0002174721,0.0004378135,0.000167042,0.0277881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006336309,"threshold_uncertainty_score":0.02119702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971382044","doi":"10.1049/iet-ifs:20060131","title":"Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions","year":2007,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Collision resistance; Message authentication code; Computer network; Hash-based message authentication code; Computer security; Hash chain; Key (lock); SHA-2; Protocol (science); Channel (broadcasting); Cryptographic hash function; Cryptography; Double hashing","authors":[{"name":"Atefeh Mashatan","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007652615270703633,"gpt":0.2504995711155292,"spread":0.2428469558448255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002401132,0.0005107258,0.0009198981,0.0007391801,0.0009678496,0.002044413,0.002395863,0.001221708,0.002445431],"category_scores_gemma":[0.004328982,0.0004035763,0.0007825792,0.0007855936,0.003008635,0.004091573,0.002966165,0.001367182,0.0007459202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009527844,"about_ca_system_score_gemma":0.001032729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004281525,"about_ca_topic_score_gemma":0.0003421023,"domain_scores_codex":[0.9974769,0.0008719712,0.0001331687,0.0003068892,0.0009022746,0.0003088054],"domain_scores_gemma":[0.9953431,0.002490594,0.0003770389,0.001135629,0.0004771895,0.0001764228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008370579,0.0001424251,0.0006308649,0.0002007283,0.0001080898,0.0005362548,0.0005786868,0.08507402,0.02860419,0.8319088,0.00163794,0.04974095],"study_design_scores_gemma":[0.0001449064,0.0002977464,0.0002297303,0.00002842783,0.00005592444,0.000385158,0.00008935916,0.8260795,0.02333229,0.1431868,0.006076788,0.00009331675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02401473,0.0002021936,0.9725653,0.000135406,0.00005807324,0.000115341,0.00002820039,0.0003938393,0.002486922],"genre_scores_gemma":[0.8165838,0.0002908595,0.1770861,0.00009173474,0.0000785309,0.0002379157,0.00009700297,0.00006362642,0.005470363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002445431,"threshold_uncertainty_score":0.01269853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110453585","doi":"10.1049/iet-ifs.2012.0186","title":"Simple power analysis applied to nonlinear feedback shift registers","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Stream cipher; Shift register; Computer science; Power analysis; CMOS; Linear feedback shift register; Digital electronics; Bitstream; Computer hardware; Algorithm; Cryptography; Arithmetic; Electronic circuit; Electronic engineering; Mathematics; Chip; Engineering; Electrical engineering","authors":[{"name":"Abdulah Abdulah Zadeh","is_ca":true},{"name":"Howard M. Heys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00738755192662981,"gpt":0.2515864649745342,"spread":0.2441989130479044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000253363,0.000690845,0.0003831274,0.0006930537,0.0002506342,0.0004673523,0.0004950289,0.0003356106,0.00239306],"category_scores_gemma":[0.002101312,0.0002525715,0.000426421,0.0004208008,0.0005594578,0.0008536405,0.0004611293,0.0004934328,0.0004320234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004734132,"about_ca_system_score_gemma":0.0003037928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007491983,"about_ca_topic_score_gemma":0.0006881695,"domain_scores_codex":[0.9996376,0.00006950823,0.0000221339,0.00006387047,0.000184871,0.00002204212],"domain_scores_gemma":[0.9992537,0.0004443802,0.00008054651,0.0001222093,0.00009032489,0.000008927312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005863652,0.0001391461,0.003379902,0.0005448753,0.0001298399,0.0007789864,0.0005157844,0.352489,0.3622805,0.03521094,0.001221399,0.2427233],"study_design_scores_gemma":[0.00002120968,0.0002751954,0.00153134,0.00001888395,0.00002354283,0.000210525,0.00003463513,0.9039947,0.08210084,0.009133849,0.002635607,0.00001960023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532084,0.0003381339,0.8382742,0.0001648511,0.00007518318,0.00013864,0.0001130826,0.001139294,0.006548201],"genre_scores_gemma":[0.9276454,0.0002835569,0.068415,0.00005396606,0.00003545559,0.0000755028,0.00005938151,0.00007657544,0.00335527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00239306,"threshold_uncertainty_score":0.008005619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055602530","doi":"10.1049/iet-ifs.2014.0540","title":"Watch your constants: malicious Streebog","year":2015,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; SHA-2; Collision attack; Computer science; Cryptographic hash function; Checksum; Theoretical computer science; Hash chain; Context (archaeology); Collision resistance; MDC-2; Function (biology); Computer security; Cryptography; Collision; GOST (hash function); Double hashing; Operating system","authors":[{"name":"Riham AlTawy","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03660453717168044,"gpt":0.2919270135594357,"spread":0.2553224763877553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159038,0.0005949181,0.0005767258,0.0005663262,0.001417212,0.001493867,0.0008548493,0.001474175,0.007386648],"category_scores_gemma":[0.005751067,0.0003541734,0.0003814799,0.0004584005,0.002223885,0.003577708,0.002612235,0.001541192,0.002035761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008236683,"about_ca_system_score_gemma":0.0006026223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009968019,"about_ca_topic_score_gemma":0.00114659,"domain_scores_codex":[0.9982262,0.0004443117,0.00005038536,0.0001979808,0.000781555,0.0002995594],"domain_scores_gemma":[0.998052,0.0007353725,0.0001908394,0.0006546217,0.0002466706,0.0001205337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004315468,0.0002798512,0.01163933,0.0005096996,0.0002316279,0.004399789,0.005507915,0.02547676,0.06647991,0.578288,0.0400516,0.2628201],"study_design_scores_gemma":[0.0002970545,0.001885908,0.004310569,0.000402419,0.0002297275,0.008748786,0.002376736,0.2623977,0.2001349,0.2018834,0.316977,0.0003558476],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4466874,0.00354235,0.425225,0.00644629,0.001190336,0.0003934233,0.00031696,0.007548481,0.1086498],"genre_scores_gemma":[0.9516287,0.0003934198,0.02784447,0.0007123892,0.00007572196,0.00004430559,0.0001038835,0.0002933784,0.0189038],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007386648,"threshold_uncertainty_score":0.02471083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040896821","doi":"10.1049/iet-ifs.2013.0256","title":"PESCA: a peer‐to‐peer social network architecture with privacy‐enabled social communication and data availability","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Peer-to-peer; Internet privacy; Social network (sociolinguistics); Architecture; Computer network; Computer security; World Wide Web; Social media; Geography","authors":[{"name":"Fatemeh Raji","is_ca":false},{"name":"Mohammad Davarpanah Jazi","is_ca":false},{"name":"Ali Miri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01733672227295656,"gpt":0.2641272520833707,"spread":0.2467905298104141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001769543,0.0006833125,0.0007989217,0.0008126546,0.002162829,0.002206038,0.002610897,0.001292908,0.003685192],"category_scores_gemma":[0.003844413,0.0004549651,0.0005964115,0.0009283057,0.001065533,0.004515025,0.00405938,0.001148807,0.001285927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009762434,"about_ca_system_score_gemma":0.002142275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00459838,"about_ca_topic_score_gemma":0.004729327,"domain_scores_codex":[0.9986047,0.0003845137,0.00008713174,0.0003837795,0.0004321849,0.0001077133],"domain_scores_gemma":[0.9986179,0.0003352279,0.0001244367,0.0003711235,0.0003573947,0.0001940172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001383834,0.0007955166,0.005090675,0.0009717215,0.000386062,0.001559619,0.001976352,0.1764209,0.04184287,0.3186366,0.04566269,0.4052733],"study_design_scores_gemma":[0.0001103685,0.0003909052,0.001035127,0.00005751732,0.0001050404,0.0007983574,0.0003967675,0.7891644,0.008667171,0.09607961,0.1030863,0.000108359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04867867,0.001146845,0.9207949,0.001758298,0.0004112321,0.001085742,0.0004179463,0.005936549,0.01976979],"genre_scores_gemma":[0.6789363,0.0009624713,0.2884806,0.0005394556,0.0001910054,0.0008138401,0.0008492864,0.0002502088,0.02897683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00459838,"threshold_uncertainty_score":0.01232827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017406705","doi":"10.1049/iet-ifs.2011.0360","title":"Channel level crossing‐based security for communications over fading channels","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Computer science; Channel (broadcasting); Key exchange; Computer network; Wireless; Algorithm; Telecommunications; Public-key cryptography; Encryption","authors":[{"name":"Dimitrios S. Karas","is_ca":false},{"name":"George K. Karagiannidis","is_ca":false},{"name":"Robert Schober","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0412891896859474,"gpt":0.2852454945105527,"spread":0.2439563048246053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00241076,0.0007500213,0.001113858,0.001249026,0.0007601449,0.001626843,0.001016282,0.0009895976,0.002754786],"category_scores_gemma":[0.007676009,0.0002843227,0.000749924,0.001057337,0.002268712,0.002512665,0.001966421,0.001509279,0.0004849769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009889347,"about_ca_system_score_gemma":0.0008225533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003616993,"about_ca_topic_score_gemma":0.0002568406,"domain_scores_codex":[0.9981805,0.0006521766,0.00009732088,0.0002568616,0.0006058431,0.0002073165],"domain_scores_gemma":[0.9955139,0.002735721,0.0005011152,0.0007172882,0.00042171,0.0001101687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008855613,0.0001399728,0.001035717,0.0005159306,0.0002082311,0.0002407311,0.0004788224,0.3698254,0.04475329,0.295909,0.002507289,0.2835001],"study_design_scores_gemma":[0.00004277027,0.0003011798,0.0003841039,0.00005994278,0.00004233173,0.000310871,0.00004800016,0.9297953,0.0233152,0.04286893,0.002772295,0.00005907432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02050674,0.0007999271,0.9758361,0.000134894,0.00005137823,0.00006186981,0.000028091,0.0002770539,0.002304011],"genre_scores_gemma":[0.7765878,0.0009057043,0.2200031,0.0001270645,0.00007280061,0.0001028074,0.00007793491,0.00005667837,0.00206608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002754786,"threshold_uncertainty_score":0.01274943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967397417","doi":"10.1049/iet-ifs.2012.0094","title":"CloudAC: a cloud‐oriented multilayer access control system for logic virtual domain","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Multitenancy; Virtualization; Access control; Cloud computing security; Virtual machine; Distributed computing; Computer security; Software deployment; Security domain; Shared resource; Temporal isolation among virtual machines; Role-based access control; Computer network; Operating system; Software as a service; Software","authors":[{"name":"Weizhong Qiang","is_ca":false},{"name":"Deqing Zou","is_ca":false},{"name":"Shenglan Wang","is_ca":false},{"name":"Laurence T. Yang","is_ca":true},{"name":"Hai Jin","is_ca":false},{"name":"Lei Shi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01003166477651418,"gpt":0.2407661052796548,"spread":0.2307344405031406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102016,0.0004901969,0.0005115233,0.0009600405,0.001015862,0.002828751,0.001476957,0.0007495779,0.002127517],"category_scores_gemma":[0.001457745,0.0003069431,0.0005584672,0.0006458086,0.000946272,0.002187195,0.002022898,0.001172109,0.0006692829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339598,"about_ca_system_score_gemma":0.001864448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008379502,"about_ca_topic_score_gemma":0.003805532,"domain_scores_codex":[0.9989109,0.0001476063,0.0001111647,0.000215491,0.0003728058,0.0002419598],"domain_scores_gemma":[0.9987299,0.0001563699,0.0001727527,0.0003737171,0.0003325066,0.0002347779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003246259,0.001153232,0.01738561,0.0008186899,0.0004534107,0.001668039,0.001889064,0.08204406,0.1899246,0.2087799,0.03491655,0.4577208],"study_design_scores_gemma":[0.0001964163,0.000457618,0.003055595,0.00008316186,0.0001800946,0.0007035004,0.0001683002,0.8461984,0.0664252,0.01629723,0.06603707,0.0001973491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0724047,0.000622463,0.895031,0.0004420689,0.0002085598,0.0006960954,0.0002421054,0.02199057,0.008362471],"genre_scores_gemma":[0.8835116,0.0002752155,0.1096482,0.0003505902,0.0000899995,0.0002158824,0.0003561414,0.0002040165,0.005348161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008379502,"threshold_uncertainty_score":0.01666141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2984654445","doi":"10.1049/iet-ifs.2018.5288","title":"Choosing subfields for LUOV and lifting fields for rainbow","year":2019,"lang":"en","type":"article","venue":"IET Information Security","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University of Edmonton","funders":"Viet Nam National University Ho Chi Minh City","keywords":"Rainbow; NIST; Public-key cryptography; Binary number; Cryptography; Signature (topology); Key (lock); Scheme (mathematics); Computer science; Multivariate statistics; Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Arithmetic; Computer security; Statistics; Speech recognition; Physics; Optics; Encryption; Pure mathematics","authors":[{"name":"Le Van Luyen","is_ca":false},{"name":"Ha Thanh Nguyen Tran","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007333392382511736,"gpt":0.2300969670906782,"spread":0.2227635747081665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487794,0.0005042155,0.0004433691,0.000856955,0.0008991054,0.001272314,0.0005351938,0.0006032772,0.003991685],"category_scores_gemma":[0.003141708,0.0003123409,0.000685413,0.0006876097,0.001944326,0.00395955,0.002584422,0.001858534,0.001083587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000772972,"about_ca_system_score_gemma":0.0006813032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001963567,"about_ca_topic_score_gemma":0.0003164007,"domain_scores_codex":[0.9990546,0.000251709,0.00005539224,0.0001943222,0.00024938,0.0001946477],"domain_scores_gemma":[0.9986982,0.00044863,0.0001739677,0.0004676968,0.0001088645,0.0001026622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006974433,0.0001350371,0.002225924,0.0002363987,0.00002877762,0.0001723311,0.0004009113,0.009860335,0.04876817,0.8372742,0.003024109,0.09717636],"study_design_scores_gemma":[0.000149209,0.0005493484,0.001008981,0.0001373684,0.00005031477,0.0005115141,0.0002824171,0.04412216,0.06023933,0.8656633,0.02717467,0.0001113719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3339699,0.001421365,0.6220542,0.001855536,0.0002349945,0.000213327,0.0002394528,0.0007024881,0.03930881],"genre_scores_gemma":[0.8351821,0.0005958281,0.1546905,0.0003857302,0.0001515893,0.0001534414,0.0002317122,0.0001645671,0.008444356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003991685,"threshold_uncertainty_score":0.01335353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139586753","doi":"10.1049/iet-ifs.2009.0128","title":"Mining frequent itemsets in the presence of malicious participants","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Collusion; Computer science; Association rule learning; Protocol (science); Data mining; Computer security; Process (computing); Business","authors":[{"name":"Yoones A. Sekhavat","is_ca":false},{"name":"Mohammad Fathian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0320106358000154,"gpt":0.2931915448677675,"spread":0.2611809090677521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01213811,0.0007312092,0.001700161,0.002406417,0.00136925,0.002883971,0.002637231,0.002153274,0.0002077739],"category_scores_gemma":[0.04905947,0.0007939341,0.001382025,0.002808119,0.001566094,0.004972193,0.002656721,0.001478833,0.0001652481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007689939,"about_ca_system_score_gemma":0.001493225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005855737,"about_ca_topic_score_gemma":0.000517178,"domain_scores_codex":[0.9855666,0.006262951,0.001715613,0.002652563,0.003183798,0.0006184978],"domain_scores_gemma":[0.9197828,0.05320011,0.009661493,0.01274065,0.003711501,0.0009033298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002768981,0.0008553248,0.1019107,0.0005778659,0.001469957,0.005583065,0.003272073,0.4300957,0.03343526,0.06500667,0.001881821,0.3531426],"study_design_scores_gemma":[0.00004914106,0.0001902185,0.002109854,0.00002764876,0.0001384861,0.00120228,0.0004079263,0.9455267,0.01187539,0.03758392,0.0008576326,0.00003087408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2248941,0.0001852417,0.7736651,0.0004088977,0.00002123247,0.0001268036,0.0001293679,0.0002072458,0.0003620364],"genre_scores_gemma":[0.7952571,0.0001387346,0.203763,0.00006199252,0.0000378254,0.0001186641,0.0002833095,0.00001594691,0.0003235065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01213811,"threshold_uncertainty_score":0.06419325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2800140107","doi":"10.1049/iet-ifs.2017.0375","title":"Physical feasibility of QKD based on probabilistic quantum circuits","year":2018,"lang":"en","type":"article","venue":"IET Information Security","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum key distribution; Probabilistic logic; Photonics; Electronic circuit; Computer science; BB84; Beam splitter; Photon; Electronic engineering; Quantum; Photonic integrated circuit; Quantum computer; Theoretical computer science; Quantum network; Physics; Optics; Quantum mechanics; Engineering; Laser","authors":[{"name":"Amor Gueddana","is_ca":false},{"name":"Vasudevan Lakshminarayanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02007004559079412,"gpt":0.2727877927613299,"spread":0.2527177471705358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003953182,0.0005674238,0.001001771,0.0007995155,0.0007315068,0.0032426,0.001293356,0.002052385,0.004091532],"category_scores_gemma":[0.01263826,0.0007586267,0.001047667,0.0005421586,0.004353291,0.003934407,0.002578248,0.002032061,0.0004742146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001740121,"about_ca_system_score_gemma":0.001423048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004097584,"about_ca_topic_score_gemma":0.0001316981,"domain_scores_codex":[0.9955732,0.00169027,0.0001482771,0.0004197111,0.00169135,0.0004772879],"domain_scores_gemma":[0.9906366,0.007084718,0.0004071009,0.001266364,0.0004881851,0.0001169894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005647567,0.00006229764,0.0005594453,0.0001793005,0.00005092879,0.00008387845,0.0001003184,0.1847259,0.006125059,0.7960115,0.0003839954,0.01115266],"study_design_scores_gemma":[0.0001270257,0.0002644772,0.0007381885,0.00007228311,0.00005174104,0.000209746,0.00003713761,0.6803218,0.007560428,0.3066706,0.003881008,0.00006554768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3573162,0.003121145,0.5465446,0.002371975,0.0002267274,0.0002219612,0.0003339738,0.0004471215,0.08941641],"genre_scores_gemma":[0.9824087,0.0003999343,0.01563926,0.00006300001,0.00004353097,0.00007551498,0.00004577652,0.00002664537,0.00129756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004091532,"threshold_uncertainty_score":0.02090669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978881617","doi":"10.1049/iet-ifs.2011.0052","title":"HB <sup>𝒞</sup> entity authentication for low-cost pervasive devices","year":2012,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication protocol; Authentication (law); Protocol (science); Computer network; Forward secrecy; Key exchange; Computer security; Theoretical computer science; Public-key cryptography; Encryption","authors":[{"name":"Li Zhu","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01372462503379788,"gpt":0.2565123386231124,"spread":0.2427877135893145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290393,0.0003575457,0.0003202064,0.0003079488,0.0006983558,0.0008641293,0.001033123,0.0007026895,0.005554948],"category_scores_gemma":[0.003198849,0.0002153026,0.0002072194,0.0004337528,0.0008328679,0.002179041,0.001396719,0.001042019,0.00207014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005772487,"about_ca_system_score_gemma":0.0005887067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004762302,"about_ca_topic_score_gemma":0.0007696141,"domain_scores_codex":[0.9991927,0.0002710849,0.00006132981,0.00007074425,0.0003204577,0.00008380377],"domain_scores_gemma":[0.9975888,0.000666507,0.0002111462,0.0009444515,0.0004862635,0.000102808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007738272,0.00007983291,0.0007750007,0.0003366146,0.00003888908,0.0003557413,0.0002355728,0.01508358,0.04877019,0.6306432,0.03744397,0.2654635],"study_design_scores_gemma":[0.0001139064,0.0005814196,0.0008695835,0.00008265459,0.00006076901,0.001016326,0.000263044,0.4922061,0.1190378,0.2693035,0.116378,0.00008695084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03427473,0.0007863415,0.9360458,0.002665871,0.0005029677,0.0002251753,0.0001816547,0.001987136,0.02333043],"genre_scores_gemma":[0.7815433,0.0006476814,0.1969983,0.0009282055,0.0002492737,0.0001937382,0.000317636,0.000132557,0.01898924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005554948,"threshold_uncertainty_score":0.01858312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084450010","doi":"10.1049/iet-ifs.2014.0337","title":"Hijacking the Vuze BitTorrent network: all your hop are belong to us","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Stillwater (Canada)","funders":"","keywords":"BitTorrent; Computer science; Computer network; Set (abstract data type); File sharing; Theoretical computer science; Computer security; Information retrieval; Peer-to-peer; World Wide Web; The Internet","authors":[{"name":"Eric Chan‐Tin","is_ca":true},{"name":"Victor Heorhiadi","is_ca":false},{"name":"Nicholas Hopper","is_ca":false},{"name":"Yongdae Kim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01861161481625154,"gpt":0.2527797429686979,"spread":0.2341681281524464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433607,0.0007421867,0.0008586564,0.0005944137,0.001250956,0.0009957517,0.0009778608,0.001268691,0.002270866],"category_scores_gemma":[0.008550797,0.0004142379,0.0003131014,0.0005030023,0.0008064535,0.004290408,0.003412711,0.001441924,0.001066616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000383135,"about_ca_system_score_gemma":0.0006250702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004440468,"about_ca_topic_score_gemma":0.003943251,"domain_scores_codex":[0.9985307,0.0003472217,0.0001060709,0.0001842062,0.0005206555,0.0003111252],"domain_scores_gemma":[0.995672,0.0014545,0.0002674222,0.001829853,0.0004517015,0.0003245042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01211148,0.001605023,0.1065469,0.001976521,0.001407557,0.008145791,0.007009258,0.06733291,0.1652192,0.03543581,0.1113845,0.4818252],"study_design_scores_gemma":[0.0002593986,0.002200413,0.02990417,0.000265557,0.0004088728,0.01379421,0.003024974,0.6852976,0.1541932,0.01141598,0.09896448,0.0002711381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9219846,0.00216297,0.03833994,0.001438695,0.0004383455,0.00040685,0.0006883912,0.01307186,0.02146843],"genre_scores_gemma":[0.9884788,0.0003088108,0.007020827,0.0003131439,0.0000230418,0.00005574613,0.0004130036,0.000180148,0.003206489],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004440468,"threshold_uncertainty_score":0.008829236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969742447","doi":"10.1049/iet-ifs.2010.0271","title":"On the generalisation of special moduli for faster interleaved montgomery modular multiplication","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Instituto de Sistemas Complejos de Ingeniería","keywords":"Moduli; Elliptic curve cryptography; Modular arithmetic; Elliptic curve; Multiplication (music); Mathematics; Modular equation; Integer (computer science); Arithmetic; Cryptography; Prime (order theory); Elliptic curve point multiplication; Modular design; Discrete mathematics; Algebra over a field; Computer science; Algorithm; Pure mathematics; Public-key cryptography; Moduli of algebraic curves; Moduli space; Combinatorics","authors":[{"name":"Sedat Akleylek","is_ca":false},{"name":"Murat Cenk","is_ca":true},{"name":"Ferruh Özbudak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01157476058275508,"gpt":0.2114745024822962,"spread":0.1998997418995411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148234,0.000969237,0.0006461986,0.00105967,0.0005774455,0.001204216,0.00105761,0.0008157421,0.003848568],"category_scores_gemma":[0.00200918,0.0003616299,0.0009750688,0.0008993547,0.0009534949,0.003491869,0.001404288,0.001922518,0.001269973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004965989,"about_ca_system_score_gemma":0.0004334586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001976622,"about_ca_topic_score_gemma":0.0003097476,"domain_scores_codex":[0.9992544,0.0001608168,0.00008961221,0.0001652866,0.0002431651,0.00008682581],"domain_scores_gemma":[0.9992588,0.0001994006,0.00006797528,0.0003411871,0.000108223,0.00002423243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006109782,0.0001627872,0.0009762901,0.0005440871,0.0001038192,0.0005359321,0.0005882263,0.02151599,0.1160525,0.4967818,0.003363847,0.3587638],"study_design_scores_gemma":[0.0002410884,0.00128475,0.001277305,0.0002668509,0.0002207414,0.003713931,0.0001769954,0.292417,0.2408245,0.3001541,0.1592017,0.0002211464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0244798,0.0006375363,0.9647118,0.0002035448,0.0001980765,0.0001567935,0.00002610447,0.0006413425,0.008944952],"genre_scores_gemma":[0.3228043,0.0009729693,0.6673638,0.0002952245,0.0003075003,0.0002004023,0.0001791898,0.0002303856,0.007646267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003848568,"threshold_uncertainty_score":0.01287478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399475881","doi":"10.1049/2024/7557514","title":"PATS: Let Parties Have a Say in Threshold Group Key Sharing","year":2024,"lang":"en","type":"article","venue":"IET Information Security","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"ASELSAN","keywords":"Key (lock); Group (periodic table); Group key; Computer science; Mathematics; Theoretical computer science; Computer network; Computer security; Chemistry","authors":[{"name":"Adnan Kılıç","is_ca":false},{"name":"Cansu Betin Onur","is_ca":true},{"name":"Ertan Onur","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01444800838510357,"gpt":0.2449948060417055,"spread":0.2305467976566019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003343334,0.000535827,0.0007790086,0.0006937869,0.001756532,0.002857869,0.002147767,0.00234107,0.008209736],"category_scores_gemma":[0.006895363,0.000508811,0.001481447,0.001288006,0.004419792,0.01096561,0.006623109,0.002941713,0.002350658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071378,"about_ca_system_score_gemma":0.001642041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005917913,"about_ca_topic_score_gemma":0.0002883295,"domain_scores_codex":[0.9967192,0.0009755246,0.0002346508,0.0005586748,0.0009846317,0.0005272613],"domain_scores_gemma":[0.995903,0.001026104,0.0004292589,0.002025044,0.0003657691,0.0002507774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002509462,0.00005832251,0.0004202462,0.0001263353,0.00002542128,0.0002859589,0.0004915899,0.007356524,0.005802222,0.9561478,0.002870388,0.02616424],"study_design_scores_gemma":[0.0001732932,0.0003572066,0.0002451591,0.00007294777,0.00004828602,0.001147573,0.0002345318,0.1144876,0.02004149,0.8003613,0.06274241,0.00008820798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02405053,0.0002825184,0.9507143,0.001610487,0.0002105401,0.0004400353,0.0001333714,0.001030068,0.02152813],"genre_scores_gemma":[0.6635406,0.0004403196,0.315821,0.0008490418,0.000179363,0.0007510812,0.0002193131,0.0001611423,0.01803819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008209736,"threshold_uncertainty_score":0.02746427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027614277","doi":"10.1049/iet-ifs.2012.0032","title":"Oblivious decision program evaluation","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Theoretical computer science","authors":[{"name":"Salman Niksefat","is_ca":false},{"name":"Babak Sadeghiyan","is_ca":false},{"name":"Payman Mohassel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01208154998006518,"gpt":0.2749816545045415,"spread":0.2629001045244763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004783489,0.0007419865,0.001072435,0.0006754996,0.001076845,0.00215747,0.003182745,0.001610018,0.006088659],"category_scores_gemma":[0.01417296,0.0006425667,0.001163065,0.0006797283,0.002683699,0.006288802,0.004159763,0.003417338,0.001008111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002242071,"about_ca_system_score_gemma":0.00242612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000562027,"about_ca_topic_score_gemma":0.0005364615,"domain_scores_codex":[0.9931536,0.003094835,0.0003128306,0.0009796222,0.001543846,0.0009153167],"domain_scores_gemma":[0.988414,0.007386907,0.0007849364,0.002390783,0.0007312142,0.0002921463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005589899,0.0003188777,0.0008774095,0.0003310399,0.0001021,0.0001627036,0.0007195838,0.09571414,0.006849574,0.8097095,0.004277182,0.08037884],"study_design_scores_gemma":[0.0001265613,0.0001869641,0.000184818,0.00004700073,0.00004502952,0.00016008,0.0001148966,0.5646062,0.01657813,0.4060966,0.01181152,0.00004223972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01701654,0.0001190795,0.9751998,0.0006251609,0.00004202261,0.0002694117,0.00006990485,0.0004984337,0.006159655],"genre_scores_gemma":[0.6263516,0.000291307,0.3578091,0.0005324724,0.00008135701,0.0008777185,0.0003034403,0.0002089294,0.013544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006088659,"threshold_uncertainty_score":0.02529782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285088927","doi":"10.1049/ise2.12079","title":"The poor usability of OpenLDAP Access Control Lists","year":2022,"lang":"en","type":"article","venue":"IET Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Usability; Computer science; Web usability; World Wide Web; Cognitive walkthrough; Pluralistic walkthrough; Access control; Usability goals; Computer security; Knowledge management; Human–computer interaction","authors":[{"name":"Yi Fei Chen","is_ca":true},{"name":"Rahul Punchhi","is_ca":true},{"name":"Mahesh Tripunitara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01501306389561905,"gpt":0.3194926864870275,"spread":0.3044796225914084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03567871,0.0006027604,0.0007291669,0.002436858,0.00208717,0.007130106,0.00247733,0.001801452,0.005096253],"category_scores_gemma":[0.1708244,0.0008573034,0.0004293396,0.001474438,0.002961178,0.008739392,0.004309025,0.001536479,0.001561128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939239,"about_ca_system_score_gemma":0.002250893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003863232,"about_ca_topic_score_gemma":0.002510483,"domain_scores_codex":[0.9544922,0.02591165,0.005191365,0.002389906,0.01073033,0.001284563],"domain_scores_gemma":[0.6640256,0.2576824,0.01329568,0.03089042,0.03103488,0.003071018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003688301,0.001948008,0.1329797,0.005208143,0.0001955001,0.00522439,0.3149854,0.002868896,0.0559953,0.01767661,0.01721234,0.4420175],"study_design_scores_gemma":[0.0005842276,0.008918722,0.182065,0.006820292,0.0006562073,0.0107128,0.3049069,0.04534659,0.09069545,0.02507283,0.3224718,0.001749222],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9569233,0.0004356949,0.02811682,0.001370947,0.0001046374,0.0005117882,0.0002813224,0.00365787,0.008597578],"genre_scores_gemma":[0.9837082,0.0001705498,0.01243802,0.0002505787,0.00002330716,0.0001809364,0.0002502396,0.0003880188,0.002590061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03567871,"threshold_uncertainty_score":0.1886892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}