{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9173419,0.012110532,0.06649452,0.00056694774,0.0002179987,0.001090594,0.000005582361,0.00022734921,0.001944596],"genre_scores_gemma":[0.9895268,0.005931344,0.0042948863,0.000062369734,0.00002878593,0.00008996344,0.000042519547,0.0000138081905,0.000009537871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924344,0.000088860535,0.00020217932,0.00018438853,0.00009674255,0.00018436868],"domain_scores_gemma":[0.9993635,0.00015280422,0.00004664508,0.00035683461,0.000029173381,0.000051065726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625613,0.00011920877,0.00013966455,0.00006467466,0.00026043536,0.00004611733,0.0001577579,0.00008539009,7.321682e-7],"category_scores_gemma":[0.000006951413,0.00011634585,0.000014644209,0.0002068826,0.00006880764,0.0000628205,0.00007839856,0.00019453705,3.4055873e-7],"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.00054674124,0.00044019174,0.004057653,0.0027910604,0.00011868988,0.0000029257942,0.016100138,0.85857093,0.00007015564,0.09740858,0.0010866302,0.018806314],"study_design_scores_gemma":[0.00063823734,0.00003361686,0.0089858025,0.00039362037,0.000016701479,0.0000022540844,0.00029257036,0.98190194,0.000004962343,0.0010114587,0.0065548797,0.00016392989],"about_ca_topic_score_codex":0.00001665038,"about_ca_topic_score_gemma":0.0019826517,"teacher_disagreement_score":0.12333104,"about_ca_system_score_codex":0.00005434073,"about_ca_system_score_gemma":0.000003533016,"threshold_uncertainty_score":0.4744446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7599557,0.008063162,0.22619152,0.0017458335,0.000510353,0.0009567143,0.000004338827,0.000363492,0.0022089016],"genre_scores_gemma":[0.9916951,0.001993111,0.005422128,0.00046742868,0.00024079089,0.00007456191,0.00005346091,0.000026848173,0.000026553404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713695,0.0006619212,0.00053479814,0.0004662925,0.0003784193,0.00082162634],"domain_scores_gemma":[0.99696714,0.00049415854,0.00029726123,0.0018221043,0.0001328265,0.0002865105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008352167,0.0003476084,0.0003683463,0.00014803073,0.0003530774,0.00026422867,0.0012329594,0.00025667617,0.000025532903],"category_scores_gemma":[0.000017547614,0.00033559243,0.00006036359,0.0007658175,0.00024396552,0.0010489395,0.0006466993,0.0009195446,0.000016293006],"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.0003136173,0.002127034,0.115346946,0.00009578695,0.00027666605,0.000018904097,0.06056947,0.05029243,0.000059151243,0.66427696,0.00086929265,0.10575377],"study_design_scores_gemma":[0.0011377819,0.00007316345,0.019052004,0.00016835681,0.000022214774,0.000042409876,0.0005282685,0.9765402,0.0000379925,0.0008304309,0.0010266681,0.00054051017],"about_ca_topic_score_codex":0.00014680944,"about_ca_topic_score_gemma":0.0005278014,"teacher_disagreement_score":0.9262478,"about_ca_system_score_codex":0.000121743986,"about_ca_system_score_gemma":0.00003099442,"threshold_uncertainty_score":0.99990964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14054194,0.00072663015,0.85258555,0.0021192988,0.00013512964,0.00096223387,0.000008261762,0.0006952937,0.0022256603],"genre_scores_gemma":[0.9977286,0.000540478,0.00069478597,0.00077966525,0.000019251287,0.00014931457,0.000056767163,0.000024525214,0.000006605354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905515,0.00012292429,0.00026253166,0.00017766221,0.0001084264,0.00027332138],"domain_scores_gemma":[0.9992257,0.00019451628,0.000027432454,0.00042443522,0.00005471185,0.00007322129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018991712,0.00018645967,0.0001933789,0.00012835431,0.00013728948,0.00008783891,0.00033235858,0.00021983043,0.0000633717],"category_scores_gemma":[0.00000887298,0.00018905148,0.000026662277,0.00038843096,0.00007119433,0.00013856147,0.000053097345,0.0005049609,0.000009912186],"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.000020141848,0.00003865498,0.000060376635,0.000011708618,0.000010584234,9.2695495e-7,0.0007392503,0.9677863,0.000045153,0.006841721,0.00080364104,0.02364151],"study_design_scores_gemma":[0.00040143906,0.00007515912,0.00040812825,0.000107796186,0.0000052327573,4.985817e-7,0.0005256639,0.99597836,0.0008780129,0.0012396075,0.00015502093,0.0002250873],"about_ca_topic_score_codex":0.0000869278,"about_ca_topic_score_gemma":0.00038061404,"teacher_disagreement_score":0.8571867,"about_ca_system_score_codex":0.00006025504,"about_ca_system_score_gemma":0.00001084837,"threshold_uncertainty_score":0.7709296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010433927,0.0019477098,0.99517244,0.00086148334,0.00013385239,0.00027815517,0.00002057196,0.00033301575,0.00020935581],"genre_scores_gemma":[0.55001396,0.00066537043,0.44882646,0.00026414334,0.00006393133,0.00004741015,0.000106585336,0.0000065776626,0.0000055548458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989543,0.0001725519,0.0002102537,0.00032445055,0.000120040124,0.0002184325],"domain_scores_gemma":[0.9973551,0.00020280408,0.00012317445,0.00208667,0.00012191338,0.00011030937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009958519,0.0001258161,0.0001632001,0.000053960823,0.00034037104,0.00018181528,0.0020777024,0.00010956906,4.557062e-7],"category_scores_gemma":[0.00003575545,0.0001239814,0.000032345488,0.00023285966,0.00011441981,0.0010115932,0.001368398,0.0002533097,4.882347e-7],"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.000027768547,0.0001564256,0.00023530405,0.000026726171,0.0000584388,0.0000016576048,0.0038202875,0.0002460076,0.0000074715385,0.33433506,0.011052755,0.6500321],"study_design_scores_gemma":[0.0003227828,0.000051826497,0.000036899306,0.00004598749,0.00000866843,0.000009062283,0.0000522725,0.68905914,0.00009231316,0.28197932,0.028164623,0.00017711033],"about_ca_topic_score_codex":0.00008244101,"about_ca_topic_score_gemma":0.00003780875,"teacher_disagreement_score":0.68881315,"about_ca_system_score_codex":0.000019817031,"about_ca_system_score_gemma":0.000020806268,"threshold_uncertainty_score":0.50558144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08409176,0.011011789,0.9003194,0.00026081243,0.00007342675,0.0004990154,0.0000078258645,0.0004718922,0.003264068],"genre_scores_gemma":[0.8880986,0.0005349409,0.11114126,0.00014399985,0.000019516165,0.000036227877,0.000009631911,0.0000057062794,0.000010143859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926484,0.00014119738,0.0001344016,0.00021238417,0.000058044967,0.00018910968],"domain_scores_gemma":[0.9992043,0.00014604226,0.00009634216,0.0004495486,0.00005739674,0.000046421876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032909904,0.00012165228,0.00012971368,0.000055878005,0.00033758368,0.00006986599,0.00048767126,0.00007650192,0.0000011012221],"category_scores_gemma":[0.000013408025,0.00010812454,0.00003756047,0.00011288018,0.00016748367,0.00047909754,0.00037689356,0.000244035,1.1959501e-7],"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.00018007055,0.00019615698,0.0026903546,0.00010324264,0.00012782251,0.000008186205,0.12438423,0.00005704098,0.00015464559,0.56190044,0.00031965473,0.30987814],"study_design_scores_gemma":[0.0013059531,0.00037740293,0.014704762,0.00052427093,0.000045231704,0.00007241145,0.0042140316,0.7470005,0.004794388,0.22442155,0.0014503883,0.0010891244],"about_ca_topic_score_codex":0.00005178597,"about_ca_topic_score_gemma":0.00005235586,"teacher_disagreement_score":0.8040068,"about_ca_system_score_codex":0.000008767253,"about_ca_system_score_gemma":0.000003712486,"threshold_uncertainty_score":0.4409191},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9639067,0.029950952,0.000099281584,0.0002526027,0.00044395516,0.0002109736,0.000013935879,0.00019451174,0.004927108],"genre_scores_gemma":[0.98713183,0.01243075,0.000030143492,0.00014717154,0.00012951308,0.000021414418,0.00008036722,0.000016151995,0.000012650529],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987962,0.00034301123,0.00023858191,0.00013256943,0.00012735596,0.0003622443],"domain_scores_gemma":[0.9989344,0.0003180196,0.000030721854,0.00056520186,0.000027155775,0.00012452721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104107,0.00016469428,0.00020233485,0.00007635582,0.00014231975,0.000045711513,0.00030401698,0.00019231964,0.000029669387],"category_scores_gemma":[0.000044099,0.00016898889,0.000032543412,0.00030571801,0.00011534035,0.0002627794,0.00011484815,0.00065617554,0.00001848871],"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.00024487704,0.0013498619,0.8202341,0.0002599804,0.00013300162,0.000005550274,0.05160114,0.03249932,0.000022665086,0.036842156,0.042661812,0.014145505],"study_design_scores_gemma":[0.0006212126,0.000058583602,0.7481072,0.00020300792,0.000011318223,0.000006697224,0.00051568594,0.21497017,0.00009674996,0.0029593136,0.03186317,0.0005868931],"about_ca_topic_score_codex":0.00041883718,"about_ca_topic_score_gemma":0.0033787184,"teacher_disagreement_score":0.18247084,"about_ca_system_score_codex":0.00003650495,"about_ca_system_score_gemma":0.0000057691723,"threshold_uncertainty_score":0.6891167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686969,0.018380908,0.10922371,0.0009233841,0.00027362278,0.00060705614,0.000047652986,0.00019396495,0.001652807],"genre_scores_gemma":[0.98746157,0.006005574,0.0059073493,0.00020370996,0.0000615938,0.00010312486,0.00024264515,0.000012046769,0.0000024099425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998209,0.00048538242,0.0005433624,0.0002402317,0.00020880021,0.0003132406],"domain_scores_gemma":[0.9967607,0.00036709217,0.00028015327,0.0022737281,0.00017215271,0.00014615047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257317,0.00018510754,0.0002617158,0.00012288397,0.0005198369,0.00016269491,0.0015407982,0.00013540003,0.000034024586],"category_scores_gemma":[0.000015021034,0.00019668539,0.00008453426,0.0004923242,0.00025570838,0.001162687,0.0014261684,0.0004348814,0.000003813499],"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.000023870809,0.0009997572,0.014664,0.00004923527,0.00016066452,3.839423e-7,0.094694875,0.000092627335,0.00025799422,0.82969934,0.0006972888,0.05865994],"study_design_scores_gemma":[0.001811477,0.00020260898,0.010167924,0.0003091084,0.000116123454,0.000022277118,0.008932762,0.8733402,0.0013529988,0.06897926,0.033723276,0.001041997],"about_ca_topic_score_codex":0.0005519713,"about_ca_topic_score_gemma":0.00066199584,"teacher_disagreement_score":0.87324756,"about_ca_system_score_codex":0.00003212458,"about_ca_system_score_gemma":0.000025378786,"threshold_uncertainty_score":0.8020597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2141053,0.0012727336,0.7819917,0.00070676266,0.000105395164,0.00022451875,9.80965e-7,0.001542392,0.00005018905],"genre_scores_gemma":[0.81844074,0.00008676121,0.18097802,0.00037587967,0.000052896863,0.000032364605,0.00002722149,0.000004654109,0.0000014452476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990663,0.0002767657,0.00018452689,0.00021465492,0.00012166603,0.0001360957],"domain_scores_gemma":[0.9986419,0.00024793492,0.00012047632,0.00062521384,0.00021653251,0.00014795229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474615,0.000094467454,0.00011139569,0.000047485206,0.00037026955,0.0001801021,0.000591459,0.00010832735,3.5983052e-7],"category_scores_gemma":[0.00016708024,0.00009441032,0.000022164171,0.00023368002,0.00013378578,0.0005671082,0.00022367836,0.0001395311,3.8931012e-7],"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.00019189347,0.0008349524,0.38368687,0.00016552395,0.0000913167,0.000004988049,0.15591015,0.018086191,0.00024376142,0.17806141,0.0847594,0.17796354],"study_design_scores_gemma":[0.00012752689,0.00010012732,0.0010899565,0.00003798286,0.0000055336836,0.0000045354595,0.00007178791,0.736252,0.000022649285,0.2616937,0.00049199513,0.000102249825],"about_ca_topic_score_codex":0.0005056485,"about_ca_topic_score_gemma":0.00007527951,"teacher_disagreement_score":0.7181658,"about_ca_system_score_codex":0.000047334604,"about_ca_system_score_gemma":0.00008042856,"threshold_uncertainty_score":0.38499412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00521694,0.0035513423,0.98633945,0.00062194746,0.0007712804,0.00070582924,0.0000021996989,0.000270234,0.0025207568],"genre_scores_gemma":[0.99203384,0.0024931151,0.004905148,0.00018848704,0.0001767636,0.00008138838,0.000023665036,0.000011517487,0.000086102045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873924,0.00021787346,0.00031818516,0.00029512472,0.00017916878,0.0002504219],"domain_scores_gemma":[0.998693,0.0001032305,0.00019463334,0.0007339038,0.00013662544,0.00013861337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173013,0.00017499148,0.00018416395,0.00010672114,0.00062489905,0.00022651903,0.0006376768,0.00030376078,0.00001122526],"category_scores_gemma":[0.000014475232,0.00017473257,0.00007294026,0.0003191611,0.000039618975,0.0010593082,0.00017981199,0.0004293536,0.0000048892475],"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.00028996597,0.00013751394,0.000035540284,0.0000930925,0.000060914805,7.3171793e-7,0.018120546,0.0013536307,0.0001732785,0.35142595,0.0030044108,0.62530446],"study_design_scores_gemma":[0.00088409387,0.00028401578,0.00030384108,0.000095816154,0.000028648072,0.000046326288,0.00038422117,0.9245247,0.0010468514,0.03510353,0.036962505,0.00033543888],"about_ca_topic_score_codex":0.000230414,"about_ca_topic_score_gemma":0.0004778639,"teacher_disagreement_score":0.9868169,"about_ca_system_score_codex":0.00005254852,"about_ca_system_score_gemma":0.000027385116,"threshold_uncertainty_score":0.7125387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30559146,0.0012896095,0.68651915,0.0012335817,0.0000905241,0.0009566272,0.000010452226,0.0010240508,0.003284563],"genre_scores_gemma":[0.9922745,0.0005442256,0.0063544563,0.00016033818,0.000054829216,0.00042118572,0.00015593196,0.000026194835,0.000008308762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990597,0.0001866325,0.00027005465,0.00017956333,0.00011285763,0.00019121847],"domain_scores_gemma":[0.99785405,0.0005089875,0.00007234611,0.0013670556,0.00012833464,0.00006922652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061439537,0.00015393939,0.00019704319,0.00004454314,0.00021585923,0.000061462226,0.0004648027,0.00012522592,0.000010587969],"category_scores_gemma":[0.000057897534,0.0001694754,0.000066994064,0.0001301438,0.00012935197,0.00014690848,0.00010029942,0.00029082218,0.000003903862],"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.00025014498,0.0030093803,0.0009139675,0.0013265983,0.00023737062,1.3886107e-7,0.016547011,0.07743152,0.010781059,0.6508403,0.017189225,0.22147329],"study_design_scores_gemma":[0.00028913264,0.000050279556,0.00032655013,0.000047802998,0.000019586842,2.3178734e-7,0.000035988545,0.9457215,0.0029763372,0.024219902,0.026123436,0.0001892474],"about_ca_topic_score_codex":0.000009713244,"about_ca_topic_score_gemma":0.000021030251,"teacher_disagreement_score":0.86829,"about_ca_system_score_codex":0.000052567077,"about_ca_system_score_gemma":0.000008675631,"threshold_uncertainty_score":0.69110066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08171346,0.0009834097,0.807539,0.0006115542,0.000150233,0.108503334,0.00001668221,0.00036217205,0.000120182616],"genre_scores_gemma":[0.85303587,0.000014333744,0.0006803636,0.000111077636,0.000034572637,0.14565836,0.00043156472,0.000030356188,0.0000035110406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987526,0.00013531219,0.00048650356,0.00021039591,0.00014628418,0.00026891104],"domain_scores_gemma":[0.99884075,0.00020877973,0.00010908947,0.00059343356,0.00017122156,0.000076747405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041099533,0.00019092108,0.00019229283,0.0001000341,0.00012237462,0.0001676114,0.00027260158,0.00016869504,0.0000107042215],"category_scores_gemma":[0.00000926084,0.0002027011,0.00004388448,0.0004472271,0.000042517815,0.00019348387,0.000013920626,0.00025938166,0.0000060805523],"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.000027757176,0.0001193686,0.00026497155,0.00042590633,0.000011099978,9.150701e-8,0.0004571027,0.9961273,0.000025128238,0.0016374026,0.00016126706,0.0007426132],"study_design_scores_gemma":[0.0009050132,0.000026754984,0.0034519131,0.00040520704,0.000016043681,3.6246226e-7,0.00019076634,0.99325204,0.00003478706,0.0003166091,0.0011870525,0.00021347436],"about_ca_topic_score_codex":0.00023424742,"about_ca_topic_score_gemma":0.00096810213,"teacher_disagreement_score":0.8068586,"about_ca_system_score_codex":0.00011557663,"about_ca_system_score_gemma":0.000025901934,"threshold_uncertainty_score":0.82659113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10267781,0.0337425,0.8624193,0.000257619,0.00014228457,0.00045018992,0.0000010278204,0.00013280792,0.00017645743],"genre_scores_gemma":[0.9900423,0.0014635422,0.007799797,0.0002996835,0.00019326637,0.00011161149,0.000044554617,0.000014319913,0.0000309105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865156,0.00018694054,0.00033912493,0.00029443487,0.0001253851,0.00040254282],"domain_scores_gemma":[0.9985219,0.00028731156,0.00019262973,0.0006608399,0.00019187258,0.00014543647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008232278,0.00017917156,0.0002229443,0.00005230936,0.00046184112,0.00027206028,0.0007940327,0.00016511328,0.000007083904],"category_scores_gemma":[0.000039595314,0.00017909985,0.000059117672,0.00027443466,0.00008109075,0.0006405076,0.0007397709,0.00028599025,0.0000013155428],"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.00008729776,0.0007286101,0.0049435827,0.0002230888,0.00040158266,0.0000015690566,0.027366621,0.31375587,0.000019211431,0.514494,0.0038688898,0.13410969],"study_design_scores_gemma":[0.00023246674,0.000051494917,0.00024480053,0.000052586296,0.000023043081,0.000016769756,0.00011921868,0.9931662,0.000010041962,0.00020714768,0.005676624,0.00019960075],"about_ca_topic_score_codex":0.00002178155,"about_ca_topic_score_gemma":0.00006435631,"teacher_disagreement_score":0.8873645,"about_ca_system_score_codex":0.00002613871,"about_ca_system_score_gemma":0.00001512765,"threshold_uncertainty_score":0.730348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20557058,0.0003316806,0.77950174,0.0006436114,0.00025646022,0.013250317,0.0000033761535,0.00013430328,0.00030795395],"genre_scores_gemma":[0.9932903,0.00006610913,0.0035901607,0.00009029297,0.00007484337,0.0028648197,0.000012002025,0.000008306936,0.0000031516454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989891,0.00020215707,0.0003204858,0.00019350226,0.00013873915,0.00015601888],"domain_scores_gemma":[0.998496,0.0004479726,0.00031286417,0.000501158,0.00020002661,0.000042005733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396673,0.00011832589,0.00020564182,0.00012953964,0.00011907989,0.000040175797,0.0004152878,0.00023128088,7.6608063e-7],"category_scores_gemma":[0.00010759348,0.00012420122,0.000046816174,0.0005502029,0.000030301599,0.00044947566,0.0002124633,0.00031647828,2.644882e-7],"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.0006652903,0.0015421673,0.004396786,0.0040558153,0.0001432397,8.86622e-7,0.031972375,0.19077381,0.035937764,0.19792888,0.001350548,0.5312324],"study_design_scores_gemma":[0.0008438969,0.0001730173,0.0024262033,0.0002404865,0.000005876524,0.0000030471012,0.000049784132,0.97749174,0.0067935027,0.0046607386,0.00724728,0.00006445059],"about_ca_topic_score_codex":0.00003634399,"about_ca_topic_score_gemma":0.00035570713,"teacher_disagreement_score":0.7877197,"about_ca_system_score_codex":0.000022795746,"about_ca_system_score_gemma":0.000016369517,"threshold_uncertainty_score":0.5064779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17183337,0.0030780747,0.81528443,0.006734881,0.0005380504,0.0010551054,0.000017353319,0.00049533683,0.0009634009],"genre_scores_gemma":[0.994946,0.00030279427,0.0037921397,0.00052623946,0.00009433251,0.00012350804,0.00007615711,0.000014546763,0.00012427918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830925,0.00036405554,0.00043029548,0.00040010692,0.00020441813,0.0002918421],"domain_scores_gemma":[0.9973951,0.00051774684,0.00025964572,0.0014574125,0.00021291693,0.00015720875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008361535,0.00018648451,0.0002457184,0.000093046365,0.0005291235,0.00042512093,0.0009472184,0.00015466585,0.000011488871],"category_scores_gemma":[0.00008912349,0.0001871529,0.00008096059,0.00030361937,0.00010542716,0.0005971547,0.00031045292,0.00020982226,0.000017808894],"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.00005176297,0.00046200654,0.0026925418,0.00019609263,0.00011420215,3.8654332e-7,0.070896335,0.000032732427,0.00017446134,0.8830667,0.0042296173,0.03808315],"study_design_scores_gemma":[0.0008762115,0.00011796567,0.0069762804,0.000077602795,0.000024891417,0.000013151027,0.00025890433,0.85222596,0.000098325545,0.017596405,0.12137182,0.00036247188],"about_ca_topic_score_codex":0.000038707494,"about_ca_topic_score_gemma":0.00021958516,"teacher_disagreement_score":0.8654703,"about_ca_system_score_codex":0.000024864346,"about_ca_system_score_gemma":0.000027510556,"threshold_uncertainty_score":0.76318735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01333722,0.0011033154,0.95083547,0.0020636711,0.00012826333,0.029140305,0.00000582217,0.0004328643,0.00295309],"genre_scores_gemma":[0.976603,0.00024033555,0.013880181,0.00034448004,0.00012368103,0.008774242,0.0000107463475,0.000013594912,0.000009785925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982594,0.0004504752,0.0003530527,0.0004358943,0.00017929001,0.00032184497],"domain_scores_gemma":[0.99792516,0.00038607966,0.00023501695,0.0011071893,0.00016999592,0.00017654074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060983177,0.00021008526,0.00023592205,0.00006952814,0.00058711437,0.0004907422,0.0009897166,0.0001897234,0.000007390826],"category_scores_gemma":[0.00003714752,0.00022221415,0.000033503544,0.0002979157,0.00014846891,0.0005790012,0.0009656782,0.00047043417,0.0000031699674],"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.00006894819,0.0004055534,0.0004431198,0.00013762801,0.0000657418,0.0000011813868,0.0084684,0.007905756,0.0002795913,0.8787012,0.0004653956,0.10305746],"study_design_scores_gemma":[0.00064520707,0.000036100588,0.00021433395,0.00007379931,0.000010158168,0.00001608435,0.000059482216,0.97340834,0.000060445836,0.006575546,0.018649125,0.00025137773],"about_ca_topic_score_codex":0.000108296124,"about_ca_topic_score_gemma":0.00007152159,"teacher_disagreement_score":0.96550256,"about_ca_system_score_codex":0.00003590429,"about_ca_system_score_gemma":0.00003625078,"threshold_uncertainty_score":0.906163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36464512,0.017516209,0.5981323,0.0007178308,0.00092278724,0.0005557562,0.000005167354,0.0009397584,0.016565064],"genre_scores_gemma":[0.99416727,0.0037265553,0.0015744106,0.0003533239,0.00007146919,0.00003588665,0.000012913615,0.000011262786,0.000046888174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858826,0.0002940561,0.00031440577,0.0003507634,0.00016234648,0.00029018236],"domain_scores_gemma":[0.99857426,0.000104445644,0.00017420531,0.00093491777,0.00009055564,0.00012161788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514264,0.00018306273,0.00018292306,0.00007913788,0.0007835289,0.00022021614,0.00081856945,0.00021000061,0.0000525794],"category_scores_gemma":[0.000018650673,0.0001932809,0.000062356026,0.00042535266,0.00013725943,0.00092164066,0.00052208646,0.00047435227,0.000015872703],"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.00037338736,0.0010200589,0.0018325591,0.000117701136,0.0002711487,0.000009922941,0.0390742,0.0007578121,0.0009870951,0.1446928,0.016076315,0.794787],"study_design_scores_gemma":[0.00085237244,0.00031316536,0.0012318896,0.000114562084,0.000032901455,0.000072899194,0.00038499286,0.92517686,0.004628194,0.022200746,0.044295978,0.00069545204],"about_ca_topic_score_codex":0.00012431917,"about_ca_topic_score_gemma":0.00030035773,"teacher_disagreement_score":0.92441905,"about_ca_system_score_codex":0.000029352874,"about_ca_system_score_gemma":0.000009752679,"threshold_uncertainty_score":0.7881766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07961422,0.023504006,0.7812047,0.0026224528,0.000427329,0.102809116,0.000006972462,0.0017391455,0.008072083],"genre_scores_gemma":[0.93228877,0.0031073852,0.0068711415,0.0020266855,0.00009694277,0.055528685,0.000030033789,0.00003862343,0.000011757698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735343,0.0005582815,0.0005193632,0.00067979615,0.00027672938,0.00061239337],"domain_scores_gemma":[0.99652475,0.0006545066,0.00030671776,0.0020740698,0.00014567406,0.0002942629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007057177,0.0003940524,0.00038404838,0.00013084195,0.00075434864,0.0007891715,0.0012854657,0.00031948046,0.000035238125],"category_scores_gemma":[0.000020616668,0.00038894525,0.00010495728,0.0006541938,0.00029595234,0.00077626074,0.00091722043,0.0010119871,0.000007593628],"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.00010864671,0.00057780877,0.002339704,0.00016853047,0.000121124685,0.0000096991425,0.002723676,0.11206754,0.000040360625,0.019233407,0.006994452,0.855615],"study_design_scores_gemma":[0.0009767099,0.00022204842,0.0012923573,0.00037541814,0.000008758307,0.0000049526625,0.000116459414,0.96901196,0.000014232976,0.002202932,0.02530716,0.00046702998],"about_ca_topic_score_codex":0.000015627551,"about_ca_topic_score_gemma":0.000056354536,"teacher_disagreement_score":0.8569444,"about_ca_system_score_codex":0.000043751297,"about_ca_system_score_gemma":0.00003258199,"threshold_uncertainty_score":0.99985623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16676858,0.0040036454,0.8190764,0.0043182517,0.0007018978,0.0019321501,0.000007009905,0.001046214,0.0021458215],"genre_scores_gemma":[0.9884713,0.0010221939,0.009153278,0.0007901564,0.0001543128,0.00030768357,0.0000639126,0.000015927342,0.000021193098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984034,0.00028509286,0.00036163637,0.00041773423,0.00018908105,0.00034308954],"domain_scores_gemma":[0.99772596,0.000380725,0.00021190921,0.0012217207,0.0002988643,0.0001608167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004536906,0.00021233958,0.00023378215,0.00010427756,0.0008145859,0.00040423416,0.0007588942,0.00024846158,0.000018609877],"category_scores_gemma":[0.000055845983,0.0002157558,0.00010973385,0.00041405222,0.00012161729,0.00085645966,0.0002929777,0.0004200704,0.000014584846],"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.0002519183,0.0012052517,0.0021171286,0.00019621031,0.00017475747,0.0000025251907,0.0116669955,0.013920363,0.000267558,0.19295217,0.028126609,0.7491185],"study_design_scores_gemma":[0.00067892176,0.00015984583,0.0018874663,0.00005773522,0.000015480971,0.0000074029176,0.00019100867,0.9679356,0.0001618495,0.0218994,0.006746173,0.00025908963],"about_ca_topic_score_codex":0.00035639183,"about_ca_topic_score_gemma":0.00068525184,"teacher_disagreement_score":0.95401525,"about_ca_system_score_codex":0.00006071582,"about_ca_system_score_gemma":0.000032006235,"threshold_uncertainty_score":0.8798266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07277304,0.010736688,0.8826091,0.025843177,0.0007427983,0.0040605464,0.000018040715,0.00089130265,0.0023252633],"genre_scores_gemma":[0.9688008,0.0014869148,0.026264772,0.0022180893,0.00009744035,0.00067624997,0.00039844745,0.000028505916,0.00002878148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723274,0.00074263336,0.0006530609,0.00051652326,0.000299939,0.0005550802],"domain_scores_gemma":[0.9945881,0.0012542303,0.0003806311,0.0031950239,0.00036791535,0.00021411572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010167839,0.00032541284,0.0003531655,0.000121853795,0.0008471933,0.000648973,0.002550911,0.00030101356,0.000043931177],"category_scores_gemma":[0.00005824662,0.00034268643,0.0001369644,0.00047585845,0.00028856893,0.0007678962,0.00092941115,0.00060761377,0.00003347449],"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.00023529714,0.0027737143,0.0037738641,0.00034567417,0.00047615202,0.000002087555,0.018219665,0.019367758,0.00012328093,0.68651676,0.08138225,0.1867835],"study_design_scores_gemma":[0.0011658291,0.000108754655,0.0014018577,0.00013893092,0.000030347926,0.0000044783296,0.00018537334,0.953915,0.00003667608,0.029886672,0.012719126,0.00040693043],"about_ca_topic_score_codex":0.00030902823,"about_ca_topic_score_gemma":0.0003455065,"teacher_disagreement_score":0.93454725,"about_ca_system_score_codex":0.00008089982,"about_ca_system_score_gemma":0.000030615727,"threshold_uncertainty_score":0.9999025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06171716,0.0055136867,0.93079484,0.00031023458,0.00015931002,0.0012068498,0.000013907572,0.00011224857,0.00017178197],"genre_scores_gemma":[0.99729604,0.00031394965,0.0012238056,0.00036042478,0.00018116189,0.00038781474,0.00021521017,0.00001332324,0.000008291646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846256,0.000342531,0.00028569638,0.0003378359,0.00014948964,0.00042187364],"domain_scores_gemma":[0.9983133,0.0007189075,0.00020480824,0.00047850516,0.000117178985,0.00016730334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008553205,0.00022338629,0.0002652878,0.0000712075,0.0004999017,0.00021232551,0.0004785379,0.00019161667,0.0000034606592],"category_scores_gemma":[0.000040555933,0.00020409958,0.00009936016,0.00030798235,0.00013012523,0.0001988284,0.00029064313,0.0005133277,0.0000013761376],"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.0000749805,0.00029454826,0.0003861255,0.000032376298,0.00012260542,4.769154e-7,0.006195574,0.52705425,0.0000022122822,0.3954261,0.0010064145,0.06940432],"study_design_scores_gemma":[0.0004607053,0.000122050486,0.0005646091,0.0000885883,0.000039852068,0.000008808687,0.00015513574,0.9906897,0.000011574486,0.00039620086,0.00723837,0.00022439951],"about_ca_topic_score_codex":0.000010248944,"about_ca_topic_score_gemma":0.000060144994,"teacher_disagreement_score":0.9355789,"about_ca_system_score_codex":0.000042520725,"about_ca_system_score_gemma":0.000009424976,"threshold_uncertainty_score":0.8322939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747539,0.010975693,0.24005505,0.000025073468,0.0005958507,0.00033706625,0.0000026932175,0.00020654633,0.00026304566],"genre_scores_gemma":[0.99304706,0.0015852348,0.005103375,0.00002335929,0.00013509004,0.0000816322,0.000010056809,0.000013645564,5.575587e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993918,0.000055867506,0.00018078422,0.00008843321,0.00005605918,0.00022707308],"domain_scores_gemma":[0.99941903,0.00017667067,0.00003621549,0.00028744657,0.000018700428,0.00006193219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025987587,0.00010535847,0.00013311577,0.00005622107,0.00015358509,0.000027823182,0.00014741317,0.00019469015,0.0000026049747],"category_scores_gemma":[0.000026905262,0.00010855442,0.00002746894,0.00017902884,0.000034058125,0.0002583839,0.00007049224,0.00038118378,7.3148846e-7],"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.00029881028,0.00013052611,0.008159796,0.0015355748,0.00009170286,0.0000010144818,0.031359505,0.55788726,0.002225358,0.089831404,0.00015332423,0.30832574],"study_design_scores_gemma":[0.0005267291,0.00004101286,0.010220309,0.0005521326,0.000019042698,0.000019990652,0.002677928,0.9700485,0.0011663019,0.009192887,0.005175472,0.0003597209],"about_ca_topic_score_codex":0.000007333794,"about_ca_topic_score_gemma":0.00006608675,"teacher_disagreement_score":0.41216123,"about_ca_system_score_codex":0.000063842745,"about_ca_system_score_gemma":0.0000025396785,"threshold_uncertainty_score":0.44267207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047400527,0.00087046524,0.950507,0.00002783768,0.0001480546,0.00040302108,0.0000010139253,0.0005910495,0.000051039384],"genre_scores_gemma":[0.98524237,0.00014486887,0.014371322,0.00002289211,0.00006999314,0.00012775006,0.0000026901944,0.000015044094,0.0000030692383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999068,0.0001285412,0.00026726437,0.0002741311,0.0000912911,0.00017074909],"domain_scores_gemma":[0.9989093,0.00017836255,0.00022713869,0.00047359683,0.00015000321,0.00006159594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005232742,0.000125681,0.00016521256,0.00007586538,0.00053545675,0.00022673073,0.00025166,0.0001287361,1.3846117e-7],"category_scores_gemma":[0.000034115652,0.00013811019,0.000023996226,0.00015059649,0.000037932536,0.00066627737,0.00014378194,0.00020754526,2.0449741e-7],"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.0004783466,0.00031184166,0.0009302206,0.009792015,0.00023904376,0.0000054286093,0.016743513,0.2119418,0.040751003,0.11080641,0.00007085965,0.6079295],"study_design_scores_gemma":[0.00017987685,0.00006714052,0.00007948612,0.000270333,0.000009699606,0.00009692666,0.0003089108,0.9928384,0.0042478954,0.001376484,0.0003648041,0.00016006446],"about_ca_topic_score_codex":0.00009476257,"about_ca_topic_score_gemma":0.00014182171,"teacher_disagreement_score":0.93784183,"about_ca_system_score_codex":0.000069789574,"about_ca_system_score_gemma":0.00000922634,"threshold_uncertainty_score":0.563197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038452096,0.016572777,0.9413706,0.0007091116,0.0006154594,0.0006127773,0.0000035094286,0.00028370155,0.0013799627],"genre_scores_gemma":[0.99227244,0.0010105434,0.005955787,0.00033164173,0.0002487236,0.00009570141,0.000042439136,0.000016751012,0.000025956944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998598,0.00025737126,0.00031893808,0.00024394128,0.00016766792,0.00041410697],"domain_scores_gemma":[0.99812084,0.00041005982,0.00020400848,0.0010084279,0.000107645246,0.0001490392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011906406,0.00016736588,0.00019272152,0.00007666561,0.0004907144,0.0002566461,0.00077567814,0.00013758532,0.0000019262934],"category_scores_gemma":[0.00004074519,0.00017773699,0.00006497638,0.0002526418,0.00007044517,0.0010092327,0.0004311051,0.00035548102,0.0000070421925],"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.00010010646,0.0006230462,0.0040632086,0.00062747137,0.0001868724,0.000003234484,0.033257965,0.10748646,0.00052788295,0.77989376,0.0045252093,0.06870477],"study_design_scores_gemma":[0.00043032964,0.00003363951,0.00047611198,0.0001872788,0.000014640095,0.000014873711,0.00026594938,0.98767006,0.00005661741,0.0016204877,0.00896773,0.00026227083],"about_ca_topic_score_codex":0.000025445617,"about_ca_topic_score_gemma":0.000011639043,"teacher_disagreement_score":0.95382035,"about_ca_system_score_codex":0.000078721554,"about_ca_system_score_gemma":0.000020716267,"threshold_uncertainty_score":0.72479045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087235436,0.002685495,0.90281415,0.00021898645,0.000245039,0.00032778986,0.0000018051027,0.0002773886,0.0061938944],"genre_scores_gemma":[0.9833381,0.0022957884,0.013607489,0.0005609492,0.00009002762,0.000053944797,0.000019020703,0.000022314955,0.000012361997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977926,0.000293759,0.00059786136,0.0005278023,0.00029578563,0.00049218436],"domain_scores_gemma":[0.997038,0.00029323745,0.00032445494,0.0019055594,0.0002085391,0.00023021079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058862055,0.0002922706,0.0004103237,0.00016495712,0.0003251622,0.0000968743,0.0018095962,0.0003171219,0.000020781757],"category_scores_gemma":[0.000015029078,0.00031389925,0.00008876898,0.0009347603,0.00025655594,0.00029655572,0.0009952745,0.0004624735,0.0000049123673],"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.00010478972,0.00043805994,0.00049077184,0.00002982444,0.00006814799,0.000003013541,0.010166693,0.01061701,0.00016755158,0.8901314,0.0004733801,0.08730932],"study_design_scores_gemma":[0.00046893026,0.00012627464,0.00066812197,0.000118472104,0.000023277069,0.000014863042,0.00038856783,0.9861159,0.0012391743,0.008769566,0.0015542908,0.000512588],"about_ca_topic_score_codex":0.00017304576,"about_ca_topic_score_gemma":0.00009386395,"teacher_disagreement_score":0.97549886,"about_ca_system_score_codex":0.000035542682,"about_ca_system_score_gemma":0.00002818137,"threshold_uncertainty_score":0.99993134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008673082,0.011345844,0.97642195,0.00262836,0.00019538043,0.00034054552,0.000020092564,0.00017562578,0.00019914679],"genre_scores_gemma":[0.94042325,0.0013807126,0.055898678,0.0012471607,0.00068961235,0.000031157964,0.00031239394,0.000012668252,0.0000043394098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872696,0.00018748463,0.00025547334,0.0002459757,0.0001221552,0.00046191926],"domain_scores_gemma":[0.9984156,0.00028618812,0.00014486673,0.0008898169,0.000049937047,0.00021359176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122136,0.00018264045,0.00020722834,0.000060327297,0.00062179624,0.00017545631,0.00109681,0.00020688375,0.0000063576344],"category_scores_gemma":[0.000023279745,0.00018081158,0.000116065065,0.00039117396,0.00011547886,0.0005536122,0.00070031954,0.0005103371,9.656767e-7],"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.000049731676,0.00026399788,0.0011702899,0.000019726052,0.00004641998,1.6957445e-7,0.0051549114,0.0004891811,0.0000024939316,0.8545277,0.008677875,0.12959751],"study_design_scores_gemma":[0.0016659873,0.000119225,0.012043469,0.00007431705,0.00006545757,0.000027241904,0.00019900968,0.36025593,0.000010945405,0.28231078,0.34244072,0.00078690593],"about_ca_topic_score_codex":0.000038252503,"about_ca_topic_score_gemma":0.00018312417,"teacher_disagreement_score":0.9317502,"about_ca_system_score_codex":0.000013678106,"about_ca_system_score_gemma":0.000021947757,"threshold_uncertainty_score":0.7373282},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37118444,0.03541241,0.5925006,0.000058760954,0.0001386999,0.00037104735,0.0000034100137,0.00010548125,0.000225155],"genre_scores_gemma":[0.99247754,0.005245468,0.001965348,0.00008299765,0.00010455727,0.00006241176,0.000030162366,0.00002991744,0.0000015725154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990439,0.000105935156,0.00028135927,0.00013765947,0.00008924599,0.0003419046],"domain_scores_gemma":[0.99912643,0.0003519426,0.000045394314,0.0003604186,0.0000283393,0.00008749902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007590115,0.0001531289,0.00020669306,0.000063509826,0.00016686233,0.000053445146,0.00014219394,0.00023239182,0.0000048082456],"category_scores_gemma":[0.000020384974,0.00016858269,0.00003454224,0.00011661541,0.000045442004,0.00036354485,0.00007059031,0.00044895968,9.228787e-7],"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.00005472795,0.000019209561,0.0007041196,0.000024227966,0.00001581175,2.0319531e-7,0.0005067781,0.9357324,0.0000036493016,0.0011311475,0.00010000424,0.061707716],"study_design_scores_gemma":[0.00080707786,0.000013277725,0.0009393645,0.0001919005,0.000025635969,0.000012158255,0.00023378506,0.99514616,0.0000023049988,0.0014034823,0.0010483621,0.0001764801],"about_ca_topic_score_codex":0.000014557832,"about_ca_topic_score_gemma":0.00032142812,"teacher_disagreement_score":0.6212931,"about_ca_system_score_codex":0.000066624845,"about_ca_system_score_gemma":0.0000045964834,"threshold_uncertainty_score":0.68746024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15971993,0.0037545017,0.83201903,0.00043092258,0.0001087595,0.00080086564,0.0000386948,0.0009401574,0.0021871242],"genre_scores_gemma":[0.9890456,0.0027983405,0.007500166,0.00012665942,0.000077070494,0.00011609693,0.0002940464,0.000039548624,0.0000024616209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984718,0.00029761725,0.0004285217,0.0002773109,0.00019143893,0.00033328697],"domain_scores_gemma":[0.9982019,0.0005498887,0.000118355594,0.0008219991,0.00017004691,0.0001377843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007456252,0.00026028586,0.0003022407,0.00011234386,0.0011148121,0.000078341065,0.00070925016,0.00032361623,0.00001211875],"category_scores_gemma":[0.000056132834,0.00029450742,0.00011375688,0.0002217323,0.00014373066,0.0004023,0.00034724962,0.00064734474,0.0000022525462],"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.00036761322,0.0012591621,0.014209609,0.0007909548,0.0006092996,0.0000026631749,0.0458865,0.09853142,0.008082524,0.4257899,0.0036568926,0.4008135],"study_design_scores_gemma":[0.00039074838,0.00008878525,0.0023334005,0.00016148793,0.00002983589,0.0000037453055,0.00010197856,0.82749647,0.0010012167,0.1666998,0.0012407224,0.0004518094],"about_ca_topic_score_codex":0.000116506744,"about_ca_topic_score_gemma":0.00031013062,"teacher_disagreement_score":0.8293257,"about_ca_system_score_codex":0.00008952685,"about_ca_system_score_gemma":0.000014009106,"threshold_uncertainty_score":0.9999507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011420085,0.0054119723,0.9793371,0.001531815,0.000060343606,0.0003498233,0.000008385653,0.0004087896,0.0014716828],"genre_scores_gemma":[0.7189179,0.006484356,0.27418292,0.0002620623,0.00003688543,0.000017533248,0.00008037781,0.000006581257,0.000011419743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990553,0.00014800673,0.00018726742,0.0003128001,0.00009580417,0.00020081109],"domain_scores_gemma":[0.99793684,0.0001248465,0.00008760934,0.0017110233,0.000053756507,0.00008592602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037846557,0.00012635608,0.00013481933,0.000062188294,0.0003490885,0.00033317655,0.0014243787,0.00008504722,0.0000069932803],"category_scores_gemma":[0.000009695794,0.00012254047,0.000017033364,0.00022651468,0.00013723585,0.0012387757,0.0014828673,0.00032183816,0.0000014954661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004964735,0.0001208663,0.00017366145,0.000012960547,0.000022392074,0.0000036658162,0.0009405726,0.000005053692,0.00005106063,0.04233636,0.0012521467,0.9550763],"study_design_scores_gemma":[0.00050601416,0.000069263384,0.0004391383,0.000066364584,0.000011040254,0.000043997672,0.00009808287,0.80190307,0.00025049786,0.18812533,0.008213453,0.00027378622],"about_ca_topic_score_codex":0.000082056504,"about_ca_topic_score_gemma":0.000017490549,"teacher_disagreement_score":0.9548025,"about_ca_system_score_codex":0.0000071584172,"about_ca_system_score_gemma":0.000007924919,"threshold_uncertainty_score":0.49970555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25798634,0.06941919,0.66719323,0.00076040946,0.000592979,0.0017672564,0.000074482596,0.0009202069,0.0012859085],"genre_scores_gemma":[0.9799368,0.011406346,0.0072859083,0.00020007935,0.0002865062,0.0002499039,0.00055077515,0.00007240146,0.000011302156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984439,0.00013963778,0.00041636726,0.0002844884,0.00014239925,0.00057320436],"domain_scores_gemma":[0.99825025,0.00058721483,0.0000833523,0.0008375357,0.000107807144,0.0001338273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037079008,0.0002914562,0.00037634154,0.000094734074,0.00037741815,0.00007178088,0.00044238914,0.00051385624,0.00006994675],"category_scores_gemma":[0.00007567056,0.00033606775,0.000085434556,0.00068339525,0.00016276007,0.00024368732,0.0001595786,0.0010229378,0.0000030014583],"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.00002440058,0.000049594702,0.0003373013,0.000046468864,0.000034813296,0.000008067586,0.00090793794,0.9880173,0.0000013334557,0.0033193424,0.0044401577,0.002813246],"study_design_scores_gemma":[0.0004620489,0.00001982781,0.0022849143,0.00035480055,0.000017439164,0.00004956443,0.00010189671,0.9755147,0.0000028413742,0.0063732523,0.014456196,0.0003625004],"about_ca_topic_score_codex":0.000035275316,"about_ca_topic_score_gemma":0.00024950932,"teacher_disagreement_score":0.7219504,"about_ca_system_score_codex":0.00007872305,"about_ca_system_score_gemma":0.000023078403,"threshold_uncertainty_score":0.99990916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22943574,0.03599669,0.7256618,0.0006064377,0.0010631506,0.0015231388,0.000023006762,0.0010956387,0.0045944103],"genre_scores_gemma":[0.99360913,0.004888725,0.0007704914,0.0001442367,0.00020551318,0.00014207858,0.00016326405,0.00004332781,0.00003321752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998668,0.00013601806,0.00041803482,0.00026402588,0.00014091766,0.00037298325],"domain_scores_gemma":[0.9984788,0.00029612673,0.00009040069,0.00091910374,0.00010021766,0.000115355746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048048253,0.00023162301,0.00027247472,0.000062996536,0.0004509581,0.00006504046,0.0004480133,0.00025881422,0.000024965435],"category_scores_gemma":[0.000020733962,0.00026443385,0.000095490424,0.000221717,0.00028921463,0.00024085442,0.00017816633,0.0005453459,0.000006404836],"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.0015444949,0.0021736505,0.017437011,0.0025258448,0.0014707516,0.000021270564,0.14839941,0.27550596,0.00039256964,0.10608666,0.030867442,0.41357493],"study_design_scores_gemma":[0.00066333957,0.000043755204,0.001410354,0.00013382242,0.000042475072,0.000018415718,0.0005617458,0.97681826,0.000051300423,0.0060504004,0.013870608,0.0003355178],"about_ca_topic_score_codex":0.000030857944,"about_ca_topic_score_gemma":0.00036236548,"teacher_disagreement_score":0.7641734,"about_ca_system_score_codex":0.00009460333,"about_ca_system_score_gemma":0.000013393145,"threshold_uncertainty_score":0.9999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1815047,0.0126737915,0.77316105,0.0133822085,0.00046451832,0.008808491,0.000028874541,0.00045300927,0.009523356],"genre_scores_gemma":[0.9973676,0.0011698519,0.00087515375,0.0003833992,0.000072205694,0.00010406635,0.00002042594,0.000003869147,0.0000034138739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.00039294543,0.00024184899,0.00011681499,0.00013480448,0.00014189159],"domain_scores_gemma":[0.9988299,0.00005756397,0.00019497961,0.00079409726,0.00006906429,0.000054410633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004097567,0.000098321456,0.00011129643,0.00001832381,0.00058685744,0.00006316943,0.0007263221,0.000062124695,0.0000020671494],"category_scores_gemma":[0.000008078702,0.000071577866,0.00005032987,0.00039293815,0.00024827215,0.00022417548,0.00046274424,0.0003284901,7.0527665e-7],"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.00002569455,0.00007017924,0.005662186,0.000041162486,0.000021769873,5.6277145e-7,0.007049433,0.0015069628,0.0000032005862,0.95230985,0.005856726,0.02745226],"study_design_scores_gemma":[0.0012072203,0.00018103384,0.21853217,0.00034935542,0.000017344051,0.00016823183,0.0004308143,0.37781256,0.000035793873,0.09534472,0.30540177,0.00051899604],"about_ca_topic_score_codex":0.000005290221,"about_ca_topic_score_gemma":0.000016245867,"teacher_disagreement_score":0.8569651,"about_ca_system_score_codex":0.0000048091742,"about_ca_system_score_gemma":0.000016145306,"threshold_uncertainty_score":0.45136923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562094,0.0011282181,0.309448,0.00432152,0.0011151877,0.112249434,0.000007593031,0.0011215108,0.0085145645],"genre_scores_gemma":[0.97860724,0.00033615853,0.0040284493,0.00066364964,0.00012760914,0.016189855,0.0000205908,0.00002274702,0.0000037273178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726427,0.0007047201,0.0007893542,0.00050387066,0.00027259055,0.00046521114],"domain_scores_gemma":[0.9961215,0.00072192185,0.00045814159,0.0022561774,0.00027637175,0.00016586548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014952322,0.00028709043,0.00051151705,0.000105092724,0.00024122572,0.00031399305,0.0032704503,0.0004146915,0.000017341657],"category_scores_gemma":[0.000030161185,0.0002897977,0.00008612679,0.0012028709,0.00016850908,0.0009626647,0.001879205,0.0014321401,0.000001793069],"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.003853072,0.0062231766,0.052763842,0.001675545,0.00045865058,0.000044442557,0.027203098,0.30533838,0.00042883266,0.26482478,0.0037222237,0.33346397],"study_design_scores_gemma":[0.0039149784,0.000035465702,0.0014357128,0.00013096967,0.000009174056,0.0000073681026,0.00002907807,0.9890274,0.000037105983,0.001721136,0.0033540397,0.0002975834],"about_ca_topic_score_codex":0.00014559322,"about_ca_topic_score_gemma":0.005820233,"teacher_disagreement_score":0.683689,"about_ca_system_score_codex":0.000032141186,"about_ca_system_score_gemma":0.00010287949,"threshold_uncertainty_score":0.9999554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003672559,0.003224928,0.8762541,0.025705379,0.000078166806,0.08628587,0.000029543895,0.00094992935,0.0071048527],"genre_scores_gemma":[0.8214517,0.0005865111,0.13869207,0.006671199,0.00055270846,0.031282373,0.0006433958,0.000051166062,0.00006883488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787235,0.0003492974,0.00047478487,0.0006386388,0.0002437719,0.00042115117],"domain_scores_gemma":[0.9960969,0.00053866487,0.00024944323,0.0027942795,0.00012806147,0.00019264845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008582369,0.0002687768,0.0003030693,0.00007236769,0.00064253947,0.0003974762,0.0034057954,0.00029925743,0.000012579725],"category_scores_gemma":[0.000023381333,0.0002525441,0.00006715535,0.00039121066,0.00015256113,0.00080949295,0.0005267354,0.0005408053,0.0000017364345],"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.00032487782,0.0006928617,0.000071073024,0.00017332096,0.00007776714,0.000006544203,0.0073518376,0.0014514273,0.000031703123,0.37193748,0.037957218,0.57992387],"study_design_scores_gemma":[0.0009864422,0.00011898304,0.000072219154,0.00019535262,0.000011889168,0.000019356472,0.00006990046,0.6282267,0.000029878565,0.017973658,0.3520382,0.00025744535],"about_ca_topic_score_codex":0.0000088413335,"about_ca_topic_score_gemma":0.00003975857,"teacher_disagreement_score":0.8210845,"about_ca_system_score_codex":0.000021621147,"about_ca_system_score_gemma":0.000052876414,"threshold_uncertainty_score":0.99999267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31583142,0.009020707,0.6120307,0.023223484,0.0020528396,0.0027345896,0.00011075946,0.0023255046,0.03267002],"genre_scores_gemma":[0.98054624,0.00030741174,0.017337875,0.0015125674,0.0000970335,0.000042801217,0.00014301714,0.000010102948,0.0000029627988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.0001484173,0.00023059607,0.00042413204,0.00026672953,0.00027990073],"domain_scores_gemma":[0.9973572,0.00019533347,0.00013919947,0.0020526142,0.000111734575,0.00014391023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068687723,0.00020718646,0.00017314547,0.000114068804,0.00050475495,0.0003507911,0.0013501189,0.0003607813,0.000033360466],"category_scores_gemma":[0.000032913587,0.00019882442,0.000085581094,0.00051653595,0.00016214863,0.0006101239,0.00039856418,0.0016419629,0.000007276819],"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.000050291397,0.00036295125,0.0011428841,0.00002714491,0.000017805572,0.0000024401265,0.0009554513,0.0002536987,0.00021862361,0.9817604,0.0032533247,0.011954975],"study_design_scores_gemma":[0.00064424553,0.000106938416,0.002987067,0.00007256748,0.000010491237,0.00000746171,0.00004287337,0.9046326,0.00011012732,0.06635299,0.024667438,0.00036517315],"about_ca_topic_score_codex":0.000019227444,"about_ca_topic_score_gemma":0.00028256493,"teacher_disagreement_score":0.9154074,"about_ca_system_score_codex":0.000010570611,"about_ca_system_score_gemma":0.000039217768,"threshold_uncertainty_score":0.81078243},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011403027,0.042826947,0.93481195,0.0032492294,0.0006623223,0.0016401762,0.0000051925686,0.0004286198,0.004972545],"genre_scores_gemma":[0.8366286,0.02993233,0.13083483,0.001727276,0.00025489202,0.00035877977,0.00008258897,0.00004047931,0.00014022988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811876,0.00011234398,0.0004005367,0.0006277061,0.00020178124,0.0005388861],"domain_scores_gemma":[0.99709153,0.00030017135,0.00020845125,0.0020402467,0.00012745574,0.00023214734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009719743,0.0003072924,0.00030323767,0.000066551285,0.0007188074,0.0005097907,0.0015953695,0.0003628256,0.000012165285],"category_scores_gemma":[0.000008888246,0.00031852766,0.00008317829,0.00037355948,0.00025218198,0.0005778987,0.0015467933,0.0010712136,0.0000021550234],"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.00006975962,0.00020377027,0.0006220825,0.000089631816,0.00012950385,0.000004893663,0.0014881563,0.0154626295,0.000011294084,0.76951337,0.015310493,0.1970944],"study_design_scores_gemma":[0.0007403366,0.0000611173,0.00035046146,0.00006653672,0.000026232681,0.000018657109,0.000067182715,0.8812161,0.0000041184944,0.018099133,0.09899817,0.00035193728],"about_ca_topic_score_codex":0.0000053887034,"about_ca_topic_score_gemma":0.00025244497,"teacher_disagreement_score":0.8657535,"about_ca_system_score_codex":0.00001868489,"about_ca_system_score_gemma":0.000016920105,"threshold_uncertainty_score":0.9999267},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029900143,0.024347376,0.85266596,0.0020036648,0.0001409945,0.08940489,0.000048617603,0.0007561903,0.00073214254],"genre_scores_gemma":[0.87714505,0.013667836,0.018983752,0.0005061608,0.000060406637,0.08931541,0.00028505537,0.00002572622,0.0000105889885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980987,0.0003927653,0.00046658362,0.0004927266,0.00018939884,0.00035986688],"domain_scores_gemma":[0.99666893,0.0004750315,0.00031707436,0.002145515,0.00022221699,0.00017120624],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00075490546,0.0002651598,0.00029139765,0.000092058035,0.0014368218,0.00026540103,0.0013432244,0.00027708735,0.0000062819713],"category_scores_gemma":[0.00001905233,0.00027446027,0.00008794614,0.00047623407,0.00046996467,0.0009387615,0.00086250936,0.0005207097,0.0000012304438],"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.0006068019,0.001830385,0.0030499536,0.00041841582,0.00019139127,0.0000043793875,0.034974042,0.0013445652,0.00006191336,0.6842933,0.018207302,0.25501752],"study_design_scores_gemma":[0.0025484103,0.0003208757,0.0020794878,0.00018521404,0.000033914355,0.00009158389,0.00037270854,0.7894482,0.00004375598,0.042928953,0.16125666,0.00069021387],"about_ca_topic_score_codex":0.000018322111,"about_ca_topic_score_gemma":0.00013723511,"teacher_disagreement_score":0.8472449,"about_ca_system_score_codex":0.00002506663,"about_ca_system_score_gemma":0.00004201948,"threshold_uncertainty_score":0.99997073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57346916,0.007116017,0.41681212,0.00033741794,0.000062134495,0.0004384797,0.0000095317155,0.0011411464,0.00061403],"genre_scores_gemma":[0.9848723,0.0031511986,0.011387395,0.00012684014,0.00004122039,0.00005326626,0.00032874302,0.00003567081,0.0000033619394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987277,0.0002469904,0.00041965666,0.00018151867,0.00019098015,0.00023320064],"domain_scores_gemma":[0.9984428,0.00018039781,0.00012068472,0.0009571599,0.00020662932,0.0000922845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031170453,0.00021512815,0.00022576546,0.00013173523,0.00051913847,0.00006229837,0.00037826045,0.0002516315,0.000026306732],"category_scores_gemma":[0.000022478074,0.00023560223,0.000047765196,0.00047835955,0.00021705675,0.00047254656,0.0001230321,0.0005291702,0.00000652043],"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.000026187765,0.00019846608,0.0018604248,0.00010958324,0.000054457432,0.0000015262268,0.002131021,0.9655367,0.00031033345,0.005275284,0.0012889402,0.023207076],"study_design_scores_gemma":[0.00029812768,0.00001771055,0.0022888368,0.00010992051,0.000019724019,0.000020549816,0.000054827036,0.9927719,0.00087409734,0.00071457715,0.0025646444,0.00026504058],"about_ca_topic_score_codex":0.0000816708,"about_ca_topic_score_gemma":0.00007353243,"teacher_disagreement_score":0.41140318,"about_ca_system_score_codex":0.00015125166,"about_ca_system_score_gemma":0.000042522086,"threshold_uncertainty_score":0.96075803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15914312,0.12270376,0.71276265,0.0023414816,0.0005170016,0.001066892,0.0000075608027,0.0004956683,0.00096186704],"genre_scores_gemma":[0.96649975,0.02741346,0.005125499,0.00064314547,0.00002528471,0.00011031811,0.00009250028,0.000011377595,0.00007868804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800885,0.0004094098,0.0005009021,0.00045333555,0.00028489166,0.00034259164],"domain_scores_gemma":[0.9975206,0.00036833546,0.00022045993,0.0015782338,0.00016505965,0.00014726697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009540472,0.00018837432,0.00024019992,0.000720918,0.0004652612,0.00019604363,0.0013127131,0.00024850824,0.000021886244],"category_scores_gemma":[0.000052792424,0.00020238507,0.00007397743,0.004692683,0.00024349385,0.00056795107,0.0003862149,0.00048994744,0.000015369791],"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.00020833549,0.0058161295,0.04579847,0.00016408175,0.00015777009,0.000043842465,0.023488095,0.017433431,0.00013008538,0.14160256,0.021298595,0.74385864],"study_design_scores_gemma":[0.0008628262,0.00006282334,0.024335807,0.000035372024,0.000008294651,0.000017218628,0.000092338596,0.86943614,0.00003688275,0.0014011869,0.103352405,0.000358679],"about_ca_topic_score_codex":0.000030331512,"about_ca_topic_score_gemma":0.00008182474,"teacher_disagreement_score":0.85200274,"about_ca_system_score_codex":0.00007356663,"about_ca_system_score_gemma":0.00005807648,"threshold_uncertainty_score":0.82530236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92901874,0.039610673,0.022780214,0.0002594458,0.002538686,0.002684121,0.00007712131,0.0010493353,0.001981663],"genre_scores_gemma":[0.99072057,0.007201243,0.00040253962,0.00015960446,0.00069707085,0.00051581766,0.00020956396,0.00007581008,0.000017759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798363,0.00019413544,0.0005416333,0.0004619997,0.00018226053,0.00063632557],"domain_scores_gemma":[0.99741584,0.0006673804,0.00013499621,0.0013405735,0.00016720583,0.0002739765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011609645,0.0004194603,0.00051520206,0.0000707947,0.00053957826,0.00023282412,0.00058230135,0.0007030599,0.00004015743],"category_scores_gemma":[0.000033899654,0.00047133653,0.00011867579,0.0002769428,0.00039921785,0.00038180032,0.0003440869,0.0016725976,0.0000019921447],"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.0017594888,0.002786466,0.023619704,0.0032376496,0.0022451184,0.000019440931,0.03873413,0.4079021,0.0010540466,0.14854826,0.09078954,0.27930406],"study_design_scores_gemma":[0.0011311189,0.00007233991,0.0009735131,0.000058584817,0.00010132171,0.000017968632,0.00021711482,0.9531705,0.00005635072,0.0077584893,0.035884276,0.00055847183],"about_ca_topic_score_codex":0.00006311937,"about_ca_topic_score_gemma":0.0015003231,"teacher_disagreement_score":0.54526836,"about_ca_system_score_codex":0.00003628276,"about_ca_system_score_gemma":0.000019369385,"threshold_uncertainty_score":0.99977386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797425,0.017075999,0.0001938721,0.0020018832,0.00019963554,0.00015980113,6.5344443e-7,0.000055794317,0.00056982617],"genre_scores_gemma":[0.9786554,0.020157097,0.00074695883,0.00013278538,0.00022173722,0.00003453963,0.000018991757,0.000007110032,0.000025389729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992017,0.000081699814,0.00023279614,0.0001264335,0.00019406642,0.00016327878],"domain_scores_gemma":[0.9990734,0.0001576676,0.00006338691,0.00046450345,0.000044362612,0.00019671004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089501747,0.0000709509,0.00019884783,0.00018227856,0.00012951961,0.000021967946,0.00014739443,0.00015842874,0.000027305166],"category_scores_gemma":[0.00011149556,0.00006728728,0.000035624045,0.00070083747,0.00008175861,0.000046390465,0.00009932006,0.0009177847,0.0000021460953],"study_design_candidate":"observational","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.000020755677,0.00037566165,0.4889175,0.0000562401,0.000032992582,0.000005505329,0.001271902,0.0000424521,0.000040327315,0.00054881285,0.00017586835,0.50851196],"study_design_scores_gemma":[0.0072492836,0.0013171439,0.41754255,0.0028013894,0.00018948155,0.00024145794,0.0080687525,0.44090274,0.0005171573,0.003874406,0.11607514,0.0012205109],"about_ca_topic_score_codex":0.00027712138,"about_ca_topic_score_gemma":0.00021203428,"teacher_disagreement_score":0.5072915,"about_ca_system_score_codex":0.000023307968,"about_ca_system_score_gemma":0.000053361393,"threshold_uncertainty_score":0.39873686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1331919,0.004187187,0.8605884,0.00026038205,0.00042841313,0.0007428382,0.000010056288,0.00008438029,0.0005064936],"genre_scores_gemma":[0.9788524,0.0062301457,0.014582752,0.000089100206,0.00002013625,0.00015274063,0.00006080617,0.000007612334,0.0000043241253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.0001336545,0.0003329727,0.0003553436,0.00016460684,0.000279594],"domain_scores_gemma":[0.99830526,0.00013670034,0.00013279375,0.0013200352,0.00001924824,0.00008595373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010013174,0.00014941317,0.00017513576,0.00017034622,0.000337243,0.00031562365,0.0012313364,0.00014382083,0.000003915773],"category_scores_gemma":[0.000010178831,0.00016552405,0.00006658715,0.0003574528,0.00012261793,0.0009415468,0.00064287183,0.000457693,0.000001985071],"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.000015080004,0.00019646584,0.002313159,0.00007318708,0.00003036495,0.000001416924,0.0013207018,0.00017358229,0.000078809615,0.9906492,0.000059911305,0.005088109],"study_design_scores_gemma":[0.0013440684,0.000057252153,0.034914654,0.00014832836,0.000030296484,0.000010936844,0.0005363949,0.74487805,0.000020101152,0.19464989,0.022895066,0.000514941],"about_ca_topic_score_codex":0.00009569324,"about_ca_topic_score_gemma":0.002167577,"teacher_disagreement_score":0.8460056,"about_ca_system_score_codex":0.000017044615,"about_ca_system_score_gemma":0.000006487715,"threshold_uncertainty_score":0.6749875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89294356,0.09498142,0.000887407,0.0030171627,0.0003898791,0.0013889131,0.000016810724,0.00035736102,0.006017504],"genre_scores_gemma":[0.7855541,0.21222085,0.00066602696,0.00027814074,0.00092399435,0.00006875991,0.00021952754,0.000057313613,0.000011272795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996379,0.0012558175,0.00094458857,0.00042618794,0.0003727376,0.0006216215],"domain_scores_gemma":[0.99586296,0.00072091375,0.0003160685,0.0025749893,0.00019961208,0.0003254412],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016732235,0.0004983246,0.00060992775,0.00022418478,0.0012867784,0.0003084781,0.0013260324,0.00060482416,0.000043547352],"category_scores_gemma":[0.00011375722,0.00057104276,0.00009230252,0.0005892788,0.00074106327,0.0010977224,0.0010664802,0.0029939308,0.000005192417],"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.0005026686,0.0012146522,0.029217606,0.00031574926,0.0004997488,0.000055128585,0.054332893,0.78581905,0.000018815756,0.014285676,0.052420434,0.061317556],"study_design_scores_gemma":[0.0013913277,0.00008100758,0.01026964,0.0004662409,0.00005129341,0.00020040646,0.00048351276,0.9040961,0.0000057932148,0.0076932996,0.07469744,0.00056388404],"about_ca_topic_score_codex":0.0001480073,"about_ca_topic_score_gemma":0.0012197947,"teacher_disagreement_score":0.11827709,"about_ca_system_score_codex":0.0001870394,"about_ca_system_score_gemma":0.00004095627,"threshold_uncertainty_score":0.9996741},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6886047,0.039656878,0.2059907,0.012948978,0.001596858,0.0013560901,0.000023581908,0.0026976434,0.047124553],"genre_scores_gemma":[0.98961794,0.0068043214,0.0014352846,0.0018899901,0.00015524565,0.000020837055,0.00003343127,0.0000162811,0.00002665436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819106,0.00031685145,0.000329114,0.0004194591,0.00028734398,0.00045616785],"domain_scores_gemma":[0.9970518,0.0006903799,0.00017873482,0.0017371868,0.000106726075,0.00023520118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006115671,0.00023824268,0.00026405734,0.0000894068,0.0009764695,0.00031436363,0.00144192,0.00021867648,0.00001475513],"category_scores_gemma":[0.00009565897,0.00023396513,0.00008491431,0.00057832897,0.00017203562,0.00088002905,0.0006032112,0.0008272115,0.000015284695],"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.00021753204,0.0015772375,0.023511017,0.00010169492,0.00021940206,0.00010073157,0.04238671,0.019841218,0.000015294809,0.6842046,0.1257829,0.10204165],"study_design_scores_gemma":[0.0021877033,0.00047345797,0.02060612,0.00045580143,0.00003472236,0.000296182,0.00031803598,0.7882428,0.000120937526,0.12404693,0.061728336,0.0014889457],"about_ca_topic_score_codex":0.00017746689,"about_ca_topic_score_gemma":0.00014229299,"teacher_disagreement_score":0.7684016,"about_ca_system_score_codex":0.000046985046,"about_ca_system_score_gemma":0.000051524832,"threshold_uncertainty_score":0.95408213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07418118,0.056134798,0.8526533,0.0135472175,0.0002878135,0.00087869924,0.000002804465,0.0014615783,0.0008526082],"genre_scores_gemma":[0.93627805,0.03144344,0.031609777,0.0005202671,0.000029665653,0.00008232954,0.000019513776,0.000011322189,0.000005664693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979331,0.00037077043,0.00043578708,0.00055570883,0.00022404722,0.00048057435],"domain_scores_gemma":[0.99017984,0.00027740264,0.0002066763,0.009172821,0.00007366178,0.000089590736],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011003251,0.00023875164,0.00027223717,0.00018727727,0.00036910892,0.00031798272,0.016845616,0.00038131443,0.000006243379],"category_scores_gemma":[0.0008879489,0.00026245802,0.000053999393,0.00096465176,0.000099525496,0.0011259735,0.031055406,0.0011212191,0.0000032904577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057769605,0.00036519373,0.00023987931,0.000025204947,0.000031206873,0.000013761302,0.0018287789,0.0029028994,0.00021093333,0.026367081,0.005169603,0.9627877],"study_design_scores_gemma":[0.0002745646,0.00009075047,0.0006907472,0.000081389255,0.000004025024,0.000012529167,0.00006655884,0.6314033,0.00013553716,0.36450619,0.0025280209,0.00020636866],"about_ca_topic_score_codex":0.000022094115,"about_ca_topic_score_gemma":0.0002792009,"teacher_disagreement_score":0.96258134,"about_ca_system_score_codex":0.0000987498,"about_ca_system_score_gemma":0.000020790081,"threshold_uncertainty_score":0.9999828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52390695,0.032925583,0.42466283,0.014573137,0.00069603,0.0012187905,0.000024443776,0.0006768538,0.0013153699],"genre_scores_gemma":[0.9804785,0.012395095,0.0059661097,0.0008717606,0.00006540943,0.00004435166,0.00016239024,0.00001239373,0.000003938774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978283,0.0004582213,0.0005229169,0.00042154352,0.00028742052,0.00048156772],"domain_scores_gemma":[0.99779904,0.00028721668,0.00022015187,0.0014351105,0.00013293751,0.00012552785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003344381,0.00022179,0.00028455045,0.000052280033,0.00063506555,0.00011241037,0.0010619928,0.0002481672,0.0000036196336],"category_scores_gemma":[0.000040400406,0.00024425203,0.000063045074,0.0006711163,0.00019259611,0.0008183932,0.00084785064,0.0008553659,0.000004841374],"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.00008108078,0.0008162876,0.016877277,0.00009750314,0.00006313614,0.0000796905,0.12573768,0.026575511,0.0000050819363,0.6899918,0.0042614746,0.13541348],"study_design_scores_gemma":[0.00067167234,0.00012221826,0.00597658,0.00019376725,0.0000051713882,0.0001262305,0.00037420244,0.95457035,0.000045572422,0.025914285,0.011534781,0.00046515043],"about_ca_topic_score_codex":0.0010282468,"about_ca_topic_score_gemma":0.0002793927,"teacher_disagreement_score":0.92799485,"about_ca_system_score_codex":0.0001407879,"about_ca_system_score_gemma":0.00005296101,"threshold_uncertainty_score":0.9960309},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36135268,0.0011060066,0.6260877,0.001499792,0.0001605347,0.00028757605,0.000010958029,0.00030717565,0.009187556],"genre_scores_gemma":[0.98725,0.00028646865,0.012178187,0.00013399254,0.000048720914,0.000015144929,0.000076620854,0.0000057152606,0.000005160346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991631,0.00007098316,0.00017790805,0.0002459314,0.0001611431,0.00018092577],"domain_scores_gemma":[0.9981192,0.0001560303,0.00011028705,0.001419603,0.000095869946,0.00009902532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003190446,0.000114539296,0.000111944224,0.000056897803,0.00039571334,0.00082714116,0.0012289962,0.00010176339,0.000017224997],"category_scores_gemma":[0.000031755913,0.000104428575,0.000032567368,0.00034199638,0.00013993471,0.0018755436,0.0008054243,0.00046384172,0.0000028374545],"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.000028509536,0.0001733547,0.006447659,0.000016954942,0.000035239063,0.0000020023433,0.00280274,0.000091585134,0.00007112426,0.931799,0.0008592975,0.057672556],"study_design_scores_gemma":[0.0016446839,0.00021137396,0.024246372,0.00015072487,0.00004155393,0.00013185169,0.00044462344,0.48214355,0.00034435166,0.38361523,0.10593275,0.0010929215],"about_ca_topic_score_codex":0.000036941474,"about_ca_topic_score_gemma":0.0003553631,"teacher_disagreement_score":0.6258973,"about_ca_system_score_codex":0.000004078068,"about_ca_system_score_gemma":0.000019595636,"threshold_uncertainty_score":0.79761416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048827176,0.00077777315,0.9540507,0.0007203523,0.000076437136,0.04349386,0.0000049130726,0.00011851703,0.00026912818],"genre_scores_gemma":[0.8154837,0.00015107602,0.011499428,0.0004126749,0.00018554748,0.17203507,0.00018492842,0.000017454533,0.000030146988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986443,0.00026512024,0.00029509846,0.00025660446,0.00016144806,0.00037745343],"domain_scores_gemma":[0.99810517,0.00019128936,0.00020356708,0.0013011177,0.000042777025,0.00015609158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077096716,0.00016693033,0.00016367095,0.000026952343,0.00038684462,0.000120807235,0.0008348918,0.00018387823,0.000010149044],"category_scores_gemma":[0.000025177224,0.0001674375,0.000058709356,0.0001725421,0.00008241418,0.0007264638,0.0004849993,0.00029839526,0.0000062643917],"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.00028891678,0.0021883522,0.007833249,0.0003173319,0.00022358239,0.0000013029552,0.011620686,0.016572772,0.00008117511,0.76636887,0.03778025,0.1567235],"study_design_scores_gemma":[0.00083007896,0.00005661873,0.002338737,0.00006958889,0.0000129618875,0.000007446635,0.00003936137,0.7247304,0.000050203536,0.007452948,0.2641645,0.000247184],"about_ca_topic_score_codex":0.000008052077,"about_ca_topic_score_gemma":0.00000935458,"teacher_disagreement_score":0.9425513,"about_ca_system_score_codex":0.000055746703,"about_ca_system_score_gemma":0.000014912623,"threshold_uncertainty_score":0.68279034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92516935,0.03468596,0.001255446,0.00044089116,0.00006273148,0.0009694059,0.00010463034,0.0007086427,0.036602974],"genre_scores_gemma":[0.9739829,0.022301434,0.00280565,0.00010035845,0.000016803899,0.00008541193,0.0006260925,0.000063626896,0.000017761195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709845,0.001004659,0.0010046181,0.00023032758,0.0003674837,0.0002944676],"domain_scores_gemma":[0.993549,0.00070295617,0.00050483516,0.004485136,0.00056171534,0.00019638357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015092319,0.00036372634,0.0006732547,0.00024916686,0.00019631047,0.00006294725,0.0018953757,0.00042046444,0.000045423305],"category_scores_gemma":[0.00007767401,0.00039133098,0.00019428878,0.0005500339,0.000598699,0.0006446794,0.00083285884,0.0012910921,0.0000048635434],"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.002295581,0.007260855,0.06523644,0.002257166,0.0031093794,0.000003405432,0.12653294,0.11328713,0.0019264678,0.3884697,0.18746983,0.102151096],"study_design_scores_gemma":[0.015394017,0.0029168255,0.16556382,0.0061482415,0.00073467905,0.00011272291,0.00890666,0.48322067,0.01087328,0.21274887,0.087306894,0.0060733277],"about_ca_topic_score_codex":0.00049992447,"about_ca_topic_score_gemma":0.00031893645,"teacher_disagreement_score":0.36993355,"about_ca_system_score_codex":0.00026058775,"about_ca_system_score_gemma":0.000110644934,"threshold_uncertainty_score":0.99985385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7826227,0.005674885,0.1906107,0.002999085,0.00087462337,0.0033239133,0.00003778505,0.0016834332,0.01217285],"genre_scores_gemma":[0.9918155,0.00028540802,0.006849458,0.00020908476,0.00011153852,0.00053306686,0.00015390675,0.000024583676,0.00001742036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992261,0.000064332475,0.00019926035,0.00017591742,0.00010297714,0.00023141282],"domain_scores_gemma":[0.9988612,0.00018249759,0.00004833435,0.00072278344,0.00010573739,0.00007946849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023641679,0.0001595595,0.00016358348,0.000041366333,0.00019496358,0.00008461885,0.00028276007,0.00010902887,0.000057602036],"category_scores_gemma":[0.000015459796,0.00015473201,0.00003696438,0.0001666182,0.000118988006,0.00023908682,0.000103674,0.00028195613,0.000004730547],"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.00025431157,0.00066063926,0.039632004,0.0006469127,0.00067433075,0.0000014022829,0.0028655548,0.8252987,0.000049346647,0.021833725,0.09442828,0.013654784],"study_design_scores_gemma":[0.00060629024,0.00004965472,0.013683528,0.000054526474,0.000022111783,3.8538602e-7,0.000168899,0.96234983,0.00003350781,0.0016241905,0.021192394,0.0002146536],"about_ca_topic_score_codex":0.00014970102,"about_ca_topic_score_gemma":0.00039496794,"teacher_disagreement_score":0.20919281,"about_ca_system_score_codex":0.000054867956,"about_ca_system_score_gemma":0.0000105036615,"threshold_uncertainty_score":0.6309788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01517595,0.001493343,0.98020375,0.0014989753,0.00006425301,0.00037335776,0.0000019779404,0.00022582388,0.00096259743],"genre_scores_gemma":[0.98096555,0.00047259624,0.01799799,0.0003124149,0.00006405554,0.000025942732,0.00014214893,0.000010141404,0.000009174073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844635,0.00043657745,0.00022489244,0.00041793333,0.00024970778,0.0002245339],"domain_scores_gemma":[0.9966904,0.00032302437,0.00017822353,0.0026028082,0.000108452004,0.00009712147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011923094,0.00015406722,0.00016898377,0.00019237773,0.00036442728,0.00030910605,0.0018762616,0.00008983644,0.000007271542],"category_scores_gemma":[0.00006080699,0.00013914664,0.000019426116,0.0011287485,0.00016091707,0.0010021549,0.0009567421,0.00036644618,0.00001342076],"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.00018905853,0.00086171494,0.0018068167,0.00019484138,0.00014829355,0.0000071211143,0.0032506671,0.0068262317,0.0006167757,0.29285678,0.0026562354,0.69058543],"study_design_scores_gemma":[0.00050419226,0.00015498028,0.0020743124,0.00007577797,0.00001371038,0.000029750365,0.000024554987,0.98284507,0.00004056825,0.009248936,0.0047734235,0.0002147184],"about_ca_topic_score_codex":0.00011042205,"about_ca_topic_score_gemma":0.00010890644,"teacher_disagreement_score":0.97601885,"about_ca_system_score_codex":0.00003536202,"about_ca_system_score_gemma":0.000030164842,"threshold_uncertainty_score":0.5674235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48472196,0.009591561,0.5018064,0.0013035762,0.0001624624,0.0008633546,0.000008077223,0.00021144039,0.0013311581],"genre_scores_gemma":[0.99238133,0.00479081,0.0016328807,0.0009592767,0.00007044245,0.000045424604,0.00010034896,0.000008713673,0.000010768207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841225,0.00019842741,0.00044267203,0.0004006013,0.00021051719,0.0003355086],"domain_scores_gemma":[0.99735624,0.000345889,0.00033147325,0.00167355,0.0001831097,0.00010975044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007406176,0.00021926787,0.00046008325,0.00014912488,0.0003590973,0.00012951386,0.0014563656,0.00023653074,0.000004730671],"category_scores_gemma":[0.0000042658417,0.00021437679,0.00016663995,0.0012049428,0.0000887769,0.00039105304,0.0002451587,0.00037614274,5.341024e-7],"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.00007914781,0.00021458187,0.0020056784,0.000048868795,0.00038608667,6.923018e-7,0.0017690999,0.82830465,0.000004849549,0.09183781,0.0003050594,0.07504347],"study_design_scores_gemma":[0.00035076894,0.00019815561,0.0090353135,0.00010972844,0.0001851951,0.0000014892152,0.0000418536,0.9871464,0.000017693143,0.0018369862,0.0008613843,0.00021506549],"about_ca_topic_score_codex":0.000013155191,"about_ca_topic_score_gemma":0.00008055058,"teacher_disagreement_score":0.5076594,"about_ca_system_score_codex":0.000021856633,"about_ca_system_score_gemma":0.000015510075,"threshold_uncertainty_score":0.87420315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47993118,0.008356111,0.51011306,0.00048257606,0.00018082697,0.00030786198,0.000006526457,0.00010104984,0.00052083144],"genre_scores_gemma":[0.99241704,0.0017041371,0.0056780465,0.00012211656,0.000044258104,0.00000515763,0.000025059848,0.0000037088078,4.4869577e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849355,0.0003364184,0.00037624576,0.0003312268,0.00018943792,0.00027311407],"domain_scores_gemma":[0.9983854,0.0001729471,0.000091645816,0.0011865298,0.00006541576,0.00009806115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611542,0.00014572102,0.00023145544,0.00028682468,0.00031990052,0.00041176568,0.0010987922,0.00016125651,0.0000028240677],"category_scores_gemma":[0.000025781916,0.00015750033,0.000059925093,0.001730041,0.000089981644,0.0008383419,0.00028916902,0.0003920329,5.615412e-7],"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.0001235675,0.001801719,0.031036632,0.00017858692,0.00007280769,0.000017981669,0.0150508955,0.00640451,0.00049063057,0.7897065,0.0005339396,0.15458217],"study_design_scores_gemma":[0.00059813954,0.000083237595,0.029905967,0.00013458569,0.000013536637,0.00001884811,0.00021933767,0.9493837,0.000015777436,0.01844264,0.00084008905,0.00034414782],"about_ca_topic_score_codex":0.0003030119,"about_ca_topic_score_gemma":0.0001440087,"teacher_disagreement_score":0.94297916,"about_ca_system_score_codex":0.000039036153,"about_ca_system_score_gemma":0.000025966241,"threshold_uncertainty_score":0.6422677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44073868,0.0011181367,0.55292934,0.0021688605,0.0002490708,0.00047627685,0.000015983074,0.0003774796,0.0019261715],"genre_scores_gemma":[0.9827481,0.00027151188,0.016180346,0.00062011677,0.00005326392,0.00002873154,0.00008933427,0.000008092623,4.938854e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.0004146073,0.00021237483,0.00041477897,0.00020385956,0.00026586198],"domain_scores_gemma":[0.997631,0.0003154605,0.00012564244,0.0016240585,0.00010607648,0.00019775155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569891,0.00017435398,0.00014749402,0.0001338962,0.00070199074,0.0005651821,0.0009423535,0.00019671454,0.000016411434],"category_scores_gemma":[0.00005826756,0.00016818056,0.00004139127,0.0004015625,0.00025906527,0.0006055023,0.000327606,0.00082506996,0.0000018835281],"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.00002372184,0.00022713706,0.00058632565,0.000012828148,0.0000062268887,5.484952e-7,0.0015025226,0.00016133214,0.0001235069,0.9861546,0.00005756754,0.01114368],"study_design_scores_gemma":[0.00041765173,0.00010436203,0.0023447566,0.000036185615,0.0000062845074,0.0000067395886,0.00015667544,0.94782037,0.000042955642,0.04558684,0.0032476257,0.00022958717],"about_ca_topic_score_codex":0.000014515726,"about_ca_topic_score_gemma":0.000117328935,"teacher_disagreement_score":0.947659,"about_ca_system_score_codex":0.0000097493385,"about_ca_system_score_gemma":0.000036282272,"threshold_uncertainty_score":0.6858204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027740808,0.00031101887,0.9697826,0.000055212517,0.000106653446,0.000437109,0.0000011856846,0.001177864,0.00038756503],"genre_scores_gemma":[0.9837321,0.000050962488,0.01568846,0.00013376551,0.000043662483,0.0003246919,0.000012010216,0.000012503767,0.0000018128179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985282,0.00062140153,0.00020275907,0.00033087184,0.00013460842,0.00018219951],"domain_scores_gemma":[0.99803704,0.00019067853,0.0001526289,0.0013785247,0.00013722632,0.00010388214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057972217,0.00014972617,0.00016316696,0.00009317293,0.0004767207,0.00015640417,0.00069839193,0.00015833769,0.0000014827126],"category_scores_gemma":[0.00002045108,0.00016051099,0.00004097234,0.00029839092,0.00007978116,0.00064376084,0.00018042795,0.00035318558,0.0000025263164],"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.00006815091,0.00022723363,0.00090474397,0.00007686567,0.000014634471,0.000002575852,0.0008049907,0.0036303548,0.0008888166,0.0469184,0.000027524784,0.9464357],"study_design_scores_gemma":[0.000343502,0.0004451042,0.00394328,0.00006775678,0.000014609492,0.000031009706,0.00008385502,0.98362577,0.006900144,0.0032889955,0.00099409,0.00026188354],"about_ca_topic_score_codex":0.000054051194,"about_ca_topic_score_gemma":0.000119130644,"teacher_disagreement_score":0.9799954,"about_ca_system_score_codex":0.00007575069,"about_ca_system_score_gemma":0.0000074030245,"threshold_uncertainty_score":0.65454483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002903336,0.00084246293,0.9888436,0.0030125338,0.00018622831,0.0003122017,0.0000064140554,0.00015049869,0.0037426858],"genre_scores_gemma":[0.99181575,0.0007450341,0.0054573407,0.0006524685,0.00017822532,0.000058322952,0.0010506542,0.000014955574,0.000027241442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977445,0.00069749466,0.0005000798,0.00051639206,0.00018574383,0.00035576144],"domain_scores_gemma":[0.9966949,0.00084692,0.00026740125,0.0019846873,0.00009575193,0.00011031808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037836,0.00019701288,0.00026753944,0.00010270296,0.0005378706,0.0003298002,0.0023955072,0.0002394034,0.000038623664],"category_scores_gemma":[0.000027084001,0.0002161336,0.00003764471,0.0005461749,0.00010949697,0.00090938894,0.0019004537,0.00061577925,0.0000023944697],"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.0000425437,0.00030159188,0.00223217,0.000031342322,0.000021589773,0.00000179387,0.0022155687,0.00812241,0.0000016348664,0.021279601,0.019333394,0.9464164],"study_design_scores_gemma":[0.00039669638,0.00003159255,0.0009811429,0.00008313958,0.000009553069,0.0000025816894,0.00008632471,0.97747076,7.205316e-7,0.0046164133,0.016086213,0.0002348771],"about_ca_topic_score_codex":0.00005657431,"about_ca_topic_score_gemma":0.00015696167,"teacher_disagreement_score":0.9889124,"about_ca_system_score_codex":0.000041790638,"about_ca_system_score_gemma":0.00003577962,"threshold_uncertainty_score":0.88136727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40466118,0.012981296,0.5778642,0.00025567634,0.00078509917,0.0003237336,7.032817e-7,0.0005414583,0.0025866104],"genre_scores_gemma":[0.9611165,0.00053405593,0.036810994,0.00029174966,0.0012099101,0.000013668419,0.0000021984672,0.000016588405,0.0000043409777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796504,0.0005813375,0.00039730946,0.00028515796,0.0002009903,0.00057016633],"domain_scores_gemma":[0.99802256,0.000622414,0.0003078425,0.0007523322,0.00012398865,0.00017085903],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016784514,0.00019795928,0.00021490829,0.00008112226,0.0014976191,0.00031906954,0.0005519948,0.00019018943,0.000011634005],"category_scores_gemma":[0.00015696895,0.00022071536,0.000066533365,0.00088972435,0.00009125774,0.0014393775,0.00067809684,0.0005760111,0.000005280792],"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.000042742384,0.00010981965,0.011934798,0.00006947499,0.000089223395,0.000002165138,0.0039804657,0.051495522,0.0006935993,0.027337937,0.00014904198,0.90409523],"study_design_scores_gemma":[0.00017056083,0.00002589556,0.0022924377,0.00019726796,0.000027746659,0.00009453251,0.00008540152,0.98699594,0.00023697759,0.007857361,0.0017117506,0.00030411582],"about_ca_topic_score_codex":0.00016571906,"about_ca_topic_score_gemma":0.000032987537,"teacher_disagreement_score":0.93550044,"about_ca_system_score_codex":0.000078414305,"about_ca_system_score_gemma":0.00001991055,"threshold_uncertainty_score":0.9998023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007828414,0.095261626,0.90078825,0.0008991314,0.000115493116,0.0014904337,0.0000025096958,0.00028565776,0.00037403684],"genre_scores_gemma":[0.69731534,0.029236078,0.27088803,0.0018163322,0.00016631685,0.0004959827,0.000038874736,0.000024347133,0.000018729663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732155,0.0005383047,0.0004951396,0.00076641655,0.00022641913,0.00065214816],"domain_scores_gemma":[0.99609596,0.0011478537,0.00028751092,0.0020396488,0.0001492828,0.00027971988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012961407,0.0003927382,0.00047247144,0.000077180666,0.000757967,0.0005574726,0.0015853519,0.00058033294,0.0000041928156],"category_scores_gemma":[0.0000460756,0.00039499244,0.00010964837,0.0005936115,0.00021645603,0.00059340906,0.00055668526,0.001064027,0.0000011766434],"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.00016209159,0.00038966158,0.000055763056,0.0000432392,0.00007676067,0.0000025120737,0.005487112,0.055240612,0.0000026862724,0.42195868,0.003804637,0.51277626],"study_design_scores_gemma":[0.00055657036,0.0003515802,0.00017354218,0.00011651105,0.000030168381,0.000030978714,0.00014616898,0.8331326,0.000003039435,0.15451378,0.0105342,0.00041084964],"about_ca_topic_score_codex":0.0000028058023,"about_ca_topic_score_gemma":0.00000979633,"teacher_disagreement_score":0.777892,"about_ca_system_score_codex":0.000040668052,"about_ca_system_score_gemma":0.000039876035,"threshold_uncertainty_score":0.9998502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15473841,0.010720706,0.75405395,0.06837714,0.00037330957,0.0006030822,0.0000035160401,0.00060968555,0.01052022],"genre_scores_gemma":[0.9923447,0.004542399,0.002172221,0.00085900945,0.000029393374,0.00002164132,0.0000023858026,0.0000034404395,0.000024808434],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00012874938,0.00012722587,0.00019236657,0.00008520521,0.00012968574],"domain_scores_gemma":[0.99839723,0.0005043966,0.000060729562,0.0009426403,0.00003737193,0.000057649253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020928922,0.000078868296,0.00007435146,0.00005781584,0.0002317863,0.000056424924,0.000599848,0.00008548446,0.000009620851],"category_scores_gemma":[0.000022664673,0.000055580596,0.000037112648,0.00019983674,0.00006824065,0.00021551063,0.00024288397,0.00014350626,0.000011492637],"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.00002576276,0.00015523034,0.0013192426,0.000006108818,0.000017247108,0.0000010452094,0.0007648163,0.00005666586,0.00015570858,0.4483153,0.0026040324,0.5465789],"study_design_scores_gemma":[0.0033313672,0.0011249497,0.0749157,0.000830156,0.000036028916,0.00004042169,0.00022253554,0.4080868,0.0030248458,0.41284984,0.09421066,0.0013266843],"about_ca_topic_score_codex":0.000016808632,"about_ca_topic_score_gemma":0.000018986022,"teacher_disagreement_score":0.8376063,"about_ca_system_score_codex":0.0000079684405,"about_ca_system_score_gemma":0.000007146737,"threshold_uncertainty_score":0.22665109},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005127659,0.0036823547,0.972036,0.0069995928,0.00026511273,0.010485481,0.000016426722,0.0004718144,0.0009155793],"genre_scores_gemma":[0.9810897,0.001619462,0.012142369,0.0004210959,0.00005303251,0.004506459,0.000041288124,0.00002496053,0.00010161426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976509,0.0003769446,0.000536579,0.0005741193,0.00030113975,0.0005602763],"domain_scores_gemma":[0.9961488,0.0009664785,0.0003193993,0.0021583736,0.00021791286,0.00018903187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097153755,0.00028136699,0.00032440183,0.00016959735,0.000487172,0.00028222517,0.0020692116,0.0002635735,0.000016818009],"category_scores_gemma":[0.00009376467,0.00023036031,0.000120520526,0.0007067051,0.00021525253,0.00054232747,0.00083890854,0.00031722337,0.000018392902],"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.00014574382,0.00075982115,0.00047397835,0.00011174036,0.00017185524,0.000003022345,0.003395609,0.00022529997,0.00015813277,0.39506865,0.0034454893,0.59604067],"study_design_scores_gemma":[0.0023651267,0.0003234688,0.0017231387,0.0004656825,0.000033464934,0.000017135413,0.00009027305,0.8762582,0.00008120575,0.07502416,0.0429666,0.0006515742],"about_ca_topic_score_codex":0.000015287229,"about_ca_topic_score_gemma":0.00012446126,"teacher_disagreement_score":0.97596204,"about_ca_system_score_codex":0.000112960784,"about_ca_system_score_gemma":0.00003002263,"threshold_uncertainty_score":0.9393821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046714064,0.0058274656,0.934503,0.010056049,0.00022842154,0.00068854063,0.000087136636,0.00025275655,0.0016425205],"genre_scores_gemma":[0.9827367,0.002932622,0.013660534,0.0004522449,0.00005212896,0.00011758044,0.000025474861,0.0000072184944,0.000015459842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987191,0.00020645447,0.00030169616,0.000322062,0.00015198378,0.00029870402],"domain_scores_gemma":[0.9980552,0.00058110035,0.00014450261,0.0009623289,0.00015024109,0.000106622305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283502,0.00014935603,0.00016892044,0.00007662724,0.0005737054,0.00018877028,0.00097619125,0.00008325622,0.000025210602],"category_scores_gemma":[0.00003583577,0.00011547716,0.00008143376,0.00029415736,0.00019748468,0.00066323654,0.0004174362,0.00014155336,0.0000022248248],"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.000010014795,0.00005683922,0.00060988875,0.000009148009,0.000022043614,2.9463516e-7,0.0019209473,0.0000097489365,0.000015853722,0.95423543,0.0013067368,0.041803066],"study_design_scores_gemma":[0.0025676084,0.00015436874,0.0024737914,0.00013497384,0.000030309428,0.000022680351,0.0006834322,0.08500579,0.00021946528,0.8774078,0.030691585,0.0006082089],"about_ca_topic_score_codex":0.0001108359,"about_ca_topic_score_gemma":0.00061556377,"teacher_disagreement_score":0.9360227,"about_ca_system_score_codex":0.00002312083,"about_ca_system_score_gemma":0.00003639417,"threshold_uncertainty_score":0.47090217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004128343,0.004712789,0.9698146,0.020321047,0.00007657346,0.0006171202,0.00008669765,0.00012391656,0.00011894438],"genre_scores_gemma":[0.9869283,0.003773561,0.005848543,0.003238046,0.000031922908,0.00009338607,0.00008070429,0.0000046486152,8.8548825e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.00024376958,0.0002898272,0.00019993058,0.000117550815,0.0002529437],"domain_scores_gemma":[0.99766046,0.0008355849,0.00023859846,0.001005214,0.000120369696,0.00013978477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138469,0.00013043132,0.00018173651,0.00009131621,0.00048231723,0.00038562057,0.0010956048,0.00009872111,0.000007115602],"category_scores_gemma":[0.00009995169,0.00010564768,0.000042734966,0.00019863441,0.00012802333,0.0020860713,0.00070298,0.00014039731,6.831275e-7],"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.00023145207,0.00017610045,0.0058455607,0.0005495052,0.00007033973,3.7625432e-7,0.007081195,0.00008032898,0.000008393101,0.6659828,0.025114063,0.2948599],"study_design_scores_gemma":[0.0070935534,0.0002962916,0.009206379,0.00059931003,0.000025221312,0.000011141931,0.000216216,0.6478849,0.00003490407,0.15709208,0.17690393,0.0006360544],"about_ca_topic_score_codex":0.00009789753,"about_ca_topic_score_gemma":0.00031547257,"teacher_disagreement_score":0.98279995,"about_ca_system_score_codex":0.000019228242,"about_ca_system_score_gemma":0.00006500167,"threshold_uncertainty_score":0.43081877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05245133,0.0022034934,0.91714436,0.011615095,0.00018282948,0.00030987515,0.0000074075615,0.0004012116,0.015684398],"genre_scores_gemma":[0.99712336,0.00048216106,0.0018931658,0.00035958583,0.000031274754,0.000015046898,0.000008261096,0.0000053684366,0.00008177134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991299,0.00025173448,0.00013991423,0.00023409793,0.000100215875,0.0001441594],"domain_scores_gemma":[0.99838203,0.00048062165,0.00008006815,0.0009102254,0.000037017493,0.000110050816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018201,0.00010812644,0.000098622484,0.00006962098,0.0003600896,0.00013392356,0.0004378202,0.00006149639,0.000024305682],"category_scores_gemma":[0.000021757374,0.00008585737,0.000037469097,0.00023683427,0.00014734831,0.00027564476,0.00016887627,0.00013755583,0.000004554677],"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.000042808693,0.00010478353,0.0010767011,0.000005446232,0.000021986563,2.859983e-7,0.00091281015,0.00017778092,0.000052226274,0.74919164,0.00081339356,0.24760012],"study_design_scores_gemma":[0.0030224067,0.00039653067,0.01270083,0.0004671767,0.00007875391,0.000009008203,0.000555327,0.47853222,0.00017615338,0.488849,0.014494696,0.00071789103],"about_ca_topic_score_codex":0.000024449877,"about_ca_topic_score_gemma":0.00007033674,"teacher_disagreement_score":0.94467205,"about_ca_system_score_codex":0.000012309765,"about_ca_system_score_gemma":0.000021802234,"threshold_uncertainty_score":0.3501162},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073983006,0.007893361,0.91564715,0.0003144979,0.00039805114,0.00089769025,0.00011575195,0.000315494,0.00043497933],"genre_scores_gemma":[0.99072546,0.008033414,0.00051656534,0.000053503583,0.00013306773,0.0002553047,0.00018160937,0.000044544984,0.00005650997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989097,0.000096288284,0.00033830624,0.00021312314,0.00013228078,0.00031026045],"domain_scores_gemma":[0.9990374,0.00016749203,0.000081285594,0.0005140835,0.00009754977,0.00010222968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030415348,0.00021465565,0.0002450761,0.00004497326,0.00015060221,0.00009030577,0.00028358607,0.0001514047,0.000006902684],"category_scores_gemma":[0.000009526396,0.00017818931,0.00008919014,0.000097764445,0.00006499417,0.00032734062,0.000030138044,0.00022108489,0.0000030702884],"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.00013809232,0.000070080656,0.000050152787,0.00014845342,0.0002792828,0.0000037100035,0.0019977319,0.49373445,0.00016731155,0.48140758,0.0022312107,0.019771952],"study_design_scores_gemma":[0.0005677341,0.000080145335,0.000071300354,0.00038910098,0.00006653303,0.000009770349,0.0003680308,0.9660733,0.00055948005,0.02550216,0.0059547815,0.00035771006],"about_ca_topic_score_codex":0.00003479105,"about_ca_topic_score_gemma":0.00031089847,"teacher_disagreement_score":0.9167425,"about_ca_system_score_codex":0.0000865612,"about_ca_system_score_gemma":0.000016443391,"threshold_uncertainty_score":0.7266349},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0215894,0.0008190905,0.9736352,0.00272255,0.00012955013,0.00030170896,0.000006836942,0.00030486338,0.0004908],"genre_scores_gemma":[0.9825099,0.00075974717,0.016079139,0.00045691137,0.000057301677,0.000067439716,0.000017506582,0.000011103206,0.000040963834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989483,0.00013090731,0.00024969547,0.00029502797,0.0001034112,0.00027270676],"domain_scores_gemma":[0.9984685,0.0003221194,0.00016947491,0.0009183443,0.000058217087,0.00006334141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374506,0.00015582542,0.00016768367,0.00009291872,0.00027677568,0.00014226274,0.0008835876,0.000108647066,0.000006980452],"category_scores_gemma":[0.0000150484475,0.000119058604,0.00007769188,0.00017953839,0.0001312957,0.00068665144,0.00033856076,0.00015644082,9.638627e-7],"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.00031387873,0.0004034077,0.07603864,0.00016117645,0.00018869851,0.0000074139703,0.0052601052,0.0005669658,0.001406541,0.6659435,0.007443772,0.24226591],"study_design_scores_gemma":[0.002719396,0.0003014776,0.031200457,0.0012132471,0.000042174608,0.000016507258,0.000026031736,0.56141,0.014443341,0.2795298,0.107892536,0.001205008],"about_ca_topic_score_codex":0.000043796557,"about_ca_topic_score_gemma":0.00007835136,"teacher_disagreement_score":0.9609205,"about_ca_system_score_codex":0.000035959867,"about_ca_system_score_gemma":0.000017442953,"threshold_uncertainty_score":0.48550692},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50701594,0.0022172744,0.4878703,0.00057140784,0.00023337829,0.0013625544,0.0000091963375,0.00011194633,0.0006080057],"genre_scores_gemma":[0.9810622,0.0009925067,0.017363599,0.00006861972,0.0003257754,0.00011287099,0.000026822401,0.000030228415,0.000017381679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778885,0.00027030284,0.0004229851,0.0006820901,0.00017540784,0.0006603569],"domain_scores_gemma":[0.997523,0.00057745085,0.00031891747,0.0011468406,0.00022000873,0.00021378929],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006795571,0.00032349277,0.0004494752,0.00014407394,0.0020338495,0.0010808256,0.0008769724,0.00020141696,8.851564e-7],"category_scores_gemma":[0.00014648886,0.00036736004,0.00009135241,0.00037646227,0.0002167559,0.000755298,0.00080312317,0.000625692,5.277798e-7],"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.0018985149,0.0015753594,0.31625333,0.00023291698,0.0006207067,0.00021839334,0.053046033,0.18868807,0.0006026531,0.013864585,0.0002643698,0.42273507],"study_design_scores_gemma":[0.0015447318,0.0000584691,0.0963849,0.00041630756,0.000032880536,0.000028513909,0.00081543316,0.8993392,0.00031634606,0.0005627005,0.000037248985,0.0004632747],"about_ca_topic_score_codex":0.00016711933,"about_ca_topic_score_gemma":0.00074188266,"teacher_disagreement_score":0.71065116,"about_ca_system_score_codex":0.000116764895,"about_ca_system_score_gemma":0.00003994815,"threshold_uncertainty_score":0.99995613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25613916,0.0040648086,0.7358516,0.0017461468,0.0001561738,0.0007973939,0.00001702812,0.00024037891,0.0009873009],"genre_scores_gemma":[0.98770714,0.0028207225,0.008496582,0.0004593999,0.000090521644,0.00010392861,0.00030252157,0.000012267969,0.000006920483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.0003880447,0.0004055976,0.00034445533,0.00015551597,0.00031675052],"domain_scores_gemma":[0.99698156,0.00025751433,0.00022770888,0.0020658092,0.00033015994,0.00013722741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009479239,0.00017832046,0.00018907161,0.0000992248,0.0012737762,0.00047491145,0.0015564096,0.00013795131,0.000028158227],"category_scores_gemma":[0.00001861458,0.00018828246,0.00006926391,0.00039508005,0.00032568446,0.00094177946,0.0004809452,0.00028091288,0.0000029792734],"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.00003575004,0.00029580842,0.0032677324,0.000030946365,0.000040442425,3.7385024e-7,0.0070375227,0.000050975996,0.000015347941,0.93056023,0.0009187309,0.057746142],"study_design_scores_gemma":[0.0012982425,0.00064594473,0.032387283,0.00010961189,0.000036109486,0.000019211893,0.0010173763,0.79940593,0.000040189487,0.15957874,0.004909693,0.00055167667],"about_ca_topic_score_codex":0.00012610768,"about_ca_topic_score_gemma":0.001387935,"teacher_disagreement_score":0.799355,"about_ca_system_score_codex":0.000024591938,"about_ca_system_score_gemma":0.00004723271,"threshold_uncertainty_score":0.9796985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9436019,0.0030077852,0.036597773,0.0005850276,0.00048180122,0.00029890175,0.000002372788,0.00009805477,0.015326405],"genre_scores_gemma":[0.99852157,0.00027563004,0.00080797245,0.0002523208,0.00011427807,0.0000028801053,0.0000042164042,0.0000027505557,0.000018369208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993536,0.00017074596,0.0001445936,0.00011482487,0.000104934545,0.00011133868],"domain_scores_gemma":[0.998925,0.000058958023,0.00009309333,0.00081783097,0.00008252938,0.000022590619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920121,0.00006713239,0.000081230835,0.0000084665,0.00046020187,0.000050478666,0.00068594044,0.000049066297,0.00000901343],"category_scores_gemma":[0.000008567355,0.000051090774,0.000020905278,0.00021241793,0.0001543577,0.00030011433,0.0006232005,0.00012299679,3.3454242e-7],"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.000014082067,0.00006737918,0.0043600984,0.000021390388,0.00005994942,1.04579144e-7,0.020055193,0.0060376865,0.000061871266,0.81022125,0.0017016684,0.15739934],"study_design_scores_gemma":[0.00073135836,0.0003358166,0.35802972,0.00021223078,0.000046840374,0.0000084282965,0.0008088221,0.47394758,0.00086020806,0.1307485,0.033769917,0.0005005791],"about_ca_topic_score_codex":0.000074150004,"about_ca_topic_score_gemma":0.0008588225,"teacher_disagreement_score":0.67947274,"about_ca_system_score_codex":0.000011016546,"about_ca_system_score_gemma":0.000008465446,"threshold_uncertainty_score":0.35395473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8226136,0.011675166,0.14669506,0.01187536,0.00029225386,0.002523794,0.000025528301,0.0007498933,0.0035493185],"genre_scores_gemma":[0.9974963,0.0007680554,0.0011906362,0.00022000374,0.000060659488,0.00019277098,0.000024161307,0.000009862958,0.000037527745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989107,0.00011872992,0.00024381162,0.00037439977,0.00010388747,0.00024842046],"domain_scores_gemma":[0.99841213,0.00023818668,0.00014570556,0.0010353121,0.00010167134,0.00006702064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045706925,0.0001519409,0.00025155777,0.000056058474,0.0005220585,0.00020416737,0.0009829488,0.00026213643,0.0000023808796],"category_scores_gemma":[0.0000119597835,0.00015756393,0.000048731537,0.0002609518,0.00018421841,0.00024129936,0.0008508715,0.00037677682,0.000004362902],"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.000007500067,0.0000825295,0.0007888035,0.000037902795,0.000021627518,1.07239906e-7,0.0020553751,0.000025304364,0.000008973945,0.98945194,0.00083877414,0.006681165],"study_design_scores_gemma":[0.00070022873,0.00007335101,0.0014039124,0.000032232496,0.000016183787,0.000013198648,0.00032990248,0.7745737,0.000018839879,0.17838487,0.044159092,0.00029448845],"about_ca_topic_score_codex":0.00003815247,"about_ca_topic_score_gemma":0.000017793045,"teacher_disagreement_score":0.81106704,"about_ca_system_score_codex":0.000019536892,"about_ca_system_score_gemma":0.000017932913,"threshold_uncertainty_score":0.64252704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022798728,0.05909293,0.93614393,0.0012304146,0.00023543011,0.0004084123,0.000013701019,0.00007234358,0.0005229614],"genre_scores_gemma":[0.96652025,0.024498304,0.007887935,0.00060409156,0.00009177138,0.00016408948,0.000097465265,0.000012495422,0.00012362332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983713,0.0002284758,0.00053638424,0.00035502735,0.00020484212,0.0003039595],"domain_scores_gemma":[0.99656713,0.0008014615,0.0003263981,0.0018430616,0.0003685298,0.00009341321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011090374,0.00016750723,0.0002721764,0.000023733917,0.0006390993,0.00019246998,0.0011104802,0.00018260376,0.000008218573],"category_scores_gemma":[0.000014167538,0.00014936154,0.00012287764,0.00038071693,0.00019341671,0.0003083652,0.00063231826,0.0003723737,0.0000012715416],"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.00012833644,0.0005218391,0.0002842529,0.00014520594,0.00022455485,0.0000033188164,0.012299359,0.35356864,0.000024580553,0.26416114,0.02171141,0.34692734],"study_design_scores_gemma":[0.00028074914,0.000021448453,0.00007254802,0.0000500275,0.000039571303,0.000008891875,0.00022443132,0.92193305,0.000011183595,0.071533404,0.005672842,0.00015182773],"about_ca_topic_score_codex":0.000006420324,"about_ca_topic_score_gemma":0.00009182695,"teacher_disagreement_score":0.9642404,"about_ca_system_score_codex":0.000020005444,"about_ca_system_score_gemma":0.000114560375,"threshold_uncertainty_score":0.60907865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007695936,0.6563298,0.3380745,0.0025475316,0.00047265715,0.0013708976,0.00005493846,0.00017914998,0.00020091281],"genre_scores_gemma":[0.60069656,0.3928614,0.0042764433,0.0015931365,0.00010205248,0.000114582974,0.00030916836,0.000014049217,0.000032587934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771297,0.0007845048,0.0006200186,0.0004653735,0.00020731855,0.00020978793],"domain_scores_gemma":[0.99497837,0.00072811206,0.00038752117,0.0032913995,0.000526216,0.00008838078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200155,0.0001793417,0.00047600263,0.000056316636,0.00035756567,0.0003018875,0.0012615412,0.00020083676,0.000009162335],"category_scores_gemma":[0.00034752674,0.00017489608,0.00010568051,0.000879584,0.00008693988,0.0013460878,0.0012998439,0.00045942626,0.0000012402786],"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.00030538862,0.0021007834,0.00017233442,0.35504237,0.0011391948,0.00004917152,0.020345168,0.0011781524,0.0002962657,0.43557897,0.05434158,0.1294506],"study_design_scores_gemma":[0.00037841906,0.0001023953,0.000022636716,0.03996719,0.00014522452,0.00023034889,0.00009633593,0.9199782,0.00021821925,0.01570101,0.022803482,0.00035655554],"about_ca_topic_score_codex":0.000019100182,"about_ca_topic_score_gemma":0.00086652505,"teacher_disagreement_score":0.91880006,"about_ca_system_score_codex":0.00001746692,"about_ca_system_score_gemma":0.00004368782,"threshold_uncertainty_score":0.7132055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025297645,0.0015676111,0.97171766,0.0004693583,0.0005580141,0.0002111298,0.0000011375392,0.00007052545,0.00010694797],"genre_scores_gemma":[0.84026164,0.00042194573,0.15885995,0.00017048698,0.0001226779,0.000003922863,0.00014950587,0.0000074895606,0.0000024039675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888587,0.00020024795,0.00029787,0.00032267184,0.00011143661,0.00018190878],"domain_scores_gemma":[0.9982534,0.00032249544,0.00021833526,0.00095982646,0.00019448856,0.00005144989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009518069,0.00011574029,0.00017946516,0.00004941914,0.0005318607,0.0001666586,0.00062716537,0.00010136055,3.128134e-7],"category_scores_gemma":[0.000047630536,0.00013037983,0.000026904372,0.00024669024,0.000050089337,0.00053084997,0.000995261,0.00021752066,1.04831784e-7],"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.00007149073,0.00027136676,0.0017177566,0.0007734909,0.00009098451,0.0000010924447,0.011137697,0.6931988,0.000133052,0.012675101,0.00047767535,0.2794515],"study_design_scores_gemma":[0.00043112828,0.000039925406,0.00030311834,0.00016257972,0.000015038613,0.000007358058,0.0000746777,0.99737406,0.00012168663,0.0009741493,0.00036440112,0.00013186505],"about_ca_topic_score_codex":0.000012022615,"about_ca_topic_score_gemma":0.000007530708,"teacher_disagreement_score":0.814964,"about_ca_system_score_codex":0.000020669006,"about_ca_system_score_gemma":0.00006289406,"threshold_uncertainty_score":0.5316735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027212773,0.006015301,0.93165743,0.01656593,0.0012305493,0.0005992578,0.000030059853,0.0009884114,0.015700253],"genre_scores_gemma":[0.99507743,0.0005357789,0.0024898807,0.0014670754,0.00012342344,0.00004341284,0.00012276051,0.000012769673,0.00012749682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827534,0.00050221116,0.00020218156,0.0004714281,0.00025458576,0.00029425483],"domain_scores_gemma":[0.9975429,0.00028869664,0.00010961607,0.0016385559,0.00026881954,0.00015140294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002811517,0.00020882026,0.00023492222,0.000073632866,0.000758766,0.0003205085,0.0006756898,0.00021011129,0.000028593215],"category_scores_gemma":[0.00007588118,0.0002149747,0.000117742275,0.0007729924,0.00008502761,0.0003990231,0.00037664772,0.00076880015,0.0000141205255],"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.0004175279,0.0032788143,0.0007999596,0.0002107267,0.00027255842,0.00006606196,0.0040664184,0.025411442,0.000726712,0.44205117,0.02989804,0.49280056],"study_design_scores_gemma":[0.0008588435,0.00013483939,0.0028431718,0.000090341295,0.000024661906,0.000015332633,0.00012785908,0.8987508,0.0009203939,0.021100296,0.07475929,0.0003742014],"about_ca_topic_score_codex":0.000028795643,"about_ca_topic_score_gemma":0.00059936766,"teacher_disagreement_score":0.96786463,"about_ca_system_score_codex":0.00005774436,"about_ca_system_score_gemma":0.00008326941,"threshold_uncertainty_score":0.8766414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032740023,0.0002450206,0.9546544,0.0019414221,0.0000732867,0.008340284,0.000012911912,0.00028065452,0.0017119771],"genre_scores_gemma":[0.966703,0.00006690586,0.03196368,0.00063010375,0.00003640725,0.00048605588,0.000106381456,0.0000064217356,0.0000010758965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984604,0.00037735334,0.00039132388,0.00025646816,0.00025060461,0.0002638449],"domain_scores_gemma":[0.9978828,0.0002029192,0.00025897467,0.0012765547,0.0002540171,0.00012477343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638034,0.00016276629,0.00019941718,0.00007238705,0.00055224594,0.0005593313,0.00078066194,0.00012865028,0.000010179393],"category_scores_gemma":[0.00004639642,0.00015056228,0.000046119363,0.0008789851,0.00014691427,0.0005606062,0.00097014935,0.00046346267,0.000003832475],"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.00018827037,0.00027001917,0.00056555885,0.00007662328,0.000052802985,0.00000827322,0.0037130227,0.007750943,0.000029857332,0.97531116,0.0002593089,0.011774172],"study_design_scores_gemma":[0.0018922949,0.00013314461,0.004515429,0.0002068203,0.000018436136,0.00008738358,0.00018589503,0.9568694,0.00022375095,0.01470375,0.020726534,0.00043711017],"about_ca_topic_score_codex":0.000021207015,"about_ca_topic_score_gemma":0.000023470118,"teacher_disagreement_score":0.9606074,"about_ca_system_score_codex":0.000023661361,"about_ca_system_score_gemma":0.000095782074,"threshold_uncertainty_score":0.61397517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31540224,0.045764066,0.6278592,0.00052001677,0.00042985877,0.00039280325,0.00018461779,0.00039745469,0.009049809],"genre_scores_gemma":[0.9905523,0.0042514484,0.0049547716,0.000103902334,0.000012458018,0.0000057437546,0.000114685135,0.000003735732,9.4699016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.0007839944,0.00029610706,0.0002474666,0.00017295498,0.00015249057],"domain_scores_gemma":[0.9975773,0.00036422064,0.00016217314,0.001530164,0.00028940523,0.00007674742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316669,0.00009951965,0.00020259363,0.000042370648,0.00019904607,0.00017123777,0.00097236334,0.0001035908,0.000015341957],"category_scores_gemma":[0.000056260866,0.000109384564,0.000057166748,0.00076231326,0.000048915525,0.0008069343,0.0009893179,0.00024065618,0.00000221613],"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.000006175594,0.00020737144,0.0098195365,0.000045300858,0.000046240457,0.000002151702,0.0011842792,0.00003323806,0.0000036980327,0.9849776,0.00038223306,0.0032921643],"study_design_scores_gemma":[0.0012174629,0.00009051616,0.26230982,0.0002246334,0.00004817013,0.000060626673,0.0004097575,0.47728062,0.00025949487,0.25040695,0.0070212507,0.0006707057],"about_ca_topic_score_codex":0.00024934646,"about_ca_topic_score_gemma":0.004437988,"teacher_disagreement_score":0.7345707,"about_ca_system_score_codex":0.000011227568,"about_ca_system_score_gemma":0.000058061876,"threshold_uncertainty_score":0.44605732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07554346,0.00035837595,0.9230936,0.00030340964,0.00024884328,0.00018566941,0.000002010452,0.00009343285,0.00017119579],"genre_scores_gemma":[0.9704624,0.000098002616,0.029126171,0.00011577978,0.000116423565,0.000022219367,0.000041577197,0.000010804918,0.000006630602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998924,0.00016678199,0.00027446123,0.00031578465,0.00010526106,0.00021366648],"domain_scores_gemma":[0.9990379,0.00023269952,0.00017095936,0.0003645983,0.00013040511,0.00006342544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042761912,0.00013835295,0.00019692293,0.000055988614,0.00064023235,0.00028907732,0.00019541234,0.000136072,0.000002822591],"category_scores_gemma":[0.000105862346,0.00016246618,0.00004776634,0.00017036781,0.00006229205,0.0005518859,0.00043568548,0.0003702234,2.3245471e-7],"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.00015783598,0.000100512865,0.0004229054,0.00009557567,0.0001277825,0.0000078401,0.03205797,0.47240266,0.0056075826,0.12604736,0.00001671826,0.36295527],"study_design_scores_gemma":[0.0009857521,0.000055974826,0.001927414,0.000058445406,0.000016578397,0.000052996904,0.00088136946,0.9866765,0.00015025886,0.00879328,0.00021712335,0.0001842824],"about_ca_topic_score_codex":0.00005373033,"about_ca_topic_score_gemma":0.00017066042,"teacher_disagreement_score":0.8949189,"about_ca_system_score_codex":0.000032238502,"about_ca_system_score_gemma":0.000036760786,"threshold_uncertainty_score":0.6625179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069481423,0.0014644023,0.98848593,0.0018568044,0.000013960237,0.00018336627,0.0000015751807,0.00014861808,0.00089717226],"genre_scores_gemma":[0.8022083,0.000736872,0.19650593,0.00048015767,0.0000130677145,0.000030233181,0.000009486354,0.0000073171336,0.000008632141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988438,0.00035170434,0.00017738354,0.00027257975,0.00013201323,0.00022254327],"domain_scores_gemma":[0.99869734,0.0002091649,0.00010661926,0.00080310844,0.00013236517,0.000051407595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048264652,0.00014541746,0.00016002361,0.000032804026,0.0006970928,0.00017768826,0.00072040607,0.00008269472,8.649049e-7],"category_scores_gemma":[0.0000043130426,0.00010100057,0.000052070678,0.00032160722,0.00015263722,0.00049213716,0.00033869958,0.00037601884,1.00755585e-7],"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.00019846158,0.00053644617,0.00084772357,0.00008619767,0.00030226354,0.000024604244,0.0747197,0.13524494,0.0020026867,0.42723885,0.00025646368,0.35854167],"study_design_scores_gemma":[0.0002112653,0.000023613902,0.000056121142,0.000059321075,0.000015332067,0.00003553523,0.00025744954,0.95507574,0.001973625,0.041260038,0.0008685036,0.00016347105],"about_ca_topic_score_codex":0.000023248456,"about_ca_topic_score_gemma":0.00007529584,"teacher_disagreement_score":0.8198308,"about_ca_system_score_codex":0.000017903487,"about_ca_system_score_gemma":0.000032435873,"threshold_uncertainty_score":0.53615445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4388365,0.010070345,0.5217104,0.026036026,0.00033056605,0.00060003565,0.000011616972,0.0003501398,0.0020544128],"genre_scores_gemma":[0.99385184,0.00067216234,0.0044041174,0.0009149917,0.000029351804,0.00002862406,0.00006561385,0.000007565837,0.000025732576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801564,0.00066817296,0.00032873743,0.00045240944,0.0003245098,0.00021054066],"domain_scores_gemma":[0.99624354,0.00072449615,0.00019706103,0.0024457825,0.00026909355,0.00012004306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175924,0.00013934723,0.00013524415,0.0003022182,0.0008213631,0.0009344507,0.001438337,0.00012053501,0.000024427416],"category_scores_gemma":[0.00040240702,0.00012136745,0.000042920805,0.0029294358,0.00014802182,0.00028082638,0.0006908659,0.00036039003,0.000006056136],"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.000040064453,0.0021056624,0.0067014857,0.0001442079,0.000086402055,0.00000832823,0.007872545,0.003883639,0.0015307512,0.7838954,0.0038629372,0.18986861],"study_design_scores_gemma":[0.00020667525,0.000020318173,0.018257864,0.00003225793,0.0000067988885,0.000004769888,0.00022459813,0.97534233,0.0003613342,0.0028623133,0.002532471,0.00014827635],"about_ca_topic_score_codex":0.000033703123,"about_ca_topic_score_gemma":0.000031198906,"teacher_disagreement_score":0.9714587,"about_ca_system_score_codex":0.000035339293,"about_ca_system_score_gemma":0.000052646283,"threshold_uncertainty_score":0.901093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38822782,0.03235388,0.54895884,0.024736999,0.00011812872,0.0008589833,0.000013661452,0.0010884363,0.0036432547],"genre_scores_gemma":[0.982642,0.000583609,0.016160993,0.00050950696,0.000021654298,0.000053899108,0.000013934656,0.000009047978,0.000005354562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872184,0.0002878325,0.00021601192,0.00044339377,0.00011797066,0.00021296526],"domain_scores_gemma":[0.9979106,0.00036689598,0.000105506144,0.0014434984,0.00007493345,0.00009854867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005556477,0.00016314366,0.00020646425,0.00007641051,0.0006321998,0.00022761764,0.0007544202,0.00026314726,0.0000029683113],"category_scores_gemma":[0.000040040282,0.00016983558,0.00003065134,0.00039047893,0.00017268524,0.00012946228,0.001019075,0.0006511204,3.846207e-7],"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.00001706389,0.0002033625,0.00059423805,0.00018049363,0.000036305166,0.000016786853,0.003102456,0.00018940431,0.00028132639,0.97001225,0.00059459143,0.02477174],"study_design_scores_gemma":[0.00037752307,0.000035235684,0.00069524976,0.00015449335,0.00001102202,0.00004023907,0.00046143777,0.9764846,0.00009958053,0.020455582,0.0010056557,0.00017937258],"about_ca_topic_score_codex":0.000020059368,"about_ca_topic_score_gemma":0.00005263592,"teacher_disagreement_score":0.97629523,"about_ca_system_score_codex":0.000024368894,"about_ca_system_score_gemma":0.00001936023,"threshold_uncertainty_score":0.6925694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018647047,0.0031130027,0.9112011,0.06473247,0.00015457315,0.0007992744,0.000097155586,0.00073446217,0.0005208684],"genre_scores_gemma":[0.97990364,0.00022493399,0.016518433,0.0025753886,0.000054147422,0.00043476396,0.00026187394,0.000015395059,0.000011428053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998195,0.00025524024,0.00035674789,0.0006278959,0.00015303389,0.0004120953],"domain_scores_gemma":[0.9964216,0.00054472184,0.00016971966,0.0024857046,0.00027131962,0.000106970285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057820516,0.00025182488,0.00031286353,0.00017419728,0.0007270429,0.00012491221,0.0013608537,0.00055842206,0.000007729137],"category_scores_gemma":[0.00012628995,0.00026150054,0.00010961452,0.0010691226,0.00031199708,0.00005871771,0.0007609106,0.0009522133,0.0000027499877],"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.00007942536,0.0007266258,0.000505275,0.0000725955,0.000076255266,0.0000069272583,0.0009076191,0.009397567,0.000027044176,0.94696546,0.0063525666,0.034882635],"study_design_scores_gemma":[0.0007501483,0.00008533445,0.00008038584,0.000049401686,0.000015490787,0.000026729002,0.00008682762,0.7223389,0.00032940417,0.23046747,0.045517508,0.00025236272],"about_ca_topic_score_codex":0.000013246,"about_ca_topic_score_gemma":0.00028557674,"teacher_disagreement_score":0.96125656,"about_ca_system_score_codex":0.000055451845,"about_ca_system_score_gemma":0.00009650937,"threshold_uncertainty_score":0.9999837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81652075,0.028282788,0.15113656,0.0017318673,0.00024040056,0.00018162969,0.000010355816,0.00016585444,0.0017297866],"genre_scores_gemma":[0.9894524,0.0046483586,0.005417712,0.00034893097,0.000062134204,0.00000759654,0.00005381162,0.0000065451163,0.0000024839783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986193,0.0003294719,0.00024951072,0.00037791402,0.00017174007,0.0002520599],"domain_scores_gemma":[0.9976614,0.00038030834,0.00010449626,0.0016385792,0.0000841991,0.00013102149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213081,0.00014981675,0.00018579305,0.00005233889,0.00055949774,0.00046279686,0.0009510163,0.000116350435,0.000012063492],"category_scores_gemma":[0.000038283793,0.00016269552,0.000054329448,0.00044379578,0.0001444554,0.00039879122,0.003037081,0.00046410604,0.0000010648735],"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.000041971525,0.0004049686,0.008080758,0.00009568648,0.00008639778,0.000020868714,0.011660256,0.0013476829,0.000067810026,0.95758694,0.0018249623,0.0187817],"study_design_scores_gemma":[0.0010546524,0.000046701112,0.03368531,0.00022362414,0.00002999321,0.00009969602,0.00071271654,0.84659183,0.000167681,0.09720288,0.019591985,0.0005929352],"about_ca_topic_score_codex":0.00010199867,"about_ca_topic_score_gemma":0.00022765192,"teacher_disagreement_score":0.86038405,"about_ca_system_score_codex":0.00001518998,"about_ca_system_score_gemma":0.000028891274,"threshold_uncertainty_score":0.66345304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51793814,0.011791328,0.4661552,0.0003170694,0.00019504924,0.0018559225,0.000032672673,0.0005798018,0.0011348198],"genre_scores_gemma":[0.9972332,0.00044920723,0.0012883785,0.000102329745,0.000030278505,0.0005241219,0.0003528122,0.000015264482,0.00000439855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995137,0.00005553816,0.0001592209,0.00010273747,0.000048102935,0.000120730685],"domain_scores_gemma":[0.999627,0.00008163482,0.00004136433,0.00019683845,0.00003062611,0.000022513814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024303899,0.00007274979,0.00008670498,0.00006332274,0.00028773345,0.000032961743,0.000156596,0.000046437588,0.000011082675],"category_scores_gemma":[9.3741056e-7,0.00009377257,0.000020263073,0.000300651,0.000014325825,0.000067638604,0.00006419971,0.00020600394,3.4998914e-7],"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.000007949893,0.000037884947,0.0003367046,0.000039105893,0.0000041988164,1.3879006e-8,0.0009566917,0.9936876,0.0000063432444,0.00052463205,0.00008716426,0.004311652],"study_design_scores_gemma":[0.0003203242,0.000025898886,0.00029757983,0.000016076501,0.000005370803,8.5275315e-7,0.00043545116,0.99040323,0.000017369883,0.0008527123,0.0075310343,0.00009408869],"about_ca_topic_score_codex":0.000040811916,"about_ca_topic_score_gemma":0.00021085283,"teacher_disagreement_score":0.47929507,"about_ca_system_score_codex":0.000054319764,"about_ca_system_score_gemma":0.000006591812,"threshold_uncertainty_score":0.38239345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006136064,0.0013945297,0.98049086,0.0096546225,0.0007216409,0.0008072455,0.000022583688,0.0003805126,0.00039191032],"genre_scores_gemma":[0.9685386,0.000030157782,0.027803944,0.0027403,0.00033502877,0.00021394,0.00029121805,0.000019637828,0.000027186472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701256,0.0008739826,0.00043172014,0.00046973288,0.00080892554,0.00040308348],"domain_scores_gemma":[0.9972588,0.0012251898,0.00021333616,0.0008927046,0.00014141013,0.00026859282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018305879,0.00021939317,0.0002507002,0.00010777789,0.0012066416,0.00014539922,0.0011416038,0.00012687515,0.00012704],"category_scores_gemma":[0.000071283976,0.00023976873,0.00012642986,0.00046008217,0.000117949814,0.0003348604,0.00069775584,0.00075660757,0.0000068475383],"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.000503115,0.00026489812,0.00012074484,0.00007080297,0.00004245896,0.000016922839,0.0003388103,0.70952785,0.000079564714,0.24043684,0.030211987,0.018386038],"study_design_scores_gemma":[0.0013905553,0.00026430143,0.00041583512,0.000081182574,0.000017415117,0.0000782258,0.00004117104,0.9870636,0.0000052984274,0.0074656154,0.0029405733,0.00023622334],"about_ca_topic_score_codex":0.00008513334,"about_ca_topic_score_gemma":0.000033640845,"teacher_disagreement_score":0.9624025,"about_ca_system_score_codex":0.00024747822,"about_ca_system_score_gemma":0.00029680016,"threshold_uncertainty_score":0.9777485},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07459327,0.82538664,0.0012164572,0.008614645,0.002035367,0.004961512,0.00022675369,0.0006030343,0.08236232],"genre_scores_gemma":[0.5370042,0.4581331,0.000077879544,0.00034156258,0.0018997281,0.00016692597,0.0021662374,0.00008189258,0.00012850795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962872,0.0010281224,0.0010978812,0.00048462508,0.00027369213,0.0008284349],"domain_scores_gemma":[0.9958878,0.0010105505,0.00048304012,0.0021668163,0.000182704,0.00026908523],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0014033113,0.0009178359,0.0011252938,0.00030995073,0.001031531,0.00057320733,0.0010060194,0.0015780819,0.000071640156],"category_scores_gemma":[0.000043453805,0.0010635597,0.00014526506,0.00038048872,0.00042040012,0.00064181385,0.0004965714,0.0026082995,0.000007924536],"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.00076191,0.00078236446,0.00013642684,0.0014700902,0.0006103451,0.0000021292715,0.12321344,0.30025524,0.000022556806,0.022581516,0.21678852,0.33337548],"study_design_scores_gemma":[0.0012818743,0.0002006126,0.00030966438,0.0012634089,0.00012678328,0.000013038193,0.002580601,0.74677086,0.000010760949,0.001455906,0.24484214,0.0011443775],"about_ca_topic_score_codex":0.0003831306,"about_ca_topic_score_gemma":0.00632239,"teacher_disagreement_score":0.4624109,"about_ca_system_score_codex":0.00022212428,"about_ca_system_score_gemma":0.00003842618,"threshold_uncertainty_score":0.99971807},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009933538,0.01039009,0.011349637,0.00026216946,0.9751212,0.00021903613,0.000009733106,0.00035928027,0.0022789035],"genre_scores_gemma":[0.0020361308,0.06252194,0.0006974625,0.00010035136,0.93421197,0.000049205773,0.00024027623,0.000026275748,0.000116367286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971787,0.0005065145,0.0004932294,0.000624734,0.0008035317,0.00039333192],"domain_scores_gemma":[0.99595714,0.0010094496,0.0003849307,0.0020470852,0.00042693905,0.00017445834],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0007420476,0.00037230915,0.00044059823,0.0001275758,0.0009252951,0.00042351152,0.0022576817,0.0018459134,0.000015214561],"category_scores_gemma":[0.00019858594,0.00039968055,0.00013351416,0.0004357845,0.00023045998,0.0006861322,0.0015272599,0.00295319,0.000025280187],"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.000017670724,0.00004653572,5.928652e-7,0.000017686512,0.000020744055,0.0000012480832,0.00057098886,0.000060813432,1.5649326e-7,0.0034349516,0.99019897,0.005629624],"study_design_scores_gemma":[0.00034576183,0.000082334554,0.0000013823002,0.00008723944,0.000015434358,0.000006204015,0.000009045592,0.039070647,0.0000015008017,0.008122341,0.9518638,0.00039430318],"about_ca_topic_score_codex":0.00016266324,"about_ca_topic_score_gemma":0.0001488964,"teacher_disagreement_score":0.05213185,"about_ca_system_score_codex":0.00007726114,"about_ca_system_score_gemma":0.00017671501,"threshold_uncertainty_score":0.9998455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783398,0.0026336934,0.00058107136,0.0045805154,0.000105212035,0.0005174158,0.0000139095555,0.00023078987,0.012997623],"genre_scores_gemma":[0.99764514,0.00038679416,0.00014545252,0.0013001831,0.000076699784,0.00012307901,0.00016868666,0.000020943473,0.00013300126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988322,0.00007437975,0.00043316188,0.00022448688,0.00019643537,0.00023930093],"domain_scores_gemma":[0.9985075,0.000117686395,0.00046430234,0.00070607546,0.00019307256,0.000011377221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087145076,0.00016347847,0.00022370275,0.00017582881,0.0011785807,0.00014247734,0.00038502918,0.000101745594,0.000633842],"category_scores_gemma":[0.00005362288,0.0001853464,0.000052729825,0.0006833196,0.000369737,0.0004390586,0.0010864359,0.00078676455,0.000004186942],"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.00012467722,0.00095869816,0.37268037,0.0002424244,0.00034979146,0.0000040230475,0.0022251925,0.045335926,0.00007781476,0.5307634,0.009050715,0.038187012],"study_design_scores_gemma":[0.003601484,0.00011930581,0.09112261,0.00017948908,0.00031641536,0.000035930447,0.015913427,0.17097867,0.00006783121,0.04189046,0.67450935,0.0012650575],"about_ca_topic_score_codex":0.0014857965,"about_ca_topic_score_gemma":0.0009834074,"teacher_disagreement_score":0.6654586,"about_ca_system_score_codex":0.000025650961,"about_ca_system_score_gemma":0.000018223585,"threshold_uncertainty_score":0.90648085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031828769,0.0044626235,0.97763807,0.00914515,0.0011707802,0.0016715045,0.000012455659,0.0002675477,0.0024490159],"genre_scores_gemma":[0.9915295,0.00017640069,0.005431802,0.0012464565,0.000397798,0.0010417717,0.00010182879,0.000011570892,0.00006285321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987468,0.00027740828,0.00023464406,0.00032499965,0.00018188253,0.00023425026],"domain_scores_gemma":[0.99814534,0.00048667492,0.00019864771,0.0009784495,0.0001177027,0.00007319327],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00056114653,0.00013485688,0.00015291912,0.000059960697,0.0018743484,0.00017571561,0.0013328801,0.000053859454,0.0000043292007],"category_scores_gemma":[0.000010827135,0.00014621111,0.00004459293,0.0005011829,0.000057123667,0.0001235711,0.0012625481,0.00034959614,0.0000033079607],"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.00013311763,0.0013570728,0.00087482866,0.00011728137,0.00020670098,0.000002086847,0.029669717,0.031616285,0.000030331319,0.4332412,0.15721868,0.34553272],"study_design_scores_gemma":[0.00037063807,0.00016037095,0.00023704131,0.000022412685,0.000010833023,0.0000028207503,0.0003809746,0.41962937,0.000017901431,0.017532198,0.56141835,0.00021709097],"about_ca_topic_score_codex":0.000008646014,"about_ca_topic_score_gemma":0.000009534319,"teacher_disagreement_score":0.98834664,"about_ca_system_score_codex":0.00009631821,"about_ca_system_score_gemma":0.00009339351,"threshold_uncertainty_score":0.99942505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114259705,0.0066382205,0.7266084,0.14292902,0.0013061564,0.0024210478,0.00007374551,0.0020149192,0.003748814],"genre_scores_gemma":[0.98229796,0.00015507164,0.016395923,0.0005392426,0.000027858889,0.00008232179,0.00049197103,0.000008083244,0.0000015457599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965733,0.0020207309,0.00026523977,0.0004707945,0.00045097867,0.00021891487],"domain_scores_gemma":[0.99096155,0.0009751725,0.00016704905,0.007815677,0.00004561272,0.000034934455],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0042218603,0.00011832041,0.00014146518,0.00013917158,0.0008089438,0.00023149666,0.016669275,0.00017973875,0.000040707255],"category_scores_gemma":[0.008774504,0.00013874484,0.000014904192,0.0009525596,0.00007146883,0.00029998817,0.068288505,0.0022679546,0.0000016063452],"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.0001540865,0.0006030642,0.006954577,0.000011639091,0.00003551799,0.000006847403,0.0008035121,0.45257187,0.000004547588,0.031317946,0.050845418,0.45669097],"study_design_scores_gemma":[0.00046488532,0.00006717375,0.00034041883,0.000050800536,0.000004670076,0.0000014561989,0.000116866926,0.90505624,0.000003431029,0.090692975,0.0030722392,0.00012882003],"about_ca_topic_score_codex":0.00011490491,"about_ca_topic_score_gemma":0.000048252143,"teacher_disagreement_score":0.8680383,"about_ca_system_score_codex":0.00014357296,"about_ca_system_score_gemma":0.00011278633,"threshold_uncertainty_score":0.999575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99287987,0.0002689127,0.005421904,0.000128259,0.000017971095,0.000121386416,0.000021855154,0.000034723755,0.001105095],"genre_scores_gemma":[0.9994901,0.00010042979,0.00008413301,0.00006731635,0.000028890816,0.000010576173,0.00021008066,0.0000067751857,0.0000016951193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938756,0.000012701096,0.00027282772,0.00013212409,0.00008428115,0.00011050843],"domain_scores_gemma":[0.999236,0.000069940776,0.00021740992,0.00044687092,0.000020013209,0.000009765748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028069952,0.00009602359,0.00018361189,0.00010115863,0.0001682762,0.00006300339,0.00034460987,0.000038150345,0.000016081072],"category_scores_gemma":[0.000012222374,0.00008888038,0.000047015583,0.00019129105,0.00003582088,0.0005139516,0.0003003901,0.00014988618,1.245637e-7],"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.000090490386,0.000071999464,0.054809038,0.00005123714,0.00002814404,8.797906e-8,0.000078407924,0.9356146,0.0000011274649,0.00091957295,0.000099424375,0.0082359],"study_design_scores_gemma":[0.00023712081,0.000056653822,0.0031848364,0.000063873114,0.000023730763,3.630055e-7,0.00010259423,0.995955,4.4394844e-7,0.00018820885,0.00010896411,0.000078199024],"about_ca_topic_score_codex":0.000046364243,"about_ca_topic_score_gemma":0.000008009984,"teacher_disagreement_score":0.06034044,"about_ca_system_score_codex":0.000015734093,"about_ca_system_score_gemma":0.000004829487,"threshold_uncertainty_score":0.3624437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07448296,0.00792327,0.9142434,0.0014184567,0.0000875034,0.0005883645,0.000017079226,0.0009675028,0.00027146493],"genre_scores_gemma":[0.970521,0.0118480455,0.01736294,0.000102796104,0.000018149243,0.000056748584,0.000067397865,0.000008055585,0.000014868307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890774,0.00035021742,0.00025167232,0.00025945462,0.00010866619,0.00012225157],"domain_scores_gemma":[0.99869263,0.00021821461,0.00016113304,0.0006883249,0.000184843,0.000054825243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645263,0.0001092256,0.00016589413,0.00012532239,0.00023715728,0.000084961874,0.00032348477,0.00012013911,0.0000021913972],"category_scores_gemma":[0.000080388396,0.00011688509,0.000013886733,0.00065880216,0.00012363402,0.00046817717,0.00052892184,0.00019220701,4.857819e-7],"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.00005017711,0.00015954873,0.011970692,0.00018471581,0.00010446549,0.000004325215,0.0044458522,0.00032360994,0.0020418745,0.29338884,0.0032494508,0.6840764],"study_design_scores_gemma":[0.00039863776,0.00019807652,0.1643673,0.00012788075,0.000024730018,0.00006252045,0.000085597385,0.76968217,0.004193485,0.057753544,0.0026126788,0.00049340865],"about_ca_topic_score_codex":0.00017313828,"about_ca_topic_score_gemma":0.00032387517,"teacher_disagreement_score":0.89688045,"about_ca_system_score_codex":0.00001109799,"about_ca_system_score_gemma":0.000017944822,"threshold_uncertainty_score":0.47664356},"labels":[],"label_agreement":null}]}