{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004873678,0.0001539027,0.0001496945,0.0002423256,0.0002292088,0.00029617,0.0003566247,0.0001195798,0.000008129999],"category_scores_gemma":[0.000496242,0.0001646818,0.00005047101,0.0005699432,0.00002455965,0.008710829,0.0002206496,0.0003256801,0.0001174634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002306536,"about_ca_system_score_gemma":0.00008347021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001430912,"about_ca_topic_score_gemma":0.00001208453,"domain_scores_codex":[0.9987069,0.00008077364,0.0003913339,0.0001731049,0.0004006709,0.0002471568],"domain_scores_gemma":[0.9986299,0.00005876689,0.0003418498,0.0003611994,0.0004694411,0.0001388434],"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.0002125094,0.0001486615,0.0007326776,0.0002414435,0.00006157328,0.00002305382,0.032245,0.05996056,0.007879684,0.03851643,0.002326373,0.857652],"study_design_scores_gemma":[0.001214891,0.000420236,0.0003707882,0.00004849361,0.00001134415,0.000328385,0.0009733606,0.5030368,0.3459646,0.04728281,0.0995706,0.0007777085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1210227,0.00001608394,0.8761472,0.00008159032,0.0004628094,0.0001970138,0.000002643977,0.001205492,0.0008645337],"genre_scores_gemma":[0.9520385,0.000009123284,0.04763319,0.0002082055,0.00006112899,0.00001914627,0.00001045213,0.000006928038,0.00001338542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8568743,"threshold_uncertainty_score":0.671553,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514315,0.0001720292,0.0001487864,0.0001906055,0.0004328073,0.0006057802,0.001079519,0.0001950123,0.0003097503],"category_scores_gemma":[0.00006688173,0.0001790316,0.000128412,0.0005581158,0.00008184307,0.007149098,0.000421182,0.0006259987,0.0003050773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002005384,"about_ca_system_score_gemma":0.00009161466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003159231,"about_ca_topic_score_gemma":0.00007829176,"domain_scores_codex":[0.9985496,0.00002066639,0.0003982461,0.0002267505,0.0004985586,0.0003061908],"domain_scores_gemma":[0.9988672,0.00004053455,0.0002030976,0.0005089208,0.0002463186,0.0001339754],"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.000005609056,0.00003362641,0.0007000915,0.00002824589,0.00001236942,0.000001252371,0.00578939,0.000001163013,0.0001457246,0.9826311,0.009586235,0.001065166],"study_design_scores_gemma":[0.001177125,0.0000504419,0.02112862,0.00001538266,0.000009619722,0.00006250907,0.0003189966,0.02932315,0.001074119,0.4664671,0.4796258,0.0007471474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6780592,0.00002169674,0.2663783,0.003736356,0.002472414,0.0005353342,0.0008196308,0.001312621,0.04666442],"genre_scores_gemma":[0.9832546,0.000003600752,0.0144846,0.001403177,0.0002446673,0.00002250144,0.0005794325,0.000004646053,0.000002805147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.516164,"threshold_uncertainty_score":0.7300696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003092518,0.000224675,0.0002460383,0.0001050919,0.0001630648,0.0001780435,0.0004000626,0.0002559203,0.00002129214],"category_scores_gemma":[0.00007543584,0.000242132,0.0001287508,0.0003071953,0.0000760343,0.001241484,0.00006757912,0.0005631367,0.00005408491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006784189,"about_ca_system_score_gemma":0.00002146859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004817815,"about_ca_topic_score_gemma":0.00002826065,"domain_scores_codex":[0.998808,0.00003332377,0.0004933699,0.0001226032,0.0002403298,0.0003023268],"domain_scores_gemma":[0.9985018,0.0001746354,0.0001584153,0.0007105228,0.0003391397,0.0001154869],"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.0005178331,0.001917461,0.0009058692,0.002535253,0.0008249216,0.000003074782,0.06936056,0.01691579,0.1511183,0.2403251,0.1775469,0.3380289],"study_design_scores_gemma":[0.0005864034,0.00002936166,0.001569739,0.00002369146,0.00002987384,0.000007942944,0.0001945931,0.8496772,0.01810832,0.001367576,0.1279993,0.0004060313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7328926,0.00003181896,0.2609695,0.0004973027,0.0005284542,0.0009741418,0.0005293473,0.00234174,0.001235054],"genre_scores_gemma":[0.9942185,0.00006088249,0.003401921,0.0001286037,0.0001077229,0.0002875931,0.001761382,0.00002793297,0.000005454517],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8327614,"threshold_uncertainty_score":0.9873858,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005116233,0.00008178917,0.00008699393,0.0001034379,0.0001731661,0.00009074045,0.0003202817,0.00003350947,0.00008072751],"category_scores_gemma":[0.00009708823,0.00004642439,0.00003917553,0.0002948729,0.00004727142,0.001346481,0.0001250811,0.0001027712,0.00001675796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009300175,"about_ca_system_score_gemma":0.0000281328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001878597,"about_ca_topic_score_gemma":0.00002149605,"domain_scores_codex":[0.9992323,0.00004683534,0.0002881547,0.00008448511,0.000218049,0.0001301784],"domain_scores_gemma":[0.9992624,0.0001149132,0.0001555106,0.0003075005,0.0001189013,0.00004075537],"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.000008242407,0.00003761762,0.0009054549,0.00001979639,0.00001040702,2.182184e-7,0.03750214,7.294708e-7,0.000008711371,0.945354,0.002054999,0.01409766],"study_design_scores_gemma":[0.003627887,0.001572179,0.1348335,0.0003736766,0.00005756621,0.0001107364,0.01840376,0.1146561,0.04510419,0.6041934,0.07551683,0.001550177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7902042,0.00002058781,0.1663707,0.001764693,0.0003579172,0.0007613599,0.0000408081,0.0001480639,0.04033162],"genre_scores_gemma":[0.9978175,0.0000139363,0.001650406,0.0004837422,0.000007239802,0.00001560813,0.000005663083,0.00000158986,0.000004282278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3411607,"threshold_uncertainty_score":0.1893131,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739094,0.0001115699,0.0001035608,0.000144148,0.0002170524,0.0004706148,0.0004923958,0.00006963194,0.00002527929],"category_scores_gemma":[0.00003293553,0.00009954315,0.00007409085,0.0002108462,0.00003557462,0.008250562,0.0001200204,0.00008836708,0.0001345884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002635953,"about_ca_system_score_gemma":0.00001480498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002209114,"about_ca_topic_score_gemma":4.42363e-7,"domain_scores_codex":[0.9991113,0.00002249169,0.0003178132,0.0001294679,0.0001684834,0.0002504694],"domain_scores_gemma":[0.999081,0.00004656454,0.0001526271,0.0003871795,0.0002721065,0.00006049706],"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.00004122916,0.000253327,0.001195783,0.0007483264,0.00007869524,0.000001462966,0.04483331,0.00005884947,0.008846892,0.5773776,0.09651151,0.2700531],"study_design_scores_gemma":[0.0006176155,0.00009805908,0.002408232,0.00005812165,0.00000826802,0.00001445677,0.0001328754,0.2329826,0.07850491,0.4985931,0.1860657,0.0005160373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01640603,0.000008173787,0.9769825,0.0007971255,0.00020148,0.00061963,0.00001044518,0.0005896848,0.004384964],"genre_scores_gemma":[0.8575572,0.000007833577,0.1415628,0.0004818434,0.000028896,0.0002744524,0.00005543444,0.000004168504,0.00002729237],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8411512,"threshold_uncertainty_score":0.5981458,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00131132,0.0002177531,0.0001774624,0.0005437205,0.0004402177,0.0004122311,0.000582344,0.00008298175,0.00004064497],"category_scores_gemma":[0.0001199626,0.0002114816,0.0001511065,0.0008268392,0.00005767956,0.004419172,0.0001435899,0.0003284045,0.0003195773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001301465,"about_ca_system_score_gemma":0.0000840561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009654767,"about_ca_topic_score_gemma":0.00005637241,"domain_scores_codex":[0.998032,0.00005502074,0.0006003227,0.0002987655,0.000656437,0.0003574635],"domain_scores_gemma":[0.9979922,0.0002403371,0.0003474184,0.0008963586,0.0003415681,0.0001820847],"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.004802303,0.004613101,0.0008538328,0.0006256486,0.000286006,0.0000916357,0.08283973,0.008483034,0.00213173,0.694355,0.1194937,0.0814243],"study_design_scores_gemma":[0.003572057,0.0005876859,0.01729937,0.0002058207,0.00004197638,0.00001919377,0.001391022,0.8631788,0.02638999,0.03111706,0.05523402,0.0009630251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06746507,0.000007883169,0.9174828,0.0005834655,0.0008072237,0.0004458871,0.0002023072,0.0002796086,0.01272577],"genre_scores_gemma":[0.9955978,0.000003737093,0.002935021,0.000953552,0.00006282621,0.00002681864,0.0004079909,0.000005957078,0.00000627501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9281328,"threshold_uncertainty_score":0.8623968,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006676969,0.0001631423,0.000232601,0.0005724206,0.0002263355,0.0004730891,0.0006574523,0.00006685554,0.0001311117],"category_scores_gemma":[0.00004596078,0.0001618422,0.0001600207,0.002168619,0.00003136729,0.001445361,0.0002243478,0.0001286874,0.0003061187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003793832,"about_ca_system_score_gemma":0.00003152674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001200797,"about_ca_topic_score_gemma":0.0001584142,"domain_scores_codex":[0.9984202,0.00004595322,0.0005337011,0.0002276905,0.0004541932,0.0003182575],"domain_scores_gemma":[0.9986055,0.00007012611,0.0001962752,0.0007874542,0.0001444126,0.0001962503],"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.00004807033,0.0001692125,0.005088793,0.00005725941,0.0003426877,8.339861e-7,0.05860012,0.003424781,0.00002279409,0.894945,0.02178413,0.01551632],"study_design_scores_gemma":[0.001581687,0.0002658252,0.07966461,0.000007563176,0.0001261281,0.000003519262,0.001373236,0.1642681,0.0003314197,0.02587345,0.7255152,0.0009893019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1091543,0.000001925182,0.8767376,0.001201168,0.000154003,0.0003009306,0.00004918677,0.0002061092,0.0121948],"genre_scores_gemma":[0.9828273,0.00000134238,0.01331497,0.003650869,0.00002917489,0.0000282296,0.0001409983,0.000003830504,0.00000328376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.873673,"threshold_uncertainty_score":0.6599731,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584854,0.0001355374,0.0001383451,0.0001367061,0.0001425484,0.0003893625,0.0005276758,0.00006847919,0.00005100426],"category_scores_gemma":[0.00006656841,0.0001290228,0.00006285892,0.0005777208,0.00005179007,0.003591913,0.0001918457,0.0001473005,0.0002394389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000594092,"about_ca_system_score_gemma":0.000148016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002123068,"about_ca_topic_score_gemma":0.00006363461,"domain_scores_codex":[0.9985677,0.00005428567,0.0004601232,0.0001375565,0.0004959411,0.0002844056],"domain_scores_gemma":[0.9987468,0.00003200538,0.0001728178,0.0004600626,0.0003835269,0.0002048096],"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.00001464045,0.00009174881,0.00289934,0.00002557722,0.00002669853,0.000005039083,0.04004716,0.00003435939,0.000006518153,0.8815463,0.05705122,0.01825139],"study_design_scores_gemma":[0.003393482,0.000271742,0.002823286,0.00002322299,0.00001700041,0.000113351,0.008134263,0.04623086,0.0007887217,0.135599,0.8018355,0.0007695734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3578337,0.00007732317,0.5851319,0.007073936,0.001641926,0.0007561042,0.0002240366,0.0008437519,0.04641731],"genre_scores_gemma":[0.9932159,0.0000149452,0.005418492,0.001194476,0.00004022512,0.00001952132,0.00007879156,0.000003108379,0.00001454769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7459473,"threshold_uncertainty_score":0.5261396,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628014,0.0002396018,0.0003034576,0.0001391611,0.0007226393,0.0006453015,0.003080864,0.0002044884,0.000007355866],"category_scores_gemma":[0.0006478708,0.0002150168,0.000033415,0.0009385588,0.0001592723,0.002305544,0.003401892,0.0005251039,0.00007601979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008594743,"about_ca_system_score_gemma":0.00008697485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006574258,"about_ca_topic_score_gemma":0.0002067435,"domain_scores_codex":[0.9976016,0.0001959109,0.0004602617,0.0003863876,0.0008813675,0.000474451],"domain_scores_gemma":[0.9969931,0.0001593235,0.0002598277,0.001855921,0.0006085074,0.0001233255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001848264,0.0001048651,0.002616867,0.0001231031,0.00008004453,8.826516e-7,0.07185273,0.001901823,0.000009744973,0.0847718,0.6392986,0.1990548],"study_design_scores_gemma":[0.0009109284,0.0001742627,0.03535484,0.00003826855,0.00002212634,0.00001813212,0.0003427206,0.05247322,0.00004365727,0.03831629,0.8716816,0.0006239286],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1715934,0.00002890643,0.6946977,0.1247631,0.0002457105,0.001307506,0.0001253706,0.001559926,0.005678332],"genre_scores_gemma":[0.9284384,0.000002728173,0.06880102,0.002211977,0.0001845483,0.00005160688,0.0002592629,0.000009061394,0.00004137236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.756845,"threshold_uncertainty_score":0.8768129,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000516784,0.000315727,0.000321627,0.0003216496,0.0005918062,0.000769867,0.00114381,0.0002850536,0.0001303077],"category_scores_gemma":[0.0001323284,0.000362522,0.0001728915,0.0004028606,0.0002111101,0.003585078,0.0002252694,0.00046609,0.0001910584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002105089,"about_ca_system_score_gemma":0.00006753197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002047132,"about_ca_topic_score_gemma":0.00003766971,"domain_scores_codex":[0.9982188,0.00006582128,0.0008030363,0.000147551,0.0003090686,0.0004557232],"domain_scores_gemma":[0.9972171,0.0002774488,0.0002189328,0.001593623,0.0005320921,0.0001608529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001076764,0.00103763,0.0006383134,0.00445787,0.0005473408,8.754948e-7,0.1772904,0.0385385,0.002262946,0.1179026,0.6293149,0.02790099],"study_design_scores_gemma":[0.0007391711,0.00003134833,0.000556994,0.00009125421,0.00001429421,0.000002890397,0.0003861837,0.8447101,0.00631013,0.01600865,0.1306281,0.0005208991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2354923,0.001102185,0.7082577,0.005884191,0.001675643,0.008334348,0.002205409,0.009726075,0.02732219],"genre_scores_gemma":[0.9908091,0.00009307689,0.006250603,0.000743938,0.00006631981,0.001254837,0.0007280626,0.0000421823,0.00001187389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8061716,"threshold_uncertainty_score":0.9998827,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000672637,0.0002086964,0.0002503988,0.0001557557,0.0003063342,0.0007685959,0.001110336,0.000107306,0.00001317528],"category_scores_gemma":[0.00007875245,0.000173819,0.0001421953,0.0003468001,0.00003662485,0.0007190654,0.0004332734,0.0001503929,0.0003492576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248882,"about_ca_system_score_gemma":0.00003378621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001013964,"about_ca_topic_score_gemma":0.000002334618,"domain_scores_codex":[0.998231,0.00009168147,0.0006063066,0.0002430589,0.0004097865,0.0004181494],"domain_scores_gemma":[0.9983222,0.0001658866,0.0003436413,0.0005692423,0.0004590843,0.0001399824],"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.0001238029,0.000270467,0.0003723737,0.0006670016,0.0002067586,0.00000492089,0.01986385,0.02924737,0.00004852879,0.8284758,0.07620199,0.04451716],"study_design_scores_gemma":[0.002501477,0.0001452442,0.0006506207,0.00004945335,0.00001065104,0.00001086138,0.0009989495,0.9168524,0.0001155809,0.002502651,0.07585126,0.0003109046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1833847,0.00001359065,0.808954,0.001683285,0.001377885,0.00138649,0.0000185675,0.0006003027,0.002581159],"genre_scores_gemma":[0.9937915,7.937174e-7,0.003651576,0.002060019,0.0001998911,0.0002332628,0.00001553735,0.000006467019,0.00004092813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.887605,"threshold_uncertainty_score":0.7411588,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983027,0.00007354288,0.00009709701,0.00006161683,0.0001171176,0.0002312062,0.0001661054,0.000070312,0.000004314944],"category_scores_gemma":[0.00007691151,0.00007143582,0.00004655856,0.0000883948,0.000008004015,0.001779038,0.00007211616,0.00006327043,0.00001226525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001382911,"about_ca_system_score_gemma":0.00003400733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215823,"about_ca_topic_score_gemma":0.000002764535,"domain_scores_codex":[0.9994221,0.000008956586,0.0002199544,0.0001040974,0.0000889265,0.0001560161],"domain_scores_gemma":[0.9994186,0.0002041049,0.0001104503,0.00013027,0.00009218423,0.0000443709],"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.00008580008,0.00004243986,0.0009660525,0.0007184948,0.00003699206,1.845084e-7,0.03785392,0.0007419054,0.0001658927,0.3306633,0.01193306,0.6167919],"study_design_scores_gemma":[0.001321475,0.0001690044,0.001279785,0.00003309362,0.00000472238,0.000005875877,0.0002065346,0.8950502,0.00151722,0.04911495,0.05106104,0.000236082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2302329,0.00002134596,0.7656781,0.001859182,0.0005672877,0.0005210643,0.000009449303,0.00009553964,0.001015135],"genre_scores_gemma":[0.9880334,0.000002750148,0.01047655,0.001320017,0.00008252623,0.00002773456,0.00002119326,0.00000220997,0.00003368082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8943083,"threshold_uncertainty_score":0.2913068,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001223081,0.00008686409,0.0001102095,0.0001264346,0.00006019965,0.0001358004,0.01277341,0.00009955874,0.000010863],"category_scores_gemma":[0.01330449,0.00006639306,0.00002308805,0.0005599937,0.00009833244,0.002653664,0.008935207,0.0003297252,0.00002930378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001491425,"about_ca_system_score_gemma":0.00004776923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001484966,"about_ca_topic_score_gemma":0.0000967235,"domain_scores_codex":[0.9987521,0.00005985454,0.0004244193,0.0001170199,0.0003851968,0.0002614173],"domain_scores_gemma":[0.9956897,0.0002452337,0.0002264374,0.003709023,0.00009925933,0.00003034173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002837363,0.0005338736,0.1225338,0.0004084663,0.00005016696,0.00003344035,0.1103996,0.000175749,0.002815055,0.2676865,0.4173536,0.0779814],"study_design_scores_gemma":[0.001220969,0.0001650711,0.1044149,0.0001474211,0.00001090781,0.00009558035,0.002451355,0.4725198,0.04151603,0.3415674,0.03519819,0.0006924025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9780568,0.00001345082,0.01041043,0.009049755,0.0003791032,0.0002367243,0.00002347959,0.0001837014,0.001646493],"genre_scores_gemma":[0.9804999,0.000008925933,0.01911947,0.0003258143,0.000009952354,0.00002310561,0.00001050931,0.000001683469,6.435602e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4723441,"threshold_uncertainty_score":0.9990804,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204546,0.0001510981,0.000193448,0.0002327053,0.000132767,0.0001285472,0.0005924802,0.00007116733,0.00004491452],"category_scores_gemma":[0.0001917858,0.000133336,0.0001344648,0.0007793449,0.0001878419,0.002487295,0.00007190571,0.0001484916,0.0003605676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004582035,"about_ca_system_score_gemma":0.000121862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001086159,"about_ca_topic_score_gemma":0.00000273996,"domain_scores_codex":[0.9984331,0.00006961945,0.0005274174,0.0001465656,0.0005984961,0.0002247639],"domain_scores_gemma":[0.9982046,0.0001038505,0.0003269007,0.000721165,0.0005338828,0.0001095498],"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.00003944958,0.0003866074,0.0007234077,0.0001993465,0.000009637393,2.192516e-7,0.01121078,0.0002332551,0.00004172872,0.9760836,0.00251113,0.008560829],"study_design_scores_gemma":[0.0007095443,0.000553282,0.008406452,0.00003359335,0.000004739466,0.000001990229,0.0001070705,0.9395478,0.0023773,0.04439787,0.00364194,0.0002183877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6126537,0.000002460115,0.3417553,0.0005821072,0.0005768854,0.0006764238,0.00005699929,0.0003981409,0.04329791],"genre_scores_gemma":[0.998358,5.131317e-7,0.0005061163,0.001046814,0.00004654397,0.0000157167,0.00002253347,0.000002688859,0.000001118253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9393146,"threshold_uncertainty_score":0.5437283,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000838567,0.0001796318,0.0001692684,0.0001934429,0.000337089,0.0004326799,0.0007279527,0.0001266297,0.00005516712],"category_scores_gemma":[0.0001603937,0.0001768204,0.0001564292,0.0004804117,0.00005602398,0.01275998,0.0002106044,0.0001517158,0.0003508658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005160244,"about_ca_system_score_gemma":0.00005743575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004812789,"about_ca_topic_score_gemma":0.0000175249,"domain_scores_codex":[0.9984765,0.00005710266,0.000466336,0.0001801535,0.0003748635,0.0004450218],"domain_scores_gemma":[0.9984358,0.000136922,0.000265633,0.0006352728,0.0003233986,0.0002029544],"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.00003214595,0.000314137,0.007617256,0.0004221763,0.00004568738,1.777747e-7,0.05922911,0.00005154128,0.00001269471,0.9035443,0.01310079,0.01562999],"study_design_scores_gemma":[0.001590612,0.00008538214,0.04291688,0.00007184306,0.00005709836,0.00002183084,0.001868113,0.1528804,0.002244767,0.02619411,0.7712057,0.0008631948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1717632,0.0001234206,0.8229183,0.0007574006,0.0006507121,0.001214943,0.0004616077,0.0003551379,0.001755346],"genre_scores_gemma":[0.9885493,0.00003747746,0.009595314,0.0009404928,0.0001596419,0.0001484664,0.0005622077,0.000004774132,0.000002333418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8773502,"threshold_uncertainty_score":0.9250681,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009385922,0.0002082257,0.0002014483,0.000156893,0.0002932311,0.0005894129,0.001951937,0.0001228912,0.000006095474],"category_scores_gemma":[0.0002928973,0.0001619424,0.00007103714,0.0009363435,0.00003565215,0.001675211,0.001183113,0.0003266912,0.00058031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072524,"about_ca_system_score_gemma":0.00003137226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005833177,"about_ca_topic_score_gemma":0.00009034721,"domain_scores_codex":[0.9981066,0.00007203969,0.0004513203,0.0002265916,0.0005628901,0.0005805584],"domain_scores_gemma":[0.9981953,0.0001203165,0.0002576547,0.001061838,0.0002184836,0.0001464316],"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.00002568588,0.00005765677,0.009094306,0.0000610232,0.00006288216,0.00000479663,0.02552341,0.06640469,0.00001420859,0.1437608,0.3615576,0.3934329],"study_design_scores_gemma":[0.0002142301,0.00008479529,0.02092468,0.00005385134,0.000006389658,0.0000174328,0.000225821,0.1540073,0.0001894836,0.006397707,0.8175228,0.0003554734],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1709268,0.00006938436,0.7890393,0.03103424,0.002165112,0.0007622863,0.00001164824,0.001676354,0.0043149],"genre_scores_gemma":[0.9802959,0.0000100701,0.01058286,0.008753701,0.0002548336,0.00006208468,0.00001122807,0.000006950588,0.00002239135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.809369,"threshold_uncertainty_score":0.7458904,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503338,0.00009152169,0.00009619076,0.0001300528,0.0001089112,0.0001413117,0.0003832005,0.00006000913,0.0000344211],"category_scores_gemma":[0.00006820137,0.00006395129,0.00009828233,0.0002240429,0.00004312296,0.001673579,0.0000571581,0.00007867388,0.0000681735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864949,"about_ca_system_score_gemma":0.00001427411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006099472,"about_ca_topic_score_gemma":0.000006653923,"domain_scores_codex":[0.9991634,0.00004261307,0.0003420876,0.0001040944,0.0002213365,0.0001263922],"domain_scores_gemma":[0.9989766,0.0001268974,0.0002119636,0.0003943735,0.0002564917,0.00003366691],"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.00004162892,0.0001527534,0.0002116269,0.00009511968,0.00005282546,6.795694e-8,0.02749154,0.003000868,0.001717311,0.8693331,0.01768807,0.08021513],"study_design_scores_gemma":[0.0006686337,0.0001392877,0.01316924,0.00002367236,0.000006956644,0.000001621806,0.0003829478,0.8506668,0.01179379,0.117434,0.005522135,0.0001909238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4975519,0.000007040362,0.4978847,0.002179133,0.0003135566,0.0008177862,0.00001432947,0.00004609989,0.00118548],"genre_scores_gemma":[0.9949933,0.000005362388,0.004065137,0.0006302811,0.000120204,0.0001476803,0.00002724341,0.000002716283,0.000008109168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.847666,"threshold_uncertainty_score":0.2607858,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007443252,0.0002162028,0.0002171813,0.0003355487,0.0001034048,0.001296383,0.0008836339,0.0001723124,0.00004230863],"category_scores_gemma":[0.00004703162,0.0002157849,0.0000951051,0.0006453412,0.00005474777,0.006342967,0.0004358583,0.0005460975,0.0003537313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00014938,"about_ca_system_score_gemma":0.00004324223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001441405,"about_ca_topic_score_gemma":0.0002164013,"domain_scores_codex":[0.9980586,0.00004279891,0.0006449357,0.0002998606,0.0004996992,0.0004541733],"domain_scores_gemma":[0.9989875,0.0001220933,0.0001012491,0.0006143852,0.00007294803,0.0001018327],"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.00001843201,0.00007499638,0.003026351,0.0003598118,0.00003701485,0.00005553408,0.1083446,0.003640886,0.00001559308,0.853596,0.01189429,0.01893653],"study_design_scores_gemma":[0.000269196,0.00003869423,0.001027468,0.0002170214,0.000004000396,0.00002824673,0.0005564974,0.9055381,0.0002103583,0.03909201,0.05269103,0.0003273547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7720131,0.002889605,0.1493113,0.007620213,0.005571778,0.001479681,0.00007996209,0.003585631,0.05744866],"genre_scores_gemma":[0.9976575,0.0001080335,0.0008508983,0.001130696,0.000131378,0.0000497231,0.00004247738,0.000009426701,0.00001985775],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9018973,"threshold_uncertainty_score":0.9997404,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008237878,0.0001372359,0.0001178299,0.0002269302,0.0001784088,0.0008926995,0.0006739014,0.0001023779,0.00029128],"category_scores_gemma":[0.0001638706,0.0001238823,0.00008423202,0.0007533882,0.00003695547,0.01087437,0.000225096,0.0001639707,0.00144321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004596349,"about_ca_system_score_gemma":0.00007253107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001239309,"about_ca_topic_score_gemma":0.00001909951,"domain_scores_codex":[0.998264,0.00006937078,0.0004285316,0.0001801092,0.0007997709,0.000258215],"domain_scores_gemma":[0.9983342,0.00008104961,0.0001753561,0.0006803101,0.0005965,0.0001326054],"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.000004196042,0.0001138304,0.0002816449,0.00001592453,0.0000076074,2.136826e-7,0.002858855,0.00002692636,0.000004733587,0.08977852,0.02974377,0.8771638],"study_design_scores_gemma":[0.001010727,0.0001804907,0.02932376,0.00002816286,0.00001126513,0.00001943527,0.0002010524,0.4860382,0.0002226109,0.2993324,0.1832348,0.0003971209],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2410653,0.0001353952,0.7273214,0.0009722683,0.001163713,0.004118725,0.00003646926,0.001299054,0.02388766],"genre_scores_gemma":[0.9501963,0.00002293574,0.0485194,0.0005816109,0.00003955678,0.0004900406,0.0001464318,0.000002859249,8.693611e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8767667,"threshold_uncertainty_score":0.9993343,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002293757,0.00006269616,0.0001273867,0.00003445045,0.001680867,0.0002706171,0.0008175212,0.00003491461,0.0006541233],"category_scores_gemma":[0.0004847159,0.00004843319,0.00007399741,0.0003021281,0.0002358419,0.00223957,0.0001997806,0.00017741,0.00002082936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009383061,"about_ca_system_score_gemma":0.0002296811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003967749,"about_ca_topic_score_gemma":0.0009871991,"domain_scores_codex":[0.9983989,0.0003212575,0.0003868109,0.00006659534,0.0006256693,0.0002007832],"domain_scores_gemma":[0.9988917,0.0003331407,0.0003070954,0.0001886986,0.000218385,0.00006103773],"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.00046381,0.0001884611,0.0328721,0.0000532091,0.00007879535,8.453725e-7,0.05991205,0.0005663813,0.00000527513,0.8365896,0.02055921,0.04871031],"study_design_scores_gemma":[0.0009871309,0.00003939813,0.0259973,0.000002084103,0.00001408262,6.564853e-7,0.009367545,0.001783285,0.00002856868,0.0213845,0.9402717,0.000123762],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4989016,0.0002274329,0.0009542199,0.02881967,0.002028816,0.00225414,0.0005843655,0.0001971628,0.4660326],"genre_scores_gemma":[0.9988699,0.00001785852,0.000003612593,0.0008852032,0.00005721355,0.0000901938,0.00001341482,0.000001808842,0.00006081773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9197125,"threshold_uncertainty_score":0.9996188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}