{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072404705,0.000622463,0.895031,0.0004420689,0.00020855984,0.0006960954,0.00024210538,0.021990573,0.008362471],"genre_scores_gemma":[0.8835116,0.00027521548,0.10964823,0.00035059015,0.0000899995,0.00021588236,0.00035614136,0.00020401647,0.0053481613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989109,0.00014760635,0.00011116471,0.00021549102,0.00037280584,0.00024195977],"domain_scores_gemma":[0.9987299,0.00015636986,0.00017275274,0.00037371714,0.0003325066,0.00023477794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011020157,0.0004901969,0.00051152334,0.00096004055,0.0010158616,0.0028287515,0.0014769566,0.0007495779,0.0021275168],"category_scores_gemma":[0.0014577453,0.00030694314,0.0005584672,0.00064580864,0.00094627205,0.002187195,0.0020228983,0.0011721088,0.00066928286],"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.0032462587,0.0011532316,0.01738561,0.00081868994,0.00045341067,0.0016680389,0.0018890636,0.08204406,0.18992455,0.20877986,0.034916546,0.45772082],"study_design_scores_gemma":[0.00019641627,0.00045761798,0.0030555953,0.00008316186,0.00018009462,0.0007035004,0.00016830025,0.8461984,0.066425204,0.016297229,0.06603707,0.00019734907],"about_ca_topic_score_codex":0.008379502,"about_ca_topic_score_gemma":0.003805532,"teacher_disagreement_score":0.008379502,"about_ca_system_score_codex":0.0013395981,"about_ca_system_score_gemma":0.0018644477,"threshold_uncertainty_score":0.016661406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0244798,0.00063753634,0.9647118,0.00020354481,0.00019807645,0.00015679347,0.00002610447,0.0006413425,0.008944952],"genre_scores_gemma":[0.32280433,0.00097296934,0.66736376,0.0002952245,0.0003075003,0.0002004023,0.00017918981,0.00023038563,0.007646267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00016081677,0.000089612215,0.00016528659,0.00024316511,0.000086825814],"domain_scores_gemma":[0.9992588,0.0001994006,0.00006797528,0.00034118714,0.00010822299,0.000024232433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081482343,0.000969237,0.00064619863,0.0010596698,0.0005774455,0.0012042159,0.0010576104,0.0008157421,0.0038485683],"category_scores_gemma":[0.0020091801,0.00036162988,0.00097506883,0.0008993547,0.0009534949,0.0034918694,0.0014042879,0.0019225175,0.0012699733],"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.0006109782,0.0001627872,0.00097629015,0.0005440871,0.000103819206,0.0005359321,0.0005882263,0.021515992,0.11605246,0.49678183,0.0033638468,0.3587638],"study_design_scores_gemma":[0.0002410884,0.0012847502,0.0012773052,0.00026685087,0.00022074139,0.0037139312,0.00017699538,0.292417,0.24082448,0.30015406,0.15920167,0.00022114637],"about_ca_topic_score_codex":0.0001976622,"about_ca_topic_score_gemma":0.0003097476,"teacher_disagreement_score":0.0038485683,"about_ca_system_score_codex":0.0004965989,"about_ca_system_score_gemma":0.00043345857,"threshold_uncertainty_score":0.012874782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024014734,0.00020219357,0.9725653,0.00013540602,0.00005807324,0.000115340976,0.00002820039,0.0003938393,0.0024869223],"genre_scores_gemma":[0.8165838,0.00029085952,0.1770861,0.000091734735,0.0000785309,0.0002379157,0.00009700297,0.000063626416,0.005470363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974769,0.0008719712,0.00013316867,0.0003068892,0.00090227457,0.00030880544],"domain_scores_gemma":[0.9953431,0.0024905938,0.00037703893,0.0011356289,0.00047718946,0.00017642276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024011324,0.0005107258,0.0009198981,0.00073918013,0.0009678496,0.002044413,0.0023958634,0.0012217078,0.0024454307],"category_scores_gemma":[0.0043289815,0.00040357633,0.0007825792,0.00078559364,0.0030086352,0.0040915734,0.0029661648,0.0013671825,0.00074592023],"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.00083705795,0.00014242508,0.0006308649,0.00020072826,0.000108089764,0.00053625484,0.00057868677,0.08507402,0.02860419,0.83190876,0.0016379401,0.04974095],"study_design_scores_gemma":[0.00014490639,0.00029774645,0.00022973033,0.000028427829,0.000055924436,0.000385158,0.000089359164,0.82607955,0.023332288,0.14318681,0.0060767876,0.000093316754],"about_ca_topic_score_codex":0.00042815253,"about_ca_topic_score_gemma":0.00034210226,"teacher_disagreement_score":0.0024454307,"about_ca_system_score_codex":0.0009527844,"about_ca_system_score_gemma":0.0010327293,"threshold_uncertainty_score":0.012698531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034274735,0.0007863415,0.93604577,0.0026658708,0.00050296774,0.00022517526,0.00018165473,0.0019871364,0.023330426],"genre_scores_gemma":[0.78154325,0.00064768136,0.19699833,0.0009282055,0.0002492737,0.0001937382,0.00031763598,0.00013255705,0.018989244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919266,0.0002710849,0.00006132981,0.000070744245,0.00032045774,0.000083803774],"domain_scores_gemma":[0.99758875,0.000666507,0.00021114621,0.00094445155,0.0004862635,0.00010280801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012903928,0.0003575457,0.0003202064,0.0003079488,0.0006983558,0.0008641293,0.0010331229,0.0007026895,0.0055549485],"category_scores_gemma":[0.0031988488,0.00021530263,0.00020721937,0.00043375284,0.0008328679,0.002179041,0.0013967195,0.0010420191,0.00207014],"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.0007738272,0.000079832906,0.0007750007,0.00033661464,0.000038889084,0.00035574127,0.00023557278,0.015083579,0.048770186,0.63064325,0.037443973,0.26546353],"study_design_scores_gemma":[0.00011390637,0.0005814196,0.00086958345,0.00008265459,0.00006076901,0.0010163257,0.000263044,0.49220607,0.11903777,0.26930353,0.11637798,0.000086950844],"about_ca_topic_score_codex":0.00047623023,"about_ca_topic_score_gemma":0.0007696141,"teacher_disagreement_score":0.0055549485,"about_ca_system_score_codex":0.00057724875,"about_ca_system_score_gemma":0.0005887067,"threshold_uncertainty_score":0.018583119},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053668134,0.00033914635,0.92300093,0.0014408272,0.00021172132,0.00036032838,0.0003457708,0.00086563476,0.019767528],"genre_scores_gemma":[0.880071,0.00027137887,0.10172136,0.0002971667,0.00014730908,0.00034070495,0.00024932856,0.000050803555,0.01685099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953969,0.0013606972,0.00032278147,0.0005751003,0.0015928603,0.00075158133],"domain_scores_gemma":[0.9953122,0.0011055606,0.0006819266,0.0018984183,0.00061583763,0.0003861458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024477525,0.0006570485,0.001058384,0.0007650823,0.0016928932,0.0021255529,0.0019072699,0.0017040166,0.004843028],"category_scores_gemma":[0.005147993,0.0004164774,0.0008971137,0.0012122893,0.002374146,0.0040927376,0.0058348277,0.0020744938,0.001859078],"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.00034224775,0.00011871613,0.0004758891,0.00015869905,0.00006124565,0.00034037174,0.00079107523,0.024144858,0.012600044,0.90437907,0.003991666,0.052596036],"study_design_scores_gemma":[0.00027741215,0.0004661626,0.0005752361,0.00011112954,0.00013314655,0.0012877411,0.00021041092,0.33039716,0.020737505,0.57979566,0.06579685,0.00021158947],"about_ca_topic_score_codex":0.000513574,"about_ca_topic_score_gemma":0.00044766712,"teacher_disagreement_score":0.004843028,"about_ca_system_score_codex":0.0015400252,"about_ca_system_score_gemma":0.0024536208,"threshold_uncertainty_score":0.016201556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40662536,0.00057117565,0.58524996,0.00029612344,0.000114851435,0.00007834556,0.00026604522,0.0037281686,0.0030699456],"genre_scores_gemma":[0.92050815,0.00013677219,0.07736647,0.00005534476,0.000043984364,0.000031025942,0.00036627796,0.000036145924,0.0014558428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990978,0.00017098815,0.0000492413,0.00020057721,0.00036812347,0.00011333207],"domain_scores_gemma":[0.99818784,0.00071321503,0.00014815957,0.00030489796,0.00058820244,0.000057697933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012209284,0.00090050674,0.0011474747,0.0016736041,0.000557854,0.00085394393,0.00073690276,0.0007682911,0.0004511431],"category_scores_gemma":[0.0031464845,0.00035034388,0.000734716,0.00074137485,0.00019945527,0.0013521932,0.0008561719,0.0009768459,0.0004454326],"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.00026502766,0.00037343733,0.02691609,0.000047338228,0.00029609256,0.00025481847,0.00012794566,0.28762412,0.022284005,0.00094064465,0.0029630319,0.65790737],"study_design_scores_gemma":[0.0000019830748,0.00003881293,0.0017519244,0.0000029142614,0.000015116012,0.000059980128,0.000010639186,0.9939685,0.0035488114,0.00035279855,0.00024063316,0.000007921171],"about_ca_topic_score_codex":0.0035635384,"about_ca_topic_score_gemma":0.0051608104,"teacher_disagreement_score":0.0035635384,"about_ca_system_score_codex":0.0004215938,"about_ca_system_score_gemma":0.00046616257,"threshold_uncertainty_score":0.0070856214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020506736,0.0007999271,0.9758361,0.00013489401,0.000051378232,0.00006186981,0.000028090995,0.0002770539,0.0023040108],"genre_scores_gemma":[0.7765878,0.0009057043,0.22000307,0.00012706452,0.00007280061,0.00010280739,0.00007793491,0.000056678367,0.00206608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981805,0.00065217656,0.00009732088,0.00025686156,0.00060584315,0.00020731652],"domain_scores_gemma":[0.99551386,0.0027357212,0.00050111517,0.0007172882,0.00042170996,0.00011016873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024107597,0.00075002125,0.0011138577,0.0012490264,0.0007601449,0.0016268432,0.0010162822,0.0009895976,0.0027547863],"category_scores_gemma":[0.007676009,0.0002843227,0.00074992405,0.0010573368,0.002268712,0.0025126655,0.001966421,0.0015092792,0.00048497692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008855613,0.00013997278,0.0010357166,0.00051593065,0.00020823108,0.00024073108,0.0004788224,0.3698254,0.044753287,0.29590905,0.002507289,0.28350008],"study_design_scores_gemma":[0.00004277027,0.0003011798,0.00038410386,0.00005994278,0.000042331725,0.000310871,0.00004800016,0.9297953,0.023315202,0.04286893,0.0027722947,0.000059074322],"about_ca_topic_score_codex":0.00036169935,"about_ca_topic_score_gemma":0.0002568406,"teacher_disagreement_score":0.0027547863,"about_ca_system_score_codex":0.0009889347,"about_ca_system_score_gemma":0.0008225533,"threshold_uncertainty_score":0.0127494335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013322607,0.010877008,0.95085627,0.00095153466,0.00042147635,0.00014989969,0.0001617959,0.002430931,0.020828465],"genre_scores_gemma":[0.5548368,0.012394904,0.403054,0.00038683545,0.00071699516,0.00021747214,0.00043781352,0.00016704202,0.027788095],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996587,0.00005012372,0.000014952216,0.000052284806,0.00019401668,0.000030031797],"domain_scores_gemma":[0.9996131,0.00013695467,0.00006010816,0.00009614375,0.000079918864,0.000013759884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032867887,0.00047252164,0.00034658733,0.0006880662,0.0003299957,0.00070068875,0.0004925043,0.00091074005,0.006336309],"category_scores_gemma":[0.0011451669,0.00018339229,0.00037282088,0.000814893,0.00059382024,0.001499263,0.0006231964,0.0008696425,0.0017909867],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023623863,0.00006947258,0.00030001983,0.0005078895,0.00006555982,0.0005016237,0.00015052862,0.04851046,0.18675847,0.16862488,0.017312063,0.5769629],"study_design_scores_gemma":[0.00009318088,0.00040976057,0.0010601387,0.00021931813,0.00006353269,0.0014635524,0.0000821971,0.6223255,0.0906603,0.14071524,0.14275295,0.00015438495],"about_ca_topic_score_codex":0.0005537194,"about_ca_topic_score_gemma":0.00046769594,"teacher_disagreement_score":0.006336309,"about_ca_system_score_codex":0.0004806476,"about_ca_system_score_gemma":0.00029301504,"threshold_uncertainty_score":0.021197021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017016536,0.00011907954,0.97519976,0.00062516093,0.000042022606,0.00026941174,0.00006990485,0.00049843366,0.0061596553],"genre_scores_gemma":[0.6263516,0.00029130702,0.3578091,0.0005324724,0.00008135701,0.0008777185,0.00030344032,0.00020892943,0.013543996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931536,0.0030948352,0.00031283058,0.0009796222,0.001543846,0.00091531675],"domain_scores_gemma":[0.988414,0.0073869075,0.00078493636,0.0023907826,0.00073121424,0.0002921463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047834893,0.0007419865,0.0010724349,0.0006754996,0.0010768449,0.0021574702,0.0031827453,0.0016100178,0.006088659],"category_scores_gemma":[0.014172958,0.0006425667,0.0011630651,0.0006797283,0.002683699,0.0062888023,0.0041597625,0.0034173378,0.0010081106],"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.00055898994,0.00031887775,0.00087740953,0.00033103995,0.00010209997,0.00016270358,0.0007195838,0.09571414,0.0068495744,0.80970955,0.0042771823,0.08037884],"study_design_scores_gemma":[0.00012656127,0.00018696407,0.00018481797,0.000047000725,0.00004502952,0.00016007999,0.00011489658,0.5646062,0.016578134,0.40609658,0.011811523,0.00004223972],"about_ca_topic_score_codex":0.000562027,"about_ca_topic_score_gemma":0.0005364615,"teacher_disagreement_score":0.006088659,"about_ca_system_score_codex":0.002242071,"about_ca_system_score_gemma":0.00242612,"threshold_uncertainty_score":0.02529782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048678674,0.0011468452,0.9207949,0.0017582979,0.0004112321,0.0010857418,0.00041794634,0.0059365486,0.019769786],"genre_scores_gemma":[0.6789363,0.0009624713,0.28848055,0.0005394556,0.00019100544,0.00081384013,0.0008492864,0.0002502088,0.028976828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986047,0.00038451367,0.00008713174,0.00038377946,0.0004321849,0.00010771335],"domain_scores_gemma":[0.9986179,0.00033522793,0.00012443666,0.0003711235,0.00035739472,0.00019401718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695432,0.00068331254,0.00079892174,0.0008126546,0.0021628293,0.0022060385,0.0026108974,0.001292908,0.0036851922],"category_scores_gemma":[0.0038444134,0.0004549651,0.0005964115,0.00092830573,0.001065533,0.0045150253,0.00405938,0.0011488075,0.0012859275],"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.0013838338,0.0007955166,0.005090675,0.0009717215,0.00038606196,0.0015596194,0.0019763517,0.17642091,0.041842867,0.3186366,0.045662686,0.40527326],"study_design_scores_gemma":[0.00011036855,0.0003909052,0.0010351267,0.000057517318,0.00010504037,0.0007983574,0.00039676751,0.7891644,0.008667171,0.09607961,0.10308634,0.00010835902],"about_ca_topic_score_codex":0.0045983796,"about_ca_topic_score_gemma":0.0047293273,"teacher_disagreement_score":0.0045983796,"about_ca_system_score_codex":0.0009762434,"about_ca_system_score_gemma":0.0021422755,"threshold_uncertainty_score":0.012328267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017661111,0.000790317,0.9774581,0.0002787069,0.00014749226,0.00006695565,0.00002540773,0.0006569427,0.0029149228],"genre_scores_gemma":[0.87876564,0.00072502927,0.1157595,0.000103237224,0.00013954229,0.00009197656,0.00007973371,0.000037539463,0.0042977175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992731,0.00027113775,0.00005302596,0.0000656715,0.00026638331,0.000070732334],"domain_scores_gemma":[0.9990859,0.0002690905,0.00013528617,0.00025466917,0.00021567084,0.00003932301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736729,0.00032038867,0.0003212411,0.00031974207,0.000488731,0.000760912,0.0009274159,0.00046574775,0.0011000506],"category_scores_gemma":[0.001926522,0.00016851966,0.00031592115,0.0003178401,0.00074344315,0.0018067636,0.00078429707,0.00082748604,0.00040870454],"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.0007619421,0.00020118034,0.0027113205,0.00080795574,0.00013508878,0.00070549827,0.00068074145,0.100169584,0.21170352,0.25717825,0.00993182,0.41501313],"study_design_scores_gemma":[0.00008454317,0.00070858526,0.0009479138,0.00006261666,0.00009831528,0.00072309235,0.00014549357,0.840977,0.0763674,0.041563023,0.03824967,0.00007236894],"about_ca_topic_score_codex":0.0004104954,"about_ca_topic_score_gemma":0.00045334533,"teacher_disagreement_score":0.0011000506,"about_ca_system_score_codex":0.00046644395,"about_ca_system_score_gemma":0.00067645084,"threshold_uncertainty_score":0.005678177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4466874,0.0035423497,0.42522502,0.00644629,0.0011903361,0.0003934233,0.00031695995,0.0075484808,0.10864981],"genre_scores_gemma":[0.9516287,0.00039341985,0.027844472,0.0007123892,0.00007572196,0.000044305594,0.00010388354,0.00029337837,0.018903803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982262,0.00044431168,0.000050385363,0.00019798079,0.00078155496,0.00029955935],"domain_scores_gemma":[0.998052,0.00073537254,0.00019083945,0.0006546217,0.0002466706,0.000120533696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590376,0.0005949181,0.0005767258,0.0005663262,0.0014172123,0.0014938669,0.0008548493,0.0014741754,0.0073866476],"category_scores_gemma":[0.0057510673,0.0003541734,0.00038147988,0.0004584005,0.0022238852,0.0035777078,0.002612235,0.0015411921,0.0020357613],"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.0043154676,0.0002798512,0.011639327,0.00050969963,0.00023162794,0.0043997895,0.005507915,0.025476757,0.06647991,0.578288,0.040051598,0.26282007],"study_design_scores_gemma":[0.0002970545,0.0018859078,0.0043105693,0.00040241904,0.00022972748,0.008748786,0.0023767364,0.26239774,0.20013492,0.20188336,0.31697696,0.00035584756],"about_ca_topic_score_codex":0.0009968019,"about_ca_topic_score_gemma":0.0011465898,"teacher_disagreement_score":0.0073866476,"about_ca_system_score_codex":0.00082366826,"about_ca_system_score_gemma":0.0006026223,"threshold_uncertainty_score":0.024710834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6127793,0.00081645354,0.33528632,0.00085387565,0.00013291434,0.00021383444,0.00024228424,0.0004774407,0.04919751],"genre_scores_gemma":[0.9805089,0.00024109345,0.016198797,0.00011545065,0.00005570177,0.000079321064,0.00013769147,0.000073179435,0.002589763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971934,0.00067870144,0.0002015427,0.00045896572,0.000985018,0.00048243123],"domain_scores_gemma":[0.9905578,0.0049556135,0.0012269004,0.002554421,0.00048095945,0.00022428465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019531604,0.00044326409,0.0006758486,0.0009851514,0.0009755828,0.0016705961,0.0005444395,0.0007600507,0.002881177],"category_scores_gemma":[0.012098168,0.00037336117,0.0009114397,0.00084848655,0.0040922672,0.0044707735,0.0020930485,0.0014846206,0.00048836286],"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.0013278899,0.00010862201,0.004767058,0.00018380037,0.000061022845,0.0008209974,0.001037373,0.028340407,0.024854405,0.899746,0.0017976494,0.036954764],"study_design_scores_gemma":[0.00015939056,0.0010404022,0.0044791186,0.0001611836,0.000102342725,0.0022237971,0.0005399636,0.21151705,0.06084436,0.7037134,0.015098983,0.00011995491],"about_ca_topic_score_codex":0.00072831725,"about_ca_topic_score_gemma":0.00041344436,"teacher_disagreement_score":0.002881177,"about_ca_system_score_codex":0.0007680704,"about_ca_system_score_gemma":0.0009760169,"threshold_uncertainty_score":0.010329366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92198455,0.0021629701,0.038339943,0.0014386951,0.00043834554,0.00040684998,0.0006883912,0.013071863,0.02146843],"genre_scores_gemma":[0.98847884,0.00030881076,0.0070208274,0.00031314392,0.000023041795,0.000055746128,0.0004130036,0.000180148,0.0032064894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.00034722174,0.00010607095,0.0001842062,0.00052065554,0.00031112516],"domain_scores_gemma":[0.995672,0.0014545005,0.00026742218,0.0018298533,0.00045170146,0.00032450425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014336066,0.0007421867,0.00085865636,0.00059441366,0.0012509563,0.0009957517,0.0009778608,0.0012686912,0.0022708662],"category_scores_gemma":[0.008550797,0.00041423793,0.00031310142,0.00050300226,0.0008064535,0.0042904075,0.003412711,0.0014419237,0.0010666162],"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.012111484,0.0016050234,0.10654686,0.0019765215,0.001407557,0.008145791,0.007009258,0.06733291,0.16521923,0.035435814,0.11138446,0.48182523],"study_design_scores_gemma":[0.0002593986,0.002200413,0.029904168,0.00026555703,0.00040887276,0.013794211,0.0030249737,0.6852976,0.15419321,0.011415979,0.09896448,0.00027113812],"about_ca_topic_score_codex":0.004440468,"about_ca_topic_score_gemma":0.0039432505,"teacher_disagreement_score":0.004440468,"about_ca_system_score_codex":0.00038313505,"about_ca_system_score_gemma":0.0006250702,"threshold_uncertainty_score":0.008829236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15320836,0.00033813386,0.8382742,0.00016485112,0.00007518318,0.00013863997,0.00011308257,0.0011392945,0.006548201],"genre_scores_gemma":[0.9276454,0.00028355693,0.068415,0.000053966058,0.000035455585,0.0000755028,0.000059381513,0.000076575445,0.0033552705],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.000069508234,0.0000221339,0.00006387047,0.00018487104,0.000022042123],"domain_scores_gemma":[0.9992537,0.0004443802,0.00008054651,0.00012220934,0.000090324895,0.000008927312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025336305,0.00069084496,0.0003831274,0.0006930537,0.00025063418,0.0004673523,0.0004950289,0.00033561065,0.0023930601],"category_scores_gemma":[0.0021013122,0.00025257148,0.00042642103,0.0004208008,0.0005594578,0.0008536405,0.0004611293,0.0004934328,0.0004320234],"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.0005863652,0.00013914608,0.0033799023,0.0005448753,0.00012983987,0.00077898643,0.00051578437,0.35248896,0.36228055,0.035210945,0.0012213989,0.24272332],"study_design_scores_gemma":[0.00002120968,0.00027519537,0.0015313402,0.000018883953,0.000023542827,0.00021052505,0.000034635133,0.9039947,0.08210084,0.009133849,0.002635607,0.000019600227],"about_ca_topic_score_codex":0.0007491983,"about_ca_topic_score_gemma":0.0006881695,"teacher_disagreement_score":0.0023930601,"about_ca_system_score_codex":0.0004734132,"about_ca_system_score_gemma":0.00030379283,"threshold_uncertainty_score":0.008005619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22489408,0.00018524173,0.7736651,0.0004088977,0.000021232468,0.00012680356,0.00012936792,0.00020724576,0.00036203637],"genre_scores_gemma":[0.7952571,0.00013873455,0.20376304,0.00006199252,0.000037825404,0.00011866414,0.00028330946,0.000015946907,0.0003235065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855666,0.006262951,0.0017156133,0.002652563,0.0031837982,0.00061849784],"domain_scores_gemma":[0.9197828,0.053200115,0.009661493,0.012740651,0.0037115011,0.00090332975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012138114,0.00073120923,0.0017001614,0.0024064174,0.0013692499,0.0028839714,0.0026372308,0.0021532737,0.0002077739],"category_scores_gemma":[0.049059473,0.0007939341,0.0013820253,0.0028081187,0.0015660938,0.004972193,0.002656721,0.0014788334,0.00016524813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027689806,0.00085532485,0.10191066,0.0005778659,0.0014699573,0.0055830646,0.003272073,0.4300957,0.03343526,0.06500667,0.0018818207,0.35314262],"study_design_scores_gemma":[0.00004914106,0.0001902185,0.0021098536,0.000027648755,0.00013848607,0.0012022798,0.00040792633,0.9455267,0.011875394,0.037583917,0.0008576326,0.00003087408],"about_ca_topic_score_codex":0.00058557367,"about_ca_topic_score_gemma":0.00051717804,"teacher_disagreement_score":0.012138114,"about_ca_system_score_codex":0.0007689939,"about_ca_system_score_gemma":0.0014932248,"threshold_uncertainty_score":0.06419325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35731617,0.003121145,0.54654455,0.0023719748,0.00022672742,0.00022196119,0.0003339738,0.00044712154,0.08941641],"genre_scores_gemma":[0.9824087,0.0003999343,0.015639264,0.00006300001,0.000043530967,0.00007551498,0.000045776516,0.00002664537,0.0012975604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557316,0.0016902699,0.00014827715,0.00041971105,0.0016913501,0.00047728792],"domain_scores_gemma":[0.99063665,0.0070847175,0.00040710095,0.0012663639,0.00048818506,0.0001169894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039531817,0.0005674238,0.0010017711,0.00079951546,0.0007315068,0.0032426002,0.0012933556,0.0020523847,0.0040915324],"category_scores_gemma":[0.012638264,0.0007586267,0.0010476665,0.0005421586,0.0043532914,0.003934407,0.0025782483,0.002032061,0.00047421464],"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.00056475675,0.00006229764,0.0005594453,0.00017930046,0.000050928786,0.000083878454,0.00010031836,0.18472588,0.006125059,0.7960115,0.0003839954,0.011152662],"study_design_scores_gemma":[0.00012702569,0.00026447716,0.0007381885,0.00007228311,0.00005174104,0.00020974597,0.000037137608,0.6803218,0.0075604278,0.30667064,0.0038810077,0.000065547676],"about_ca_topic_score_codex":0.00040975842,"about_ca_topic_score_gemma":0.00013169806,"teacher_disagreement_score":0.0040915324,"about_ca_system_score_codex":0.0017401212,"about_ca_system_score_gemma":0.0014230479,"threshold_uncertainty_score":0.020906687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33396986,0.0014213648,0.62205416,0.0018555365,0.00023499448,0.00021332697,0.00023945284,0.0007024881,0.039308812],"genre_scores_gemma":[0.83518213,0.00059582805,0.15469049,0.0003857302,0.0001515893,0.00015344143,0.00023171218,0.00016456713,0.008444356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990546,0.00025170896,0.00005539224,0.00019432225,0.00024938004,0.00019464774],"domain_scores_gemma":[0.99869823,0.00044863005,0.0001739677,0.0004676968,0.00010886454,0.000102662176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014877943,0.00050421554,0.00044336906,0.000856955,0.0008991054,0.0012723138,0.00053519383,0.0006032772,0.003991685],"category_scores_gemma":[0.0031417082,0.00031234085,0.000685413,0.00068760966,0.0019443256,0.00395955,0.0025844222,0.0018585338,0.0010835867],"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.0006974433,0.00013503713,0.002225924,0.00023639866,0.000028777618,0.0001723311,0.00040091135,0.009860335,0.048768174,0.8372742,0.0030241087,0.09717636],"study_design_scores_gemma":[0.00014920901,0.0005493484,0.0010089811,0.00013736842,0.000050314768,0.0005115141,0.00028241705,0.044122163,0.06023933,0.8656633,0.027174667,0.00011137193],"about_ca_topic_score_codex":0.00019635668,"about_ca_topic_score_gemma":0.0003164007,"teacher_disagreement_score":0.003991685,"about_ca_system_score_codex":0.00077297195,"about_ca_system_score_gemma":0.0006813032,"threshold_uncertainty_score":0.013353527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9569233,0.00043569488,0.028116819,0.0013709468,0.0001046374,0.00051178824,0.00028132243,0.0036578702,0.008597578],"genre_scores_gemma":[0.9837082,0.00017054981,0.012438022,0.00025057868,0.00002330716,0.00018093642,0.00025023957,0.0003880188,0.0025900614],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9544922,0.025911648,0.005191365,0.002389906,0.010730334,0.0012845632],"domain_scores_gemma":[0.6640256,0.25768244,0.013295682,0.03089042,0.031034878,0.0030710185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035678707,0.0006027604,0.0007291669,0.002436858,0.0020871696,0.0071301055,0.0024773297,0.0018014516,0.0050962535],"category_scores_gemma":[0.17082442,0.0008573034,0.00042933962,0.0014744378,0.0029611783,0.008739392,0.004309025,0.0015364791,0.0015611277],"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.0036883012,0.0019480081,0.13297972,0.0052081435,0.00019550014,0.0052243904,0.31498536,0.0028688957,0.055995304,0.017676607,0.017212344,0.4420175],"study_design_scores_gemma":[0.00058422756,0.008918722,0.18206495,0.0068202917,0.0006562073,0.010712801,0.30490693,0.04534659,0.09069545,0.025072826,0.32247183,0.0017492219],"about_ca_topic_score_codex":0.0038632315,"about_ca_topic_score_gemma":0.0025104831,"teacher_disagreement_score":0.035678707,"about_ca_system_score_codex":0.0019392385,"about_ca_system_score_gemma":0.002250893,"threshold_uncertainty_score":0.18868923},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024050528,0.00028251836,0.95071435,0.0016104872,0.00021054009,0.00044003528,0.00013337142,0.0010300677,0.021528129],"genre_scores_gemma":[0.6635406,0.0004403196,0.31582096,0.0008490418,0.00017936296,0.00075108116,0.0002193131,0.00016114234,0.018038195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967192,0.0009755246,0.00023465075,0.0005586748,0.0009846317,0.0005272613],"domain_scores_gemma":[0.99590296,0.0010261035,0.00042925886,0.0020250443,0.00036576908,0.00025077738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033433344,0.000535827,0.00077900855,0.0006937869,0.0017565315,0.0028578695,0.0021477675,0.00234107,0.008209736],"category_scores_gemma":[0.0068953633,0.00050881103,0.0014814467,0.0012880057,0.0044197924,0.010965606,0.006623109,0.0029417132,0.0023506584],"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.0002509462,0.000058322512,0.00042024622,0.00012633529,0.000025421285,0.00028595893,0.0004915899,0.007356524,0.005802222,0.9561478,0.0028703883,0.02616424],"study_design_scores_gemma":[0.00017329317,0.00035720656,0.00024515914,0.00007294777,0.000048286023,0.0011475731,0.0002345318,0.114487566,0.020041488,0.80036134,0.06274241,0.00008820798],"about_ca_topic_score_codex":0.0005917913,"about_ca_topic_score_gemma":0.0002883295,"teacher_disagreement_score":0.008209736,"about_ca_system_score_codex":0.0010713775,"about_ca_system_score_gemma":0.0016420409,"threshold_uncertainty_score":0.02746427},"labels":[],"label_agreement":null}]}