{"meta":{"query_hash":"f2646b840afe","filters":{"venue":"IET Information Security"},"cohort_total":20,"direct_labels_cover":0,"predictions_cover":20,"exported":20,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f2646b840afe","api":"https://metacan.xera.ac/api/v1/cohort?venue=IET+Information+Security"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010031664776514179,"score_gpt":0.2407661052796548,"score_spread":0.23073444050314063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967397417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1833847,0.000013590652,0.808954,0.0016832851,0.0013778848,0.0013864898,0.000018567498,0.00060030265,0.0025811591],"genre_scores_gemma":[0.9937915,7.9371745e-7,0.0036515763,0.0020600194,0.00019989107,0.00023326278,0.000015537345,0.000006467019,0.000040928127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998231,0.00009168147,0.0006063066,0.00024305888,0.00040978653,0.00041814943],"domain_scores_gemma":[0.9983222,0.00016588658,0.00034364132,0.00056924234,0.00045908432,0.00013998237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000672637,0.00020869637,0.00025039876,0.00015575567,0.00030633417,0.0007685959,0.0011103358,0.00010730602,0.000013175282],"category_scores_gemma":[0.00007875245,0.00017381896,0.00014219529,0.00034680014,0.000036624846,0.0007190654,0.00043327344,0.00015039294,0.0003492576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238029,0.000270467,0.0003723737,0.00066700164,0.0002067586,0.00000492089,0.019863851,0.029247373,0.000048528793,0.8284758,0.07620199,0.04451716],"study_design_scores_gemma":[0.0025014766,0.00014524415,0.0006506207,0.000049453352,0.000010651038,0.000010861379,0.0009989495,0.91685236,0.00011558092,0.002502651,0.07585126,0.00031090464],"about_ca_topic_score_codex":0.00010139639,"about_ca_topic_score_gemma":0.0000023346176,"teacher_disagreement_score":0.88760495,"about_ca_system_score_codex":0.0001248882,"about_ca_system_score_gemma":0.000033786207,"threshold_uncertainty_score":0.7411588},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011574760582755084,"score_gpt":0.2114745024822962,"score_spread":0.19989974189954113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969742447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49755192,0.000007040362,0.49788466,0.002179133,0.00031355664,0.0008177862,0.000014329475,0.000046099893,0.0011854796],"genre_scores_gemma":[0.99499327,0.0000053623885,0.0040651374,0.00063028105,0.00012020401,0.00014768029,0.000027243406,0.0000027162835,0.0000081091675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916345,0.00004261307,0.0003420876,0.00010409436,0.0002213365,0.00012639225],"domain_scores_gemma":[0.9989766,0.00012689737,0.00021196365,0.0003943735,0.00025649174,0.00003366691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025033377,0.00009152169,0.000096190764,0.00013005278,0.000108911205,0.00014131167,0.0003832005,0.00006000913,0.0000344211],"category_scores_gemma":[0.00006820137,0.000063951295,0.000098282326,0.00022404293,0.000043122964,0.0016735794,0.000057158097,0.00007867388,0.000068173504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004162892,0.00015275342,0.00021162686,0.00009511968,0.000052825457,6.795694e-8,0.027491538,0.0030008678,0.0017173105,0.8693331,0.017688066,0.08021513],"study_design_scores_gemma":[0.00066863373,0.0001392877,0.013169243,0.000023672355,0.0000069566436,0.0000016218056,0.0003829478,0.8506668,0.011793788,0.11743395,0.0055221347,0.00019092378],"about_ca_topic_score_codex":0.000060994716,"about_ca_topic_score_gemma":0.0000066539233,"teacher_disagreement_score":0.84766597,"about_ca_system_score_codex":0.000018649493,"about_ca_system_score_gemma":0.000014274114,"threshold_uncertainty_score":0.26078582},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.007652615270703633,"score_gpt":0.2504995711155292,"score_spread":0.24284695584482555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971382044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067465074,0.000007883169,0.9174828,0.0005834655,0.0008072237,0.00044588707,0.00020230722,0.00027960856,0.0127257705],"genre_scores_gemma":[0.99559784,0.000003737093,0.002935021,0.00095355196,0.00006282621,0.000026818638,0.00040799094,0.0000059570775,0.00000627501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998032,0.000055020744,0.00060032273,0.00029876546,0.000656437,0.00035746355],"domain_scores_gemma":[0.9979922,0.00024033713,0.00034741845,0.00089635863,0.00034156814,0.00018208474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113196,0.00021775307,0.00017746241,0.0005437205,0.0004402177,0.00041223114,0.00058234396,0.00008298175,0.000040644965],"category_scores_gemma":[0.000119962635,0.00021148157,0.0001511065,0.0008268392,0.00005767956,0.004419172,0.00014358989,0.00032840448,0.00031957726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048023034,0.0046131015,0.00085383275,0.0006256486,0.00028600605,0.0000916357,0.08283973,0.008483034,0.0021317299,0.694355,0.1194937,0.0814243],"study_design_scores_gemma":[0.0035720568,0.0005876859,0.017299367,0.00020582069,0.00004197638,0.00001919377,0.0013910217,0.8631788,0.026389986,0.031117056,0.05523402,0.0009630251],"about_ca_topic_score_codex":0.00009654767,"about_ca_topic_score_gemma":0.000056372406,"teacher_disagreement_score":0.9281328,"about_ca_system_score_codex":0.00013014651,"about_ca_system_score_gemma":0.0000840561,"threshold_uncertainty_score":0.86239684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication protocol; Authentication (law); Protocol (science); Computer network; Forward secrecy; Key exchange; Computer security; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.013724625033797884,"score_gpt":0.2565123386231124,"score_spread":0.24278771358931453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978881617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17176315,0.00012342063,0.8229183,0.00075740064,0.00065071206,0.0012149429,0.00046160773,0.0003551379,0.0017553457],"genre_scores_gemma":[0.9885493,0.000037477457,0.009595314,0.00094049284,0.00015964193,0.00014846644,0.00056220766,0.000004774132,0.0000023334183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984765,0.000057102665,0.000466336,0.00018015351,0.00037486348,0.0004450218],"domain_scores_gemma":[0.9984358,0.00013692197,0.00026563302,0.0006352728,0.00032339865,0.0002029544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083856704,0.00017963182,0.00016926839,0.00019344293,0.00033708903,0.00043267992,0.0007279527,0.00012662972,0.000055167122],"category_scores_gemma":[0.00016039367,0.00017682038,0.00015642925,0.0004804117,0.00005602398,0.0127599845,0.00021060444,0.00015171577,0.00035086577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003214595,0.00031413697,0.0076172557,0.00042217626,0.000045687382,1.7777467e-7,0.059229113,0.000051541276,0.000012694714,0.9035443,0.013100792,0.015629988],"study_design_scores_gemma":[0.0015906125,0.00008538214,0.042916883,0.00007184306,0.000057098358,0.000021830836,0.0018681128,0.15288043,0.0022447666,0.02619411,0.7712057,0.0008631948],"about_ca_topic_score_codex":0.00004812789,"about_ca_topic_score_gemma":0.000017524902,"teacher_disagreement_score":0.8773502,"about_ca_system_score_codex":0.000051602437,"about_ca_system_score_gemma":0.00005743575,"threshold_uncertainty_score":0.9250681},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00596736023236297,"score_gpt":0.23090521996746646,"score_spread":0.2249378597351035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985322847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780592,0.000021696738,0.2663783,0.003736356,0.002472414,0.0005353342,0.0008196308,0.0013126207,0.04666442],"genre_scores_gemma":[0.98325455,0.0000036007523,0.014484598,0.0014031774,0.00024466726,0.000022501441,0.0005794325,0.0000046460527,0.0000028051466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985496,0.00002066639,0.00039824608,0.0002267505,0.00049855857,0.00030619078],"domain_scores_gemma":[0.99886715,0.000040534545,0.00020309763,0.00050892076,0.00024631864,0.00013397544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514315,0.00017202919,0.00014878636,0.0001906055,0.0004328073,0.00060578017,0.001079519,0.0001950123,0.0003097503],"category_scores_gemma":[0.00006688173,0.00017903159,0.00012841201,0.00055811583,0.00008184307,0.007149098,0.00042118205,0.00062599865,0.00030507726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056090557,0.000033626406,0.0007000915,0.000028245886,0.000012369416,0.0000012523706,0.00578939,0.0000011630133,0.00014572455,0.98263115,0.009586235,0.0010651655],"study_design_scores_gemma":[0.0011771249,0.000050441904,0.02112862,0.00001538266,0.000009619722,0.00006250907,0.00031899664,0.029323153,0.0010741194,0.46646714,0.47962576,0.0007471474],"about_ca_topic_score_codex":0.00003159231,"about_ca_topic_score_gemma":0.000078291756,"teacher_disagreement_score":0.516164,"about_ca_system_score_codex":0.000020053842,"about_ca_system_score_gemma":0.00009161466,"threshold_uncertainty_score":0.73006964},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020878629609610518,"score_gpt":0.2689254753340033,"score_spread":0.24804684572439278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999728176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12102268,0.00001608394,0.87614715,0.00008159032,0.00046280943,0.00019701383,0.000002643977,0.0012054923,0.0008645337],"genre_scores_gemma":[0.95203847,0.000009123284,0.047633186,0.00020820554,0.000061128994,0.000019146266,0.000010452126,0.000006928038,0.000013385417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.000080773636,0.0003913339,0.0001731049,0.00040067086,0.00024715677],"domain_scores_gemma":[0.9986299,0.000058766887,0.00034184975,0.0003611994,0.0004694411,0.00013884342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048736777,0.00015390266,0.00014969449,0.00024232555,0.00022920876,0.00029617004,0.00035662472,0.000119579825,0.000008129999],"category_scores_gemma":[0.00049624196,0.00016468181,0.00005047101,0.0005699432,0.000024559651,0.008710829,0.00022064964,0.00032568007,0.000117463394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021250942,0.00014866152,0.00073267764,0.00024144347,0.00006157328,0.000023053824,0.032245003,0.059960555,0.007879684,0.038516432,0.002326373,0.857652],"study_design_scores_gemma":[0.0012148911,0.000420236,0.00037078816,0.00004849361,0.00001134415,0.00032838495,0.0009733606,0.5030368,0.34596458,0.047282815,0.0995706,0.00077770854],"about_ca_topic_score_codex":0.00014309117,"about_ca_topic_score_gemma":0.000012084532,"teacher_disagreement_score":0.85687435,"about_ca_system_score_codex":0.00023065358,"about_ca_system_score_gemma":0.00008347021,"threshold_uncertainty_score":0.67155296},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0412891896859474,"score_gpt":0.2852454945105527,"score_spread":0.24395630482460529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017406705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2354923,0.001102185,0.7082577,0.0058841906,0.0016756434,0.008334348,0.0022054093,0.0097260745,0.027322188],"genre_scores_gemma":[0.9908091,0.000093076895,0.006250603,0.000743938,0.00006631981,0.0012548374,0.0007280626,0.0000421823,0.000011873885],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982188,0.00006582128,0.0008030363,0.00014755098,0.00030906862,0.0004557232],"domain_scores_gemma":[0.99721706,0.0002774488,0.00021893284,0.0015936231,0.0005320921,0.00016085288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051678397,0.00031572697,0.00032162695,0.00032164957,0.0005918062,0.00076986704,0.0011438103,0.00028505357,0.0001303077],"category_scores_gemma":[0.00013232842,0.00036252197,0.0001728915,0.00040286063,0.00021111013,0.0035850776,0.00022526938,0.00046608996,0.00019105838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107676424,0.0010376304,0.00063831336,0.00445787,0.0005473408,8.754948e-7,0.17729038,0.0385385,0.0022629458,0.117902555,0.6293149,0.027900994],"study_design_scores_gemma":[0.00073917105,0.000031348325,0.000556994,0.00009125421,0.000014294214,0.0000028903967,0.00038618373,0.8447101,0.00631013,0.016008645,0.13062806,0.0005208991],"about_ca_topic_score_codex":0.00020471321,"about_ca_topic_score_gemma":0.00003766971,"teacher_disagreement_score":0.8061716,"about_ca_system_score_codex":0.00021050886,"about_ca_system_score_gemma":0.00006753197,"threshold_uncertainty_score":0.9998827},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0074016298531846,"score_gpt":0.2359610088897392,"score_spread":0.2285593790365546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024893480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016406033,0.000008173787,0.9769825,0.00079712545,0.00020147998,0.00061963004,0.000010445185,0.0005896848,0.0043849642],"genre_scores_gemma":[0.85755724,0.000007833577,0.14156282,0.00048184337,0.000028896002,0.00027445244,0.00005543444,0.000004168504,0.000027292366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991113,0.00002249169,0.00031781316,0.00012946794,0.00016848338,0.00025046937],"domain_scores_gemma":[0.999081,0.00004656454,0.0001526271,0.0003871795,0.0002721065,0.000060497056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739094,0.00011156994,0.00010356081,0.00014414803,0.00021705238,0.00047061482,0.00049239583,0.00006963194,0.000025279289],"category_scores_gemma":[0.000032935528,0.000099543155,0.00007409085,0.00021084619,0.000035574616,0.0082505625,0.00012002038,0.00008836708,0.00013458844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004122916,0.00025332702,0.001195783,0.00074832636,0.000078695244,0.0000014629658,0.044833314,0.00005884947,0.008846892,0.57737756,0.09651151,0.27005306],"study_design_scores_gemma":[0.0006176155,0.00009805908,0.002408232,0.000058121648,0.00000826802,0.0000144567675,0.00013287536,0.23298264,0.078504905,0.4985931,0.1860657,0.00051603734],"about_ca_topic_score_codex":0.000022091139,"about_ca_topic_score_gemma":4.42363e-7,"teacher_disagreement_score":0.84115124,"about_ca_system_score_codex":0.00002635953,"about_ca_system_score_gemma":0.000014804976,"threshold_uncertainty_score":0.59814584},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Theoretical computer science","score_opus":0.012081549980065179,"score_gpt":0.2749816545045415,"score_spread":0.2629001045244763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027614277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24106532,0.00013539515,0.7273214,0.0009722683,0.001163713,0.0041187247,0.00003646926,0.0012990538,0.023887662],"genre_scores_gemma":[0.9501963,0.00002293574,0.0485194,0.0005816109,0.00003955678,0.00049004063,0.0001464318,0.0000028592494,8.6936114e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998264,0.000069370784,0.00042853158,0.00018010921,0.0007997709,0.000258215],"domain_scores_gemma":[0.99833417,0.000081049606,0.00017535605,0.00068031007,0.0005965,0.0001326054],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082378776,0.00013723588,0.00011782993,0.0002269302,0.0001784088,0.0008926995,0.0006739014,0.000102377926,0.00029128004],"category_scores_gemma":[0.0001638706,0.00012388227,0.000084232015,0.0007533882,0.000036955473,0.010874369,0.00022509595,0.00016397068,0.0014432097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041960425,0.00011383041,0.0002816449,0.000015924528,0.0000076074,2.1368257e-7,0.0028588546,0.00002692636,0.0000047335866,0.08977852,0.029743768,0.87716377],"study_design_scores_gemma":[0.0010107275,0.00018049068,0.02932376,0.000028162856,0.000011265129,0.000019435269,0.00020105237,0.48603818,0.00022261086,0.29933244,0.18323475,0.00039712092],"about_ca_topic_score_codex":0.00012393095,"about_ca_topic_score_gemma":0.000019099507,"teacher_disagreement_score":0.8767667,"about_ca_system_score_codex":0.000045963487,"about_ca_system_score_gemma":0.000072531075,"threshold_uncertainty_score":0.9993343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Peer-to-peer; Internet privacy; Social network (sociolinguistics); Architecture; Computer network; Computer security; World Wide Web; Social media; Geography","score_opus":0.017336722272956556,"score_gpt":0.2641272520833707,"score_spread":0.24679052981041413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040896821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17159341,0.00002890643,0.69469774,0.12476309,0.00024571051,0.001307506,0.00012537061,0.0015599261,0.0056783324],"genre_scores_gemma":[0.9284384,0.0000027281728,0.06880102,0.0022119768,0.00018454828,0.000051606876,0.00025926295,0.000009061394,0.000041372365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976016,0.00019591089,0.00046026165,0.00038638758,0.00088136754,0.00047445102],"domain_scores_gemma":[0.9969931,0.00015932349,0.00025982768,0.0018559205,0.0006085074,0.00012332555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628014,0.00023960178,0.0003034576,0.00013916106,0.0007226393,0.00064530154,0.003080864,0.00020448843,0.000007355866],"category_scores_gemma":[0.0006478708,0.00021501676,0.000033415,0.00093855883,0.0001592723,0.0023055435,0.003401892,0.0005251039,0.000076019795],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018482644,0.00010486515,0.0026168674,0.00012310312,0.000080044534,8.8265165e-7,0.07185273,0.0019018232,0.000009744973,0.0847718,0.63929856,0.19905476],"study_design_scores_gemma":[0.0009109284,0.0001742627,0.03535484,0.000038268547,0.000022126336,0.000018132117,0.0003427206,0.052473225,0.00004365727,0.03831629,0.87168163,0.0006239286],"about_ca_topic_score_codex":0.000065742584,"about_ca_topic_score_gemma":0.00020674348,"teacher_disagreement_score":0.756845,"about_ca_system_score_codex":0.00008594743,"about_ca_system_score_gemma":0.000086974855,"threshold_uncertainty_score":0.87681293},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.010240708386570511,"score_gpt":0.2508163790439364,"score_spread":0.24057567065736588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047892990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7328926,0.000031818963,0.26096955,0.00049730274,0.0005284542,0.00097414176,0.0005293473,0.0023417398,0.001235054],"genre_scores_gemma":[0.9942185,0.00006088249,0.0034019207,0.00012860367,0.00010772286,0.00028759305,0.0017613822,0.00002793297,0.000005454517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.000033323766,0.0004933699,0.00012260325,0.00024032983,0.00030232684],"domain_scores_gemma":[0.9985018,0.00017463537,0.0001584153,0.0007105228,0.00033913972,0.000115486866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030925183,0.00022467504,0.00024603828,0.00010509188,0.00016306477,0.00017804353,0.00040006262,0.0002559203,0.000021292139],"category_scores_gemma":[0.00007543584,0.00024213204,0.00012875079,0.00030719533,0.0000760343,0.0012414843,0.00006757912,0.00056313665,0.000054084907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005178331,0.0019174608,0.0009058692,0.0025352526,0.0008249216,0.0000030747817,0.06936056,0.016915787,0.15111832,0.24032511,0.17754692,0.33802888],"study_design_scores_gemma":[0.0005864034,0.000029361661,0.0015697392,0.000023691462,0.000029873841,0.000007942944,0.00019459311,0.8496772,0.018108318,0.0013675756,0.12799928,0.0004060313],"about_ca_topic_score_codex":0.0000048178154,"about_ca_topic_score_gemma":0.00002826065,"teacher_disagreement_score":0.8327614,"about_ca_system_score_codex":0.000067841895,"about_ca_system_score_gemma":0.000021468593,"threshold_uncertainty_score":0.9873858},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.03660453717168044,"score_gpt":0.29192701355943573,"score_spread":0.2553224763877553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055602530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35783374,0.000077323166,0.5851319,0.0070739356,0.0016419259,0.00075610424,0.00022403656,0.00084375194,0.04641731],"genre_scores_gemma":[0.9932159,0.0000149452035,0.0054184925,0.0011944758,0.000040225124,0.000019521318,0.000078791556,0.0000031083794,0.000014547689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985677,0.000054285665,0.00046012324,0.00013755646,0.0004959411,0.0002844056],"domain_scores_gemma":[0.99874675,0.00003200538,0.00017281776,0.00046006264,0.00038352687,0.0002048096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584854,0.00013553741,0.0001383451,0.00013670613,0.0001425484,0.00038936245,0.0005276758,0.00006847919,0.000051004256],"category_scores_gemma":[0.00006656841,0.00012902278,0.00006285892,0.0005777208,0.000051790066,0.0035919135,0.00019184574,0.00014730047,0.00023943887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001464045,0.00009174881,0.0028993401,0.000025577221,0.00002669853,0.000005039083,0.04004716,0.000034359386,0.0000065181534,0.8815463,0.057051215,0.018251395],"study_design_scores_gemma":[0.0033934817,0.000271742,0.0028232855,0.00002322299,0.000017000406,0.000113351,0.008134263,0.04623086,0.0007887217,0.135599,0.8018355,0.0007695734],"about_ca_topic_score_codex":0.00021230684,"about_ca_topic_score_gemma":0.00006363461,"teacher_disagreement_score":0.7459473,"about_ca_system_score_codex":0.0000594092,"about_ca_system_score_gemma":0.00014801604,"threshold_uncertainty_score":0.5261396},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035369336050500855,"score_gpt":0.2419125381930435,"score_spread":0.20654320214254265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058559153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7902042,0.00002058781,0.16637073,0.0017646933,0.00035791725,0.00076135993,0.0000408081,0.00014806387,0.040331624],"genre_scores_gemma":[0.9978175,0.000013936298,0.0016504056,0.00048374216,0.0000072398025,0.00001560813,0.0000056630834,0.0000015898597,0.0000042822776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00004683534,0.00028815473,0.00008448511,0.00021804903,0.00013017842],"domain_scores_gemma":[0.9992624,0.00011491319,0.00015551063,0.00030750054,0.00011890133,0.00004075537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005116233,0.00008178917,0.00008699393,0.00010343794,0.00017316612,0.000090740454,0.0003202817,0.000033509474,0.00008072751],"category_scores_gemma":[0.00009708823,0.000046424386,0.000039175527,0.0002948729,0.00004727142,0.0013464813,0.00012508109,0.00010277124,0.00001675796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008242407,0.000037617625,0.00090545486,0.00001979639,0.000010407018,2.1821839e-7,0.03750214,7.294708e-7,0.000008711371,0.94535404,0.0020549987,0.014097655],"study_design_scores_gemma":[0.0036278875,0.0015721795,0.1348335,0.00037367662,0.000057566212,0.00011073638,0.018403765,0.11465612,0.045104194,0.6041934,0.07551683,0.0015501773],"about_ca_topic_score_codex":0.00018785965,"about_ca_topic_score_gemma":0.000021496055,"teacher_disagreement_score":0.34116066,"about_ca_system_score_codex":0.000009300175,"about_ca_system_score_gemma":0.000028132803,"threshold_uncertainty_score":0.18931314},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018611614816251537,"score_gpt":0.25277974296869793,"score_spread":0.2341681281524464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084450010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17092682,0.00006938436,0.78903925,0.031034244,0.002165112,0.0007622863,0.000011648243,0.0016763539,0.0043149004],"genre_scores_gemma":[0.9802959,0.0000100701,0.010582857,0.008753701,0.00025483363,0.000062084684,0.000011228066,0.000006950588,0.000022391347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981066,0.00007203969,0.00045132026,0.00022659163,0.00056289014,0.00058055844],"domain_scores_gemma":[0.9981953,0.00012031653,0.0002576547,0.0010618375,0.00021848358,0.00014643162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093859225,0.00020822573,0.00020144826,0.000156893,0.0002932311,0.0005894129,0.0019519369,0.00012289116,0.000006095474],"category_scores_gemma":[0.00029289728,0.00016194237,0.00007103714,0.0009363435,0.00003565215,0.0016752108,0.0011831134,0.0003266912,0.00058031],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025685884,0.000057656773,0.009094306,0.0000610232,0.00006288216,0.0000047966305,0.025523413,0.06640469,0.000014208595,0.1437608,0.3615576,0.39343292],"study_design_scores_gemma":[0.00021423005,0.00008479529,0.020924678,0.00005385134,0.000006389658,0.000017432798,0.00022582104,0.15400733,0.00018948363,0.0063977074,0.8175228,0.00035547337],"about_ca_topic_score_codex":0.000058331774,"about_ca_topic_score_gemma":0.00009034721,"teacher_disagreement_score":0.809369,"about_ca_system_score_codex":0.000107252374,"about_ca_system_score_gemma":0.00003137226,"threshold_uncertainty_score":0.74589044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00738755192662981,"score_gpt":0.25158646497453424,"score_spread":0.24419891304790442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110453585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1091543,0.0000019251816,0.8767376,0.0012011682,0.00015400304,0.00030093055,0.000049186772,0.00020610924,0.012194798],"genre_scores_gemma":[0.9828273,0.0000013423803,0.01331497,0.0036508692,0.000029174887,0.000028229604,0.00014099832,0.0000038305043,0.0000032837602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984202,0.000045953217,0.0005337011,0.00022769049,0.00045419316,0.00031825755],"domain_scores_gemma":[0.9986055,0.00007012611,0.00019627518,0.0007874542,0.00014441262,0.0001962503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006676969,0.00016314232,0.00023260101,0.0005724206,0.00022633547,0.00047308905,0.0006574523,0.000066855544,0.00013111168],"category_scores_gemma":[0.00004596078,0.00016184215,0.00016002072,0.0021686193,0.000031367286,0.0014453613,0.00022434776,0.00012868742,0.00030611872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048070327,0.00016921248,0.005088793,0.000057259407,0.00034268768,8.339861e-7,0.058600117,0.0034247811,0.000022794087,0.894945,0.02178413,0.0155163165],"study_design_scores_gemma":[0.0015816875,0.00026582522,0.07966461,0.0000075631756,0.00012612806,0.0000035192618,0.0013732364,0.16426808,0.0003314197,0.025873447,0.7255152,0.000989302],"about_ca_topic_score_codex":0.000120079705,"about_ca_topic_score_gemma":0.00015841416,"teacher_disagreement_score":0.873673,"about_ca_system_score_codex":0.00003793832,"about_ca_system_score_gemma":0.000031526735,"threshold_uncertainty_score":0.65997314},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0320106358000154,"score_gpt":0.2931915448677675,"score_spread":0.2611809090677521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139586753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97805685,0.000013450822,0.010410431,0.009049755,0.0003791032,0.00023672427,0.000023479593,0.0001837014,0.0016464933],"genre_scores_gemma":[0.98049986,0.000008925933,0.019119471,0.00032581433,0.000009952354,0.000023105613,0.000010509312,0.0000016834687,6.435602e-7],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987521,0.000059854538,0.0004244193,0.00011701992,0.00038519682,0.0002614173],"domain_scores_gemma":[0.9956897,0.0002452337,0.00022643743,0.0037090234,0.000099259334,0.000030341726],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012230806,0.00008686409,0.00011020955,0.00012643462,0.000060199654,0.00013580038,0.01277341,0.00009955874,0.000010863],"category_scores_gemma":[0.013304492,0.000066393055,0.000023088047,0.00055999367,0.00009833244,0.0026536642,0.008935207,0.00032972515,0.000029303777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028373632,0.00053387356,0.1225338,0.0004084663,0.000050166956,0.000033440352,0.11039958,0.000175749,0.0028150552,0.2676865,0.4173536,0.077981405],"study_design_scores_gemma":[0.0012209687,0.0001650711,0.10441487,0.0001474211,0.000010907809,0.00009558035,0.002451355,0.47251981,0.041516032,0.34156737,0.035198193,0.0006924025],"about_ca_topic_score_codex":0.00014849662,"about_ca_topic_score_gemma":0.0000967235,"teacher_disagreement_score":0.47234407,"about_ca_system_score_codex":0.000014914253,"about_ca_system_score_gemma":0.00004776923,"threshold_uncertainty_score":0.99908036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020070045590794117,"score_gpt":0.2727877927613299,"score_spread":0.2527177471705358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800140107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61265373,0.0000024601152,0.34175533,0.0005821072,0.00057688536,0.00067642384,0.000056999288,0.00039814087,0.04329791],"genre_scores_gemma":[0.99835795,5.131317e-7,0.00050611625,0.0010468136,0.000046543966,0.000015716696,0.000022533473,0.000002688859,0.0000011182533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984331,0.00006961945,0.0005274174,0.00014656555,0.00059849606,0.00022476393],"domain_scores_gemma":[0.99820465,0.00010385048,0.00032690074,0.000721165,0.0005338828,0.000109549794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204546,0.00015109811,0.00019344798,0.0002327053,0.00013276705,0.00012854724,0.0005924802,0.00007116733,0.00004491452],"category_scores_gemma":[0.00019178579,0.00013333597,0.00013446476,0.0007793449,0.00018784194,0.002487295,0.000071905706,0.00014849161,0.00036056756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003944958,0.0003866074,0.00072340766,0.00019934651,0.000009637393,2.1925163e-7,0.011210779,0.00023325508,0.000041728716,0.97608364,0.0025111302,0.008560829],"study_design_scores_gemma":[0.0007095443,0.00055328204,0.008406452,0.00003359335,0.000004739466,0.0000019902286,0.00010707055,0.93954784,0.0023772996,0.04439787,0.0036419404,0.0002183877],"about_ca_topic_score_codex":0.000010861591,"about_ca_topic_score_gemma":0.0000027399599,"teacher_disagreement_score":0.9393146,"about_ca_system_score_codex":0.000045820347,"about_ca_system_score_gemma":0.000121862,"threshold_uncertainty_score":0.5437283},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007333392382511736,"score_gpt":0.2300969670906782,"score_spread":0.22276357470816646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984654445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23023286,0.00002134596,0.7656781,0.0018591816,0.00056728773,0.0005210643,0.000009449303,0.00009553964,0.0010151351],"genre_scores_gemma":[0.98803335,0.0000027501485,0.010476547,0.0013200169,0.00008252623,0.000027734563,0.000021193262,0.0000022099698,0.000033680815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994221,0.000008956586,0.00021995441,0.0001040974,0.0000889265,0.00015601609],"domain_scores_gemma":[0.9994186,0.0002041049,0.00011045028,0.00013026997,0.00009218423,0.000044370903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029830274,0.000073542884,0.00009709701,0.00006161683,0.00011711757,0.00023120624,0.00016610537,0.000070312,0.0000043149444],"category_scores_gemma":[0.000076911514,0.000071435825,0.00004655856,0.0000883948,0.000008004015,0.0017790378,0.000072116156,0.000063270425,0.000012265251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008580008,0.000042439864,0.0009660525,0.00071849476,0.00003699206,1.8450841e-7,0.037853915,0.0007419054,0.00016589274,0.33066332,0.011933058,0.6167919],"study_design_scores_gemma":[0.0013214748,0.00016900437,0.0012797853,0.000033093624,0.00000472238,0.0000058758774,0.0002065346,0.8950502,0.0015172197,0.04911495,0.051061038,0.00023608198],"about_ca_topic_score_codex":0.000012158225,"about_ca_topic_score_gemma":0.0000027645353,"teacher_disagreement_score":0.8943083,"about_ca_system_score_codex":0.000013829111,"about_ca_system_score_gemma":0.00003400733,"threshold_uncertainty_score":0.29130682},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015013063895619053,"score_gpt":0.3194926864870275,"score_spread":0.3044796225914084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285088927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49890158,0.00022743289,0.0009542199,0.028819667,0.002028816,0.0022541399,0.00058436545,0.0001971628,0.46603262],"genre_scores_gemma":[0.9988699,0.000017858516,0.0000036125925,0.0008852032,0.000057213554,0.000090193804,0.000013414817,0.0000018088422,0.00006081773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983989,0.00032125748,0.00038681092,0.00006659534,0.00062566926,0.00020078316],"domain_scores_gemma":[0.99889165,0.00033314066,0.00030709538,0.00018869863,0.000218385,0.00006103773],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022937574,0.000062696156,0.00012738672,0.000034450448,0.001680867,0.0002706171,0.0008175212,0.00003491461,0.0006541233],"category_scores_gemma":[0.00048471586,0.00004843319,0.00007399741,0.00030212814,0.00023584193,0.0022395698,0.00019978064,0.00017741004,0.000020829362],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046381002,0.00018846108,0.0328721,0.0000532091,0.000078795354,8.453725e-7,0.059912052,0.0005663813,0.00000527513,0.8365896,0.020559208,0.048710305],"study_design_scores_gemma":[0.0009871309,0.00003939813,0.025997302,0.0000020841032,0.000014082623,6.564853e-7,0.009367545,0.0017832852,0.00002856868,0.021384504,0.9402717,0.00012376199],"about_ca_topic_score_codex":0.003967749,"about_ca_topic_score_gemma":0.0009871991,"teacher_disagreement_score":0.9197125,"about_ca_system_score_codex":0.00009383061,"about_ca_system_score_gemma":0.00022968114,"threshold_uncertainty_score":0.9996188},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014448008385103567,"score_gpt":0.24499480604170545,"score_spread":0.23054679765660188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399475881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7720131,0.0028896048,0.14931135,0.007620213,0.005571778,0.0014796812,0.00007996209,0.0035856313,0.057448655],"genre_scores_gemma":[0.99765754,0.00010803347,0.0008508983,0.0011306963,0.00013137804,0.0000497231,0.000042477375,0.000009426701,0.000019857749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805856,0.00004279891,0.0006449357,0.0002998606,0.0004996992,0.00045417328],"domain_scores_gemma":[0.9989875,0.00012209335,0.00010124915,0.0006143852,0.00007294803,0.000101832666],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074432517,0.00021620275,0.00021718127,0.00033554866,0.00010340479,0.0012963831,0.00088363385,0.00017231237,0.000042308628],"category_scores_gemma":[0.000047031615,0.00021578485,0.0000951051,0.00064534124,0.00005474777,0.0063429666,0.00043585827,0.00054609746,0.00035373133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018432009,0.00007499638,0.0030263513,0.00035981182,0.000037014852,0.000055534085,0.10834461,0.0036408862,0.000015593077,0.853596,0.011894293,0.018936532],"study_design_scores_gemma":[0.00026919603,0.000038694234,0.0010274677,0.00021702136,0.000004000396,0.000028246728,0.0005564974,0.90553814,0.00021035828,0.039092008,0.052691035,0.0003273547],"about_ca_topic_score_codex":0.00014414052,"about_ca_topic_score_gemma":0.00021640125,"teacher_disagreement_score":0.90189725,"about_ca_system_score_codex":0.00014938004,"about_ca_system_score_gemma":0.000043242228,"threshold_uncertainty_score":0.99974036},"labels":[],"label_agreement":null}]}