{"meta":{"query_hash":"e6b24fcc8106","filters":{"venue":"Security and Communication Networks"},"cohort_total":89,"direct_labels_cover":0,"predictions_cover":89,"exported":89,"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/e6b24fcc8106","api":"https://metacan.xera.ac/api/v1/cohort?venue=Security+and+Communication+Networks"},"results":[{"id":"W1482578722","doi":"10.1002/sec.1057","title":"Efficient self‐healing group key management with dynamic revocation and collusion resistance for SCADA in smart grid","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":34,"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":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Collusion; Revocation; Key management; Computer security; Computer network; Secrecy; Forward secrecy; Key (lock); Hash function; Communication in small groups; Group key; Distributed computing; Public-key cryptography; Cryptography; Encryption; Business; Operating system","score_opus":0.0022934296437011133,"score_gpt":0.18190771938207598,"score_spread":0.17961428973837487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482578722","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.2455901,0.00051891187,0.75105363,0.00030970928,0.00006478686,0.00010492273,0.000036271565,0.0007163217,0.0016053026],"genre_scores_gemma":[0.9832561,0.000046859623,0.0161665,0.000024628114,0.000014675521,0.000019848861,0.000017557464,0.000006400276,0.00044735303],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888295,0.00040661258,0.00010628651,0.00017173146,0.00030090756,0.00013149915],"domain_scores_gemma":[0.9977119,0.00043012676,0.000719682,0.0007742053,0.0002600415,0.000104052866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008820154,0.00026169882,0.0005247969,0.00044515435,0.0005525211,0.00058968185,0.0008492473,0.00047939137,0.0006695974],"category_scores_gemma":[0.0019196997,0.00016213715,0.00021903924,0.0004265375,0.00071040797,0.0016709475,0.00155625,0.00047717494,0.00024841027],"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.002326221,0.00033042987,0.008047964,0.0004483745,0.00028097254,0.0014249892,0.0014780733,0.26428002,0.23585227,0.07212405,0.004558026,0.40884858],"study_design_scores_gemma":[0.0001063813,0.0005811832,0.0010973127,0.000024795267,0.000052368978,0.0007403661,0.00022528526,0.92458844,0.04882074,0.019310994,0.004403592,0.000048537706],"about_ca_topic_score_codex":0.00024516744,"about_ca_topic_score_gemma":0.00021696607,"teacher_disagreement_score":0.0008820154,"about_ca_system_score_codex":0.00038103067,"about_ca_system_score_gemma":0.0004224076,"threshold_uncertainty_score":0.0046646},"labels":[],"label_agreement":null},{"id":"W1483299212","doi":"10.1002/sec.517","title":"Two‐factor mutual authentication with key agreement in wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":78,"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 Ottawa","funders":"","keywords":"Computer science; Mutual authentication; Wireless sensor network; Authentication protocol; Computer network; Authentication (law); Robustness (evolution); Hash function; Key (lock); Security analysis; Protocol (science); Key-agreement protocol; Forward secrecy; Computer security; Public-key cryptography; Key distribution; Encryption","score_opus":0.012871577176196301,"score_gpt":0.2390913624177317,"score_spread":0.2262197852415354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483299212","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.021049924,0.00082629814,0.97449094,0.000401691,0.0001143403,0.00024283669,0.000028608447,0.00033145119,0.002513964],"genre_scores_gemma":[0.8345642,0.0009020368,0.16071633,0.00013642768,0.00013981518,0.000559596,0.00008629565,0.00003616905,0.002859174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9885134,0.006408872,0.0006193487,0.0009564603,0.0029278542,0.0005739979],"domain_scores_gemma":[0.99192774,0.003976658,0.0012199411,0.0017686436,0.0009381459,0.00016876862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797626,0.00087880826,0.00109515,0.0011177985,0.0012371029,0.0017475836,0.0018549954,0.0021834092,0.001430737],"category_scores_gemma":[0.012454919,0.00062289124,0.0008083686,0.0017221081,0.003440889,0.0053698095,0.0039953873,0.0017285906,0.0004889577],"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.0014181953,0.00023945402,0.001975302,0.00085848256,0.00024027718,0.0010158716,0.0013099937,0.20828012,0.034872808,0.61219645,0.0045326324,0.13306043],"study_design_scores_gemma":[0.0002035606,0.00039994606,0.00032142637,0.00007197848,0.00005940675,0.00043924458,0.000092193666,0.79915535,0.014908352,0.17412832,0.0101270685,0.000093145565],"about_ca_topic_score_codex":0.0006268513,"about_ca_topic_score_gemma":0.00037953976,"teacher_disagreement_score":0.00797626,"about_ca_system_score_codex":0.0011676457,"about_ca_system_score_gemma":0.0013855927,"threshold_uncertainty_score":0.04218304},"labels":[],"label_agreement":null},{"id":"W1500765646","doi":"10.1002/sec.877","title":"Mechanisms to locate noncooperative transmitters in wireless networks based on residual signal strengths","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Transmitter; Computer science; Residual; Bounding overwatch; Position (finance); Algorithm; SIGNAL (programming language); Transmitter power output; Set (abstract data type); Wireless sensor network; Telecommunications; Mathematical optimization; Artificial intelligence; Computer network; Mathematics","score_opus":0.005577588613289634,"score_gpt":0.1969760233800704,"score_spread":0.19139843476678076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500765646","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.085518666,0.00043457097,0.91211265,0.00013105093,0.000035805468,0.000075975746,0.000011734188,0.0004599309,0.0012195228],"genre_scores_gemma":[0.89680845,0.00027415494,0.10162347,0.000056896795,0.000027060572,0.00007982892,0.000027494054,0.000036823298,0.0010659052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769235,0.00079813803,0.00012829548,0.0003002349,0.0008613675,0.00021966702],"domain_scores_gemma":[0.98757964,0.006084411,0.0027036462,0.0018057874,0.0014305214,0.00039607086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041513857,0.0011597268,0.0013977581,0.0014315335,0.0005508796,0.0012671117,0.0027169848,0.0011589024,0.0009057037],"category_scores_gemma":[0.014856869,0.0004881439,0.0004491591,0.0006508919,0.001852658,0.0029217603,0.003918278,0.0008830442,0.0004019356],"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.00061622425,0.0001665087,0.0050999187,0.00025031055,0.0001750505,0.00036998655,0.0004085995,0.75281405,0.047967773,0.043697935,0.0007180747,0.14771554],"study_design_scores_gemma":[0.000051244762,0.0004011531,0.00074311456,0.000025880254,0.00004813651,0.00027934313,0.000087701104,0.97052044,0.019844458,0.0072122496,0.0007483306,0.00003795783],"about_ca_topic_score_codex":0.0006677019,"about_ca_topic_score_gemma":0.0005833474,"teacher_disagreement_score":0.0041513857,"about_ca_system_score_codex":0.00080893224,"about_ca_system_score_gemma":0.0007256655,"threshold_uncertainty_score":0.021954894},"labels":[],"label_agreement":null},{"id":"W1506813957","doi":"10.1002/sec.1221","title":"A high capacity data hiding algorithm for H.264/AVC video","year":2015,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Algorithm; Information hiding; Embedding; Block (permutation group theory); Discrete cosine transform; Watermark; SIGNAL (programming language); Bitstream; Distortion (music); Real-time computing; Telecommunications; Artificial intelligence; Image (mathematics); Decoding methods; Bandwidth (computing); Mathematics","score_opus":0.0595975658301706,"score_gpt":0.28282413319622973,"score_spread":0.22322656736605914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506813957","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.039881404,0.00071372587,0.95563173,0.00015855063,0.000075921365,0.00011953838,0.000076222874,0.00096619286,0.002376719],"genre_scores_gemma":[0.2863666,0.0006759391,0.7029125,0.00010902027,0.00007374113,0.00010496601,0.000257664,0.00011074701,0.0093887905],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984753,0.000014706007,0.000009375365,0.000025753494,0.0000858304,0.000016778056],"domain_scores_gemma":[0.9998789,0.000026002625,0.000016253307,0.00001415079,0.000057579033,0.0000071824966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021607938,0.00039433816,0.00023336048,0.00071320613,0.0003194709,0.00023248591,0.00039659164,0.00046895078,0.0013421056],"category_scores_gemma":[0.00044869827,0.00017066843,0.0002639747,0.0003493407,0.00027860623,0.000473993,0.00029955435,0.00040902104,0.0005798731],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00020558051,0.0000591168,0.00023493911,0.0001736345,0.00003913923,0.00017724615,0.00011423045,0.017400887,0.5654754,0.0072358334,0.001953687,0.40693024],"study_design_scores_gemma":[0.000087972694,0.00035563356,0.0014778691,0.000037917063,0.000078307916,0.0010700943,0.000035966903,0.4674317,0.5074475,0.002779367,0.019106038,0.00009165186],"about_ca_topic_score_codex":0.0015076351,"about_ca_topic_score_gemma":0.0014749427,"teacher_disagreement_score":0.0015076351,"about_ca_system_score_codex":0.00026736525,"about_ca_system_score_gemma":0.00045042523,"threshold_uncertainty_score":0.004489839},"labels":[],"label_agreement":null},{"id":"W1511987983","doi":"10.1002/sec.336","title":"Adaptive‐capacity and robust natural language watermarking for agglutinative languages","year":2011,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Agglutinative language; Digital watermarking; Natural (archaeology); Natural language; Artificial intelligence","score_opus":0.026066328309388768,"score_gpt":0.243863499587106,"score_spread":0.21779717127771722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511987983","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.10917003,0.0002675916,0.88770235,0.00013890587,0.000034621182,0.000065546374,0.00004539451,0.0009332554,0.0016422406],"genre_scores_gemma":[0.65376234,0.00021480363,0.34337485,0.000083417704,0.00005530847,0.000082633356,0.00013944492,0.00015392531,0.0021331636],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933773,0.00015069383,0.00006548936,0.00013975406,0.00024314132,0.00006311675],"domain_scores_gemma":[0.99780864,0.00094507186,0.00035816754,0.00044963107,0.00038594782,0.00005251456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009189222,0.0005517798,0.00042225159,0.0008446871,0.00033454705,0.0006067872,0.00067609636,0.0006273405,0.0012301186],"category_scores_gemma":[0.0037209694,0.00021447036,0.00054283236,0.0004012094,0.0011075309,0.0016333923,0.0008763599,0.00045790832,0.00045297775],"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.00075085444,0.000116942596,0.0011511405,0.00025511207,0.00007722147,0.00039405306,0.00026779535,0.12061993,0.5801764,0.024995333,0.0010041047,0.2701911],"study_design_scores_gemma":[0.000049785038,0.00016464503,0.0008383997,0.000016501968,0.000030931307,0.00029298096,0.00003283621,0.8104434,0.17546403,0.010435143,0.0021751442,0.000056102494],"about_ca_topic_score_codex":0.00054534496,"about_ca_topic_score_gemma":0.0005236207,"teacher_disagreement_score":0.0012301186,"about_ca_system_score_codex":0.00044927927,"about_ca_system_score_gemma":0.0003618342,"threshold_uncertainty_score":0.004859805},"labels":[],"label_agreement":null},{"id":"W1523756834","doi":"10.1002/sec.559","title":"A survey on security issues in smart grids","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":85,"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":"Australian Government; U.S. Department of Energy","keywords":"Smart grid; Computer science; Computer security; Grid; Context (archaeology); Key (lock); Grid computing","score_opus":0.01301757511986825,"score_gpt":0.2430578300045461,"score_spread":0.23004025488467783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523756834","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00445821,0.90151733,0.028754624,0.0070370007,0.0012019518,0.00006624771,0.00010410486,0.00010809945,0.056752466],"genre_scores_gemma":[0.054702353,0.9264685,0.00922526,0.0013856576,0.0024244206,0.00006868074,0.00020429135,0.0000345359,0.0054863067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979517,0.0006417842,0.00022876474,0.00020496601,0.0008161675,0.00015656979],"domain_scores_gemma":[0.9946209,0.0040952074,0.00030881472,0.00025056084,0.00061950856,0.000104908315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021467847,0.0011730108,0.0011694429,0.0048868014,0.0012634919,0.003323987,0.0010102494,0.0027120344,0.004944557],"category_scores_gemma":[0.0040076543,0.00073385815,0.00081849453,0.008864603,0.001981334,0.0070828483,0.0013685556,0.002170207,0.0014015397],"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.000087148,0.000114090864,0.0020892965,0.007617288,0.00008896776,0.0006894498,0.00079680816,0.010573328,0.0010126516,0.34103894,0.045693506,0.5901985],"study_design_scores_gemma":[0.000016436856,0.00012485894,0.0017894882,0.0060170046,0.00007383269,0.0019092034,0.00079432596,0.008559117,0.0009421608,0.20058024,0.77913004,0.00006332215],"about_ca_topic_score_codex":0.0011337256,"about_ca_topic_score_gemma":0.0006087933,"teacher_disagreement_score":0.004944557,"about_ca_system_score_codex":0.0015023241,"about_ca_system_score_gemma":0.0013141881,"threshold_uncertainty_score":0.016541183},"labels":[],"label_agreement":null},{"id":"W1539010212","doi":"10.1002/sec.674","title":"Wireless security: securing mobile UMTS communications from interoperation of GSM","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Roaming; Computer network; Wireless network; GSM; UMTS frequency bands; Computer security; Interoperation; Cellular network; Wireless; Telecommunications","score_opus":0.015928027057280525,"score_gpt":0.27251818799445293,"score_spread":0.2565901609371724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539010212","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.096054055,0.0023962427,0.8547137,0.004143119,0.0005624253,0.00034077928,0.000056571505,0.002659344,0.039073817],"genre_scores_gemma":[0.82282686,0.0015918202,0.16558476,0.00045445812,0.00024307279,0.0001344928,0.00012527073,0.00013944418,0.0088998955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980525,0.0007904759,0.00010354355,0.00011209061,0.00072016014,0.00022123486],"domain_scores_gemma":[0.9984628,0.00034075946,0.00027041865,0.000540303,0.00033448535,0.000051313385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018839828,0.0007707528,0.0003870001,0.0012363502,0.00090937136,0.0026400439,0.0008598943,0.0014139734,0.0038351787],"category_scores_gemma":[0.005634605,0.0003240612,0.0004910125,0.0010207687,0.0016962006,0.0033907727,0.0021453816,0.0012306654,0.0013344378],"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.0007241293,0.00012240613,0.0047401735,0.00029782215,0.000114359005,0.0011500467,0.0010476379,0.017336113,0.05344635,0.46904752,0.009936304,0.4420371],"study_design_scores_gemma":[0.00018769508,0.0009273786,0.004641211,0.0006269547,0.00034879116,0.0045596473,0.0015803709,0.39681813,0.19162582,0.24358173,0.15489125,0.00021106417],"about_ca_topic_score_codex":0.0005500755,"about_ca_topic_score_gemma":0.00049462024,"teacher_disagreement_score":0.0038351787,"about_ca_system_score_codex":0.0008799793,"about_ca_system_score_gemma":0.00078662107,"threshold_uncertainty_score":0.0128299},"labels":[],"label_agreement":null},{"id":"W1570631586","doi":"10.1002/sec.1290","title":"An empirical investigation into path divergences for concolic execution using CREST","year":2015,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Core Research for Evolutional Science and Technology; National Natural Science Foundation of China","keywords":"Concolic testing; Computer science; Soundness; Path (computing); Test suite; Empirical research; Divergence (linguistics); Test case; Symbolic execution; Test (biology); Theoretical computer science; Software; Programming language; Machine learning; Mathematics; Statistics","score_opus":0.08112494552671053,"score_gpt":0.35457969414723567,"score_spread":0.27345474862052516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570631586","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.99165726,0.0001237719,0.0071366327,0.00008606206,0.0000082098395,0.000060946517,0.00022325864,0.00021342898,0.0004904447],"genre_scores_gemma":[0.9940315,0.00002877871,0.005256009,0.000019246558,0.000004333464,0.000035886937,0.0004963017,0.000043027045,0.00008489906],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9812262,0.0072499504,0.0016026555,0.0026240458,0.0065705176,0.000726612],"domain_scores_gemma":[0.65207773,0.2790455,0.027059615,0.020732632,0.018673012,0.0024115937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011937064,0.0005008989,0.00039723923,0.0026862563,0.00066331984,0.0010281556,0.001419954,0.00089848746,0.0007583061],"category_scores_gemma":[0.1389539,0.0003520442,0.00043578463,0.0023421862,0.0016319567,0.001987237,0.0012953893,0.0019092015,0.00016793273],"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.0012177629,0.0012386811,0.8316823,0.00051573484,0.00030633117,0.0012148619,0.0036479486,0.023976037,0.00956052,0.004740753,0.003229905,0.118669175],"study_design_scores_gemma":[0.00016722012,0.0028566006,0.5392368,0.00023346856,0.00027807563,0.003982604,0.0038312783,0.41070873,0.02308359,0.008544422,0.0069051827,0.00017205486],"about_ca_topic_score_codex":0.0014671303,"about_ca_topic_score_gemma":0.0024354928,"teacher_disagreement_score":0.011937064,"about_ca_system_score_codex":0.0008805362,"about_ca_system_score_gemma":0.0008741865,"threshold_uncertainty_score":0.06313002},"labels":[],"label_agreement":null},{"id":"W1576809010","doi":"10.1002/sec.403","title":"New class‐dependent feature transformation for intrusion detection systems","year":2011,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Intrusion detection system; Classifier (UML); Data mining; Transformation (genetics); Machine learning; Decision tree; Feature (linguistics); False alarm; Redundancy (engineering); Class (philosophy); Benchmark (surveying)","score_opus":0.016058132201675478,"score_gpt":0.21740505686845782,"score_spread":0.20134692466678233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576809010","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.019854259,0.00032884796,0.97628057,0.00012461383,0.000094697454,0.000076282486,0.00017637773,0.0023888985,0.00067542243],"genre_scores_gemma":[0.42967686,0.00038819193,0.5660987,0.00012312742,0.00016242097,0.0002496289,0.0012197617,0.0002053029,0.0018759558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976761,0.0004024585,0.00019727946,0.0004772372,0.0011485276,0.00009839859],"domain_scores_gemma":[0.99757,0.00068890303,0.00033376517,0.0005182117,0.000817501,0.000071639464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795801,0.00085976365,0.0008657649,0.00232342,0.0003446399,0.00097287854,0.001147319,0.00053076143,0.001419929],"category_scores_gemma":[0.0051166364,0.0002922431,0.0008752825,0.0018061659,0.0005899084,0.001863872,0.0009991674,0.001176228,0.0007469478],"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.00023658002,0.00024195071,0.002910524,0.00014372832,0.00015335882,0.00010407521,0.00011511267,0.046782225,0.030391764,0.00557702,0.004682476,0.90866107],"study_design_scores_gemma":[0.000024680257,0.00013113732,0.0029465097,0.000013660221,0.000029037801,0.0002401534,0.00003218093,0.96052724,0.023689657,0.005999085,0.006326838,0.00003983281],"about_ca_topic_score_codex":0.0011132228,"about_ca_topic_score_gemma":0.0008360668,"teacher_disagreement_score":0.00232342,"about_ca_system_score_codex":0.0005864173,"about_ca_system_score_gemma":0.0005441658,"threshold_uncertainty_score":0.0062382817},"labels":[],"label_agreement":null},{"id":"W1595612723","doi":"10.1002/sec.1014","title":"Reliability enhancement for CIR-based physical layer authentication","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Authentication (law); Fading; False alarm; Channel (broadcasting); Reliability (semiconductor); Wireless; Computer network; Telecommunications; Computer security; Artificial intelligence","score_opus":0.009687944089392877,"score_gpt":0.24615423807300485,"score_spread":0.23646629398361196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595612723","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.042860173,0.0011360747,0.9521968,0.00016841212,0.0001609719,0.00006409448,0.00003569335,0.00083263207,0.0025451756],"genre_scores_gemma":[0.892013,0.00051264965,0.10596623,0.00009533736,0.00012288945,0.00003801354,0.000056379227,0.000026471958,0.0011690011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838877,0.00050351734,0.00010117943,0.0001934266,0.0006280352,0.00018508665],"domain_scores_gemma":[0.9952809,0.0017759064,0.0005720071,0.0008749242,0.0013731122,0.00012318532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019725282,0.0008464621,0.0006848935,0.00077377085,0.0004825012,0.0007826843,0.00086546625,0.00086704857,0.0013307224],"category_scores_gemma":[0.0071321176,0.0003182701,0.0005262568,0.00057353434,0.00072460476,0.0013280647,0.0015142572,0.0012414557,0.00076900196],"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.0015277418,0.00018753484,0.0038250159,0.0005139994,0.000120075114,0.0006355925,0.0005547806,0.42646343,0.1781505,0.03545451,0.003250006,0.34931687],"study_design_scores_gemma":[0.000027115913,0.00039863956,0.00095282175,0.000026225936,0.000050824405,0.00041240052,0.000032967273,0.9654295,0.02722409,0.0035409257,0.0018504397,0.00005412676],"about_ca_topic_score_codex":0.00048989005,"about_ca_topic_score_gemma":0.0005101373,"teacher_disagreement_score":0.0019725282,"about_ca_system_score_codex":0.00046554333,"about_ca_system_score_gemma":0.0007901159,"threshold_uncertainty_score":0.010431826},"labels":[],"label_agreement":null},{"id":"W1598015853","doi":"10.1002/sec.641","title":"Efficient group‐based authentication protocol for location‐based service discovery in intelligent transportation systems","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Service discovery; Computer science; Scalability; Authentication (law); Service (business); Computer security; Intelligent transportation system; Protocol (science); Computer network; Scheme (mathematics); Vehicular ad hoc network; Authentication protocol; Wireless ad hoc network; World Wide Web; Telecommunications; Web service; Wireless; Database","score_opus":0.011910954895654576,"score_gpt":0.23496952713798067,"score_spread":0.2230585722423261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598015853","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.0628653,0.00063118135,0.931197,0.00045465367,0.0002332658,0.00036871084,0.00005702126,0.00083107315,0.0033617273],"genre_scores_gemma":[0.92768353,0.00023315394,0.069155954,0.000094016126,0.00006485742,0.0002517315,0.0001239811,0.00002497919,0.0023678304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979887,0.00087525585,0.00018280697,0.00016840744,0.0005301576,0.00025461984],"domain_scores_gemma":[0.9963111,0.0014803206,0.0005176155,0.0007873884,0.0007508202,0.00015271413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592244,0.00047551602,0.00079828635,0.0013976084,0.0014166294,0.0010580502,0.0013647076,0.0012176886,0.0021555494],"category_scores_gemma":[0.004875665,0.00026783574,0.0003876411,0.0010263035,0.0012002931,0.002455677,0.0026982336,0.0009508953,0.00069018255],"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.0029618135,0.00047018708,0.0044153207,0.00068468566,0.00028879516,0.0017250455,0.0020678064,0.21711235,0.12900278,0.37063727,0.01414252,0.25649142],"study_design_scores_gemma":[0.00021677779,0.00049219164,0.0005518326,0.0000565873,0.00009950133,0.0004636465,0.00019899916,0.90770495,0.030506045,0.041249186,0.018368887,0.00009139677],"about_ca_topic_score_codex":0.0010865917,"about_ca_topic_score_gemma":0.00081925147,"teacher_disagreement_score":0.002592244,"about_ca_system_score_codex":0.0011530272,"about_ca_system_score_gemma":0.0015135413,"threshold_uncertainty_score":0.013709307},"labels":[],"label_agreement":null},{"id":"W1604735721","doi":"10.1002/sec.625","title":"ALPP: anonymous and location privacy preserving scheme for mobile IPv6 heterogeneous networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Computer science; Anonymity; Computer network; Node (physics); Network packet; Mobile IP; Computer security; Engineering","score_opus":0.013567953320056909,"score_gpt":0.2498205214896438,"score_spread":0.23625256816958687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604735721","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.118091956,0.00028694345,0.87502486,0.00036786357,0.00007471175,0.00021442593,0.0001911762,0.0010669879,0.004681082],"genre_scores_gemma":[0.9275193,0.00011875579,0.069094084,0.000098169985,0.000054472763,0.00012525062,0.0001744151,0.000034500103,0.002781081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979798,0.00077814626,0.00014950306,0.00019600689,0.00066388573,0.00023262613],"domain_scores_gemma":[0.99783415,0.00041917493,0.0003724253,0.0009456853,0.00030283767,0.00012577117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016395999,0.00034332846,0.00055804383,0.00094344706,0.0011760746,0.0011852307,0.0014355143,0.00081340957,0.0011684725],"category_scores_gemma":[0.0025938596,0.00020251585,0.0005167713,0.0009083399,0.0010169864,0.0026937835,0.003412959,0.0009411384,0.00035687044],"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.0020033973,0.00039207187,0.0038804642,0.0003884139,0.00019975042,0.00162347,0.0016177616,0.14999574,0.113023095,0.39594388,0.007931903,0.32300013],"study_design_scores_gemma":[0.00020869123,0.0005779471,0.0016192197,0.000042067204,0.00011502909,0.0015133856,0.000228113,0.77651983,0.06739469,0.12361196,0.027999414,0.00016960135],"about_ca_topic_score_codex":0.00028803578,"about_ca_topic_score_gemma":0.00016301812,"teacher_disagreement_score":0.0016395999,"about_ca_system_score_codex":0.0008091188,"about_ca_system_score_gemma":0.0006381566,"threshold_uncertainty_score":0.0086711645},"labels":[],"label_agreement":null},{"id":"W1608346854","doi":"10.1002/sec.1106","title":"Feature engineering for detection of <scp>Denial of Service</scp> attacks in session initiation protocol","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Denial-of-service attack; Session Initiation Protocol; Header; Session (web analytics); Computer network; Feature (linguistics); Network packet; User agent; Replay attack; Protocol (science); Classifier (UML); Feature selection; Computer security; Authentication (law); Artificial intelligence; Server; The Internet; World Wide Web","score_opus":0.009158628997535185,"score_gpt":0.24302703003625625,"score_spread":0.23386840103872106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608346854","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.7613133,0.00053398823,0.2325436,0.00027143373,0.000072092196,0.00017519866,0.0008902839,0.0033370685,0.00086303835],"genre_scores_gemma":[0.96020925,0.00005314959,0.038480062,0.000030353813,0.000016631851,0.000080765996,0.00091209286,0.000022287311,0.00019540927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00028439082,0.00012546733,0.00019079809,0.0004209324,0.00010764211],"domain_scores_gemma":[0.99658185,0.0017585747,0.00044481948,0.00030391052,0.00080681976,0.00010415837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012429281,0.0007608663,0.0008076002,0.0022124208,0.00031800836,0.00064106163,0.00054638006,0.00059648027,0.00049495674],"category_scores_gemma":[0.0046653594,0.0001327106,0.00061100855,0.00080012786,0.00029762232,0.0007751099,0.00051240955,0.00069657975,0.00020853784],"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.0016571665,0.0014090866,0.057705507,0.00027949995,0.00029301204,0.00059483584,0.0001529452,0.16334979,0.061351903,0.0016771118,0.005831891,0.70569736],"study_design_scores_gemma":[0.000028677636,0.00032531182,0.013257074,0.000016248188,0.00004849994,0.00022422938,0.00003546985,0.96643996,0.018206475,0.0007566364,0.000637396,0.00002404303],"about_ca_topic_score_codex":0.001533325,"about_ca_topic_score_gemma":0.00093726866,"teacher_disagreement_score":0.0022124208,"about_ca_system_score_codex":0.00047381638,"about_ca_system_score_gemma":0.00042193776,"threshold_uncertainty_score":0.00657326},"labels":[],"label_agreement":null},{"id":"W1644539462","doi":"10.1002/sec.1075","title":"Duth: a user‐friendly dual‐factor authentication for Android smartphone devices","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Android (operating system); Authentication (law); Computer security; Mobile device; Authentication protocol; Java; User Friendly; World Wide Web; Operating system","score_opus":0.01123301947591559,"score_gpt":0.23895143389337883,"score_spread":0.22771841441746324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644539462","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.15942246,0.0014424579,0.7960167,0.00044636708,0.00044891398,0.0011146589,0.00054126,0.030115057,0.010452116],"genre_scores_gemma":[0.9115885,0.00018245378,0.07989642,0.00017607004,0.000060669183,0.00013725969,0.00032208813,0.00014967544,0.0074868165],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893993,0.00026056898,0.000114769326,0.00015457884,0.00035241217,0.00017778958],"domain_scores_gemma":[0.9985588,0.00021366857,0.00015708154,0.0006361848,0.00029635875,0.00013783184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006818859,0.00054948335,0.00059780665,0.00065009063,0.00043598912,0.00075606065,0.00085318804,0.0006106162,0.00408162],"category_scores_gemma":[0.0019120133,0.0002696444,0.00031507591,0.0002482102,0.0004959541,0.0011596765,0.0022031865,0.00070379395,0.0015392393],"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.004608646,0.000412553,0.009403571,0.00091644743,0.00018783372,0.0019863439,0.0010263567,0.009068453,0.35331425,0.025093118,0.027875267,0.5661072],"study_design_scores_gemma":[0.0007750943,0.0024869905,0.008837263,0.00014362943,0.00018838762,0.004323024,0.00027442593,0.49270234,0.3756914,0.0092275925,0.104916,0.0004337999],"about_ca_topic_score_codex":0.0006151024,"about_ca_topic_score_gemma":0.0005205681,"teacher_disagreement_score":0.00408162,"about_ca_system_score_codex":0.00027645452,"about_ca_system_score_gemma":0.00040462727,"threshold_uncertainty_score":0.013654351},"labels":[],"label_agreement":null},{"id":"W1722893958","doi":"10.1002/sec.1143","title":"Conference key establishment protocol using a multivariate polynomial and its applications","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Polynomial; Key (lock); Protocol (science); Overhead (engineering); Theoretical computer science; Key exchange; Secret sharing; Public-key cryptography; Computer network; Cryptography; Algorithm; Computer security; Mathematics; Operating system; Encryption","score_opus":0.02154224908371008,"score_gpt":0.2765094468599464,"score_spread":0.25496719777623633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722893958","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.09596092,0.0011724667,0.89237124,0.0008225711,0.00013986941,0.0001302368,0.0000866972,0.000602914,0.008713112],"genre_scores_gemma":[0.91418815,0.00075376505,0.0810432,0.00007387261,0.000106928535,0.00008319515,0.00009018062,0.000029555114,0.0036312544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.00031505452,0.00007721634,0.00021519221,0.00033053345,0.00018068471],"domain_scores_gemma":[0.9986727,0.00039956465,0.00026404724,0.0002980479,0.00023339718,0.00013226502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264864,0.00031338542,0.0004968184,0.00056639203,0.00068443874,0.0008377974,0.00066420704,0.00065181556,0.0015654847],"category_scores_gemma":[0.0020343561,0.00018917587,0.00040837508,0.0013414628,0.0007415751,0.0020942679,0.0014990903,0.0011530163,0.0002724989],"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.0010424163,0.00033189758,0.0035072677,0.0005312352,0.00010721057,0.0013831387,0.0009535738,0.10848467,0.11748781,0.56206566,0.0054350486,0.19867013],"study_design_scores_gemma":[0.00014063243,0.00047592266,0.0018416042,0.000037674028,0.00006751756,0.0020025708,0.00023953657,0.8213853,0.05190405,0.08303376,0.038748436,0.0001229023],"about_ca_topic_score_codex":0.0007922718,"about_ca_topic_score_gemma":0.0004465473,"teacher_disagreement_score":0.0015654847,"about_ca_system_score_codex":0.0010716644,"about_ca_system_score_gemma":0.0007617079,"threshold_uncertainty_score":0.0077754855},"labels":[],"label_agreement":null},{"id":"W1793841197","doi":"10.1002/sec.365","title":"SYN flooding attack detection by TCP handshake anomalies","year":2011,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","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":"Institut National de la Recherche Scientifique; Polytechnique Montréal","funders":"Cisco Systems","keywords":"Handshake; Computer science; Flooding (psychology); CUSUM; Computer network; Computer security; Initialization; Real-time computing","score_opus":0.020354451184730532,"score_gpt":0.21787742668444707,"score_spread":0.19752297549971654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793841197","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.865865,0.0003195975,0.1294495,0.00006777454,0.00004525509,0.000070500995,0.00017961783,0.0024625238,0.0015403123],"genre_scores_gemma":[0.98512846,0.00007652282,0.014428521,0.00001009935,0.000013850539,0.000013602115,0.00009938684,0.000027781201,0.00020180621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987451,0.000303316,0.00010564372,0.00021015895,0.0005592885,0.000076495846],"domain_scores_gemma":[0.99516416,0.001838882,0.0013629685,0.0006647527,0.0007983212,0.00017096325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567999,0.0006541091,0.00057107944,0.0034298713,0.0002459907,0.00085260853,0.0005366678,0.0005715226,0.00055177213],"category_scores_gemma":[0.006592363,0.00029121316,0.00021456856,0.0010797302,0.0004917399,0.0009809036,0.00060350256,0.00049422175,0.00024961872],"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.0018116325,0.0003376559,0.22594015,0.0003544355,0.00041945258,0.0013546805,0.00070187234,0.072033465,0.3145292,0.0038627142,0.0020963592,0.37655833],"study_design_scores_gemma":[0.00003064218,0.00044128715,0.0655941,0.000036242127,0.00011166237,0.0018137085,0.000112812915,0.7486413,0.17913799,0.0019399553,0.002052635,0.00008761655],"about_ca_topic_score_codex":0.0007457372,"about_ca_topic_score_gemma":0.00051026547,"teacher_disagreement_score":0.0034298713,"about_ca_system_score_codex":0.00036641207,"about_ca_system_score_gemma":0.0002441909,"threshold_uncertainty_score":0.0045312643},"labels":[],"label_agreement":null},{"id":"W1795263886","doi":"10.1002/sec.731","title":"A cryptography‐based protocol against packet dropping and message tampering attacks on mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Network packet; Encryption; Vehicular ad hoc network; Ad hoc On-Demand Distance Vector Routing; Data transmission; Optimized Link State Routing Protocol; Routing protocol; Wireless; Telecommunications","score_opus":0.009372966372849413,"score_gpt":0.24587766104086065,"score_spread":0.23650469466801124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795263886","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.26433402,0.0013171122,0.7207768,0.0005517542,0.0003577243,0.0006439215,0.00007573301,0.0012877122,0.010655285],"genre_scores_gemma":[0.9577751,0.00028278973,0.040072847,0.00007665641,0.000046317527,0.00009553174,0.00005527023,0.000022288554,0.0015732333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.0005632879,0.00013471335,0.00009234278,0.0005452733,0.00011114366],"domain_scores_gemma":[0.9963761,0.0013817006,0.0008046026,0.00076868536,0.0005787349,0.0000902375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017887275,0.00048713523,0.00043795584,0.0011717337,0.0005408236,0.0008950164,0.0010497156,0.00083456526,0.0009811382],"category_scores_gemma":[0.0049541057,0.00016784036,0.00038763034,0.00062130165,0.0007991327,0.0017841699,0.0014807775,0.00062600535,0.00034997484],"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.0012911513,0.00062975334,0.003953889,0.0005721957,0.0003103131,0.0012125566,0.00047012002,0.44857696,0.18527107,0.12930717,0.0032796902,0.22512509],"study_design_scores_gemma":[0.000112245114,0.0010726945,0.0007160688,0.000053545296,0.00009668819,0.0007791615,0.00005746094,0.9244073,0.052306056,0.013686381,0.006669001,0.000043392498],"about_ca_topic_score_codex":0.00029449826,"about_ca_topic_score_gemma":0.00015657529,"teacher_disagreement_score":0.0017887275,"about_ca_system_score_codex":0.0004440122,"about_ca_system_score_gemma":0.0007342436,"threshold_uncertainty_score":0.009459794},"labels":[],"label_agreement":null},{"id":"W1809627455","doi":"10.1002/sec.727","title":"SRC: a multicore NPU‐based TCP stream reassembly card for deep packet inspection","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Throughput; Network packet; Computer network; Deep packet inspection; Payload (computing); Stream processing; Timeout; Real-time computing; Embedded system; Operating system","score_opus":0.010459303485827522,"score_gpt":0.2287506317983241,"score_spread":0.2182913283124966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809627455","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.3559319,0.0020153166,0.56585085,0.0003743951,0.0008125592,0.0012327128,0.0007566762,0.056133263,0.01689229],"genre_scores_gemma":[0.8538892,0.00030194715,0.13303155,0.00029671966,0.000114151444,0.00023071018,0.0010014323,0.0003291797,0.010805046],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993406,0.000102443126,0.00006330592,0.000116578514,0.0002659056,0.00011115696],"domain_scores_gemma":[0.9987167,0.00017654715,0.0001874339,0.00026835303,0.0005264741,0.00012457589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411739,0.0005498388,0.00052603165,0.00089050794,0.0004101692,0.0007519291,0.002485379,0.00036191562,0.0048367465],"category_scores_gemma":[0.0014214442,0.0003431608,0.00020963929,0.0006046607,0.00031733327,0.0011209544,0.00064604596,0.00062957435,0.0012121138],"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.005311247,0.0011503835,0.013785467,0.00072642154,0.00024402591,0.00087262125,0.0003521357,0.029292818,0.29227775,0.011364083,0.0779762,0.5666468],"study_design_scores_gemma":[0.0005446768,0.0026123275,0.006667683,0.00005583184,0.00023325536,0.0012065314,0.000082184575,0.6278942,0.30351833,0.0011256362,0.055866424,0.00019287672],"about_ca_topic_score_codex":0.0018643431,"about_ca_topic_score_gemma":0.001954252,"teacher_disagreement_score":0.0048367465,"about_ca_system_score_codex":0.00071053655,"about_ca_system_score_gemma":0.0012141758,"threshold_uncertainty_score":0.016180515},"labels":[],"label_agreement":null},{"id":"W1898035851","doi":"10.1002/sec.726","title":"Password-authenticated cluster-based group key agreement for smart grid communication","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Group key; Forward secrecy; Password; Communication in small groups; Key (lock); Secrecy; Computer security; Key-agreement protocol; Protocol (science); Scheme (mathematics); Key exchange; Computer network; Context (archaeology); Secure communication; Key management; Cryptography; Public-key cryptography; Key distribution; Encryption","score_opus":0.01207036177802322,"score_gpt":0.22780695402945325,"score_spread":0.21573659225143002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898035851","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.016468318,0.00055364595,0.9778848,0.00028275474,0.00011366487,0.00028905127,0.00007054356,0.0007416258,0.0035956549],"genre_scores_gemma":[0.7988875,0.0007074406,0.19326237,0.00015708755,0.00010333155,0.00054116105,0.00029306996,0.00007670496,0.00597131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974057,0.001155862,0.00019869042,0.0003197544,0.00070885394,0.00021115075],"domain_scores_gemma":[0.99781847,0.0005917177,0.00039014115,0.00079411303,0.0002927651,0.00011285949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024226108,0.0005408822,0.00064994284,0.000799197,0.0012576046,0.0010806817,0.0017805768,0.0012691341,0.0031512026],"category_scores_gemma":[0.004332627,0.00030906443,0.00045224038,0.001786983,0.0017240503,0.0032915901,0.0027433294,0.0012823043,0.0012695743],"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.0015329248,0.00020408165,0.0011738237,0.0007947164,0.00015971746,0.0008926591,0.0010701709,0.14945391,0.03649584,0.59115934,0.011724546,0.20533828],"study_design_scores_gemma":[0.00031180875,0.00054924225,0.0006733745,0.00010990693,0.00011021414,0.0007518573,0.00022356935,0.7396812,0.025522755,0.19368957,0.038218427,0.00015804592],"about_ca_topic_score_codex":0.00070557906,"about_ca_topic_score_gemma":0.00077153835,"teacher_disagreement_score":0.0031512026,"about_ca_system_score_codex":0.0012712901,"about_ca_system_score_gemma":0.0016490419,"threshold_uncertainty_score":0.012812197},"labels":[],"label_agreement":null},{"id":"W1899838367","doi":"10.1002/sec.413","title":"A secure, efficient, and cost‐effective distributed architecture for spam mitigation on LTE 4G mobile networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Internet Traffic Analysis and Secure E-voting","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Computer network; Dimensioning; Flooding (psychology); Architecture; Distributed computing; Network packet; Network architecture; Cellular network; Computer security","score_opus":0.006695986757950451,"score_gpt":0.24029664560089029,"score_spread":0.23360065884293985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899838367","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.38487008,0.00028394107,0.6082618,0.00032095183,0.000057137353,0.00015800657,0.000026825059,0.0019373619,0.0040838164],"genre_scores_gemma":[0.96678054,0.00003470125,0.03215898,0.000030296193,0.000011458437,0.000029767245,0.000015613747,0.0000100853,0.00092859607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997092,0.00008356275,0.000015685859,0.00004492534,0.00010042124,0.00004615183],"domain_scores_gemma":[0.9994823,0.000110880486,0.000065291904,0.00012284592,0.00018225814,0.000036375543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053679035,0.00027152844,0.00033847647,0.00039817608,0.00057556987,0.0005729858,0.0008410853,0.0005503144,0.0008299767],"category_scores_gemma":[0.000865614,0.00013697351,0.00021280558,0.00023444297,0.0005006939,0.0007154404,0.0005683651,0.00037075506,0.0002188163],"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.0008940585,0.00041535054,0.004692924,0.00013059941,0.00009835539,0.0004881356,0.0002909818,0.6011411,0.16824776,0.024613766,0.0031205574,0.19586639],"study_design_scores_gemma":[0.00006379258,0.00021689983,0.0007021934,0.0000049898545,0.000029250526,0.00007339772,0.000030023848,0.9707692,0.02326772,0.0033450036,0.0014873198,0.000010254649],"about_ca_topic_score_codex":0.00142492,"about_ca_topic_score_gemma":0.0015026553,"teacher_disagreement_score":0.00142492,"about_ca_system_score_codex":0.00089264195,"about_ca_system_score_gemma":0.00056056835,"threshold_uncertainty_score":0.006476581},"labels":[],"label_agreement":null},{"id":"W1910221752","doi":"10.1002/sec.690","title":"A framework for intrusion detection system in advanced metering infrastructure","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":34,"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 Manitoba; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metering mode; Intrusion detection system; Intrusion prevention system; Computer security; Critical infrastructure; Intrusion; Geology","score_opus":0.006170757504704192,"score_gpt":0.22420624473729145,"score_spread":0.21803548723258726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910221752","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.0010813149,0.00026479535,0.9935976,0.00029639475,0.00009536815,0.00024448216,0.000033464352,0.0018770645,0.00250952],"genre_scores_gemma":[0.09396675,0.0007869929,0.8977467,0.00029213753,0.00013987561,0.00095064676,0.00021596182,0.000213492,0.0056874766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717003,0.0009365315,0.0003358827,0.00043074574,0.0008843855,0.00024237594],"domain_scores_gemma":[0.99878377,0.00044965732,0.00012690209,0.00023328715,0.0002760619,0.0001302868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052514654,0.0010492721,0.001122877,0.0013635559,0.0012602594,0.0047633513,0.0037165214,0.0029590619,0.0041542766],"category_scores_gemma":[0.0042501814,0.00078356045,0.0017887922,0.0007253575,0.00219565,0.004820028,0.003574352,0.0028469097,0.0016066626],"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.000094480645,0.0001427267,0.0011382296,0.00037463772,0.00013251662,0.0008800503,0.0008679823,0.08869019,0.0056762234,0.82559633,0.007927821,0.0684788],"study_design_scores_gemma":[0.00007633881,0.00013721146,0.00021935409,0.00015491735,0.00009532674,0.00058803335,0.00015784407,0.76492524,0.0053664804,0.1320859,0.09612209,0.00007122348],"about_ca_topic_score_codex":0.0034534545,"about_ca_topic_score_gemma":0.0027789855,"teacher_disagreement_score":0.0052514654,"about_ca_system_score_codex":0.001552614,"about_ca_system_score_gemma":0.002298978,"threshold_uncertainty_score":0.027772725},"labels":[],"label_agreement":null},{"id":"W1916761176","doi":"10.1002/sec.1073","title":"Enhancing malware detection for Android systems using a system call filtering and abstraction process","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Android (operating system); System call; Malware; Android malware; Abstraction; Anomaly detection; Malware analysis; Data mining; Machine learning; Computer security; Artificial intelligence; Operating system","score_opus":0.009543842832908458,"score_gpt":0.2509892719819979,"score_spread":0.24144542914908942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916761176","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.38624036,0.0004026505,0.6035812,0.00020388977,0.00004426004,0.00023713669,0.00016480488,0.008276623,0.0008491171],"genre_scores_gemma":[0.77098465,0.00016853923,0.22764888,0.000061393075,0.00003911122,0.00007499825,0.00030177349,0.00013941978,0.00058117986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984763,0.0002558362,0.00011072231,0.00028484466,0.0007180309,0.00015426725],"domain_scores_gemma":[0.9941806,0.0028343033,0.0007438867,0.0010304002,0.0010480434,0.0001627435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014362227,0.00086913264,0.0007882058,0.00267448,0.00053135393,0.0012307884,0.00072910404,0.0005321215,0.0006033651],"category_scores_gemma":[0.0064882077,0.00027254462,0.0009907358,0.0010369122,0.0004800448,0.0013710421,0.0010561519,0.00078411435,0.00038756442],"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.00055878697,0.0005949368,0.045041572,0.00030647044,0.00017433747,0.00046566266,0.0007356276,0.04366953,0.17330636,0.00390522,0.0023901758,0.7288513],"study_design_scores_gemma":[0.00002229328,0.00036498968,0.021578051,0.000031995227,0.00011867121,0.00057778816,0.00013796962,0.85864425,0.11155646,0.0037617492,0.0031420374,0.000063774634],"about_ca_topic_score_codex":0.003073454,"about_ca_topic_score_gemma":0.002504945,"teacher_disagreement_score":0.003073454,"about_ca_system_score_codex":0.0004955265,"about_ca_system_score_gemma":0.0010018852,"threshold_uncertainty_score":0.007595539},"labels":[],"label_agreement":null},{"id":"W1920843223","doi":"10.1002/sec.586","title":"Chaotic masking for securing RFID systems against relay attacks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Computer security; Simple (philosophy); Scheme (mathematics); Authentication (law); Masking (illustration); Radio-frequency identification; Chaotic; Cryptography; Computer network","score_opus":0.016220239363973283,"score_gpt":0.24624460613401622,"score_spread":0.23002436677004293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920843223","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.26660687,0.0006146146,0.72722757,0.00029287706,0.00007463726,0.0001036295,0.000029826373,0.00042898563,0.004620968],"genre_scores_gemma":[0.971263,0.00015286346,0.02767324,0.000027123695,0.000018196308,0.000023770468,0.000009933426,0.00000763026,0.00082429417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971837,0.00009727283,0.00002273953,0.000032665266,0.00010329666,0.000025584766],"domain_scores_gemma":[0.99924964,0.00029645234,0.00020655604,0.00013756947,0.00007758442,0.000032187254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043583286,0.00029565959,0.0003034504,0.00026957784,0.00029839168,0.00036758886,0.0002992184,0.0004118634,0.0010034197],"category_scores_gemma":[0.0015670737,0.00013917216,0.00023358775,0.00011197166,0.0004971839,0.0005723215,0.0008096845,0.00035858722,0.00031211134],"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.0008344849,0.000059682035,0.0015472542,0.0003092445,0.00006826487,0.0007118935,0.0004745232,0.10492552,0.711657,0.08199861,0.00085852225,0.096555054],"study_design_scores_gemma":[0.000081626764,0.0006711467,0.000858797,0.00004623931,0.000065432134,0.0007475171,0.00004204279,0.73061275,0.24349292,0.017296623,0.0060288077,0.00005611811],"about_ca_topic_score_codex":0.00011716868,"about_ca_topic_score_gemma":0.000078107376,"teacher_disagreement_score":0.0010034197,"about_ca_system_score_codex":0.00026070717,"about_ca_system_score_gemma":0.000236055,"threshold_uncertainty_score":0.0033567548},"labels":[],"label_agreement":null},{"id":"W1925165765","doi":"10.1002/sec.375","title":"Energy efficiency of encryption schemes applied to wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Block cipher mode of operation; Stream cipher; Cipher; Block cipher; Cryptography; Encryption; Efficient energy use; CBC-MAC; Triple DES; Computer network; Computer engineering; Distributed computing; Algorithm; Computer security; Engineering","score_opus":0.014697964721562875,"score_gpt":0.21356445385698455,"score_spread":0.19886648913542168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925165765","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.73014647,0.0017914128,0.26166114,0.00031975808,0.00008997361,0.00009101197,0.000082996885,0.00024273702,0.00557446],"genre_scores_gemma":[0.988664,0.00028466008,0.010456681,0.0000114701825,0.000004292753,0.00001855976,0.000029180897,0.000014710823,0.0005165723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988808,0.00046990172,0.0000627396,0.00006086465,0.00043206263,0.0000936568],"domain_scores_gemma":[0.99733764,0.0017472887,0.00023623562,0.00038447834,0.00027144334,0.000022901797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015367175,0.00041015883,0.000422875,0.0006216431,0.00024958732,0.0006073247,0.0004813165,0.0003974775,0.0009986627],"category_scores_gemma":[0.005395895,0.00016840127,0.0003364046,0.0006417619,0.00045681573,0.0013231862,0.0005624461,0.00024312922,0.00016875747],"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.000496853,0.00008989398,0.003150554,0.00014218349,0.000063452935,0.0000904571,0.00004801973,0.89229405,0.027585635,0.027602041,0.0003270849,0.04810981],"study_design_scores_gemma":[0.000016044698,0.00013681634,0.00062677055,0.0000106963835,0.000013992099,0.00006192579,0.000018826919,0.97297806,0.021024115,0.0046443483,0.00046115273,0.0000072310227],"about_ca_topic_score_codex":0.00045179535,"about_ca_topic_score_gemma":0.00035511277,"teacher_disagreement_score":0.0015367175,"about_ca_system_score_codex":0.0008169148,"about_ca_system_score_gemma":0.0004293523,"threshold_uncertainty_score":0.008127034},"labels":[],"label_agreement":null},{"id":"W1927997230","doi":"10.1002/sec.533","title":"DEFF: a new architecture for private online social networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Exploit; Architecture; Popularity; Private information retrieval; Limiting; Encryption; Information leakage; Proxy (statistics); Computation; Computer security; Information flow; Computer network","score_opus":0.017743482781911984,"score_gpt":0.26181447564114074,"score_spread":0.24407099285922876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927997230","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.030048044,0.00018459956,0.96030676,0.00044158517,0.0000747819,0.00032354175,0.0000918012,0.0055971574,0.0029317543],"genre_scores_gemma":[0.6497437,0.00022141171,0.33786696,0.00027455416,0.00011091716,0.00051573425,0.00033069248,0.00032488824,0.010611174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979432,0.00056156656,0.00017948504,0.0004444556,0.00059734134,0.00027394784],"domain_scores_gemma":[0.99669904,0.0006686301,0.00029195458,0.0016921249,0.00041192694,0.00023630827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034699484,0.00048115943,0.00061659183,0.001311147,0.0014560678,0.0026573779,0.0027511194,0.0018116427,0.004372968],"category_scores_gemma":[0.0055764127,0.00051256316,0.0006598391,0.000606293,0.0019164272,0.0072445995,0.0041381163,0.0017375925,0.0010176367],"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.00092198845,0.0006190644,0.0056743487,0.0002959516,0.00014528977,0.0006559264,0.0015022355,0.11756668,0.03994852,0.40625507,0.015821084,0.41059384],"study_design_scores_gemma":[0.000096307165,0.0002498773,0.00090235076,0.00003409292,0.000041820782,0.000426321,0.00012941279,0.84227717,0.018964676,0.09388717,0.042882964,0.000107856125],"about_ca_topic_score_codex":0.002358902,"about_ca_topic_score_gemma":0.0015771294,"teacher_disagreement_score":0.004372968,"about_ca_system_score_codex":0.0016692278,"about_ca_system_score_gemma":0.001017886,"threshold_uncertainty_score":0.018351018},"labels":[],"label_agreement":null},{"id":"W1942868643","doi":"10.1002/sec.519","title":"Trust modeling for message relay control and local action decision making in VANETs","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":60,"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; Scalability; Relay; Wireless ad hoc network; Vehicular ad hoc network; Computer security; Action (physics); Computer network; Control (management); Telecommunications; Artificial intelligence; Wireless","score_opus":0.012559687055971172,"score_gpt":0.25091015448146464,"score_spread":0.23835046742549348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942868643","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.030934246,0.00023000587,0.9656752,0.0004312627,0.00005539358,0.00006575567,0.000043190954,0.00014284387,0.0024221125],"genre_scores_gemma":[0.9630498,0.00017761301,0.034437586,0.00004660247,0.000038734193,0.00009905585,0.00004281625,0.000027945898,0.0020799641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964477,0.0017101903,0.0002193457,0.0005550291,0.0006977769,0.00036990858],"domain_scores_gemma":[0.99276674,0.0044978466,0.0011135909,0.0003306938,0.0010256257,0.0002655241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005008927,0.0011703722,0.0011902256,0.000885019,0.00067050994,0.0021433197,0.0019388943,0.0013852088,0.0015741197],"category_scores_gemma":[0.015849845,0.0006335588,0.0009168364,0.0006003976,0.0017985207,0.0028780936,0.0015399475,0.0015689258,0.00022906555],"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.00006823384,0.000020693346,0.00040228307,0.00002625376,0.000030178326,0.000075202464,0.00012397314,0.96210676,0.0005137762,0.031143064,0.00021725803,0.005272457],"study_design_scores_gemma":[0.0000048613706,0.000013254207,0.000034524874,0.000002630433,0.0000054833026,0.000004841439,0.000010570057,0.9939492,0.00009734599,0.005763776,0.00010948579,0.000004180692],"about_ca_topic_score_codex":0.013214451,"about_ca_topic_score_gemma":0.005694413,"teacher_disagreement_score":0.013214451,"about_ca_system_score_codex":0.0028147295,"about_ca_system_score_gemma":0.0017250576,"threshold_uncertainty_score":0.026490033},"labels":[],"label_agreement":null},{"id":"W1943537601","doi":"10.1002/sec.1118","title":"Artificial frequency selective channel for covert cyclic delay diversity orthogonal frequency division multiplexing transmission","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Physical layer; Multiplexing; Transmission (telecommunications); Computer network; Orthogonal frequency-division multiplexing; Channel (broadcasting); Covert; Encryption; Wireless; Diversity scheme; Telecommunications","score_opus":0.013867939103476347,"score_gpt":0.22908894762041263,"score_spread":0.2152210085169363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943537601","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.42086136,0.00060450204,0.56711227,0.0003536597,0.00016559077,0.00006801628,0.00010161281,0.00023939356,0.010493552],"genre_scores_gemma":[0.9781465,0.0001545171,0.020914597,0.000031528532,0.000016555958,0.00001581187,0.000017109234,0.000004198051,0.00069916697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978226,0.00006887147,0.000005399438,0.000022642735,0.000084876214,0.00003598186],"domain_scores_gemma":[0.9993482,0.0003752999,0.0001084298,0.00006893926,0.00007746675,0.000021635515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034732133,0.00023636984,0.00019725364,0.00027448373,0.0003775416,0.00031123686,0.0002432194,0.00038132534,0.000965009],"category_scores_gemma":[0.00094950385,0.00008770591,0.00016175157,0.0003094657,0.00058571517,0.00039285718,0.00049228274,0.000259695,0.0001300751],"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.0008599624,0.00013780751,0.0021721276,0.0003206375,0.000058431222,0.0009808742,0.00024609885,0.45917735,0.2724701,0.16934529,0.0025361516,0.09169518],"study_design_scores_gemma":[0.000023810813,0.0001302966,0.00038827848,0.000011936277,0.000012123032,0.00023058707,0.000014901434,0.9640963,0.028823873,0.004479583,0.0017652726,0.000022961307],"about_ca_topic_score_codex":0.00034035827,"about_ca_topic_score_gemma":0.00039897207,"teacher_disagreement_score":0.000965009,"about_ca_system_score_codex":0.00039924108,"about_ca_system_score_gemma":0.00028432865,"threshold_uncertainty_score":0.0032282472},"labels":[],"label_agreement":null},{"id":"W1944439395","doi":"10.1002/sec.644","title":"Unified phase and magnitude speech spectra data hiding algorithm","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Steganography and Watermarking Techniques","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":"Université de Moncton","funders":"","keywords":"Computer science; Communication source; Algorithm; Information hiding; Magnitude (astronomy); Set (abstract data type); Distortion (music); Embedding; Exploit; Phase (matter); Speech recognition; Data mining; Artificial intelligence; Computer network; Bandwidth (computing); Computer security","score_opus":0.02278782941968127,"score_gpt":0.28010684268269237,"score_spread":0.2573190132630111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944439395","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.006550033,0.000102511796,0.9920533,0.000038072878,0.000020073065,0.000043661763,0.000016203689,0.00030214863,0.00087400345],"genre_scores_gemma":[0.17794503,0.00019427536,0.8171172,0.000062493484,0.00004531775,0.0001445341,0.00014487497,0.00006944809,0.0042767553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918336,0.00010880841,0.0000706624,0.00014460567,0.00040193324,0.00009067722],"domain_scores_gemma":[0.9994247,0.000121286335,0.0000783191,0.00014114482,0.00021072254,0.000023915469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065813644,0.0006627496,0.0006222972,0.0011699359,0.00039982802,0.0009983986,0.0009900088,0.00093890785,0.0027788656],"category_scores_gemma":[0.0016731182,0.00025189572,0.0005145415,0.00062277814,0.0006585951,0.0016077559,0.0014726915,0.00068055076,0.0012365156],"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.00053984835,0.00013314043,0.0007821044,0.00021056908,0.00005507563,0.00015850419,0.00021416838,0.09308948,0.17119825,0.07861479,0.0019699412,0.65303415],"study_design_scores_gemma":[0.000077724646,0.00019935725,0.0004153278,0.000028064225,0.000040038838,0.00043679215,0.000050589515,0.86838716,0.10703856,0.015724225,0.0075581227,0.00004402131],"about_ca_topic_score_codex":0.0004242639,"about_ca_topic_score_gemma":0.0005249295,"teacher_disagreement_score":0.0027788656,"about_ca_system_score_codex":0.0004152936,"about_ca_system_score_gemma":0.0007954684,"threshold_uncertainty_score":0.009296179},"labels":[],"label_agreement":null},{"id":"W1982347450","doi":"10.1002/sec.24","title":"A secure business framework for file purchasing in vehicular networks","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Computer science; Upload; Dedicated short-range communications; Purchasing; File transfer; Computer security; Vehicular ad hoc network; Computer network; Wireless ad hoc network; Telecommunications; Operating system; Transfer (computing); Wireless; Business","score_opus":0.00999629724309491,"score_gpt":0.21145061307589008,"score_spread":0.20145431583279516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982347450","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.014068839,0.00027007906,0.9772284,0.0007349692,0.00008634731,0.0002603634,0.000055049146,0.00090833043,0.006387466],"genre_scores_gemma":[0.6803821,0.0005430495,0.30809483,0.0001899313,0.0001373644,0.00039890112,0.00024039969,0.00011264127,0.009900835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702317,0.0008660204,0.00022363766,0.00039681216,0.0011349905,0.00035537794],"domain_scores_gemma":[0.99773127,0.0007657227,0.00032553723,0.00057219,0.0003891046,0.00021626861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035379385,0.0005617624,0.00060163176,0.0014401808,0.0017372363,0.003825056,0.002425805,0.0022819028,0.0033378524],"category_scores_gemma":[0.0040974864,0.00049210567,0.00082992646,0.0010117332,0.0022754204,0.005668497,0.0039709,0.001982567,0.0010006798],"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.000106416854,0.00013932794,0.00083451625,0.000088922156,0.000031064526,0.00088403124,0.00040444784,0.0755225,0.0044440497,0.86391973,0.0040575964,0.04956736],"study_design_scores_gemma":[0.000057795878,0.00008460217,0.00020088041,0.00004435981,0.000025634416,0.00050050876,0.00021567587,0.7995687,0.0061501046,0.15442246,0.03867371,0.000055531687],"about_ca_topic_score_codex":0.0032039417,"about_ca_topic_score_gemma":0.0021842965,"teacher_disagreement_score":0.003825056,"about_ca_system_score_codex":0.001665748,"about_ca_system_score_gemma":0.0020922688,"threshold_uncertainty_score":0.018710613},"labels":[],"label_agreement":null},{"id":"W1983211924","doi":"10.1002/sec.30","title":"Local fast re‐authentication for 3G‐WLAN interworking","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Sultan Qaboos University","keywords":"Computer science; Computer network; AKA; Authentication (law); Computer security; Authentication protocol; Key (lock); Internet security; Protocol (science); Security service; Information security","score_opus":0.01425883149218172,"score_gpt":0.21874328435439466,"score_spread":0.20448445286221295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983211924","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.14557481,0.0013467568,0.83397734,0.0005117331,0.0002132324,0.0006535354,0.00011962804,0.0071308454,0.0104721915],"genre_scores_gemma":[0.93560517,0.00029078836,0.060898375,0.00010774561,0.000048892933,0.00019729313,0.00014870738,0.00007813471,0.0026248775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997635,0.0011728153,0.00017182731,0.00016993289,0.0005475742,0.00030285263],"domain_scores_gemma":[0.9957066,0.0012846062,0.0006492062,0.0015439992,0.00070378295,0.00011186383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954652,0.00048996566,0.00048725042,0.0010123121,0.00096473965,0.0014927655,0.0009307017,0.000914534,0.002553837],"category_scores_gemma":[0.0052630138,0.0002986837,0.00036379413,0.0003547825,0.0009094376,0.0023165562,0.002047594,0.0011635992,0.0011926236],"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.0031645722,0.00038736465,0.006364007,0.000708422,0.00015977786,0.0015341879,0.00113441,0.1068554,0.21346165,0.13568872,0.01349494,0.51704663],"study_design_scores_gemma":[0.0002827042,0.0010976178,0.002809801,0.00016316897,0.00018865074,0.0012633401,0.00025344823,0.8025996,0.12868439,0.02964426,0.032832682,0.00018029647],"about_ca_topic_score_codex":0.0011170236,"about_ca_topic_score_gemma":0.0009954191,"teacher_disagreement_score":0.003954652,"about_ca_system_score_codex":0.0009008358,"about_ca_system_score_gemma":0.0010657802,"threshold_uncertainty_score":0.020914435},"labels":[],"label_agreement":null},{"id":"W1986896917","doi":"10.1002/sec.13","title":"Architecture and protocols of the future European quantum key distribution network","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":89,"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; Computer science; Key (lock); Quantum cryptography; Computer network; Architecture; Cryptography; Point-to-point; Computer security; Network architecture; Key distribution; Point (geometry); Public-key cryptography; Distributed computing; Quantum; Encryption; Quantum information; Physics","score_opus":0.007867547091270265,"score_gpt":0.20961138826592154,"score_spread":0.20174384117465127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986896917","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.11962004,0.0017325804,0.78024304,0.006823606,0.00076770515,0.0006334271,0.0002869487,0.001985613,0.08790705],"genre_scores_gemma":[0.71390074,0.00081975386,0.26035458,0.0004407176,0.000102396596,0.00042179265,0.00035300944,0.00007990376,0.023527138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900025,0.0004057953,0.00006495845,0.00016407827,0.00024393768,0.00012114052],"domain_scores_gemma":[0.9993414,0.00014606358,0.00006917885,0.00015147144,0.00021211045,0.000079754245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031769217,0.00023867161,0.00021356354,0.000499037,0.0007698074,0.0019487863,0.0008981742,0.001526542,0.003541625],"category_scores_gemma":[0.0016622641,0.00023298252,0.00023770462,0.00044431177,0.0010199425,0.0024093622,0.0019002841,0.0007347479,0.0007684826],"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.00027609235,0.000097350974,0.0008493277,0.000073401585,0.000024256202,0.0002589108,0.00037242856,0.05952454,0.009084132,0.85644287,0.0076029208,0.06539372],"study_design_scores_gemma":[0.00020878385,0.0001980089,0.00067570916,0.000104872786,0.000041449697,0.00034754726,0.00017641552,0.5559283,0.01810918,0.1987338,0.22538942,0.00008644447],"about_ca_topic_score_codex":0.002044132,"about_ca_topic_score_gemma":0.0015781049,"teacher_disagreement_score":0.003541625,"about_ca_system_score_codex":0.0022161524,"about_ca_system_score_gemma":0.0018387553,"threshold_uncertainty_score":0.016801417},"labels":[],"label_agreement":null},{"id":"W1987386756","doi":"10.1002/sec.248","title":"A self‐stabilized random access protocol against denial of service attack in wireless networks","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","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 Ottawa","funders":"","keywords":"Aloha; Computer science; Computer network; Network packet; Encryption; Random access; Denial-of-service attack; Throughput; Computer security; Wireless; Telecommunications; The Internet","score_opus":0.013874855695406993,"score_gpt":0.28613336591809907,"score_spread":0.2722585102226921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987386756","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.15684338,0.00057401403,0.8365156,0.00020613584,0.00015556197,0.00016249016,0.000030709303,0.0020353785,0.0034766423],"genre_scores_gemma":[0.96610963,0.00010236733,0.03204318,0.00007596767,0.00005506962,0.00009320767,0.00003147351,0.000019362547,0.0014697836],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00033096768,0.00006915153,0.00015510825,0.00030024708,0.00008817362],"domain_scores_gemma":[0.9980964,0.00051918137,0.00039929769,0.00029269673,0.00061128096,0.00008112577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010780842,0.00037430486,0.00059266,0.00084227993,0.00055393425,0.00069569837,0.00093049067,0.0005905947,0.0010247481],"category_scores_gemma":[0.0024568804,0.00014625616,0.00025653688,0.00032658022,0.0007205671,0.0009047282,0.00077912357,0.00038343575,0.0004858458],"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.002483384,0.00040836527,0.001988541,0.0004364976,0.00029142303,0.0009596434,0.0009411576,0.25152126,0.37078425,0.05114701,0.0045040506,0.31453446],"study_design_scores_gemma":[0.00016748803,0.001215343,0.00059135765,0.000040064057,0.00011017507,0.00069582264,0.00010191696,0.93473715,0.0461906,0.0107241385,0.005366737,0.000059252307],"about_ca_topic_score_codex":0.0003545494,"about_ca_topic_score_gemma":0.00029163438,"teacher_disagreement_score":0.0010780842,"about_ca_system_score_codex":0.00031380428,"about_ca_system_score_gemma":0.00042878458,"threshold_uncertainty_score":0.005701542},"labels":[],"label_agreement":null},{"id":"W1996107151","doi":"10.1002/sec.140","title":"A lightweight secure data transmission protocol for resource constrained devices","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Computer network; Network packet; Protocol (science); Overhead (engineering); Authentication (law); Multicast; Data transmission; RC4; Broadcasting (networking); Distributed computing; Computer security; Stream cipher; Encryption","score_opus":0.03219787215608268,"score_gpt":0.30734050626343296,"score_spread":0.2751426341073503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996107151","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.019271143,0.0005728678,0.9753983,0.00036778627,0.00017181755,0.00029664006,0.00006541023,0.0007479454,0.0031080246],"genre_scores_gemma":[0.59009504,0.0013015547,0.39203683,0.00038080668,0.00019643456,0.0014072894,0.00037897818,0.0001761861,0.014026873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.0002775212,0.00017262474,0.00012736992,0.0005890283,0.00009130799],"domain_scores_gemma":[0.9987237,0.0004240005,0.00027759708,0.0003041298,0.00020863659,0.0000619111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012680654,0.00048287274,0.0006554992,0.000635531,0.000605655,0.0011568355,0.0010596032,0.0008707249,0.0021152403],"category_scores_gemma":[0.0025690615,0.00029294577,0.00049750577,0.00055591745,0.00080305716,0.002662124,0.0023283982,0.0012352561,0.00068137626],"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.00084269483,0.00020761364,0.0005782678,0.0013841602,0.0001548367,0.0025374505,0.0012401978,0.056114122,0.291064,0.3673408,0.009571648,0.26896426],"study_design_scores_gemma":[0.0003697632,0.0009682093,0.0005392032,0.00023498872,0.00019660481,0.0022194681,0.0002295172,0.65093917,0.15748127,0.09359089,0.093011744,0.0002191558],"about_ca_topic_score_codex":0.0002578938,"about_ca_topic_score_gemma":0.00016507551,"teacher_disagreement_score":0.0021152403,"about_ca_system_score_codex":0.00047406575,"about_ca_system_score_gemma":0.00095578335,"threshold_uncertainty_score":0.007076204},"labels":[],"label_agreement":null},{"id":"W2006052221","doi":"10.1002/sec.203","title":"A provably secure threshold signature scheme based on DDH assumption","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","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":"Ontario Tech University","funders":"","keywords":"Computer science; Signature (topology); Computer security; Schnorr signature; Provable security; Scheme (mathematics); Key (lock); Theoretical computer science; Cryptography; Ring signature; Public-key cryptography; Mathematics; Blind signature; Encryption","score_opus":0.006193508839327878,"score_gpt":0.22318018528329517,"score_spread":0.2169866764439673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006052221","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.16013083,0.0011876487,0.81380725,0.001981512,0.0005286136,0.0003507651,0.0005395508,0.0014006519,0.020073092],"genre_scores_gemma":[0.9197376,0.00042614335,0.07392552,0.00029177254,0.00017928999,0.00012773674,0.0002663903,0.00003799377,0.005007689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972933,0.0003800227,0.00032118984,0.00052237976,0.0011919535,0.00029111936],"domain_scores_gemma":[0.9975846,0.00059831777,0.0005002843,0.00067202194,0.00032907526,0.0003157294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014652496,0.00036590677,0.0011061566,0.0006762759,0.0011911001,0.0028176606,0.0015281796,0.0014648373,0.0026712804],"category_scores_gemma":[0.0029755812,0.00026171503,0.0008018719,0.0013866025,0.0017925219,0.0057104,0.00338553,0.0018483688,0.0006613863],"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.0009803358,0.00024307537,0.0012779838,0.0004216999,0.000089067515,0.00089973013,0.0007759977,0.021442935,0.059227463,0.84964526,0.004017223,0.06097919],"study_design_scores_gemma":[0.0006123351,0.0006489085,0.00069697475,0.00008151509,0.00012582228,0.0023499746,0.00020836346,0.27524677,0.056803346,0.62472874,0.03829691,0.00020039514],"about_ca_topic_score_codex":0.0003209371,"about_ca_topic_score_gemma":0.00013730816,"teacher_disagreement_score":0.0028176606,"about_ca_system_score_codex":0.0017409879,"about_ca_system_score_gemma":0.001631155,"threshold_uncertainty_score":0.012631834},"labels":[],"label_agreement":null},{"id":"W2025813221","doi":"10.1002/sec.199","title":"Secure and robust threshold key management (SRKM) scheme for <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Computer security; Key management; Mobile ad hoc network; Adversary; Certificate authority; Public-key cryptography; Key (lock); Robustness (evolution); Wireless ad hoc network; Vulnerability (computing); Computer network; Certificate; Cryptography; Scheme (mathematics); Wireless; Encryption; Telecommunications; Network packet; Theoretical computer science","score_opus":0.010304734932633267,"score_gpt":0.22322101531910205,"score_spread":0.2129162803864688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025813221","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.13352062,0.0021052721,0.84970707,0.0010434837,0.00028101273,0.0004041095,0.00026799363,0.001747302,0.010923197],"genre_scores_gemma":[0.94573843,0.00033772553,0.051683422,0.00011494534,0.00004905424,0.00009111275,0.0001325033,0.000027813245,0.0018251023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987318,0.0003031925,0.00012932117,0.00017593567,0.00044795166,0.00021194102],"domain_scores_gemma":[0.9981806,0.00035629305,0.0005554002,0.00054349087,0.00021383425,0.00015033029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010132882,0.00039971044,0.0006513992,0.00058946107,0.00070292933,0.0012507502,0.0013568657,0.000912379,0.0012748471],"category_scores_gemma":[0.0025872237,0.00016283467,0.0005775911,0.00070511154,0.0010355351,0.0026603346,0.0022653178,0.00092996337,0.00041789442],"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.0014287686,0.00034556043,0.0022118504,0.0010311597,0.00025740123,0.0011857544,0.0012295513,0.17792343,0.23397583,0.3817892,0.010091468,0.18853],"study_design_scores_gemma":[0.00045748954,0.0012859767,0.0013819152,0.00014132416,0.00014892225,0.0023498854,0.00026092574,0.74573386,0.08042462,0.14303109,0.024570191,0.0002137538],"about_ca_topic_score_codex":0.00040780145,"about_ca_topic_score_gemma":0.00017646544,"teacher_disagreement_score":0.0013568657,"about_ca_system_score_codex":0.00087760034,"about_ca_system_score_gemma":0.0011460509,"threshold_uncertainty_score":0.0063675046},"labels":[],"label_agreement":null},{"id":"W2026183175","doi":"10.1002/sec.4","title":"Anonymous authentication and secure communication protocol for wireless mobile <i>ad hoc</i> networks","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Anonymity; Computer network; Computer security; Node (physics); Wireless ad hoc network; Authentication (law); Mobile ad hoc network; Authentication protocol; Routing protocol; Cryptography; Robustness (evolution); Wireless; Routing (electronic design automation); Network packet; Telecommunications","score_opus":0.015193826817563994,"score_gpt":0.2638715906713702,"score_spread":0.24867776385380624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026183175","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.032616146,0.0006967516,0.95113766,0.0006701166,0.0003989899,0.0003351959,0.00007062472,0.0011473877,0.012927114],"genre_scores_gemma":[0.8520176,0.00054665294,0.13490868,0.00033904245,0.00021404441,0.0005435254,0.00020724777,0.00008820429,0.011134998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770606,0.0009453831,0.00017381374,0.00018801886,0.0007914033,0.00019534132],"domain_scores_gemma":[0.99747485,0.0006244317,0.0005006702,0.00049288716,0.00075572997,0.00015132989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014383469,0.00039623983,0.00043625705,0.0009114254,0.0011248677,0.001320091,0.00097435014,0.00084622094,0.0015668881],"category_scores_gemma":[0.003163094,0.00016965598,0.0004468752,0.00071494863,0.0012633415,0.0017226221,0.0016179373,0.0008751929,0.00064590067],"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.0008472164,0.00019499713,0.0012198641,0.00041885034,0.00012020852,0.0017884986,0.001731716,0.06891404,0.0654146,0.68097544,0.015208752,0.16316575],"study_design_scores_gemma":[0.00018151413,0.0008417713,0.0007195268,0.00011362049,0.00015006734,0.002259259,0.00036173867,0.7288987,0.046519063,0.12527068,0.09447465,0.00020947611],"about_ca_topic_score_codex":0.0005660097,"about_ca_topic_score_gemma":0.00033358586,"teacher_disagreement_score":0.0015668881,"about_ca_system_score_codex":0.00075377326,"about_ca_system_score_gemma":0.001125727,"threshold_uncertainty_score":0.0076068044},"labels":[],"label_agreement":null},{"id":"W2035650567","doi":"10.1002/sec.35","title":"Insider attack attribution using signal strength‐based hyperbolic location estimation","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transmission (telecommunications); RSS; Computer security; Transmitter; Probabilistic logic; SIGNAL (programming language); Verifiable secret sharing; Computer network; Algorithm; Telecommunications; Channel (broadcasting); Set (abstract data type); Artificial intelligence","score_opus":0.0342928553258464,"score_gpt":0.25768785864328114,"score_spread":0.22339500331743473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035650567","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.14213525,0.00029877122,0.8531001,0.0002100769,0.000070649374,0.00008097473,0.00009221623,0.0011125965,0.0028992828],"genre_scores_gemma":[0.9314105,0.00017340337,0.06688838,0.000027242702,0.000057830588,0.00003866061,0.00011782307,0.000030961037,0.001255258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773705,0.0008569953,0.00014276037,0.00036549583,0.00076785474,0.00012984566],"domain_scores_gemma":[0.9901153,0.003999473,0.0026003271,0.0014760018,0.0015571446,0.00025177913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020352644,0.0007250997,0.0009387809,0.0026306228,0.00037385174,0.00134804,0.00107421,0.000765118,0.0011709817],"category_scores_gemma":[0.015475412,0.0003934137,0.00046728685,0.0009809779,0.0008792019,0.0026884137,0.0022324924,0.0007820227,0.0010333754],"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.0011345311,0.00019906514,0.031471696,0.00018392986,0.00023028141,0.00042604058,0.00048211752,0.35902244,0.02516215,0.017412037,0.001929011,0.5623466],"study_design_scores_gemma":[0.000016118895,0.00009163662,0.0027715599,0.000013766987,0.00002220607,0.00020366469,0.000051283616,0.98833114,0.0055937865,0.0023632674,0.0005118997,0.00002964402],"about_ca_topic_score_codex":0.00090847845,"about_ca_topic_score_gemma":0.00054346886,"teacher_disagreement_score":0.0026306228,"about_ca_system_score_codex":0.0006035287,"about_ca_system_score_gemma":0.00048285432,"threshold_uncertainty_score":0.010763586},"labels":[],"label_agreement":null},{"id":"W2054090438","doi":"10.1002/sec.6","title":"Biometric‐based user authentication in mobile <i>ad hoc</i> networks","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Defence Research and Development Canada; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Biometrics; Authentication (law); Computer security; Authentication protocol; Session (web analytics); Computer network; Vulnerability (computing); Exploit; Wireless ad hoc network; Mobile ad hoc network; Challenge–response authentication; Multi-factor authentication; Telecommunications; World Wide Web; Wireless","score_opus":0.017296571375948925,"score_gpt":0.24073885097243017,"score_spread":0.22344227959648125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054090438","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.1966582,0.0029311024,0.78473973,0.00080687227,0.00027759044,0.00010833538,0.0000735726,0.0005760937,0.013828518],"genre_scores_gemma":[0.9804613,0.0002595191,0.017899461,0.000028037259,0.000027379056,0.00001754788,0.000014328911,0.000006167103,0.0012863568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991258,0.0004085666,0.000029552351,0.00007836492,0.00024382134,0.000113955495],"domain_scores_gemma":[0.99897504,0.0004040003,0.00018433298,0.00015655257,0.00022300571,0.000056987763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093670527,0.00031080836,0.00050996616,0.00050452875,0.00059219386,0.00060670683,0.00055618107,0.00067270856,0.0018250725],"category_scores_gemma":[0.0022165026,0.00015217865,0.00021405953,0.00064255594,0.00094519084,0.0011066936,0.00091347715,0.00042485647,0.00044435833],"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.00090770546,0.00013416367,0.004788669,0.00020813866,0.000073240604,0.0007208575,0.00017101518,0.7007843,0.036242973,0.06427006,0.00558805,0.1861107],"study_design_scores_gemma":[0.000012185646,0.00010776159,0.00079206366,0.000014593962,0.000009809741,0.000121171164,0.000031393538,0.9898801,0.00243055,0.0054520974,0.001131932,0.000016470784],"about_ca_topic_score_codex":0.0019047444,"about_ca_topic_score_gemma":0.0008985359,"teacher_disagreement_score":0.0019047444,"about_ca_system_score_codex":0.0005457089,"about_ca_system_score_gemma":0.00032455527,"threshold_uncertainty_score":0.006105423},"labels":[],"label_agreement":null},{"id":"W2072268482","doi":"10.1002/sec.201","title":"Security for QoS assured wireless and mobile networks","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Wireless network; Quality of service; Computer security; Computer network; Municipal wireless network; Wireless WAN; Multi-frequency network; Wireless; Heterogeneous network; Telecommunications; Wi-Fi array","score_opus":0.0041123732727182455,"score_gpt":0.21056721250710927,"score_spread":0.20645483923439104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072268482","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.025922317,0.066783965,0.591399,0.06247529,0.0064388486,0.000504625,0.0007405163,0.0018703525,0.24386506],"genre_scores_gemma":[0.7565402,0.043724917,0.12843674,0.009029212,0.0047480296,0.001013367,0.0009169044,0.00025274244,0.055337843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964133,0.00091051083,0.00022703,0.0004197327,0.0016485697,0.00038094557],"domain_scores_gemma":[0.99660814,0.0013935267,0.0003882409,0.00085619127,0.0005759825,0.00017796812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028940511,0.0009500228,0.00055753585,0.0009864433,0.0017317036,0.0044358643,0.0015595818,0.003853626,0.006532961],"category_scores_gemma":[0.008339484,0.000416535,0.0004887175,0.00093712844,0.003469352,0.007360618,0.0036772038,0.0045773326,0.0024290946],"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.00008175654,0.000027013437,0.00025305134,0.00025181586,0.000016497761,0.00022033464,0.00021830955,0.0044437675,0.0024726533,0.9357519,0.014353332,0.041909605],"study_design_scores_gemma":[0.000045924953,0.00008429654,0.00036857507,0.0006442363,0.000021959155,0.0008254568,0.00016467906,0.050228987,0.0022207666,0.6879323,0.25741604,0.000046717167],"about_ca_topic_score_codex":0.00116987,"about_ca_topic_score_gemma":0.0006710997,"teacher_disagreement_score":0.006532961,"about_ca_system_score_codex":0.0019274905,"about_ca_system_score_gemma":0.002308972,"threshold_uncertainty_score":0.021854937},"labels":[],"label_agreement":null},{"id":"W2075023189","doi":"10.1002/sec.227","title":"Medical biometrics in mobile health monitoring","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Biometrics; Anonymity; Dependency (UML); Field (mathematics); Computer security; Protocol (science); Mobile device; Matching (statistics); Feature (linguistics); Human–computer interaction; Artificial intelligence; World Wide Web","score_opus":0.013015939429828658,"score_gpt":0.3252189151725061,"score_spread":0.31220297574267747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075023189","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.1575343,0.01541829,0.7998234,0.002528686,0.00076988,0.00021672017,0.00032216005,0.0013198903,0.02206662],"genre_scores_gemma":[0.86938876,0.0035276907,0.119518906,0.00036487437,0.00035399527,0.0000842899,0.00014671289,0.000025414987,0.0065892334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986926,0.00063599186,0.000058428916,0.00019726023,0.00036139673,0.00005424217],"domain_scores_gemma":[0.9988747,0.00054394716,0.00017083995,0.00019664364,0.00017166094,0.000042119107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011315198,0.0003425185,0.00044164492,0.0007492401,0.00029135452,0.0011770193,0.00043324477,0.00112648,0.0024625058],"category_scores_gemma":[0.0024225195,0.00017029389,0.00018836069,0.00082262896,0.00054250157,0.00091527886,0.00078015897,0.000542119,0.0012307339],"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.0009424693,0.00021545426,0.014861663,0.0005404827,0.000107794796,0.0012991362,0.0004544762,0.02562711,0.14027193,0.0368176,0.0067961677,0.77206576],"study_design_scores_gemma":[0.00013400213,0.0017577439,0.044144526,0.00058524427,0.00023271293,0.0108967805,0.000629887,0.597529,0.16153581,0.0537143,0.12859535,0.0002445706],"about_ca_topic_score_codex":0.00032089217,"about_ca_topic_score_gemma":0.00021871387,"teacher_disagreement_score":0.0024625058,"about_ca_system_score_codex":0.00026944498,"about_ca_system_score_gemma":0.00016473241,"threshold_uncertainty_score":0.008237898},"labels":[],"label_agreement":null},{"id":"W2075371926","doi":"10.1002/sec.164","title":"Enhancing identity trust in cryptographic key management systems for dynamic environments","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Collusion; Computer science; Key management; Key (lock); Computer security; Heuristic; Cryptography; Key distribution; The Internet; Access control; Encryption; Computer network; Public-key cryptography; World Wide Web","score_opus":0.00574118533029021,"score_gpt":0.23189397823265137,"score_spread":0.22615279290236115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075371926","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.16885927,0.00031549437,0.8256469,0.00049037364,0.000052987223,0.00016796385,0.00003184123,0.0013355681,0.0030995493],"genre_scores_gemma":[0.91444635,0.00006506019,0.084595315,0.00003507589,0.000014216531,0.000033343775,0.000029559375,0.000028044526,0.0007530082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689627,0.0012275259,0.0002545673,0.00031908342,0.00080581266,0.0004967193],"domain_scores_gemma":[0.9908165,0.0037947912,0.0014254032,0.0025451682,0.0009864139,0.00043181347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037058496,0.0005569485,0.0009467843,0.00085820607,0.0013023069,0.0021876476,0.0017798295,0.0011378017,0.0016405929],"category_scores_gemma":[0.012395547,0.00041629642,0.0003725196,0.0010589537,0.0013535699,0.005166236,0.0048630745,0.0014420309,0.00057867053],"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.0019990513,0.0006455192,0.005694251,0.0002781405,0.00010525869,0.0005695622,0.000962052,0.4532028,0.04496177,0.13783859,0.003764081,0.34997895],"study_design_scores_gemma":[0.000064197964,0.00013706279,0.0002788574,0.00001127387,0.000018434608,0.0001474709,0.00010010891,0.9616096,0.013958197,0.021526376,0.0021238977,0.000024473762],"about_ca_topic_score_codex":0.0011487877,"about_ca_topic_score_gemma":0.0008207721,"teacher_disagreement_score":0.0037058496,"about_ca_system_score_codex":0.0019403682,"about_ca_system_score_gemma":0.0015526303,"threshold_uncertainty_score":0.019598603},"labels":[],"label_agreement":null},{"id":"W2079343138","doi":"10.1002/sec.34","title":"Special Issue on “Security and Privacy Preservation in Vehicular Communications” Wiley's Security and Communication Networks Journal","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Computer science; Computer security; Vehicular ad hoc network; Vehicular communication systems; Wireless ad hoc network; Process (computing); License; Vehicle-to-vehicle; Event (particle physics); Intelligent transportation system; Wireless; Internet privacy; Telecommunications; Computer network; Transport engineering; Engineering","score_opus":0.01159418239140605,"score_gpt":0.22158733114483506,"score_spread":0.209993148753429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079343138","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012541532,0.07272381,0.007895382,0.035649117,0.82981837,0.00040681614,0.0006348015,0.0007370255,0.050880525],"genre_scores_gemma":[0.009752818,0.1624371,0.005786912,0.013802973,0.59040725,0.00042037872,0.002381695,0.001714732,0.21329616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99338114,0.00079041085,0.00067389815,0.0007154737,0.0038980013,0.00054095656],"domain_scores_gemma":[0.9715873,0.006164977,0.0015615973,0.0018085949,0.015589478,0.0032880865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006266436,0.0017302461,0.0020661387,0.0093784435,0.0019692313,0.0065141064,0.002999438,0.0039680176,0.055286244],"category_scores_gemma":[0.015114749,0.0007400249,0.0014809206,0.0047599864,0.0015666992,0.0061832597,0.0032469805,0.004334312,0.028556988],"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.000028444634,0.000055301403,0.00011271528,0.0009482626,0.000021312053,0.00016751194,0.000038690865,0.00025949065,0.0006461605,0.002967918,0.9282776,0.06647653],"study_design_scores_gemma":[0.000005819984,0.000046683403,0.00030286165,0.0005567913,0.000017879516,0.00028324465,0.000044666045,0.0003860085,0.00030958024,0.0016132316,0.9964144,0.000018696],"about_ca_topic_score_codex":0.0019213458,"about_ca_topic_score_gemma":0.0029094229,"teacher_disagreement_score":0.055286244,"about_ca_system_score_codex":0.0024864173,"about_ca_system_score_gemma":0.006224398,"threshold_uncertainty_score":0.18495089},"labels":[],"label_agreement":null},{"id":"W2086454083","doi":"10.1002/sec.33","title":"Security impacts on establishing MPLS/BGP VPNs","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Software-Defined Networks and 5G","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 Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Private network; Service provider; Computer security; IPsec; Enhanced Data Rates for GSM Evolution; The Internet; Service (business); Telecommunications; Quality of service; Business; World Wide Web","score_opus":0.016341186695130572,"score_gpt":0.22918171020796674,"score_spread":0.21284052351283617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086454083","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.9896847,0.000093788796,0.007273648,0.00010145745,0.000021789094,0.00005804322,0.000053413256,0.00024107464,0.0024721615],"genre_scores_gemma":[0.996845,0.0000393404,0.0028432112,0.000010904034,0.0000028471086,0.000010241164,0.000060321167,0.000012452262,0.00017557733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997552,0.0009826272,0.00013433439,0.0001524358,0.0007964436,0.00038223586],"domain_scores_gemma":[0.99004424,0.0056249336,0.0012066255,0.0011695707,0.0015658707,0.0003886842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244752,0.0004557195,0.00024519433,0.0005388439,0.0009546326,0.0011818897,0.00059915765,0.0005235955,0.0011053229],"category_scores_gemma":[0.011698025,0.00026892836,0.00014492084,0.0004029872,0.0008863135,0.0014303379,0.000779885,0.0006192116,0.00021199389],"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.004661296,0.0013670807,0.053964853,0.0003654662,0.00016118166,0.0020734314,0.0010101667,0.4841011,0.35596475,0.024101174,0.002640202,0.069589406],"study_design_scores_gemma":[0.00015474524,0.0027313118,0.015939606,0.000043937656,0.00014268572,0.00085850415,0.0007987648,0.6137083,0.3572329,0.005152042,0.0031760538,0.000061117506],"about_ca_topic_score_codex":0.003182859,"about_ca_topic_score_gemma":0.0018325548,"teacher_disagreement_score":0.003182859,"about_ca_system_score_codex":0.0013883858,"about_ca_system_score_gemma":0.00061459583,"threshold_uncertainty_score":0.012943864},"labels":[],"label_agreement":null},{"id":"W2086883455","doi":"10.1002/sec.122","title":"PCM: a privacy‐preserving detection mechanism in mobile<i>ad hoc</i>networks","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Anonymity; Computer security; Witness; Revocation; Mobile ad hoc network; Wireless ad hoc network; Internet privacy; Vehicular ad hoc network; Computer network; Overhead (engineering); Network packet; Telecommunications; Wireless","score_opus":0.014217983268027224,"score_gpt":0.2499924887752912,"score_spread":0.23577450550726398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086883455","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.06938408,0.0007103058,0.92105615,0.00082679855,0.0001832315,0.0003294885,0.0001329309,0.0025808236,0.0047961585],"genre_scores_gemma":[0.8890934,0.00038695734,0.107225135,0.00029998584,0.00014077677,0.00019014318,0.0001173274,0.00004553077,0.0025007227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846447,0.00054263073,0.000099796256,0.00023371754,0.0005319232,0.0001275074],"domain_scores_gemma":[0.996356,0.0012247027,0.0008140644,0.0010443408,0.0003688094,0.00019207459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002575352,0.00042197495,0.00052295555,0.00072717393,0.0010023849,0.001443828,0.0017990464,0.0011226754,0.0010834535],"category_scores_gemma":[0.0057091736,0.00026044578,0.0003877161,0.00070667494,0.001708666,0.0029261266,0.0029857587,0.0009290175,0.00031919143],"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.0020443143,0.0004916832,0.007326125,0.0008079441,0.00017506628,0.0021776694,0.0018998038,0.122746624,0.0971404,0.34302992,0.016693346,0.40546703],"study_design_scores_gemma":[0.00022911721,0.0013004214,0.0014655987,0.00010894474,0.00010664872,0.00215498,0.00029914695,0.8053349,0.062014557,0.08277807,0.044091407,0.000116187395],"about_ca_topic_score_codex":0.00038387577,"about_ca_topic_score_gemma":0.00021412282,"teacher_disagreement_score":0.002575352,"about_ca_system_score_codex":0.00048349958,"about_ca_system_score_gemma":0.00089908054,"threshold_uncertainty_score":0.013619959},"labels":[],"label_agreement":null},{"id":"W2100509127","doi":"10.1002/sec.40","title":"Enforcing patient privacy in healthcare WSNs through key distribution algorithms","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Cryptography; Elliptic curve cryptography; Key (lock); Session key; Computer security; Key distribution; Key generation; Computer network; Wireless sensor network; Algorithm; Public-key cryptography; Encryption","score_opus":0.019078756766280146,"score_gpt":0.24690316276150018,"score_spread":0.22782440599522003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100509127","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.042750664,0.00023361098,0.95458114,0.00043964465,0.000032819164,0.00009219227,0.000026699052,0.00044425364,0.0013989377],"genre_scores_gemma":[0.7420203,0.00031868968,0.25573283,0.0001269474,0.000044050197,0.00014557534,0.000066293374,0.00005608337,0.0014891534],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996869,0.0017837865,0.000237151,0.00031122295,0.0006225833,0.00017624036],"domain_scores_gemma":[0.9934576,0.0035599375,0.00089126185,0.001335149,0.00060686015,0.00014912126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050599263,0.00044935656,0.0006288047,0.0005779576,0.0006303873,0.0013853123,0.0010812733,0.0009417219,0.0012081227],"category_scores_gemma":[0.008414596,0.000261276,0.00032878388,0.00068392,0.0014869708,0.0027845732,0.00217567,0.0008692945,0.00049182004],"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.0019022779,0.0004473232,0.0074342857,0.00041532278,0.00015349191,0.0007364331,0.0011543754,0.3467006,0.08304266,0.18408835,0.0044886954,0.36943612],"study_design_scores_gemma":[0.00021017552,0.00025158268,0.0007312555,0.000044238455,0.00004285641,0.000593073,0.0001642876,0.87113315,0.0502483,0.0691913,0.0073486823,0.00004112406],"about_ca_topic_score_codex":0.00028734404,"about_ca_topic_score_gemma":0.00017629574,"teacher_disagreement_score":0.0050599263,"about_ca_system_score_codex":0.00073440984,"about_ca_system_score_gemma":0.0009677841,"threshold_uncertainty_score":0.026759803},"labels":[],"label_agreement":null},{"id":"W2101007911","doi":"10.1002/sec.213","title":"Digital credentials with privacy‐preserving delegation","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","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 Ottawa; Carleton University","funders":"","keywords":"Computer science; Collusion; Delegation; Computer security; Malice; Certification; Security token; Cryptography; Certificate authority; Verifiable secret sharing; Public-key cryptography; Law; Encryption; Business","score_opus":0.005260355041786379,"score_gpt":0.20968399751026207,"score_spread":0.2044236424684757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101007911","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.031580236,0.0007687381,0.9428812,0.0013241487,0.00037157795,0.00019843306,0.00015123296,0.0011098882,0.021614473],"genre_scores_gemma":[0.8447667,0.0006249818,0.14136904,0.00036560712,0.00035563213,0.00016112391,0.00015886693,0.000115692295,0.012082456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923534,0.002368194,0.0006825611,0.0009950867,0.0028986032,0.00070217106],"domain_scores_gemma":[0.9899672,0.002354534,0.0008557774,0.00543026,0.00076426275,0.00062795356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047074696,0.00051637244,0.0006461445,0.0010791704,0.0013634423,0.0045432188,0.0016680538,0.0013904043,0.004692375],"category_scores_gemma":[0.012020667,0.00045432628,0.0009432795,0.0013792844,0.004658383,0.008030164,0.007956848,0.0024053117,0.0018130825],"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.00047612804,0.00012856096,0.00072383054,0.00025358394,0.00004475028,0.00043442572,0.00051771343,0.016589994,0.010528579,0.8693116,0.0036643404,0.09732656],"study_design_scores_gemma":[0.00027155376,0.00026455303,0.00044984906,0.00015654574,0.00009240825,0.00168373,0.00014375929,0.14037794,0.043364193,0.70410675,0.10897145,0.00011723068],"about_ca_topic_score_codex":0.00046990367,"about_ca_topic_score_gemma":0.0002240807,"teacher_disagreement_score":0.0047074696,"about_ca_system_score_codex":0.0012967162,"about_ca_system_score_gemma":0.0015655145,"threshold_uncertainty_score":0.024895787},"labels":[],"label_agreement":null},{"id":"W2109121943","doi":"10.1002/sec.561","title":"SDRP: a secure distributed revocation protocol for vehicular environments","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","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 Ottawa","funders":"","keywords":"Revocation; Computer science; Denial-of-service attack; Computer network; Computer security; Protocol (science); Routing protocol; Vehicular ad hoc network; Cryptographic protocol; Wireless ad hoc network; Cryptography; Routing (electronic design automation); The Internet; Wireless; Telecommunications; Overhead (engineering)","score_opus":0.01611736481959449,"score_gpt":0.2688111127443309,"score_spread":0.2526937479247364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109121943","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.02097666,0.0007334702,0.96782494,0.00022806689,0.00022776605,0.00036375897,0.000118964126,0.005218658,0.0043077487],"genre_scores_gemma":[0.6814458,0.001106211,0.3053154,0.00027518024,0.00014265791,0.0008041282,0.0009832991,0.00045226817,0.009475076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.0003506946,0.0001463461,0.000118887336,0.00039902425,0.00010371061],"domain_scores_gemma":[0.99892753,0.00023853395,0.00016514935,0.00031998707,0.0002550247,0.000093674586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014469622,0.00047070187,0.000609433,0.00084878894,0.00047179233,0.0010050965,0.0015553478,0.0008728486,0.0017209117],"category_scores_gemma":[0.0022878,0.00032854854,0.00046649753,0.0004937445,0.0009829262,0.0016827639,0.002359544,0.0012060938,0.0009534482],"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.0015611032,0.0003641635,0.002065127,0.0012847678,0.00031015405,0.0021375571,0.0012498088,0.13919786,0.13354196,0.2012367,0.023893917,0.49315685],"study_design_scores_gemma":[0.00062924233,0.0011351318,0.0008763559,0.00016013629,0.00019527868,0.0024406868,0.00024285958,0.6901632,0.05838634,0.045796353,0.19971246,0.00026200182],"about_ca_topic_score_codex":0.00052111474,"about_ca_topic_score_gemma":0.00040999305,"teacher_disagreement_score":0.0017209117,"about_ca_system_score_codex":0.00030444723,"about_ca_system_score_gemma":0.00068037305,"threshold_uncertainty_score":0.0076523423},"labels":[],"label_agreement":null},{"id":"W2109586982","doi":"10.1002/sec.1333","title":"Impact of secondary user communication on security communication of primary user","year":2015,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Transmitter; Secrecy; Transmitter power output; Cognitive radio; Constraint (computer-aided design); Channel (broadcasting); Context (archaeology); Computer network; Interference (communication); Topology (electrical circuits); Telecommunications; Computer security; Wireless; Mathematics","score_opus":0.016607863575978963,"score_gpt":0.25765576943785895,"score_spread":0.24104790586188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109586982","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.6448172,0.0021941527,0.30305916,0.0010894787,0.0002934866,0.00008105082,0.00023276026,0.0004234558,0.047809277],"genre_scores_gemma":[0.9981166,0.00018674943,0.0011394189,0.000028281527,0.000022083053,0.00000762972,0.00001030273,0.000007575082,0.00048130527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981522,0.0007551528,0.000041466163,0.00016048472,0.0004915049,0.00039914166],"domain_scores_gemma":[0.99175185,0.0055178874,0.0007140489,0.0005993681,0.0011269201,0.00028984874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012738549,0.0010175921,0.0010576411,0.00046915447,0.0009483714,0.0016430417,0.0005754884,0.0009826889,0.0040146457],"category_scores_gemma":[0.008027938,0.00027019874,0.00053625717,0.00038359646,0.0013943186,0.0010448726,0.0018710499,0.00092645147,0.00042635822],"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.0010850461,0.0001696392,0.017329449,0.0005238003,0.0002028982,0.003901315,0.0005334487,0.8028144,0.056108885,0.08238648,0.0026729945,0.032271616],"study_design_scores_gemma":[0.000027110498,0.0004653427,0.004327,0.000058227284,0.00013857831,0.0014540448,0.00019516434,0.95856583,0.016982809,0.016286138,0.0014489786,0.000050747567],"about_ca_topic_score_codex":0.0018510151,"about_ca_topic_score_gemma":0.0009669639,"teacher_disagreement_score":0.0040146457,"about_ca_system_score_codex":0.0010716353,"about_ca_system_score_gemma":0.001082458,"threshold_uncertainty_score":0.013430297},"labels":[],"label_agreement":null},{"id":"W2110769230","doi":"10.1002/sec.895","title":"CIT: A credit‐based incentive tariff scheme with fraud‐traceability for smart grid","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tariff; Incentive; Computer science; Traceability; Smart grid; Database transaction; Economic shortage; Computer security; Demand response; Power (physics); Business; Environmental economics; Microeconomics; Electricity; Government (linguistics); Economics; Database; Electrical engineering","score_opus":0.004988190215180597,"score_gpt":0.17795197697595788,"score_spread":0.17296378676077728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110769230","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.08203615,0.0005574514,0.9013704,0.0014034428,0.00045046813,0.0009664801,0.0002685334,0.0015038017,0.011443316],"genre_scores_gemma":[0.94838655,0.00015545549,0.04740283,0.00023624353,0.00011793971,0.00016960283,0.00011032153,0.000029280785,0.0033917543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956065,0.0016814995,0.0002385094,0.00043955553,0.0013613874,0.00067248143],"domain_scores_gemma":[0.99181056,0.0025033767,0.001392393,0.0021110016,0.0015517084,0.00063090643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045143445,0.0008373855,0.0012482663,0.0016069907,0.0014885581,0.0019074496,0.0037509028,0.002500299,0.0042465343],"category_scores_gemma":[0.011309594,0.00028279607,0.0007728802,0.0023301644,0.002286526,0.003823245,0.0035174433,0.0024942115,0.00075802143],"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.0028583063,0.001074979,0.0046660374,0.0004261572,0.00019259551,0.0015067877,0.00038943815,0.31932956,0.022511099,0.35065022,0.020603072,0.27579176],"study_design_scores_gemma":[0.00022448825,0.00039859573,0.0005254363,0.000037631708,0.000042069376,0.00064765825,0.000047664395,0.92049015,0.0051357998,0.06505484,0.007305694,0.00009003784],"about_ca_topic_score_codex":0.0014587478,"about_ca_topic_score_gemma":0.0009215298,"teacher_disagreement_score":0.0045143445,"about_ca_system_score_codex":0.0020018762,"about_ca_system_score_gemma":0.0023038348,"threshold_uncertainty_score":0.023874462},"labels":[],"label_agreement":null},{"id":"W2120314095","doi":"10.1002/sec.1070","title":"Protect biometric data with compound chaotic encryption","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hamilton Regional Laboratory Medicine Program","funders":"","keywords":"Computer science; Encryption; Biometrics; Chaotic; Cryptosystem; Cipher; Cryptography; Theoretical computer science; Scrambling; Key space; Ciphertext; Symmetric-key algorithm; Data mining; Algorithm; Computer security; Artificial intelligence; Public-key cryptography","score_opus":0.019887611179617033,"score_gpt":0.24066584263813656,"score_spread":0.22077823145851952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120314095","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.30512464,0.0006741626,0.6849527,0.000342329,0.00012696469,0.00010922101,0.00018670343,0.0005017391,0.007981549],"genre_scores_gemma":[0.94322115,0.00029153307,0.05272282,0.00005254443,0.000037223854,0.00003745167,0.000114650764,0.00002859866,0.003493951],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966896,0.000057401547,0.000026278138,0.000053503412,0.00016037429,0.000033400574],"domain_scores_gemma":[0.99965894,0.000082121376,0.00006907153,0.00011133127,0.00006389316,0.000014622813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028735088,0.0003171246,0.00038377606,0.00043166894,0.00025741378,0.00046982104,0.00030260015,0.0004549311,0.0019737799],"category_scores_gemma":[0.0008857458,0.00011664851,0.00039722183,0.0004604946,0.00032447177,0.0010818692,0.00085227995,0.00034226666,0.0006173057],"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.0011551339,0.00013224024,0.0025972065,0.00042354627,0.00014433185,0.00096700195,0.0003423944,0.07460848,0.6134479,0.09257188,0.002750453,0.21085939],"study_design_scores_gemma":[0.00009560156,0.000493443,0.002213659,0.000046082303,0.000076163895,0.0022315378,0.00009635863,0.58580524,0.364714,0.033307023,0.010856207,0.00006458696],"about_ca_topic_score_codex":0.00015771243,"about_ca_topic_score_gemma":0.00008685863,"teacher_disagreement_score":0.0019737799,"about_ca_system_score_codex":0.00025577855,"about_ca_system_score_gemma":0.00031740346,"threshold_uncertainty_score":0.006602943},"labels":[],"label_agreement":null},{"id":"W2121320520","doi":"10.1002/sec.134","title":"Performance analysis of secure on‐demand services for wireless vehicular networks","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer network; Scalability; Latency (audio); Software deployment; Wireless; Service (business); Computer security; Telecommunications","score_opus":0.006859344815508339,"score_gpt":0.22848109043565734,"score_spread":0.221621745620149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121320520","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.9450336,0.0005203651,0.04916624,0.00024729493,0.00002490203,0.00006174154,0.000095422096,0.0001540855,0.0046963324],"genre_scores_gemma":[0.99872786,0.00006606495,0.0009089522,0.000004340638,0.0000031940542,0.000006971508,0.000028902683,0.0000061467276,0.00024749624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986156,0.00042165507,0.000039921022,0.0000725435,0.0005719101,0.00027841618],"domain_scores_gemma":[0.9945962,0.003257027,0.00046564857,0.0003539072,0.001195458,0.00013185017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018949683,0.00059402315,0.0003898539,0.0008228414,0.00039657328,0.00089512643,0.0005490724,0.00042817742,0.0012360247],"category_scores_gemma":[0.008208952,0.00018375584,0.0002501052,0.0006647884,0.000505617,0.0007707132,0.0006785031,0.00038303845,0.00017299497],"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.00067454984,0.000078811405,0.0064063077,0.000077034,0.00003900912,0.00011385982,0.00007258605,0.9510734,0.009403928,0.0097980015,0.000649226,0.021613285],"study_design_scores_gemma":[0.0000063028892,0.000119649645,0.0011780447,0.0000020540224,0.000009433071,0.000038231126,0.00004010246,0.99503446,0.0024091443,0.0009946675,0.00016263135,0.0000053362305],"about_ca_topic_score_codex":0.007559287,"about_ca_topic_score_gemma":0.0039669042,"teacher_disagreement_score":0.007559287,"about_ca_system_score_codex":0.0025656011,"about_ca_system_score_gemma":0.00082319474,"threshold_uncertainty_score":0.018614888},"labels":[],"label_agreement":null},{"id":"W2127303209","doi":"10.1002/sec.136","title":"Achieving non‐transferability in credential systems using hidden biometrics","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Credential; Computer science; Computer security; Transferability; Biometrics; Key (lock); Oblivious transfer; Internet privacy; Cryptography; Machine learning","score_opus":0.015153823852515605,"score_gpt":0.2558492834808932,"score_spread":0.2406954596283776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127303209","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.136827,0.00029833795,0.8534454,0.0007417372,0.00007980333,0.000107496555,0.000033499255,0.00061726576,0.007849402],"genre_scores_gemma":[0.9716635,0.000071946124,0.026029339,0.00008019751,0.000039958977,0.00005932311,0.00002057069,0.000024591405,0.0020106381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929134,0.0026128152,0.000476231,0.0009405422,0.0021978244,0.0008592256],"domain_scores_gemma":[0.97720146,0.010289333,0.0016938867,0.009123818,0.0010619778,0.00062956294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004580384,0.00048968766,0.000949081,0.0006646696,0.0013413638,0.002652059,0.0019015879,0.0021046374,0.0037144772],"category_scores_gemma":[0.015638532,0.00040546726,0.0006741102,0.0007124029,0.005538252,0.007378942,0.007960007,0.0032231063,0.0010603883],"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.00116178,0.00040474997,0.0017667469,0.0002659238,0.00009169819,0.00085641694,0.0011677067,0.08590129,0.05686197,0.73235744,0.0018542632,0.117310055],"study_design_scores_gemma":[0.00015541572,0.00033558786,0.00055879884,0.000060992406,0.00003377562,0.0004878906,0.00013323477,0.46665806,0.05680197,0.46915093,0.0055453517,0.00007806019],"about_ca_topic_score_codex":0.00027347592,"about_ca_topic_score_gemma":0.000107542706,"teacher_disagreement_score":0.004580384,"about_ca_system_score_codex":0.0010631649,"about_ca_system_score_gemma":0.0009298929,"threshold_uncertainty_score":0.024223626},"labels":[],"label_agreement":null},{"id":"W2127915437","doi":"10.1002/sec.274","title":"An efficient and provably secure public key encryption scheme based on coding theory","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Encryption; Scheme (mathematics); Theoretical computer science; Key (lock); Computer security; Coding (social sciences); Mathematics","score_opus":0.007862790053958521,"score_gpt":0.2289051696302583,"score_spread":0.2210423795762998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127915437","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.032071486,0.0005018826,0.9552191,0.00096200645,0.00019970958,0.00032883018,0.00026816005,0.0005864984,0.0098623475],"genre_scores_gemma":[0.7180505,0.0006752368,0.27081507,0.00038277212,0.00013404716,0.0005244791,0.00052568293,0.000067390094,0.008824871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980471,0.0005830899,0.00012052828,0.00021138207,0.00079263555,0.00024530853],"domain_scores_gemma":[0.9988701,0.00038187482,0.00015645583,0.00031633562,0.00020308577,0.00007211557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127691,0.00052090787,0.0007245706,0.0007672624,0.00076251914,0.0013995289,0.0012592654,0.0012170792,0.0020777993],"category_scores_gemma":[0.002099561,0.00027065276,0.0006844697,0.0012057849,0.0012089993,0.002495956,0.0026672941,0.0017375463,0.00057328946],"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.00034302496,0.00017191035,0.00039618395,0.00037401676,0.000086222775,0.000528559,0.00031518578,0.038236562,0.045194477,0.8384733,0.0054505467,0.07042992],"study_design_scores_gemma":[0.0005837901,0.0004022821,0.00050282554,0.00015059691,0.00012614334,0.0012855888,0.000104742394,0.5237128,0.06853994,0.36800072,0.036381945,0.00020871872],"about_ca_topic_score_codex":0.000499267,"about_ca_topic_score_gemma":0.00039013792,"teacher_disagreement_score":0.0020777993,"about_ca_system_score_codex":0.0009870722,"about_ca_system_score_gemma":0.0019672615,"threshold_uncertainty_score":0.0071617365},"labels":[],"label_agreement":null},{"id":"W2133585005","doi":"10.1002/sec.1155","title":"An effective behavior‐based Android malware detection system","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Malware; Computer science; Android malware; Android (operating system); Naive Bayes classifier; Decision tree; Machine learning; System call; Artificial intelligence; Static analysis; Support vector machine; Malware analysis; Operating system; Data mining; Programming language","score_opus":0.003457833976353953,"score_gpt":0.22770990474491526,"score_spread":0.2242520707685613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133585005","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.4343568,0.00156002,0.356277,0.00083113596,0.00041278978,0.0009602699,0.001695459,0.19452707,0.009379418],"genre_scores_gemma":[0.8609626,0.0002258174,0.13179983,0.00041011008,0.000089444686,0.00019489453,0.0012123311,0.00038015132,0.004724743],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930155,0.00009163304,0.00007185983,0.0001750473,0.0003055163,0.000054374403],"domain_scores_gemma":[0.99855,0.0002808617,0.00018614154,0.0002082447,0.00066057703,0.00011421581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049553526,0.0008751192,0.00090624404,0.0030387177,0.00052737887,0.0007472468,0.00090244535,0.0006325666,0.0015314361],"category_scores_gemma":[0.0017415781,0.00037246547,0.00039500938,0.00056530745,0.00021281856,0.0012456973,0.00074919435,0.0005080773,0.0014806582],"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.0011213153,0.001101103,0.03183414,0.00043520844,0.0002661779,0.0011190142,0.00036003636,0.007537911,0.17046224,0.0020687694,0.02307229,0.7606218],"study_design_scores_gemma":[0.00012790458,0.00064951373,0.02675976,0.00008495624,0.00026037896,0.0019465333,0.0001364151,0.8027259,0.14728968,0.0018585639,0.017956933,0.00020342215],"about_ca_topic_score_codex":0.0021020323,"about_ca_topic_score_gemma":0.0016089986,"teacher_disagreement_score":0.0030387177,"about_ca_system_score_codex":0.00044287424,"about_ca_system_score_gemma":0.00067368825,"threshold_uncertainty_score":0.0051231384},"labels":[],"label_agreement":null},{"id":"W2140811101","doi":"10.1002/sec.1082","title":"ReDD: recommendation‐based data dissemination in privacy‐preserving mobile social networks","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Dissemination; Computer security; Network packet; Authentication (law); Internet privacy; Computer network; Protocol (science); Social network (sociolinguistics); Confidentiality; Quality (philosophy); Mobile phone; World Wide Web; Social media; Telecommunications","score_opus":0.02557547304041716,"score_gpt":0.2935082090601328,"score_spread":0.2679327360197156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140811101","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.03713148,0.0012892823,0.9537785,0.00095602224,0.00018469508,0.00060858624,0.00043382117,0.0025995173,0.0030181108],"genre_scores_gemma":[0.7876751,0.0007375167,0.20474957,0.00044552085,0.00014487034,0.00051257893,0.00054222316,0.000057087203,0.005135534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960681,0.0014276092,0.00037311978,0.00072533346,0.0011239081,0.00028199173],"domain_scores_gemma":[0.9938676,0.0022737423,0.0007486923,0.0017294304,0.0010797225,0.00030085156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038218847,0.0007329206,0.0012469621,0.0016110076,0.0013958067,0.0012690024,0.002456503,0.001817855,0.0015236237],"category_scores_gemma":[0.008205742,0.00047294394,0.00084386405,0.0017654946,0.0008167303,0.0027888333,0.0027948644,0.001262179,0.00059798587],"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.0017165208,0.0006999936,0.008632847,0.0009537413,0.00062574976,0.0014736876,0.0012263755,0.31570095,0.048771754,0.053278293,0.020239288,0.5466808],"study_design_scores_gemma":[0.00013751273,0.00032108,0.0008473186,0.000028705836,0.000065870685,0.00040619448,0.0001605269,0.9632806,0.0101917405,0.013026163,0.011460302,0.00007397245],"about_ca_topic_score_codex":0.004147482,"about_ca_topic_score_gemma":0.003365109,"teacher_disagreement_score":0.004147482,"about_ca_system_score_codex":0.0011614563,"about_ca_system_score_gemma":0.001344713,"threshold_uncertainty_score":0.020212293},"labels":[],"label_agreement":null},{"id":"W2141890985","doi":"10.1002/sec.416","title":"Revisiting network scanning detection using sequential hypothesis testing","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; False positive paradox; Stateful firewall; Feature (linguistics); Transient (computer programming); The Internet; Data mining; Artificial intelligence; Algorithm; Computer network; Network packet; World Wide Web","score_opus":0.04519366874470275,"score_gpt":0.25663835170469707,"score_spread":0.2114446829599943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141890985","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.23737012,0.00027369676,0.7582762,0.00062674616,0.000093140756,0.00034366525,0.00017857621,0.0017775588,0.0010601901],"genre_scores_gemma":[0.8289457,0.000052308667,0.17008503,0.00012419642,0.000050361636,0.00016771947,0.00024592367,0.000042502845,0.0002861443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9824991,0.010866061,0.00094256364,0.002418054,0.0028341273,0.0004399735],"domain_scores_gemma":[0.8304207,0.15021098,0.0065733716,0.0056859106,0.0062786904,0.00083043356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018989611,0.0010207235,0.0016520945,0.0031954022,0.00065389875,0.0018873645,0.003286349,0.0015349033,0.0013742901],"category_scores_gemma":[0.08766079,0.0005342112,0.0009967943,0.0020457658,0.0014767972,0.0026748409,0.0011031701,0.00159362,0.00035042138],"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.0012908002,0.001042244,0.14819,0.0005403444,0.0009589275,0.0007880359,0.00055180205,0.24077952,0.009963033,0.015158983,0.003929292,0.576807],"study_design_scores_gemma":[0.00003139546,0.00018810206,0.0027595132,0.000011795618,0.000030358537,0.00013507895,0.000040426185,0.989416,0.0019392116,0.0051864604,0.00024733122,0.000014257992],"about_ca_topic_score_codex":0.0028399657,"about_ca_topic_score_gemma":0.0027707706,"teacher_disagreement_score":0.018989611,"about_ca_system_score_codex":0.00083095673,"about_ca_system_score_gemma":0.0019866622,"threshold_uncertainty_score":0.100427866},"labels":[],"label_agreement":null},{"id":"W2166363051","doi":"10.1002/sec.150","title":"PAPA‐UIC: a design approach and a framework for secure mobile<i>ad hoc</i>networks","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","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 Windsor","funders":"","keywords":"Key escrow; Computer science; Computer security; Mobile ad hoc network; Cryptography; Computer network; Optimized Link State Routing Protocol; Network packet; Routing protocol; Public-key cryptography; Encryption","score_opus":0.0160787962579281,"score_gpt":0.2511120003558638,"score_spread":0.23503320409793568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166363051","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.0017525975,0.0004806974,0.9891093,0.0006199626,0.00013751541,0.00024753198,0.000023518529,0.0013639693,0.0062649935],"genre_scores_gemma":[0.09933057,0.0010856058,0.88757867,0.00048598356,0.00015509449,0.0009359734,0.00012581104,0.000259538,0.0100427745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998099,0.0006119941,0.00012969521,0.00023888567,0.0007230928,0.00019736498],"domain_scores_gemma":[0.998898,0.00018462208,0.000118896365,0.00030448296,0.00032933854,0.00016469182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034990995,0.00092715654,0.00048073762,0.0009854593,0.0014510129,0.0037818342,0.0029008577,0.0019475986,0.0021720787],"category_scores_gemma":[0.0032722123,0.00081251876,0.0009007714,0.00058530946,0.0029917806,0.0035801867,0.0027553744,0.002795586,0.0012739968],"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.000067803376,0.000072180235,0.00046069679,0.00035488638,0.0000331207,0.0005342031,0.0006702587,0.022250485,0.007805666,0.86434436,0.009750511,0.09365577],"study_design_scores_gemma":[0.00008922166,0.00045476801,0.0002778409,0.0004323888,0.00011375669,0.0017922265,0.0003073394,0.37779054,0.024143383,0.22325417,0.37122524,0.000119073055],"about_ca_topic_score_codex":0.0018491503,"about_ca_topic_score_gemma":0.0011382066,"teacher_disagreement_score":0.0037818342,"about_ca_system_score_codex":0.0014513736,"about_ca_system_score_gemma":0.0039720587,"threshold_uncertainty_score":0.018505275},"labels":[],"label_agreement":null},{"id":"W2289940563","doi":"10.1002/sec.1462","title":"Binary field multiplication on ARMv8","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Residue Arithmetic","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":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Institute for Information and Communications Technology Promotion","keywords":"Multiplication (music); Computer science; Binary number; Arithmetic; Field (mathematics); Polynomial; Parallel computing; Mathematics; Combinatorics; Pure mathematics","score_opus":0.007696747809404457,"score_gpt":0.22526052389978984,"score_spread":0.21756377609038538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289940563","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.46604642,0.0014253411,0.4646789,0.00043793488,0.00030685094,0.0001416724,0.00029979047,0.0076913936,0.058971725],"genre_scores_gemma":[0.9102914,0.0001865635,0.07936944,0.000078527104,0.000039782015,0.00005312538,0.00020631524,0.00010886077,0.009665957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.0000932363,0.000028312075,0.000065218046,0.00014185769,0.000091615366],"domain_scores_gemma":[0.99965596,0.00007115958,0.000052180952,0.00009768313,0.000103607395,0.000019501424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023749711,0.00047557478,0.00025982774,0.00058411213,0.00035172654,0.0005210052,0.00060306414,0.00031832137,0.00962804],"category_scores_gemma":[0.00080246775,0.00016383796,0.00019802326,0.0005956849,0.00025150814,0.000888055,0.00068642746,0.00038616813,0.0021638544],"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.0017505189,0.00015979199,0.0018707402,0.0004517328,0.000052877953,0.0006918611,0.00025868177,0.022161102,0.32988754,0.06484356,0.012064595,0.56580704],"study_design_scores_gemma":[0.0002777586,0.0018637582,0.0039760247,0.00026421438,0.000093507944,0.0020547514,0.00018381218,0.2899775,0.48495382,0.059421714,0.15679346,0.00013967392],"about_ca_topic_score_codex":0.0003812074,"about_ca_topic_score_gemma":0.00044577263,"teacher_disagreement_score":0.00962804,"about_ca_system_score_codex":0.00037476668,"about_ca_system_score_gemma":0.00031445385,"threshold_uncertainty_score":0.03220898},"labels":[],"label_agreement":null},{"id":"W2346415545","doi":"10.1002/sec.1420","title":"AD‐ASGKA – authenticated dynamic protocols for asymmetric group key agreement","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Group key; Computer security; Public-key cryptography; Key (lock); Key-agreement protocol; Session key; Key encapsulation; Encryption; ID-based cryptography; Key distribution; Symmetric-key algorithm; Cryptography; Pre-shared key; Shared secret; Computer network","score_opus":0.015241884639676392,"score_gpt":0.2705871614325165,"score_spread":0.2553452767928401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346415545","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.010516524,0.0005878251,0.9794826,0.00043216912,0.00023124582,0.00033984243,0.000085668085,0.0006403397,0.0076837577],"genre_scores_gemma":[0.6038145,0.001156639,0.3784875,0.00039777288,0.00024023287,0.0013052501,0.00056381366,0.00020358512,0.013830745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944601,0.0023944278,0.00045213566,0.0006175705,0.0016806601,0.00039509922],"domain_scores_gemma":[0.99577785,0.0013770731,0.0005366395,0.0013553267,0.0007280657,0.00022504403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003641716,0.00078094396,0.0010297298,0.0016605676,0.0021169693,0.0028087557,0.0027871178,0.0018474049,0.005167194],"category_scores_gemma":[0.0060310806,0.00049475505,0.000927936,0.0019726201,0.0028311226,0.005710974,0.003891289,0.0024730607,0.0015428131],"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.00050321803,0.00018049713,0.00039993497,0.00041802213,0.00010659025,0.0005684393,0.00060627976,0.041068904,0.0150549915,0.85903645,0.0061468747,0.07590974],"study_design_scores_gemma":[0.00028230026,0.0002447151,0.00019946681,0.00012085785,0.00010387128,0.001190951,0.0002140837,0.48928794,0.02289635,0.3953492,0.089975946,0.0001343797],"about_ca_topic_score_codex":0.0005163793,"about_ca_topic_score_gemma":0.00040815223,"teacher_disagreement_score":0.005167194,"about_ca_system_score_codex":0.002022418,"about_ca_system_score_gemma":0.0020948031,"threshold_uncertainty_score":0.019259453},"labels":[],"label_agreement":null},{"id":"W2414074698","doi":"10.1002/sec.1453","title":"Two‐level security for message sequences","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Eavesdropping; Adversary; Computer security; Construct (python library); Encryption; Key (lock); Computer security model; Sequence (biology); Provable security; Information-theoretic security; Theoretical computer science; Computer network","score_opus":0.03194205530987518,"score_gpt":0.29844525940886896,"score_spread":0.26650320409899375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414074698","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.08328568,0.00028705195,0.90505224,0.0014649978,0.00008978171,0.00015747176,0.0001432072,0.0005368906,0.008982732],"genre_scores_gemma":[0.8467428,0.0002719035,0.14580259,0.0003001302,0.00011895565,0.0002536564,0.00026272208,0.00012317425,0.006124218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946156,0.0015760427,0.0005401685,0.0008409221,0.0016067672,0.0008203579],"domain_scores_gemma":[0.9879402,0.005894142,0.0014995314,0.0030839874,0.0010038405,0.00057819276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040079267,0.0009191516,0.00095699524,0.0009866331,0.0010482571,0.0038593267,0.0014639776,0.0016156505,0.005443404],"category_scores_gemma":[0.009490893,0.00063176255,0.0012599889,0.0008583897,0.003313624,0.00987342,0.0038153115,0.0038058537,0.0012420133],"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.00043369355,0.00012003459,0.00046963495,0.0002712823,0.00003746915,0.0002228632,0.0004629802,0.049004756,0.014642178,0.914772,0.0012095878,0.0183535],"study_design_scores_gemma":[0.00012072078,0.00023738154,0.00019475796,0.00007190009,0.000024346173,0.00025927133,0.00008814761,0.2811082,0.015132064,0.695132,0.0075699473,0.00006122034],"about_ca_topic_score_codex":0.00036310512,"about_ca_topic_score_gemma":0.0002494189,"teacher_disagreement_score":0.005443404,"about_ca_system_score_codex":0.0022339819,"about_ca_system_score_gemma":0.0013251909,"threshold_uncertainty_score":0.021196187},"labels":[],"label_agreement":null},{"id":"W2487203936","doi":"10.1002/sec.1556","title":"Consent-based access control for secure and privacy-preserving health information exchange","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Provincial Foundation for Excellent Young Talents of Colleges and Universities of Anhui Province; Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Computer science; Computer security; Encryption; Access control; Health care; Internet privacy; Cryptography; Collusion; Information privacy; Business; Law","score_opus":0.023313360920629973,"score_gpt":0.2838272783142137,"score_spread":0.26051391739358376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487203936","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.009144714,0.0007043222,0.9840895,0.00082738453,0.00009667336,0.0004365398,0.00010281899,0.00040949328,0.0041886964],"genre_scores_gemma":[0.75026,0.0013462038,0.24064788,0.0005446497,0.00031801118,0.0009621229,0.00037611934,0.000068478716,0.00547648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97976923,0.009213642,0.0021450513,0.0020324755,0.0056333225,0.0012062794],"domain_scores_gemma":[0.98457724,0.006818149,0.0016773596,0.004088163,0.0021072014,0.00073193724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010836636,0.0007785651,0.0014522965,0.001614494,0.0018593966,0.0037295332,0.0024084938,0.0021047895,0.0036918565],"category_scores_gemma":[0.02354638,0.00050401996,0.0013867207,0.0024438344,0.0043864413,0.007201707,0.005390677,0.0030429172,0.0009474041],"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.00056316925,0.00017979702,0.0010483703,0.0005138318,0.00012741591,0.0007244407,0.0012282204,0.036417414,0.012669086,0.82481325,0.0050477334,0.116667144],"study_design_scores_gemma":[0.00037495547,0.00037866362,0.00057208515,0.00018805926,0.00013834074,0.0015859309,0.00028408587,0.4274295,0.015745375,0.5262911,0.026841711,0.00017026869],"about_ca_topic_score_codex":0.0013739968,"about_ca_topic_score_gemma":0.0007492212,"teacher_disagreement_score":0.010836636,"about_ca_system_score_codex":0.0021280453,"about_ca_system_score_gemma":0.005034229,"threshold_uncertainty_score":0.057310283},"labels":[],"label_agreement":null},{"id":"W2504337894","doi":"10.1002/sec.1456","title":"Two new message authentication codes based on APN functions and stream ciphers","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message authentication code; Authentication (law); Stream cipher; Code (set theory); Data Authentication Algorithm; CBC-MAC; Theoretical computer science; Computer security; Hash-based message authentication code; Block cipher; Computer network; Authentication protocol; Cryptography; Programming language","score_opus":0.01103032498939654,"score_gpt":0.2337092692993262,"score_spread":0.22267894430992966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504337894","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.093853995,0.00084975676,0.8957073,0.0006022736,0.00025414565,0.00030687204,0.00015581223,0.0009937439,0.0072762268],"genre_scores_gemma":[0.631577,0.00054278784,0.3592593,0.00021425063,0.0001051866,0.00034489323,0.00021464165,0.00009211491,0.007649836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984073,0.0004792971,0.00013828817,0.00017663692,0.0006063351,0.00019223211],"domain_scores_gemma":[0.9969387,0.0009859977,0.00055506855,0.00075337925,0.0005999582,0.00016690261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783246,0.00069101184,0.00064818666,0.0011524007,0.0006289267,0.0009740522,0.0009460192,0.0010943548,0.0020598979],"category_scores_gemma":[0.003680477,0.00033430566,0.00063139596,0.00090386096,0.0013611361,0.0021496895,0.0017193126,0.0013026269,0.0007429651],"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.0015696343,0.00022602506,0.0026970194,0.0007135993,0.00013517904,0.00081952283,0.00076533464,0.06780046,0.11830277,0.5505783,0.004874058,0.251518],"study_design_scores_gemma":[0.0003305891,0.0007701612,0.0016399571,0.00017563651,0.00011271318,0.0023031314,0.00010768448,0.6625992,0.19520092,0.09576446,0.040814295,0.00018120921],"about_ca_topic_score_codex":0.0004930233,"about_ca_topic_score_gemma":0.000347632,"teacher_disagreement_score":0.0020598979,"about_ca_system_score_codex":0.000891328,"about_ca_system_score_gemma":0.0013622774,"threshold_uncertainty_score":0.006891072},"labels":[],"label_agreement":null},{"id":"W2507483638","doi":"10.1002/sec.1586","title":"Towards a secure hybrid adaptive gateway discovery mechanism for intelligent transportation systems","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Scalability; Computer network; Default gateway; Gateway (web page); Intelligent transportation system; Protocol (science); Computer security; Smart city; Authentication (law); Internet of Things; World Wide Web; Operating system","score_opus":0.009618631915648596,"score_gpt":0.2030525240482758,"score_spread":0.1934338921326272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507483638","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.051355515,0.00024931267,0.944175,0.0003817943,0.000093533454,0.00022488215,0.000043040553,0.0014385439,0.0020383492],"genre_scores_gemma":[0.82641345,0.00017957704,0.17066166,0.00015983143,0.00005084441,0.00018299493,0.00011071189,0.000051666622,0.002189295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875605,0.0003487934,0.00013772173,0.00015607614,0.00047493953,0.00012644449],"domain_scores_gemma":[0.99781597,0.0005839517,0.00036589615,0.00069079053,0.00043254485,0.00011086994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028616549,0.00040647603,0.00044337608,0.0011823627,0.0006675896,0.0014795434,0.0019425027,0.001151001,0.0013335737],"category_scores_gemma":[0.0029354934,0.00039083607,0.000453656,0.0006718174,0.0011286932,0.0027910967,0.0030350566,0.001239398,0.00051411154],"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.0014689706,0.00052875956,0.005453829,0.00046848244,0.0003256338,0.0011820289,0.0010841838,0.21635999,0.17153394,0.3514859,0.008516006,0.24159224],"study_design_scores_gemma":[0.0001361715,0.00033629563,0.00054824725,0.000034930035,0.00007167888,0.00035431495,0.00014527155,0.8893698,0.05100721,0.041683957,0.016251149,0.00006100138],"about_ca_topic_score_codex":0.000629245,"about_ca_topic_score_gemma":0.00046433145,"teacher_disagreement_score":0.0028616549,"about_ca_system_score_codex":0.00071804,"about_ca_system_score_gemma":0.0008204045,"threshold_uncertainty_score":0.015134037},"labels":[],"label_agreement":null},{"id":"W2545525234","doi":"10.1002/sec.1673","title":"Host cancelation‐based spread spectrum watermarking for audio anti‐piracy over Internet","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Digital watermarking; Host (biology); Redundancy (engineering); Audio signal; The Internet; Filter (signal processing); Spread spectrum; Embedding; Speech recognition; Artificial intelligence; Computer network; Channel (broadcasting); Speech coding; Computer vision; Image (mathematics)","score_opus":0.011253227005015631,"score_gpt":0.24701416200502022,"score_spread":0.23576093500000458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545525234","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.3633067,0.0014374381,0.62719196,0.00024824898,0.0001600868,0.00007909545,0.00004242368,0.0009490494,0.0065850927],"genre_scores_gemma":[0.93491304,0.00043539683,0.061806288,0.00004978148,0.00006790313,0.000016716727,0.00003663979,0.0000263371,0.00264798],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971706,0.000049246915,0.00001579129,0.000040845276,0.00015080036,0.000026231754],"domain_scores_gemma":[0.9996209,0.00010056955,0.00009679928,0.00008304029,0.00008240436,0.000016267859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025891548,0.00034630613,0.00039371726,0.00062795996,0.00027532424,0.00032742662,0.00036308452,0.00047584347,0.001468749],"category_scores_gemma":[0.00086069526,0.00013683409,0.00022909787,0.00034738623,0.00039188316,0.0007638329,0.0005726451,0.00032365578,0.00046816136],"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.00056575995,0.00012647743,0.0008816056,0.00021770695,0.00006208749,0.00047596465,0.00010853603,0.022354826,0.7135074,0.006847939,0.0007180546,0.25413358],"study_design_scores_gemma":[0.00006428531,0.00067901704,0.0014990167,0.000045263463,0.000100139936,0.0012936925,0.000054984255,0.41789615,0.56839156,0.0029103695,0.0070209703,0.000044491277],"about_ca_topic_score_codex":0.00014086669,"about_ca_topic_score_gemma":0.00018482404,"teacher_disagreement_score":0.001468749,"about_ca_system_score_codex":0.00012347462,"about_ca_system_score_gemma":0.00014592503,"threshold_uncertainty_score":0.0049134493},"labels":[],"label_agreement":null},{"id":"W2765171093","doi":"10.1155/2017/3261058","title":"A Collaborative Approach for Monitoring Nodes Behavior during Spectrum Sensing to Mitigate Multiple Attacks in Cognitive Radio Networks","year":2017,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":14,"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":"Cognitive radio; Computer science; Node (physics); Computer network; Computer security; Reliability (semiconductor); Adversary; Spectrum management; Process (computing); Cluster (spacecraft); Radio spectrum; Reputation; Telecommunications; Wireless","score_opus":0.020016000878817563,"score_gpt":0.2830554159183273,"score_spread":0.2630394150395097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765171093","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.035489462,0.00027202885,0.96183187,0.00010924226,0.000043025786,0.00009065385,0.000019541503,0.0003609114,0.0017832493],"genre_scores_gemma":[0.86503655,0.00017028517,0.133331,0.00007360705,0.000037580357,0.00010888754,0.0000323465,0.000024268493,0.0011855474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771607,0.0005850105,0.000120910045,0.0006731657,0.0006954417,0.0002094203],"domain_scores_gemma":[0.99801195,0.00070773513,0.00033804734,0.00040651538,0.00041435534,0.00012137505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802851,0.0008131551,0.0008331505,0.0010449522,0.00085351197,0.00094215263,0.0017024347,0.0010639232,0.0004696292],"category_scores_gemma":[0.0034144707,0.00034522638,0.0008041905,0.0005750552,0.0007169204,0.0015074988,0.0014695534,0.0006944031,0.00018857114],"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.0006095979,0.0007230643,0.010231812,0.00032312094,0.0004611746,0.0007248172,0.0013154604,0.43262115,0.0890726,0.0251633,0.001855226,0.43689865],"study_design_scores_gemma":[0.000022356218,0.00039185415,0.0014192031,0.000012395011,0.00009789532,0.00029069476,0.00011036128,0.9822349,0.009299558,0.004737065,0.0013436604,0.00004006497],"about_ca_topic_score_codex":0.002652406,"about_ca_topic_score_gemma":0.0027736365,"teacher_disagreement_score":0.002652406,"about_ca_system_score_codex":0.0005179059,"about_ca_system_score_gemma":0.00088307576,"threshold_uncertainty_score":0.008357406},"labels":[],"label_agreement":null},{"id":"W2799714514","doi":"10.1155/2018/8475818","title":"Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication","year":2018,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Eavesdropping; Communication source; Cryptosystem; Computer security; Adversary; Key (lock); Cryptography; Term (time); Path (computing); Theoretical computer science; Computer network","score_opus":0.04203667645628207,"score_gpt":0.32778477146391305,"score_spread":0.285748095007631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799714514","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.039566662,0.00019820333,0.95510566,0.0003006638,0.000038904913,0.00006701689,0.0000313678,0.0001942706,0.0044972165],"genre_scores_gemma":[0.9002848,0.00025593335,0.09595662,0.00012800751,0.000027887521,0.00010990679,0.000035366615,0.000043237178,0.0031582492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931395,0.00023451344,0.00002676684,0.00010784311,0.00022513012,0.00009175003],"domain_scores_gemma":[0.99770063,0.0013591103,0.00029192958,0.00029539666,0.00021386192,0.00013907344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105749,0.00057549303,0.0004436418,0.00062422187,0.0006660437,0.00079679635,0.0011942795,0.0011295715,0.002704751],"category_scores_gemma":[0.004069952,0.00024848324,0.00051433925,0.00054382614,0.0017630233,0.002062509,0.001528804,0.001189238,0.00043409204],"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.00019610005,0.000078138866,0.0009079819,0.000113849565,0.000073313866,0.00033455374,0.00029276632,0.33889955,0.021658761,0.592003,0.0017461855,0.04369583],"study_design_scores_gemma":[0.000025848629,0.00016892211,0.00019202249,0.000016859662,0.00002000714,0.00024560123,0.00004366545,0.8591637,0.003982272,0.13426621,0.001838792,0.000036067195],"about_ca_topic_score_codex":0.0004928434,"about_ca_topic_score_gemma":0.00035942986,"teacher_disagreement_score":0.002704751,"about_ca_system_score_codex":0.0009733852,"about_ca_system_score_gemma":0.00075763004,"threshold_uncertainty_score":0.009048283},"labels":[],"label_agreement":null},{"id":"W2800384806","doi":"10.1155/2018/4231326","title":"Uncovering Tor: An Examination of the Network Structure","year":2018,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cybercrime and Law Enforcement Studies","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":"Simon Fraser University","funders":"","keywords":"Computer science; Anonymity; Hyperlink; World Wide Web; The Internet; Encryption; Computer security; Internet privacy; Web page","score_opus":0.009754903279304955,"score_gpt":0.23344395467101695,"score_spread":0.223689051391712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800384806","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.9383349,0.0008693614,0.02492908,0.0013679538,0.000043553297,0.00018344057,0.002843825,0.0002847441,0.03114314],"genre_scores_gemma":[0.9864334,0.0005611264,0.010261035,0.000053621472,0.000020766282,0.00007415092,0.0010954892,0.000038820282,0.0014613979],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991804,0.00032682778,0.00004630155,0.00013856126,0.00022459567,0.0000832112],"domain_scores_gemma":[0.9931177,0.0037694867,0.0013821109,0.00066163676,0.0007909608,0.00027812377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010214716,0.00021871222,0.00020421871,0.008486908,0.0016503062,0.0017040084,0.0004959102,0.00044446933,0.0021922877],"category_scores_gemma":[0.0068173977,0.00019800176,0.00025934834,0.0066798315,0.0013719577,0.0035251249,0.0017419934,0.00062548113,0.00036548285],"study_design_candidate":"observational","study_design_consensus":"observational","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.00033791614,0.00018401918,0.5364847,0.0011754506,0.00020381942,0.0030859064,0.06666266,0.016558804,0.014279146,0.121499635,0.016703954,0.22282399],"study_design_scores_gemma":[0.000022248842,0.00020587053,0.5575598,0.0005795799,0.00018609833,0.004260628,0.10985779,0.1232072,0.008065236,0.09123402,0.10468766,0.00013388778],"about_ca_topic_score_codex":0.006935872,"about_ca_topic_score_gemma":0.012066783,"teacher_disagreement_score":0.008486908,"about_ca_system_score_codex":0.0009400084,"about_ca_system_score_gemma":0.0006571643,"threshold_uncertainty_score":0.013790965},"labels":[],"label_agreement":null},{"id":"W2912545651","doi":"10.1155/2019/2964673","title":"Security, Privacy, and Trust for Cyberphysical-Social Systems","year":2019,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer security; Internet privacy","score_opus":0.007670730916159371,"score_gpt":0.23034330326316393,"score_spread":0.22267257234700455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912545651","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.3765893,0.004848084,0.54498863,0.018675163,0.00033708834,0.00015034375,0.00026148075,0.00018250695,0.05396738],"genre_scores_gemma":[0.9909361,0.0005754362,0.0060625845,0.00007161656,0.00007339177,0.000035492714,0.000027932349,0.000007783566,0.002209675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972097,0.0013005165,0.00019224173,0.00032241747,0.00066780654,0.00030724623],"domain_scores_gemma":[0.9852806,0.01027076,0.0013736385,0.001652706,0.00089475536,0.0005275456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003752179,0.00040442715,0.0006167535,0.0009634812,0.0020150545,0.0055777216,0.0006000129,0.0019753352,0.0034011495],"category_scores_gemma":[0.016458787,0.0003936144,0.0004947334,0.0010230229,0.0072002653,0.009634371,0.0027200629,0.0021038495,0.0002618306],"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.00007130102,0.000035477387,0.0012098083,0.00005018778,0.0000213111,0.00008865157,0.00038773904,0.017318593,0.0004023294,0.9721061,0.00044299223,0.007865536],"study_design_scores_gemma":[0.00001000014,0.000018182789,0.0002621029,0.000018290255,0.00000837293,0.000033083415,0.00011019436,0.048266362,0.00026263684,0.9494894,0.0015109744,0.000010362673],"about_ca_topic_score_codex":0.004346092,"about_ca_topic_score_gemma":0.002633105,"teacher_disagreement_score":0.0055777216,"about_ca_system_score_codex":0.0027184372,"about_ca_system_score_gemma":0.0026315202,"threshold_uncertainty_score":0.019843638},"labels":[],"label_agreement":null},{"id":"W3120942553","doi":"10.1155/2021/6682311","title":"Ferry Node Identification Model for the Security of Mobile Ad Hoc Network","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Opportunistic and Delay-Tolerant Networks","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":"Geomechanica (Canada)","funders":"Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China","keywords":"Computer science; Node (physics); Computer network; Identification (biology); Wireless ad hoc network; Mobile ad hoc network; Computer security; Wireless; Network packet; Telecommunications","score_opus":0.021596191311871495,"score_gpt":0.25909357363239016,"score_spread":0.23749738232051867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120942553","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.026645567,0.00044216504,0.9680417,0.0002948034,0.00009492536,0.00008363229,0.000106667314,0.00020042683,0.0040901112],"genre_scores_gemma":[0.93397725,0.0009101772,0.053537507,0.00014452233,0.00011007259,0.00026471884,0.00022367242,0.00004789981,0.010784168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.0002135533,0.000037668775,0.00024936692,0.00031455836,0.00016490069],"domain_scores_gemma":[0.9989293,0.00042039042,0.00020904365,0.00007807733,0.00030216353,0.00006115108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407526,0.00091848185,0.0007121375,0.0012548597,0.00085074396,0.0008996525,0.0022291713,0.0010936258,0.001857729],"category_scores_gemma":[0.004069301,0.0002657317,0.0007860901,0.0009432026,0.0010526468,0.003162189,0.0010188003,0.0011785193,0.00037095675],"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.000062792526,0.000027477188,0.0013068286,0.000055272183,0.000021315991,0.000106119696,0.00013973232,0.9382751,0.0013054024,0.043178916,0.0012566431,0.014264335],"study_design_scores_gemma":[0.0000024890005,0.000019529973,0.00019988185,0.0000038305,0.000006658434,0.00002883275,0.000023093913,0.99198335,0.00017032094,0.00696454,0.000589742,0.000007756175],"about_ca_topic_score_codex":0.010771248,"about_ca_topic_score_gemma":0.008255361,"teacher_disagreement_score":0.010771248,"about_ca_system_score_codex":0.0019731356,"about_ca_system_score_gemma":0.0011565243,"threshold_uncertainty_score":0.021417081},"labels":[],"label_agreement":null},{"id":"W3135946340","doi":"10.1155/2021/6615899","title":"Use of Security Logs for Data Leak Detection: A Systematic Literature Review","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Computer security; Leak; Information sensitivity; Point (geometry); Data science; Data mining","score_opus":0.040021195382736845,"score_gpt":0.2730459283511971,"score_spread":0.23302473296846027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135946340","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033314764,0.9912043,0.0014475875,0.0010827526,0.00015567231,0.00048555667,0.0014880397,0.000044692537,0.00075990974],"genre_scores_gemma":[0.024831219,0.967651,0.0044117533,0.00081360823,0.00009896556,0.00075067097,0.0012825931,0.000027159758,0.00013294863],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.98358387,0.0058507007,0.0056675007,0.0012513764,0.0033363926,0.00031016508],"domain_scores_gemma":[0.8182167,0.14525166,0.016050128,0.003368638,0.016293881,0.0008189695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02143876,0.0015182644,0.0037851087,0.022184538,0.0009002082,0.0035656777,0.0017821328,0.0016502064,0.0029476967],"category_scores_gemma":[0.12194364,0.0011734852,0.0046140794,0.01754129,0.0014481271,0.005381027,0.0021779104,0.0015590391,0.00060250313],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.00024693142,0.00008312477,0.007168339,0.66626215,0.0027450188,0.00018345242,0.0011807091,0.0004131549,0.0004144483,0.0012036384,0.0075530685,0.31254598],"study_design_scores_gemma":[0.00007582501,0.00022510493,0.010738664,0.90235454,0.0110623315,0.000582494,0.0015600506,0.00033460156,0.0007210125,0.0012285467,0.07102142,0.0000953127],"about_ca_topic_score_codex":0.006596774,"about_ca_topic_score_gemma":0.018652745,"teacher_disagreement_score":0.022184538,"about_ca_system_score_codex":0.0033751477,"about_ca_system_score_gemma":0.017939685,"threshold_uncertainty_score":0.11338037},"labels":[],"label_agreement":null},{"id":"W3136497400","doi":"10.1155/2021/5541974","title":"Task Priority-Based Cached-Data Prefetching and Eviction Mechanisms for Performance Optimization of Edge Computing Clusters","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Computer science; Cache; Edge computing; Cloud computing; Distributed computing; Computer network; Locality; Scheduling (production processes); Edge device; Enhanced Data Rates for GSM Evolution; Overhead (engineering); Operating system","score_opus":0.02174160137709729,"score_gpt":0.2521075343492098,"score_spread":0.2303659329721125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136497400","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.4074332,0.003413815,0.579166,0.00037416822,0.00027924447,0.00017894722,0.00015560999,0.0021518779,0.0068472186],"genre_scores_gemma":[0.9719516,0.0002699121,0.026483838,0.0000432532,0.00003182091,0.000033922868,0.00005739804,0.000030714462,0.0010974434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997553,0.000037240876,0.000017894901,0.000037727754,0.00007640712,0.000075421296],"domain_scores_gemma":[0.9994931,0.00013057333,0.00005450217,0.000058790338,0.0001944921,0.00006857168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046751805,0.00037084395,0.0004105375,0.00048055206,0.0007373653,0.00053616904,0.0011398884,0.00021653726,0.00084848935],"category_scores_gemma":[0.0010926332,0.00016905043,0.0001822755,0.0007171445,0.00020966028,0.0007186904,0.0004418746,0.00035603583,0.00014942777],"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.002331055,0.00059527106,0.009021327,0.00039408985,0.00014884069,0.00050990016,0.0004897353,0.5750296,0.095749795,0.023231477,0.012810539,0.27968833],"study_design_scores_gemma":[0.000044859302,0.00017375288,0.0009849714,0.000007338901,0.00002904616,0.000049174327,0.000044389813,0.98486507,0.0096949935,0.002357096,0.0017310412,0.000018238767],"about_ca_topic_score_codex":0.0077596772,"about_ca_topic_score_gemma":0.011731458,"teacher_disagreement_score":0.0077596772,"about_ca_system_score_codex":0.0007753175,"about_ca_system_score_gemma":0.0015973656,"threshold_uncertainty_score":0.01542902},"labels":[],"label_agreement":null},{"id":"W3137274258","doi":"10.1155/2021/6682674","title":"Hardware Trojan Detection Based on Ordered Mixed Feature GEP","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Electronic Science and Technology of China; Chengdu University; Chengdu University of Information Technology","keywords":"Trojan; Computer science; Feature (linguistics); Field (mathematics); Algorithm; Data mining; Artificial intelligence; Pattern recognition (psychology); Computer security; Mathematics","score_opus":0.007518391420553572,"score_gpt":0.2087011219747104,"score_spread":0.20118273055415684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137274258","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.32621485,0.00013865018,0.6690749,0.000120119395,0.00003254094,0.00008015241,0.00004891304,0.000608159,0.003681744],"genre_scores_gemma":[0.8478229,0.000058206293,0.1502903,0.00005279389,0.000004348034,0.00006638777,0.000066517176,0.00003863342,0.0016000079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.00003777763,0.000010944279,0.00005439802,0.000087349115,0.000037705497],"domain_scores_gemma":[0.99970466,0.00012694292,0.000033730037,0.000048996615,0.000070970156,0.000014579326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023664384,0.00042279938,0.00032337452,0.00049582013,0.00031703842,0.00033983935,0.0005524752,0.0004261447,0.0008743153],"category_scores_gemma":[0.0010416013,0.00014393285,0.0003336043,0.00029665657,0.00039426316,0.0005759954,0.00042685436,0.0004082834,0.00009671027],"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.00032244762,0.00019887162,0.0100720795,0.0001831225,0.00008806522,0.00072087935,0.0003077101,0.2775623,0.23702289,0.036987424,0.0008124717,0.43572178],"study_design_scores_gemma":[0.00004916465,0.00041809984,0.002381633,0.000017890734,0.00006396808,0.0006213125,0.000063609164,0.9129895,0.0674451,0.012911043,0.0030015968,0.000037120804],"about_ca_topic_score_codex":0.0006812133,"about_ca_topic_score_gemma":0.00084067386,"teacher_disagreement_score":0.0008743153,"about_ca_system_score_codex":0.00027745156,"about_ca_system_score_gemma":0.00035931283,"threshold_uncertainty_score":0.0029248595},"labels":[],"label_agreement":null},{"id":"W3157837978","doi":"10.1155/2021/5553256","title":"Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","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 New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Univariate; Protocol (science); Theoretical computer science; Information retrieval; Multivariate statistics; Medicine; Machine learning","score_opus":0.006373482725630177,"score_gpt":0.22592991027396842,"score_spread":0.21955642754833823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157837978","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.054523617,0.0005404318,0.93497574,0.0010181846,0.0001005122,0.0005070594,0.00022257328,0.00087542774,0.007236423],"genre_scores_gemma":[0.79815876,0.00061099237,0.19139679,0.00046555733,0.00014107434,0.000564447,0.00043804216,0.00006166616,0.00816266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962303,0.0009751224,0.00031966218,0.00055438746,0.0013726713,0.0005478192],"domain_scores_gemma":[0.9971167,0.0010303478,0.000395168,0.0010197258,0.00032117646,0.00011691809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027624208,0.00044328437,0.0009322792,0.00065736036,0.0010394864,0.0014361994,0.001964496,0.0013407283,0.0022870002],"category_scores_gemma":[0.0043258667,0.0003767783,0.00072590174,0.001105919,0.0013359817,0.0066934535,0.0039999667,0.0019161779,0.00063924596],"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.0015180969,0.00069275143,0.0015597665,0.0008319532,0.00018320118,0.0014050783,0.0015277478,0.049630534,0.09258143,0.6324458,0.010038546,0.2075851],"study_design_scores_gemma":[0.0009086592,0.0010723969,0.0010105639,0.00009663332,0.00017663349,0.0022004102,0.0004591628,0.61649305,0.17089963,0.17297699,0.03341973,0.0002861595],"about_ca_topic_score_codex":0.0004959144,"about_ca_topic_score_gemma":0.00030961947,"teacher_disagreement_score":0.0027624208,"about_ca_system_score_codex":0.0010911885,"about_ca_system_score_gemma":0.002326858,"threshold_uncertainty_score":0.014609277},"labels":[],"label_agreement":null},{"id":"W3184916135","doi":"10.1155/2021/8873429","title":"A Survey of Self-Sovereign Identity Ecosystem","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Identity (music); Identity management; Identifier; Computer science; Digital identity; Sovereignty; Blockchain; Key (lock); Internet privacy; Computer security; Political science; Authentication (law); Law; Politics","score_opus":0.015669185750342797,"score_gpt":0.24463128426005337,"score_spread":0.22896209850971058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184916135","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027374052,0.47820112,0.09261448,0.024017315,0.0018458038,0.00017749795,0.0005992302,0.0004963864,0.374674],"genre_scores_gemma":[0.25865752,0.63914394,0.045477934,0.0061653904,0.0020740614,0.00025481568,0.0017092342,0.00026550516,0.046251558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979353,0.00064922724,0.00016498104,0.00029171936,0.0007277886,0.00023091935],"domain_scores_gemma":[0.9976482,0.0010811426,0.00016326628,0.00036621024,0.0005776678,0.00016350218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342545,0.00047605234,0.0007263536,0.0037620093,0.0018765443,0.005486646,0.0011225021,0.0018240311,0.0068895924],"category_scores_gemma":[0.0041943514,0.00045307985,0.0005283784,0.0071341274,0.0020983596,0.014738636,0.0031107292,0.0018764721,0.002093158],"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.000024252244,0.000045104884,0.0014400848,0.0010173387,0.000017098313,0.00016825389,0.0010126359,0.00086517015,0.00031924288,0.7987668,0.019988636,0.17633535],"study_design_scores_gemma":[0.0000024802816,0.000029901976,0.00080520083,0.000849693,0.000008814756,0.0006416787,0.0009615868,0.0016934422,0.00027160902,0.16680096,0.8279139,0.00002081334],"about_ca_topic_score_codex":0.0014897784,"about_ca_topic_score_gemma":0.0009901914,"teacher_disagreement_score":0.0068895924,"about_ca_system_score_codex":0.0023380439,"about_ca_system_score_gemma":0.0027436935,"threshold_uncertainty_score":0.023047924},"labels":[],"label_agreement":null},{"id":"W3192134083","doi":"10.1155/2021/4280328","title":"A Novel Defensive Strategy for Facial Manipulation Detection Combining Bilateral Filtering and Joint Adversarial Training","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Adversarial system; Computer science; Joint (building); Preprocessor; Artificial intelligence; Face (sociological concept); Vulnerability (computing); Detector; Computer vision; Machine learning; Computer security","score_opus":0.05252463860637685,"score_gpt":0.2707353112620546,"score_spread":0.21821067265567773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192134083","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.01535926,0.00017237058,0.9823414,0.00018718842,0.00005224514,0.000047348414,0.000021766326,0.0004603155,0.0013581017],"genre_scores_gemma":[0.74201375,0.0003521017,0.25130963,0.00046182386,0.000089223875,0.00013129164,0.00013939981,0.00008984515,0.0054128114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991535,0.00014434934,0.00003742632,0.00021321044,0.00031065484,0.00014090884],"domain_scores_gemma":[0.9991997,0.00030581685,0.0001196685,0.00016378675,0.00014842974,0.00006258331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011082671,0.0013395426,0.0009878903,0.000715334,0.0004430465,0.0005731584,0.0013570738,0.0013005072,0.0014982683],"category_scores_gemma":[0.0025526187,0.00042881997,0.00095788925,0.00033226548,0.0009898461,0.0013151391,0.0016906689,0.0014089288,0.0005155975],"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.00026861942,0.00019849357,0.0032522846,0.00012636009,0.00018415449,0.00036977712,0.00019115847,0.32903972,0.11990267,0.018820135,0.0042851903,0.5233614],"study_design_scores_gemma":[0.00000677295,0.00010095435,0.00048763264,0.000007644443,0.000024378704,0.00019597798,0.000014146362,0.9833468,0.012045113,0.0028357678,0.0009166585,0.00001815137],"about_ca_topic_score_codex":0.001668034,"about_ca_topic_score_gemma":0.0016397218,"teacher_disagreement_score":0.001668034,"about_ca_system_score_codex":0.0004975778,"about_ca_system_score_gemma":0.0007253181,"threshold_uncertainty_score":0.005861163},"labels":[],"label_agreement":null},{"id":"W3202261604","doi":"10.1155/2021/1325573","title":"Multiplicative Watermarking Method with the Visual Saliency Model Using Contourlet Transform","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"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":"CODE","keywords":"Watermark; Contourlet; Digital watermarking; Computer science; Artificial intelligence; Human visual system model; Computer vision; Pattern recognition (psychology); Embedding; Peak signal-to-noise ratio; Generalized normal distribution; Mathematics; Image (mathematics); Wavelet transform; Wavelet; Statistics","score_opus":0.015443836960622565,"score_gpt":0.2893180625969782,"score_spread":0.2738742256363556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202261604","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.023348482,0.00035947125,0.9745018,0.00011248946,0.00006910218,0.00003378519,0.000014391963,0.00024948074,0.0013109813],"genre_scores_gemma":[0.52784663,0.0010883774,0.4664181,0.00010413128,0.00016964266,0.00007846685,0.00008789278,0.00009137477,0.0041153547],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999749,0.000034091412,0.0000137083,0.00004836157,0.00013643174,0.000018368904],"domain_scores_gemma":[0.9997553,0.00006285528,0.000038440914,0.0000356873,0.00009350292,0.000014121137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293165,0.00046952334,0.00040963167,0.00071308925,0.0002307739,0.00043098704,0.00061559683,0.00058178767,0.0009941037],"category_scores_gemma":[0.00080651697,0.00021912614,0.000625181,0.0006500144,0.00034282103,0.0013171147,0.00042784796,0.00052088726,0.00032492803],"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.00023709318,0.00010836009,0.00083604804,0.00028088436,0.00009397354,0.00027733913,0.00020174983,0.07541458,0.42064205,0.019371457,0.0012334607,0.48130295],"study_design_scores_gemma":[0.000029589311,0.00019773662,0.0006698645,0.00001339391,0.000052031937,0.00043243807,0.000020884501,0.9219915,0.07017426,0.0027756721,0.003606669,0.000035810237],"about_ca_topic_score_codex":0.0006248156,"about_ca_topic_score_gemma":0.0004708363,"teacher_disagreement_score":0.0009941037,"about_ca_system_score_codex":0.000263607,"about_ca_system_score_gemma":0.00028759893,"threshold_uncertainty_score":0.0033256412},"labels":[],"label_agreement":null},{"id":"W3208320265","doi":"10.1155/2021/2313389","title":"An Efficient and Privacy-Preserving Biometric Identification Scheme Based on the FITing-Tree","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Biometric Identification and Security","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 New Brunswick","funders":"Ministry of Public Security of the People's Republic of China; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Biometrics; Homomorphic encryption; Identification (biology); Scheme (mathematics); Tree (set theory); Cloud computing; Server; Service provider; Computer security; Encryption; Data mining; Service (business); Computer network; Mathematics","score_opus":0.018720105840357465,"score_gpt":0.25326406443671234,"score_spread":0.23454395859635488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208320265","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.06395093,0.00090859365,0.92733014,0.00069997506,0.00016638807,0.0003843201,0.00040416673,0.0010038468,0.0051516662],"genre_scores_gemma":[0.77393717,0.0005599235,0.21923758,0.00038034437,0.000069992166,0.00023999506,0.0004915815,0.000039588063,0.005043773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980925,0.00040142663,0.00013366244,0.0003388346,0.00068727427,0.0003463986],"domain_scores_gemma":[0.99830025,0.00028877624,0.0002530911,0.0007194453,0.000316442,0.00012202184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090623973,0.00039878025,0.0012576034,0.0010039719,0.0018291563,0.0009996797,0.0014812062,0.0013748091,0.0017779159],"category_scores_gemma":[0.0023024555,0.00027810357,0.0009101774,0.0022776579,0.000745777,0.0038999876,0.0027216065,0.0012289772,0.0007374483],"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.0020247842,0.0005758191,0.004584718,0.0005862837,0.00026361537,0.0017538202,0.0012381503,0.07125351,0.16991071,0.2230039,0.021260709,0.50354415],"study_design_scores_gemma":[0.0002489381,0.0010232806,0.003190703,0.000088157925,0.00013626511,0.005711087,0.00038795665,0.80106294,0.067425124,0.08379381,0.036629524,0.0003022424],"about_ca_topic_score_codex":0.0011400252,"about_ca_topic_score_gemma":0.0010069382,"teacher_disagreement_score":0.0018291563,"about_ca_system_score_codex":0.0010713066,"about_ca_system_score_gemma":0.0014311097,"threshold_uncertainty_score":0.007772863},"labels":[],"label_agreement":null},{"id":"W3211019699","doi":"10.1155/2021/5701258","title":"A Fair and Privacy-Preserving Image Trading System Based on Blockchain and Group Signature","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":9,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Service provider; Upload; Database transaction; Exploit; Overhead (engineering); Group signature; Construct (python library); Protocol (science); Trusted third party; Anonymity; Internet privacy; Service (business); Encryption; Public-key cryptography; Business; Database; World Wide Web; Computer network","score_opus":0.006421228279952167,"score_gpt":0.21038904510026524,"score_spread":0.20396781682031306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211019699","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.108154364,0.0003688471,0.87718576,0.0008468873,0.00015751409,0.00075019605,0.00029463507,0.0025404037,0.009701382],"genre_scores_gemma":[0.89315116,0.00022871971,0.09872346,0.00014782923,0.000055990127,0.00044916107,0.00033054297,0.00005711719,0.00685595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978709,0.00044486378,0.00018290138,0.00044055423,0.0007429204,0.0003178645],"domain_scores_gemma":[0.9975152,0.00067228643,0.0002966861,0.0006762207,0.00044656047,0.00039307107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017059295,0.0006132179,0.0012985336,0.00085479626,0.0027711622,0.0017984691,0.002476637,0.0017168123,0.004576114],"category_scores_gemma":[0.0034002608,0.00040307152,0.00056846126,0.0014477175,0.0016868664,0.0044694874,0.0033352866,0.0010741492,0.000796843],"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.002174729,0.0010262837,0.0058475267,0.00060702395,0.00020103605,0.0029439013,0.0018905286,0.3587732,0.04985273,0.24681255,0.01235747,0.31751305],"study_design_scores_gemma":[0.0003636904,0.0003083179,0.00041054923,0.0000264968,0.000050340393,0.0004806971,0.000108359265,0.9164727,0.010767141,0.061021287,0.009902865,0.000087575936],"about_ca_topic_score_codex":0.005813077,"about_ca_topic_score_gemma":0.0047807707,"teacher_disagreement_score":0.005813077,"about_ca_system_score_codex":0.0013359375,"about_ca_system_score_gemma":0.004989326,"threshold_uncertainty_score":0.015308619},"labels":[],"label_agreement":null},{"id":"W3211824416","doi":"10.1155/2021/9495093","title":"A Distributed Security SDN Cluster Architecture for Smart Grid Based on Blockchain Technology","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"State Grid Corporation of China","keywords":"Computer science; Blockchain; OpenFlow; Single point of failure; Computer network; Distributed computing; Denial-of-service attack; Network security; Software-defined networking; Computer security; Operating system","score_opus":0.006287829900725375,"score_gpt":0.2242999504313947,"score_spread":0.21801212053066932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211824416","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.064200185,0.0004981845,0.91900724,0.0005846739,0.0002133005,0.00028268507,0.00013602927,0.0020842054,0.012993454],"genre_scores_gemma":[0.8859006,0.0005193653,0.103893034,0.00011772177,0.000060356146,0.00022604965,0.0003214039,0.000061621744,0.008899787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963796,0.00006256056,0.0000256621,0.00008228177,0.00015038402,0.000041190175],"domain_scores_gemma":[0.99973327,0.000035229,0.000025161284,0.000048929473,0.00011187599,0.000045520115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038723592,0.00031957784,0.00040342886,0.00042039948,0.0008686371,0.0008640272,0.0011043131,0.0004983853,0.0022021835],"category_scores_gemma":[0.000440031,0.00017564473,0.00030692443,0.00048745406,0.00052649336,0.0015964145,0.0009354505,0.00054205704,0.00042073522],"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.00068049674,0.00026457975,0.0050476147,0.00036163695,0.00013689157,0.0007117561,0.0005267006,0.51396316,0.04744688,0.1729358,0.011291622,0.24663289],"study_design_scores_gemma":[0.00007979513,0.00018333367,0.0005151676,0.00001940348,0.000033862965,0.00013683055,0.000061016442,0.9560408,0.008142795,0.015876893,0.018873632,0.000036427842],"about_ca_topic_score_codex":0.005651692,"about_ca_topic_score_gemma":0.004214415,"teacher_disagreement_score":0.005651692,"about_ca_system_score_codex":0.0010590521,"about_ca_system_score_gemma":0.0015275525,"threshold_uncertainty_score":0.011237562},"labels":[],"label_agreement":null},{"id":"W4200104696","doi":"10.1155/2021/7941233","title":"Achieve Efficient and Privacy-Preserving Compound Substring Query over Cloud","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Computer science; Homomorphic encryption; Encryption; Cloud computing; Theoretical computer science; Heap (data structure); Data mining; Data structure; Computer security; Algorithm","score_opus":0.009903673948360971,"score_gpt":0.23106778857178134,"score_spread":0.22116411462342037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200104696","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.13650651,0.0010887845,0.85507554,0.0005613669,0.000082794824,0.00032269544,0.00059515674,0.0017383016,0.004028778],"genre_scores_gemma":[0.8750269,0.00049579353,0.12090983,0.00021510235,0.00006677364,0.00010794344,0.0005848103,0.000056201323,0.002536631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973616,0.00035006757,0.00027548615,0.00038470433,0.0010770105,0.00055111764],"domain_scores_gemma":[0.996678,0.0008807444,0.000366302,0.0013886289,0.00051490957,0.00017140844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015602495,0.0005478102,0.0016300024,0.0009748135,0.0012929179,0.0016660169,0.0013433383,0.00094562856,0.0014980722],"category_scores_gemma":[0.0036273645,0.0002436611,0.0007903516,0.0023955465,0.00073094486,0.0051559852,0.0031289537,0.0010003748,0.00063035515],"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.0031440656,0.000808994,0.009352864,0.00065825525,0.00028360198,0.0015368076,0.0013900383,0.11361581,0.18412293,0.16406965,0.015700733,0.5053162],"study_design_scores_gemma":[0.00017565355,0.00048523836,0.0016594684,0.000031388903,0.000099459816,0.0016665305,0.0004073423,0.8155931,0.11378278,0.053720433,0.012283312,0.00009518176],"about_ca_topic_score_codex":0.0018355455,"about_ca_topic_score_gemma":0.0013405221,"teacher_disagreement_score":0.0018355455,"about_ca_system_score_codex":0.0010199536,"about_ca_system_score_gemma":0.0024520762,"threshold_uncertainty_score":0.008251548},"labels":[],"label_agreement":null},{"id":"W4210349797","doi":"10.1155/2022/4827956","title":"Game-Based Channel Selection for UAV Services in Mobile Edge Computing","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"UAV Applications and Optimization","field":"Engineering","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 Windsor","funders":"Fundamental Research Funds for the Central Universities; Beijing Nova Program; Beijing Municipal Natural Science Foundation; Beijing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Computer science; Base station; Channel (broadcasting); Transmission (telecommunications); Enhanced Data Rates for GSM Evolution; Selection (genetic algorithm); Computer network; Mobile edge computing; Nash equilibrium; Selection algorithm; Computation; Distributed computing; Game theory; Mathematical optimization; Server; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.005224125387027833,"score_gpt":0.20748868205873697,"score_spread":0.20226455667170914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210349797","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.08514094,0.00047447174,0.9039922,0.00051351305,0.000120259276,0.0002414057,0.00011043286,0.00016745318,0.009239274],"genre_scores_gemma":[0.96149266,0.00024652592,0.03559306,0.00010828283,0.000027208946,0.0001204042,0.000046284506,0.00002245887,0.002343197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00032767674,0.000022401888,0.0001218228,0.000111820205,0.00022626897],"domain_scores_gemma":[0.9985247,0.0010021067,0.00009917219,0.000052023028,0.00017581451,0.00014625883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007522169,0.00081971847,0.00079120084,0.0004527321,0.00083351776,0.0010575312,0.0010280429,0.0006984879,0.0025949774],"category_scores_gemma":[0.002605058,0.00027039537,0.00046584962,0.00048163757,0.00088603573,0.0011687018,0.0010655974,0.00092898746,0.00020574164],"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.00021759694,0.00010760596,0.0012601672,0.000102487764,0.000046365658,0.0003207087,0.00013498229,0.94158816,0.0039355746,0.030644706,0.0025145619,0.019127032],"study_design_scores_gemma":[0.000013081526,0.000031271993,0.000093027644,0.000004106232,0.000007697482,0.00003146942,0.00003847134,0.994574,0.0003462333,0.0044888076,0.00036623428,0.0000055823502],"about_ca_topic_score_codex":0.0066886744,"about_ca_topic_score_gemma":0.008536316,"teacher_disagreement_score":0.0066886744,"about_ca_system_score_codex":0.0012345397,"about_ca_system_score_gemma":0.001584415,"threshold_uncertainty_score":0.013299525},"labels":[],"label_agreement":null},{"id":"W4213321098","doi":"10.1155/2022/4260804","title":"A New V-Net Convolutional Neural Network Based on Four-Dimensional Hyperchaotic System for Medical Image Encryption","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Scientific Research Fund of Liaoning Provincial Education Department; Taif University","keywords":"Encryption; Computer science; Chaotic; Convolutional neural network; Plaintext; Algorithm; Cellular neural network; Artificial intelligence; Robustness (evolution); Artificial neural network; Theoretical computer science; Computer network","score_opus":0.013473229974068458,"score_gpt":0.23216023647359757,"score_spread":0.2186870064995291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213321098","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.10781061,0.0018397382,0.8772734,0.00036238928,0.00025474714,0.00010449579,0.0001451896,0.0011692414,0.011040192],"genre_scores_gemma":[0.8887611,0.0008328789,0.09894509,0.00018637304,0.000040234492,0.00008030151,0.00023420466,0.000034022007,0.0108857555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989855,0.000011801535,0.0000071300797,0.0000216407,0.00004361023,0.000017191533],"domain_scores_gemma":[0.99993,0.000012299822,0.000009871569,0.0000068397408,0.000033688513,0.0000071513127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001884888,0.00028602633,0.0002274199,0.00024282643,0.00018239513,0.00034308995,0.0006136833,0.00039135545,0.0013134229],"category_scores_gemma":[0.00025554065,0.00015821293,0.0002433658,0.0002337076,0.0001986981,0.00062536367,0.00032880047,0.00032982993,0.00027405226],"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.00058753445,0.00019199749,0.0052664643,0.0004026684,0.00022664144,0.0005003696,0.00013319384,0.23869242,0.2481386,0.022306914,0.007500475,0.4760528],"study_design_scores_gemma":[0.000020393387,0.00018308195,0.0011393952,0.00001348885,0.00003592385,0.0002477682,0.000008958379,0.96577394,0.02687274,0.0011831446,0.004498621,0.000022572087],"about_ca_topic_score_codex":0.0033022843,"about_ca_topic_score_gemma":0.0046075573,"teacher_disagreement_score":0.0033022843,"about_ca_system_score_codex":0.0004910818,"about_ca_system_score_gemma":0.00046749512,"threshold_uncertainty_score":0.0065661073},"labels":[],"label_agreement":null},{"id":"W4242921238","doi":"10.1002/sec.117","title":"Call for Papers: Special issue on security challenges in emerging and next‐generation wireless communication networks (security and communication networks)","year":2009,"lang":"en","type":"paratext","venue":"Security and Communication Networks","topic":"ICT Impact and Policies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Ottawa; Research Canada","funders":"","keywords":"Computer science; Computer security; Wireless; Wireless network; Computer network; Telecommunications","score_opus":0.03029214199420397,"score_gpt":0.2691570808948698,"score_spread":0.23886493890066582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242921238","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004613205,0.015239124,0.0015353509,0.061616052,0.79121906,0.00053805654,0.0010812283,0.00042820966,0.12788166],"genre_scores_gemma":[0.0021008812,0.019034646,0.0007946822,0.011719397,0.46067494,0.0003940649,0.0016416069,0.0006224423,0.5030173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957508,0.00048930105,0.00040023949,0.00046690213,0.0025126145,0.00038019635],"domain_scores_gemma":[0.98288214,0.0031970122,0.0010618081,0.000714602,0.008351895,0.0037925218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044039604,0.0028437804,0.0033228274,0.0032865582,0.0024663846,0.01414047,0.0035930716,0.009077425,0.22421022],"category_scores_gemma":[0.013176774,0.0007014601,0.0017805877,0.0036516923,0.0011027603,0.007792081,0.0023355815,0.005863198,0.19297042],"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.000022317687,0.000034631412,0.00006694435,0.0002106416,0.000007761405,0.000045813846,0.000008256782,0.000035607383,0.00008196469,0.0006686948,0.9819748,0.016842479],"study_design_scores_gemma":[0.000020564508,0.00004109132,0.00039507772,0.00021977373,0.000011105935,0.000059517464,0.000036022888,0.00010747251,0.000099864425,0.0012231924,0.9977754,0.000010828367],"about_ca_topic_score_codex":0.00066234573,"about_ca_topic_score_gemma":0.0013384458,"teacher_disagreement_score":0.22421022,"about_ca_system_score_codex":0.003195191,"about_ca_system_score_gemma":0.003184705,"threshold_uncertainty_score":0.75005794},"labels":[],"label_agreement":null},{"id":"W4250069834","doi":"10.1002/sec.16","title":"Editorial","year":2008,"lang":"en","type":"editorial","venue":"Security and Communication Networks","topic":"Network Security and Intrusion Detection","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 Alberta","funders":"","keywords":"Cover (algebra); Computer science; Computer security; Information security; Cloud computing security; Telecommunications; Cloud computing","score_opus":0.005891551368804446,"score_gpt":0.22441986690706014,"score_spread":0.2185283155382557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250069834","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045185163,0.002759952,0.00012397366,0.022702174,0.9665011,0.000026655409,0.00007679032,0.00008272844,0.007681441],"genre_scores_gemma":[0.00093301764,0.0044521354,0.00014520307,0.017838767,0.9224786,0.000031690215,0.00012851587,0.000068760724,0.05392328],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762946,0.00026209216,0.0002597256,0.0003859142,0.0012984719,0.00016436022],"domain_scores_gemma":[0.9866232,0.0028107977,0.0006050356,0.0004752918,0.0074725817,0.002013211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137553,0.002688521,0.0019455049,0.0027910993,0.0021132284,0.0048259506,0.0021865177,0.005731439,0.049281497],"category_scores_gemma":[0.016369501,0.0005811005,0.0012217463,0.000988708,0.0011540597,0.0033022717,0.0009781558,0.009123413,0.04367966],"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.000011707145,0.000005180854,0.000010995601,0.000058320922,0.000002457016,0.00006819278,0.0000050984504,0.000012840383,0.000030511517,0.00019089312,0.9945971,0.005006693],"study_design_scores_gemma":[0.0000133824315,0.000008527322,0.00008671515,0.00013817161,0.0000069601956,0.00022561115,0.000015356398,0.000045244473,0.00007879541,0.00041453796,0.99896145,0.0000052831942],"about_ca_topic_score_codex":0.000911316,"about_ca_topic_score_gemma":0.00149685,"teacher_disagreement_score":0.049281497,"about_ca_system_score_codex":0.0018636459,"about_ca_system_score_gemma":0.0015465351,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4281864394","doi":"10.1155/2022/3592859","title":"Dual-Source Procurement Strategy of Cross-Border E-Commerce Supply Chain considering Members’ Risk Attitude","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","cited_by":4,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Ministry of Public Security of the People's Republic of China; Jilin Office of Philosophy and Social Science; Science and Technology Commission of Shanghai Municipality","keywords":"Risk aversion (psychology); Supply chain; Business; Profit (economics); Marketing; Risk perception; Risk management; Preference; Microeconomics; Variance (accounting); Expected utility hypothesis; Actuarial science; Economics; Finance; Financial economics; Perception","score_opus":0.017292036973850886,"score_gpt":0.2924000547691378,"score_spread":0.2751080177952869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281864394","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.4673384,0.0008185362,0.4851571,0.00093037257,0.00007665856,0.00019327027,0.00007518832,0.00019372073,0.045216832],"genre_scores_gemma":[0.9832555,0.00023794337,0.010770581,0.00003121614,0.000008866361,0.000042796837,0.000026456437,0.000010371542,0.0056161494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992706,0.00023177211,0.00003719365,0.00013973295,0.00018096382,0.00013972976],"domain_scores_gemma":[0.9992167,0.0002280312,0.000107842796,0.00006283478,0.0002459391,0.000138692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055195,0.00067011063,0.0006411612,0.0009270112,0.0012085658,0.0020925724,0.0011206644,0.001200113,0.0062711467],"category_scores_gemma":[0.0019096741,0.00045237536,0.00078916556,0.0009786427,0.00066631066,0.0026487492,0.002261367,0.0005609732,0.00057521556],"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.0005860367,0.00021245744,0.012007635,0.00032778137,0.00016004463,0.0028920386,0.0017295313,0.7960897,0.010760516,0.07993113,0.0023349968,0.09296816],"study_design_scores_gemma":[0.00003081078,0.00017229671,0.0013858518,0.000028577715,0.00005686155,0.00030437871,0.00074119336,0.9735314,0.0012035507,0.020937432,0.0015635316,0.000044106164],"about_ca_topic_score_codex":0.00377411,"about_ca_topic_score_gemma":0.00267785,"teacher_disagreement_score":0.0062711467,"about_ca_system_score_codex":0.001177671,"about_ca_system_score_gemma":0.0010489504,"threshold_uncertainty_score":0.020979106},"labels":[],"label_agreement":null},{"id":"W4283277521","doi":"10.1155/2022/1336094","title":"Privacy-Aware Task Assignment for IoT Audit Applications on Collaborative Edge Devices","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Task (project management); Distributed computing; Edge device; Internet of Things; Resource (disambiguation); Computer network; Computer security; Cloud computing; Artificial intelligence","score_opus":0.01228349747548936,"score_gpt":0.2524739103414037,"score_spread":0.24019041286591436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283277521","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.078015864,0.0002642534,0.9170022,0.00030903515,0.00007133049,0.00018993313,0.00007870988,0.00030722003,0.0037614384],"genre_scores_gemma":[0.8094572,0.00019032812,0.18693383,0.00012916952,0.000040199866,0.00023063175,0.00014754817,0.00007496298,0.0027961512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842936,0.00047732797,0.00009724094,0.00035710481,0.0002563847,0.0003825086],"domain_scores_gemma":[0.99848336,0.00061368686,0.00015526373,0.00031932298,0.00019032421,0.00023813339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015869862,0.0009512822,0.0011657237,0.00047189245,0.0013711863,0.0013061875,0.0016619477,0.00094530237,0.0024756454],"category_scores_gemma":[0.0037850908,0.0003862204,0.00078804133,0.0010536576,0.0006124218,0.002297291,0.0024068044,0.0011146739,0.00038859103],"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.00083652703,0.00053617585,0.003297156,0.0003144518,0.00009100098,0.0005642377,0.0006556364,0.77692956,0.014611168,0.03615072,0.005658803,0.16035454],"study_design_scores_gemma":[0.000027893426,0.00007981642,0.0004855057,0.000008702467,0.000016707343,0.0001339118,0.00015854964,0.9780377,0.0019310317,0.017441692,0.0016652441,0.000013183412],"about_ca_topic_score_codex":0.0021235906,"about_ca_topic_score_gemma":0.0025416042,"teacher_disagreement_score":0.0024756454,"about_ca_system_score_codex":0.0007916333,"about_ca_system_score_gemma":0.001531369,"threshold_uncertainty_score":0.00839287},"labels":[],"label_agreement":null},{"id":"W4311923456","doi":"10.1155/2022/7424094","title":"Federated Learning Framework Based on Data Value Evaluation in Industrial IoT","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Beijing Municipal Commission of Education; Ministry of Education of the People's Republic of China; Major Research Plan; Canadian Institute for Advanced Research","keywords":"Computer science; Upload; Federated learning; Premise; Big data; Data sharing; Task (project management); Information privacy; Artificial intelligence; Machine learning; Data mining; Computer security; World Wide Web","score_opus":0.08397483923971419,"score_gpt":0.31747431606143944,"score_spread":0.23349947682172525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311923456","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.03245808,0.00030929907,0.9648882,0.00029028067,0.0000356852,0.000051658455,0.000048531314,0.00062873977,0.0012895089],"genre_scores_gemma":[0.89471865,0.00020559742,0.10289293,0.0001590251,0.00003738238,0.00010390998,0.00016217025,0.000056112567,0.0016642618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965773,0.0011075106,0.00021806848,0.0008595732,0.00087391253,0.00036353432],"domain_scores_gemma":[0.9978872,0.00076252385,0.00018847366,0.00039008912,0.00060959393,0.00016223956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053535826,0.00076977035,0.0015636062,0.0010557742,0.0009315507,0.002002709,0.0023862487,0.001210106,0.0011791706],"category_scores_gemma":[0.0060491962,0.0003663466,0.00092112954,0.0012654623,0.0012350578,0.0040770015,0.0026249965,0.001431387,0.00018902747],"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.0004614173,0.00043115683,0.006246854,0.0001047776,0.0001883883,0.00036694648,0.00036591143,0.71261114,0.0032704116,0.05093645,0.0025086277,0.22250798],"study_design_scores_gemma":[0.00000781376,0.000025553887,0.00016024441,0.0000045045194,0.00001309169,0.000026792071,0.000017659788,0.98392326,0.0008679477,0.014650585,0.00029535982,0.0000072426637],"about_ca_topic_score_codex":0.0044262847,"about_ca_topic_score_gemma":0.0028852595,"teacher_disagreement_score":0.0053535826,"about_ca_system_score_codex":0.0018927391,"about_ca_system_score_gemma":0.0019501091,"threshold_uncertainty_score":0.028312802},"labels":[],"label_agreement":null},{"id":"W4313331823","doi":"10.1155/2022/9403986","title":"Impact of Digital Transformation of Engineering Enterprises on Enterprise Performance Based on Data Mining and Credible Bayesian Neural Network Model","year":2022,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Economic and Technological Systems Analysis","field":"Business, Management and Accounting","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":"Université du Québec","funders":"","keywords":"Computer science; Digital transformation; Artificial neural network; Sample (material); Data mining; Bayesian probability; Portfolio; Process (computing); Big data; Transformation (genetics); Artificial intelligence; Machine learning; Data science; Finance","score_opus":0.01794663497345245,"score_gpt":0.21513217470524937,"score_spread":0.19718553973179692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313331823","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.9401031,0.0003584899,0.052299306,0.00062033185,0.000028168359,0.000053876684,0.00024075493,0.00014568378,0.006150212],"genre_scores_gemma":[0.99701047,0.00013417033,0.0021983231,0.000014829894,0.000006692962,0.00001291965,0.00013700279,0.000003871576,0.0004816553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927384,0.0002230671,0.000051443003,0.00013928105,0.00021446834,0.00009799572],"domain_scores_gemma":[0.9967667,0.002178647,0.0003758702,0.0001286717,0.00046198315,0.000088118984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020695038,0.0005339872,0.00039383533,0.0013700547,0.00028848293,0.0013552185,0.0005365021,0.00056199165,0.0010477634],"category_scores_gemma":[0.008329057,0.00017974277,0.00060621323,0.0010936648,0.00035025072,0.001767825,0.00060671696,0.0007250189,0.00013887243],"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.00021233784,0.0002263394,0.111970015,0.00007978389,0.000119888646,0.00018916867,0.00018674044,0.82763624,0.0007036698,0.005168258,0.00079815055,0.05270939],"study_design_scores_gemma":[0.000002831765,0.00001940801,0.007108782,0.0000072601665,0.0000151399,0.000010388319,0.000027000477,0.9915494,0.00026899096,0.0009029239,0.00008112679,0.000006736582],"about_ca_topic_score_codex":0.018112635,"about_ca_topic_score_gemma":0.010991094,"teacher_disagreement_score":0.018112635,"about_ca_system_score_codex":0.0014092991,"about_ca_system_score_gemma":0.00089129916,"threshold_uncertainty_score":0.036014378},"labels":[],"label_agreement":null},{"id":"W4386387815","doi":"10.1155/2023/8227751","title":"Metamorphic Malware and Obfuscation: A Survey of Techniques, Variants, and Generation Kits","year":2023,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":30,"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 Winnipeg; University of Manitoba","funders":"Mitacs; University of Manitoba","keywords":"Obfuscation; Malware; Computer science; Cryptovirology; Computer security; Malware analysis; Context (archaeology); Encryption; Evasion (ethics); Reverse engineering; Ransomware; Data science","score_opus":0.028782357227003234,"score_gpt":0.26286194313387284,"score_spread":0.2340795859068696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386387815","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0320557,0.8638327,0.06146424,0.0016057097,0.0005222359,0.00031403074,0.000999604,0.0011987736,0.03800698],"genre_scores_gemma":[0.07973253,0.843261,0.060627993,0.0009830783,0.00058054575,0.00025090223,0.0019392614,0.00038928448,0.012235418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859923,0.00016782341,0.0001281146,0.00020716272,0.00077505014,0.0001226502],"domain_scores_gemma":[0.9968112,0.0020067764,0.00038762277,0.00025711762,0.00046511606,0.000072218834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092398486,0.0012295305,0.0008401373,0.0073125255,0.00069977785,0.002226714,0.0007966244,0.000979985,0.0029369171],"category_scores_gemma":[0.0035241335,0.0007572352,0.00081809296,0.004904142,0.0010152603,0.004585624,0.0010890207,0.0015852262,0.0016942718],"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.000090196576,0.0000889026,0.0040148697,0.0043685897,0.000046021793,0.00021699439,0.00074428145,0.001887825,0.0051248395,0.01612274,0.011200374,0.95609444],"study_design_scores_gemma":[0.000018967461,0.00045616995,0.011540072,0.007464949,0.0001533755,0.007754309,0.0011451134,0.007999622,0.020853117,0.023745582,0.91869193,0.00017679342],"about_ca_topic_score_codex":0.0013470311,"about_ca_topic_score_gemma":0.001569661,"teacher_disagreement_score":0.0073125255,"about_ca_system_score_codex":0.0007336442,"about_ca_system_score_gemma":0.0010687552,"threshold_uncertainty_score":0.009824991},"labels":[],"label_agreement":null}]}