{"meta":{"query_hash":"fea12930f71b","filters":{"topic":"Wireless Communication Security Techniques"},"cohort_total":711,"direct_labels_cover":0,"predictions_cover":711,"exported":711,"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/fea12930f71b","api":"https://metacan.xera.ac/api/v1/cohort?topic=Wireless+Communication+Security+Techniques"},"results":[{"id":"W1194438082","doi":"10.1134/s0032946015020106","title":"On the source-channel separation theorem for infinite source alphabets","year":2015,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Mathematics; Alphabet; Channel (broadcasting); Mutual fund separation theorem; Separation (statistics); Countable set; Finite set; Discrete mathematics; Computer science; Mathematical analysis; Telecommunications; Statistics","score_opus":0.02382126162757196,"score_gpt":0.25038063171377767,"score_spread":0.22655937008620572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1194438082","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.0121670095,0.0001482197,0.9785051,0.00067991397,0.00004444473,0.0008648282,0.000010425195,0.00049258926,0.007087479],"genre_scores_gemma":[0.99596184,0.000117201576,0.0034056173,0.00016127518,0.000012634465,0.00019300614,0.00009827643,0.000020448057,0.00002970789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990214,0.00003979305,0.00048415142,0.000056834902,0.00025532558,0.00014250484],"domain_scores_gemma":[0.9990533,0.00020668912,0.00013363782,0.0003164757,0.00021841508,0.0000714911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070396654,0.00013815584,0.00013791003,0.00015064648,0.00008970166,0.000048067654,0.00029866036,0.00011026453,0.000011714103],"category_scores_gemma":[0.00007553718,0.0001018126,0.00006808216,0.00016813797,0.000038623668,0.0006644284,0.0000170822,0.0001536025,0.000019971],"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.0001604633,0.00008043958,0.00001675004,0.0008053837,0.00005861181,2.3384517e-8,0.044868868,0.66654146,0.0028669687,0.048915412,0.01895775,0.21672788],"study_design_scores_gemma":[0.0007636843,0.00018150687,0.00002058002,0.0003201025,0.000013083875,0.000001706852,0.00056405755,0.7151969,0.06708964,0.025188427,0.19042704,0.0002332704],"about_ca_topic_score_codex":0.000007829866,"about_ca_topic_score_gemma":0.0000011952847,"teacher_disagreement_score":0.9837948,"about_ca_system_score_codex":0.00003778168,"about_ca_system_score_gemma":0.000022973472,"threshold_uncertainty_score":0.41517973},"labels":[],"label_agreement":null},{"id":"W120140206","doi":"10.1007/978-1-4939-0413-6_4","title":"Cooperative Networking for Secure Communications","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eavesdropping; Secrecy; Cognitive radio; Computer science; Computer network; Computer security; Transmission (telecommunications); Secure transmission; Secure communication; Information transmission; Telecommunications; Wireless; Encryption","score_opus":0.03146100857912078,"score_gpt":0.26267618100296836,"score_spread":0.2312151724238476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120140206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011166658,0.0034656255,0.6712661,0.00046974648,0.0018337278,0.0021514692,0.00003148135,0.0015446049,0.3191256],"genre_scores_gemma":[0.20751256,0.0074999835,0.7723334,0.0008050794,0.0016911214,0.0008944762,0.00009738324,0.00040732502,0.0087586865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983189,0.000016949674,0.0005029116,0.0004509481,0.0002965663,0.00041373345],"domain_scores_gemma":[0.9968627,0.00025885043,0.00011894936,0.002349937,0.00030569534,0.00010384257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057149795,0.00035242076,0.00039918834,0.0003862105,0.00026247016,0.00027888894,0.003256114,0.00023663272,0.000034474473],"category_scores_gemma":[0.000013602648,0.00040841184,0.000088341665,0.0002266471,0.0007676114,0.00039062448,0.001216668,0.0007532452,0.00004892822],"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.0000027957785,0.000031914937,0.000018387236,0.00016956424,0.000048944534,0.0000029187595,0.0015084241,0.010912608,0.00023769702,0.7932794,0.00617469,0.18761262],"study_design_scores_gemma":[0.00014591614,0.000036688045,0.00003165421,0.0005993297,0.000007988902,0.000005331144,0.0000026164898,0.5640759,0.00034643462,0.014441276,0.41969037,0.00061653653],"about_ca_topic_score_codex":0.000012702401,"about_ca_topic_score_gemma":0.00007508183,"teacher_disagreement_score":0.77883816,"about_ca_system_score_codex":0.0003563781,"about_ca_system_score_gemma":0.000121041994,"threshold_uncertainty_score":0.9998368},"labels":[],"label_agreement":null},{"id":"W1235372244","doi":"10.1007/978-3-319-04268-8_14","title":"Detection of Algebraic Manipulation in the Presence of Leakage","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Computer science; Upper and lower bounds; Algorithm; Adversary; Theoretical computer science; Information leakage; Entropy (arrow of time); Algebraic number; Mathematics; Computer security","score_opus":0.0168992483949532,"score_gpt":0.23570340119628003,"score_spread":0.2188041528013268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1235372244","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.0054685054,0.000265664,0.992562,0.00004154672,0.00013296604,0.0002462375,0.0000012349464,0.00006540099,0.0012164565],"genre_scores_gemma":[0.9867685,0.000058953898,0.013076373,0.000032177777,0.000035953024,0.000006585783,0.000002013739,0.000014516162,0.0000049527716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989169,0.000036950165,0.00035769583,0.0002018782,0.00035786,0.00012866908],"domain_scores_gemma":[0.99859816,0.00040802878,0.00013335886,0.0007741785,0.00007293726,0.000013364128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006615858,0.00014872412,0.00022532065,0.00041996443,0.000026004813,0.000023224335,0.0010916064,0.00015888903,0.0000037891136],"category_scores_gemma":[0.000056363366,0.00012830405,0.00004141497,0.0002879566,0.00027958053,0.000101968806,0.00014449487,0.00041489932,0.0000012547558],"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.0000055590335,0.000019262696,0.00016927665,0.00032253,0.0000075028934,0.0000022951824,0.0034168016,0.29217958,0.019054338,0.017087603,0.0000058426376,0.6677294],"study_design_scores_gemma":[0.00009933043,0.00007448383,0.0019686215,0.00057365984,0.000005246032,0.000009227997,6.089095e-7,0.85602415,0.07809907,0.06256475,0.00033015685,0.00025072158],"about_ca_topic_score_codex":0.000033622917,"about_ca_topic_score_gemma":0.0002739,"teacher_disagreement_score":0.9813,"about_ca_system_score_codex":0.00006739976,"about_ca_system_score_gemma":0.00002210153,"threshold_uncertainty_score":0.52320874},"labels":[],"label_agreement":null},{"id":"W133506345","doi":"10.1007/978-3-642-27901-0_11","title":"Secret Key Establishment over Noisy Channels","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Key (lock); Computer science; Channel (broadcasting); Computer security; Key generation; Pre-shared key; Theoretical computer science; Computer network; Cryptography; Public-key cryptography; Key distribution; Mathematics; Statistics; Encryption","score_opus":0.015507405460218494,"score_gpt":0.23847914000878737,"score_spread":0.22297173454856886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133506345","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.00035504682,0.002425439,0.9847165,0.00015887586,0.001301255,0.0003657181,0.000012658539,0.0007334306,0.009931104],"genre_scores_gemma":[0.8642474,0.00080869393,0.13299821,0.00069835765,0.00085509336,0.000036285357,0.000033158776,0.00013378613,0.00018901039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980177,0.000016332766,0.00037209672,0.0004696973,0.0005983035,0.0005258704],"domain_scores_gemma":[0.9981269,0.00019012854,0.00009526157,0.0013394152,0.00010067091,0.00014761322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021917,0.00042898417,0.00039196594,0.0005631329,0.00009510216,0.00023580807,0.001673493,0.0003640816,0.00014214056],"category_scores_gemma":[0.00002354754,0.0004400803,0.00008412277,0.0002655925,0.00033443293,0.0004331247,0.0006773009,0.0009154404,0.000047700614],"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.000005882256,0.000053971282,0.00013782285,0.00026192676,0.000047559108,0.000026888725,0.0046940898,0.10889188,0.0013256186,0.022798488,0.00082510454,0.86093074],"study_design_scores_gemma":[0.00043682702,0.00012884945,0.00029309973,0.0015346579,0.000033549608,0.000067168796,5.026876e-7,0.6895444,0.02845406,0.10019284,0.1765957,0.0027183783],"about_ca_topic_score_codex":0.00001814564,"about_ca_topic_score_gemma":0.000036985304,"teacher_disagreement_score":0.8638924,"about_ca_system_score_codex":0.00039959454,"about_ca_system_score_gemma":0.00007200356,"threshold_uncertainty_score":0.9998051},"labels":[],"label_agreement":null},{"id":"W1484103301","doi":"10.1007/978-3-642-20728-0_8","title":"Common Randomness and Secret Key Capacities of Two-Way Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Computer science; Channel (broadcasting); Key (lock); Channel capacity; Binary number; Theoretical computer science; Coding (social sciences); Information theory; Cryptography; Key generation; Binary erasure channel; Binary symmetric channel; Channel code; Adversary; Information-theoretic security; Algorithm; Discrete mathematics; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.02068454533193444,"score_gpt":0.23451758106103648,"score_spread":0.21383303572910203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484103301","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.005531108,0.002100717,0.9819141,0.000041385334,0.00047641795,0.00032761449,0.000016086024,0.00030064164,0.009291956],"genre_scores_gemma":[0.96497864,0.0004983575,0.03426908,0.00007663636,0.000085800086,0.000011571317,0.0000062822014,0.000041022584,0.000032607786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875164,0.000025167416,0.000371316,0.00031693815,0.00029138624,0.0002435613],"domain_scores_gemma":[0.9986176,0.00028787216,0.00011633544,0.0008036987,0.000109539,0.00006493569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043727396,0.0003083148,0.0005346569,0.00045313814,0.000068430534,0.0000644857,0.0009851736,0.00021752305,0.000022993247],"category_scores_gemma":[0.000017127944,0.00030309934,0.000055227585,0.00014052876,0.0011758899,0.00018755105,0.0003777373,0.00055100967,0.000002261665],"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.00006148081,0.000057666002,0.0002753243,0.0013614265,0.00012164092,0.000040326697,0.04312379,0.062532715,0.0036502923,0.14147682,0.00010319844,0.7471953],"study_design_scores_gemma":[0.0012984864,0.00017897834,0.00008248603,0.002356046,0.00003469106,0.00009301858,0.0000026192045,0.29913887,0.10638772,0.5865327,0.0023563716,0.0015380051],"about_ca_topic_score_codex":0.0000700822,"about_ca_topic_score_gemma":0.00012297896,"teacher_disagreement_score":0.95944756,"about_ca_system_score_codex":0.00006634347,"about_ca_system_score_gemma":0.00003462599,"threshold_uncertainty_score":0.9999421},"labels":[],"label_agreement":null},{"id":"W1489319061","doi":"10.1007/3-540-39200-9_35","title":"New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Secrecy; Upper and lower bounds; Shared secret; Key (lock); Theoretical computer science; Context (archaeology); Fraction (chemistry); Information theory; Mutual information; Adversary; Pre-shared key; Key distribution; Public-key cryptography; Algorithm; Cryptography; Mathematics; Computer security; Encryption; Statistics; Artificial intelligence","score_opus":0.023777761368714196,"score_gpt":0.25714382903355515,"score_spread":0.23336606766484094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489319061","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.0006262096,0.0010140294,0.9921645,0.0004874096,0.00020458519,0.0003416598,0.000003478054,0.00014145726,0.0050166496],"genre_scores_gemma":[0.8347348,0.0011808005,0.16302285,0.0005176554,0.00030196353,0.000020759724,0.000036904927,0.000058750495,0.00012549317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.000031018146,0.00036181655,0.00028791695,0.00034681393,0.0002474733],"domain_scores_gemma":[0.9989272,0.00024081365,0.00010183324,0.00062062393,0.000048144895,0.00006143659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005913775,0.000251133,0.00023358177,0.00041735705,0.0001161555,0.0002293073,0.0006647186,0.00023514789,0.0000197129],"category_scores_gemma":[0.000024141276,0.00022343862,0.000033291406,0.0002729956,0.0001624987,0.0004959956,0.00017424824,0.0007794636,0.000005544091],"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.0000022058848,0.000005207536,0.00016271914,0.00008475596,0.000010011644,0.0000035103812,0.0030455708,0.011768348,0.00035173658,0.0072720493,0.00015425992,0.97713965],"study_design_scores_gemma":[0.00058509025,0.00012774854,0.001701494,0.0013248861,0.000029963727,0.00008376551,0.0000035711166,0.492074,0.012584914,0.43951696,0.050573997,0.0013936177],"about_ca_topic_score_codex":0.000045936747,"about_ca_topic_score_gemma":0.00033720274,"teacher_disagreement_score":0.97574604,"about_ca_system_score_codex":0.00029543025,"about_ca_system_score_gemma":0.000057263383,"threshold_uncertainty_score":0.91115624},"labels":[],"label_agreement":null},{"id":"W1497831848","doi":"10.48550/arxiv.1207.2094","title":"The Capacity of More Capable Cognitive Interference Channels","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Interference (communication); Cognition; Computer science; Channel (broadcasting); Telecommunications; Psychology; Neuroscience","score_opus":0.09219998874790677,"score_gpt":0.20168928785755175,"score_spread":0.10948929910964497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497831848","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.91839665,0.0005402319,0.07318151,0.00003309573,0.0003949205,0.00041194088,0.00009342245,0.00054026913,0.006407926],"genre_scores_gemma":[0.998054,0.0015465625,0.00012854736,0.000009032353,0.000036454498,0.0000048688185,0.000020843727,0.00003101521,0.000168629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991036,0.00010173392,0.00020771852,0.00024916342,0.000061701736,0.00027609814],"domain_scores_gemma":[0.9983404,0.00024669888,0.00015371357,0.0009445035,0.00022854716,0.0000861068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023574076,0.00024674975,0.0002886679,0.00011375032,0.00010580618,0.000031195366,0.0011113712,0.0002717402,0.000028434153],"category_scores_gemma":[0.000045079098,0.00024928694,0.00013174572,0.00022053596,0.00034086613,0.00015696141,0.0008636826,0.00080763904,0.00002156839],"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.00035752772,0.00087518455,0.015084026,0.0036152182,0.0033605122,0.000071061484,0.032608822,0.434749,0.005390207,0.49134007,0.005157793,0.007390574],"study_design_scores_gemma":[0.0012134307,0.00011533645,0.004346715,0.0030506353,0.00075034116,0.000013804102,0.005723949,0.77469236,0.13121271,0.07164843,0.0042582047,0.002974116],"about_ca_topic_score_codex":0.00022068573,"about_ca_topic_score_gemma":0.00006935648,"teacher_disagreement_score":0.41969165,"about_ca_system_score_codex":0.00014463592,"about_ca_system_score_gemma":0.00003313149,"threshold_uncertainty_score":0.99999595},"labels":[],"label_agreement":null},{"id":"W1500163133","doi":"10.1007/978-3-642-20465-4_16","title":"Secret Keys from Channel Noise","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Alice and Bob; Initialization; Randomness; Channel (broadcasting); Key (lock); Upper and lower bounds; Protocol (science); Verifiable secret sharing; Binary number; Simple (philosophy); Binary symmetric channel; Adversary; Theoretical computer science; Computer network; Computer security; Alice (programming language); Channel capacity; Mathematics; Arithmetic; Set (abstract data type)","score_opus":0.02080767559792113,"score_gpt":0.22384836468297692,"score_spread":0.2030406890850558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500163133","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.00021072027,0.0011636129,0.9780626,0.00008652164,0.0006809245,0.00023005254,0.000026041906,0.0007855368,0.018753935],"genre_scores_gemma":[0.83303726,0.00067485415,0.16490504,0.0005616425,0.00048101268,0.000024314175,0.00004793431,0.00012858113,0.00013934879],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998392,0.000014586566,0.00033639706,0.0005353046,0.00037801266,0.0003436994],"domain_scores_gemma":[0.9980869,0.00018822074,0.00008355014,0.0014387863,0.000096628246,0.00010588035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023909072,0.00039120237,0.00038183152,0.0004384555,0.00008054855,0.00011177548,0.0020101874,0.00038345842,0.00012431038],"category_scores_gemma":[0.000021889291,0.00040829033,0.000080138416,0.0001854723,0.0003867437,0.00021208037,0.0005919553,0.00089411903,0.0000810335],"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.0000116016,0.000049817772,0.00006751218,0.00014870957,0.00007149954,0.00008005996,0.008193057,0.05571534,0.0019531755,0.012310233,0.0005227118,0.92087626],"study_design_scores_gemma":[0.00019589899,0.000064602675,0.00018868616,0.00082501944,0.000016326556,0.000014313956,2.2555567e-7,0.46377152,0.02142261,0.5013146,0.010882069,0.0013041331],"about_ca_topic_score_codex":0.000096765165,"about_ca_topic_score_gemma":0.00014286797,"teacher_disagreement_score":0.9195722,"about_ca_system_score_codex":0.0001984416,"about_ca_system_score_gemma":0.00006908479,"threshold_uncertainty_score":0.9998369},"labels":[],"label_agreement":null},{"id":"W1501140009","doi":"10.1109/tsp.2015.2457398","title":"Worst-Case Jamming on MIMO Gaussian Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Jamming; MIMO; Transceiver; Channel (broadcasting); Closed-form expression; Computer science; Gaussian; Interference (communication); Mathematical optimization; Algorithm; Mathematics; Telecommunications; Wireless","score_opus":0.0442335340115109,"score_gpt":0.27367462954889576,"score_spread":0.22944109553738487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501140009","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.026204417,0.00021203897,0.96670187,0.00020446713,0.00023139511,0.00021533787,0.000008960353,0.0016611445,0.004560362],"genre_scores_gemma":[0.99466795,0.00001882568,0.0048228274,0.00012883217,0.00008339925,0.00009185879,0.0000023572495,0.000079246274,0.00010469291],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880594,0.000048994836,0.00031054017,0.0002360792,0.00029237903,0.00030608053],"domain_scores_gemma":[0.99920326,0.00007438188,0.00005162588,0.0003645851,0.0000989518,0.00020718595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002601945,0.00025361613,0.00021108016,0.00032300997,0.00026475656,0.00014888121,0.00025536117,0.00015147579,0.000037319736],"category_scores_gemma":[0.0000035605945,0.0002698583,0.000076565106,0.0004342862,0.00005971331,0.0004078506,0.0000017287473,0.00059839414,0.00008626389],"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.000101529906,0.00035714929,0.0000024479498,0.00022382257,0.00007155539,0.00027439874,0.0072353925,0.26582158,0.005335303,0.00029396923,0.0006849718,0.7195979],"study_design_scores_gemma":[0.0012209484,0.00045272498,0.0000027995677,0.0011113711,0.00008174302,0.00079719245,0.0023115145,0.4885346,0.49517778,0.0019092791,0.0071287644,0.0012712869],"about_ca_topic_score_codex":0.000017926144,"about_ca_topic_score_gemma":0.000018527397,"teacher_disagreement_score":0.96846354,"about_ca_system_score_codex":0.00018407944,"about_ca_system_score_gemma":0.00004973852,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W1505562276","doi":"10.1109/jsac.2015.2432513","title":"Physical-Layer Security for MISO Visible Light Communication Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":259,"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; University of British Columbia; McMaster University","keywords":"Computer science; Transmitter; Visible light communication; Beamforming; Physical layer; Channel (broadcasting); Secure transmission; Secrecy; Computer network; Transmission (telecommunications); Telecommunications; Topology (electrical circuits); Wireless; Computer security; Electrical engineering; Physics; Light-emitting diode; Optics; Engineering","score_opus":0.05083687756006165,"score_gpt":0.32233816584297315,"score_spread":0.2715012882829115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505562276","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.8494331,0.014800296,0.03239514,0.031034892,0.0016384813,0.0048234076,0.00019640857,0.0049900073,0.06068826],"genre_scores_gemma":[0.9869585,0.0025571738,0.009561969,0.00017149372,0.00015766783,0.00037413053,0.00008424408,0.00009084197,0.00004394538],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977908,0.0005365899,0.00070715416,0.00018861426,0.00035335752,0.000423498],"domain_scores_gemma":[0.9946915,0.00079636683,0.00023335432,0.0030375258,0.0009734479,0.0002678188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009498384,0.00030837764,0.0004310681,0.00051407726,0.00039215444,0.00021112288,0.0028497472,0.00019864342,0.000008252218],"category_scores_gemma":[0.00036122178,0.00032976863,0.000137508,0.0011575249,0.00010994763,0.00051237305,0.00018517819,0.001549572,0.000039118113],"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.0005850846,0.010236392,0.0019460283,0.0003010917,0.0011539329,0.000014792128,0.081748076,0.07515912,0.053896617,0.105916046,0.64538884,0.023653956],"study_design_scores_gemma":[0.0043375846,0.00062471256,0.00062440697,0.0010848836,0.00012096374,0.00017779172,0.0012044868,0.43822518,0.085465,0.11311844,0.35326904,0.0017474978],"about_ca_topic_score_codex":0.000023992721,"about_ca_topic_score_gemma":0.00014764442,"teacher_disagreement_score":0.36306608,"about_ca_system_score_codex":0.0005782861,"about_ca_system_score_gemma":0.00015427261,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W1506824078","doi":"10.1109/tit.2015.2450721","title":"Output Constrained Lossy Source Coding With Limited Common Randomness","year":2015,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Encoder; Computer science; Channel (broadcasting); Algorithm; Mathematical optimization; Mathematics; Telecommunications; Statistics","score_opus":0.017203309730539042,"score_gpt":0.2336437275389816,"score_spread":0.21644041780844256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506824078","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.012508232,0.00006551938,0.9705112,0.00008847166,0.0004914282,0.0009211501,0.00023897391,0.0030234605,0.012151572],"genre_scores_gemma":[0.9966705,0.0002068762,0.0021039748,0.00017392775,0.000028774859,0.00042831895,0.00021008824,0.00006854556,0.00010903129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812484,0.0002229843,0.0007802742,0.00016563798,0.00042531893,0.000280928],"domain_scores_gemma":[0.9977836,0.00035522314,0.00025830662,0.0011030214,0.00034793187,0.00015188764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087233254,0.0004645603,0.0005321944,0.00066182466,0.00019600907,0.00024066052,0.0006235245,0.00048698194,0.00007147397],"category_scores_gemma":[0.0000139224085,0.00046094728,0.00015307656,0.0002713226,0.00022229776,0.00078776537,0.000011395149,0.0015464466,0.00011760652],"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.0005159092,0.000073041825,0.0000021242377,0.0005140981,0.0003052508,0.0000012959694,0.0071004843,0.9159377,0.00003551341,0.0024905398,0.0007752257,0.072248824],"study_design_scores_gemma":[0.009129901,0.00031308612,0.000027410337,0.0028817593,0.0005607502,0.00014200727,0.0052850484,0.88933104,0.05224033,0.012470814,0.02434577,0.0032720673],"about_ca_topic_score_codex":0.000019904126,"about_ca_topic_score_gemma":0.00001630885,"teacher_disagreement_score":0.9841622,"about_ca_system_score_codex":0.00031766554,"about_ca_system_score_gemma":0.00012501169,"threshold_uncertainty_score":0.99978423},"labels":[],"label_agreement":null},{"id":"W1511874843","doi":"10.1109/cwit.2015.7255140","title":"Non-binary distributed arithmetic coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Binary number; Computer science; Arithmetic coding; Coding (social sciences); Context-adaptive binary arithmetic coding; Binary code; Encoding (memory); Distributed source coding; Arithmetic; Variable-length code; Theoretical computer science; Algorithm; Decoding methods; Mathematics; Artificial intelligence; Data compression; Statistics","score_opus":0.028349570104148264,"score_gpt":0.25585205540527617,"score_spread":0.2275024853011279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511874843","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.26414385,0.00054816296,0.5611235,0.00082869653,0.00031834183,0.00041264496,0.000030433368,0.007727936,0.16486643],"genre_scores_gemma":[0.9902596,0.000040510487,0.009507469,0.00003228519,0.000017404353,0.0000206138,0.000037816422,0.000017579581,0.000066709435],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958384,0.000009847351,0.00012452927,0.000064030355,0.0000962465,0.000121535915],"domain_scores_gemma":[0.9994719,0.000024672789,0.000010353452,0.0003620438,0.000048287904,0.000082714534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012310108,0.00007712765,0.00009383082,0.000050987914,0.00002108364,0.000026383339,0.00022911442,0.000051286577,0.000029625879],"category_scores_gemma":[0.000019295589,0.00007916685,0.000021026295,0.00015436977,0.00002071938,0.000106441665,0.00007291286,0.000121161196,0.00008084431],"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.00002651881,0.0003583653,0.008370268,0.00028703827,0.00020157194,0.00006218357,0.003935208,0.02304064,0.045119163,0.07072873,0.82821184,0.019658474],"study_design_scores_gemma":[0.0005930697,0.00006535797,0.0032722624,0.00006832343,0.000015164257,0.00001941677,0.00048280624,0.8479555,0.06294049,0.0033505796,0.080647334,0.0005896381],"about_ca_topic_score_codex":0.000018444425,"about_ca_topic_score_gemma":0.0000046650302,"teacher_disagreement_score":0.82491493,"about_ca_system_score_codex":0.000074902164,"about_ca_system_score_gemma":0.000009957838,"threshold_uncertainty_score":0.32283306},"labels":[],"label_agreement":null},{"id":"W1513972321","doi":"10.1109/pimrc.2014.7136146","title":"Full-duplex relay with jamming protocol for improving physical-layer security","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Jamming; Relay; Secrecy; Computer science; Physical layer; Computer network; Interference (communication); Protocol (science); Power (physics); Telecommunications; Wireless; Computer security; Physics","score_opus":0.024545804776615554,"score_gpt":0.3027752970567611,"score_spread":0.27822949228014554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513972321","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046777263,0.000015721967,0.6065333,0.00021778578,0.000112896356,0.33201447,0.000050876064,0.00769377,0.0065839184],"genre_scores_gemma":[0.41189805,0.0000018013757,0.07743169,0.00004097264,0.00021607247,0.51014555,0.00004291082,0.00015892235,0.00006402343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817634,0.00006534168,0.00047372273,0.00054463244,0.0002982323,0.00044172988],"domain_scores_gemma":[0.9973376,0.00020118688,0.00021388046,0.0018795315,0.00024898167,0.00011882267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032446065,0.0005645527,0.00062344497,0.00014862057,0.00011422,0.00018584554,0.0009997373,0.00043313275,0.000031651954],"category_scores_gemma":[0.000045157,0.000498742,0.00020216165,0.00011038386,0.00007089822,0.00015663373,0.0007424075,0.0012397179,0.0000151491395],"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.0013432204,0.0016882734,0.0002611187,0.055360608,0.0014685882,0.000013756133,0.018230489,0.6032847,0.061614998,0.042462878,0.05025987,0.16401146],"study_design_scores_gemma":[0.00066105975,0.00019209684,0.000009906962,0.00036852967,0.00003892144,0.00000381281,0.00004781784,0.91895217,0.03727369,0.00094581017,0.04067636,0.0008298256],"about_ca_topic_score_codex":0.00006716122,"about_ca_topic_score_gemma":0.000077671386,"teacher_disagreement_score":0.5291016,"about_ca_system_score_codex":0.0001978671,"about_ca_system_score_gemma":0.0000691155,"threshold_uncertainty_score":0.99974644},"labels":[],"label_agreement":null},{"id":"W1514757060","doi":"10.1109/cwit.2015.7255183","title":"Gaussian multiple-access relay channels with non-causal side information at the transmitters","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Relay; Gaussian; Relay channel; Channel (broadcasting); Computer science; Encoder; Topology (electrical circuits); Interference (communication); Channel state information; Computer network; Algorithm; Telecommunications; Power (physics); Mathematics; Wireless; Physics; Combinatorics","score_opus":0.02272727564958008,"score_gpt":0.24488266774859918,"score_spread":0.2221553920990191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514757060","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.45661902,0.00011265013,0.4474258,0.0059317066,0.0002593715,0.0011479598,0.000015084532,0.0025935876,0.08589481],"genre_scores_gemma":[0.99653983,0.00003845095,0.0027130968,0.00040823466,0.000021312208,0.00011378881,0.00003494431,0.000023092363,0.00010727074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993058,0.00002606113,0.00021454661,0.000068844594,0.0002072229,0.00017755333],"domain_scores_gemma":[0.9992322,0.000060292663,0.000037710062,0.00052182964,0.00006106251,0.000086926826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019179861,0.00013719847,0.00011260263,0.00007716122,0.00007356151,0.00012112352,0.00047656678,0.00009424066,0.000029421755],"category_scores_gemma":[0.000012814558,0.00008971573,0.000026213042,0.00018971076,0.00005717969,0.0010875359,0.00008009464,0.00024181158,0.00008393387],"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.00047693556,0.00017121622,0.014905277,0.00054014404,0.0005599205,0.000016823475,0.087473206,0.5868134,0.005830145,0.005424047,0.23353559,0.064253286],"study_design_scores_gemma":[0.0027434314,0.00018943608,0.0078653665,0.0001776155,0.00004892676,0.0000682891,0.0021484522,0.6001982,0.14909452,0.0002550125,0.23605861,0.0011521617],"about_ca_topic_score_codex":0.00017325894,"about_ca_topic_score_gemma":0.00038387315,"teacher_disagreement_score":0.5399208,"about_ca_system_score_codex":0.000119767676,"about_ca_system_score_gemma":0.00001858753,"threshold_uncertainty_score":0.36585012},"labels":[],"label_agreement":null},{"id":"W1519751311","doi":"10.48550/arxiv.1412.5227","title":"BER-Based Physical Layer Security with Finite Codelength: Combining Strong Converse and Error Amplification","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Fading; Converse; Computer science; Physical layer; Bit error rate; Erasure; Transmission (telecommunications); Algorithm; Binary number; Computer network; Topology (electrical circuits); Decoding methods; Telecommunications; Mathematics; Arithmetic; Wireless; Combinatorics","score_opus":0.06614664088249678,"score_gpt":0.20569347306076344,"score_spread":0.13954683217826666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519751311","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.7898659,0.000027459653,0.20753197,0.000040203635,0.000055145105,0.00034610712,0.00005513564,0.0009152498,0.0011628083],"genre_scores_gemma":[0.9986743,0.000094703,0.00090274814,0.000027992714,0.00003571623,0.000007587099,0.00016631559,0.00006580978,0.00002485482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872005,0.0001446751,0.00019263943,0.0005654144,0.00010122601,0.00027599957],"domain_scores_gemma":[0.9980522,0.00028594132,0.00016904599,0.0011921414,0.00015053307,0.00015014784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016987632,0.0003839325,0.00043315187,0.00020121413,0.00012151285,0.000070116206,0.0005817985,0.00029250627,0.000015693375],"category_scores_gemma":[0.000020086596,0.00045988112,0.00009447712,0.00021576209,0.00023371888,0.00017964281,0.00034920414,0.0009759478,0.000018697448],"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.000063354666,0.00020288778,0.0032535444,0.0004851243,0.00017755845,0.000017749395,0.0010869635,0.94522595,0.00016228856,0.048919633,0.00022798353,0.000176942],"study_design_scores_gemma":[0.0006431908,0.00006232734,0.00039916424,0.00019723,0.000117547745,9.560217e-7,0.0001840018,0.99332345,0.0007242021,0.00317433,0.00065606367,0.0005175269],"about_ca_topic_score_codex":0.00007687126,"about_ca_topic_score_gemma":0.00006772882,"teacher_disagreement_score":0.20880835,"about_ca_system_score_codex":0.00016798612,"about_ca_system_score_gemma":0.00005738154,"threshold_uncertainty_score":0.9997853},"labels":[],"label_agreement":null},{"id":"W1525181000","doi":"10.1007/978-3-642-37119-6_6","title":"Message Transmission and Key Establishment: Conditions for Equality of Weak and Strong Capacities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secrecy; Randomness; Communication source; Counterexample; Computer science; Key (lock); Transmission (telecommunications); Information-theoretic security; Information transmission; Key generation; Theoretical computer science; Adversary; Mutual information; Information leakage; Discrete mathematics; Computer security; Computer network; Topology (electrical circuits); Cryptography; Mathematics; Telecommunications; Combinatorics; Statistics","score_opus":0.021311259768493195,"score_gpt":0.2568934007367805,"score_spread":0.23558214096828733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525181000","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.0019955987,0.0012295501,0.99267405,0.00012567142,0.00007141588,0.00041472132,0.00006409867,0.000121166086,0.0033037462],"genre_scores_gemma":[0.8723639,0.00053464255,0.12687872,0.00004950185,0.000030787807,0.00003080235,0.000020081043,0.000025583562,0.000065956054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909425,0.000013753917,0.00027532486,0.0002606703,0.00018641069,0.00016959204],"domain_scores_gemma":[0.9990616,0.00034367887,0.000072324015,0.00036857103,0.000092661736,0.00006117856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838796,0.00019504927,0.00028417935,0.00023345658,0.000092084876,0.00009054165,0.000352964,0.00016570314,0.000021177475],"category_scores_gemma":[0.000014822555,0.00019140479,0.000032070915,0.000061214,0.0007795142,0.00022533367,0.000119894175,0.00026843202,2.8671735e-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.000011179971,0.000042283922,0.000066069544,0.0021941764,0.000058405352,0.0000014897382,0.011454406,0.014043643,0.010071157,0.30456364,0.0003562571,0.6571373],"study_design_scores_gemma":[0.00057498243,0.00019598387,0.00033801806,0.0019688138,0.000039079892,0.000016783455,0.000011445172,0.5888145,0.034097612,0.36036697,0.012596317,0.0009794703],"about_ca_topic_score_codex":0.000025439658,"about_ca_topic_score_gemma":0.000028967099,"teacher_disagreement_score":0.8703683,"about_ca_system_score_codex":0.000051279534,"about_ca_system_score_gemma":0.000031951073,"threshold_uncertainty_score":0.7805261},"labels":[],"label_agreement":null},{"id":"W1526667938","doi":"10.1109/icc.2015.7249503","title":"Secrecy capacity enhancement in two-hop DF relaying systems in the presence of eavesdropper","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"Secrecy; Relay; Computer science; Transmitter; Computer network; Hop (telecommunications); Channel capacity; Jamming; Channel (broadcasting); Computer security; Power (physics)","score_opus":0.05351239601617697,"score_gpt":0.28929388067464573,"score_spread":0.23578148465846877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526667938","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.9572943,0.00060688925,0.01122108,0.00009634352,0.000071438466,0.00038374236,0.0000013091471,0.00013353961,0.030191354],"genre_scores_gemma":[0.99798757,0.000060045324,0.001778123,0.000020440531,0.000009803551,0.00010217542,0.0000015231481,0.000010289053,0.000030043042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990766,0.00015471358,0.00032543123,0.00008808788,0.0002114398,0.00014370344],"domain_scores_gemma":[0.99921227,0.00011873014,0.000034448487,0.0005629926,0.000044264576,0.00002727059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090952654,0.00008668828,0.00015050468,0.00010151032,0.000010677144,0.000018719196,0.00044717887,0.000041419757,0.00000901458],"category_scores_gemma":[0.000060211198,0.00006840215,0.000017465392,0.00026066176,0.00003370733,0.00010685849,0.00006863956,0.00022967286,0.0000074935037],"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.000055004275,0.00088236073,0.08411115,0.0012028912,0.00009601992,0.000022908187,0.15991524,0.25671077,0.13557291,0.34720635,0.007918821,0.0063055945],"study_design_scores_gemma":[0.001951045,0.0001363364,0.0067339437,0.0012976535,0.000013333821,0.000024875391,0.020668307,0.77441615,0.17857596,0.0074630124,0.0077575007,0.0009619115],"about_ca_topic_score_codex":0.002541269,"about_ca_topic_score_gemma":0.0007856313,"teacher_disagreement_score":0.5177054,"about_ca_system_score_codex":0.00011247344,"about_ca_system_score_gemma":0.000014472559,"threshold_uncertainty_score":0.38416556},"labels":[],"label_agreement":null},{"id":"W1534275621","doi":"10.48550/arxiv.1301.0297","title":"Wyner-Ziv Coding in the Real Field Based on BCH-DFT Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"BCH code; Computer science; Coding (social sciences); Mathematics; Algorithm; Decoding methods; Statistics","score_opus":0.06437185637205559,"score_gpt":0.19659438582947425,"score_spread":0.13222252945741866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534275621","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.86512214,0.000059740196,0.053322047,0.00044388266,0.00025060787,0.00083164143,0.000030998726,0.0012738536,0.078665085],"genre_scores_gemma":[0.99834824,0.0007891297,0.0004352577,0.00020540228,0.000036876925,0.000009070227,0.00003697186,0.00003283234,0.00010620781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989023,0.00019321343,0.00020180682,0.00035947197,0.00009215349,0.0002510092],"domain_scores_gemma":[0.9977279,0.00059591356,0.00008231164,0.0014836921,0.000055177163,0.000055024957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030069644,0.00027506927,0.0002747325,0.0002955883,0.000079137244,0.00007613233,0.0014549682,0.00036713632,0.00008578102],"category_scores_gemma":[0.00004594186,0.00027953731,0.000121867655,0.0003101237,0.000064638574,0.00010983809,0.00033729355,0.0011845941,0.000051711966],"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.000037507332,0.00014964343,0.0056202,0.00028269176,0.000058811427,0.00011492753,0.0009511327,0.86431414,0.0002131302,0.121377505,0.006043408,0.0008369145],"study_design_scores_gemma":[0.00028277203,0.000041518466,0.0022277737,0.00034630016,0.000032145792,6.557534e-7,0.00021077825,0.98632145,0.0011100195,0.0074496395,0.001513501,0.00046346546],"about_ca_topic_score_codex":0.00068299414,"about_ca_topic_score_gemma":0.0002986804,"teacher_disagreement_score":0.13322611,"about_ca_system_score_codex":0.00020877105,"about_ca_system_score_gemma":0.000037796504,"threshold_uncertainty_score":0.99996567},"labels":[],"label_agreement":null},{"id":"W1538574033","doi":"10.1109/cwit.2015.7255148","title":"Enhancing secrecy of the Gaussian wiretap channel using rate compatible LDPC codes with error amplification","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Université Laval","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Secrecy; Channel (broadcasting); Computer network; Network packet; Bit error rate; Algorithm; Computer security","score_opus":0.05875133522326673,"score_gpt":0.27419604875690895,"score_spread":0.21544471353364222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538574033","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.66808856,0.00014235989,0.32521752,0.00017692671,0.00006515655,0.00034297613,0.0000061640358,0.0005432125,0.0054171244],"genre_scores_gemma":[0.9846606,0.000013271922,0.01517918,0.0000329136,0.000015159979,0.00001908493,0.000008156314,0.0000312918,0.000040305975],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992406,0.00008288734,0.00025740208,0.00010658898,0.00016525897,0.00014727763],"domain_scores_gemma":[0.99899477,0.000043768345,0.000095767755,0.00066372234,0.00014304882,0.000058927097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033541414,0.00012724564,0.0001818397,0.00007174791,0.00006407739,0.000028154396,0.0003547215,0.000056832716,0.000012166436],"category_scores_gemma":[0.000022050232,0.00009110837,0.000029701037,0.00031937112,0.00007457102,0.00018342074,0.00006599242,0.00014104747,0.0000042605247],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000737829,0.00022148751,0.0059247403,0.0005579483,0.00023671158,0.0000013625627,0.023449294,0.15265937,0.77620256,0.038214017,0.001150064,0.0013086472],"study_design_scores_gemma":[0.00023106596,0.000027554122,0.001887692,0.00019410255,0.000019856143,0.000005811993,0.0010618184,0.29754496,0.69751287,0.0010689655,0.00023898538,0.00020631068],"about_ca_topic_score_codex":0.000275438,"about_ca_topic_score_gemma":0.00051074167,"teacher_disagreement_score":0.31657207,"about_ca_system_score_codex":0.00008514526,"about_ca_system_score_gemma":0.00004690611,"threshold_uncertainty_score":0.37152916},"labels":[],"label_agreement":null},{"id":"W1539832159","doi":"10.1109/icc.1999.767980","title":"Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Simon Fraser University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Binary number; Computer science; Algorithm; Markov process; Entropy (arrow of time); Channel (broadcasting); Binary symmetric channel; Markov chain; Joint (building); Maximum a posteriori estimation; Synchronization (alternating current); Mathematics; Channel code; Maximum likelihood; Telecommunications; Statistics; Arithmetic; Engineering","score_opus":0.01957378478137776,"score_gpt":0.2320205774156867,"score_spread":0.21244679263430896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539832159","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.85791004,0.002313495,0.11608357,0.00007382083,0.00024582705,0.00040481493,0.000008150364,0.0016460824,0.021314196],"genre_scores_gemma":[0.98970115,0.00068134174,0.0091638155,0.00005221052,0.000024432014,0.000034014483,0.000006339269,0.00005929107,0.00027742994],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998737,0.00009110206,0.00045150335,0.00017484227,0.00023619842,0.00030938408],"domain_scores_gemma":[0.99899054,0.00015480132,0.00009024042,0.0006000771,0.00007092203,0.000093421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037005544,0.00021452295,0.00033296863,0.0005484828,0.00006633036,0.000036935537,0.00031666236,0.00013526496,0.0003559662],"category_scores_gemma":[0.00011766814,0.00021885475,0.00012310999,0.00063884706,0.00005412639,0.000157469,0.000101312435,0.00021783276,0.000020961414],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010377499,0.0015621855,0.010352476,0.0023404444,0.0013776707,0.00003603176,0.017502287,0.083682515,0.47134435,0.32614732,0.058428913,0.027122049],"study_design_scores_gemma":[0.00073573925,0.00010192889,0.0006754936,0.00016207645,0.00003658401,0.000022400405,0.0006556017,0.27111888,0.706885,0.0033236213,0.015557177,0.0007255043],"about_ca_topic_score_codex":0.000040739687,"about_ca_topic_score_gemma":0.0000036411723,"teacher_disagreement_score":0.32282367,"about_ca_system_score_codex":0.00007831195,"about_ca_system_score_gemma":0.00001244884,"threshold_uncertainty_score":0.8924638},"labels":[],"label_agreement":null},{"id":"W1550331781","doi":"10.1109/iccw.2015.7247224","title":"Tomlinson-Harashima precoding design in MIMO wiretap channels based on the MMSE criterion","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Karush–Kuhn–Tucker conditions; MIMO; Computer science; Transmitter power output; Artificial noise; Transceiver; Control theory (sociology); Mean squared error; Channel (broadcasting); Minimum mean square error; Mathematical optimization; Mathematics; Telecommunications; Wireless; Transmitter; Artificial intelligence; Statistics","score_opus":0.08993168659770792,"score_gpt":0.2755848167198475,"score_spread":0.1856531301221396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550331781","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.30552998,0.00052038074,0.6298283,0.0068164025,0.00055106514,0.0018908523,0.00000824398,0.004065639,0.050789136],"genre_scores_gemma":[0.98745894,0.000043784225,0.011804266,0.0004240452,0.00003099132,0.00014380527,0.0000045099073,0.00003365824,0.000056022775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910176,0.00018047632,0.0002183482,0.0001311405,0.0001718578,0.00019641468],"domain_scores_gemma":[0.99894845,0.00030844472,0.00002371434,0.0006091068,0.000046359546,0.00006389645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563361,0.00014387893,0.00013978967,0.00014551899,0.0000353527,0.000083751926,0.00042043687,0.000085021566,0.00007254882],"category_scores_gemma":[0.000114610324,0.000114453294,0.000033753444,0.00023050026,0.000024490646,0.00018074816,0.00004696302,0.00023347656,0.000050897503],"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.00031470094,0.0008141507,0.0036667287,0.00031215043,0.000094035604,0.000046717643,0.021987084,0.71404886,0.03925327,0.022195762,0.14884612,0.048420403],"study_design_scores_gemma":[0.00022045794,0.000046961104,0.00023684332,0.00009823065,0.0000022885279,0.0000010599997,0.00009987895,0.9261534,0.06930915,0.0007669285,0.002884715,0.00018007158],"about_ca_topic_score_codex":0.00004561873,"about_ca_topic_score_gemma":0.000026395403,"teacher_disagreement_score":0.68192893,"about_ca_system_score_codex":0.00013078858,"about_ca_system_score_gemma":0.000021490943,"threshold_uncertainty_score":0.466727},"labels":[],"label_agreement":null},{"id":"W1560541233","doi":"10.1109/tit.2015.2449852","title":"New Nonasymptotic Channel Coding Theorems for Structured Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Low-density parity-check code; Mathematics; Equipartition theorem; Coding (social sciences); Discrete mathematics; Block code; Combinatorics; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.018765215967356065,"score_gpt":0.24020544214712714,"score_spread":0.22144022617977108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560541233","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.0010397203,0.000034974633,0.99236387,0.00007320566,0.0005555547,0.00044989036,0.00008052355,0.001062163,0.0043401076],"genre_scores_gemma":[0.99024504,0.00004722617,0.009225614,0.00015990323,0.000037257025,0.00013521191,0.000033450568,0.000027016013,0.00008927658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00004300184,0.00033491408,0.00006792748,0.00017388786,0.00018068671],"domain_scores_gemma":[0.9991143,0.00019532802,0.00006188813,0.0003683167,0.00013059028,0.00012961461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041408482,0.00016422453,0.00015425534,0.00026092172,0.000120651246,0.00008173917,0.00027429397,0.0001226789,0.000050897466],"category_scores_gemma":[0.000017538432,0.00016792539,0.00008014592,0.00017783964,0.00003886163,0.00097429176,0.0000013852083,0.00020177456,0.0000679971],"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.00032155262,0.00004409856,9.794787e-7,0.00020259341,0.0001955018,2.0300645e-7,0.019103188,0.5064348,0.0008910409,0.25589746,0.008427268,0.20848131],"study_design_scores_gemma":[0.002935112,0.00026297735,0.000022379209,0.00018396841,0.000093797054,0.00002754271,0.003821068,0.37560874,0.35151187,0.24257421,0.021941863,0.0010164811],"about_ca_topic_score_codex":0.0000059732906,"about_ca_topic_score_gemma":0.000006604735,"teacher_disagreement_score":0.9892053,"about_ca_system_score_codex":0.00013375461,"about_ca_system_score_gemma":0.00004914578,"threshold_uncertainty_score":0.6847799},"labels":[],"label_agreement":null},{"id":"W1560695905","doi":"10.1007/s00220-015-2561-z","title":"Almost One Bit Violation for the Additivity of the Minimum Output Entropy","year":2016,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"German Academic Exchange Service London; Japan Society for the Promotion of Science; Agence Nationale de la Recherche; Ontario Ministry of Research, Innovation and Science; Queen's University; Centre National de la Recherche Scientifique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum relative entropy; Additive function; Quantum; Entropy (arrow of time); Entropy rate; Eigenvalues and eigenvectors; Generalized relative entropy; Dimension (graph theory); Joint quantum entropy","score_opus":0.06100029080580582,"score_gpt":0.29302719172424385,"score_spread":0.23202690091843803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560695905","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.016809367,0.00036713172,0.96846634,0.0065802606,0.00006434749,0.0015769697,0.00016209995,0.00029530935,0.0056781983],"genre_scores_gemma":[0.98094225,0.0003521844,0.018200222,0.000030250481,0.000022860262,0.00038703508,0.000009847342,0.000025560365,0.000029775176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.0001225237,0.0003783915,0.00008003803,0.00013183235,0.000135052],"domain_scores_gemma":[0.99364996,0.0034646315,0.00010481308,0.002656655,0.00010475603,0.000019185863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003794838,0.000107575404,0.00018493929,0.000027513139,0.00012825067,0.000015489357,0.001565625,0.000063212654,0.000016554324],"category_scores_gemma":[0.00036682712,0.00006285633,0.00010080163,0.00025534688,0.00035614078,0.00012438773,0.00039861884,0.0001855495,0.000013768484],"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.0000077039795,0.000589417,0.00021691096,0.0001809717,0.00007783485,1.4086495e-8,0.0012416079,0.00014486801,0.023908691,0.91353136,0.0016869954,0.058413617],"study_design_scores_gemma":[0.00056967675,0.000024152963,0.0033715894,0.0006290616,0.000068270056,9.043029e-7,0.00015797502,0.1906811,0.0365445,0.7592023,0.0084679825,0.00028248545],"about_ca_topic_score_codex":0.0000025784093,"about_ca_topic_score_gemma":0.0000098771,"teacher_disagreement_score":0.9641329,"about_ca_system_score_codex":0.000077043274,"about_ca_system_score_gemma":0.000018194873,"threshold_uncertainty_score":0.29093468},"labels":[],"label_agreement":null},{"id":"W1563366560","doi":"10.1109/cwit.2015.7255149","title":"On bounds for the cognitive multiple access Z-Interference Channel","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Interference (communication); Cognitive radio; Channel (broadcasting); Transmitter; Cognition; Coding (social sciences); Computer network; Encoding (memory); Telecommunications; Wireless; Mathematics; Artificial intelligence; Psychology; Statistics","score_opus":0.10991626742824925,"score_gpt":0.33288419123401697,"score_spread":0.22296792380576771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563366560","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.025934862,0.00024782197,0.93483853,0.00066457584,0.00023506646,0.00076100486,0.00003253851,0.0013593291,0.03592627],"genre_scores_gemma":[0.9987386,0.000042240554,0.00048277088,0.00023188772,0.000027606635,0.0003226485,0.000010132109,0.000018985369,0.00012513617],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962753,0.000013060585,0.00009481656,0.00007612498,0.00007392813,0.000114509654],"domain_scores_gemma":[0.9989121,0.00063771795,0.00001494346,0.0002773688,0.000117517026,0.00004036271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014328171,0.00008171767,0.00007438416,0.00003537231,0.000050590672,0.00008504438,0.00047827885,0.00003979134,0.000015051294],"category_scores_gemma":[0.00018357826,0.00005847641,0.000027933493,0.00007026792,0.000034397304,0.00013654403,0.000088768364,0.0001059526,0.000022169083],"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.0009495736,0.0008244372,0.0015778089,0.0003692353,0.0008691946,0.00000445948,0.026293367,0.02265772,0.002032077,0.23200676,0.54953605,0.1628793],"study_design_scores_gemma":[0.001061248,0.00017375412,0.0005143585,0.00011715386,0.00001991114,0.000002328249,0.0011129755,0.88462347,0.08207366,0.01600761,0.013920812,0.00037270153],"about_ca_topic_score_codex":0.00003873118,"about_ca_topic_score_gemma":0.00012478318,"teacher_disagreement_score":0.9728037,"about_ca_system_score_codex":0.000033295488,"about_ca_system_score_gemma":0.000009945962,"threshold_uncertainty_score":0.23845989},"labels":[],"label_agreement":null},{"id":"W1590807798","doi":"10.48550/arxiv.1505.01133","title":"Outer Bounds on the Admissible Source Region for Broadcast Channels with Correlated Sources","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Lossy compression; Channel (broadcasting); Characterization (materials science); Atomic broadcast; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Broadcasting (networking); Physics; Computer network; Combinatorics; Statistics; Optics","score_opus":0.10166258857406213,"score_gpt":0.19350705717312275,"score_spread":0.09184446859906062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590807798","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.6117048,0.00030824036,0.37693214,0.00043803288,0.00036548558,0.0014133095,0.000036027606,0.0021947175,0.0066072214],"genre_scores_gemma":[0.9965347,0.00020225525,0.00021385416,0.00009210677,0.0000817531,0.000017502549,0.00006224768,0.00009639259,0.0026991584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.00009705996,0.00018574127,0.00047453423,0.00009732124,0.0003183615],"domain_scores_gemma":[0.9977906,0.00019201728,0.00016510363,0.0014750595,0.00022952189,0.0001477394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024022334,0.00038407597,0.00033172764,0.00022187574,0.00018945767,0.00013123642,0.0011767169,0.00040582777,0.000017612214],"category_scores_gemma":[0.000033407377,0.00033274785,0.00014381112,0.0003059281,0.00015324714,0.00012889648,0.00042819255,0.0008593026,0.000028138396],"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.00028004553,0.00007599898,0.00029756245,0.00015605478,0.00026940243,0.00003359799,0.0017128786,0.96985656,0.000016173843,0.011997535,0.0148481615,0.00045600848],"study_design_scores_gemma":[0.00093236414,0.00028251662,0.0000312025,0.00072321086,0.00018613836,0.000013747397,0.0007067189,0.9135699,0.0011754883,0.010632142,0.070788145,0.00095841486],"about_ca_topic_score_codex":0.00005547859,"about_ca_topic_score_gemma":0.000022584021,"teacher_disagreement_score":0.3848299,"about_ca_system_score_codex":0.0002704224,"about_ca_system_score_gemma":0.000085578744,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W1593863998","doi":"10.1109/spawc.2015.7227108","title":"Analog coding for Gaussian source and state interference estimation","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Computer science; Algorithm; Transmitter; Gaussian; Encoder; Parametric statistics; Decoding methods; Linear network coding; Channel (broadcasting); Mathematics; Mathematical optimization; Telecommunications; Statistics","score_opus":0.03693072357514652,"score_gpt":0.2765804727347046,"score_spread":0.23964974915955808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593863998","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.03702596,0.00007137114,0.9585334,0.00012092428,0.000018757779,0.00011343295,0.0000025243162,0.00057577016,0.00353785],"genre_scores_gemma":[0.93934333,0.00003242299,0.060472295,0.000022556202,0.000004670618,0.000025004227,0.000007797903,0.00001055842,0.000081333776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972725,0.0000086299615,0.00009770557,0.000055384233,0.000036918605,0.00007413091],"domain_scores_gemma":[0.9997176,0.0000414092,0.0000136394965,0.00014649614,0.00003293237,0.000047937283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012671825,0.000053249205,0.00006477869,0.00004821913,0.000019684276,0.000038855487,0.00008941435,0.000023193925,0.0000035248434],"category_scores_gemma":[0.00003254496,0.000052858395,0.0000081751405,0.000044305867,0.000017298067,0.00012851962,0.000033401313,0.000048863047,0.0000032425005],"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.00005458567,0.00006477255,0.0026246062,0.0005163846,0.00010456559,0.0000012646562,0.019727936,0.045887236,0.012107014,0.08388951,0.034449942,0.80057216],"study_design_scores_gemma":[0.00013123312,0.000025781506,0.00015726354,0.000026065805,0.0000028074599,0.0000021145443,0.00012774172,0.98027486,0.010892212,0.005229794,0.0030346608,0.00009544643],"about_ca_topic_score_codex":0.000017196437,"about_ca_topic_score_gemma":0.000031880223,"teacher_disagreement_score":0.9343876,"about_ca_system_score_codex":0.000027212907,"about_ca_system_score_gemma":0.000004952297,"threshold_uncertainty_score":0.21555029},"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":"W1598656139","doi":"10.1109/wcl.2013.120513.130680","title":"Low-Latency Source-Channel Coding for Fading Channels with Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Encoder; Algorithm; Decoding methods; Transmitter; Minimum mean square error; Channel (broadcasting); Telecommunications; Mathematics; Estimator; Statistics","score_opus":0.022552857780099366,"score_gpt":0.24041365268906686,"score_spread":0.2178607949089675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598656139","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.19422933,0.00011336965,0.80039454,0.001884147,0.00025147293,0.000644628,0.000015436253,0.0017689528,0.000698095],"genre_scores_gemma":[0.98791754,0.0003789281,0.010146276,0.0005241567,0.000065013235,0.00068571157,0.00010127008,0.00014435533,0.000036719182],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982802,0.00017617142,0.00055301446,0.0003061372,0.00018959126,0.00049486035],"domain_scores_gemma":[0.9959481,0.00073071395,0.0001752091,0.0028369152,0.0001823291,0.00012674138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042695607,0.00037316006,0.0004165868,0.0003225863,0.00048166933,0.00015349458,0.0023543742,0.00016911968,0.000006844581],"category_scores_gemma":[0.00004153008,0.0003958368,0.000111096466,0.0004587149,0.00030961033,0.00037014863,0.00022078284,0.0006577448,0.00003066966],"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.00018071868,0.0006795422,0.0007623655,0.0011630083,0.0009207689,0.0000038322523,0.024961734,0.35138768,0.50243926,0.023589073,0.017292961,0.07661908],"study_design_scores_gemma":[0.00073601125,0.000079197394,0.00005377247,0.00077731756,0.000049709404,0.000017825723,0.00022534317,0.95041,0.0420865,0.00025560244,0.00456013,0.000748557],"about_ca_topic_score_codex":0.00004095806,"about_ca_topic_score_gemma":0.000051931587,"teacher_disagreement_score":0.79368824,"about_ca_system_score_codex":0.000169414,"about_ca_system_score_gemma":0.000017715132,"threshold_uncertainty_score":0.9998494},"labels":[],"label_agreement":null},{"id":"W161063530","doi":"10.1007/978-1-4939-0413-6_2","title":"Cooperative Cognitive Radio Networking","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Software deployment; Cognitive radio; Computer science; Cognition; Business; Knowledge management; Computer security; Telecommunications; Psychology; Neuroscience; Software engineering","score_opus":0.019843058071556886,"score_gpt":0.23729396030867803,"score_spread":0.21745090223712113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161063530","genre_codex":"other","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.00095715316,0.002202586,0.31773612,0.00006539448,0.0014348397,0.0010025118,0.000009740889,0.0014763151,0.67511535],"genre_scores_gemma":[0.9213578,0.0034996432,0.064602226,0.0004982595,0.0011376374,0.00016122272,0.000024236533,0.00028622992,0.008432708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800277,0.000019933646,0.0004665485,0.0005775546,0.0004606204,0.00047259216],"domain_scores_gemma":[0.9985402,0.00018189083,0.000105014224,0.0008007315,0.00024039691,0.0001317464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489438,0.00041682547,0.0004483522,0.00048260987,0.00014809765,0.00029827992,0.0013914669,0.00023035555,0.00015131674],"category_scores_gemma":[0.000013448427,0.00047577848,0.00007123417,0.00027348648,0.00077111577,0.00047770631,0.0007281911,0.00095145113,0.0002023956],"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.0000075273847,0.00004575444,0.000104475126,0.00018987451,0.000110908826,0.00009216854,0.0027633947,0.015762,0.000332581,0.32569566,0.0023820857,0.65251356],"study_design_scores_gemma":[0.0006506901,0.00015413521,0.0007735975,0.004893759,0.00003159519,0.00006191705,0.000011866523,0.8189501,0.0040350514,0.014022204,0.15346374,0.0029513403],"about_ca_topic_score_codex":0.000018303814,"about_ca_topic_score_gemma":0.000025284,"teacher_disagreement_score":0.9204007,"about_ca_system_score_codex":0.00037367234,"about_ca_system_score_gemma":0.0001189188,"threshold_uncertainty_score":0.9997694},"labels":[],"label_agreement":null},{"id":"W1615560023","doi":"10.1109/lwc.2015.2446986","title":"Binary Signaling of Correlated Sources Over Orthogonal Multiple-Access Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Additive white Gaussian noise; Binary number; Channel (broadcasting); Upper and lower bounds; Joint (building); Algorithm; Mathematics; Gaussian; Signal-to-noise ratio (imaging); Energy (signal processing); Mathematical optimization; Computer science; Gaussian noise; Topology (electrical circuits); Statistics; Telecommunications; Combinatorics; Physics; Mathematical analysis; Engineering","score_opus":0.055449853240941815,"score_gpt":0.28771752545609625,"score_spread":0.23226767221515443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1615560023","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.9816071,0.0010200368,0.014025832,0.001017708,0.00031560054,0.00037727505,0.000040922892,0.0011072241,0.0004882939],"genre_scores_gemma":[0.9942095,0.0004348066,0.0045842566,0.00031470717,0.000048658247,0.00016774597,0.00013654772,0.00009349875,0.000010274956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980398,0.0002839478,0.0007380381,0.00022003539,0.0003786574,0.00033954778],"domain_scores_gemma":[0.99607015,0.0005121941,0.00023971596,0.0027815322,0.00022812579,0.00016829715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046350528,0.00030430878,0.0004216624,0.00039908738,0.00017454315,0.000100087236,0.0031862755,0.00017868952,0.000018456596],"category_scores_gemma":[0.000050612194,0.00035164203,0.00013466207,0.0006526052,0.00043437915,0.0005943102,0.0005488735,0.0006331784,0.000022359209],"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.00007930262,0.00054781244,0.023849953,0.00023609065,0.00046587762,0.000010115778,0.007866304,0.31326059,0.6288823,0.0026270137,0.01729844,0.0048762113],"study_design_scores_gemma":[0.0017565605,0.00006991382,0.0027769995,0.00060309545,0.00009449654,0.000024224853,0.00054413744,0.81702185,0.164802,0.0003497128,0.010697129,0.0012598705],"about_ca_topic_score_codex":0.00017655526,"about_ca_topic_score_gemma":0.000041514126,"teacher_disagreement_score":0.5037613,"about_ca_system_score_codex":0.00014825445,"about_ca_system_score_gemma":0.00005269074,"threshold_uncertainty_score":0.99989355},"labels":[],"label_agreement":null},{"id":"W1620343632","doi":"10.1109/isit.2015.7282685","title":"Delay-constrained streaming of Gauss-Markov sources over erasure channels","year":2015,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Erasure; Binary erasure channel; Computer science; Algorithm; Decoding methods; Encoder; Markov process; Channel (broadcasting); Markov chain; Transmission (telecommunications); Network packet; Upper and lower bounds; Distortion (music); Burst error; Topology (electrical circuits); Mathematics; Telecommunications; Channel capacity; Bandwidth (computing); Computer network; Combinatorics","score_opus":0.021481870272691533,"score_gpt":0.24820515279120856,"score_spread":0.22672328251851703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620343632","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.93680114,0.0006670358,0.019424746,0.00009417314,0.000109462926,0.00017747388,0.000012907996,0.0012290556,0.041484013],"genre_scores_gemma":[0.9903347,0.000047142872,0.009396061,0.000025470434,0.000033178225,0.000013974836,0.000009735179,0.000026781616,0.0001129891],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929297,0.000028756802,0.0002485745,0.00009326933,0.00017791594,0.00015853248],"domain_scores_gemma":[0.9992945,0.00006459815,0.000041135638,0.0004221896,0.00009145754,0.00008609293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002194318,0.00012537075,0.00018601598,0.000104559964,0.000018829205,0.000022442227,0.00028273568,0.00009660941,0.000108038956],"category_scores_gemma":[0.00003792515,0.00012303553,0.000046216548,0.00015201428,0.000058041336,0.00015709586,0.00006828729,0.00013448087,0.000008410129],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001881034,0.0011822293,0.057933938,0.001691687,0.0019968094,0.00006782562,0.071563,0.0646243,0.25671563,0.12616524,0.1431926,0.27467865],"study_design_scores_gemma":[0.002658446,0.00028323854,0.0036002654,0.00048016556,0.00008816191,0.00006137341,0.00465345,0.32578835,0.6071464,0.009065903,0.044278905,0.0018953412],"about_ca_topic_score_codex":0.00008781255,"about_ca_topic_score_gemma":0.000031667714,"teacher_disagreement_score":0.35043076,"about_ca_system_score_codex":0.000035837547,"about_ca_system_score_gemma":0.000020245485,"threshold_uncertainty_score":0.50172436},"labels":[],"label_agreement":null},{"id":"W1620650588","doi":"10.48550/arxiv.1403.5598","title":"Adversarial Wiretap Channel with Public Discussion","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Secrecy; Computer science; Code word; Channel (broadcasting); Computer network; Adversarial system; Transmission (telecommunications); Adversary; Protocol (science); Exploit; Upper and lower bounds; Secure channel; Computer security; Information-theoretic security; Decoding methods; Telecommunications; Mathematics; Encryption","score_opus":0.05059045959293241,"score_gpt":0.1711587321008779,"score_spread":0.1205682725079455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620650588","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.2890286,0.0001243333,0.6879291,0.000567635,0.00072283007,0.0008616393,0.000059170114,0.004646163,0.016060522],"genre_scores_gemma":[0.9984669,0.00028816407,0.0005305938,0.000029085239,0.000113659924,0.0000048865013,0.000118688906,0.000081663056,0.00036633195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867284,0.00012394092,0.00019673666,0.0005472072,0.00010790607,0.00035135413],"domain_scores_gemma":[0.99786454,0.000049011283,0.00013265978,0.0016426214,0.00012421215,0.00018696034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019003583,0.0003979439,0.0004016316,0.0003142586,0.00012298724,0.00008749886,0.0012611549,0.00045507765,0.00005500078],"category_scores_gemma":[0.000017613998,0.00034611885,0.00014689223,0.00033970113,0.00015182668,0.00028389756,0.0009237793,0.0009491902,0.000058948488],"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.0001163477,0.00017253631,0.0013886384,0.00058080786,0.00048790287,0.000102245685,0.0010824484,0.9327595,0.00012628119,0.057560295,0.0039081154,0.0017148844],"study_design_scores_gemma":[0.00078919716,0.00006722168,0.0005254922,0.00035369807,0.00012848989,0.000005244203,0.00016211442,0.9746545,0.0004552699,0.012080127,0.009706608,0.0010720665],"about_ca_topic_score_codex":0.000053861833,"about_ca_topic_score_gemma":0.000119044365,"teacher_disagreement_score":0.7094383,"about_ca_system_score_codex":0.00027737755,"about_ca_system_score_gemma":0.000070156035,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null},{"id":"W1626906177","doi":"10.1109/tcomm.2015.2493063","title":"Degraded Gaussian Diamond–Wiretap Channel","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Qatar National Research Fund","keywords":"Randomness; Relay; Channel (broadcasting); Gaussian; Secrecy; Upper and lower bounds; Computer science; Topology (electrical circuits); Relay channel; Channel code; Encoder; Coding (social sciences); Constraint (computer-aided design); Computer network; Decoding methods; Algorithm; Mathematics; Combinatorics; Statistics; Physics; Computer security","score_opus":0.07075431771036544,"score_gpt":0.28243073572356403,"score_spread":0.2116764180131986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626906177","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.0045288834,0.0017910099,0.9340579,0.0045660227,0.0005880034,0.00073961366,0.00012773328,0.005199724,0.048401143],"genre_scores_gemma":[0.9866385,0.001682425,0.010688802,0.00012722136,0.000019104995,0.00046359995,0.000030961844,0.00007515292,0.00027423073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877346,0.00016724512,0.0003791295,0.00017064606,0.00023787288,0.00027165227],"domain_scores_gemma":[0.9958606,0.0001891489,0.00004951282,0.003526764,0.00013099432,0.00024301717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024284574,0.00023647738,0.00022621625,0.00029727566,0.0003123537,0.00006851266,0.0016173432,0.00016308266,0.000034880657],"category_scores_gemma":[0.000009695505,0.0002689266,0.00012162657,0.0005765176,0.00019827914,0.0003032441,0.000011221877,0.00072013156,0.0002779731],"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.00022753069,0.009059298,0.0002066284,0.00041753743,0.002329735,0.000023795079,0.074549206,0.35110974,0.02279048,0.0530047,0.12385664,0.36242473],"study_design_scores_gemma":[0.0026872328,0.0003683215,0.0005597018,0.00036780737,0.00027015925,0.00008725168,0.0028414647,0.65792257,0.15601467,0.013886495,0.16238284,0.002611477],"about_ca_topic_score_codex":0.00008175628,"about_ca_topic_score_gemma":0.0003629702,"teacher_disagreement_score":0.9821096,"about_ca_system_score_codex":0.0002134006,"about_ca_system_score_gemma":0.000053389398,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W1640956619","doi":"10.1109/isit.2015.7282635","title":"Gaussian wiretap channel with shared keys between transmitter and helpers","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Transmitter; Computer science; Converse; Shared secret; Key generation; Key (lock); Artificial noise; Channel (broadcasting); Transmission (telecommunications); Topology (electrical circuits); Secure communication; Telecommunications; Gaussian; Computer network; Mathematics; Encryption; Computer security; Combinatorics; Physics","score_opus":0.030203350597994078,"score_gpt":0.22695896104856478,"score_spread":0.1967556104505707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640956619","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.71870387,0.001187001,0.1579989,0.0063948785,0.00006601836,0.0008115232,0.00004302737,0.0053769383,0.10941782],"genre_scores_gemma":[0.9930113,0.000041998952,0.0066183833,0.0001128868,0.00002664619,0.000028439497,0.000017389613,0.000033469347,0.00010946849],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994912,0.000018241226,0.00011588989,0.000108033804,0.00011696177,0.00014964446],"domain_scores_gemma":[0.9994986,0.00001908879,0.000011168405,0.00030634683,0.000029476856,0.00013528448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009386289,0.000121124605,0.0001454444,0.000066685,0.000024495595,0.00004240635,0.00017350663,0.00009751741,0.000029340967],"category_scores_gemma":[0.0000025815632,0.00010092165,0.00001561303,0.00010071262,0.000046693764,0.0001950412,0.00002526974,0.00018577559,0.00001446921],"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.00032273761,0.000521174,0.21102971,0.0022510586,0.0028643124,0.00013456086,0.2977084,0.0040993155,0.013380316,0.022847675,0.25390306,0.19093768],"study_design_scores_gemma":[0.0140167335,0.0020564443,0.23759681,0.0015114562,0.0005288265,0.00020930864,0.013599863,0.20537362,0.27305186,0.0136018265,0.22953449,0.008918772],"about_ca_topic_score_codex":0.00005088292,"about_ca_topic_score_gemma":0.000049982325,"teacher_disagreement_score":0.28410855,"about_ca_system_score_codex":0.000025705322,"about_ca_system_score_gemma":0.0000082602955,"threshold_uncertainty_score":0.41154656},"labels":[],"label_agreement":null},{"id":"W1646216325","doi":"10.1109/isit.2015.7282893","title":"Outage analysis for two-user parallel Gaussian interference channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Gaussian; Fading; Topology (electrical circuits); Gaussian noise; Decoding methods; Random variable; Noise (video); Signal-to-interference-plus-noise ratio; Co-channel interference; Computer science; Statistics; Mathematics; Physics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.0517953142624088,"score_gpt":0.30176255328451024,"score_spread":0.24996723902210144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646216325","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.010144173,0.000112511705,0.97199464,0.00030011474,0.00007446331,0.00021340967,0.000008785861,0.0011422057,0.016009679],"genre_scores_gemma":[0.9573624,0.000018180888,0.041617036,0.00007333092,0.00002967585,0.00013874297,0.000030538795,0.000021134316,0.0007089246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941236,0.000019852198,0.00019439265,0.00011956854,0.000085999054,0.00016783661],"domain_scores_gemma":[0.999199,0.00004295081,0.0000233888,0.0005568654,0.00007662341,0.00010121461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019143778,0.00011423204,0.00019841408,0.0001844604,0.000021869744,0.000054766642,0.0003996463,0.000055166412,0.00006481527],"category_scores_gemma":[0.000025060237,0.00010775423,0.00009218889,0.00029941983,0.000020246125,0.00014758653,0.00007257372,0.00009227097,0.000033334185],"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.0001463602,0.00045580004,0.01620883,0.00030155512,0.004753096,0.00000978972,0.021297414,0.41503248,0.0057403278,0.38594726,0.12790027,0.022206796],"study_design_scores_gemma":[0.0008830329,0.00008757202,0.0004962435,0.000027947997,0.00019842775,0.000001976016,0.00071144395,0.9207954,0.01849262,0.0061905337,0.051436257,0.000678589],"about_ca_topic_score_codex":0.000054203538,"about_ca_topic_score_gemma":0.0002012669,"teacher_disagreement_score":0.94721824,"about_ca_system_score_codex":0.000048325055,"about_ca_system_score_gemma":0.000008347542,"threshold_uncertainty_score":0.439409},"labels":[],"label_agreement":null},{"id":"W1647263699","doi":"10.1109/isit.2015.7282682","title":"Optimality of Walrand-Varaiya type policies and approximation results for zero delay coding of Markov sources","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Markov chain; Quantization (signal processing); Markov process; Mathematics; Coding (social sciences); Finite state; Mathematical optimization; Markov decision process; Zero (linguistics); Optimal control; Applied mathematics; Computer science; Algorithm; Statistics","score_opus":0.04641831960546004,"score_gpt":0.2883114087872172,"score_spread":0.24189308918175717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1647263699","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.8386417,0.0004539153,0.14085333,0.00013415064,0.000033582848,0.00037140676,0.00004921348,0.0003173123,0.01914538],"genre_scores_gemma":[0.92242545,0.00009430684,0.07739974,0.0000089387195,0.0000062920353,0.000010241461,0.000017272012,0.000009488248,0.000028272305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994679,0.000022734153,0.00028201792,0.00006360603,0.000086487606,0.000077224606],"domain_scores_gemma":[0.9993539,0.00012640067,0.00007066656,0.00024405328,0.00017295456,0.000032026466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044107158,0.00006726768,0.00015979222,0.00006970071,0.00001619982,0.000010231041,0.00012244067,0.000057911653,0.0000013473624],"category_scores_gemma":[0.0001407455,0.000063806285,0.000020942307,0.00009922954,0.000053392818,0.00010425096,0.000047507285,0.000042287003,2.3816247e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028319685,0.00067124,0.0090085855,0.0073341965,0.00079512503,9.635427e-7,0.1069732,0.030974291,0.25966147,0.4563122,0.07695618,0.048480555],"study_design_scores_gemma":[0.0023044026,0.00029935077,0.0023229243,0.00021501974,0.00004926191,0.000006864773,0.0012976592,0.378456,0.5968519,0.010804656,0.006956013,0.00043593068],"about_ca_topic_score_codex":0.00010627463,"about_ca_topic_score_gemma":0.000013476948,"teacher_disagreement_score":0.44550756,"about_ca_system_score_codex":0.000016519916,"about_ca_system_score_gemma":0.000009715221,"threshold_uncertainty_score":0.26019448},"labels":[],"label_agreement":null},{"id":"W1648163154","doi":"10.1109/isit.2015.7282873","title":"Information recovery from pairwise measurements: A shannon-theoretic approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Pairwise comparison; Computer science; Set (abstract data type); Channel (broadcasting); Alphabet; Graph; Algorithm; Information retrieval; Combinatorics; Artificial intelligence; Theoretical computer science; Mathematics; Philosophy; Computer network","score_opus":0.0439213234993211,"score_gpt":0.2312732585330841,"score_spread":0.187351935033763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648163154","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.030887283,0.000361899,0.55471015,0.00010940494,0.0001504382,0.0003539311,0.000020018724,0.0028610942,0.4105458],"genre_scores_gemma":[0.9515664,0.00005919397,0.047931105,0.00013918628,0.000024176863,0.00007675696,0.00016374102,0.00001715548,0.00002226032],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931175,0.00004187305,0.00023621839,0.00005389977,0.00023655119,0.00011973757],"domain_scores_gemma":[0.999268,0.000023626442,0.000029927085,0.0004880317,0.000110312365,0.00008010504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283525,0.00010629683,0.00011056134,0.00009251068,0.000019829027,0.000069664144,0.00028496725,0.000081819875,0.00005742515],"category_scores_gemma":[0.00006191936,0.000105299136,0.000030930136,0.0001359739,0.000022577604,0.0008217713,0.000059724935,0.0001183676,0.00015113644],"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.00019229595,0.00057196274,0.0033317627,0.00048372295,0.0007206539,0.0000015984278,0.040653303,0.045096133,0.0039990023,0.06528339,0.621563,0.21810317],"study_design_scores_gemma":[0.0031915277,0.00021808935,0.0011244618,0.00022157686,0.00009955203,0.000012093073,0.0074009676,0.64403,0.06799409,0.09463129,0.17885485,0.0022215047],"about_ca_topic_score_codex":0.00007340489,"about_ca_topic_score_gemma":0.0000050799204,"teacher_disagreement_score":0.92067915,"about_ca_system_score_codex":0.00013188977,"about_ca_system_score_gemma":0.00001861,"threshold_uncertainty_score":0.4293974},"labels":[],"label_agreement":null},{"id":"W1656253992","doi":"10.26421/qic7.3-5","title":"Optimal fingerprinting strategies with one-sided error","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fingerprint (computing); Computer science; Set (abstract data type); Message passing; Probability of error; Quantum; Algorithm; Theoretical computer science; Mathematics; Distributed computing; Computer security","score_opus":0.017422861342929044,"score_gpt":0.26120874756328366,"score_spread":0.24378588622035463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656253992","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.4587525,0.000021054651,0.53786695,0.00003327903,0.000017748414,0.00008004249,6.7522313e-7,0.00043396486,0.0027937319],"genre_scores_gemma":[0.9657029,0.000021635455,0.03415286,0.000049448325,0.000010280948,0.0000072266434,0.000046929723,0.000007666101,0.0000010445515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.0000093631825,0.0002890031,0.000044739478,0.00013112451,0.00011894672],"domain_scores_gemma":[0.9996423,0.00006509692,0.000074237534,0.00009320577,0.0000889303,0.00003622051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458358,0.0000869689,0.00008394667,0.00014943967,0.0000829785,0.00015977703,0.00006710468,0.000048573907,0.0000050382223],"category_scores_gemma":[0.0000106816415,0.00008916952,0.000011723561,0.00014525403,0.000029142575,0.0013370203,0.0000196421,0.00011748264,0.0000123843865],"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.000101284095,0.00005411972,0.0006226504,0.00047209702,0.00008232106,0.0000019928605,0.023399627,0.48959842,0.0021578749,0.179431,0.00035099767,0.3037276],"study_design_scores_gemma":[0.00030387685,0.00005904335,0.011206398,0.000079949976,0.0000064769133,0.000011682986,0.0037670007,0.9789284,0.003291966,0.0010557139,0.0010824954,0.00020701544],"about_ca_topic_score_codex":0.000014368293,"about_ca_topic_score_gemma":0.000011862199,"teacher_disagreement_score":0.5069504,"about_ca_system_score_codex":0.000027549955,"about_ca_system_score_gemma":0.00001450849,"threshold_uncertainty_score":0.36362275},"labels":[],"label_agreement":null},{"id":"W1664807605","doi":"10.1109/ictc.2011.6082540","title":"Achievable rates for transmission of discrete constellations over the Gaussian MAC channel","year":2011,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Transmission (telecommunications); Gaussian; Channel (broadcasting); Computer science; Modulation (music); Topology (electrical circuits); Pentagon; Pulse-amplitude modulation; Computer network; Algorithm; Electronic engineering; Pulse (music); Telecommunications; Mathematics; Physics; Engineering; Geometry; Acoustics; Combinatorics","score_opus":0.03208944247210619,"score_gpt":0.2779952823782137,"score_spread":0.2459058399061075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664807605","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.016359754,0.000974552,0.82808906,0.00045173528,0.000065453365,0.00093865773,0.000042465337,0.000732024,0.1523463],"genre_scores_gemma":[0.98546785,0.000249629,0.014038733,0.000023390472,0.000007573348,0.00004458038,0.000009614005,0.000018016459,0.00014061475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960285,0.000017909524,0.0001692512,0.000057957663,0.00005352978,0.000098505465],"domain_scores_gemma":[0.9995121,0.00008818013,0.000025320323,0.0003208132,0.000027437916,0.000026170395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109957226,0.00007408099,0.00009461701,0.000040613977,0.000061974424,0.0000059535764,0.00021626825,0.00004855142,0.00024614617],"category_scores_gemma":[0.000004853737,0.000050282753,0.000052968517,0.000083546685,0.000054293407,0.00008563767,0.000018806408,0.00006757446,0.0000023518785],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019106119,0.00038914755,0.0026089137,0.0011230557,0.0005766717,9.1770386e-7,0.037121728,0.0040585487,0.12631261,0.73200923,0.05088178,0.044726312],"study_design_scores_gemma":[0.0005022579,0.00008239741,0.0034567507,0.000116374424,0.000047279173,0.0000025424,0.00066025223,0.26285347,0.6713214,0.02067088,0.039941624,0.0003447954],"about_ca_topic_score_codex":0.00004094692,"about_ca_topic_score_gemma":0.000014034959,"teacher_disagreement_score":0.9691081,"about_ca_system_score_codex":0.000007621541,"about_ca_system_score_gemma":0.000006389665,"threshold_uncertainty_score":0.2695128},"labels":[],"label_agreement":null},{"id":"W1668573605","doi":"10.1109/isit.2015.7282508","title":"A General Formula for Compound Channel Capacity","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Converse; Lemma (botany); Channel (broadcasting); Channel capacity; Mathematics; Topology (electrical circuits); Information theory; Constructive; Transmitter; Expression (computer science); Discrete mathematics; Applied mathematics; Computer science; Combinatorics; Telecommunications; Statistics","score_opus":0.08367214012298492,"score_gpt":0.2938025597264197,"score_spread":0.21013041960343481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668573605","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.13328432,0.00085732096,0.8011157,0.00041773156,0.0009788765,0.0023577912,0.0004590636,0.006474157,0.054055054],"genre_scores_gemma":[0.8759847,0.00015309207,0.12205147,0.00008307686,0.0002216849,0.0007845476,0.00033802513,0.00008956205,0.00029381277],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991025,0.000022223263,0.00029712866,0.00020066065,0.0001423282,0.00023516512],"domain_scores_gemma":[0.99859077,0.00004492676,0.000053364038,0.0010034455,0.00020976533,0.00009775257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028357696,0.00026248573,0.00035311133,0.00011285229,0.00004011138,0.0000779114,0.0006894305,0.0003764441,0.000014727947],"category_scores_gemma":[0.000021704669,0.0002810506,0.00013462723,0.00004585843,0.000035774807,0.00007350599,0.0005057378,0.00048163743,0.000010873163],"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.000039818686,0.00027097503,0.000050056828,0.0035443916,0.00072190294,0.00000328648,0.0061748005,0.12640214,0.003413971,0.115297705,0.7376756,0.006405325],"study_design_scores_gemma":[0.00028481017,0.000020444953,0.000020321952,0.00008314277,0.00002403041,0.0000051838465,0.00002633847,0.8152649,0.009599272,0.10474898,0.069317505,0.00060507294],"about_ca_topic_score_codex":0.00014599646,"about_ca_topic_score_gemma":0.00016532658,"teacher_disagreement_score":0.7427004,"about_ca_system_score_codex":0.00022400876,"about_ca_system_score_gemma":0.000037604663,"threshold_uncertainty_score":0.9999642},"labels":[],"label_agreement":null},{"id":"W1681985504","doi":"10.48550/arxiv.1003.0729","title":"On the Secure Degrees-of-Freedom of the Multiple-Access-Channel","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"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":"MIMO; Gaussian; Topology (electrical circuits); Channel (broadcasting); Secure coding; Coding (social sciences); Computer science; Secrecy; Degrees of freedom (physics and chemistry); Channel capacity; Mathematics; Algorithm; Computer network; Statistics; Physics; Combinatorics","score_opus":0.08066998086983693,"score_gpt":0.20103729324682457,"score_spread":0.12036731237698764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681985504","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.9736372,0.000086972505,0.019306583,0.00013515954,0.0005015402,0.0006689535,0.00012035108,0.0003534878,0.005189719],"genre_scores_gemma":[0.99925363,0.00031453444,0.0002639836,0.000015624499,0.000028595683,0.0000036839465,0.000009680596,0.000042097516,0.00006814062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990336,0.00012905081,0.00025408156,0.00028758415,0.000112995,0.00018273527],"domain_scores_gemma":[0.99636745,0.0004682341,0.000277269,0.002666723,0.00017429175,0.000046041263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023408729,0.00027606197,0.00031995226,0.00014987624,0.00009318716,0.000025687828,0.003678555,0.00043247364,0.000048595244],"category_scores_gemma":[0.00013882262,0.00021369082,0.00028027224,0.0003766664,0.0003345735,0.00009655051,0.0019517395,0.0015210175,0.000006082952],"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.000018966575,0.0000568466,0.0008571931,0.00015653245,0.00010702572,0.0000027592298,0.00033523055,0.89920044,0.0006052452,0.09779441,0.0008225319,0.000042823263],"study_design_scores_gemma":[0.00029486124,0.000022499637,0.00412837,0.00044026808,0.00008930355,0.0000012007944,0.00011900823,0.9642745,0.007843453,0.021830436,0.00055899366,0.00039705672],"about_ca_topic_score_codex":0.0003163239,"about_ca_topic_score_gemma":0.0005281885,"teacher_disagreement_score":0.075963974,"about_ca_system_score_codex":0.00007235962,"about_ca_system_score_gemma":0.000052337324,"threshold_uncertainty_score":0.87140584},"labels":[],"label_agreement":null},{"id":"W1795009452","doi":"10.1109/tit.2012.2212874","title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multiterminal Settings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"Counterexample; Markov process; Bounded function; Coding (social sciences); Mathematics; Markov chain; Conjecture; Markov property; Mathematical optimization; Algorithm; Discrete mathematics; Computer science; Markov model; Applied mathematics; Statistics","score_opus":0.016446468139906904,"score_gpt":0.22752188461220624,"score_spread":0.21107541647229933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795009452","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.6614615,0.000028030936,0.33746102,0.000020871157,0.00008488962,0.00013127115,0.0000199188,0.00018398526,0.0006085666],"genre_scores_gemma":[0.99680936,0.0000408641,0.0030164947,0.00006255707,0.000006490687,0.00003831041,0.000006149245,0.000011511077,0.000008237021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992665,0.00006585773,0.00034954405,0.000043543347,0.000119389544,0.00015515722],"domain_scores_gemma":[0.9994128,0.00024979428,0.00007099454,0.00018799397,0.00003110756,0.000047322093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044028155,0.000110277084,0.00012521305,0.0002545228,0.000058132577,0.00002708571,0.00010463032,0.000083449544,0.000043497836],"category_scores_gemma":[0.000013653861,0.0001193154,0.000033163586,0.00012315733,0.000056180234,0.0009908393,0.0000019688239,0.0002119298,0.000010876538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010369243,0.0010686982,0.0006732079,0.0014983625,0.00021083104,0.0000019013912,0.12826754,0.42774796,0.0465596,0.030744627,0.00037298587,0.36181733],"study_design_scores_gemma":[0.0017179188,0.0003138646,0.0039869347,0.0007361666,0.000051763356,0.000028601757,0.003573224,0.17300189,0.81343704,0.00078985037,0.0016060527,0.0007567222],"about_ca_topic_score_codex":0.0000066893,"about_ca_topic_score_gemma":0.0000058492083,"teacher_disagreement_score":0.7668774,"about_ca_system_score_codex":0.000058048943,"about_ca_system_score_gemma":0.0000065778227,"threshold_uncertainty_score":0.4865541},"labels":[],"label_agreement":null},{"id":"W1846289915","doi":"10.48550/arxiv.0909.2777","title":"On the Symmetric Gaussian Interference Channel with Partial Unidirectional Cooperation","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Interference (communication); Upper and lower bounds; Channel (broadcasting); Dimension (graph theory); Encoder; Topology (electrical circuits); Gaussian; Transmission (telecommunications); Channel capacity; Computer science; Set (abstract data type); Mathematics; Telecommunications; Combinatorics; Physics; Mathematical analysis; Statistics","score_opus":0.04206717427437144,"score_gpt":0.25166546477531027,"score_spread":0.2095982905009388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846289915","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.93810236,0.00045387636,0.03951082,0.0023061128,0.0004549955,0.0007520653,0.000024942738,0.0017784584,0.016616393],"genre_scores_gemma":[0.9984692,0.00044626946,0.00033042472,0.0002210053,0.00013653755,0.00021319887,0.000080697726,0.000043699947,0.000058999067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893016,0.00011853388,0.00026862373,0.00027863323,0.00020275975,0.0002013193],"domain_scores_gemma":[0.99865544,0.00014611195,0.00008651315,0.0009448462,0.000112352245,0.000054741333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023627882,0.0002866546,0.00022634218,0.00021542594,0.00013112665,0.00009174402,0.0006279588,0.00022413627,0.000061557825],"category_scores_gemma":[0.00006877415,0.00021465062,0.000057965954,0.0003715486,0.000063989646,0.000084709216,0.00017878231,0.0011156425,0.000071949566],"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.0005549214,0.001707775,0.022376848,0.0009082247,0.001795827,0.00006279431,0.008463422,0.41187286,0.0055381856,0.46615276,0.042999953,0.037566405],"study_design_scores_gemma":[0.0017391199,0.0016998353,0.12932163,0.0059627816,0.00034685616,0.000086421096,0.00041437257,0.5265083,0.28153378,0.019862594,0.026894208,0.0056300983],"about_ca_topic_score_codex":0.000042059935,"about_ca_topic_score_gemma":0.000055775785,"teacher_disagreement_score":0.44629017,"about_ca_system_score_codex":0.00016058778,"about_ca_system_score_gemma":0.00005149552,"threshold_uncertainty_score":0.87531984},"labels":[],"label_agreement":null},{"id":"W1867338500","doi":"10.48550/arxiv.1008.0223","title":"Secure Joint Source-Channel Coding With Side Information","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Joint (building); Channel code; Coding (social sciences); Computer science; Channel (broadcasting); Side channel attack; Computer security; Telecommunications; Computer network; Cryptography; Decoding methods; Engineering; Mathematics; Statistics","score_opus":0.038678103054876484,"score_gpt":0.16100188280984143,"score_spread":0.12232377975496495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867338500","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.39420426,0.000037067624,0.5918584,0.000057188223,0.00020310465,0.00043884528,0.000037323483,0.0021857044,0.010978129],"genre_scores_gemma":[0.99786615,0.0003762087,0.0013894876,0.00004648651,0.000045140532,0.0000044610765,0.00012501095,0.000048601003,0.00009845474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906963,0.000043645,0.00024874308,0.0002707591,0.00009489925,0.00027232664],"domain_scores_gemma":[0.99829954,0.000046745445,0.00018387135,0.0011614034,0.00018221035,0.0001262302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016941623,0.00034094576,0.00031853723,0.00037451947,0.000120460434,0.00010967664,0.0007363332,0.00053930195,0.000034145585],"category_scores_gemma":[0.000021681679,0.00039696778,0.00011359211,0.00027563528,0.0001000989,0.0005736963,0.00064726523,0.0016809367,0.00007062021],"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.000026003503,0.000030154693,0.00017598228,0.00044964819,0.00014871091,0.000023661323,0.0020237097,0.9711964,0.00033908736,0.024033621,0.00085407495,0.0006989329],"study_design_scores_gemma":[0.0004509965,0.000034193316,0.00035981345,0.00040864895,0.00009755206,0.000013253414,0.0005653112,0.97602856,0.004611998,0.007566018,0.008938221,0.0009254089],"about_ca_topic_score_codex":0.00011516615,"about_ca_topic_score_gemma":0.00015249258,"teacher_disagreement_score":0.6036619,"about_ca_system_score_codex":0.00021133579,"about_ca_system_score_gemma":0.00005872449,"threshold_uncertainty_score":0.99984825},"labels":[],"label_agreement":null},{"id":"W1916447172","doi":"10.48550/arxiv.1001.3403","title":"Real Interference Alignment","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Interference alignment; Dirty paper coding; Coding (social sciences); Interference (communication); Computer science; Topology (electrical circuits); Gaussian; Multiplexing; Degenerate energy levels; Data stream mining; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Precoding; Physics; Combinatorics; MIMO","score_opus":0.05730892935754662,"score_gpt":0.19412620294198846,"score_spread":0.13681727358444185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916447172","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.86891776,0.000057120407,0.08750233,0.000039838185,0.0005441596,0.00032403268,0.00004065261,0.0022623253,0.040311772],"genre_scores_gemma":[0.9960568,0.002209347,0.0012688742,0.00001334044,0.000046148114,0.0000031557843,0.00004258003,0.000042943462,0.00031682284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990969,0.000051798725,0.00017998059,0.0003939066,0.00005263177,0.00022480823],"domain_scores_gemma":[0.99815303,0.000049617574,0.0000784008,0.00153519,0.00007294373,0.000110787245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012292429,0.00027220725,0.00025827318,0.00017225521,0.000052164338,0.000047340352,0.0013153148,0.00046714797,0.00011765093],"category_scores_gemma":[0.000008971683,0.00035658528,0.00011971659,0.000149946,0.00010133217,0.000108518914,0.0011544235,0.0012592882,0.0000885528],"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.0000723753,0.0003587389,0.0045253797,0.0009474781,0.0006753784,0.0003166803,0.0026319174,0.38481164,0.016379973,0.57386726,0.009659808,0.0057534077],"study_design_scores_gemma":[0.0005137003,0.00005957404,0.0017312169,0.00048850547,0.00016074067,0.0000071468157,0.00023701895,0.8864789,0.023328092,0.07405623,0.011076459,0.001862432],"about_ca_topic_score_codex":0.00019239301,"about_ca_topic_score_gemma":0.00018301362,"teacher_disagreement_score":0.50166726,"about_ca_system_score_codex":0.00023998,"about_ca_system_score_gemma":0.000040625746,"threshold_uncertainty_score":0.9998886},"labels":[],"label_agreement":null},{"id":"W1916886752","doi":"10.1007/3-540-48285-7_35","title":"Secret-Key Reconciliation by Public Discussion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":790,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Collège Montmorency","funders":"","keywords":"Alice (programming language); Key (lock); Computer science; Channel (broadcasting); Alice and Bob; Computer security; Construct (python library); Protocol (science); Theoretical computer science; Binary number; Algorithm; Computer network; Mathematics; Arithmetic; Programming language","score_opus":0.02534850090791529,"score_gpt":0.25374691767162405,"score_spread":0.22839841676370876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916886752","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.00010716419,0.0007340819,0.9853732,0.00068152783,0.00050641876,0.0002539025,0.000011359,0.0006848321,0.011647508],"genre_scores_gemma":[0.69508,0.000832158,0.30122244,0.0011777483,0.00053032115,0.0000307694,0.00019810567,0.00019206708,0.0007364059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814826,0.000017988734,0.00041400516,0.0004800958,0.0005573336,0.0003823333],"domain_scores_gemma":[0.9984748,0.00017093777,0.000110605266,0.0009877848,0.00013930097,0.00011661877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381297,0.00032998805,0.00029384717,0.00058733963,0.00011677023,0.00020762316,0.0012974152,0.0004154897,0.000060764232],"category_scores_gemma":[0.000058900434,0.0002724825,0.00006429134,0.00033664194,0.00029258127,0.00039570348,0.0003249447,0.00086747983,0.000027289412],"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.0000016031302,0.000010363209,0.000036876307,0.00004565063,0.000007097855,0.000003890558,0.0005526283,0.0040838714,0.00073623116,0.0033516777,0.000498594,0.9906715],"study_design_scores_gemma":[0.00026360547,0.00009328279,0.00008039453,0.0007514355,0.000009543284,0.000025491432,5.932175e-7,0.72164524,0.0151269995,0.07499565,0.18554983,0.0014579209],"about_ca_topic_score_codex":0.0000079485335,"about_ca_topic_score_gemma":0.00012327851,"teacher_disagreement_score":0.9892136,"about_ca_system_score_codex":0.00052130426,"about_ca_system_score_gemma":0.0000894152,"threshold_uncertainty_score":0.99997276},"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":"W1948599384","doi":"10.1109/tit.2015.2503766","title":"A Model for Adversarial Wiretap Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Secrecy; Computer science; Eavesdropping; Code word; Code (set theory); Channel (broadcasting); Reliability (semiconductor); Theoretical computer science; Adversarial system; Algorithm; Computer network; Artificial intelligence; Decoding methods; Power (physics); Computer security","score_opus":0.03398889484881486,"score_gpt":0.25062785606382537,"score_spread":0.21663896121501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948599384","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.0012280447,0.000013496959,0.99273723,0.00006988455,0.0005395771,0.00040075526,0.00008272906,0.0010689447,0.0038593085],"genre_scores_gemma":[0.9914653,0.000025117088,0.0077598854,0.0001911517,0.000025981979,0.0003641177,0.000023174063,0.000019909508,0.00012541741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993441,0.00002676364,0.00028266487,0.00005305597,0.00014921125,0.00014417281],"domain_scores_gemma":[0.9993302,0.0000833992,0.000041640753,0.0003259907,0.00013442725,0.00008429138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039400262,0.00012265715,0.00011398977,0.00021157094,0.00008761765,0.00004926259,0.00020901016,0.000110783694,0.00001875849],"category_scores_gemma":[0.000010704877,0.00013366576,0.0000778053,0.00012127171,0.00003464943,0.001172352,9.79198e-7,0.00016445236,0.00009379282],"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.00009902097,0.000021410917,5.068094e-8,0.000031250464,0.000029314098,2.7829127e-8,0.0070569613,0.9535851,0.00006301639,0.013219247,0.0019960976,0.023898544],"study_design_scores_gemma":[0.00058239745,0.000037577498,2.0476794e-7,0.000015099111,0.000014215685,0.0000018070009,0.00030856888,0.9670967,0.0133520905,0.014500748,0.003936109,0.00015448425],"about_ca_topic_score_codex":0.0000023229807,"about_ca_topic_score_gemma":0.0000026270657,"teacher_disagreement_score":0.9902372,"about_ca_system_score_codex":0.000119881304,"about_ca_system_score_gemma":0.000040043196,"threshold_uncertainty_score":0.54507315},"labels":[],"label_agreement":null},{"id":"W1954438016","doi":"10.1109/isit.2015.7282460","title":"Joint source-channel coding with feedback","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"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":"University of Illinois at Urbana-Champaign; Division of Mathematical Sciences; Moscow Institute of Physics and Technology; Australian National University; Technion-Israel Institute of Technology; University of Tokyo; University of Ottawa; California Institute of Technology; Universitat Politècnica de Catalunya; Massachusetts Institute of Technology; Princeton University; American Society for Engineering Education; Russian Academy of Sciences; University of Cambridge; National Science Foundation","keywords":"Distortion (music); Coding (social sciences); Channel code; Computer science; Constraint (computer-aided design); Limit (mathematics); Channel (broadcasting); Joint (building); Transmission (telecommunications); Variable (mathematics); Control theory (sociology); Algorithm; Decoding methods; Mathematics; Topology (electrical circuits); Telecommunications; Engineering; Statistics; Artificial intelligence; Bandwidth (computing); Mathematical analysis; Combinatorics","score_opus":0.04474122020695393,"score_gpt":0.22611320281218356,"score_spread":0.18137198260522963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954438016","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.09726489,0.00027680228,0.6680628,0.00056379527,0.00007921272,0.00024226187,0.0000017930618,0.005403103,0.22810535],"genre_scores_gemma":[0.98660445,0.000030901647,0.012845158,0.00006712046,0.000022707663,0.000017956403,0.0000033735212,0.000030844574,0.00037747427],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955916,0.0000123341,0.00011077325,0.00007007278,0.00011874315,0.00012893474],"domain_scores_gemma":[0.99947256,0.000014570192,0.000013952737,0.00035340074,0.0000565853,0.00008894144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012379514,0.000088150286,0.00010270668,0.00005649458,0.000022249704,0.00003242052,0.00015897708,0.00004250234,0.00003065656],"category_scores_gemma":[0.000010849478,0.00007538338,0.000016310247,0.00010441994,0.00002507749,0.000108701024,0.000054012533,0.00012130611,0.000086741],"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.0001049571,0.00039192857,0.002616028,0.0005112706,0.000521423,0.000037414393,0.03928231,0.18006511,0.026999649,0.10534779,0.59786326,0.046258878],"study_design_scores_gemma":[0.0017901581,0.0002552278,0.0008307434,0.00028775656,0.00003147719,0.00010724262,0.004811015,0.5404919,0.26323915,0.0047495654,0.18189122,0.001514554],"about_ca_topic_score_codex":0.00003259628,"about_ca_topic_score_gemma":0.000027101298,"teacher_disagreement_score":0.88933957,"about_ca_system_score_codex":0.000054281416,"about_ca_system_score_gemma":0.000009528935,"threshold_uncertainty_score":0.30740452},"labels":[],"label_agreement":null},{"id":"W1960603654","doi":"10.1109/itsc.2015.288","title":"ADS-B Authentication Compliant with Mode-S Extended Squitter Using PSK Modulation","year":2015,"lang":"en","type":"article","venue":"","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Authentication (law); Digital signature; Encryption; Broadcasting (networking); Computer network; Keying; Message authentication code; Cryptography; Physical layer; Digital watermarking; Computer security; Modulation (music); Wireless; Telecommunications","score_opus":0.06060613315023733,"score_gpt":0.2973363353391928,"score_spread":0.23673020218895546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960603654","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.37595206,0.000040318024,0.6169293,0.00012640914,0.000035773242,0.00020018555,0.000002251103,0.0010500619,0.0056636236],"genre_scores_gemma":[0.91634774,0.0000054802567,0.083458744,0.000040138693,0.000020466994,0.000020056968,0.00002441108,0.000030887073,0.000052066553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993594,0.000026189857,0.00017859098,0.00011480375,0.00018564181,0.00013535663],"domain_scores_gemma":[0.99923944,0.000013133313,0.00003277808,0.000520311,0.00012233313,0.000072003175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011184221,0.000112291695,0.00011044446,0.00009089255,0.00003609603,0.00004406644,0.00017751967,0.00005759324,0.00003129749],"category_scores_gemma":[0.000006153053,0.00010176258,0.000018484507,0.00014695636,0.000030500198,0.00028584697,0.00004008746,0.000097988115,0.000025631112],"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.00010411239,0.00040436749,0.0032422345,0.00020957495,0.00021959981,0.0000071845084,0.0105037885,0.69365096,0.17389777,0.07964631,0.007779381,0.030334696],"study_design_scores_gemma":[0.00019404551,0.000016616192,0.0014659163,0.000026218106,0.000009985501,0.000008269162,0.00008266987,0.98592454,0.009230887,0.0023383028,0.0005455486,0.00015702852],"about_ca_topic_score_codex":0.00004503667,"about_ca_topic_score_gemma":0.000018475997,"teacher_disagreement_score":0.5403957,"about_ca_system_score_codex":0.00012547849,"about_ca_system_score_gemma":0.000015689953,"threshold_uncertainty_score":0.41497573},"labels":[],"label_agreement":null},{"id":"W1963802579","doi":"10.1109/cwit.2013.6621623","title":"Security enhancement in cooperative jamming using compromised secrecy region minimization","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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":"Jamming; Secrecy; Computer science; Minification; Wireless; Fading; Path loss; Computer network; Channel (broadcasting); Mathematical optimization; Computer security; Telecommunications; Mathematics","score_opus":0.02183116819114121,"score_gpt":0.24640948205281518,"score_spread":0.22457831386167398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963802579","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.8172588,0.00009318775,0.17452215,0.000109338966,0.00004715143,0.0006416745,5.506216e-7,0.0004555746,0.006871566],"genre_scores_gemma":[0.98783004,0.0001293852,0.011786164,0.00006107318,0.000014413064,0.000104583065,0.000017486816,0.000022025137,0.000034852],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992394,0.00006718432,0.00029160464,0.00013331608,0.0000994189,0.00016912057],"domain_scores_gemma":[0.99947953,0.000042935593,0.000034739423,0.00030514208,0.00009658023,0.000041051273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008262552,0.00012931893,0.00015804716,0.00012572286,0.000046487858,0.000054501845,0.00016683787,0.000081797916,0.00021338086],"category_scores_gemma":[0.000016536487,0.00013886704,0.000021218237,0.0002517172,0.000026210188,0.00037619536,0.000056046094,0.00016054006,0.000024039338],"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.00006459108,0.001133616,0.009526622,0.0008329475,0.00022820654,0.000020059946,0.045774538,0.19458225,0.6490634,0.037133936,0.01441301,0.047226842],"study_design_scores_gemma":[0.00033794928,0.00001915757,0.00033275707,0.00008759696,0.000002851145,0.000002311813,0.00044424165,0.8772829,0.12012306,0.0007045048,0.00043863265,0.00022402794],"about_ca_topic_score_codex":0.00027768605,"about_ca_topic_score_gemma":0.00008519108,"teacher_disagreement_score":0.68270063,"about_ca_system_score_codex":0.00018730536,"about_ca_system_score_gemma":0.00001338074,"threshold_uncertainty_score":0.56628335},"labels":[],"label_agreement":null},{"id":"W1964323598","doi":"10.1109/icecs.2013.6815551","title":"Joint secured and robust technique for OFDM systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Guelph","funders":"","keywords":"Orthogonal frequency-division multiplexing; Joint (building); Fading; Bit error rate; Transmission (telecommunications); Key (lock); Data transmission; Noise (video)","score_opus":0.023151092169835907,"score_gpt":0.21305831645600892,"score_spread":0.18990722428617302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964323598","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.009149561,0.0007935971,0.9698877,0.0002786412,0.00007025903,0.0023367926,0.000008667072,0.0022881334,0.015186689],"genre_scores_gemma":[0.9232463,0.00013131689,0.074337386,0.000027353495,0.000021648315,0.0020057238,0.000007398372,0.000032393793,0.00019042926],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995314,0.0000138355035,0.0001839209,0.00008811564,0.00005330384,0.00012942142],"domain_scores_gemma":[0.9994854,0.000041912448,0.00001951675,0.0003351059,0.000070327034,0.000047768564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012519209,0.000097078984,0.00013845507,0.00006981537,0.000034442513,0.00006782057,0.0001323359,0.00009530986,0.0000384305],"category_scores_gemma":[0.00001329874,0.00009122203,0.000024508621,0.0000581655,0.000022233979,0.00014498516,0.000046083896,0.000090472306,0.000016515089],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003828085,0.00007082677,0.00016590889,0.001488119,0.00011262923,7.64813e-7,0.00079533615,0.0044130255,0.5398417,0.15693493,0.29040697,0.0057659405],"study_design_scores_gemma":[0.00046687963,0.00007106396,0.00053085247,0.00022360861,0.000017784303,0.00004295776,0.00046700344,0.561113,0.3811109,0.005929416,0.04922391,0.0008026273],"about_ca_topic_score_codex":0.00010300975,"about_ca_topic_score_gemma":0.000008210336,"teacher_disagreement_score":0.9140968,"about_ca_system_score_codex":0.000030207844,"about_ca_system_score_gemma":0.0000038475864,"threshold_uncertainty_score":0.37199265},"labels":[],"label_agreement":null},{"id":"W1964624053","doi":"10.1109/jcn.2009.6388407","title":"Build-in wiretap channel I with feedback and LDPC codes","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Low-density parity-check code; Computer science; Channel (broadcasting); Computer network; Randomness; Binary erasure channel; Information-theoretic security; Decoding methods; Theoretical computer science; Binary symmetric channel; Transmission (telecommunications); Parity bit; Computer security; Telecommunications; Algorithm; Channel capacity; Cryptography; Mathematics; Statistics","score_opus":0.00975721931005988,"score_gpt":0.23394871656403124,"score_spread":0.22419149725397136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964624053","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.73900926,0.16560678,0.07414946,0.010338347,0.00007603427,0.0004666271,0.000004853621,0.00028911402,0.010059551],"genre_scores_gemma":[0.93271446,0.055940676,0.011219289,0.00008508521,0.000021083608,0.0000030250603,0.0000017866258,0.00000990927,0.0000046911573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.000060680733,0.00029656597,0.00004437121,0.00007212774,0.00010729674],"domain_scores_gemma":[0.9990887,0.00012897649,0.00010319496,0.0005418112,0.0000759578,0.00006134739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030603074,0.000092771654,0.00020507441,0.00011925784,0.00007538603,0.000049435203,0.0004072847,0.00006744584,0.0000016833519],"category_scores_gemma":[0.000005766686,0.00008004037,0.00002078468,0.00017697146,0.000092111455,0.00020045231,0.00006230388,0.00044605444,1.4843198e-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.00034980034,0.0011122744,0.022319289,0.00015374307,0.00050763664,0.000037336835,0.012739568,0.07991058,0.0024131676,0.05611371,0.008669326,0.8156736],"study_design_scores_gemma":[0.0020140198,0.000793964,0.108739935,0.0014525909,0.00009011515,0.0006121612,0.0008036318,0.8520623,0.0003455041,0.008792167,0.0236187,0.0006749263],"about_ca_topic_score_codex":0.0000053672916,"about_ca_topic_score_gemma":0.00006750265,"teacher_disagreement_score":0.8149986,"about_ca_system_score_codex":0.000022098016,"about_ca_system_score_gemma":0.000009284204,"threshold_uncertainty_score":0.32639518},"labels":[],"label_agreement":null},{"id":"W1965602624","doi":"10.1109/tit.2004.836700","title":"Comments on \"Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Code division multiple access; Maximization; Channel capacity; Gaussian; Mathematics; Algorithm; Upper and lower bounds; Equivalence (formal languages); Channel (broadcasting); Computer science; Discrete mathematics; Topology (electrical circuits); Applied mathematics; Telecommunications; Combinatorics; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.025068937577472403,"score_gpt":0.2389123595092152,"score_spread":0.21384342193174277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965602624","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.011976729,0.000022687062,0.9854391,0.000075417265,0.00026089136,0.00065956695,0.00008658754,0.0003764677,0.0011025062],"genre_scores_gemma":[0.99129957,0.00010135494,0.008148411,0.00015951085,0.000012332634,0.00024056093,0.000011641899,0.000020649864,0.000005954301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991196,0.00006225177,0.0004060081,0.0000780464,0.00016103538,0.00017309835],"domain_scores_gemma":[0.9991519,0.0003097644,0.00009398943,0.00030327548,0.00007215639,0.00006893394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431314,0.00017259177,0.00019041478,0.0005190091,0.00016717512,0.0000446097,0.00018838466,0.00012548988,0.000025723923],"category_scores_gemma":[0.000009300541,0.00018180071,0.0000712698,0.00022818633,0.00007632287,0.00063424715,0.000001411754,0.00022806956,0.000027120941],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003299302,0.0003504115,0.0000010719148,0.00046884178,0.00022870017,2.873013e-7,0.014763978,0.73330593,0.0016888105,0.06339474,0.00025369722,0.18521358],"study_design_scores_gemma":[0.002903217,0.0010000755,0.000053137628,0.00038705944,0.00008337839,0.000009827971,0.0009269557,0.06505155,0.8908643,0.036484852,0.0015342851,0.00070132565],"about_ca_topic_score_codex":0.000007846809,"about_ca_topic_score_gemma":0.0000018933342,"teacher_disagreement_score":0.97932285,"about_ca_system_score_codex":0.00016468427,"about_ca_system_score_gemma":0.000022844019,"threshold_uncertainty_score":0.7413618},"labels":[],"label_agreement":null},{"id":"W1966156506","doi":"10.1109/icuwb.2015.7324413","title":"A Survey on Cooperative Jamming Applied to Physical Layer Security","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":43,"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 à Montréal","funders":"","keywords":"Jamming; Eavesdropping; Physical layer; Computer science; Computer security; Computer network; Wireless; Data link layer; Wireless network; Transmitter; Physical security; Telecommunications; Channel (broadcasting)","score_opus":0.05375704040395283,"score_gpt":0.2991560980498104,"score_spread":0.2453990576458576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966156506","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.86620164,0.000015945083,0.010172391,0.00017204865,0.000060254988,0.00040352874,0.000021823507,0.0016514001,0.12130094],"genre_scores_gemma":[0.9982796,0.000002833591,0.0012658116,0.00024022789,0.000040128565,0.00006548824,0.000021108468,0.000027549928,0.000057308735],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993653,0.00005984732,0.000116600095,0.00013559945,0.00016654524,0.0001560842],"domain_scores_gemma":[0.9991723,0.00012724807,0.00000986925,0.0004463554,0.000099852215,0.00014440976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027865288,0.00012906968,0.00017155391,0.00006109694,0.000028467715,0.000037677215,0.00025492106,0.0000504403,0.00001544884],"category_scores_gemma":[0.00006604149,0.00012235416,0.000019951625,0.00023665227,0.000017325703,0.000059697708,0.00009358768,0.0002005488,0.00033393363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002876241,0.0012262888,0.001703512,0.00007319518,0.0002585479,0.000009693774,0.08646797,0.06116138,0.036058336,0.20753706,0.57257533,0.032641083],"study_design_scores_gemma":[0.0016262141,0.0006139732,0.011203313,0.000085525004,0.000017748536,0.0000023800105,0.0017014947,0.16386093,0.7385633,0.0041412823,0.076123275,0.0020605833],"about_ca_topic_score_codex":0.00010727914,"about_ca_topic_score_gemma":0.0002787643,"teacher_disagreement_score":0.70250493,"about_ca_system_score_codex":0.00008761577,"about_ca_system_score_gemma":0.00001492754,"threshold_uncertainty_score":0.49894577},"labels":[],"label_agreement":null},{"id":"W1967802283","doi":"10.1109/ccece.2008.4564794","title":"Distributed video coding and transmission over wireless fading channel","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Codec; Computer science; Additive white Gaussian noise; Fading; Encoder; Decoding methods; Wireless; Coding (social sciences); Channel (broadcasting); Real-time computing; Computer network; Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.016514026246515982,"score_gpt":0.1970685830845539,"score_spread":0.18055455683803792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967802283","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.64657426,0.00051950396,0.34895924,0.0006695208,0.00012490037,0.000481491,0.00003139273,0.0013570914,0.0012826152],"genre_scores_gemma":[0.9967746,0.0017876462,0.001146226,0.00009827895,0.000069645626,0.00004913251,0.000016932838,0.000045242406,0.0000122771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843377,0.0000083321665,0.00030474938,0.00040884686,0.00019941785,0.00064488995],"domain_scores_gemma":[0.9989435,0.000059930793,0.000039096198,0.00014396028,0.00014848157,0.0006650271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010098867,0.00038500316,0.00038875215,0.00041736654,0.00024590577,0.00021192321,0.00032910952,0.00021864694,0.000018185943],"category_scores_gemma":[0.000014909716,0.00041814818,0.000041970477,0.0004102943,0.00007892094,0.0003183651,0.000053862463,0.0006076653,0.0000029052849],"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.000107249594,0.00020751041,0.008417911,0.0018945249,0.00046851044,0.00026364898,0.015503498,0.0038630618,0.05789456,0.5217552,0.008076371,0.3815479],"study_design_scores_gemma":[0.00026704543,0.000094682066,0.004635466,0.00028641612,0.000010067352,0.000091831214,0.000018240722,0.98967564,0.002134529,0.00034779139,0.0019076121,0.0005306569],"about_ca_topic_score_codex":0.00055823516,"about_ca_topic_score_gemma":0.00011463621,"teacher_disagreement_score":0.9858126,"about_ca_system_score_codex":0.000171945,"about_ca_system_score_gemma":0.000099670324,"threshold_uncertainty_score":0.999827},"labels":[],"label_agreement":null},{"id":"W1968110927","doi":"10.1109/itw.2013.6691223","title":"Secrecy &amp;amp; Rate Adaptation for secure HARQ protocols","year":2013,"lang":"en","type":"article","venue":"","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":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Secrecy; Computer science; Encoder; Hybrid automatic repeat request; Code rate; Coding (social sciences); Information leakage; Decoding methods; Confidentiality; Computer network; Uniqueness; Throughput; Theoretical computer science; Computer security; Algorithm; Mathematics; Telecommunications; Wireless; Telecommunications link; Statistics","score_opus":0.06070456167625498,"score_gpt":0.30665774725435524,"score_spread":0.24595318557810025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968110927","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.011506186,0.000037077625,0.95251405,0.00052169693,0.00004056883,0.022908865,0.00001289734,0.0024196866,0.010038994],"genre_scores_gemma":[0.60554993,0.00002648967,0.2679578,0.00023239497,0.00007606776,0.12354284,0.00016661121,0.00008684437,0.0023610182],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993389,0.000034751105,0.00023806636,0.00011973201,0.00008486557,0.00018365523],"domain_scores_gemma":[0.9990975,0.00009814406,0.000036467896,0.0005471365,0.00016224048,0.000058463676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017241851,0.00013347685,0.00013561081,0.00006940793,0.000056338722,0.00010188447,0.00027653444,0.00010334385,0.00065628206],"category_scores_gemma":[0.00004701738,0.00013082958,0.000052320982,0.00011688601,0.000017657332,0.00036241458,0.00003712899,0.00013008468,0.00049486855],"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.000040747927,0.00023995317,0.0003172214,0.0012525026,0.00018239747,2.9469595e-7,0.008762136,0.00851063,0.16491942,0.16757521,0.55499184,0.09320768],"study_design_scores_gemma":[0.00046742838,0.00002635778,0.0003647221,0.000085091626,0.000007058613,0.0000018298927,0.0001125711,0.09574934,0.028868344,0.029736785,0.844149,0.00043150503],"about_ca_topic_score_codex":0.000062222265,"about_ca_topic_score_gemma":0.00022484074,"teacher_disagreement_score":0.6845562,"about_ca_system_score_codex":0.000046077,"about_ca_system_score_gemma":0.00001358481,"threshold_uncertainty_score":0.71858287},"labels":[],"label_agreement":null},{"id":"W1968591616","doi":"10.1109/vtcspring.2013.6692528","title":"Eavesdropping-Resilient OFDM System Using CSI-Based Dynamic Subcarrier Allocation","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Western University","funders":"","keywords":"Subcarrier; Eavesdropping; Orthogonal frequency-division multiplexing; Computer science; Channel state information; Transmitter; Computer network; Channel (broadcasting); Multipath propagation; Wireless; Electronic engineering; Telecommunications; Engineering","score_opus":0.01021182074834219,"score_gpt":0.22869353688470898,"score_spread":0.2184817161363668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968591616","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.6350576,0.00019304815,0.35551172,0.0001278542,0.00012139581,0.00054104754,0.0000028268503,0.0026878538,0.005756633],"genre_scores_gemma":[0.97923315,0.0000089634295,0.020467492,0.000051242027,0.000013542222,0.00009722584,0.00002049531,0.000047462247,0.000060434806],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990948,0.000049321417,0.00031042038,0.00014849531,0.00018176614,0.00021523448],"domain_scores_gemma":[0.99897236,0.00003932471,0.000045007415,0.00073734304,0.00012825025,0.00007772852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012762572,0.00016035138,0.00016111521,0.00015518039,0.00007223816,0.00008060193,0.0003123489,0.000106666106,0.0001089075],"category_scores_gemma":[0.000010725841,0.00016533535,0.000052764637,0.00021106403,0.000033920933,0.00022855595,0.000045458306,0.00014334577,0.00012739796],"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.000009014926,0.00015085045,0.0022540712,0.0014551502,0.00016245147,0.0000046530686,0.000969348,0.26767018,0.6831196,0.025859753,0.004534377,0.013810559],"study_design_scores_gemma":[0.00010824399,0.000008446997,0.0010166144,0.00009090062,0.000008104333,0.000003115168,0.00016400112,0.96937627,0.028549371,0.00004716187,0.00043043584,0.00019736546],"about_ca_topic_score_codex":0.00038269148,"about_ca_topic_score_gemma":0.000048312966,"teacher_disagreement_score":0.70170605,"about_ca_system_score_codex":0.00040055448,"about_ca_system_score_gemma":0.000025334251,"threshold_uncertainty_score":0.674218},"labels":[],"label_agreement":null},{"id":"W1968835711","doi":"10.1109/bsc.2010.5473007","title":"Rate-distortion function for Gauss-Markov source with side information at the decoder","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Rate distortion; Gaussian; Distortion function; Rate–distortion theory; Markov chain; Distortion (music); Mathematics; Gauss; Parametric statistics; Distributed source coding; Markov process; Algorithm; Gaussian process; Coding (social sciences); Computer science; Variable-length code; Decoding methods; Statistics; Bandwidth (computing); Physics; Data compression; Telecommunications","score_opus":0.004943566326353383,"score_gpt":0.20020069436155094,"score_spread":0.19525712803519757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968835711","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.19213533,0.000018949393,0.7900849,0.00039724546,0.0001445562,0.00048367577,0.0000046607383,0.0010437374,0.015686966],"genre_scores_gemma":[0.99381506,0.0000133028125,0.005167422,0.00020463884,0.00003180911,0.0002177964,0.000092175644,0.00001891604,0.0004388634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995678,0.000013856137,0.00016697076,0.000054544016,0.00008617905,0.0001106159],"domain_scores_gemma":[0.99933213,0.000100896184,0.000045507953,0.00040366463,0.00009062422,0.000027160042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386906,0.00008953869,0.00006465509,0.00004818906,0.00014364363,0.00005265426,0.00013555346,0.00007532912,0.00010825098],"category_scores_gemma":[0.00002869298,0.00006146816,0.00002803718,0.00008347452,0.000034033834,0.00048169104,0.000029337796,0.00015801797,0.00005897454],"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.0007419837,0.000111782705,0.0034059999,0.0004347128,0.0002963467,2.5963303e-7,0.0053593935,0.038601372,0.15510967,0.036511462,0.24853832,0.5108887],"study_design_scores_gemma":[0.0004094621,0.00005204206,0.0043147216,0.00001127296,0.000027095215,0.0000071675618,0.00017320336,0.08511743,0.07397412,0.00040533152,0.8352519,0.0002562094],"about_ca_topic_score_codex":0.000026928687,"about_ca_topic_score_gemma":0.0010901925,"teacher_disagreement_score":0.80167973,"about_ca_system_score_codex":0.00005410395,"about_ca_system_score_gemma":0.000008528696,"threshold_uncertainty_score":0.25065988},"labels":[],"label_agreement":null},{"id":"W1971066773","doi":"10.1109/icc.2012.6364429","title":"Physical layer authentication in OFDM systems based on hypothesis testing of CFO estimates","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"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; Western University","funders":"","keywords":"Carrier frequency offset; Computer science; Transmitter; Wireless; Physical layer; Fading; Multipath propagation; Orthogonal frequency-division multiplexing; Computer network; Authentication (law); Transmission (telecommunications); Wireless security; Electronic engineering; Channel (broadcasting); Frequency offset; Computer security; Telecommunications; Wireless network; Engineering","score_opus":0.05102343942521926,"score_gpt":0.27067688458184863,"score_spread":0.21965344515662938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971066773","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.9781966,0.00007236352,0.007717177,0.000037482077,0.000033563076,0.00020619741,0.0000032836695,0.000631872,0.013101433],"genre_scores_gemma":[0.9773113,0.0000015156887,0.022577027,0.000008340635,0.000019798103,0.000052279895,0.0000019136498,0.000020963067,0.0000068687004],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947315,0.00003178462,0.00018459764,0.000059182923,0.000114522794,0.00013675849],"domain_scores_gemma":[0.9988024,0.00074425444,0.00003537166,0.0003555276,0.000032046093,0.000030349422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018806977,0.000085051506,0.000142649,0.00011622192,0.000012587822,0.000010619036,0.00014719705,0.00004264647,0.000008764265],"category_scores_gemma":[0.00019518624,0.00008102923,0.000022153688,0.00019720393,0.000018724566,0.00010685906,0.000017702423,0.000085411826,0.000019634408],"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.00001964267,0.0018256871,0.1607806,0.0014346014,0.00005239639,8.297917e-7,0.0038001311,0.13290575,0.6299908,0.045487873,0.00070382986,0.022997815],"study_design_scores_gemma":[0.00006344035,0.000011262066,0.0139246,0.000092136856,0.0000053413,3.1352826e-7,0.000034439454,0.8310834,0.15451656,0.00015012856,0.00003367775,0.00008470041],"about_ca_topic_score_codex":0.00007213255,"about_ca_topic_score_gemma":0.0000026608134,"teacher_disagreement_score":0.69817764,"about_ca_system_score_codex":0.00004893905,"about_ca_system_score_gemma":0.000004875525,"threshold_uncertainty_score":0.33042762},"labels":[],"label_agreement":null},{"id":"W1973188630","doi":"10.1109/glocom.2012.6503282","title":"Secure MISO cognitive radio system with perfect and imperfect CSI","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Computer science; Secrecy; Context (archaeology); Interference (communication); Imperfect; Computer network; Convex optimization; Channel state information; Communications system; Channel (broadcasting); Mathematical optimization; Wireless; Telecommunications; Computer security; Regular polygon; Mathematics","score_opus":0.007255286182429953,"score_gpt":0.21075554599317686,"score_spread":0.2035002598107469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973188630","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.9430166,0.004593435,0.015602248,0.000019087644,0.0000488791,0.00035815334,0.000009943831,0.002181739,0.03416991],"genre_scores_gemma":[0.9978413,0.00016931717,0.0017744136,0.000018908944,0.000048453618,0.00005572083,0.000009559622,0.000039386534,0.000042921092],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943686,0.000049500683,0.000109402565,0.0000913751,0.0000953666,0.0002174861],"domain_scores_gemma":[0.9995121,0.0000939266,0.000017999611,0.00024384733,0.000030482286,0.000101657315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001633547,0.00014657942,0.00016438164,0.00006373548,0.000057630117,0.000031695898,0.000100768964,0.000077414756,0.000029698878],"category_scores_gemma":[0.0000075045045,0.00011858543,0.000022700842,0.000093188086,0.000043224092,0.00023099584,0.00003713322,0.00017691596,0.000021439504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046041745,0.00088022056,0.44088706,0.007428799,0.0034016692,0.000072591145,0.10887629,0.00037365578,0.0597992,0.24677977,0.02916844,0.10187189],"study_design_scores_gemma":[0.009042328,0.0015826835,0.13459805,0.0046829707,0.0009400311,0.003927942,0.041685417,0.22027098,0.53013134,0.00010410057,0.04551961,0.0075145457],"about_ca_topic_score_codex":0.00001751977,"about_ca_topic_score_gemma":0.000013483743,"teacher_disagreement_score":0.47033215,"about_ca_system_score_codex":0.000052904532,"about_ca_system_score_gemma":0.000006001468,"threshold_uncertainty_score":0.48357734},"labels":[],"label_agreement":null},{"id":"W1973265942","doi":"10.1109/vetecs.2012.6240106","title":"Transmission of Discrete Constellations under Strong Interference","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Interference (communication); Transmission (telecommunications); Co-channel interference; Zero-forcing precoding; Channel (broadcasting); Constellation; Adjacent-channel interference; Computer science; Gaussian; Topology (electrical circuits); Telecommunications; Electronic engineering; Physics; Statistical physics; Mathematics; Precoding; MIMO; Engineering; Quantum mechanics; Combinatorics","score_opus":0.028700300356241625,"score_gpt":0.2774744296408821,"score_spread":0.24877412928464046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973265942","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.029198004,0.0003973215,0.8821812,0.000061119266,0.000026559832,0.00006793965,0.0000026014645,0.00033867534,0.08772654],"genre_scores_gemma":[0.98707813,0.000096402895,0.012752528,0.0000062393324,0.0000064411056,0.000003598108,0.000004370198,0.000008649506,0.00004363055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968237,0.000015069395,0.00013465743,0.000029769073,0.000049552113,0.00008858902],"domain_scores_gemma":[0.99968004,0.00004557289,0.000013215433,0.00020443324,0.000016781369,0.000039933846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057401736,0.000050981278,0.00006993282,0.000040682084,0.000014714398,0.0000045993584,0.00011215689,0.000035069424,0.00029251954],"category_scores_gemma":[0.000001986573,0.00004633917,0.000022918952,0.00006241974,0.000033162854,0.0001476222,0.000019605792,0.00007266845,0.0000070608335],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092969585,0.00013879479,0.011294293,0.00021720798,0.00010746259,9.7335985e-8,0.004989953,0.009245318,0.15613644,0.7437191,0.0027048346,0.07143721],"study_design_scores_gemma":[0.00035355825,0.000044510918,0.010733394,0.00025814906,0.000036334895,0.0000064320343,0.0014393858,0.13921086,0.8264249,0.0030756858,0.017858934,0.00055783265],"about_ca_topic_score_codex":0.0000073772408,"about_ca_topic_score_gemma":0.000002587264,"teacher_disagreement_score":0.95788014,"about_ca_system_score_codex":0.000013930969,"about_ca_system_score_gemma":0.0000035354765,"threshold_uncertainty_score":0.3202884},"labels":[],"label_agreement":null},{"id":"W1974240071","doi":"10.1109/glocomw.2014.7063485","title":"Securing visible light communications via friendly jamming","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Eavesdropping; Jamming; Computer science; Visible light communication; Beamforming; Secrecy; Channel (broadcasting); Wireless; Computer network; Channel state information; Transmitter; Interference (communication); Telecommunications; Computer security; Engineering; Light-emitting diode; Electrical engineering","score_opus":0.00967349987504123,"score_gpt":0.23814003765069,"score_spread":0.22846653777564876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974240071","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.019015454,0.00063836743,0.50368905,0.0014754332,0.00012229754,0.00024776923,0.0000021873936,0.005462511,0.4693469],"genre_scores_gemma":[0.93239313,0.00022415868,0.067059614,0.00008838558,0.00003288353,0.000052428928,0.000011492988,0.000041783453,0.00009609827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992341,0.000059461458,0.00026153753,0.00011608012,0.00011955034,0.00020928057],"domain_scores_gemma":[0.9977385,0.00012699571,0.00003078773,0.0019775126,0.000053713728,0.000072503615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523457,0.0001353558,0.00014988787,0.00012765087,0.00015444106,0.00005934877,0.0010285974,0.00008498618,0.00008611219],"category_scores_gemma":[0.000026402295,0.00014750108,0.000049699865,0.00022376986,0.00003999633,0.00024051727,0.0003051595,0.00027250734,0.00016871242],"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.0000061312558,0.00025209304,0.001182613,0.0002858917,0.00017348745,0.0000015048657,0.006451188,0.0019245533,0.16256516,0.53337914,0.028577195,0.26520103],"study_design_scores_gemma":[0.00018218916,0.000033089196,0.00019887547,0.00005912193,0.00001108677,0.000007472791,0.00012713695,0.2598353,0.11363048,0.0038793674,0.62162703,0.00040883623],"about_ca_topic_score_codex":0.00003524309,"about_ca_topic_score_gemma":0.000090595975,"teacher_disagreement_score":0.9133777,"about_ca_system_score_codex":0.000053049735,"about_ca_system_score_gemma":0.0000051325105,"threshold_uncertainty_score":0.601492},"labels":[],"label_agreement":null},{"id":"W1974493046","doi":"10.1109/tit.2013.2276612","title":"Memoryless Multiple Access Channel With Asymmetric Noisy State Information at the Encoders","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Encoder; Channel state information; Computer science; Decoding methods; Converse; Algorithm; Generalization; Channel (broadcasting); Mathematics; Wireless; Telecommunications","score_opus":0.008651747412178994,"score_gpt":0.20909631869095172,"score_spread":0.20044457127877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974493046","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.032800153,0.00002096228,0.9564612,0.00022371717,0.00023022144,0.0009859105,0.000076678465,0.0010105595,0.008190591],"genre_scores_gemma":[0.9978779,0.00018266887,0.0004033344,0.00056520145,0.000007744436,0.00079500553,0.000051536434,0.000022607592,0.00009401276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873555,0.00008718811,0.0004982411,0.00007241701,0.0003518417,0.00025478494],"domain_scores_gemma":[0.9985483,0.00032879363,0.00015299855,0.0006499831,0.0002378571,0.00008206775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000371769,0.00022706848,0.0001540686,0.0005796494,0.000389172,0.00033791398,0.0005749234,0.00009934482,0.0002164497],"category_scores_gemma":[0.000013704044,0.00017115446,0.00006790979,0.00071558636,0.00011489633,0.0073572984,0.000007681264,0.00038708557,0.00093249953],"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.00011384953,0.00005116308,0.000012691197,0.00015903756,0.00013596853,1.448796e-7,0.01131955,0.75295526,0.00008715163,0.00060478,0.0031845856,0.23137584],"study_design_scores_gemma":[0.002965997,0.00024097486,0.0017313353,0.00019876596,0.000095477146,0.000048815153,0.0065430435,0.6657092,0.29429346,0.00397607,0.022640087,0.0015567888],"about_ca_topic_score_codex":0.00010071694,"about_ca_topic_score_gemma":0.00007349628,"teacher_disagreement_score":0.96507776,"about_ca_system_score_codex":0.00022836892,"about_ca_system_score_gemma":0.000026592646,"threshold_uncertainty_score":0.9998454},"labels":[],"label_agreement":null},{"id":"W1978595443","doi":"10.1109/tit.2014.2346780","title":"On Optimal Zero-Delay Coding of Vector Markov Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Bounded function; Markov chain; Quantization (signal processing); Vector quantization; Encoder; Markov decision process; Rate–distortion theory; Convex optimization; Markov model","score_opus":0.006195900892584226,"score_gpt":0.20909800651598354,"score_spread":0.2029021056233993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978595443","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.043467827,0.000008533309,0.94114786,0.000026209296,0.000180929,0.00014429241,0.000028040207,0.0006223044,0.014374012],"genre_scores_gemma":[0.99697804,0.000047581183,0.0027067473,0.0001448831,0.000009030827,0.0000498712,0.000008200839,0.000018135248,0.00003750562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991704,0.00008240985,0.00037505696,0.000056690365,0.00018599053,0.00012941645],"domain_scores_gemma":[0.9990278,0.00036221818,0.000084187384,0.00041688056,0.00006412503,0.00004477713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042295552,0.00013473092,0.00014892578,0.0003075415,0.000103861115,0.000033153738,0.00024332052,0.000100672696,0.00015643916],"category_scores_gemma":[0.000014931498,0.00013995264,0.00008062487,0.00016166434,0.000060541322,0.00056561566,0.0000014051938,0.00026275718,0.00011072228],"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.00020823548,0.00011511608,0.0000017378951,0.0002870632,0.00012265364,1.807631e-7,0.007649827,0.66093886,0.002822375,0.20236766,0.0012298285,0.12425646],"study_design_scores_gemma":[0.0010124223,0.00036706126,0.00006860128,0.00035622303,0.00005180488,0.000012363439,0.00061053975,0.33502167,0.6410065,0.009581911,0.011257116,0.0006537382],"about_ca_topic_score_codex":0.00000321568,"about_ca_topic_score_gemma":9.051189e-7,"teacher_disagreement_score":0.9535102,"about_ca_system_score_codex":0.000057613674,"about_ca_system_score_gemma":0.000008556409,"threshold_uncertainty_score":0.5707103},"labels":[],"label_agreement":null},{"id":"W1980117155","doi":"10.1109/isit.2013.6620473","title":"On Orthogonal signalling in Gaussian Multiple Access Channel with peak constraints","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian; Boundary (topology); Channel (broadcasting); Interference (communication); Mathematics; Power (physics); Computer science; Code (set theory); Hadamard transform; Algorithm; Topology (electrical circuits); Combinatorics; Mathematical optimization; Telecommunications; Mathematical analysis; Physics","score_opus":0.01911283640359498,"score_gpt":0.24077445963786473,"score_spread":0.22166162323426974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980117155","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.9103194,0.000035121615,0.04335672,0.0002810367,0.000028467632,0.000515858,0.0000046710747,0.001035192,0.044423554],"genre_scores_gemma":[0.99669313,0.000023004428,0.0029570377,0.0001123181,0.000011187942,0.00013834117,0.000010544503,0.000028730541,0.000025695092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993447,0.000022722006,0.0001790006,0.0001263078,0.000127422,0.00019985328],"domain_scores_gemma":[0.99948806,0.000119359196,0.000021927695,0.00027254797,0.000036554506,0.00006157955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008274439,0.00013172628,0.00013406316,0.0001459448,0.00002881923,0.00007843372,0.0003533503,0.00006606666,0.0005330409],"category_scores_gemma":[0.000014664219,0.000112915666,0.000019501647,0.00016533374,0.000059114976,0.00029754607,0.00005133734,0.00024343135,0.00006511613],"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.00019942984,0.0018535543,0.07372256,0.00095699733,0.0005203627,0.00013724972,0.012884612,0.46616852,0.06890149,0.25217992,0.011795526,0.11067977],"study_design_scores_gemma":[0.0018922316,0.00015954951,0.07277935,0.0006892284,0.000008332037,0.00002223161,0.0008152299,0.85079235,0.0627078,0.00848677,0.00037147812,0.0012754431],"about_ca_topic_score_codex":0.00012134548,"about_ca_topic_score_gemma":0.0004469201,"teacher_disagreement_score":0.38462383,"about_ca_system_score_codex":0.00004103643,"about_ca_system_score_gemma":0.000011401509,"threshold_uncertainty_score":0.5836424},"labels":[],"label_agreement":null},{"id":"W1981071932","doi":"10.1109/pimrc.2011.6139680","title":"Secure hybrid digital-analog Wyner-Ziv coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Coding (social sciences); Gaussian; Computer science; Channel code; Distortion (music); Algorithm; Channel (broadcasting); Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Bandwidth (computing); Physics; Statistics","score_opus":0.028377709674025853,"score_gpt":0.20545629400565377,"score_spread":0.1770785843316279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981071932","genre_codex":"other","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.059932075,0.00023388468,0.06986862,0.00006745387,0.000092908085,0.0001586561,0.000014514559,0.0041293316,0.86550254],"genre_scores_gemma":[0.9937154,0.00010871428,0.005732179,0.000064754066,0.000019786426,0.00001747361,0.000016400327,0.000034332486,0.00029097602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994249,0.000009683037,0.00018603995,0.000106918786,0.000097986434,0.00017448784],"domain_scores_gemma":[0.99930567,0.000029932839,0.000019978768,0.000548948,0.000032413387,0.00006307499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007066545,0.00012209862,0.00012964115,0.00008096909,0.000037244572,0.000053267522,0.00038976187,0.00004814522,0.00044551928],"category_scores_gemma":[0.000015934178,0.00012180607,0.00005379882,0.00010451592,0.00003297324,0.0002764943,0.0000947213,0.00016936714,0.00018459663],"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.000022054357,0.0003717313,0.010169831,0.00027738765,0.00048608388,0.0000884986,0.007805563,0.00024677755,0.011620202,0.64708906,0.21531537,0.10650745],"study_design_scores_gemma":[0.00063987286,0.000112698726,0.0033224653,0.00016122239,0.000054863267,0.000114439244,0.000604634,0.05589681,0.54005307,0.038236365,0.35879457,0.0020089883],"about_ca_topic_score_codex":0.000015787991,"about_ca_topic_score_gemma":0.000011549125,"teacher_disagreement_score":0.9337833,"about_ca_system_score_codex":0.00003335036,"about_ca_system_score_gemma":0.0000051869174,"threshold_uncertainty_score":0.49671075},"labels":[],"label_agreement":null},{"id":"W1981346363","doi":"10.1109/cwit.2013.6621593","title":"Low and high-delay source-channel coding with bandwidth expansion and correlated interference","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Encoder; Additive white Gaussian noise; Shannon–Hartley theorem; Computer science; Algorithm; Upper and lower bounds; Transmitter; Gaussian; Decoding methods; Parametric statistics; Gaussian noise; Topology (electrical circuits); Mathematics; Channel (broadcasting); Telecommunications; Physics; Statistics","score_opus":0.007199253338597699,"score_gpt":0.18732005357667295,"score_spread":0.18012080023807525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981346363","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.7936935,0.00016597654,0.20412083,0.00009977866,0.000021241436,0.00017637502,8.081025e-7,0.0007374777,0.0009840556],"genre_scores_gemma":[0.9960161,0.00046714197,0.0032867934,0.000043280637,0.000005851065,0.000032533917,0.0000047172584,0.000024306026,0.00011929327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954104,0.00001716384,0.0001289126,0.00012226873,0.00006283346,0.00012777124],"domain_scores_gemma":[0.9995665,0.00006515299,0.00002044192,0.0002339519,0.000045349116,0.00006861616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054039265,0.00012229625,0.00012974424,0.00006910237,0.000052193973,0.00007460621,0.00010246727,0.00007453641,0.00007162256],"category_scores_gemma":[0.000007108841,0.00009883043,0.000007028305,0.00007632833,0.000059023278,0.00023475794,0.000089319255,0.00017199054,0.000011967682],"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.00025628982,0.00054757844,0.020205997,0.0023162728,0.00080399634,0.00004072839,0.056006625,0.018287998,0.3004493,0.030713111,0.0325396,0.5378325],"study_design_scores_gemma":[0.00079780165,0.00020064724,0.0057406956,0.0006794169,0.000019262912,0.00006839647,0.0008128562,0.92213887,0.06757031,0.0010624676,0.00029181383,0.00061744556],"about_ca_topic_score_codex":0.00018633237,"about_ca_topic_score_gemma":0.00003511852,"teacher_disagreement_score":0.9038509,"about_ca_system_score_codex":0.000015480298,"about_ca_system_score_gemma":0.0000031191025,"threshold_uncertainty_score":0.4030188},"labels":[],"label_agreement":null},{"id":"W1983265049","doi":"10.1109/ita.2010.5454072","title":"On interactive encoding and decoding for distributed lossless coding of individual sequences","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Encoder; Lossless compression; Computer science; Joint (building); Coding (social sciences); Encoding (memory); Adaptive coding; Algorithm; Theoretical computer science; Data compression; Mathematics; Artificial intelligence; Statistics","score_opus":0.019982184301040533,"score_gpt":0.2847523344730739,"score_spread":0.26477015017203337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983265049","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.9333481,0.000022439905,0.06374474,0.00005979341,0.00010088389,0.00019643459,0.00009363514,0.0002924506,0.0021414878],"genre_scores_gemma":[0.984758,0.000039320727,0.015094847,0.000015368722,0.000014558883,0.000034629425,0.000027620094,0.00001308482,0.0000025723918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995046,0.000011739779,0.00018375406,0.0000977685,0.000087260596,0.00011487221],"domain_scores_gemma":[0.99908143,0.0006005033,0.000048077953,0.00018164194,0.000053988708,0.00003432816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021884573,0.000093214476,0.00014062825,0.000096433374,0.00005486236,0.000040861876,0.00023127762,0.0000699358,0.000017197262],"category_scores_gemma":[0.00013360345,0.00009114479,0.000027327147,0.00008051429,0.000060300197,0.00017228416,0.00006490698,0.00021158496,5.632515e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935124,0.000077382494,0.0024678071,0.00030863605,0.00015866695,0.0000013170511,0.0040662535,0.00040571892,0.5509505,0.3992177,0.0010436747,0.041263],"study_design_scores_gemma":[0.00032333654,0.000066708715,0.0009650918,0.00016416979,0.000017893486,0.0000063672164,0.00069009146,0.051973525,0.93798506,0.0071137585,0.0004389669,0.0002550381],"about_ca_topic_score_codex":0.000008009316,"about_ca_topic_score_gemma":0.000040757546,"teacher_disagreement_score":0.39210394,"about_ca_system_score_codex":0.000018607516,"about_ca_system_score_gemma":0.000006780073,"threshold_uncertainty_score":0.37167767},"labels":[],"label_agreement":null},{"id":"W1983734652","doi":"10.1109/glocomw.2011.6162578","title":"A remark on secret-key generation over correlated fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Fading; Channel state information; Transmitter; Upper and lower bounds; Channel (broadcasting); Computer science; Key (lock); Coding (social sciences); Joint (building); Telecommunications; Channel capacity; Decoding methods; Algorithm; Channel code; Sequence (biology); Topology (electrical circuits); Mathematics; Wireless; Statistics; Computer security; Engineering; Combinatorics","score_opus":0.04986634966941468,"score_gpt":0.23611237642492383,"score_spread":0.18624602675550916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983734652","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.62214357,0.00013449222,0.07202839,0.00004602701,0.00045710898,0.00032323805,0.0000032065466,0.0033463498,0.30151764],"genre_scores_gemma":[0.99396133,0.00010797507,0.0053994628,0.00011753347,0.00005001198,0.00003190022,0.000022008831,0.000032769207,0.0002769796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943733,0.000029371547,0.00017725158,0.00011335539,0.0001026016,0.00014011365],"domain_scores_gemma":[0.9994438,0.000022324177,0.00002435794,0.00043126303,0.00003301334,0.000045200562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012274044,0.00011560823,0.00010375738,0.00011077051,0.000048226684,0.00002354595,0.00018263237,0.00011501044,0.0005057738],"category_scores_gemma":[0.000015716016,0.000117497075,0.000033640106,0.00014456257,0.000013722783,0.00015373791,0.00003399124,0.00017811458,0.00010357101],"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.00008521777,0.00043809455,0.0017125837,0.0001690426,0.00041146402,0.000044297223,0.040449876,0.019664742,0.30489612,0.40343568,0.20269427,0.025998645],"study_design_scores_gemma":[0.00028891148,0.00007579283,0.0011492823,0.00007672155,0.000011852826,0.000008333272,0.000056233068,0.7029152,0.2850863,0.001088251,0.008789294,0.00045381978],"about_ca_topic_score_codex":0.000043718177,"about_ca_topic_score_gemma":0.000019978117,"teacher_disagreement_score":0.6832505,"about_ca_system_score_codex":0.00006060873,"about_ca_system_score_gemma":0.000004316973,"threshold_uncertainty_score":0.5537869},"labels":[],"label_agreement":null},{"id":"W1986161523","doi":"10.1109/tit.2007.909092","title":"Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Exponent; Channel (broadcasting); Ergodic theory; Upper and lower bounds; Source code; Discrete mathematics; Coding (social sciences); Algorithm; Markov process; Computer science; Mathematics; Statistics; Pure mathematics; Telecommunications; Mathematical analysis","score_opus":0.015357756195373173,"score_gpt":0.23069056212629213,"score_spread":0.21533280593091897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161523","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.005635049,0.00007552306,0.9878343,0.00009116829,0.00024311157,0.0009872514,0.00005904524,0.0011662804,0.0039083185],"genre_scores_gemma":[0.99421966,0.00010253401,0.0048349574,0.00010434793,0.000018810426,0.00048321145,0.0000647532,0.000045032146,0.00012670753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868035,0.00008719429,0.0006259188,0.000094465504,0.00024135396,0.00027071565],"domain_scores_gemma":[0.9984835,0.00032359708,0.00016023978,0.0007753712,0.00016056122,0.00009672794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206503,0.00021878378,0.00021110075,0.00044562828,0.0003672485,0.00010679071,0.00032535894,0.00014064161,0.000022686165],"category_scores_gemma":[0.00000862407,0.0002123909,0.000095106785,0.0002209999,0.000089352325,0.0011040672,0.0000030681852,0.0003421066,0.000032815704],"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.0007360777,0.00013172359,0.0000016694777,0.0007414545,0.00030117296,5.6864377e-7,0.02183907,0.8831595,0.0013399121,0.019786296,0.0010585646,0.070904],"study_design_scores_gemma":[0.00316525,0.000423278,0.00011253499,0.0012377828,0.00017843691,0.000070227194,0.032572303,0.76013124,0.18161832,0.0018878527,0.016988577,0.0016141662],"about_ca_topic_score_codex":0.00002300801,"about_ca_topic_score_gemma":0.000024705212,"teacher_disagreement_score":0.9885846,"about_ca_system_score_codex":0.00024226966,"about_ca_system_score_gemma":0.000018656578,"threshold_uncertainty_score":0.86610496},"labels":[],"label_agreement":null},{"id":"W1987043386","doi":"10.1109/cwit.2013.6621594","title":"An achievability proof for the lossy coding of Markov sources with feed-forward","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Lossy compression; Ergodic theory; Markov chain; Source code; Markov process; Computer science; Algorithm; Shannon–Fano coding; Variable-length code; Theoretical computer science; Coding (social sciences); Binary number; Mathematics; Discrete mathematics; Decoding methods; Statistics; Arithmetic","score_opus":0.010488801195776212,"score_gpt":0.23653975564518528,"score_spread":0.22605095444940906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987043386","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.73844147,0.00014601518,0.25542217,0.000576475,0.000017585275,0.0013494936,0.000008120461,0.00064258795,0.003396056],"genre_scores_gemma":[0.97256905,0.000022227532,0.027008425,0.00002527495,0.0000142823965,0.0002990071,0.0000040547034,0.000021326483,0.000036348116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999477,0.000025773199,0.00017685199,0.0000905673,0.000102103484,0.00012769426],"domain_scores_gemma":[0.99889666,0.00022115365,0.000036581983,0.00070422504,0.0001083391,0.000033063305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025934185,0.00009356425,0.00012940957,0.000031335163,0.00006380151,0.000040666786,0.00043380287,0.00004638445,0.00008351256],"category_scores_gemma":[0.000020126914,0.000057523168,0.0000351915,0.00008841397,0.00009496937,0.00021056732,0.000037642032,0.000098923876,0.0000020050554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035240763,0.0013472296,0.13236128,0.0046045254,0.0012438336,5.5171154e-7,0.024343522,0.022927774,0.19742495,0.088562064,0.02324422,0.50358766],"study_design_scores_gemma":[0.0005796997,0.0003858901,0.032811627,0.000107211825,0.000053378033,0.000004277275,0.0019092166,0.4951797,0.45790166,0.004194187,0.0063458737,0.0005272652],"about_ca_topic_score_codex":0.000115404895,"about_ca_topic_score_gemma":0.000098436096,"teacher_disagreement_score":0.5030604,"about_ca_system_score_codex":0.00002086303,"about_ca_system_score_gemma":0.000008086429,"threshold_uncertainty_score":0.23457268},"labels":[],"label_agreement":null},{"id":"W1989889906","doi":"10.1109/tcomm.2014.2360852","title":"Source-Channel Coding for Fading Channels With Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Fading; Computer science; Channel state information; Transmitter; Channel (broadcasting); Upper and lower bounds; Algorithm; Decoding methods; Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.03337097799345879,"score_gpt":0.25657922920778325,"score_spread":0.22320825121432447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989889906","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.002665092,0.00007615529,0.9918873,0.000519745,0.00018537662,0.0004933886,0.000028581917,0.0016061116,0.0025382906],"genre_scores_gemma":[0.98422885,0.00045022796,0.014198193,0.00007879008,0.000016637145,0.0007513952,0.000025519768,0.000079865116,0.00017053245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.00009984286,0.00032113207,0.00018082822,0.000113503585,0.0002573995],"domain_scores_gemma":[0.9969636,0.00075862755,0.00006672168,0.0019700972,0.00015120926,0.000089724475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024303334,0.00022046932,0.00022827466,0.00025798831,0.0005490173,0.000079451915,0.0011168574,0.00012918684,0.000017618837],"category_scores_gemma":[0.000012643304,0.00023273731,0.00008890756,0.0003511597,0.00014886819,0.0002098123,0.000008420062,0.00055207027,0.000030825016],"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.000108451735,0.0006037765,0.000019218067,0.00019662737,0.00042764435,2.181402e-7,0.0090942085,0.88797826,0.009026483,0.011021099,0.0011974628,0.080326565],"study_design_scores_gemma":[0.0004732115,0.00015395871,0.000007655724,0.00027357868,0.00005363894,0.000009815154,0.0002310176,0.95952296,0.029549468,0.0006516894,0.008710583,0.0003624365],"about_ca_topic_score_codex":0.000024654193,"about_ca_topic_score_gemma":0.00010656061,"teacher_disagreement_score":0.98156375,"about_ca_system_score_codex":0.00010889585,"about_ca_system_score_gemma":0.000016041779,"threshold_uncertainty_score":0.9490752},"labels":[],"label_agreement":null},{"id":"W1992678747","doi":"10.1109/isit.2005.1523570","title":"On the joint source-channel coding error exponent for systems with memory","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Mathematics; Upper and lower bounds; Ergodic theory; Exponent; Entropy (arrow of time); Markov chain; Binary symmetric channel; Markov process; Random variable; Discrete mathematics; Combinatorics; Channel code; Statistical physics; Decoding methods; Statistics; Mathematical analysis; Physics","score_opus":0.040868103186476566,"score_gpt":0.23316407735632416,"score_spread":0.1922959741698476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992678747","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.12512155,0.00045856574,0.8403704,0.0039234213,0.00013082418,0.0017803451,0.000009199277,0.0029702773,0.025235422],"genre_scores_gemma":[0.996341,0.000025235591,0.0024123746,0.00017716011,0.00006171597,0.00043070407,0.0000034094076,0.000041502375,0.0005068981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.000024578496,0.00017344386,0.00009414462,0.0001272393,0.00016093283],"domain_scores_gemma":[0.9992148,0.0001784015,0.0000307033,0.0005022528,0.000038354054,0.00003548129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498017,0.00011786768,0.00012669986,0.000055413682,0.00009345893,0.000046125442,0.00022763836,0.000045551216,0.000027340378],"category_scores_gemma":[0.000017036333,0.0000752377,0.000038652248,0.000055403838,0.000024721732,0.00006444593,0.00003196046,0.00012987622,0.000024412324],"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.00006379174,0.0001754369,0.0000073372507,0.00038512165,0.00022751861,0.0000013067237,0.008039722,0.63097394,0.0120268585,0.21987484,0.12234666,0.005877467],"study_design_scores_gemma":[0.00029480536,0.000075873235,0.000015241694,0.00019733391,0.00001130753,0.000008009075,0.0018007089,0.91044044,0.061191153,0.0001881999,0.02550078,0.00027616892],"about_ca_topic_score_codex":0.000021077387,"about_ca_topic_score_gemma":0.00002596657,"teacher_disagreement_score":0.87121946,"about_ca_system_score_codex":0.00008462268,"about_ca_system_score_gemma":0.0000051647035,"threshold_uncertainty_score":0.30681044},"labels":[],"label_agreement":null},{"id":"W1993509434","doi":"10.1109/lcomm.2015.2398866","title":"Variable-Length Feedback Codes Under a Strict Delay Constraint","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Decoding methods; Constraint (computer-aided design); Coding (social sciences); Upper and lower bounds; Channel (broadcasting); Code rate; Channel code; Variable (mathematics); Computer science; Algorithm; Code (set theory); Mathematics; Telecommunications; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.05252369745064049,"score_gpt":0.27242461534703744,"score_spread":0.21990091789639693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993509434","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.12325364,0.003945683,0.77367896,0.023905417,0.00069258665,0.0012871752,0.0001913115,0.0066767116,0.06636854],"genre_scores_gemma":[0.8659561,0.000485934,0.13176687,0.0014479012,0.00003437872,0.00014673949,0.0000843693,0.000057359037,0.000020319178],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985141,0.00032358165,0.00044148497,0.00017309407,0.0002374605,0.00031027288],"domain_scores_gemma":[0.99545574,0.00048675877,0.000081889295,0.0036308614,0.00016553375,0.00017924367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062205066,0.00023629669,0.00025504376,0.00020540418,0.00017110631,0.000113063914,0.0021889142,0.00012932818,0.000026125621],"category_scores_gemma":[0.000069483554,0.00027181156,0.00006743037,0.00051623216,0.00038325475,0.00028903887,0.00026868228,0.0006048292,0.00012443769],"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.000045400044,0.0007503277,0.0010947462,0.00014425823,0.0009819727,0.000012021348,0.0068464563,0.13449058,0.1104907,0.26324517,0.4657698,0.016128568],"study_design_scores_gemma":[0.0034458847,0.000130384,0.001246274,0.00046097842,0.00026658372,0.0002485392,0.0034825627,0.27064887,0.01874018,0.014579916,0.6835736,0.0031762405],"about_ca_topic_score_codex":0.0001043683,"about_ca_topic_score_gemma":0.000060090464,"teacher_disagreement_score":0.7427025,"about_ca_system_score_codex":0.0003206404,"about_ca_system_score_gemma":0.00007432023,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W1993695587","doi":"10.1109/tifs.2013.2293113","title":"Cooperative Key Agreement for Wireless Networking: Key Rates and Practical Protocol Design","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"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 Victoria","funders":"","keywords":"Key-agreement protocol; Computer science; Relay; Computer network; Key (lock); Node (physics); Wireless; Pre-shared key; Wireless network; Fading; Protocol (science); Upper and lower bounds; Block (permutation group theory); Key exchange; Public-key cryptography; Key distribution; Computer security; Channel (broadcasting); Telecommunications; Encryption; Mathematics","score_opus":0.025863364892189145,"score_gpt":0.28155960445837236,"score_spread":0.2556962395661832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993695587","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.0020871738,0.00000555558,0.98467696,0.000256211,0.00010923325,0.011978742,0.000028073127,0.00024320316,0.0006148349],"genre_scores_gemma":[0.9638114,0.00011294175,0.018080879,0.00022811693,0.00003540478,0.01768676,0.000020102743,0.000018750741,0.0000056687686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.000068970156,0.00037961852,0.00010979864,0.00015061723,0.00018691925],"domain_scores_gemma":[0.9991137,0.00029062363,0.000080809856,0.00022271079,0.00019661362,0.00009558674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269611,0.00018909942,0.00019583678,0.000103152466,0.00028534574,0.00018022498,0.0000671623,0.00013391324,0.000008338768],"category_scores_gemma":[0.000011597433,0.00018463666,0.000038331993,0.00011834035,0.00009887494,0.00080397713,0.0000034795705,0.00026915068,0.000004654855],"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.0014370392,0.0005614344,0.00006496989,0.0025116685,0.00064640766,0.0000016100856,0.05023047,0.10732317,0.00086223794,0.22922847,0.025059808,0.58207273],"study_design_scores_gemma":[0.0010014229,0.0003072423,0.000016456315,0.00006908183,0.000024253533,0.00001071647,0.00021005305,0.91103745,0.019782167,0.0044163857,0.06282557,0.00029922026],"about_ca_topic_score_codex":0.0000075989474,"about_ca_topic_score_gemma":0.000023104589,"teacher_disagreement_score":0.96659607,"about_ca_system_score_codex":0.000043729833,"about_ca_system_score_gemma":0.000022303182,"threshold_uncertainty_score":0.75292647},"labels":[],"label_agreement":null},{"id":"W1993813893","doi":"10.1109/isit.2012.6283632","title":"Random access in wireless X network: A deterministic view","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Transmitter; Computer science; Random access; Throughput; Linear network coding; Computer network; Linear programming; Transmission (telecommunications); Maximization; Wireless network; Channel (broadcasting); Wireless; Coding (social sciences); Set (abstract data type); Mathematical optimization; Algorithm; Mathematics; Telecommunications","score_opus":0.0306816235447539,"score_gpt":0.2952729326397959,"score_spread":0.264591309095042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993813893","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.68736184,0.0068428945,0.13953477,0.00023244708,0.00068319804,0.001203081,0.0000044303943,0.004289873,0.15984748],"genre_scores_gemma":[0.9967772,0.00074466417,0.002109595,0.000113210284,0.000076565295,0.00011700322,0.000004565931,0.000028152888,0.000029072628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921733,0.000055435943,0.00024675482,0.00006878828,0.000081993916,0.00032967713],"domain_scores_gemma":[0.99935085,0.00014106712,0.000020058966,0.000405099,0.000013702007,0.00006925198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032246037,0.00011409397,0.00020281957,0.00006609777,0.000025434625,0.000044167562,0.00043956106,0.000071163915,0.000130937],"category_scores_gemma":[0.000012825972,0.00011254176,0.000032787186,0.00024112455,0.000022089385,0.00035985024,0.00013185463,0.0001686057,0.000041987485],"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.00013928462,0.0007652907,0.22865608,0.0015328837,0.00020486172,0.000028545845,0.0044306996,0.015902773,0.0032032838,0.12003475,0.045802236,0.57929933],"study_design_scores_gemma":[0.006399731,0.00006162369,0.12701009,0.0013130946,0.00008653172,0.00008970762,0.00016039897,0.6140843,0.023501748,0.006321055,0.21768136,0.003290315],"about_ca_topic_score_codex":0.000023858844,"about_ca_topic_score_gemma":0.00009520094,"teacher_disagreement_score":0.59818155,"about_ca_system_score_codex":0.000046029556,"about_ca_system_score_gemma":0.0000061001983,"threshold_uncertainty_score":0.45893198},"labels":[],"label_agreement":null},{"id":"W1994027334","doi":"10.1109/sahcn.2013.6645022","title":"Efficient wireless security through jamming, coding and routing","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Computer science; Physical layer; Computer network; Goodput; Jamming; Wireless network; Linear network coding; Distributed computing; Multipath routing; Routing protocol; Wireless; Link-state routing protocol; Routing (electronic design automation); Network packet; Telecommunications; Throughput","score_opus":0.011200135392128732,"score_gpt":0.22947834211279097,"score_spread":0.21827820672066223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994027334","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.9437732,0.00018974525,0.02224917,0.00018055545,0.00005021288,0.0002419158,0.0000011981737,0.0015113216,0.031802654],"genre_scores_gemma":[0.9929052,0.0001928003,0.0066979136,0.000074097465,0.000022169332,0.000046595014,0.000002392427,0.000026890993,0.00003193573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929464,0.000025032708,0.00020934985,0.00013650382,0.00011363234,0.00022081705],"domain_scores_gemma":[0.99943817,0.00008453174,0.000026724887,0.00034978212,0.000047395883,0.000053369455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012906794,0.00013320206,0.00014755549,0.000040535484,0.000096263575,0.0000944258,0.0001941225,0.00007875982,0.00011475478],"category_scores_gemma":[0.000015776232,0.00013307437,0.000026239493,0.000117782816,0.000051757874,0.00013375406,0.00014198567,0.00020326223,0.000047475784],"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.000007256256,0.0003240687,0.010674707,0.00094266364,0.00024369411,0.0000099808,0.06659412,0.0072676116,0.10883232,0.66284645,0.027254464,0.11500267],"study_design_scores_gemma":[0.00019313488,0.000014822788,0.0010596262,0.000086098786,0.0000069085227,0.000010382206,0.0011041283,0.9524484,0.040274013,0.0022582114,0.0021715886,0.00037268674],"about_ca_topic_score_codex":0.00026759025,"about_ca_topic_score_gemma":0.000018912495,"teacher_disagreement_score":0.9451808,"about_ca_system_score_codex":0.00004489446,"about_ca_system_score_gemma":0.000004008818,"threshold_uncertainty_score":0.5426615},"labels":[],"label_agreement":null},{"id":"W1994418207","doi":"10.1109/isit.2013.6620564","title":"Energy efficiency of Gaussian channel with random data arrival","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Additive white Gaussian noise; Transmitter; Energy (signal processing); Channel (broadcasting); Gaussian; Computer science; Point (geometry); Algorithm; Telecommunications; Mathematics; Statistics; Physics","score_opus":0.016711171837646994,"score_gpt":0.22289403082921883,"score_spread":0.20618285899157182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994418207","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.042631514,0.00055766664,0.85131973,0.00030964796,0.00007942042,0.0003356103,0.000019649488,0.0015265042,0.10322025],"genre_scores_gemma":[0.99262154,0.00012009415,0.0070599406,0.00002466666,0.000017288035,0.000028487679,0.000030945324,0.000018749479,0.000078308534],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949515,0.000017713737,0.00015809196,0.000100078265,0.00011208386,0.00011689849],"domain_scores_gemma":[0.99865055,0.00004189936,0.000024733687,0.0011807798,0.00006213986,0.00003990714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007924313,0.00008445595,0.00013846059,0.00006306813,0.000018576851,0.000016392758,0.00072246033,0.000038276212,0.00016019662],"category_scores_gemma":[0.000012027636,0.00006470661,0.00001318196,0.00013189625,0.00004658812,0.00021062406,0.00014257437,0.00006401796,0.000011723499],"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.00026875024,0.0017864219,0.0018101595,0.0012349196,0.0011665965,0.000014166055,0.006748569,0.024223387,0.14256005,0.24400881,0.37961173,0.19656645],"study_design_scores_gemma":[0.0015026054,0.00008945975,0.0005412441,0.00010217294,0.000018512847,0.0000067922165,0.00023142528,0.80683863,0.17328882,0.0012849129,0.015631929,0.0004634644],"about_ca_topic_score_codex":0.00035603327,"about_ca_topic_score_gemma":0.00006407275,"teacher_disagreement_score":0.94999,"about_ca_system_score_codex":0.000008270343,"about_ca_system_score_gemma":0.00000829087,"threshold_uncertainty_score":0.2638659},"labels":[],"label_agreement":null},{"id":"W1995956904","doi":"10.1109/isit.2014.6874953","title":"The separability and ergodic sum-rate of parallel Gaussian interference channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Decoding methods; Ergodic theory; Gaussian; Mathematics; Diagonal; Coding (social sciences); Power control; Covariance matrix; Fading; Algorithm; Channel (broadcasting); Computer science; Topology (electrical circuits); Control theory (sociology); Telecommunications; Power (physics); Combinatorics; Statistics; Physics; Mathematical analysis","score_opus":0.013185756057920297,"score_gpt":0.24013145804283745,"score_spread":0.22694570198491715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995956904","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.7933336,0.00076004537,0.16941707,0.0014071887,0.00013025558,0.00034617478,0.0000035468768,0.00095502794,0.033647083],"genre_scores_gemma":[0.997986,0.0004327271,0.0014550753,0.000025423327,0.00000811636,0.000022318705,0.0000011073448,0.000008518676,0.000060678973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995148,0.00008010169,0.00017987889,0.00007861939,0.0000412864,0.000105287625],"domain_scores_gemma":[0.9991761,0.0002215634,0.000025028165,0.000513154,0.000030185944,0.00003396111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043209622,0.00007596044,0.00011173373,0.000022159418,0.00004627816,0.00002748174,0.00027661902,0.00004279021,0.000015003339],"category_scores_gemma":[0.0000498353,0.000053432355,0.000020352269,0.00005874417,0.0001208369,0.00006512145,0.000087488166,0.00010917795,0.0000046506348],"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.00007500643,0.00013910705,0.009501905,0.00057289796,0.00015717029,5.595254e-7,0.0055089467,0.0031177269,0.022023516,0.8384403,0.008561154,0.111901686],"study_design_scores_gemma":[0.0006273203,0.00023702701,0.035551142,0.00019523076,0.000022741717,0.0000076230062,0.00040665662,0.68668175,0.12612323,0.10146328,0.04793068,0.0007533124],"about_ca_topic_score_codex":0.000042049487,"about_ca_topic_score_gemma":0.00010543119,"teacher_disagreement_score":0.73697704,"about_ca_system_score_codex":0.000010653273,"about_ca_system_score_gemma":0.0000036016984,"threshold_uncertainty_score":0.21789083},"labels":[],"label_agreement":null},{"id":"W1996778281","doi":"10.1109/qbsc.2014.6841192","title":"Distortion bounds for broadcasting a Gaussian source in the presence of interference","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Distortion (music); Interference (communication); Computer science; Broadcasting (networking); Gaussian; Telecommunications; Algorithm; Physics; Bandwidth (computing); Computer network","score_opus":0.01881078049858949,"score_gpt":0.25503127443082335,"score_spread":0.23622049393223388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996778281","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.11087693,0.00004705251,0.8809207,0.00012737165,0.000020217889,0.0001641644,8.784779e-7,0.00016195548,0.007680709],"genre_scores_gemma":[0.994287,0.0000094724455,0.005563212,0.000019952666,0.000011298118,0.000067377994,0.00000250777,0.000007838832,0.00003130466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959815,0.000038339756,0.00016543713,0.0000557041,0.000059650974,0.00008271038],"domain_scores_gemma":[0.9993904,0.00024413987,0.000028679247,0.00030639226,0.000020687761,0.000009669837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033029995,0.000049995866,0.00007315259,0.00004276405,0.000021834147,0.000017541004,0.00033234566,0.000028854543,0.0000050137196],"category_scores_gemma":[0.00012102101,0.00003897306,0.000020918642,0.000092102346,0.00003128171,0.00007443661,0.000031210948,0.00008296002,7.58836e-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.0000604904,0.00029898336,0.016353507,0.0013211921,0.00004357144,3.7759995e-7,0.051184293,0.015542439,0.060498904,0.19892873,0.008191533,0.647576],"study_design_scores_gemma":[0.00021587647,0.00008740772,0.004973809,0.00021028933,0.000005597908,0.0000030341735,0.0007303305,0.9402977,0.029472115,0.004208019,0.019604364,0.00019145133],"about_ca_topic_score_codex":0.000058409387,"about_ca_topic_score_gemma":0.00014957132,"teacher_disagreement_score":0.9247553,"about_ca_system_score_codex":0.000017438462,"about_ca_system_score_gemma":0.0000029571281,"threshold_uncertainty_score":0.15892752},"labels":[],"label_agreement":null},{"id":"W1997717493","doi":"10.1109/setit.2012.6481956","title":"Progressive distributed video coding with multiple passes for side information update","year":2012,"lang":"en","type":"article","venue":"","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":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Computer science; Encoder; Decoding methods; Coding (social sciences); Architecture; Multiview Video Coding; Block (permutation group theory); Computer hardware; Real-time computing; Theoretical computer science; Algorithm; Video processing; Video tracking; Mathematics","score_opus":0.011633973676374594,"score_gpt":0.239798560433182,"score_spread":0.22816458675680742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997717493","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.05956921,0.00015766002,0.93551266,0.00020716712,0.00005065827,0.0007490279,0.00013401132,0.001980753,0.0016388338],"genre_scores_gemma":[0.9486446,0.000023984574,0.050418373,0.000046530302,0.000022568325,0.00034330125,0.0004839275,0.000014689126,0.0000020575862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948937,0.000009902046,0.00017317657,0.000039068666,0.00008451739,0.000203955],"domain_scores_gemma":[0.9994443,0.00011085851,0.00004847279,0.00024395203,0.000097287,0.000055146873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010374195,0.0000984445,0.00009851697,0.000052513322,0.00006244385,0.000055587625,0.00013866136,0.000049207123,0.000013509025],"category_scores_gemma":[0.000058225334,0.000082417406,0.000021429727,0.00010841329,0.000020732234,0.0012944755,0.00003449268,0.00007556529,0.000015560583],"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.00059772894,0.00084602676,0.14861424,0.003697911,0.0012922405,0.0000042903166,0.017449735,0.021390965,0.021754684,0.37454778,0.17492266,0.23488173],"study_design_scores_gemma":[0.0015170124,0.00009131795,0.012687491,0.0001974812,0.000051376537,0.000024923076,0.0009941183,0.2071114,0.41406536,0.00040841245,0.36197078,0.0008803417],"about_ca_topic_score_codex":0.0000065555255,"about_ca_topic_score_gemma":0.000010190527,"teacher_disagreement_score":0.88907534,"about_ca_system_score_codex":0.000049256887,"about_ca_system_score_gemma":0.000006472674,"threshold_uncertainty_score":0.33608842},"labels":[],"label_agreement":null},{"id":"W1998505899","doi":"10.1109/qbsc.2012.6221376","title":"Transmit rate reduction of Wyner-Ziv video coding (WZVC) using multiple uncorrelated wireless receivers","year":2012,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Decoding methods; Wireless; Coding (social sciences); Uncorrelated; Algorithm; Video quality; Channel (broadcasting); Parity bit; Bit error rate; Real-time computing; Computer network; Mathematics; Telecommunications; Statistics; Engineering","score_opus":0.027940669228535664,"score_gpt":0.24652894482148616,"score_spread":0.2185882755929505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998505899","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.89594644,0.00028086855,0.09938573,0.000038418624,0.0003339116,0.00023452193,0.000006031392,0.0010286082,0.0027454945],"genre_scores_gemma":[0.9878235,0.00041826646,0.011582767,0.0000091137545,0.000041755335,0.000011963395,0.000015399766,0.000049864906,0.000047410926],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896735,0.000097323835,0.00039156413,0.00012267825,0.0001369093,0.00028415132],"domain_scores_gemma":[0.9991967,0.00010751887,0.00008169054,0.0004372199,0.00008819693,0.000088694294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003928718,0.00017262284,0.00024173876,0.00017699099,0.00007506213,0.000016130884,0.00023249097,0.00016423456,0.00009158266],"category_scores_gemma":[0.000025876945,0.00018889623,0.000077219935,0.00038865383,0.00006664632,0.0005746775,0.000033966826,0.0002633703,0.000011812191],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028363704,0.00009168921,0.0024788633,0.0001484879,0.00010384613,5.8901014e-7,0.0032428363,0.015005218,0.9646215,0.0019222631,0.00060371653,0.011752648],"study_design_scores_gemma":[0.00042229836,0.0000147114515,0.0007778993,0.00015937303,0.00004415767,0.000016850354,0.00064183044,0.33726627,0.65862453,0.00006876129,0.001619839,0.00034346327],"about_ca_topic_score_codex":0.00022566233,"about_ca_topic_score_gemma":0.00001439824,"teacher_disagreement_score":0.32226107,"about_ca_system_score_codex":0.00015421027,"about_ca_system_score_gemma":0.000013232398,"threshold_uncertainty_score":0.77029645},"labels":[],"label_agreement":null},{"id":"W1999140828","doi":"10.1109/isita.2010.5650104","title":"New results on Secret Key Establishment over a pair of broadcast channels","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Secrecy; Upper and lower bounds; Key (lock); Computer science; Simple (philosophy); Coding (social sciences); Channel (broadcasting); Computer network; Protocol (science); Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Statistics; Philosophy","score_opus":0.02055390996337227,"score_gpt":0.26070340921065405,"score_spread":0.24014949924728177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999140828","genre_codex":"other","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.33938,0.0018096538,0.14804569,0.00437018,0.005676876,0.0051528485,0.0014244802,0.014931441,0.47920883],"genre_scores_gemma":[0.9621275,0.0005538099,0.03543294,0.00008619704,0.00020590631,0.00008061623,0.00026869288,0.00009695688,0.0011473707],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983171,0.00004953534,0.0006499326,0.00035348645,0.0003789932,0.0002509564],"domain_scores_gemma":[0.99706906,0.0001330343,0.00017975328,0.002368632,0.0001026974,0.00014683059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003527697,0.0003719949,0.00047540443,0.0002776299,0.000023014589,0.00008690015,0.0010477222,0.0006766452,0.00030737362],"category_scores_gemma":[0.00007716234,0.0003813912,0.00015800755,0.00013495369,0.00003630113,0.00008868579,0.0008691817,0.0015467033,0.00002640607],"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.00027447485,0.00046643356,0.00012968654,0.0017837363,0.0005638547,0.000014448561,0.011300163,0.07151048,0.012758973,0.027641874,0.7829974,0.09055844],"study_design_scores_gemma":[0.0014928356,0.00020203949,0.0008475223,0.0019183714,0.00005891587,0.0000052777837,0.00010138909,0.07399888,0.38674077,0.008443948,0.5244518,0.001738286],"about_ca_topic_score_codex":0.0009822092,"about_ca_topic_score_gemma":0.0001240188,"teacher_disagreement_score":0.62274754,"about_ca_system_score_codex":0.000109977926,"about_ca_system_score_gemma":0.00007968001,"threshold_uncertainty_score":0.9998638},"labels":[],"label_agreement":null},{"id":"W1999333067","doi":"10.1109/allerton.2014.7028439","title":"Randomized source coding with limited common randomness","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Randomness; Encoder; Computer science; Coding (social sciences); Algorithm; Stochastic process; Theoretical computer science; Mathematical optimization; Mathematics; Statistics","score_opus":0.009461898255943088,"score_gpt":0.21821488769725392,"score_spread":0.20875298944131082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999333067","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.13362111,0.0000983308,0.7918385,0.00020330137,0.00003357207,0.00044703708,4.759848e-7,0.0032323098,0.07052531],"genre_scores_gemma":[0.99194545,0.0000929626,0.0075167036,0.00011875946,0.000020783817,0.00010287711,0.000009054752,0.00003987015,0.00015357086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992095,0.00018794811,0.00023315546,0.00009239119,0.0001261164,0.00015086956],"domain_scores_gemma":[0.99863505,0.00073177216,0.00003583894,0.0005043585,0.00004281992,0.0000501841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063032215,0.00013655024,0.00044619045,0.000088159024,0.000058513964,0.000049812515,0.0002696804,0.000063078165,0.00004984868],"category_scores_gemma":[0.000057159614,0.000103942366,0.000059284328,0.00014456295,0.0000819265,0.00009832532,0.000042248215,0.00017033967,0.000019994855],"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.12084912,0.00048958126,0.0028166526,0.0011562752,0.0017290993,0.000009705323,0.011887143,0.07772383,0.022276856,0.55170953,0.020719156,0.18863304],"study_design_scores_gemma":[0.2234712,0.00002606149,0.000045514895,0.000127933,0.00005169142,0.00001213988,0.000078452875,0.7161517,0.036463857,0.00089963444,0.022199003,0.00047282662],"about_ca_topic_score_codex":0.000034691293,"about_ca_topic_score_gemma":0.000037046073,"teacher_disagreement_score":0.8583243,"about_ca_system_score_codex":0.000019851657,"about_ca_system_score_gemma":0.0000029129233,"threshold_uncertainty_score":0.42386466},"labels":[],"label_agreement":null},{"id":"W2003025695","doi":"10.1109/lwc.2014.2349514","title":"On the Secrecy Rate Achievability in Dual-Hop Amplify-and-Forward Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Relay; Secrecy; Computer science; Computer network; Wireless; Transmitter power output; Hop (telecommunications); Link (geometry); Signal-to-noise ratio (imaging); Dual (grammatical number); Topology (electrical circuits); Power (physics); Telecommunications; Transmitter; Computer security; Electrical engineering; Channel (broadcasting); Physics; Engineering","score_opus":0.016061845824045892,"score_gpt":0.23849041181981875,"score_spread":0.22242856599577288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003025695","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.92969835,0.0002752995,0.045822825,0.020386796,0.00014803266,0.000645491,0.000011245736,0.00088603434,0.00212592],"genre_scores_gemma":[0.9935057,0.0013940709,0.0015637496,0.0029591788,0.00003772302,0.0004200532,0.00004066715,0.00007005814,0.0000087688295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973354,0.0012627896,0.0005686027,0.0002752848,0.00017987053,0.0003780906],"domain_scores_gemma":[0.991972,0.0031050998,0.00010956747,0.00467573,0.00004835722,0.00008918959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018290231,0.00030250393,0.00033670047,0.0001886675,0.00035880995,0.00011877032,0.0015140283,0.00018707332,0.000013148192],"category_scores_gemma":[0.00013215675,0.0002723408,0.00008175421,0.00049249013,0.00048072496,0.00019345766,0.00035236916,0.0014717507,0.0000346306],"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.00011371536,0.0007679307,0.0067213974,0.0002364789,0.0003497786,0.000006429373,0.007909859,0.3224901,0.0567096,0.52557236,0.02956826,0.04955412],"study_design_scores_gemma":[0.00066608784,0.000047190035,0.009319249,0.00028142732,0.000031099742,0.000011559278,0.00018375719,0.9631972,0.0022191757,0.0034795282,0.019705445,0.0008582999],"about_ca_topic_score_codex":0.00011225594,"about_ca_topic_score_gemma":0.00035003576,"teacher_disagreement_score":0.6407071,"about_ca_system_score_codex":0.00016684383,"about_ca_system_score_gemma":0.00001148018,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2003714332","doi":"10.1109/icc.2013.6655319","title":"A two dimensional quantization algorithm for CIR-based physical layer authentication","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":79,"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; Quantization (signal processing); Algorithm; Physical layer; Orthogonal frequency-division multiplexing; False alarm; Spoofing attack; Wireless; Channel (broadcasting); Computer network; Telecommunications; Artificial intelligence","score_opus":0.01906621006241805,"score_gpt":0.2790688984755446,"score_spread":0.26000268841312657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003714332","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.12352113,0.000023449702,0.87354124,0.00036647473,0.000053888045,0.0005753697,0.00000845614,0.0011505903,0.00075941405],"genre_scores_gemma":[0.8321995,0.0000015309349,0.16713588,0.000081674894,0.000039440278,0.00036720687,0.000097700664,0.000025490115,0.00005153486],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.000018083405,0.00014375384,0.00010650126,0.00011780265,0.00012584878],"domain_scores_gemma":[0.999379,0.00011331557,0.00002322369,0.00030618708,0.00013771474,0.000040554125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006307569,0.00009495514,0.00009866491,0.00006597927,0.00004742596,0.000039350372,0.0001411627,0.0000409489,0.00008360669],"category_scores_gemma":[0.0000126688365,0.00009281181,0.000050510964,0.000108632696,0.000022390668,0.00017672787,0.000019341995,0.00006538012,0.00010009603],"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.000008473128,0.001105241,0.0002450788,0.00016341514,0.00013080593,3.3133443e-7,0.0010076991,0.031116396,0.46448168,0.13368061,0.03538492,0.33267537],"study_design_scores_gemma":[0.00021737599,0.000016583032,0.00025275763,0.000009318706,0.000006448717,2.7273876e-7,0.000008402409,0.92613524,0.06940439,0.0031214585,0.00071541406,0.00011233353],"about_ca_topic_score_codex":0.000029938443,"about_ca_topic_score_gemma":0.0000031408645,"teacher_disagreement_score":0.8950189,"about_ca_system_score_codex":0.000036157675,"about_ca_system_score_gemma":0.000010567929,"threshold_uncertainty_score":0.37847558},"labels":[],"label_agreement":null},{"id":"W2004443711","doi":"10.1109/glocomw.2014.7063617","title":"Impact of estimated CSI quantization on secrecy rate loss in pilot-aided MIMO systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Artificial noise; Channel state information; Computer science; MIMO; Secrecy; Imperfect; Transmitter; Precoding; Beamforming; Quantization (signal processing); Transmitter power output; Physical layer; Upper and lower bounds; Telecommunications; Channel (broadcasting); Control theory (sociology); Wireless; Algorithm; Computer security; Mathematics; Artificial intelligence","score_opus":0.031785187618810634,"score_gpt":0.30155664508221236,"score_spread":0.2697714574634017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004443711","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.95135254,0.000057275138,0.041390773,0.000018425073,0.000049332593,0.00025239956,0.0000049608557,0.00076757977,0.00610669],"genre_scores_gemma":[0.99910045,0.000086354936,0.00069280923,0.000007316592,0.000009230065,0.00002311491,0.000033010914,0.000031937463,0.000015799393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991759,0.00013455108,0.00034792747,0.00010055519,0.000097819444,0.00014325304],"domain_scores_gemma":[0.9991763,0.00015548404,0.00006084614,0.00049638294,0.00007270323,0.00003823857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036499262,0.00013019875,0.0002328519,0.0002179051,0.000014659531,0.000025376348,0.00021833427,0.00007146108,0.00002451396],"category_scores_gemma":[0.00008923792,0.00011969472,0.000036195634,0.00031018135,0.000021262946,0.00012766744,0.000025454534,0.00012465894,0.000023381099],"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.00009714583,0.00036151285,0.06281831,0.00049920654,0.00010258661,0.0000023504656,0.00079553534,0.7314855,0.11630402,0.08428015,0.0013829239,0.0018708069],"study_design_scores_gemma":[0.0003567755,0.00018706902,0.04462265,0.0002296812,0.000003600882,0.0000015689304,0.000011831778,0.93374133,0.020130226,0.000500349,0.000047237,0.00016770621],"about_ca_topic_score_codex":0.0008037708,"about_ca_topic_score_gemma":0.0000712819,"teacher_disagreement_score":0.20225585,"about_ca_system_score_codex":0.00010149225,"about_ca_system_score_gemma":0.000011111494,"threshold_uncertainty_score":0.48810092},"labels":[],"label_agreement":null},{"id":"W2005257110","doi":"10.1109/isit.2007.4557546","title":"M-user Gaussian Interference Channels: To Decode the Interference or To Consider it as Noise","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Interference (communication); Computer science; Gaussian; Channel (broadcasting); Algorithm; Transmission (telecommunications); Noise (video); Gaussian noise; Polynomial; Decoding methods; Simple (philosophy); Iterative method; Interference alignment; Telecommunications; Topology (electrical circuits); Mathematics; MIMO; Artificial intelligence; Physics; Combinatorics","score_opus":0.04245435814667356,"score_gpt":0.32448222483884337,"score_spread":0.28202786669216984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005257110","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.16780172,0.00009036039,0.7103444,0.013492895,0.00045685668,0.0010874545,0.000008281554,0.002104073,0.104614004],"genre_scores_gemma":[0.980335,0.0000387741,0.012362953,0.004998281,0.000046969086,0.00009849136,0.0000018465806,0.0000406043,0.0020770687],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883544,0.000037896672,0.0003748957,0.00022501308,0.00015253607,0.0003741895],"domain_scores_gemma":[0.9982807,0.00032331364,0.000025792016,0.0010413054,0.000104487364,0.000224394],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044173514,0.00021665517,0.00019256125,0.00018136793,0.00007454228,0.00012335312,0.0010684029,0.000093100265,0.001060477],"category_scores_gemma":[0.00021811658,0.00014953827,0.000041366857,0.00039683894,0.000048290123,0.00014908426,0.000419263,0.00030869586,0.0009673662],"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.0006758211,0.00036008455,0.0011698877,0.00021703081,0.00032447328,0.00010340674,0.074947655,0.0042744065,0.06421402,0.12451784,0.59734446,0.13185093],"study_design_scores_gemma":[0.00038653365,0.00047614516,0.0017137532,0.00070980476,0.000024512352,0.00009549837,0.006091579,0.00534359,0.5979628,0.0022799757,0.3835642,0.0013515953],"about_ca_topic_score_codex":0.00020111924,"about_ca_topic_score_gemma":0.0041937036,"teacher_disagreement_score":0.81253326,"about_ca_system_score_codex":0.000099948484,"about_ca_system_score_gemma":0.000026130574,"threshold_uncertainty_score":0.9998527},"labels":[],"label_agreement":null},{"id":"W2005583142","doi":"10.1007/s11277-010-0074-9","title":"Denial of Service Prevention for 5G","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Aalborg Universitet; Federation for the Humanities and Social Sciences","keywords":"Computer science; Denial-of-service attack; Quality of service; Computer network; Wireless; Bandwidth (computing); Usability; Bit error rate; Computer security; Telecommunications; Channel (broadcasting); The Internet","score_opus":0.0346135071362218,"score_gpt":0.30550456676929644,"score_spread":0.27089105963307464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005583142","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.95806956,0.0007126417,0.017629711,0.0044278973,0.0002747189,0.0012056513,0.00019383866,0.0013424185,0.01614354],"genre_scores_gemma":[0.9670219,0.00020167898,0.032087713,0.00006119923,0.000039342118,0.00035074467,0.0001589007,0.00004041156,0.000038124585],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.000049078488,0.00032646794,0.00010678729,0.00013778836,0.00015567344],"domain_scores_gemma":[0.9977573,0.00027992387,0.00008745186,0.0015166121,0.00030323185,0.00005546672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025607966,0.00012907587,0.00018680346,0.00010696847,0.00017191662,0.000023451685,0.0013415999,0.0001412857,0.000032101823],"category_scores_gemma":[0.00003340676,0.00015401517,0.00010673715,0.00026405603,0.00013585931,0.00017043858,0.00010840121,0.0004165616,0.000010790673],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048975016,0.000669373,0.0010292208,0.00064519345,0.0002281044,1.8116329e-7,0.00812649,0.00016110006,0.69019985,0.21910736,0.003188737,0.07659539],"study_design_scores_gemma":[0.0018488775,0.00015532668,0.0057251514,0.00032805683,0.00015927824,0.000030704556,0.0012545484,0.65028197,0.20598412,0.0155182425,0.11749608,0.0012176544],"about_ca_topic_score_codex":0.00006751865,"about_ca_topic_score_gemma":0.0016957856,"teacher_disagreement_score":0.65012085,"about_ca_system_score_codex":0.000027950797,"about_ca_system_score_gemma":0.000048866226,"threshold_uncertainty_score":0.6280557},"labels":[],"label_agreement":null},{"id":"W2005612588","doi":"10.1007/s00220-008-0625-z","title":"Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Additive function; Counterexample; Conjecture; Entropy (arrow of time); Quantum; Complex system","score_opus":0.08423763620704829,"score_gpt":0.3249570072784253,"score_spread":0.24071937107137703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005612588","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.246677,0.00022444993,0.7394397,0.0012669063,0.00004582884,0.0021065194,0.0003510298,0.000597667,0.009290845],"genre_scores_gemma":[0.76053196,0.00012926545,0.23862475,0.00008065507,0.000016450878,0.00052338664,0.00003771625,0.00003336289,0.000022433198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892676,0.0000701691,0.0005014628,0.00013347968,0.00016074463,0.00020736881],"domain_scores_gemma":[0.99592584,0.0011686174,0.000056888355,0.0026032755,0.00015790893,0.00008745076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024977658,0.00015651209,0.00036237817,0.00010988424,0.00008581836,0.000013398618,0.0014032499,0.000068544236,0.000010670631],"category_scores_gemma":[0.0003349759,0.00017634052,0.00008668846,0.00038970093,0.000156376,0.0001097235,0.00044004022,0.00019553423,0.00005503101],"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.000036067537,0.001955339,0.00020388133,0.000704161,0.00009293005,7.729995e-7,0.019098192,0.0014517294,0.01780649,0.9160521,0.026013566,0.016584793],"study_design_scores_gemma":[0.0015020695,0.0003354983,0.0035405878,0.001444125,0.00007673301,0.000014089461,0.00097249023,0.1864051,0.08207706,0.62451553,0.097419515,0.0016971716],"about_ca_topic_score_codex":0.0000059700083,"about_ca_topic_score_gemma":0.000013237847,"teacher_disagreement_score":0.513855,"about_ca_system_score_codex":0.00009858389,"about_ca_system_score_gemma":0.000024630544,"threshold_uncertainty_score":0.71909577},"labels":[],"label_agreement":null},{"id":"W2006333615","doi":"10.1109/tit.2014.2369496","title":"The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Air Force Office of Scientific Research; Wisconsin Alumni Research Foundation","keywords":"Secrecy; Emulation; Decoding methods; Key generation; Key (lock); Information-theoretic security; Channel (broadcasting); Coding (social sciences); Communication source; Information theory","score_opus":0.012116739990175047,"score_gpt":0.21277152135165342,"score_spread":0.20065478136147838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006333615","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.047051456,0.000016322836,0.9432176,0.0002157492,0.00017300519,0.00032826167,0.000033925724,0.0007087708,0.008254925],"genre_scores_gemma":[0.9972731,0.00035483442,0.0018855412,0.00023021616,0.000010372993,0.00014881499,0.000013474229,0.000018842173,0.000064841726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883294,0.00016675456,0.00043701316,0.00009512984,0.00026634726,0.00020180547],"domain_scores_gemma":[0.99871093,0.0003342385,0.00007106568,0.0006948992,0.00010469533,0.00008416811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009984141,0.00018074455,0.00013426649,0.0001631289,0.00040209354,0.00013200783,0.00029612143,0.00012006302,0.000030330328],"category_scores_gemma":[0.000020579713,0.00015581862,0.000061704115,0.00015482641,0.00013176947,0.0008650162,0.000005399261,0.00037238488,0.00005900358],"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.000097424505,0.0000843575,0.000008406981,0.00020557259,0.00011322687,7.366966e-8,0.011709221,0.7291693,0.0007136004,0.11648643,0.00085175637,0.14056061],"study_design_scores_gemma":[0.00036645148,0.000042657313,0.000042649663,0.00003935297,0.000018409299,0.000004712722,0.00038259474,0.93495893,0.012759352,0.043457273,0.0076848017,0.00024279256],"about_ca_topic_score_codex":0.000011908642,"about_ca_topic_score_gemma":0.000017527602,"teacher_disagreement_score":0.9502216,"about_ca_system_score_codex":0.00010745693,"about_ca_system_score_gemma":0.000011525105,"threshold_uncertainty_score":0.6354099},"labels":[],"label_agreement":null},{"id":"W2006502493","doi":"10.1109/tvt.2014.2366911","title":"On the Accuracy of the High-SNR Approximation of the Differential Entropy of Signals in Additive Gaussian Noise: Real and Complex Cases","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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":"Mathematics; Gaussian noise; Additive white Gaussian noise; Rayleigh fading; Taylor's theorem; Transmitter; Gaussian; Algorithm; Signal-to-noise ratio (imaging); Piecewise; Taylor series; Fading; Applied mathematics; White noise; Mathematical analysis; Computer science; Telecommunications; Channel (broadcasting); Statistics; Physics; Decoding methods","score_opus":0.011775196910045324,"score_gpt":0.2277354517383298,"score_spread":0.21596025482828446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006502493","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.94480884,0.000017116521,0.0532603,0.0011767546,0.00005392734,0.00045259212,0.000061450504,0.0001033173,0.000065712506],"genre_scores_gemma":[0.999477,0.00012183426,0.00027379362,0.00001525864,0.0000036795718,0.00008815937,0.000002590218,0.0000150393225,0.0000026167488],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991147,0.00018140374,0.0003222567,0.00011147684,0.0001613149,0.000108852546],"domain_scores_gemma":[0.9986082,0.0004306525,0.00015859227,0.00073541777,0.000056671437,0.000010478276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011824002,0.00012324778,0.00023146022,0.00018834138,0.00007662175,0.0000047774274,0.00046532732,0.00016860156,0.000028062397],"category_scores_gemma":[0.000051238774,0.000075026066,0.00007769492,0.00039361732,0.00041008455,0.000038661474,0.000010156571,0.00038151065,5.22728e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006568136,0.0004569745,0.00012514835,0.00015115562,0.00015528272,6.410205e-7,0.000755835,0.019561904,0.8432132,0.113473535,0.00010936113,0.021931302],"study_design_scores_gemma":[0.00028962782,0.00009235712,0.0038600117,0.00015638875,0.00003256282,0.0000053592944,0.000128545,0.025986785,0.96530193,0.004000851,0.00006428965,0.00008126186],"about_ca_topic_score_codex":0.00011276548,"about_ca_topic_score_gemma":0.00014370136,"teacher_disagreement_score":0.122088775,"about_ca_system_score_codex":0.000034192144,"about_ca_system_score_gemma":0.000010819014,"threshold_uncertainty_score":0.30594742},"labels":[],"label_agreement":null},{"id":"W2006624419","doi":"10.1109/18.923736","title":"Renyi's divergence and entropy rates for finite alphabet Markov sources","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Mathematics; Rényi entropy; Combinatorics; Markov chain; Alphabet; Discrete mathematics; Entropy (arrow of time); Coding theory; Divergence (linguistics); Entropy rate; Statistics; Binary entropy function; Physics; Principle of maximum entropy; Quantum mechanics","score_opus":0.009192276345957163,"score_gpt":0.2380018457705932,"score_spread":0.22880956942463604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006624419","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.03114807,0.00010180569,0.966429,0.00010025858,0.00016511754,0.00028950826,0.00007208103,0.00060153456,0.0010926108],"genre_scores_gemma":[0.9942922,0.0015033096,0.003665615,0.00016842887,0.000013556558,0.00020143352,0.000020916159,0.000014280684,0.00012024085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993854,0.000037551497,0.00027143882,0.000062546795,0.000098677265,0.00014436294],"domain_scores_gemma":[0.9992448,0.00033976798,0.000049272265,0.0002498618,0.000065831846,0.00005043807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319564,0.00012511088,0.00010751145,0.00019609765,0.00019050397,0.00006860011,0.00016207052,0.00007888984,0.0001397189],"category_scores_gemma":[0.000012352509,0.00013043275,0.00005080931,0.00014424404,0.000059697948,0.0009002766,0.0000016528699,0.00014283264,0.000040181152],"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.0007496865,0.00018844087,0.00024399937,0.00055777276,0.000376406,0.0000010493645,0.020998223,0.1428192,0.0033883855,0.044413522,0.0050917435,0.78117156],"study_design_scores_gemma":[0.0023846342,0.00034432157,0.00072259223,0.00024546587,0.00013084571,0.00003518569,0.0026993451,0.4590104,0.27575684,0.0369606,0.220373,0.0013367728],"about_ca_topic_score_codex":0.0000039998004,"about_ca_topic_score_gemma":0.0000038867406,"teacher_disagreement_score":0.9631441,"about_ca_system_score_codex":0.000034831126,"about_ca_system_score_gemma":0.000007451739,"threshold_uncertainty_score":0.53188926},"labels":[],"label_agreement":null},{"id":"W2007194647","doi":"10.1109/icc.2013.6655005","title":"On bi-directional lossy communication of correlated Gaussian sources","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Lossy compression; Gaussian; Algorithm; Coding (social sciences); Channel code; Variable-length code; Theoretical computer science; Decoding methods; Topology (electrical circuits); Mathematics; Statistics; Physics; Artificial intelligence","score_opus":0.007770880904561053,"score_gpt":0.2129624784956996,"score_spread":0.20519159759113856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007194647","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.7789149,0.0005618296,0.0067075077,0.0007396373,0.00008307173,0.00040143327,0.0000057955585,0.0023579434,0.21022788],"genre_scores_gemma":[0.9933119,0.00019683078,0.0059729842,0.000047127378,0.0000055621854,0.000049674196,0.000023286198,0.000019857454,0.0003728019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945474,0.00004477955,0.00022563893,0.00006519161,0.00011915039,0.000090499096],"domain_scores_gemma":[0.9990936,0.00014871333,0.000043514327,0.000602373,0.00007741258,0.00003440317],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000085199754,0.00008800081,0.00011236921,0.00012038389,0.000047075628,0.000021354159,0.00031461366,0.00008648344,0.0009633045],"category_scores_gemma":[0.000020226966,0.0000845732,0.00003576219,0.00017385477,0.000062345796,0.00013871636,0.000047646314,0.00018802006,0.00018496624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041147858,0.0010041359,0.008593622,0.0002962942,0.0005123681,8.78482e-7,0.006246003,0.03311488,0.09023987,0.49140427,0.2885079,0.08003863],"study_design_scores_gemma":[0.0011523362,0.00024484223,0.063335866,0.0005736568,0.00003823458,0.000019950947,0.00079916604,0.36864087,0.4847965,0.049913358,0.029231044,0.0012541781],"about_ca_topic_score_codex":0.00024566642,"about_ca_topic_score_gemma":0.00003129562,"teacher_disagreement_score":0.44149092,"about_ca_system_score_codex":0.000035189998,"about_ca_system_score_gemma":0.000005514703,"threshold_uncertainty_score":0.99994993},"labels":[],"label_agreement":null},{"id":"W2007777576","doi":"10.1109/allerton.2012.6483476","title":"Causal coding of multiple jointly Gaussian sources","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Gaussian; Coding (social sciences); Algorithm; Computer science; Mathematics; Discrete mathematics; Statistics; Physics","score_opus":0.023383742629833865,"score_gpt":0.24702939211342,"score_spread":0.22364564948358615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007777576","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.874902,0.00093228975,0.05150491,0.000102712766,0.00013211272,0.0001610189,0.0000067820624,0.0016730797,0.070585094],"genre_scores_gemma":[0.9869457,0.00007644941,0.012844989,0.000015497048,0.00003246647,0.000009066341,0.0000034742063,0.000018126846,0.000054234617],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995515,0.000016718024,0.00016210618,0.0000384456,0.00007930277,0.00015196075],"domain_scores_gemma":[0.9995513,0.000065628745,0.000022953573,0.00029096496,0.000017549493,0.000051594707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013004051,0.000069368485,0.00010761452,0.0000643728,0.000022543572,0.000007943839,0.00015693874,0.000048258287,0.0001254072],"category_scores_gemma":[0.000022026457,0.00006699174,0.000029563063,0.0000797927,0.000028087992,0.00015750837,0.00005169916,0.00009061418,0.000022192924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012253367,0.00031746703,0.2653652,0.0005596966,0.0001939399,0.0000010882461,0.015270644,0.0010569945,0.5270675,0.15229496,0.018395124,0.01946515],"study_design_scores_gemma":[0.00018300646,0.000014433781,0.019174783,0.000056795547,0.000009362643,0.0000051601596,0.00048198053,0.018668244,0.938934,0.00016386498,0.022051398,0.00025694357],"about_ca_topic_score_codex":0.00005189462,"about_ca_topic_score_gemma":0.000024378542,"teacher_disagreement_score":0.41186655,"about_ca_system_score_codex":0.000019265037,"about_ca_system_score_gemma":0.0000026207892,"threshold_uncertainty_score":0.27318442},"labels":[],"label_agreement":null},{"id":"W2008140930","doi":"10.1109/pimrc.2011.6139697","title":"Neural network based PHY-layer key exchange for wireless communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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","funders":"","keywords":"Computer science; Computer network; Physical layer; PHY; Key (lock); Wireless; Fading; Wireless network; Key exchange; Artificial neural network; Channel (broadcasting); Telecommunications; Computer security; Public-key cryptography; Artificial intelligence; Encryption","score_opus":0.09027512987019112,"score_gpt":0.27901591923584323,"score_spread":0.1887407893656521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008140930","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.05238855,0.0030074054,0.7061798,0.0013825798,0.0005501687,0.0026918058,0.00008391113,0.010658739,0.22305708],"genre_scores_gemma":[0.87770003,0.00016831484,0.12105255,0.00029880783,0.00005016632,0.0005101151,0.00005537586,0.00005652533,0.00010814784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.000041872117,0.0002471063,0.00012230342,0.000081932456,0.0002757032],"domain_scores_gemma":[0.99785376,0.00016895824,0.000039006605,0.0017675842,0.000099766985,0.00007093138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018138903,0.00015654752,0.00017290034,0.00006724801,0.0001361112,0.000026536543,0.0010891743,0.00010303493,0.00019331831],"category_scores_gemma":[0.000007531736,0.00016563016,0.00007624022,0.00019739127,0.000079447986,0.00015372946,0.00015697241,0.00018085181,0.00002236461],"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.00017946356,0.0015795126,0.0111416355,0.0010109682,0.0004571652,0.0000041429853,0.009616893,0.0058476296,0.009441934,0.5448686,0.29448354,0.12136853],"study_design_scores_gemma":[0.00048275408,0.000085071064,0.0015446633,0.000044141434,0.000020103986,0.0000018594749,0.00006840759,0.884609,0.014024544,0.003724266,0.09490172,0.0004934718],"about_ca_topic_score_codex":0.000038551163,"about_ca_topic_score_gemma":0.00018376551,"teacher_disagreement_score":0.87876135,"about_ca_system_score_codex":0.000037678616,"about_ca_system_score_gemma":0.000009310486,"threshold_uncertainty_score":0.67542017},"labels":[],"label_agreement":null},{"id":"W2008141773","doi":"10.1109/icassp.2014.6854692","title":"Secrecy rate maximization for MIMO Gaussian wiretap channels with multiple eavesdroppers via alternating matrix POTDC","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Covariance matrix; MIMO; Maximization; Matrix (chemical analysis); Computer science; Mathematical optimization; Convex optimization; Eigenvalues and eigenvectors; Gaussian; Transmitter; Algorithm; Topology (electrical circuits); Mathematics; Channel (broadcasting); Regular polygon; Telecommunications; Combinatorics; Physics","score_opus":0.00968340622260389,"score_gpt":0.23437149067478955,"score_spread":0.22468808445218566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008141773","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.06721993,0.000042783005,0.9274936,0.00027327635,0.0001011631,0.00053702213,0.0000065340555,0.0014487102,0.0028769984],"genre_scores_gemma":[0.9107024,0.000026424901,0.08857021,0.00008416747,0.00008123268,0.00015787609,0.00006940144,0.00008723577,0.00022104791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990477,0.000055748667,0.0002779419,0.00020578515,0.0001277763,0.00028503244],"domain_scores_gemma":[0.9990774,0.00015381112,0.000074476295,0.00051605416,0.00009114599,0.000087146385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302415,0.00021174362,0.0002156129,0.00013608018,0.00011394861,0.00008922253,0.00033603303,0.00009567202,0.000036738737],"category_scores_gemma":[0.00005031799,0.00019472644,0.0000537341,0.00016524085,0.000032389184,0.00026424817,0.000048045134,0.00013891632,0.000015667772],"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.00028426538,0.00029984783,0.013379808,0.0016544061,0.0006457241,0.0000067047063,0.008231402,0.59406257,0.19600554,0.08373877,0.0033870835,0.09830386],"study_design_scores_gemma":[0.00056542084,0.00006495399,0.00033742865,0.00006286131,0.000012556846,0.0000052197847,0.00006444982,0.93266416,0.062788144,0.0010987474,0.0020352444,0.00030081053],"about_ca_topic_score_codex":0.00010908336,"about_ca_topic_score_gemma":0.000113617534,"teacher_disagreement_score":0.8434825,"about_ca_system_score_codex":0.00006356966,"about_ca_system_score_gemma":0.000008112883,"threshold_uncertainty_score":0.7940714},"labels":[],"label_agreement":null},{"id":"W2009681258","doi":"10.1145/2490428.2490441","title":"Cross-layer coding improves quality and security in wireless video sensor networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless sensor network; Coding (social sciences); Computer network; Wireless; Physical layer; Real-time computing; Telecommunications","score_opus":0.03285245051059991,"score_gpt":0.3195669750335895,"score_spread":0.28671452452298957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009681258","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.9830891,0.0007207735,0.009802263,0.00007268665,0.00010170664,0.0001886423,0.0000036491454,0.0008060143,0.0052151983],"genre_scores_gemma":[0.9973111,0.0005271834,0.0018856885,0.00010356777,0.00007110386,0.00003488715,0.000006034473,0.000031388874,0.000029055565],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99890715,0.000091546266,0.00037417188,0.00014175149,0.000110686546,0.0003747237],"domain_scores_gemma":[0.9991416,0.00021151673,0.0000409542,0.00045738538,0.000036629113,0.00011194546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078185106,0.00016660562,0.00023886976,0.00007870248,0.00005786362,0.00008070782,0.00018928711,0.00017670973,0.00004138382],"category_scores_gemma":[0.000036166617,0.00017287298,0.000034270466,0.00016531245,0.000077922276,0.00049169967,0.00015298887,0.0003749854,0.0000057386005],"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.00004831205,0.0003005578,0.7853573,0.00061360403,0.00009377425,0.0000035387316,0.0068700262,0.0012189271,0.08736507,0.08870065,0.0012680242,0.028160198],"study_design_scores_gemma":[0.00092831644,0.000022527167,0.602256,0.00012356146,0.000012946813,0.000016780928,0.0005189027,0.31148505,0.07842819,0.0010976946,0.00392381,0.001186212],"about_ca_topic_score_codex":0.00021600658,"about_ca_topic_score_gemma":0.0001390684,"teacher_disagreement_score":0.3102661,"about_ca_system_score_codex":0.00007113977,"about_ca_system_score_gemma":0.000004323352,"threshold_uncertainty_score":0.7049556},"labels":[],"label_agreement":null},{"id":"W2010867143","doi":"10.1109/itw.2014.6970788","title":"An efficient code for Adversarial Wiretap channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Adversarial system; Computer science; Code (set theory); Channel (broadcasting); Channel code; Theoretical computer science; Computer security; Computer network; Decoding methods; Telecommunications; Programming language; Artificial intelligence","score_opus":0.013854598793796104,"score_gpt":0.25442991916314533,"score_spread":0.24057532036934923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010867143","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.04408308,0.000025310022,0.9442312,0.00013240804,0.00017132357,0.0002734473,0.000015350268,0.0019245987,0.009143285],"genre_scores_gemma":[0.98136204,0.000007135123,0.018327963,0.00007247185,0.0000838947,0.00006991941,0.000021280395,0.000025983998,0.00002928223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956477,0.000018777988,0.000119649354,0.000091857815,0.000070032715,0.0001349237],"domain_scores_gemma":[0.9993797,0.000059460046,0.000012982605,0.00045910166,0.000037234382,0.000051519874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019507775,0.000079561476,0.00009724912,0.000045661352,0.00004398878,0.00002161004,0.00027460558,0.00006133804,0.000022121783],"category_scores_gemma":[0.000018514924,0.00008068949,0.000034972145,0.000049139067,0.000018504667,0.000053773754,0.000022449567,0.000061889186,0.0000146606435],"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.00007271095,0.00039759334,0.00007287164,0.00025571874,0.00009971251,4.317578e-7,0.005105185,0.6061616,0.03703371,0.28478098,0.02927784,0.03674166],"study_design_scores_gemma":[0.00021483454,0.000040317616,0.000058591035,0.000005836494,0.000004028748,4.1731462e-7,0.000025443549,0.946244,0.028990407,0.00066146965,0.023637436,0.00011718837],"about_ca_topic_score_codex":0.0000085779675,"about_ca_topic_score_gemma":0.000038164304,"teacher_disagreement_score":0.937279,"about_ca_system_score_codex":0.000025465413,"about_ca_system_score_gemma":0.0000036989697,"threshold_uncertainty_score":0.3290422},"labels":[],"label_agreement":null},{"id":"W2011477623","doi":"10.1109/isita.2010.5650100","title":"Secret key establishment over a pair of independent broadcast channels","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Upper and lower bounds; Key (lock); Adversary; Computer science; Alice and Bob; Coding (social sciences); Computer network; Theoretical computer science; Mathematics; Discrete mathematics; Alice (programming language); Computer security; Statistics","score_opus":0.01565796148130744,"score_gpt":0.2501563336831299,"score_spread":0.23449837220182246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011477623","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.84007245,0.0017997137,0.081418484,0.0004885214,0.0025314572,0.0022971903,0.00031557574,0.005748553,0.06532808],"genre_scores_gemma":[0.98673445,0.00058783026,0.011869023,0.00004634751,0.00009878225,0.000211927,0.00013962032,0.00008821792,0.00022382537],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983227,0.00005305618,0.0005989759,0.00031212572,0.00044231804,0.00027077747],"domain_scores_gemma":[0.9975458,0.000066054556,0.00016457705,0.0019611476,0.00014934449,0.00011309933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038486288,0.00037152032,0.0005142667,0.0002863221,0.00002571771,0.00009757307,0.001165614,0.00079325563,0.0007751023],"category_scores_gemma":[0.000029013781,0.00039382506,0.00017804607,0.00011948644,0.00006525354,0.00012102169,0.0015880661,0.0017693749,0.000017130995],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018027554,0.0033411763,0.012230847,0.019126492,0.00418749,0.00009615873,0.051779196,0.20873466,0.16375557,0.10915474,0.2796963,0.14771712],"study_design_scores_gemma":[0.0010855258,0.00011380479,0.003645704,0.00148608,0.00013293789,0.000021784512,0.00037108548,0.21226668,0.54133517,0.014534161,0.222138,0.002869086],"about_ca_topic_score_codex":0.00046641234,"about_ca_topic_score_gemma":0.00013034369,"teacher_disagreement_score":0.37757957,"about_ca_system_score_codex":0.00012647931,"about_ca_system_score_gemma":0.00005921187,"threshold_uncertainty_score":0.99985135},"labels":[],"label_agreement":null},{"id":"W2012009672","doi":"10.1109/isit.2010.5513787","title":"On the secure DoF of the single-antenna MAC","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Coding (social sciences); Secure coding; Computer science; Scheme (mathematics); Dimension (graph theory); Topology (electrical circuits); Antenna (radio); Theoretical computer science; Mathematics; Telecommunications; Computer security; Statistics","score_opus":0.010803472584388608,"score_gpt":0.20048560916929825,"score_spread":0.18968213658490965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012009672","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.8798163,0.000059337926,0.00465025,0.003538309,0.0002539682,0.00029254632,0.000006517131,0.00068965665,0.11069313],"genre_scores_gemma":[0.99906266,0.000013723063,0.0005709767,0.00019864696,0.000012632317,0.000010575306,5.7858114e-7,0.000014199092,0.000116000934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996458,0.000022907298,0.00011123702,0.00004572612,0.000098766795,0.00007550541],"domain_scores_gemma":[0.9989024,0.00014725247,0.000022999737,0.0008821947,0.00003241999,0.000012738691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012325592,0.00006451403,0.000062437924,0.000019668838,0.00003812199,0.000013039229,0.00058197795,0.000056728855,0.00021909396],"category_scores_gemma":[0.00005080697,0.00003314478,0.000046303892,0.00010807712,0.00006671622,0.000027837315,0.00007947896,0.00034046848,0.000010172578],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002618321,0.000056110035,0.0001895815,0.00001609252,0.000022960045,1.5856622e-7,0.000555337,0.00011951181,0.43887788,0.5467424,0.011480439,0.0019369491],"study_design_scores_gemma":[0.00013488739,0.000032420045,0.002769908,0.00006100926,0.0000110326355,0.0000058974606,0.00016001546,0.053208154,0.89729,0.011905581,0.034193605,0.00022749718],"about_ca_topic_score_codex":0.000012232519,"about_ca_topic_score_gemma":0.000107577674,"teacher_disagreement_score":0.53483677,"about_ca_system_score_codex":0.000007688172,"about_ca_system_score_gemma":0.0000034282145,"threshold_uncertainty_score":0.23989253},"labels":[],"label_agreement":null},{"id":"W2015563778","doi":"10.1109/glocomw.2013.6825171","title":"Secure transmission in multi-cell massive MIMO systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Precoding; Telecommunications link; Computer science; Base station; Transmission (telecommunications); Artificial noise; Upper and lower bounds; Antenna (radio); Computer network; Secure transmission; 3G MIMO; Transmitter power output; Topology (electrical circuits); Ergodic theory; Transmitter; Electronic engineering; Telecommunications; Mathematics; Beamforming; Engineering; Electrical engineering","score_opus":0.014555757348272528,"score_gpt":0.22644187961339585,"score_spread":0.21188612226512332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015563778","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.33769855,0.010021225,0.5418197,0.0009779892,0.00029925085,0.0028956176,0.000009474189,0.005606717,0.10067148],"genre_scores_gemma":[0.98405313,0.00030783427,0.015001987,0.000020873924,0.0000069958824,0.00015232954,0.000006230366,0.000026693271,0.0004239154],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994226,0.000036263766,0.00021110284,0.00009431028,0.00008358451,0.00015211302],"domain_scores_gemma":[0.99953574,0.00003490374,0.000016031257,0.00032200842,0.00003460571,0.000056688616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000631836,0.00010800602,0.0001295745,0.0000986614,0.000017101385,0.000039037222,0.0002404265,0.000116943396,0.00017465116],"category_scores_gemma":[0.0000027952692,0.00009935936,0.000027338747,0.000127934,0.000011927511,0.0001746047,0.000022810453,0.00019933503,0.00015222686],"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.0000129568225,0.0012525424,0.004478041,0.002984773,0.00010145537,0.000032920165,0.018567577,0.09294979,0.6782856,0.012319316,0.12455049,0.06446456],"study_design_scores_gemma":[0.00042182262,0.000011796551,0.0007226624,0.00011141623,0.0000025392944,0.0000015916797,0.00048083,0.9413781,0.037939716,0.00007916328,0.018601937,0.0002483995],"about_ca_topic_score_codex":0.00035566793,"about_ca_topic_score_gemma":0.000024633948,"teacher_disagreement_score":0.8484283,"about_ca_system_score_codex":0.00005176806,"about_ca_system_score_gemma":0.000005460433,"threshold_uncertainty_score":0.40517572},"labels":[],"label_agreement":null},{"id":"W2016099553","doi":"10.1109/dcc.2012.34","title":"Prospicient Real-Time Coding of Markov Sources over Burst Erasure Channels: Lossless Case","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Algorithm; Markov process; Encoder; Source code; Markov chain; Lossy compression; Lossless compression; Rate–distortion theory; Data compression; Mathematics; Statistics","score_opus":0.01512948184916092,"score_gpt":0.2481720589761879,"score_spread":0.233042577127027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016099553","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.98061925,0.00046700903,0.002352639,0.000037582366,0.000102497936,0.00025321386,0.000013484726,0.00083375047,0.015320598],"genre_scores_gemma":[0.9957433,0.0001782012,0.0036556805,0.000014358364,0.00006773003,0.00003601031,0.000007407961,0.000037692764,0.00025963303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991439,0.000038245427,0.0002712963,0.00009733164,0.0001722813,0.0002769283],"domain_scores_gemma":[0.9991882,0.00007573401,0.000056085708,0.0005282809,0.000060227845,0.00009148994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035902817,0.00014722232,0.00020942632,0.00010553732,0.0000583206,0.000027199674,0.00022836136,0.00010061956,0.00028644927],"category_scores_gemma":[0.000017135933,0.0001417486,0.000055341934,0.00017988242,0.00005546748,0.00022765867,0.000110911766,0.000139737,0.00002146976],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010959282,0.0023367552,0.08375062,0.0043827384,0.0009862947,0.00025194243,0.07550786,0.008137257,0.646864,0.079128586,0.06814837,0.030395979],"study_design_scores_gemma":[0.0010617143,0.00013251524,0.007321234,0.00064562523,0.00011585253,0.00075420196,0.0020649421,0.15928273,0.8062701,0.0003319937,0.02019987,0.001819188],"about_ca_topic_score_codex":0.00015241091,"about_ca_topic_score_gemma":0.0000106647585,"teacher_disagreement_score":0.15940613,"about_ca_system_score_codex":0.000058847978,"about_ca_system_score_gemma":0.000005927044,"threshold_uncertainty_score":0.57803404},"labels":[],"label_agreement":null},{"id":"W2016512982","doi":"10.1109/icuwb.2012.6340497","title":"A compressive sensing approach for secret key agreement based on UWB channel reciprocity","year":2012,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Secrecy; Computer science; Key (lock); Reciprocity (cultural anthropology); Coding (social sciences); Key-agreement protocol; Channel (broadcasting); Distributed source coding; Channel code; Computer security; Theoretical computer science; Computer network; Algorithm; Decoding methods; Key distribution; Encryption; Mathematics; Public-key cryptography; Statistics","score_opus":0.037599711261938444,"score_gpt":0.2588956509038568,"score_spread":0.22129593964191835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016512982","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.007153079,0.00009870805,0.9455945,0.00012282233,0.00007582844,0.0007197158,0.00001814975,0.00096253015,0.045254674],"genre_scores_gemma":[0.8160695,0.000009433249,0.1833516,0.00024927992,0.00007032088,0.00009242343,0.00007533668,0.000031140808,0.0000509957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919343,0.000043233085,0.00018528187,0.0001252354,0.0001554252,0.00029740037],"domain_scores_gemma":[0.99914676,0.00012553931,0.0000394209,0.00052956026,0.000066129964,0.00009259005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029297866,0.0001596836,0.00017636806,0.00008623717,0.00008361861,0.000026169018,0.00019335319,0.00009743486,0.00002372027],"category_scores_gemma":[0.000026848073,0.00015625646,0.00006679464,0.00009628255,0.000019032357,0.000120431076,0.0000489408,0.0001642991,0.000008744329],"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.00075861806,0.0046535134,0.0025111255,0.005300861,0.0011709172,0.0000050841427,0.03937633,0.37935346,0.07730605,0.09881943,0.2673397,0.12340492],"study_design_scores_gemma":[0.00028510252,0.000030091962,0.00013111318,0.000038205108,0.0000095235355,9.943326e-7,0.00013700889,0.93872285,0.0533177,0.00011985808,0.006981975,0.00022556525],"about_ca_topic_score_codex":0.000017113985,"about_ca_topic_score_gemma":0.0000036444917,"teacher_disagreement_score":0.8089164,"about_ca_system_score_codex":0.00010267254,"about_ca_system_score_gemma":0.0000067712785,"threshold_uncertainty_score":0.63719535},"labels":[],"label_agreement":null},{"id":"W2016853946","doi":"10.1142/s0129167x15500020","title":"Estimates for compression norms and additivity violation in quantum information","year":2015,"lang":"en","type":"article","venue":"International Journal of Mathematics","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Additive function; Tensor product; Entropy (arrow of time); Generalized relative entropy; Quantum; Subspace topology; Hilbert space; Norm (philosophy); Quantum relative entropy","score_opus":0.03020951274825576,"score_gpt":0.2983890131908747,"score_spread":0.2681795004426189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016853946","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.6196662,0.00018971013,0.3789257,0.000240963,0.00029378623,0.00015614029,0.000024256735,0.000062919724,0.00044028138],"genre_scores_gemma":[0.94562066,0.000078539524,0.054220993,0.000015255227,0.000033877415,0.0000068588583,0.00001630234,0.0000067398414,7.942479e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992942,0.000009266862,0.00040863475,0.000021819127,0.00021471345,0.00005133313],"domain_scores_gemma":[0.9991376,0.0001990541,0.00018841396,0.00006699225,0.00037188042,0.000036103644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041344485,0.000060805418,0.00012289695,0.00019411863,0.0000093718745,0.000051725783,0.00018602166,0.000042717875,0.0000028163297],"category_scores_gemma":[0.00024557952,0.00005410489,0.000024199526,0.000038962684,0.000015553316,0.000755128,0.000032945212,0.000099570294,0.0000016784204],"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.0007605685,0.0025356424,0.029649824,0.0030247543,0.0012153201,0.000044923774,0.09129261,0.19768864,0.038883198,0.33393496,0.046147645,0.25482193],"study_design_scores_gemma":[0.00095525844,0.0000613195,0.002299666,0.000438754,0.000010425052,0.00008191317,0.0005146059,0.9369132,0.007883287,0.04777351,0.0029463305,0.000121709105],"about_ca_topic_score_codex":0.0000027141632,"about_ca_topic_score_gemma":0.0000028771933,"teacher_disagreement_score":0.7392246,"about_ca_system_score_codex":0.00008320552,"about_ca_system_score_gemma":0.000016712953,"threshold_uncertainty_score":0.22063334},"labels":[],"label_agreement":null},{"id":"W2016965008","doi":"10.1007/s11122-005-0006-6","title":"Complex random matrices and Rician channel capacity","year":2005,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Wishart distribution; Ergodic theory; Rician fading; Random matrix; Eigenvalues and eigenvectors; Upper and lower bounds; Channel capacity; Invariant (physics); MIMO; Channel (broadcasting); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Statistics; Computer science; Telecommunications","score_opus":0.016782926627893047,"score_gpt":0.21900775510987494,"score_spread":0.2022248284819819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016965008","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.09674445,0.0023025789,0.8665913,0.0014910885,0.000046209905,0.0011566298,0.000040813655,0.0015832996,0.030043636],"genre_scores_gemma":[0.9700763,0.0023271125,0.027482275,0.000040515428,0.0000086273685,0.00002271543,0.00003214627,0.000007696395,0.000002564045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992751,0.000017185974,0.00041950698,0.00004142837,0.00014175165,0.000105068175],"domain_scores_gemma":[0.99961424,0.00003172601,0.00008069494,0.00014923616,0.00006853038,0.00005554452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021492128,0.000099641664,0.00015012492,0.00017239414,0.000058640406,0.00002826315,0.0001490407,0.00007379857,0.000032475476],"category_scores_gemma":[0.0000060386083,0.00009298184,0.000031716503,0.00013719224,0.000035027966,0.0010837377,0.000014637686,0.00011181621,0.0000087249555],"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.00007418008,0.000101784186,0.00018274208,0.0038098192,0.00006446019,7.8820264e-8,0.030992689,0.072416425,0.031401183,0.003951647,0.003527804,0.8534772],"study_design_scores_gemma":[0.0017437018,0.00004565026,0.0016168888,0.00036696324,0.000016421538,0.000007821055,0.00012849682,0.75224364,0.053012688,0.0013816587,0.1891121,0.0003239417],"about_ca_topic_score_codex":0.00002243823,"about_ca_topic_score_gemma":0.0000050578037,"teacher_disagreement_score":0.8733319,"about_ca_system_score_codex":0.000020002628,"about_ca_system_score_gemma":0.000004805305,"threshold_uncertainty_score":0.37916893},"labels":[],"label_agreement":null},{"id":"W2017406705","doi":"10.1049/iet-ifs.2011.0360","title":"Channel level crossing‐based security for communications over fading channels","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Computer science; Channel (broadcasting); Key exchange; Computer network; Wireless; Algorithm; Telecommunications; Public-key cryptography; Encryption","score_opus":0.0412891896859474,"score_gpt":0.2852454945105527,"score_spread":0.24395630482460529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017406705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2354923,0.001102185,0.7082577,0.0058841906,0.0016756434,0.008334348,0.0022054093,0.0097260745,0.027322188],"genre_scores_gemma":[0.9908091,0.000093076895,0.006250603,0.000743938,0.00006631981,0.0012548374,0.0007280626,0.0000421823,0.000011873885],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982188,0.00006582128,0.0008030363,0.00014755098,0.00030906862,0.0004557232],"domain_scores_gemma":[0.99721706,0.0002774488,0.00021893284,0.0015936231,0.0005320921,0.00016085288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051678397,0.00031572697,0.00032162695,0.00032164957,0.0005918062,0.00076986704,0.0011438103,0.00028505357,0.0001303077],"category_scores_gemma":[0.00013232842,0.00036252197,0.0001728915,0.00040286063,0.00021111013,0.0035850776,0.00022526938,0.00046608996,0.00019105838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107676424,0.0010376304,0.00063831336,0.00445787,0.0005473408,8.754948e-7,0.17729038,0.0385385,0.0022629458,0.117902555,0.6293149,0.027900994],"study_design_scores_gemma":[0.00073917105,0.000031348325,0.000556994,0.00009125421,0.000014294214,0.0000028903967,0.00038618373,0.8447101,0.00631013,0.016008645,0.13062806,0.0005208991],"about_ca_topic_score_codex":0.00020471321,"about_ca_topic_score_gemma":0.00003766971,"teacher_disagreement_score":0.8061716,"about_ca_system_score_codex":0.00021050886,"about_ca_system_score_gemma":0.00006753197,"threshold_uncertainty_score":0.9998827},"labels":[],"label_agreement":null},{"id":"W2017526706","doi":"10.1109/iswcs.2011.6125345","title":"Distributed joint source-channel coding of correlated binary sources in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Manitoba","funders":"","keywords":"Puncturing; Distributed source coding; Variable-length code; Computer science; Binary number; Encoder; Source code; Algorithm; Binary symmetric channel; Wireless sensor network; Low-density parity-check code; Coding (social sciences); Channel code; Decoding methods; Block code; Shannon–Fano coding; Theoretical computer science; Mathematics; Computer network; Telecommunications; Statistics; Arithmetic","score_opus":0.02947744578863854,"score_gpt":0.2105372316257204,"score_spread":0.18105978583708188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017526706","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.7632281,0.00022147268,0.23258069,0.000019716868,0.00007120481,0.00020493424,0.00000996293,0.0010985988,0.0025652742],"genre_scores_gemma":[0.9980159,0.00033193812,0.0014872656,0.000013862595,0.0000109917055,0.000022616905,0.00004221739,0.00004366503,0.000031548712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891734,0.000065882,0.0004971815,0.00014266658,0.00011118448,0.00026573628],"domain_scores_gemma":[0.9992476,0.00007757796,0.00008464839,0.00046634587,0.00006040897,0.00006337857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022467798,0.00017895015,0.00031637214,0.00019597769,0.000035588808,0.000011262237,0.0002984244,0.0001956903,0.000089120535],"category_scores_gemma":[0.000018193941,0.00018600277,0.000065447784,0.00040848195,0.00008098745,0.00010897579,0.00013732362,0.0003589618,0.000007264958],"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.0003201366,0.001668493,0.060582634,0.0010739528,0.0006774238,0.00011939227,0.038712032,0.7699646,0.08607933,0.018111333,0.008899646,0.01379107],"study_design_scores_gemma":[0.00029525466,0.000037141,0.007444272,0.00021292437,0.000010638106,0.00000722611,0.0008188352,0.9488728,0.04178529,0.000120213874,0.00010714393,0.00028823485],"about_ca_topic_score_codex":0.00028364494,"about_ca_topic_score_gemma":0.000046736473,"teacher_disagreement_score":0.23478775,"about_ca_system_score_codex":0.00005804903,"about_ca_system_score_gemma":0.0000068897025,"threshold_uncertainty_score":0.7584973},"labels":[],"label_agreement":null},{"id":"W2019869643","doi":"10.1049/iet-com.2012.0079","title":"Secure joint source–channel coding with interference known at the transmitter","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Transmitter; Computer science; Coding (social sciences); Gaussian; Channel (broadcasting); Decoding methods; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Physics","score_opus":0.03877616781752802,"score_gpt":0.2510152643250929,"score_spread":0.2122390965075649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019869643","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.26783904,0.027620826,0.526403,0.036215708,0.000444353,0.0024463164,0.0001440098,0.006599991,0.13228676],"genre_scores_gemma":[0.9933985,0.0013620447,0.004357047,0.0002555415,0.000035451376,0.00026443583,0.00004616674,0.00005152469,0.00022931358],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906313,0.00015702248,0.00026030265,0.00009415012,0.00013313472,0.00029224245],"domain_scores_gemma":[0.99653244,0.0002351643,0.000056177814,0.00301862,0.00007260766,0.00008497818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030907642,0.00017691188,0.00016018038,0.0000694882,0.0004208357,0.00005334026,0.0014786455,0.000083998326,0.00010472707],"category_scores_gemma":[0.000013882067,0.00013311316,0.00006445489,0.00023754194,0.00026384063,0.0002534409,0.00047285602,0.0005708554,0.00011043689],"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.00012868864,0.0022071057,0.013583842,0.00079269474,0.0018583937,0.0000027492317,0.42632514,0.008984586,0.07417793,0.1383214,0.23604287,0.0975746],"study_design_scores_gemma":[0.0007491411,0.00009176172,0.0064693466,0.00062955316,0.00016515158,0.0001317984,0.0039347694,0.0610465,0.03885987,0.0010418101,0.88554054,0.00133975],"about_ca_topic_score_codex":0.000035446377,"about_ca_topic_score_gemma":0.00032129674,"teacher_disagreement_score":0.7255594,"about_ca_system_score_codex":0.00011617279,"about_ca_system_score_gemma":0.000011057651,"threshold_uncertainty_score":0.54281974},"labels":[],"label_agreement":null},{"id":"W2020175615","doi":"10.1049/iet-com.2014.0534","title":"Physical layer security of multiple‐input–multiple‐output systems with transmit beamforming in Rayleigh fading","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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","funders":"","keywords":"Rayleigh fading; Fading; Physical layer; Beamforming; Computer science; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.047980743773450754,"score_gpt":0.274168628319796,"score_spread":0.22618788454634525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020175615","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.95623624,0.0027349726,0.025444197,0.000686301,0.0000940693,0.0012648834,0.00012791097,0.0013566249,0.012054798],"genre_scores_gemma":[0.9867482,0.0003275189,0.012450968,0.000012767686,0.00003072939,0.000281607,0.00007458679,0.00006296671,0.000010658186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848175,0.00021669094,0.00054072216,0.00017482546,0.00029661105,0.00028940922],"domain_scores_gemma":[0.996253,0.00066490285,0.00011606183,0.0026181834,0.00021843823,0.00012940861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469169,0.00024047252,0.00044542868,0.00024322301,0.000097805896,0.00004497294,0.0015864732,0.00013125564,0.000001358152],"category_scores_gemma":[0.00009723458,0.00024419194,0.000080039616,0.00059192115,0.00021127523,0.00039654877,0.00024156157,0.00063969294,0.0000091803395],"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.00032161805,0.004119823,0.16023704,0.0020151206,0.0010121294,0.00001797907,0.27314994,0.41966558,0.049083203,0.06752311,0.0034796533,0.019374799],"study_design_scores_gemma":[0.0017353643,0.00008958144,0.0016381367,0.0005971096,0.000045398385,0.000017033239,0.0030870643,0.9636459,0.0116431555,0.0008321575,0.01605932,0.0006097991],"about_ca_topic_score_codex":0.0007238991,"about_ca_topic_score_gemma":0.0012304119,"teacher_disagreement_score":0.5439803,"about_ca_system_score_codex":0.00019196262,"about_ca_system_score_gemma":0.000056874804,"threshold_uncertainty_score":0.9957858},"labels":[],"label_agreement":null},{"id":"W2021630594","doi":"10.1109/tit.2015.2414434","title":"On the Capacity Region of the Broadcast, the Interference, and the Cognitive Radio Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Interference (communication); Decoding methods; Computer science; Channel (broadcasting); Cognitive radio; Topology (electrical circuits); Noise (video); Channel capacity; Gaussian; Computer network; Telecommunications; Mathematics; Wireless; Physics; Artificial intelligence","score_opus":0.02625614296765145,"score_gpt":0.21775804943482716,"score_spread":0.19150190646717571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021630594","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.086849704,0.00008802119,0.895846,0.0022371372,0.0004932443,0.0010309584,0.000040319876,0.0002377066,0.013176889],"genre_scores_gemma":[0.99908036,0.00014338313,0.000018664516,0.0005213356,0.000012350571,0.00016729168,0.0000012350871,0.000008941316,0.000046410863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897987,0.00040056932,0.00027650548,0.000048555237,0.00019488581,0.00009960047],"domain_scores_gemma":[0.9980576,0.001144142,0.00011101275,0.0005246502,0.00013597886,0.00002659118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822539,0.00012353604,0.00011294944,0.00007530452,0.00027008014,0.00006257007,0.0004457411,0.00006627388,0.000014692117],"category_scores_gemma":[0.00006825337,0.000055103646,0.000075626725,0.00022802754,0.00056998426,0.00036748179,0.0000056985423,0.00048665766,0.000017665203],"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.0009404232,0.00009921826,0.0000035909127,0.000086822256,0.00031985543,1.6216967e-7,0.15345104,0.039761417,0.000063378924,0.7011225,0.004570009,0.09958157],"study_design_scores_gemma":[0.007596801,0.00058040326,0.00032425075,0.0016669229,0.00044251897,0.00023153413,0.06486979,0.28281513,0.2626543,0.3611121,0.0164463,0.0012599496],"about_ca_topic_score_codex":0.00002126297,"about_ca_topic_score_gemma":0.0000067634633,"teacher_disagreement_score":0.9122307,"about_ca_system_score_codex":0.000045601264,"about_ca_system_score_gemma":0.000019218967,"threshold_uncertainty_score":0.22470614},"labels":[],"label_agreement":null},{"id":"W2021959691","doi":"10.48550/arxiv.1303.0572","title":"New Non-asymptotic Random Channel Coding Theorems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Mathematics; Code word; Discrete mathematics; Combinatorics; Applied mathematics; Decoding methods; Algorithm","score_opus":0.04084625595855619,"score_gpt":0.17502298044691036,"score_spread":0.13417672448835416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021959691","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.18180573,0.00031205048,0.79057556,0.00006369506,0.00062497944,0.00087264396,0.000018254643,0.0022997807,0.023427278],"genre_scores_gemma":[0.9955661,0.001991452,0.0011230091,0.000030487585,0.00012302074,0.000005150347,0.00004382079,0.00008797867,0.0010289585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869555,0.00008373225,0.00026505333,0.0004996714,0.00008261362,0.00037339653],"domain_scores_gemma":[0.99784756,0.00015362941,0.0001309697,0.0015430262,0.000104079365,0.00022075117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019844792,0.00042598264,0.0005034853,0.0003251125,0.00010116625,0.00010729428,0.0014905495,0.00047759834,0.00021115084],"category_scores_gemma":[0.000023180262,0.00052577315,0.00023934172,0.00031529702,0.00008379591,0.00025080322,0.0009818585,0.0009842105,0.00027649553],"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.00006091494,0.00007242437,0.00039557228,0.0005280744,0.0005155028,0.00007173109,0.0016303924,0.8396871,0.0007943749,0.13983464,0.014766646,0.001642645],"study_design_scores_gemma":[0.0012262772,0.000019888363,0.00027062264,0.00043744734,0.00012095417,0.000003909123,0.00013420449,0.9143747,0.002383343,0.07890346,0.0012058283,0.0009193379],"about_ca_topic_score_codex":0.00037752555,"about_ca_topic_score_gemma":0.000034628432,"teacher_disagreement_score":0.8137604,"about_ca_system_score_codex":0.00027589974,"about_ca_system_score_gemma":0.000072926625,"threshold_uncertainty_score":0.9997194},"labels":[],"label_agreement":null},{"id":"W2022804642","doi":"10.1109/iccchina.2013.6671205","title":"Towards secure communications in cooperative cognitive radio networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Cognitive radio; Secrecy; Computer science; Relay; Computer network; Transmitter power output; Jamming; Bandwidth (computing); Transmission (telecommunications); Transmitter; Telecommunications; Power (physics); Computer security; Wireless","score_opus":0.020028209970835965,"score_gpt":0.26884876140369957,"score_spread":0.2488205514328636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022804642","genre_codex":"other","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.11639975,0.0063096234,0.31736395,0.0034249518,0.00015661027,0.0028219854,0.00002819343,0.0044402,0.54905474],"genre_scores_gemma":[0.9908405,0.0016097418,0.0066967453,0.00019835678,0.000014644445,0.00045677056,0.0000577872,0.00002875765,0.000096714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992882,0.00010096225,0.0002441449,0.00010260786,0.00007633891,0.00018773066],"domain_scores_gemma":[0.998893,0.00016831938,0.000020208669,0.00071850873,0.0001432929,0.000056667104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116282856,0.00013465095,0.00016941663,0.00010122059,0.000057586298,0.00006314402,0.00058573554,0.00011561755,0.000458973],"category_scores_gemma":[0.00003150331,0.00013619661,0.000030181658,0.00034666073,0.00010557333,0.00031160715,0.00018535378,0.00044360367,0.000103238286],"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.000030125548,0.0012583086,0.0129326675,0.00018369766,0.0006747478,0.000012836886,0.031736284,0.05987114,0.0038507937,0.40586242,0.19635914,0.28722784],"study_design_scores_gemma":[0.00054554216,0.000034928253,0.012302468,0.00014839276,0.000010015758,0.000006361557,0.0015986601,0.9728273,0.0032415274,0.0013736474,0.0074026184,0.0005085507],"about_ca_topic_score_codex":0.00029551415,"about_ca_topic_score_gemma":0.0005074897,"teacher_disagreement_score":0.9129561,"about_ca_system_score_codex":0.00007881393,"about_ca_system_score_gemma":0.000016049835,"threshold_uncertainty_score":0.5553937},"labels":[],"label_agreement":null},{"id":"W2023079682","doi":"10.1117/12.840314","title":"Dynamic algorithm for correlation noise estimation in distributed video coding","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Algorithm; Encoder; Coding (social sciences); Motion estimation; Pixel; Noise (video); Variance (accounting); Decoding methods; Artificial intelligence; Mathematics; Statistics; Image (mathematics)","score_opus":0.008402697376755202,"score_gpt":0.23925688619364255,"score_spread":0.23085418881688735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023079682","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.9540292,0.00012268209,0.042559125,0.0012454708,0.00014790971,0.00097024755,0.00012553466,0.0003651088,0.00043474807],"genre_scores_gemma":[0.6093303,0.00014643297,0.3900695,0.00003446033,0.000054330674,0.00022282002,0.00008011542,0.000046755507,0.000015282261],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817634,1.900702e-8,0.0007976501,0.00026909565,0.0004147028,0.00034219428],"domain_scores_gemma":[0.99848324,0.00019462868,0.00025526906,0.000082626284,0.0009075681,0.00007667003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058749464,0.00029280188,0.00038831023,0.00017904359,0.00006760171,0.00009794074,0.0007780322,0.00023820356,0.0000030558476],"category_scores_gemma":[0.00040007907,0.00029574873,0.0003642023,0.0004295054,0.00008929491,0.0007154461,0.00006490836,0.00034059148,7.2034624e-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.00007710742,0.00023120549,0.00016323575,0.00066231703,0.00026591815,8.958664e-8,0.0005285362,0.019400863,0.5047833,0.4535964,0.0029428985,0.017348118],"study_design_scores_gemma":[0.00075846195,0.0001306999,0.0012903834,0.00033307305,0.000052103154,0.0000049337923,0.00023933568,0.9544264,0.037989374,0.003945742,0.0005524444,0.0002770391],"about_ca_topic_score_codex":0.0000041415306,"about_ca_topic_score_gemma":3.0915965e-7,"teacher_disagreement_score":0.9350256,"about_ca_system_score_codex":0.00039941416,"about_ca_system_score_gemma":0.000017487695,"threshold_uncertainty_score":0.99994946},"labels":[],"label_agreement":null},{"id":"W2024304958","doi":"10.1109/jsac.2013.131130","title":"Cooperative Spectrum Access Towards Secure Information Transfer for CRNs","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":143,"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; Relay; Computer network; Secrecy; Transmission (telecommunications); Secure transmission; Beamforming; Jamming; Cognitive radio; Computer security; Power (physics); Telecommunications; Wireless","score_opus":0.030423715984027086,"score_gpt":0.29916438916850957,"score_spread":0.26874067318448247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024304958","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.40334606,0.0014866112,0.51881915,0.03248425,0.00097612623,0.00644232,0.00036074375,0.0028903936,0.033194352],"genre_scores_gemma":[0.99153006,0.0026553927,0.004568822,0.00037956398,0.000059654372,0.000631863,0.000115587136,0.000041020005,0.000018063472],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998439,0.00020325677,0.0007145839,0.00009627716,0.00022233323,0.00032451138],"domain_scores_gemma":[0.99758923,0.00035179014,0.000086405205,0.0011513103,0.0006966974,0.00012455694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042699,0.00023322106,0.00027750913,0.0005207417,0.0003392018,0.00047532513,0.002028576,0.00017476724,0.000113310496],"category_scores_gemma":[0.00013575301,0.00023238655,0.00008783256,0.00091475487,0.00007908342,0.002010497,0.00007140997,0.0012093842,0.00004591867],"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.00048316485,0.00420074,0.0041177943,0.0007234451,0.0019870237,0.00000799416,0.057999946,0.23504719,0.02722047,0.14482047,0.31782353,0.20556822],"study_design_scores_gemma":[0.0057800342,0.0008963029,0.041812237,0.0013529827,0.0001329621,0.000278668,0.0014323429,0.5650505,0.10005555,0.029251087,0.25119582,0.0027615058],"about_ca_topic_score_codex":0.00006316319,"about_ca_topic_score_gemma":0.0003415482,"teacher_disagreement_score":0.58818394,"about_ca_system_score_codex":0.0003619783,"about_ca_system_score_gemma":0.00013833784,"threshold_uncertainty_score":0.9476448},"labels":[],"label_agreement":null},{"id":"W2024747068","doi":"10.1109/isit.2008.4594960","title":"Capacity of the discrete-time non-coherent memoryless Gaussian channels at low SNR","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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; Polytechnique Montréal","funders":"","keywords":"Coherence (philosophical gambling strategy); Coherence time; Transmitter; Channel (broadcasting); Channel capacity; Topology (electrical circuits); Gaussian; Signal-to-noise ratio (imaging); Computer science; Mathematics; Algorithm; Telecommunications; Physics; Statistics; Combinatorics","score_opus":0.01663088005052649,"score_gpt":0.2159666508385651,"score_spread":0.1993357707880386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024747068","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.9748343,0.00005100709,0.002498027,0.000244692,0.00010785799,0.00033490828,0.000014307469,0.00044241842,0.021472456],"genre_scores_gemma":[0.9978556,0.00006959293,0.0009688154,0.000034987566,0.000025392897,0.000039963114,0.0000050208873,0.00003036804,0.0009702646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920183,0.000042659834,0.00025202063,0.00011472392,0.00020561834,0.00018316643],"domain_scores_gemma":[0.99885285,0.000039081973,0.000051696086,0.0009609818,0.000039450548,0.00005591326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095663854,0.00014795458,0.00021674007,0.000045010263,0.000108166154,0.000008300311,0.00061772455,0.00008948005,0.00033886204],"category_scores_gemma":[0.000010283802,0.00010820397,0.000102712875,0.00016658996,0.00015402432,0.00009257116,0.00022685742,0.00017785256,0.0000615366],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000382382,0.00052962126,0.008306164,0.00074252364,0.00037711122,0.000010619046,0.023218025,0.011847884,0.8736222,0.005683544,0.07331915,0.0023049163],"study_design_scores_gemma":[0.00018943443,0.000015348172,0.0071616857,0.000082444094,0.000007874034,0.000015236319,0.00004014141,0.030121671,0.960795,0.00016656797,0.0011658982,0.00023872129],"about_ca_topic_score_codex":0.0000914198,"about_ca_topic_score_gemma":0.00005223897,"teacher_disagreement_score":0.08717278,"about_ca_system_score_codex":0.00009372157,"about_ca_system_score_gemma":0.000010201079,"threshold_uncertainty_score":0.44124296},"labels":[],"label_agreement":null},{"id":"W2025952794","doi":"10.1109/spawc.2013.6612135","title":"Secure key agreement over reciprocal fading channels in the low SNR regime","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Fading; Upper and lower bounds; Computer science; Channel (broadcasting); Coherence time; Reciprocal; Key (lock); Transmission (telecommunications); Coherence (philosophical gambling strategy); Block (permutation group theory); Scaling; Channel capacity; Topology (electrical circuits); Theoretical computer science; Algorithm; Telecommunications; Mathematics; Combinatorics; Statistics; Computer security","score_opus":0.013557148156793476,"score_gpt":0.2340301712744029,"score_spread":0.2204730231176094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025952794","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.8182439,0.0005658148,0.016924549,0.0041770367,0.00022238099,0.0015058726,0.0000028965658,0.0013629892,0.15699455],"genre_scores_gemma":[0.99685806,0.00013967097,0.0019397461,0.00043776064,0.000046388126,0.00022764115,0.00000585671,0.000020307309,0.0003245872],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992277,0.000052717925,0.00020990038,0.00011348151,0.00018011038,0.00021607913],"domain_scores_gemma":[0.9992457,0.00007518851,0.000021310398,0.0005955528,0.000029046581,0.000033227636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000246811,0.00012521271,0.00011862913,0.000085939064,0.00003773101,0.00007951506,0.00052325823,0.000089782436,0.0008165704],"category_scores_gemma":[0.000015832431,0.00009420734,0.00003726016,0.00020642778,0.000023358138,0.00023547228,0.00008436659,0.00028591967,0.0002582602],"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.000013544289,0.0004732807,0.0025200893,0.00044745347,0.0001612802,0.000022679662,0.06471526,0.008516206,0.024848772,0.105475485,0.75170606,0.0410999],"study_design_scores_gemma":[0.0017189296,0.00019048709,0.016109293,0.00086639565,0.000026284908,0.0000401586,0.0049233637,0.54907644,0.101957746,0.028775403,0.2941024,0.0022131363],"about_ca_topic_score_codex":0.0001793067,"about_ca_topic_score_gemma":0.00007217016,"teacher_disagreement_score":0.5405602,"about_ca_system_score_codex":0.000073291456,"about_ca_system_score_gemma":0.000004901819,"threshold_uncertainty_score":0.8940874},"labels":[],"label_agreement":null},{"id":"W2026964900","doi":"10.1109/3pgcic.2012.62","title":"Secret Key Generation within Peer-to-Peer Network Overlays","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Victoria","funders":"","keywords":"Computer science; Peer-to-peer; Computer network; Key (lock); Overlay network; Key generation; Reciprocity (cultural anthropology); Wireless; Distributed computing; Network topology; Adversary; Wireless network; Computer security; Telecommunications; Encryption; World Wide Web; The Internet","score_opus":0.029136156039335916,"score_gpt":0.25997528337799536,"score_spread":0.23083912733865944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026964900","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.41791597,0.000769174,0.41243562,0.0025483014,0.0014587999,0.0006626629,0.000014193294,0.005177566,0.1590177],"genre_scores_gemma":[0.91211736,0.00001927204,0.08518144,0.00044947056,0.0005786336,0.000051016003,0.0000627733,0.000041041272,0.0014990113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908537,0.000037105023,0.00021697365,0.000091142094,0.00029246561,0.0002769388],"domain_scores_gemma":[0.9991455,0.000029955696,0.000022841825,0.00054006954,0.00012701891,0.00013460075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056035654,0.00012980022,0.00012184328,0.000054380474,0.00006440497,0.000055251672,0.00023352436,0.00010441628,0.0002678614],"category_scores_gemma":[0.000048171074,0.00013302962,0.000032614433,0.00019808659,0.000011200032,0.0002977116,0.00007793524,0.00018133494,0.00023063374],"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.000003486326,0.000038401784,0.0035383624,0.000018719722,0.000042181047,4.1795033e-7,0.0041512107,0.057669044,0.01628369,0.09777115,0.8181261,0.0023572657],"study_design_scores_gemma":[0.00017489784,0.000031831092,0.003577726,0.000027781849,0.00001673832,0.000008816775,0.00011374083,0.23276292,0.07198777,0.00059462903,0.6900613,0.0006418709],"about_ca_topic_score_codex":0.000029059067,"about_ca_topic_score_gemma":0.00007632433,"teacher_disagreement_score":0.49420136,"about_ca_system_score_codex":0.00007196676,"about_ca_system_score_gemma":0.000006919296,"threshold_uncertainty_score":0.54247904},"labels":[],"label_agreement":null},{"id":"W2027074016","doi":"10.1109/wcnc.2013.6554818","title":"Cooperative networking towards secure communications for CRNs","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Relay; Secrecy; Computer science; Computer network; Beamforming; Jamming; Transmission (telecommunications); Cognitive radio; Scheme (mathematics); Secure transmission; Power (physics); Telecommunications; Wireless; Computer security","score_opus":0.03149038562475051,"score_gpt":0.2745111581986087,"score_spread":0.2430207725738582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027074016","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.01035949,0.0032616328,0.7051595,0.006903995,0.0003205997,0.0030631493,0.000039702463,0.0061839214,0.26470804],"genre_scores_gemma":[0.9171846,0.0006500401,0.0806437,0.0002401687,0.000054892953,0.0009110414,0.00005513144,0.00003508116,0.00022538126],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994463,0.00003180073,0.00019853291,0.000085150765,0.00006252889,0.00017569354],"domain_scores_gemma":[0.9986035,0.00013876842,0.00002109229,0.0010099142,0.00017613781,0.000050555827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010010639,0.000113754046,0.00013215173,0.00004828682,0.00013452406,0.00008567149,0.0006950777,0.00008144125,0.00016000119],"category_scores_gemma":[0.000016219085,0.00011178603,0.000047110567,0.00014861823,0.000056547084,0.0002237396,0.0001548714,0.00017485472,0.000054679957],"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.0000046585055,0.00016866258,0.00034296783,0.00014121554,0.0002659873,2.3984373e-7,0.006152191,0.0037137058,0.009021746,0.32408604,0.4603932,0.19570939],"study_design_scores_gemma":[0.00021495,0.000030683594,0.00030472403,0.000043649812,0.000011077568,0.0000020691166,0.0003813207,0.55314606,0.0073935254,0.0048478427,0.43328518,0.00033892333],"about_ca_topic_score_codex":0.000071091425,"about_ca_topic_score_gemma":0.00011374088,"teacher_disagreement_score":0.90682507,"about_ca_system_score_codex":0.00004997848,"about_ca_system_score_gemma":0.000013348016,"threshold_uncertainty_score":0.45585018},"labels":[],"label_agreement":null},{"id":"W2027121408","doi":"10.1109/tit.2013.2245397","title":"Vector Gaussian Two-Terminal Source Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Upper and lower bounds; Mathematics; Terminal (telecommunication); Coding (social sciences); Algorithm; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Telecommunications; Statistics; Physics","score_opus":0.007738102270047929,"score_gpt":0.22013845442741542,"score_spread":0.2124003521573675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027121408","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.013427773,0.000015234393,0.96757084,0.0001046728,0.00023805628,0.00028745958,0.000011865861,0.0014573789,0.016886692],"genre_scores_gemma":[0.997564,0.000062372914,0.0017428264,0.00021750986,0.000020107223,0.00022250637,0.000009275113,0.000021574395,0.0001398129],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992159,0.00005552191,0.00033239974,0.00005928911,0.00015675681,0.0001801465],"domain_scores_gemma":[0.9992895,0.00011595658,0.000052444735,0.0004024212,0.00006416274,0.00007551501],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018810225,0.0001474557,0.00011607175,0.00026466683,0.00016342851,0.00012284228,0.00024784775,0.00008218203,0.00075228553],"category_scores_gemma":[0.0000042237184,0.00015473769,0.000069056485,0.00017664152,0.000053092197,0.0016221906,0.0000014395961,0.00031653309,0.0013421575],"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.000038694463,0.00008849844,0.0000058892747,0.00019258496,0.00011166878,6.381253e-7,0.009371013,0.06680826,0.0057880217,0.035231236,0.0021405907,0.8802229],"study_design_scores_gemma":[0.0022537878,0.00022366756,0.0007629992,0.0004384188,0.000096140466,0.00014159494,0.004839679,0.43713164,0.47798592,0.010681882,0.06348134,0.001962902],"about_ca_topic_score_codex":0.000015912039,"about_ca_topic_score_gemma":0.000003779648,"teacher_disagreement_score":0.9841362,"about_ca_system_score_codex":0.00009930568,"about_ca_system_score_gemma":0.000011720442,"threshold_uncertainty_score":0.9994354},"labels":[],"label_agreement":null},{"id":"W2027174613","doi":"10.1109/isit.2013.6620229","title":"Codes for limited view adversarial channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Code word; Adversarial system; Computer science; Probabilistic logic; Channel (broadcasting); Code (set theory); Theoretical computer science; Artificial intelligence; Algorithm; Decoding methods; Programming language; Computer network","score_opus":0.02057256719458495,"score_gpt":0.24751296796361846,"score_spread":0.22694040076903352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027174613","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.0858064,0.0015889108,0.81559795,0.0030925402,0.00094865443,0.003909538,0.000032295215,0.011300399,0.077723294],"genre_scores_gemma":[0.97083515,0.00015850073,0.028120259,0.00014871015,0.000064323256,0.0004278768,0.000020909683,0.000024464745,0.00019983367],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962324,0.000010036472,0.0001295584,0.000063812004,0.00004865283,0.00012468357],"domain_scores_gemma":[0.99951565,0.00008344663,0.000011519881,0.00029084284,0.00006264013,0.00003592623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006217076,0.00007629487,0.00010648907,0.000045104433,0.000028884506,0.00003865678,0.0002072454,0.000060870574,0.00030690985],"category_scores_gemma":[0.000020632564,0.00007347669,0.000039218146,0.00007040966,0.000014603544,0.00015610775,0.000032631084,0.000058493435,0.000113582544],"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.000017414906,0.0001761171,0.00012827422,0.00062159525,0.00027640504,5.773026e-7,0.002102712,0.0032844876,0.06902576,0.15466104,0.51612115,0.25358444],"study_design_scores_gemma":[0.00056791044,0.000057728965,0.00018115246,0.0000596583,0.000014672059,0.0000019447546,0.00010782465,0.35259926,0.12051275,0.009197582,0.51625276,0.00044679103],"about_ca_topic_score_codex":0.00003746247,"about_ca_topic_score_gemma":0.000008156127,"teacher_disagreement_score":0.8850287,"about_ca_system_score_codex":0.000020362162,"about_ca_system_score_gemma":0.0000034546035,"threshold_uncertainty_score":0.33604476},"labels":[],"label_agreement":null},{"id":"W2030280887","doi":"10.1109/aina.2014.60","title":"Channel Estimation for Secret Key Generation","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Key (lock); Computer science; Key generation; Channel (broadcasting); Quantization (signal processing); Algorithm; Wireless; Mutual information; Kalman filter; Upper and lower bounds; Vector quantization; Additive white Gaussian noise; Theoretical computer science; Decoding methods; Telecommunications; Mathematics; Cryptography; Artificial intelligence; Computer security","score_opus":0.022949773705493958,"score_gpt":0.2471325750335955,"score_spread":0.22418280132810156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030280887","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.00878569,0.000024530023,0.98376745,0.00020335698,0.00006373972,0.00017061441,0.000002207049,0.0009795077,0.0060029067],"genre_scores_gemma":[0.8991781,0.000016477805,0.10037795,0.00007655927,0.000067717265,0.000114770126,0.00008813608,0.000016292133,0.00006403805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997119,0.000011402778,0.00010351026,0.000055822286,0.000046249465,0.00007116537],"domain_scores_gemma":[0.99967206,0.000034077697,0.000012597294,0.000223767,0.000037487815,0.0000200012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001375316,0.00005468554,0.00005821351,0.000041192663,0.000037095968,0.000025559943,0.000093500814,0.000047319027,0.000016571883],"category_scores_gemma":[0.00003091983,0.00005770873,0.000019246612,0.00004138577,0.0000062400954,0.0001151544,0.000010796073,0.000035787907,0.000014853481],"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.000005690202,0.000048526443,0.000022834984,0.00021838113,0.00004097873,6.092436e-8,0.001645111,0.31366363,0.072402544,0.37640354,0.10028489,0.1352638],"study_design_scores_gemma":[0.000067311055,0.000011571415,0.000022122491,0.0000037911066,0.000002006593,3.4507363e-7,0.000003977465,0.9216596,0.06331266,0.002796222,0.012052467,0.00006795348],"about_ca_topic_score_codex":0.0000044094227,"about_ca_topic_score_gemma":0.000017489076,"teacher_disagreement_score":0.89039236,"about_ca_system_score_codex":0.000020795671,"about_ca_system_score_gemma":0.0000021070894,"threshold_uncertainty_score":0.23532936},"labels":[],"label_agreement":null},{"id":"W2030367715","doi":"10.1109/icecs.2014.7050087","title":"Side information generation using optical flow and block matching in Wyner-Ziv video coding","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Motion interpolation; Residual frame; Optical flow; Algorithm; Coding (social sciences); Codec; Motion estimation; Reference frame; Motion compensation; Image warping; Decoding methods; Block-matching algorithm; Computer vision; Mathematics; Frame (networking); Video processing; Video tracking; Telecommunications","score_opus":0.016574558461108464,"score_gpt":0.23538381858216645,"score_spread":0.21880926012105797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030367715","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.595088,0.000021051923,0.40118054,0.00007973351,0.00003292599,0.000085524145,5.11258e-7,0.00030873637,0.0032029655],"genre_scores_gemma":[0.88453287,0.000043213047,0.11527827,0.00008189402,0.000032882857,0.000007974825,0.000010523673,0.000010353752,0.0000019980694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.00003012418,0.0002660945,0.00006310087,0.00009475246,0.00012001285],"domain_scores_gemma":[0.9996601,0.00006225968,0.00002292691,0.00019279185,0.000026533924,0.00003538368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030082228,0.00008826705,0.000107112806,0.00014352727,0.000051175906,0.00010605299,0.00008526781,0.00007736605,0.0000058038495],"category_scores_gemma":[0.000045537134,0.000096189455,0.000012932289,0.00009866456,0.000014516774,0.0007321676,0.000055765522,0.00014793458,0.0000059514896],"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.000005795072,0.00002563348,0.00083676266,0.0001963621,0.00001939601,8.5892077e-7,0.004323477,0.5513751,0.29360202,0.0637284,0.00057075813,0.085315466],"study_design_scores_gemma":[0.00011783536,0.0000047988997,0.00032623755,0.000032938857,0.0000025669945,0.0000061599135,0.000052669406,0.9614706,0.03692257,0.0003669517,0.0005826838,0.000114006325],"about_ca_topic_score_codex":0.000056073455,"about_ca_topic_score_gemma":0.0001034179,"teacher_disagreement_score":0.4100955,"about_ca_system_score_codex":0.00006683634,"about_ca_system_score_gemma":0.000005058872,"threshold_uncertainty_score":0.3922492},"labels":[],"label_agreement":null},{"id":"W2032013577","doi":"10.1109/icc.2014.6883837","title":"Physical-layer security for indoor visible light communications","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Visible light communication; Transmitter; Computer science; Physical layer; Precoding; Channel state information; Artificial noise; Channel (broadcasting); Transmission (telecommunications); Computer network; Secure transmission; Secrecy; Additive white Gaussian noise; Electronic engineering; Wireless; Telecommunications; Computer security; MIMO; Electrical engineering; Engineering","score_opus":0.02036847488631251,"score_gpt":0.2850855773704327,"score_spread":0.2647171024841202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032013577","genre_codex":"other","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.12019179,0.0007158979,0.40998784,0.00800809,0.0002132721,0.0018763359,0.00005318309,0.009388428,0.44956514],"genre_scores_gemma":[0.975085,0.00010082534,0.024122987,0.00016732783,0.000062130246,0.0002984202,0.00002887135,0.000040181214,0.00009423614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938065,0.00004668008,0.00018595245,0.00011367324,0.00009103628,0.00018203363],"domain_scores_gemma":[0.9977888,0.00027224587,0.000028512257,0.0017591608,0.000089520225,0.00006179383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019174395,0.00012844552,0.00018018951,0.00007236354,0.00011538734,0.000046400408,0.000900322,0.00007387542,0.00002376106],"category_scores_gemma":[0.000044546436,0.00012904649,0.00008253834,0.00015967451,0.000043135973,0.00016703024,0.00018482404,0.00019029775,0.000066717854],"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.0000069239063,0.0003605794,0.00018284933,0.00017057228,0.00008555157,6.4775996e-8,0.002791406,0.00014095912,0.04350709,0.8301894,0.10739279,0.015171792],"study_design_scores_gemma":[0.00024339325,0.000033585966,0.000071035945,0.000019477424,0.0000127969815,7.454485e-7,0.000042722033,0.3237202,0.14206535,0.030887317,0.50265455,0.00024881997],"about_ca_topic_score_codex":0.000012457793,"about_ca_topic_score_gemma":0.000044075365,"teacher_disagreement_score":0.8548932,"about_ca_system_score_codex":0.000036391364,"about_ca_system_score_gemma":0.0000067020187,"threshold_uncertainty_score":0.5262363},"labels":[],"label_agreement":null},{"id":"W2032278718","doi":"10.1109/tsp.2011.2172433","title":"Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":246,"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":"Relay; Beamforming; Computer science; MIMO; Relay channel; Computer network; Secrecy; Artificial noise; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Transmitter; Channel (broadcasting); Power (physics)","score_opus":0.04682904883414673,"score_gpt":0.23638887290567748,"score_spread":0.18955982407153074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278718","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.016492711,0.0008200731,0.9806346,0.00011009792,0.000053300235,0.00084688945,0.000012021738,0.00072084554,0.00030941592],"genre_scores_gemma":[0.9833056,0.00010193207,0.015952798,0.000075230666,0.000027540122,0.00039405943,0.000002479318,0.0000745201,0.000065856206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987584,0.00016981467,0.00038389032,0.00024091545,0.00018113157,0.0002658892],"domain_scores_gemma":[0.998977,0.0003441305,0.000109003086,0.0003991654,0.00008415564,0.000086520966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161966,0.00024366249,0.00026122006,0.00010678456,0.001078678,0.00012967129,0.00027528405,0.00017250192,0.000010289236],"category_scores_gemma":[0.000005262221,0.00016257488,0.00007451116,0.00018585191,0.0002523275,0.00035166324,0.000006088523,0.00049762306,0.0000029596995],"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.0022467435,0.0002787749,0.000018261186,0.0031578662,0.0006747324,0.0000051308116,0.11705654,0.41727668,0.031473458,0.0033732972,0.00041286598,0.42402565],"study_design_scores_gemma":[0.0011887574,0.00016149304,0.00001045172,0.00049751287,0.00023051928,0.00014239071,0.003712208,0.88653815,0.10527321,0.0003655991,0.0014538937,0.000425812],"about_ca_topic_score_codex":0.000040846637,"about_ca_topic_score_gemma":0.00004165235,"teacher_disagreement_score":0.96681285,"about_ca_system_score_codex":0.00011345696,"about_ca_system_score_gemma":0.000026089092,"threshold_uncertainty_score":0.8296428},"labels":[],"label_agreement":null},{"id":"W2033336691","doi":"10.1007/s00220-012-1451-x","title":"Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels","year":2012,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Communication source; Limit (mathematics); Channel (broadcasting); Decoding methods; Zero (linguistics); Quantum channel; Amplitude damping channel","score_opus":0.05755825214140101,"score_gpt":0.33312630322653997,"score_spread":0.27556805108513893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033336691","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.7350363,0.008536279,0.17201367,0.00812188,0.00037783443,0.0044942405,0.00023806731,0.002712917,0.0684688],"genre_scores_gemma":[0.9502902,0.0005340001,0.04850578,0.000071739734,0.000029259745,0.00033938914,0.00013222164,0.000065619366,0.000031804895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775016,0.0004317315,0.0009087747,0.00014763526,0.00033880997,0.0004229128],"domain_scores_gemma":[0.99435776,0.0012087849,0.0001739076,0.003969024,0.00011421909,0.00017627013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072750996,0.00028629575,0.00051677733,0.00014357214,0.00012900465,0.000041543095,0.001983929,0.00017648777,0.00006614436],"category_scores_gemma":[0.00020096936,0.00030196356,0.00013556199,0.0005716088,0.0005578122,0.00037506325,0.00095285935,0.0007331059,0.000050444294],"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.000010728769,0.0028373771,0.0030753885,0.0003300145,0.0001054353,2.987138e-7,0.0048146555,0.00056735973,0.0023045149,0.9783959,0.0029377497,0.0046206187],"study_design_scores_gemma":[0.0017123623,0.000101115045,0.0067398157,0.0013844507,0.00019788551,0.000012819567,0.0011573608,0.4938302,0.0201165,0.4621975,0.011085325,0.0014646349],"about_ca_topic_score_codex":0.00002037672,"about_ca_topic_score_gemma":0.000022195349,"teacher_disagreement_score":0.51619834,"about_ca_system_score_codex":0.00029549218,"about_ca_system_score_gemma":0.000034749883,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W2034185511","doi":"10.1109/icc.2013.6654851","title":"Intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Eavesdropping; Relay; Rayleigh fading; Computer network; Computer science; Relay channel; Wireless; Selection (genetic algorithm); Physical layer; Transmission (telecommunications); Fading; Wireless network; Channel (broadcasting); Telecommunications; Artificial intelligence","score_opus":0.03107081758075867,"score_gpt":0.27874379812764893,"score_spread":0.24767298054689027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034185511","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.8413407,0.00012007405,0.15590411,0.000045899073,0.000019662257,0.0009979951,0.000008194208,0.00014752847,0.0014157977],"genre_scores_gemma":[0.9916793,0.00038075118,0.007489096,0.000008282711,0.000010091994,0.0003429689,0.000043074095,0.000024437733,0.000022001619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981394,0.0003966595,0.0007275269,0.00030437298,0.00025490212,0.00017713258],"domain_scores_gemma":[0.9979478,0.0003255625,0.0002554145,0.0010225599,0.00042224722,0.000026402891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062116876,0.00026661213,0.0007023803,0.00035517936,0.00002858332,0.00004543407,0.00092044444,0.00029655127,0.00006174519],"category_scores_gemma":[0.000041015726,0.00019177482,0.00012722745,0.0014122266,0.00021001526,0.00014260372,0.00036271085,0.0010795516,7.9879965e-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.000010674181,0.00011366385,0.007432478,0.00021144534,0.00050067774,1.6443187e-7,0.003862918,0.98632777,0.0003268314,0.00048923364,0.00011035253,0.00061376777],"study_design_scores_gemma":[0.00006754206,0.00006139131,0.008872115,0.00041633047,0.00023142945,7.730331e-7,0.00053009245,0.98744226,0.002116898,0.0000378382,0.000016750475,0.00020660552],"about_ca_topic_score_codex":0.0016248663,"about_ca_topic_score_gemma":0.005490474,"teacher_disagreement_score":0.15033856,"about_ca_system_score_codex":0.00014362266,"about_ca_system_score_gemma":0.000042958352,"threshold_uncertainty_score":0.78203505},"labels":[],"label_agreement":null},{"id":"W2035512140","doi":"10.1109/ita.2009.5044978","title":"Gaussian Z-interference channel with a relay link: Type II channel and sum capacity bound","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"LG Electronics","keywords":"Interference (communication); Relay channel; Relay; Channel (broadcasting); Co-channel interference; Topology (electrical circuits); Upper and lower bounds; Channel capacity; Zero-forcing precoding; Adjacent-channel interference; Signal-to-noise ratio (imaging); Noise (video); Telecommunications; Computer science; Physics; Mathematics; MIMO; Precoding; Combinatorics; Mathematical analysis; Power (physics)","score_opus":0.022374191908771438,"score_gpt":0.2314587614005191,"score_spread":0.20908456949174767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035512140","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.86866546,0.0008374698,0.03638207,0.0042076213,0.00012462721,0.00036990494,0.000008433431,0.002852619,0.086551785],"genre_scores_gemma":[0.9959628,0.00030756707,0.0033098797,0.00017761182,0.000031154967,0.000009981514,0.000005238658,0.000018820447,0.00017693528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999445,0.000014985626,0.0001309963,0.00013865875,0.000085175416,0.00018518846],"domain_scores_gemma":[0.9994207,0.000017260492,0.000022603657,0.00041215497,0.00004907728,0.00007820714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009038412,0.00013715896,0.00013416933,0.00007205398,0.00010141364,0.00004941096,0.00020511272,0.00013423058,0.000033336248],"category_scores_gemma":[0.000010692024,0.00012199732,0.000015448677,0.00015348637,0.000057008718,0.00016694058,0.0000535071,0.0003348862,0.000008696256],"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.00083170267,0.0015337399,0.0014334683,0.0012234312,0.0010160069,0.00013165097,0.09867519,0.008112154,0.10111106,0.61217594,0.06801246,0.10574321],"study_design_scores_gemma":[0.0029558777,0.005539595,0.027538003,0.001837302,0.00014019743,0.00046837697,0.0014644242,0.5603618,0.32995763,0.032230377,0.032952044,0.004554373],"about_ca_topic_score_codex":0.000047678677,"about_ca_topic_score_gemma":0.00014777613,"teacher_disagreement_score":0.57994556,"about_ca_system_score_codex":0.000026290654,"about_ca_system_score_gemma":0.0000095995265,"threshold_uncertainty_score":0.49749064},"labels":[],"label_agreement":null},{"id":"W2035643157","doi":"10.1007/s11235-011-9540-2","title":"Framework for MIMO cross-layer secure communication based on STBC","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Physical layer; Computer network; MIMO; Space–time block code; Communication source; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.07330059585761008,"score_gpt":0.3183980370406202,"score_spread":0.24509744118301013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035643157","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.04244114,0.009198665,0.8350788,0.00074223726,0.00078789913,0.005316354,0.00021299331,0.008467277,0.09775468],"genre_scores_gemma":[0.8909954,0.0005768765,0.10630018,0.00017096795,0.000044780605,0.001520579,0.00020823976,0.00012380704,0.00005916592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794894,0.00037621282,0.0007914342,0.00025701532,0.00027102663,0.00035537587],"domain_scores_gemma":[0.9931345,0.00091102195,0.00026319516,0.005214963,0.00036336092,0.00011297499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010355437,0.00032573435,0.00038593088,0.0002599496,0.00036072108,0.00016504293,0.0024054607,0.00041453083,0.00008870555],"category_scores_gemma":[0.00016149927,0.00035940943,0.0001474949,0.00038611185,0.00013652125,0.0003085367,0.00014932545,0.0006771414,0.00011519947],"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.00034686673,0.0013958814,0.0057835183,0.0013602412,0.0004020252,0.0000013186149,0.011952685,0.034255255,0.002565491,0.9011402,0.026730258,0.014066224],"study_design_scores_gemma":[0.0019214863,0.00037997478,0.007981885,0.001543498,0.000083037405,0.0000123950085,0.00093623163,0.6793838,0.02587628,0.021218354,0.25866848,0.001994569],"about_ca_topic_score_codex":0.00010042954,"about_ca_topic_score_gemma":0.000026764044,"teacher_disagreement_score":0.87992185,"about_ca_system_score_codex":0.00022451156,"about_ca_system_score_gemma":0.000036552778,"threshold_uncertainty_score":0.9998858},"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":"W2036235015","doi":"10.1109/glocom.2014.7037452","title":"Channel-based physical layer authentication","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"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; Support vector machine; Channel (broadcasting); Authentication (law); False alarm; Linear discriminant analysis; Pattern recognition (psychology); Artificial intelligence; Machine learning; Computer network; Computer security","score_opus":0.013274012276034445,"score_gpt":0.24251916230877033,"score_spread":0.22924515003273588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036235015","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.2297164,0.00001965126,0.72396487,0.00061446475,0.00006529536,0.00014159974,0.0000012742162,0.0033233792,0.042153053],"genre_scores_gemma":[0.9972001,0.0000026454413,0.0025580062,0.0000828578,0.000042962318,0.00003415842,0.000008323187,0.00001715879,0.000053831685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969155,0.000019787914,0.000071601615,0.00006137517,0.0000709956,0.00008469382],"domain_scores_gemma":[0.999504,0.000048260725,0.00000913844,0.0003849802,0.000024134162,0.000029470722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007031609,0.000060977593,0.000067596746,0.00004089177,0.000021647502,0.000015813148,0.00016443677,0.000031632302,0.00002872623],"category_scores_gemma":[0.000012622111,0.00005966906,0.000027684287,0.00007427553,0.000017106477,0.000054277312,0.000016217758,0.000071726055,0.0001387203],"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.000014519512,0.0010319948,0.0003941474,0.0003729651,0.000097956785,7.073705e-7,0.0046383846,0.045791596,0.2624831,0.57466406,0.037003484,0.07350714],"study_design_scores_gemma":[0.00006412835,0.000010577174,0.00033773435,0.000006433332,0.0000028392203,1.3729444e-7,0.0000051821876,0.8454891,0.14105245,0.0026627928,0.010284612,0.000084047584],"about_ca_topic_score_codex":0.0000032207395,"about_ca_topic_score_gemma":0.000002385066,"teacher_disagreement_score":0.79969746,"about_ca_system_score_codex":0.00001681984,"about_ca_system_score_gemma":0.0000024717326,"threshold_uncertainty_score":0.24332337},"labels":[],"label_agreement":null},{"id":"W2037957312","doi":"10.1109/chinacom.2011.6158162","title":"On the capacity of finite-state channels with noisy state information at the encoder","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Encoder; Finite state; State (computer science); Computer science; Process (computing); Finite-state machine; State information; Upper and lower bounds; Decoding methods; Algorithm; Mathematics; Mathematical analysis; Markov chain","score_opus":0.028499100538051454,"score_gpt":0.19436860527516575,"score_spread":0.1658695047371143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037957312","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.8965483,0.000013053383,0.05470653,0.00025287867,0.000034139346,0.0003634215,0.00002447842,0.00036836808,0.047688853],"genre_scores_gemma":[0.99863905,0.00006740047,0.0009129165,0.0001950989,0.0000021229025,0.000049100203,0.000004880406,0.00000996832,0.0001194664],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950266,0.00003689315,0.00017831936,0.000038778464,0.00013826716,0.00010506336],"domain_scores_gemma":[0.999115,0.00018298555,0.000058784,0.00055385934,0.00007120378,0.000018158093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022446596,0.00008928968,0.00007747141,0.000042645996,0.0000628719,0.000015953452,0.00030254186,0.000024788535,0.00018789283],"category_scores_gemma":[0.000023248947,0.000044599146,0.000021760468,0.000115751725,0.000085999,0.00023465934,0.00005997446,0.00014473379,0.000057187695],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048046416,0.0003372513,0.0014957399,0.00052183424,0.00066391967,0.0000037226355,0.46536165,0.23078667,0.005481289,0.22846895,0.039277192,0.027121317],"study_design_scores_gemma":[0.000339549,0.00019102199,0.0016461815,0.0000976672,0.000014583777,0.0000056389104,0.00073046755,0.10274847,0.8687869,0.01303293,0.012011717,0.00039490405],"about_ca_topic_score_codex":0.00021239612,"about_ca_topic_score_gemma":0.00026191902,"teacher_disagreement_score":0.86330557,"about_ca_system_score_codex":0.000028691613,"about_ca_system_score_gemma":0.0000050138615,"threshold_uncertainty_score":0.20572947},"labels":[],"label_agreement":null},{"id":"W2038336165","doi":"10.1109/dsp-spe.2013.6642595","title":"Low-delay joint source-channel coding with side information at the decoder","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Algorithm; Variable-length code; Distributed source coding; Binary number; Electronic engineering; Coding gain; Theoretical computer science; Mathematics; Arithmetic; Engineering","score_opus":0.010335699405837109,"score_gpt":0.19375887040536927,"score_spread":0.18342317099953215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038336165","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.3629385,0.000076584896,0.56852686,0.0013914575,0.00004790946,0.0006427064,0.0000023917164,0.0020854818,0.06428812],"genre_scores_gemma":[0.99627846,0.00006753528,0.0027988066,0.00038841538,0.000011757247,0.00012752986,0.000013000498,0.000019226276,0.00029523618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944097,0.000016986538,0.00020510497,0.000049873863,0.0001340078,0.00015304089],"domain_scores_gemma":[0.99933505,0.000056721165,0.000037838952,0.00045397657,0.000076043514,0.000040390118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011404851,0.00010610148,0.00008868553,0.000058566406,0.00010971349,0.00009826193,0.00020039006,0.000052829044,0.00030427607],"category_scores_gemma":[0.000013124594,0.000068132205,0.000026054282,0.00009559651,0.000036860503,0.0006238904,0.0001092397,0.00014747387,0.00053268793],"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.00003756726,0.00013137297,0.0008678246,0.00063361326,0.00046242005,0.00000256393,0.046920754,0.38307583,0.03448279,0.02328847,0.3789092,0.1311876],"study_design_scores_gemma":[0.00038486207,0.00003872766,0.0015868993,0.00011366869,0.0000136717645,0.000040701045,0.0015924609,0.76904577,0.1883482,0.00077754573,0.037541233,0.00051625434],"about_ca_topic_score_codex":0.0001228621,"about_ca_topic_score_gemma":0.00012398593,"teacher_disagreement_score":0.63334,"about_ca_system_score_codex":0.00007937967,"about_ca_system_score_gemma":0.0000055213327,"threshold_uncertainty_score":0.6846803},"labels":[],"label_agreement":null},{"id":"W2040101133","doi":"10.4108/icst.crowncom.2014.255736","title":"Device Authentication Architecture for TV White Space Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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":"Tekes; University of Ontario Institute of Technology","keywords":"White spaces; Computer science; Architecture; Spectrum (functional analysis); Authentication (law); Set (abstract data type); Space (punctuation); Telecommunications; Computer security; Cognitive radio; Wireless; Geography; Physics","score_opus":0.012164975261944256,"score_gpt":0.2393684790927398,"score_spread":0.22720350383079554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040101133","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.008161323,0.00016367079,0.9713628,0.0007532628,0.000100850026,0.0004173694,0.000004416414,0.0015581344,0.017478138],"genre_scores_gemma":[0.9623133,0.000014799061,0.036818314,0.00004709904,0.00005537755,0.00017455542,0.000019346458,0.00003053295,0.0005266917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952626,0.00003040782,0.0001459921,0.00009247104,0.00007736772,0.00012752421],"domain_scores_gemma":[0.9992717,0.00010721722,0.00002519651,0.0004978603,0.000058851714,0.00003916934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019135409,0.00009072272,0.00010764091,0.00006644062,0.000040958013,0.00004839828,0.00024085834,0.00006986551,0.000015076375],"category_scores_gemma":[0.000035536465,0.000087617904,0.00003318593,0.000088292705,0.000013720494,0.00005838169,0.000025039833,0.0000889666,0.000030360776],"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.000018635315,0.00009261136,0.000879181,0.0018625188,0.00014064868,1.9430658e-7,0.0051603867,0.056400448,0.057669967,0.7589402,0.08589908,0.032936096],"study_design_scores_gemma":[0.00017552705,0.000020378395,0.0003551011,0.000061871826,0.000014658446,0.0000035582268,0.000085172214,0.5435796,0.012890241,0.0022146576,0.4403577,0.00024154321],"about_ca_topic_score_codex":0.000012082358,"about_ca_topic_score_gemma":0.00002830895,"teacher_disagreement_score":0.954152,"about_ca_system_score_codex":0.000028739105,"about_ca_system_score_gemma":0.0000036181393,"threshold_uncertainty_score":0.35729545},"labels":[],"label_agreement":null},{"id":"W2040420188","doi":"10.1109/tit.2013.2267772","title":"On Convexity of Error Rates in Digital Communications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"Convexity; Additive white Gaussian noise; Noise power; Gaussian noise; Convex optimization; Fading; Channel (broadcasting); White noise; Upper and lower bounds","score_opus":0.01727604170683221,"score_gpt":0.25403264414171706,"score_spread":0.23675660243488483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040420188","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.16232608,0.000037151185,0.79552877,0.000254021,0.0001559558,0.00076387764,0.00013523035,0.00078318577,0.040015742],"genre_scores_gemma":[0.9987475,0.0000893331,0.0007788383,0.000110801455,0.0000017163052,0.00020937451,0.000024229863,0.000011789574,0.000026385014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923074,0.00004563278,0.0004444841,0.00004481183,0.00012398735,0.000110324596],"domain_scores_gemma":[0.99862015,0.00038420473,0.00006953631,0.00078766135,0.00010175829,0.00003665722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018131082,0.00011337589,0.00013494573,0.00035623676,0.00006194123,0.0000522523,0.00041468613,0.000087205255,0.00021306903],"category_scores_gemma":[0.000016486121,0.00011883229,0.000054766777,0.00025657815,0.00012711516,0.001603606,0.000002971636,0.00031102725,0.00037300386],"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.00017003187,0.0010905658,0.000117032076,0.0004241579,0.0002076286,2.6942504e-7,0.018301707,0.19631621,0.001984925,0.39817122,0.0028341014,0.38038218],"study_design_scores_gemma":[0.0026667258,0.0004181734,0.0027468612,0.0006746487,0.000036516165,0.000010662057,0.005869005,0.49113935,0.27785572,0.21131451,0.005871976,0.0013958608],"about_ca_topic_score_codex":0.00001906212,"about_ca_topic_score_gemma":0.000008650389,"teacher_disagreement_score":0.83642143,"about_ca_system_score_codex":0.000072964,"about_ca_system_score_gemma":0.000014148961,"threshold_uncertainty_score":0.48458403},"labels":[],"label_agreement":null},{"id":"W2040861319","doi":"10.1109/tit.2013.2291787","title":"Optimality and Approximate Optimality of Source-Channel Separation in Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Distortion (music); Channel (broadcasting); Separation (statistics); Bounded function; Quadratic equation; Decoding methods; Measure (data warehouse); Mathematics; Upper and lower bounds; Converse; Computer science; Source separation; Topology (electrical circuits); Mathematical optimization; Algorithm; Telecommunications; Combinatorics","score_opus":0.007589482128150708,"score_gpt":0.2281653840888259,"score_spread":0.22057590196067517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040861319","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.040735964,0.00002247426,0.95574415,0.000020451249,0.00007013301,0.00021724714,0.000011594736,0.00031964487,0.0028583668],"genre_scores_gemma":[0.9970425,0.00012914349,0.0026666266,0.000051884315,0.0000061517962,0.000072141556,0.000012649237,0.000011122836,0.0000078060075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909896,0.00013193075,0.0004606747,0.00006806811,0.000113784154,0.00012660836],"domain_scores_gemma":[0.99932975,0.00016187492,0.00008588447,0.00032660514,0.000056219687,0.000039698487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009031378,0.00012282355,0.00016940047,0.00022508106,0.000063323256,0.00003126777,0.00013020125,0.00012393194,0.000019698808],"category_scores_gemma":[0.000009160873,0.00013549405,0.000040778268,0.00019022118,0.000076422366,0.0008034562,0.000002256693,0.00024766906,0.0000061068927],"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.0000386635,0.00002696798,0.0000067408755,0.000079499994,0.0000114773875,1.4860681e-8,0.001643718,0.96962905,0.000058345337,0.0054824473,0.000016253598,0.02300681],"study_design_scores_gemma":[0.00027715223,0.000032047177,0.00020379352,0.00004161639,0.000007790318,0.0000020905024,0.00021240575,0.9864163,0.010288825,0.0021694796,0.00021298215,0.00013554512],"about_ca_topic_score_codex":0.000014699155,"about_ca_topic_score_gemma":0.0000077597815,"teacher_disagreement_score":0.9563065,"about_ca_system_score_codex":0.00004711847,"about_ca_system_score_gemma":0.0000061784126,"threshold_uncertainty_score":0.5525287},"labels":[],"label_agreement":null},{"id":"W2041355078","doi":"10.1109/ita.2012.6181822","title":"Non-asymptotic equipartition properties for independent and identically distributed sources","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Combinatorics; Algorithm; Computer science; Mathematics","score_opus":0.022288488855908676,"score_gpt":0.240651480278684,"score_spread":0.21836299142277532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041355078","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.8257643,0.0004980954,0.17208296,0.00012611004,0.000051849485,0.00032073774,0.000008512389,0.0005806872,0.00056671735],"genre_scores_gemma":[0.9971418,0.00006548728,0.0025029741,0.00002656371,0.00003777064,0.00015023268,0.00002291027,0.000017926737,0.000034380555],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994886,0.000009274893,0.00015464387,0.0000628429,0.000086579086,0.00019804419],"domain_scores_gemma":[0.9996646,0.000029354936,0.000015421429,0.00018166605,0.000038984697,0.00006994201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015946197,0.000085418775,0.000097730255,0.000039560124,0.00005440898,0.000055315115,0.00010859981,0.00006010143,0.000019730118],"category_scores_gemma":[0.000022106118,0.00007561351,0.00002369801,0.00004660733,0.000036965528,0.00029587644,0.00006401507,0.00006616047,0.000010314264],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013350308,0.0010203959,0.20294495,0.0031407198,0.00061762857,0.0000014763755,0.013920153,0.002266451,0.5788823,0.157429,0.02003595,0.019607477],"study_design_scores_gemma":[0.0011602555,0.00016413447,0.096013315,0.00025006582,0.00011511212,0.00002639966,0.0010371137,0.14761186,0.7304681,0.004346717,0.01770128,0.0011056496],"about_ca_topic_score_codex":0.000009749573,"about_ca_topic_score_gemma":0.000011627496,"teacher_disagreement_score":0.17137742,"about_ca_system_score_codex":0.000031899617,"about_ca_system_score_gemma":0.0000035234075,"threshold_uncertainty_score":0.30834296},"labels":[],"label_agreement":null},{"id":"W2044084012","doi":"10.1109/isit.2013.6620611","title":"Extended subspace error localization for rate-adaptive distributed source coding","year":2013,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Subspace topology; Coding (social sciences); Computer science; Puncturing; Distributed source coding; Algorithm; Word error rate; Source code; Variable-length code; Mathematics; Speech recognition; Artificial intelligence; Telecommunications; Decoding methods; Statistics","score_opus":0.021563571530591644,"score_gpt":0.24992598072722386,"score_spread":0.2283624091966322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044084012","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.006807355,0.000059189322,0.9891625,0.00026768938,0.00003721378,0.000617341,0.0000149640955,0.0017114425,0.0013222914],"genre_scores_gemma":[0.9836407,0.000035225818,0.015525446,0.00007327734,0.000017748946,0.00032915245,0.00012518212,0.000039058057,0.0002142655],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940217,0.000032172702,0.00018557465,0.00011825433,0.00007194287,0.00018986363],"domain_scores_gemma":[0.99928874,0.00012923681,0.00003386376,0.0003325846,0.00015894954,0.0000566477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011812527,0.00012501421,0.00013462697,0.00005744985,0.00008321211,0.00006093502,0.00020656089,0.00008705892,0.00012190959],"category_scores_gemma":[0.000051510953,0.00012724024,0.000041614156,0.00017077502,0.000031200794,0.00024585635,0.00004259981,0.00009084721,0.000042470467],"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.00008829356,0.00035731946,0.0009928679,0.00055744196,0.00040109557,0.0000015744668,0.0048795706,0.14203939,0.11179909,0.26664227,0.42752904,0.044712055],"study_design_scores_gemma":[0.00019911061,0.00002195336,0.000449434,0.000022093218,0.0000072439166,7.8101397e-7,0.00038447222,0.92998755,0.05476267,0.0016362006,0.012333418,0.0001950705],"about_ca_topic_score_codex":0.00006192287,"about_ca_topic_score_gemma":0.0000313049,"teacher_disagreement_score":0.9768333,"about_ca_system_score_codex":0.000084163774,"about_ca_system_score_gemma":0.0000071599193,"threshold_uncertainty_score":0.51887065},"labels":[],"label_agreement":null},{"id":"W2045663703","doi":"10.1109/ita.2008.4601015","title":"Optimal causal quantization of Markov Sources with distortion constraints","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Randomness; Encoder; Mathematics; Markov process; Quantization (signal processing); Markov chain; Asymptotically optimal algorithm; Mathematical optimization; Rate–distortion theory; Convex optimization; Algorithm; Regular polygon; Data compression; Statistics","score_opus":0.013116994961372396,"score_gpt":0.2163972265873615,"score_spread":0.2032802316259891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045663703","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.7471987,0.00004878333,0.2473209,0.000016180646,0.000011132706,0.000068806985,0.0000026552405,0.00039597566,0.0049368767],"genre_scores_gemma":[0.9714048,0.0001113089,0.02839987,0.000005181461,0.000005171937,0.000008075298,0.000015440184,0.0000135916935,0.00003658145],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960166,0.000014738508,0.00014882161,0.000057426143,0.000105954845,0.0000713899],"domain_scores_gemma":[0.999678,0.000021673886,0.00003275838,0.0001944859,0.000050440263,0.000022636228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047722304,0.000066034925,0.00009423865,0.000056704128,0.00003188155,0.000004298089,0.00009498775,0.000040219067,0.00008689276],"category_scores_gemma":[0.000006102164,0.000060361246,0.000015532427,0.00010155943,0.00015734974,0.00010340096,0.000013961316,0.000060641945,0.0000032901792],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033536972,0.0010953688,0.40070316,0.001112576,0.00079055014,0.00006695232,0.036879987,0.17458278,0.2161197,0.08783471,0.01949196,0.06098688],"study_design_scores_gemma":[0.001379772,0.00036910223,0.17508112,0.00024006265,0.00005344649,0.00026520924,0.0011578494,0.1705505,0.6455104,0.00015198697,0.004111156,0.0011294477],"about_ca_topic_score_codex":0.000029210918,"about_ca_topic_score_gemma":0.000022212476,"teacher_disagreement_score":0.42939067,"about_ca_system_score_codex":0.00002118022,"about_ca_system_score_gemma":0.000011133683,"threshold_uncertainty_score":0.24614601},"labels":[],"label_agreement":null},{"id":"W2046531624","doi":"10.1109/ita.2010.5454121","title":"On the MISO compound wiretap channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Upper and lower bounds; Transmitter; Channel (broadcasting); Topology (electrical circuits); Transmission (telecommunications); Coding (social sciences); Pairwise comparison; Computer science; Telecommunications; Antenna (radio); Computer network; Combinatorics; Mathematics; Statistics; Mathematical analysis","score_opus":0.013732475441662432,"score_gpt":0.22338027914176722,"score_spread":0.2096478037001048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046531624","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.67403424,0.000053274976,0.005505752,0.0041656676,0.0002824273,0.00024883545,0.0000033533668,0.0024081238,0.3132983],"genre_scores_gemma":[0.9985089,0.000020652664,0.00088490563,0.0003426465,0.000025683988,0.000025362011,0.0000023293749,0.000016816248,0.00017271955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996848,0.000012236148,0.00008016569,0.00005282764,0.00007805727,0.00009189235],"domain_scores_gemma":[0.99919635,0.00015035183,0.000008803096,0.0006017481,0.00001805799,0.000024664285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011464383,0.00006942743,0.000057180798,0.000026991307,0.000056855108,0.00003157016,0.00036793502,0.000051220333,0.00032094942],"category_scores_gemma":[0.00001808677,0.000048021695,0.00002487533,0.000062809835,0.000041173444,0.000039415547,0.000036480185,0.0003259712,0.00015177915],"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.0000027301814,0.00005507346,0.000034840974,0.000015212805,0.000030510631,0.0000012953096,0.0009723228,0.00022443681,0.049640927,0.8385082,0.10753228,0.0029821997],"study_design_scores_gemma":[0.000330836,0.00005980723,0.0021155097,0.00004813675,0.000011518052,0.000022660699,0.00022842594,0.27121046,0.3998404,0.090489626,0.2348718,0.0007707961],"about_ca_topic_score_codex":0.000016514869,"about_ca_topic_score_gemma":0.000084748186,"teacher_disagreement_score":0.74801856,"about_ca_system_score_codex":0.000007847003,"about_ca_system_score_gemma":0.000002632329,"threshold_uncertainty_score":0.3514171},"labels":[],"label_agreement":null},{"id":"W2047892990","doi":"10.1049/iet-ifs.2009.0197","title":"Physical layer assisted authentication for distributed <i>ad hoc</i> wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China","keywords":"Computer network; Computer science; Authentication (law); Authentication protocol; Physical layer; Overhead (engineering); Message authentication code; Wireless ad hoc network; Public-key cryptography; Cryptography; Distributed computing; Wireless; Computer security; Encryption; Telecommunications","score_opus":0.010240708386570511,"score_gpt":0.2508163790439364,"score_spread":0.24057567065736588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047892990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7328926,0.000031818963,0.26096955,0.00049730274,0.0005284542,0.00097414176,0.0005293473,0.0023417398,0.001235054],"genre_scores_gemma":[0.9942185,0.00006088249,0.0034019207,0.00012860367,0.00010772286,0.00028759305,0.0017613822,0.00002793297,0.000005454517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.000033323766,0.0004933699,0.00012260325,0.00024032983,0.00030232684],"domain_scores_gemma":[0.9985018,0.00017463537,0.0001584153,0.0007105228,0.00033913972,0.000115486866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030925183,0.00022467504,0.00024603828,0.00010509188,0.00016306477,0.00017804353,0.00040006262,0.0002559203,0.000021292139],"category_scores_gemma":[0.00007543584,0.00024213204,0.00012875079,0.00030719533,0.0000760343,0.0012414843,0.00006757912,0.00056313665,0.000054084907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005178331,0.0019174608,0.0009058692,0.0025352526,0.0008249216,0.0000030747817,0.06936056,0.016915787,0.15111832,0.24032511,0.17754692,0.33802888],"study_design_scores_gemma":[0.0005864034,0.000029361661,0.0015697392,0.000023691462,0.000029873841,0.000007942944,0.00019459311,0.8496772,0.018108318,0.0013675756,0.12799928,0.0004060313],"about_ca_topic_score_codex":0.0000048178154,"about_ca_topic_score_gemma":0.00002826065,"teacher_disagreement_score":0.8327614,"about_ca_system_score_codex":0.000067841895,"about_ca_system_score_gemma":0.000021468593,"threshold_uncertainty_score":0.9873858},"labels":[],"label_agreement":null},{"id":"W2047986257","doi":"10.1109/isit.2013.6620610","title":"Real-time streaming of Gauss-Markov sources over sliding window burst-erasure channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Erasure; Encoder; Sliding window protocol; Upper and lower bounds; Binary erasure channel; Computer science; Algorithm; Gaussian; Markov process; Erasure code; Markov chain; Decoding methods; Mathematics; Channel (broadcasting); Channel capacity; Window (computing); Telecommunications; Physics; Statistics","score_opus":0.009266078322678863,"score_gpt":0.22362932886498563,"score_spread":0.21436325054230676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047986257","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.9677277,0.00019347327,0.001524699,0.00009938561,0.000056968733,0.00031763816,0.0000061021933,0.0013340246,0.028740011],"genre_scores_gemma":[0.991058,0.0002834165,0.007985236,0.000016845013,0.000054995948,0.00005397603,0.000013009276,0.000054738106,0.00047979126],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898803,0.00004250698,0.00034501113,0.00014983035,0.00021125228,0.00026337677],"domain_scores_gemma":[0.9989672,0.0001616054,0.000071381604,0.00062947173,0.00009466101,0.00007572137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018070647,0.00019092386,0.00028130552,0.00015789081,0.000053327076,0.000063367486,0.0004085768,0.00013600099,0.0010757454],"category_scores_gemma":[0.00002897468,0.00018834589,0.00007568324,0.00020218368,0.000035875928,0.00038063448,0.000116407486,0.00017409604,0.00007802665],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000480097,0.00008362497,0.004501899,0.00023462152,0.00016876198,0.0000016845752,0.0028786233,0.0018236997,0.9654785,0.0031959633,0.010713567,0.010914261],"study_design_scores_gemma":[0.0005908197,0.00008796616,0.018995464,0.00047729444,0.000041331477,0.000008876009,0.000816069,0.14509885,0.8277119,0.0018662268,0.0032666852,0.0010385185],"about_ca_topic_score_codex":0.0006049974,"about_ca_topic_score_gemma":0.000009534281,"teacher_disagreement_score":0.14327514,"about_ca_system_score_codex":0.000051155235,"about_ca_system_score_gemma":0.000008489365,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W2049705545","doi":"10.1109/isccsp.2014.6877827","title":"Secrecy analysis of multi-cell massive MIMO systems with RCI precoding and artificial noise transmission","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Precoding; Artificial noise; MIMO; Telecommunications link; Base station; Computer science; Zero-forcing precoding; Transmitter; Ergodic theory; Transmission (telecommunications); Topology (electrical circuits); Channel (broadcasting); Algorithm; Mathematics; Computer network; Telecommunications","score_opus":0.014925462544669381,"score_gpt":0.22611497173190515,"score_spread":0.21118950918723575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049705545","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.32241732,0.0002954561,0.674247,0.000019667816,0.000013669596,0.00016883016,0.000004977942,0.00029868467,0.0025343534],"genre_scores_gemma":[0.9845623,0.00010170898,0.015226558,0.0000039419015,0.0000075686576,0.000020170357,0.000012177952,0.000018909739,0.000046709723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934566,0.000056033346,0.000254094,0.00012549739,0.00011003224,0.0001086903],"domain_scores_gemma":[0.99941313,0.000090733076,0.00005415028,0.000323263,0.000058422425,0.00006032491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016839511,0.000113560054,0.00028017754,0.00024398438,0.000035182497,0.000029455878,0.00013358564,0.00007506723,0.000021244497],"category_scores_gemma":[0.000005815763,0.000094911724,0.000045258763,0.00033742873,0.000030048144,0.00008897813,0.000018940402,0.00009750813,0.0000012147542],"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.00011209604,0.0005395314,0.017536417,0.0020709063,0.0018034766,0.0000030913989,0.010936727,0.44167748,0.43614382,0.012295722,0.00025306194,0.07662768],"study_design_scores_gemma":[0.00014827988,0.000026938453,0.00090995966,0.000054856442,0.00017520454,3.990805e-7,0.00017724225,0.9369256,0.061121937,0.000016772548,0.00031256743,0.00013025242],"about_ca_topic_score_codex":0.00011087676,"about_ca_topic_score_gemma":0.00007667923,"teacher_disagreement_score":0.6621449,"about_ca_system_score_codex":0.000020739657,"about_ca_system_score_gemma":0.0000050915332,"threshold_uncertainty_score":0.3870388},"labels":[],"label_agreement":null},{"id":"W2051655994","doi":"10.1109/tit.2012.2184076","title":"Erratum to “On Delayed Sequential Coding of Correlated Sources” [Jun 11 3763-3782]","year":2012,"lang":"en","type":"erratum","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","keywords":"Lemma (botany); Computer science; Coding (social sciences); Algorithm; Mathematics; Statistics","score_opus":0.012723183991158746,"score_gpt":0.23563188304602561,"score_spread":0.22290869905486688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051655994","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.00082072074,0.00014270065,0.92413574,0.00007354674,0.015883658,0.00086485856,0.00058482756,0.0017853939,0.05570855],"genre_scores_gemma":[0.98871416,0.00072178565,0.001046398,0.0004366629,0.0002255711,0.00034941747,0.00071641424,0.00016845329,0.0076211477],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975101,0.00018956108,0.0011425504,0.00016826208,0.0005602236,0.00042933063],"domain_scores_gemma":[0.9978644,0.00020715034,0.00035633976,0.0011131944,0.00026340413,0.00019546757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065270066,0.00052372366,0.00054345326,0.0013456818,0.00022712733,0.0000922155,0.00073154573,0.00095092406,0.0004602456],"category_scores_gemma":[0.000020966176,0.00058689894,0.00027781562,0.0006208147,0.00010054521,0.0009924178,0.000007710034,0.0018223752,0.00053388055],"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.00047871054,0.00029829083,0.0000011379062,0.0011678005,0.0008086182,0.0000015394994,0.017747998,0.19573742,0.0009854337,0.012450024,0.7330047,0.037318315],"study_design_scores_gemma":[0.0016718796,0.0006128307,0.00003167804,0.0028743239,0.0006492201,0.00004783008,0.0019501798,0.05420258,0.11669705,0.0017805235,0.8165062,0.0029756804],"about_ca_topic_score_codex":0.000037948994,"about_ca_topic_score_gemma":0.000026440033,"teacher_disagreement_score":0.9878934,"about_ca_system_score_codex":0.0003714276,"about_ca_system_score_gemma":0.000094910116,"threshold_uncertainty_score":0.9996582},"labels":[],"label_agreement":null},{"id":"W2053818368","doi":"10.1109/glocom.2012.6503444","title":"Phase asynchronous cognitive interference channels: Lossless source-channel separation theorems","year":2012,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Lossless compression; Computer science; Cognitive radio; Channel (broadcasting); Interference (communication); Asynchronous communication; Encoder; Coding (social sciences); Cognition; Transmission (telecommunications); Constraint (computer-aided design); Topology (electrical circuits); Computer network; Telecommunications; Algorithm; Mathematics; Wireless; Data compression; Psychology","score_opus":0.02907821078201568,"score_gpt":0.3105516162855264,"score_spread":0.28147340550351074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053818368","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.24973698,0.0006659282,0.726947,0.00003422751,0.00021186662,0.00026738443,0.000010260042,0.0014383652,0.020687958],"genre_scores_gemma":[0.9986848,0.0001541422,0.0006071401,0.00007384424,0.00015401912,0.00012241797,0.000053988533,0.00004396263,0.00010567707],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913734,0.000064312044,0.00023470652,0.0001223682,0.000119291886,0.00032195993],"domain_scores_gemma":[0.9993004,0.00012785327,0.000041823125,0.00032695945,0.00008792026,0.00011505258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025149368,0.0001894916,0.00017493607,0.00011330134,0.00007379694,0.0000590244,0.00026248017,0.00011366509,0.00021731546],"category_scores_gemma":[0.00003329262,0.00018833081,0.00004914519,0.00014879968,0.00007651464,0.0004933497,0.00009039878,0.00022990144,0.00022885735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040365176,0.008244739,0.0010459664,0.0007104798,0.0010709179,0.000009767004,0.15301059,0.006301632,0.05776362,0.1518185,0.01865511,0.600965],"study_design_scores_gemma":[0.002287258,0.00042377546,0.000103448896,0.0003282579,0.00006899797,0.000048706304,0.004352454,0.36246103,0.61874336,0.003747183,0.0060984027,0.0013371536],"about_ca_topic_score_codex":0.000017371489,"about_ca_topic_score_gemma":0.000008228008,"teacher_disagreement_score":0.7489478,"about_ca_system_score_codex":0.00007088252,"about_ca_system_score_gemma":0.000008182501,"threshold_uncertainty_score":0.76799077},"labels":[],"label_agreement":null},{"id":"W2055044375","doi":"10.1109/tcomm.2013.111213.130235","title":"Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":212,"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; Cognitive radio; Scheduling (production processes); Computer network; Quality of service; Rayleigh fading; Artificial noise; Fading; Physical layer; Base station; Mathematical optimization; Wireless; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.0255506041634968,"score_gpt":0.27381222421167173,"score_spread":0.24826162004817492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055044375","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.3157615,0.00036572176,0.6758244,0.0006139892,0.00006847944,0.0010727212,0.00002708289,0.0013183529,0.004947733],"genre_scores_gemma":[0.9885174,0.0010611844,0.00892399,0.00008142861,0.000016329264,0.0012797986,0.000019198678,0.00006786535,0.00003283098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00016234386,0.00030956388,0.00020075709,0.00015867408,0.00029334778],"domain_scores_gemma":[0.99728495,0.0006072471,0.00005060668,0.0017944011,0.00016199776,0.00010080875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000119897515,0.00024724228,0.0002592056,0.00024825666,0.00025485212,0.00007941435,0.0008592561,0.00013019418,0.000087337394],"category_scores_gemma":[0.0000058610476,0.00025554377,0.000082154955,0.0006685426,0.0002141781,0.00048538813,0.000009929622,0.0011963825,0.00009233081],"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.000049890707,0.0027067713,0.00045610388,0.00006516497,0.00038423465,0.0000027151077,0.010834052,0.9395402,0.0038135569,0.0014101203,0.0004570324,0.04028015],"study_design_scores_gemma":[0.00063566375,0.00005056323,0.0006631508,0.00023158101,0.00003743992,0.0000055064897,0.00057828816,0.9863539,0.01029788,0.00044597313,0.00030503632,0.00039505234],"about_ca_topic_score_codex":0.0002593551,"about_ca_topic_score_gemma":0.0010313268,"teacher_disagreement_score":0.67275584,"about_ca_system_score_codex":0.00013742404,"about_ca_system_score_gemma":0.000023220704,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2056164141","doi":"10.1007/s11277-008-9534-x","title":"Successively Structured Gaussian Two-terminal Source Coding","year":2008,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Queen's University","funders":"","keywords":"Computer science; Decoding methods; Encoder; Coding (social sciences); Distributed source coding; Algorithm; Variable-length code; Source code; Shannon–Fano coding; Rate–distortion theory; Gaussian; Context-adaptive binary arithmetic coding; Theoretical computer science; Coding tree unit; Mathematics; Data compression; Statistics","score_opus":0.03396039112253684,"score_gpt":0.2789937649306184,"score_spread":0.24503337380808154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056164141","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.94408697,0.0021037513,0.023482265,0.0018044751,0.00015233652,0.00053840317,0.00011079785,0.0034003095,0.024320697],"genre_scores_gemma":[0.98748153,0.0018578264,0.0098707145,0.00013468733,0.00007179243,0.00014644348,0.00015386635,0.00008859981,0.00019454432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00018252255,0.00044984792,0.00023792997,0.0003383568,0.00039237618],"domain_scores_gemma":[0.9972219,0.00024188845,0.00011775664,0.00209545,0.00014950785,0.00017350417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017037652,0.0003101202,0.00033472484,0.00022805124,0.0009770251,0.000075343334,0.0022849462,0.00014753711,0.00010646338],"category_scores_gemma":[0.000025297824,0.00035336378,0.00014211274,0.00045558723,0.0005883709,0.00037193543,0.0004770073,0.0008533403,0.00006259575],"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.0002084093,0.0018330864,0.06674386,0.00096910784,0.0016497666,0.00024270681,0.1522028,0.0043799644,0.22591993,0.23743264,0.04073866,0.26767907],"study_design_scores_gemma":[0.0027582496,0.00012097217,0.040472794,0.00060490816,0.00015454032,0.001960606,0.004057226,0.7890813,0.028284788,0.001519887,0.12769562,0.0032891151],"about_ca_topic_score_codex":0.00013650846,"about_ca_topic_score_gemma":0.0002451165,"teacher_disagreement_score":0.78470135,"about_ca_system_score_codex":0.00018485125,"about_ca_system_score_gemma":0.0000751209,"threshold_uncertainty_score":0.9998918},"labels":[],"label_agreement":null},{"id":"W2056991359","doi":"10.1109/bsc.2010.5472956","title":"Lower bounds on the capacity of discrete-time Poisson channels with dark current","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Poisson distribution; Discrete time and continuous time; Upper and lower bounds; Constraint (computer-aided design); Intuition; Mathematics; Channel capacity; Power (physics); Mathematical optimization; Computer science; Applied mathematics; Topology (electrical circuits); Combinatorics; Channel (broadcasting); Mathematical analysis; Physics; Statistics; Telecommunications; Geometry","score_opus":0.013548290611258021,"score_gpt":0.23228703059835576,"score_spread":0.21873873998709775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056991359","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.9679693,0.000031353917,0.0027240862,0.0006610349,0.00017179872,0.00022130445,0.000011663429,0.00051292777,0.027696524],"genre_scores_gemma":[0.99859846,0.000021993706,0.0011977664,0.000028353421,0.00002972167,0.000031318035,0.000004531002,0.000022872006,0.0000649974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994476,0.000023568116,0.00013920997,0.00008900381,0.00016900532,0.00013165089],"domain_scores_gemma":[0.9989896,0.00009195326,0.000033163313,0.0007962274,0.000051300714,0.000037761693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018503278,0.00011833443,0.00012755056,0.000045119334,0.000047922815,0.000029751243,0.00039781176,0.000053653144,0.00022178095],"category_scores_gemma":[0.000021250236,0.000071710034,0.000036950205,0.00011789566,0.00011153374,0.000083052604,0.00004811947,0.00041657587,0.000028703309],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001247213,0.00086363417,0.0013936121,0.00028800988,0.0002821319,0.0000023890889,0.006644263,0.0014320557,0.43295056,0.47642246,0.06290484,0.01669133],"study_design_scores_gemma":[0.0004751923,0.00037297042,0.0027647533,0.00031909448,0.000035245368,0.0000092418895,0.000105012106,0.039631262,0.8492222,0.00792747,0.098252706,0.0008848814],"about_ca_topic_score_codex":0.000032188975,"about_ca_topic_score_gemma":0.000049522056,"teacher_disagreement_score":0.46849498,"about_ca_system_score_codex":0.000016112777,"about_ca_system_score_gemma":0.000007551792,"threshold_uncertainty_score":0.29242504},"labels":[],"label_agreement":null},{"id":"W2057017634","doi":"10.1109/bsc.2010.5473003","title":"Optimization of the end-to-end distortion of a Gaussian source in layered broadcast transmission","year":2010,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Discretization; Computer science; Transmission (telecommunications); Fading; Optimization problem; Channel (broadcasting); Gaussian; Distortion (music); Algorithm; Channel state information; Mathematical optimization; Margin (machine learning); Telecommunications; Wireless; Mathematics; Bandwidth (computing)","score_opus":0.00697825253292999,"score_gpt":0.22004160829852806,"score_spread":0.21306335576559807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057017634","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.35217014,0.000045549925,0.6418188,0.00031501148,0.000049718074,0.00027654454,0.00000462941,0.00017775813,0.005141833],"genre_scores_gemma":[0.9780949,0.000034737754,0.021784645,0.0000093955805,0.000005210795,0.000008188205,0.0000049522223,0.0000148365125,0.000043187672],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945647,0.000029872708,0.00025646685,0.000065165215,0.00011949955,0.00007255562],"domain_scores_gemma":[0.99947727,0.000025144504,0.000043419204,0.00039607007,0.00002999952,0.000028108314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013022538,0.000066097906,0.000106878644,0.00009776892,0.000016658814,0.000004895888,0.0002468192,0.00007598576,0.00015986801],"category_scores_gemma":[0.000017552265,0.000052821277,0.00003644462,0.00026054235,0.00003426842,0.00007078331,0.000031212887,0.00016216261,7.29149e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015488038,0.000103247374,0.0015970587,0.000095144154,0.000008799864,1.0153001e-7,0.003556333,0.40051144,0.474954,0.0013857111,0.00016322525,0.117609456],"study_design_scores_gemma":[0.00023704712,0.00002076371,0.0071402,0.00010778208,0.0000058627593,0.0000016156234,0.00010033427,0.3103711,0.67528313,0.000091288915,0.0065055834,0.00013525206],"about_ca_topic_score_codex":0.00014184849,"about_ca_topic_score_gemma":0.0001384051,"teacher_disagreement_score":0.6259247,"about_ca_system_score_codex":0.000020451613,"about_ca_system_score_gemma":0.000009791381,"threshold_uncertainty_score":0.21539891},"labels":[],"label_agreement":null},{"id":"W2057829329","doi":"10.1109/isit.2013.6620285","title":"Hybrid digital-analog coding for interference broadcast channels","year":2013,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Computer science; Transmitter; Coding (social sciences); Gaussian; Bandwidth (computing); Upper and lower bounds; Algorithm; Topology (electrical circuits); Channel (broadcasting); Mathematics; Telecommunications; Combinatorics; Statistics; Physics","score_opus":0.022937030900259003,"score_gpt":0.24000491730956744,"score_spread":0.21706788640930844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057829329","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.047705453,0.0001437359,0.9076292,0.00031930025,0.00013791914,0.00058212114,0.000028478005,0.0020531213,0.04140065],"genre_scores_gemma":[0.9948958,0.000055693068,0.0042647766,0.0000653036,0.000030016943,0.000219648,0.000027547998,0.000026262198,0.00041493622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949354,0.0000048876636,0.00017706357,0.00009878569,0.000053899752,0.00017180371],"domain_scores_gemma":[0.9994154,0.00008966285,0.000018407998,0.00035099094,0.000074722506,0.00005084347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047308848,0.00010464595,0.00012335293,0.00006804961,0.00003395214,0.00019299293,0.000336032,0.000031725478,0.000198842],"category_scores_gemma":[0.000030588108,0.00010245963,0.000047453177,0.000049903196,0.000023935585,0.00044703006,0.00007888107,0.00008799966,0.00015972306],"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.000011497013,0.00016905149,0.0006885997,0.00051469146,0.00026985834,0.0000025421766,0.0018603344,0.0020235793,0.038957786,0.08586819,0.34558752,0.52404636],"study_design_scores_gemma":[0.00040348253,0.00010930307,0.00019503126,0.00016172015,0.00001323402,0.000021745522,0.00024254853,0.613263,0.27104625,0.027681602,0.08598404,0.00087804487],"about_ca_topic_score_codex":0.000019393661,"about_ca_topic_score_gemma":0.0000017318802,"teacher_disagreement_score":0.94719034,"about_ca_system_score_codex":0.000032425036,"about_ca_system_score_gemma":0.0000035361184,"threshold_uncertainty_score":0.41781825},"labels":[],"label_agreement":null},{"id":"W2058859540","doi":"10.1109/cscwd.2013.6581046","title":"Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"AUTO21 Network of Centres of Excellence","keywords":"Relay; Eavesdropping; Computer network; Rayleigh fading; Computer science; Relay channel; Transmission (telecommunications); Wireless; Wireless network; Fading; Telecommunications; Channel (broadcasting)","score_opus":0.015915206450668094,"score_gpt":0.28601372476941284,"score_spread":0.27009851831874476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058859540","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.97474116,0.00011896286,0.0039389785,0.00010770409,0.000029936435,0.014524903,0.000003820066,0.0009182117,0.005616336],"genre_scores_gemma":[0.971819,0.00010721098,0.0024553426,0.000049926184,0.000018271661,0.02548204,0.0000064347014,0.000032764958,0.000029014622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.00007549692,0.00032604445,0.00017458691,0.00009550717,0.00023623453],"domain_scores_gemma":[0.99933094,0.000060417904,0.000036863614,0.00039772468,0.000097140466,0.00007692327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013898357,0.00017815466,0.00023662396,0.00011424225,0.000038592287,0.00013011177,0.0002637498,0.0001359684,0.0001712983],"category_scores_gemma":[0.000009918183,0.00018182189,0.000021081385,0.00033677582,0.00007946272,0.00044796083,0.00015480557,0.00033622832,0.000020637211],"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.00013058324,0.0023529169,0.32864895,0.0020441995,0.00035988513,0.00008236029,0.0727711,0.010744902,0.05821943,0.0315486,0.11022545,0.38287163],"study_design_scores_gemma":[0.0015441068,0.00022843988,0.07343994,0.0009882292,0.000017387247,0.000019881909,0.004195057,0.8892866,0.017571772,0.0009875104,0.010138092,0.0015830327],"about_ca_topic_score_codex":0.00011595088,"about_ca_topic_score_gemma":0.00039285238,"teacher_disagreement_score":0.87854165,"about_ca_system_score_codex":0.00009017225,"about_ca_system_score_gemma":0.000011183862,"threshold_uncertainty_score":0.74144816},"labels":[],"label_agreement":null},{"id":"W2059207464","doi":"10.1109/tit.2015.2412540","title":"Broadcasting Correlated Vector Gaussians","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Bounding overwatch; Upper and lower bounds; Gaussian; Covariance; Scalar (mathematics); Distortion (music); Algorithm; Mathematics; Computer science; Constraint (computer-aided design); Fading; Bandwidth (computing); Mathematical optimization; Telecommunications; Decoding methods; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.016713693477197186,"score_gpt":0.22503294228414358,"score_spread":0.2083192488069464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059207464","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.0055403356,0.000033853103,0.96216094,0.000057668225,0.0005178358,0.00018176262,0.00002652484,0.0020446568,0.02943644],"genre_scores_gemma":[0.9978124,0.000037328147,0.0017962798,0.00013938107,0.000014022583,0.000066714965,0.000015514472,0.000021201633,0.000097184224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991975,0.00006319748,0.00034010323,0.000054302564,0.0001876112,0.00015731472],"domain_scores_gemma":[0.9992734,0.00010267665,0.00005268458,0.0003628148,0.000103870836,0.000104518804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034597906,0.00013613717,0.00011291885,0.00024980758,0.00010110975,0.00006150082,0.00020742595,0.00011763878,0.00011329421],"category_scores_gemma":[0.000015207226,0.00014545479,0.000052319567,0.00028282782,0.000043275642,0.0010751579,0.0000011535957,0.00035163472,0.00065438513],"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.000153837,0.00011618474,0.0000055167116,0.00011039975,0.00014806232,0.0000016893046,0.02059593,0.6512041,0.00080833526,0.025689648,0.006488343,0.29467797],"study_design_scores_gemma":[0.0025545713,0.00029819776,0.00011601419,0.00031649592,0.0000960918,0.00010731398,0.0053331247,0.73416597,0.17143916,0.009204069,0.07493026,0.0014387531],"about_ca_topic_score_codex":0.0000068794566,"about_ca_topic_score_gemma":0.0000026038624,"teacher_disagreement_score":0.992272,"about_ca_system_score_codex":0.00015335782,"about_ca_system_score_gemma":0.00002947943,"threshold_uncertainty_score":0.8411015},"labels":[],"label_agreement":null},{"id":"W2060201549","doi":"10.1109/iccs.2014.7024783","title":"On secret key generation from multiple observations of wireless channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Key generation; Computer science; Key (lock); Physical layer; Randomness; Pre-shared key; Key distribution; Cryptography; Shared secret; Wireless; Quantization (signal processing); Channel (broadcasting); Key encapsulation; Public-key cryptography; Computer network; Computer security; Algorithm; Telecommunications; Encryption; Mathematics; Statistics","score_opus":0.039991364999266955,"score_gpt":0.23204300008637388,"score_spread":0.19205163508710693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060201549","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.8194883,0.000020826961,0.17737266,0.00014188836,0.000100942314,0.00011004748,0.000018265822,0.0005475358,0.00219956],"genre_scores_gemma":[0.9830218,0.000036221,0.016485253,0.00010041737,0.00006965888,0.000038530306,0.00017898003,0.00002331496,0.000045823046],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994509,0.000040650262,0.0002121798,0.0000951763,0.00011541785,0.000085651096],"domain_scores_gemma":[0.9991872,0.00018006965,0.00003570341,0.00050252187,0.000063120664,0.000031393087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000985587,0.00009173435,0.00013094286,0.000056676916,0.00003498486,0.000017455955,0.00021118781,0.00007852947,0.00006027567],"category_scores_gemma":[0.00004778676,0.00009576038,0.00003238903,0.00010366136,0.000017884478,0.000110249915,0.000029285515,0.000094264615,0.000016857937],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053096037,0.000092706774,0.0014063116,0.000025029753,0.000047506768,1.2876095e-7,0.0011577673,0.042570155,0.6507173,0.28705645,0.0119248545,0.004996491],"study_design_scores_gemma":[0.00012770538,0.000017129478,0.0017631353,0.00001787362,0.0000031116444,6.6338856e-8,0.000012322986,0.7319879,0.26143354,0.0016325517,0.002904893,0.00009977132],"about_ca_topic_score_codex":0.00017511523,"about_ca_topic_score_gemma":0.00017337166,"teacher_disagreement_score":0.6894177,"about_ca_system_score_codex":0.000023950624,"about_ca_system_score_gemma":0.000004111463,"threshold_uncertainty_score":0.39049947},"labels":[],"label_agreement":null},{"id":"W2061534192","doi":"10.1109/glocom.2014.7036875","title":"Relay authentication by exploiting I/Q imbalance in amplify-and-forward system","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":65,"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":"Relay; Computer science; Authentication (law); Wireless; Computer network; Transmission (telecommunications); Fingerprint (computing); Computer security; Telecommunications","score_opus":0.0032413686730903054,"score_gpt":0.1848245326538505,"score_spread":0.1815831639807602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061534192","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.6527311,0.0005053611,0.30490974,0.000349194,0.00007723644,0.00031876424,0.0000049253904,0.0033310151,0.037772663],"genre_scores_gemma":[0.9937721,0.000086977365,0.005946844,0.000031444863,0.000011344833,0.00006638585,0.000011467358,0.000020786347,0.000052648313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943006,0.00004313847,0.00021768616,0.0001046973,0.00007730177,0.00012713051],"domain_scores_gemma":[0.99950063,0.00008468292,0.000027013697,0.00033709244,0.000016039518,0.000034536788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030492715,0.00008167363,0.00011963649,0.00006217219,0.00002759343,0.00003014993,0.00016187194,0.00006954878,0.0000058570513],"category_scores_gemma":[0.000027728318,0.00008653673,0.000012391204,0.00009525301,0.000016832984,0.00012247732,0.000040880874,0.0001371096,0.000023282235],"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.000010984722,0.00010477669,0.028248157,0.0014778262,0.00005837339,0.0000014668402,0.00568465,0.0016551203,0.15509662,0.7486694,0.017602704,0.041389946],"study_design_scores_gemma":[0.00047756967,0.00002512075,0.0067039914,0.00039490545,0.000009949898,0.000010769778,0.0009837877,0.90705884,0.04592742,0.0008516252,0.03700409,0.00055192295],"about_ca_topic_score_codex":0.000029570903,"about_ca_topic_score_gemma":0.00001147085,"teacher_disagreement_score":0.90540373,"about_ca_system_score_codex":0.00006611034,"about_ca_system_score_gemma":0.000001791424,"threshold_uncertainty_score":0.35288656},"labels":[],"label_agreement":null},{"id":"W2061780772","doi":"10.4236/jcc.2014.28007","title":"Multilayer Authentication for Communication Systems Based on Physical-Layer Attributes","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université Laval; Western University","funders":"","keywords":"Physical layer; Computer science; Authentication (law); Randomness; Computer network; Handshake; Mathematics; Computer security; Wireless; Telecommunications","score_opus":0.028760786579213733,"score_gpt":0.27901294223255296,"score_spread":0.25025215565333925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061780772","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.03461451,0.0011761503,0.9599566,0.002584816,0.00014175742,0.0004336223,0.00001641311,0.00022636211,0.0008497633],"genre_scores_gemma":[0.9246749,0.00040241407,0.07460316,0.0001167438,0.00008705652,0.000058641308,0.00002597086,0.000025070647,0.0000059987337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989636,0.00022990363,0.00045520245,0.000075931755,0.00015637021,0.000118987504],"domain_scores_gemma":[0.9964452,0.0013002529,0.0002308777,0.0015637809,0.00038615387,0.000073738694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596127,0.0001369625,0.000272517,0.0001872672,0.00019886177,0.00011269367,0.0010611666,0.00006617895,0.0000010583113],"category_scores_gemma":[0.00004532183,0.00012912949,0.000103820086,0.00013390134,0.0000902988,0.00019243211,0.000115329676,0.00029210793,0.0000029234245],"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.0001482409,0.0026645188,0.0013326813,0.0006252708,0.0005794429,4.4588174e-7,0.007542729,0.23932956,0.010712625,0.45715052,0.031245548,0.24866843],"study_design_scores_gemma":[0.00044841674,0.00013246696,0.0011943344,0.00016418821,0.00003704826,0.0000051763677,0.000028480732,0.9594211,0.00068482204,0.0014960238,0.036259983,0.00012799207],"about_ca_topic_score_codex":0.000002969907,"about_ca_topic_score_gemma":0.0000018217394,"teacher_disagreement_score":0.8900604,"about_ca_system_score_codex":0.000050182098,"about_ca_system_score_gemma":0.000015884527,"threshold_uncertainty_score":0.5265748},"labels":[],"label_agreement":null},{"id":"W2062345990","doi":"10.1109/ciss.2010.5464891","title":"On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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 Toronto","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Topology (electrical circuits); Upper and lower bounds; Channel capacity; Co-channel interference; Simple (philosophy); Computer science; Mathematics; Telecommunications; Algorithm; Combinatorics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.020707263005133925,"score_gpt":0.22740863182386914,"score_spread":0.20670136881873521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062345990","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.8906479,0.000050490467,0.0030660802,0.0011540093,0.00033967537,0.0003458382,0.000008405646,0.0004877546,0.10389984],"genre_scores_gemma":[0.99915236,0.000052117288,0.0004260952,0.0001666561,0.000020538571,0.000041624822,6.9784693e-7,0.000022759976,0.00011717254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992091,0.00006500922,0.00024150353,0.00011280971,0.00019954846,0.0001720107],"domain_scores_gemma":[0.9980323,0.00046384503,0.00006279629,0.0013435829,0.00005815667,0.000039354796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033046468,0.00014016205,0.0001490494,0.0002744988,0.00008054024,0.00003099708,0.0012764473,0.00011063921,0.00012313569],"category_scores_gemma":[0.00034396513,0.000077210716,0.000083369734,0.0013870151,0.00011926316,0.00007539322,0.00017831012,0.0007461053,0.000035325666],"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.0000024967817,0.00008162651,0.00043281858,0.000035723217,0.000034882232,1.4283276e-7,0.00047388856,0.000068666435,0.018888118,0.9739175,0.0032172296,0.0028469109],"study_design_scores_gemma":[0.0002728493,0.000088876215,0.041553415,0.00015720612,0.000029877567,0.000011610734,0.00020985093,0.035634454,0.8867873,0.028825434,0.0058632726,0.00056588533],"about_ca_topic_score_codex":0.00012629942,"about_ca_topic_score_gemma":0.00017626844,"teacher_disagreement_score":0.9450921,"about_ca_system_score_codex":0.000029725641,"about_ca_system_score_gemma":0.000008812286,"threshold_uncertainty_score":0.3241498},"labels":[],"label_agreement":null},{"id":"W2062461383","doi":"10.1109/isit.2007.4557105","title":"Robust Joint Source-Channel Coding for Delay-Limited Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Channel code; Additive white Gaussian noise; Computer science; Coding (social sciences); Decoding methods; Algorithm; Gaussian; Channel (broadcasting); Joint (building); Mathematics; Topology (electrical circuits); Telecommunications; Statistics; Engineering","score_opus":0.05354148330121049,"score_gpt":0.257205235058186,"score_spread":0.2036637517569755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062461383","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.0022785934,0.00013284067,0.98192096,0.00013686418,0.000029140714,0.000570631,0.000006421002,0.0022070853,0.012717461],"genre_scores_gemma":[0.8961309,0.00008310321,0.10297263,0.000118077805,0.00006328753,0.0003361807,0.000038773418,0.000048219856,0.00020882665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992864,0.0000062294334,0.00027490637,0.00011785331,0.000082608414,0.00023197007],"domain_scores_gemma":[0.9992024,0.00014655844,0.000030615265,0.00046000342,0.000088914254,0.00007152483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033857278,0.00011171362,0.00012236349,0.0001480896,0.00010570957,0.000029563702,0.00023334235,0.00009588513,0.000026353711],"category_scores_gemma":[0.000018959021,0.00012297476,0.00006208938,0.00019734456,0.000025029729,0.00008168362,0.000050138297,0.00013022353,0.000022587337],"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.000052009633,0.00051284564,0.00029926273,0.00087885745,0.00040605039,0.0000033468673,0.0047165304,0.15297407,0.12591381,0.41362765,0.09235266,0.2082629],"study_design_scores_gemma":[0.00047111817,0.00003372042,0.00027437395,0.000048622587,0.00002780637,0.000015798252,0.0006485481,0.5774552,0.15520796,0.0034625025,0.26172915,0.00062518026],"about_ca_topic_score_codex":0.000012601071,"about_ca_topic_score_gemma":0.000046369074,"teacher_disagreement_score":0.8938523,"about_ca_system_score_codex":0.00007432956,"about_ca_system_score_gemma":0.0000050329145,"threshold_uncertainty_score":0.50147647},"labels":[],"label_agreement":null},{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"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":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","score_opus":0.01790983207713149,"score_gpt":0.23509185783253725,"score_spread":0.21718202575540577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062610219","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.00085504545,0.000025191364,0.99155426,0.000529199,0.0002730726,0.00035502788,0.00004832701,0.0007273623,0.0056324885],"genre_scores_gemma":[0.9980506,0.0001160287,0.0010316155,0.0005413071,0.000017097287,0.00018718556,0.0000066226653,0.000008748274,0.000040837433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941367,0.000029282013,0.0002631932,0.000049358296,0.000099646524,0.00014484584],"domain_scores_gemma":[0.99922264,0.00020572281,0.000043713495,0.000423235,0.0000682246,0.00003645203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033126527,0.00012072617,0.00009130211,0.00014243707,0.0002576296,0.00008829095,0.00032941444,0.00008048855,0.000044394583],"category_scores_gemma":[0.000007684526,0.00009884317,0.00007907436,0.00014850147,0.000057122645,0.0007952858,6.165681e-7,0.0002578593,0.000049008566],"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.00016908837,0.000108188935,2.7099128e-7,0.000102250284,0.00011777053,8.2476184e-8,0.01565024,0.110613115,0.00084845943,0.17837752,0.0029445023,0.6910685],"study_design_scores_gemma":[0.0011826815,0.0004559861,0.0002517491,0.0001995579,0.000092756185,0.00002423136,0.002175397,0.5821549,0.25095493,0.11607046,0.045510713,0.0009266047],"about_ca_topic_score_codex":0.0000030574847,"about_ca_topic_score_gemma":0.0000057752677,"teacher_disagreement_score":0.9971955,"about_ca_system_score_codex":0.000074325035,"about_ca_system_score_gemma":0.000010797298,"threshold_uncertainty_score":0.40307075},"labels":[],"label_agreement":null},{"id":"W2065494002","doi":"10.1109/isit.2014.6874876","title":"An improved outer bound on the admissible source region for broadcast channels with correlated sources","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Lossy compression; Upper and lower bounds; Computer science; Atomic broadcast; Broadcasting (networking); Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Mathematical analysis; Artificial intelligence","score_opus":0.017200261403597168,"score_gpt":0.22987020666400687,"score_spread":0.2126699452604097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065494002","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.28675705,0.000060709473,0.7035584,0.0013742353,0.00008548419,0.0007951237,0.0000023400667,0.0022253017,0.005141346],"genre_scores_gemma":[0.9961772,0.000013231027,0.0022125896,0.0004286493,0.00006810022,0.00015287338,0.000014038492,0.00006339828,0.00086992234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933183,0.00005031248,0.00015598212,0.00015937605,0.00009349405,0.00020903314],"domain_scores_gemma":[0.9988287,0.00017606419,0.00004591872,0.0008111971,0.00006351178,0.00007462737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020832966,0.0001634632,0.0001398861,0.000062987994,0.00015576801,0.00013760856,0.00042084072,0.00010161901,0.00002505968],"category_scores_gemma":[0.000025007044,0.00010543604,0.00003863269,0.00010533046,0.00005182302,0.00013707309,0.000027144155,0.00019101184,0.000010337834],"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.0016794914,0.0015347233,0.0022553788,0.0009051387,0.0011389835,0.000006712843,0.04461905,0.1743815,0.090133354,0.12832978,0.14618506,0.40883085],"study_design_scores_gemma":[0.0003960925,0.00044958564,0.000048009857,0.00007055562,0.000014634981,0.00000760693,0.00025960634,0.84652287,0.041328743,0.00056271633,0.110049926,0.00028967138],"about_ca_topic_score_codex":0.00003337462,"about_ca_topic_score_gemma":0.000025024385,"teacher_disagreement_score":0.70942014,"about_ca_system_score_codex":0.000026802343,"about_ca_system_score_gemma":0.000007945423,"threshold_uncertainty_score":0.4299557},"labels":[],"label_agreement":null},{"id":"W2065706027","doi":"10.1109/isit.2012.6284012","title":"On the sum-capacity of Gaussian MAC with peak constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Constraint (computer-aided design); Channel (broadcasting); Gaussian; Uniqueness; Code (set theory); Computer science; Channel capacity; Topology (electrical circuits); Algorithm; Mathematics; Mathematical optimization; Telecommunications; Combinatorics; Mathematical analysis; Physics; Geometry","score_opus":0.025162873293544104,"score_gpt":0.2280568128344977,"score_spread":0.20289393954095358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065706027","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.6989254,0.0000889665,0.014942677,0.0006384192,0.000031265467,0.00021996243,0.000010419248,0.00060664525,0.28453627],"genre_scores_gemma":[0.99610424,0.000023715278,0.0037419167,0.00007121067,0.000009371191,0.000015087828,0.0000016107117,0.000011821241,0.000021031905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996265,0.000028229624,0.00009870058,0.000035044748,0.00009425298,0.00011728301],"domain_scores_gemma":[0.9993741,0.00011243011,0.000019713554,0.00044022332,0.00001926611,0.00003425531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016858506,0.00006943458,0.00007930257,0.000027852388,0.000023276882,0.000004965478,0.0001879177,0.000033010278,0.00029919384],"category_scores_gemma":[0.000012071498,0.00004128525,0.00002010439,0.000069592345,0.0001051308,0.000060447368,0.000022046172,0.0001409774,0.00001586629],"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.0000040843934,0.000055983153,0.0012308756,0.000026858947,0.000034858513,1.2316038e-7,0.0009927596,0.000059496622,0.0051911348,0.9874089,0.0037239345,0.0012709963],"study_design_scores_gemma":[0.00049056136,0.0001764589,0.030480247,0.00025894013,0.00003564065,0.000032444503,0.001698431,0.0073900977,0.9252741,0.0064908788,0.026943278,0.00072894176],"about_ca_topic_score_codex":0.000027472151,"about_ca_topic_score_gemma":0.000024931365,"teacher_disagreement_score":0.980918,"about_ca_system_score_codex":0.000018606774,"about_ca_system_score_gemma":0.00000384705,"threshold_uncertainty_score":0.32759628},"labels":[],"label_agreement":null},{"id":"W2065940652","doi":"10.1117/12.838868","title":"Inter-bit prediction based on maximum likelihood estimate for distributed video coding","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Wireless Communication Security Techniques","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Encoder; Decoding methods; Parity bit; Bit plane; Algorithm; Bit field; Bit error rate; Coding (social sciences); Bitstream; Bit rate; Coding gain; Computational complexity theory; Real-time computing; Mathematics; Statistics","score_opus":0.010917768140061688,"score_gpt":0.23887931835157433,"score_spread":0.22796155021151265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065940652","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.9795495,0.00006203512,0.0132065425,0.0030056245,0.00024475576,0.0010865805,0.00038547473,0.0008371066,0.00162234],"genre_scores_gemma":[0.83786,0.00007569545,0.16118245,0.00011958687,0.00022964574,0.00035093052,0.00008537764,0.00008423144,0.000012119379],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978065,2.350223e-8,0.0008190799,0.00035918324,0.000545226,0.00046997506],"domain_scores_gemma":[0.9979835,0.00023146012,0.000268764,0.00013247134,0.001247584,0.00013621098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006424297,0.00039987176,0.00045673945,0.00017632524,0.00010829646,0.00015073364,0.0011305227,0.00026558302,0.000007156081],"category_scores_gemma":[0.00052959094,0.00037978782,0.00060506706,0.00035517855,0.00011621867,0.00051816704,0.00008386238,0.00042527265,0.0000012179613],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025081748,0.00033629432,0.00024227299,0.0010491731,0.00039995872,1.0436085e-7,0.00022557854,0.00468274,0.63076735,0.34270525,0.015716057,0.0036243922],"study_design_scores_gemma":[0.0012568532,0.00061208796,0.0006648688,0.00077490375,0.00012386224,0.0000055199416,0.00019984877,0.7516803,0.23393069,0.006053981,0.0042771506,0.00041992837],"about_ca_topic_score_codex":0.0000023612886,"about_ca_topic_score_gemma":1.2076529e-7,"teacher_disagreement_score":0.74699754,"about_ca_system_score_codex":0.00033978655,"about_ca_system_score_gemma":0.00002255798,"threshold_uncertainty_score":0.9998654},"labels":[],"label_agreement":null},{"id":"W2066459959","doi":"10.1109/lcomm.2013.060513.130802","title":"Artificial-Noise Alignment for Secure Multicast using Multiple Antennas","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"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 Toronto","funders":"","keywords":"Artificial noise; Computer science; Secure multicast; Transmitter; Noise (video); Channel (broadcasting); Generalization; Degrees of freedom (physics and chemistry); Theoretical computer science; Multicast; Upper and lower bounds; Topology (electrical circuits); Algorithm; Computer network; Artificial intelligence; Mathematics; Physics","score_opus":0.05689635463289886,"score_gpt":0.28558247761475164,"score_spread":0.22868612298185279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066459959","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.5212351,0.0006808942,0.46308553,0.010026445,0.00037691375,0.0024153797,0.00009042133,0.0017263998,0.00036291603],"genre_scores_gemma":[0.8667988,0.00018151483,0.13128664,0.00069995376,0.00005725154,0.0008327304,0.000064414875,0.00007179099,0.0000069008634],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987626,0.00010099118,0.00048214302,0.0001790866,0.0001424492,0.00033269773],"domain_scores_gemma":[0.9963329,0.00042285037,0.00008611453,0.002923351,0.00013975776,0.00009504964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019058533,0.00022193018,0.00022444507,0.00016964391,0.00031770888,0.00012425511,0.0014450254,0.000102688224,0.000022567783],"category_scores_gemma":[0.000052528907,0.00025609595,0.00011787193,0.00022850737,0.00019377923,0.00033955174,0.0001831982,0.000283602,0.00007445968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034335958,0.00014738711,0.0003417388,0.00005923403,0.00008956334,3.4690652e-7,0.0013747192,0.006594611,0.96825325,0.00092821184,0.015488978,0.0067185382],"study_design_scores_gemma":[0.0002364198,0.000012611359,0.00032164704,0.000086809436,0.000035074765,0.000004688712,0.0002897687,0.92395484,0.052782197,0.00045510245,0.021368923,0.000451907],"about_ca_topic_score_codex":0.00014925917,"about_ca_topic_score_gemma":0.00007110068,"teacher_disagreement_score":0.91736025,"about_ca_system_score_codex":0.0002211536,"about_ca_system_score_gemma":0.000013737749,"threshold_uncertainty_score":0.99998915},"labels":[],"label_agreement":null},{"id":"W2066761070","doi":"10.1109/icassp.2014.6854702","title":"On the accuracy of the high SNR approximation of the differential entropy of signals in additive Gaussian noise","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Gaussian noise; Transmitter; Mathematics; Taylor series; Gaussian; Computation; Signal-to-noise ratio (imaging); Algorithm; Upper and lower bounds; Entropy (arrow of time); Computer science; Applied mathematics; Telecommunications; Channel (broadcasting); Mathematical analysis; Statistics; Physics","score_opus":0.008650754638183414,"score_gpt":0.21616833091199703,"score_spread":0.20751757627381362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066761070","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.98710394,0.000010402256,0.007681807,0.00081333297,0.00004642106,0.000469319,0.000026693031,0.000048121325,0.0037999726],"genre_scores_gemma":[0.9996239,0.000021679762,0.00024642624,0.000031970325,0.0000097997645,0.00003565603,0.000004112925,0.00001082201,0.000015652417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999116,0.00022635478,0.00031136852,0.00006164733,0.00020553463,0.00007908673],"domain_scores_gemma":[0.9984426,0.0005902093,0.00017594814,0.0007300465,0.000051881183,0.000009334115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019157866,0.000086895394,0.00015807309,0.000045413835,0.000025326903,0.0000063363254,0.0006347502,0.000053321717,0.00017813923],"category_scores_gemma":[0.00023993141,0.000042059914,0.00007461311,0.00018115659,0.00010134978,0.000053335447,0.000118859796,0.00016696862,0.0000012196708],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002690285,0.00020304152,0.00041538195,0.00010762761,0.000051002393,1.9862807e-8,0.0024301622,0.0023638632,0.2658963,0.7220029,0.0014850688,0.0050177136],"study_design_scores_gemma":[0.00016836067,0.00002025323,0.024197288,0.00015286115,0.000008735061,1.08523565e-7,0.00009704752,0.0303385,0.9357568,0.009105327,0.000097373646,0.000057366833],"about_ca_topic_score_codex":0.00009763961,"about_ca_topic_score_gemma":0.000043551536,"teacher_disagreement_score":0.7128976,"about_ca_system_score_codex":0.000022533386,"about_ca_system_score_gemma":0.000008849526,"threshold_uncertainty_score":0.19504996},"labels":[],"label_agreement":null},{"id":"W2069080345","doi":"10.1109/glocom.2011.6134247","title":"MIMO Broadcast Channel with Arbitrarily Varying Eavesdropper Channel: Secrecy Degrees of Freedom","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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 Toronto","funders":"","keywords":"MIMO; Transmitter; Computer science; Secrecy; Channel (broadcasting); Information-theoretic security; Channel state information; Precoding; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Artificial noise; Computer network; Telecommunications; Wireless; Mathematics; Computer security; Physics; Combinatorics","score_opus":0.03488481493504921,"score_gpt":0.21617879358492356,"score_spread":0.18129397864987434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069080345","genre_codex":"other","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.3261127,0.0021207326,0.25670227,0.00010978681,0.00028517438,0.0010110595,0.000043075797,0.0050498596,0.40856534],"genre_scores_gemma":[0.9543385,0.0001751777,0.045199808,0.000027608325,0.000034621316,0.00005208862,0.000008789712,0.00007446086,0.00008898295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989762,0.000029772325,0.0003237113,0.00018631184,0.0001931162,0.0002909013],"domain_scores_gemma":[0.9989079,0.00004081857,0.00006600711,0.00077954814,0.0001086574,0.00009702582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013027075,0.00023982761,0.00029829863,0.00019886832,0.000051306735,0.000017712353,0.0005412359,0.00013241284,0.00018900353],"category_scores_gemma":[0.000008976878,0.00021174065,0.00006700902,0.00026532594,0.00011434123,0.00021030636,0.00010842087,0.0002687406,0.0000224988],"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.0013379476,0.0044311807,0.012972187,0.004968013,0.00486634,0.00023410594,0.20872653,0.18761146,0.16628136,0.34639698,0.020921277,0.041252617],"study_design_scores_gemma":[0.0022397665,0.0007767624,0.009279346,0.0010206143,0.00014573979,0.00014587476,0.0022034838,0.518862,0.456036,0.0043178373,0.002459273,0.0025132888],"about_ca_topic_score_codex":0.0007198642,"about_ca_topic_score_gemma":0.00016440777,"teacher_disagreement_score":0.62822574,"about_ca_system_score_codex":0.000029752915,"about_ca_system_score_gemma":0.00001822131,"threshold_uncertainty_score":0.8634533},"labels":[],"label_agreement":null},{"id":"W2069459718","doi":"10.1109/isit.2013.6620736","title":"On The effect of self-interference in Gaussian two-way channels with erased outputs","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Interference (communication); Computer science; Gaussian; Upper and lower bounds; Channel (broadcasting); Topology (electrical circuits); Binary erasure channel; Transmission (telecommunications); Algorithm; Gaussian noise; Telecommunications; Mathematics; Physics; Channel capacity; Combinatorics; Mathematical analysis","score_opus":0.0071755537532816865,"score_gpt":0.21807591866640486,"score_spread":0.21090036491312317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069459718","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.96625274,0.000029396308,0.005507347,0.00034851083,0.000024655308,0.0005649477,8.727833e-7,0.0005420837,0.026729414],"genre_scores_gemma":[0.9989808,0.000009738955,0.00073709263,0.00004235445,0.000005565533,0.00017858148,0.0000011016775,0.000017598144,0.0000271357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994553,0.00008489536,0.00014290794,0.00008161204,0.00011021539,0.00012509493],"domain_scores_gemma":[0.99910825,0.00030444856,0.000024088575,0.00050917914,0.000028713761,0.00002530874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002112465,0.000114788534,0.00014928293,0.000080329155,0.000014772615,0.000023856892,0.00033398735,0.000037011243,0.00014888699],"category_scores_gemma":[0.000020321946,0.00006467854,0.00002079535,0.00014462457,0.000025570132,0.000081295875,0.000034208577,0.00018348494,0.000047063804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049686135,0.0012661786,0.04878025,0.002441005,0.0010779889,0.000031641015,0.037938755,0.043570105,0.199414,0.5456496,0.047688782,0.07164483],"study_design_scores_gemma":[0.0007625732,0.0006339085,0.0034401708,0.00038600684,0.000007606784,0.0000025794177,0.000080160615,0.087779805,0.90570307,0.0007616062,0.00015168538,0.00029081467],"about_ca_topic_score_codex":0.00018860318,"about_ca_topic_score_gemma":0.00010291859,"teacher_disagreement_score":0.7062891,"about_ca_system_score_codex":0.00004082424,"about_ca_system_score_gemma":0.0000039903116,"threshold_uncertainty_score":0.26375142},"labels":[],"label_agreement":null},{"id":"W2070207987","doi":"10.1109/vtcfall.2014.6966172","title":"Secret Key Generation Using Physical Channels with Imperfect CSI","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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":"Key generation; Computer science; Secrecy; Randomness; Key (lock); Imperfect; Quantization (signal processing); Channel (broadcasting); Wireless; Computer network; Information-theoretic security; Computer security; Reliability (semiconductor); Cryptography; Telecommunications; Algorithm; Mathematics","score_opus":0.019964571945250975,"score_gpt":0.2420222333344565,"score_spread":0.22205766138920552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070207987","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.71518755,0.000015819793,0.2793938,0.00003165064,0.000032594184,0.000084663785,5.1435694e-7,0.0007431638,0.0045102276],"genre_scores_gemma":[0.983758,0.000010116096,0.015889352,0.00004703826,0.0002131463,0.000016738648,0.000012334251,0.000031634427,0.000021660424],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995561,0.00003648926,0.00008644482,0.00009575177,0.000101230886,0.0001239293],"domain_scores_gemma":[0.9995282,0.000025959536,0.000015374755,0.00035430037,0.000037848644,0.00003829744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372755,0.00010382992,0.000115911964,0.000047125883,0.000049152135,0.000046320918,0.000132306,0.00004321936,0.00001946535],"category_scores_gemma":[0.000006832025,0.00008902968,0.000023709415,0.000103313054,0.000020670977,0.00016131351,0.000028347687,0.00010810155,0.000012784354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007166405,0.000073854535,0.00028172816,0.000058874477,0.000069309695,0.0000010138234,0.0029074103,0.11673515,0.8265093,0.03998239,0.0021105474,0.011263277],"study_design_scores_gemma":[0.00007905349,0.000027675618,0.000022431894,0.000009749641,0.0000050564504,0.0000034216832,0.000010049666,0.80407995,0.19406071,0.00013193926,0.0014522774,0.00011767146],"about_ca_topic_score_codex":0.000022497095,"about_ca_topic_score_gemma":0.000019028872,"teacher_disagreement_score":0.6873448,"about_ca_system_score_codex":0.000036768546,"about_ca_system_score_gemma":0.0000054836923,"threshold_uncertainty_score":0.3630525},"labels":[],"label_agreement":null},{"id":"W2070558457","doi":"10.1109/cwit.2011.5872117","title":"On the capacity of the cognitive Z-interference channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Transmitter; Decoding methods; Interference (communication); Channel (broadcasting); Upper and lower bounds; Superposition principle; Coding (social sciences); Topology (electrical circuits); Encoding (memory); Computer science; Cognitive radio; Gaussian; Code word; Channel capacity; Telecommunications; Mathematics; Algorithm; Physics; Combinatorics; Wireless; Artificial intelligence; Statistics","score_opus":0.07092055491466762,"score_gpt":0.22586448396927214,"score_spread":0.15494392905460452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070558457","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.70705855,0.00001875164,0.013628046,0.00015509591,0.000057231628,0.00020637416,0.000008766605,0.00027545443,0.27859175],"genre_scores_gemma":[0.9996652,0.000017302935,0.00014128289,0.00010774908,0.0000029205412,0.000022427155,2.0702565e-7,0.0000064739247,0.00003645831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999732,0.000035059184,0.000080203725,0.000038600432,0.00005626587,0.000057879806],"domain_scores_gemma":[0.9994569,0.00012491994,0.000018950084,0.00034849474,0.00004145387,0.000009326419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086874934,0.000051296567,0.00005127038,0.0000141003875,0.000027925276,0.000003436712,0.00037626928,0.000026606765,0.0001650488],"category_scores_gemma":[0.000045286753,0.000026818465,0.000029011444,0.0000665846,0.00008262606,0.000027486538,0.00006398801,0.00013984044,0.000015457132],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002048941,0.00016146693,0.0004661334,0.000046733425,0.00010474223,2.5331087e-7,0.02410522,0.000028796103,0.008070845,0.96027076,0.004300456,0.00242412],"study_design_scores_gemma":[0.00005003682,0.00002731286,0.0047040335,0.00010926087,0.000005573618,8.5459004e-7,0.00045570268,0.0038228976,0.97154033,0.019137643,0.000063264364,0.00008306272],"about_ca_topic_score_codex":0.000066644374,"about_ca_topic_score_gemma":0.00004976588,"teacher_disagreement_score":0.9634695,"about_ca_system_score_codex":0.000008320093,"about_ca_system_score_gemma":0.0000025992506,"threshold_uncertainty_score":0.18071686},"labels":[],"label_agreement":null},{"id":"W2071160621","doi":"10.1007/s00220-008-0624-0","title":"Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p &gt; 1","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Counterexample; Conjecture; Von Neumann entropy; Quantum; Classical capacity; Entropy (arrow of time); Quantum channel; Quantum mutual information; Joint quantum entropy","score_opus":0.09462451070217012,"score_gpt":0.32552309451919936,"score_spread":0.23089858381702924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071160621","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.045282964,0.00077872525,0.93068945,0.0073503456,0.00004873755,0.0028440235,0.00015409614,0.0011302547,0.011721379],"genre_scores_gemma":[0.8411782,0.00033269078,0.15689363,0.00025605317,0.000029538776,0.0011935838,0.000051410505,0.000043663644,0.000021247914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989716,0.00008766364,0.00039016388,0.00014978532,0.00015341595,0.00024741457],"domain_scores_gemma":[0.99503094,0.0013634685,0.00005334398,0.0033983593,0.00009199566,0.000061906314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030810354,0.00018710441,0.00027206086,0.000050011186,0.00022723954,0.000034302262,0.0021755565,0.00008871119,0.00001005303],"category_scores_gemma":[0.00018743362,0.00015863664,0.0000906178,0.00031375777,0.00026409086,0.00012224271,0.00047058647,0.00039164527,0.000076625416],"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.000015460473,0.00091436773,0.00027609427,0.00025140255,0.00010545388,6.976716e-7,0.013419791,0.0034387093,0.0027910005,0.94161546,0.019499352,0.017672192],"study_design_scores_gemma":[0.00061237393,0.000052889605,0.0014060047,0.00018483504,0.000037078644,0.000025145573,0.00025484353,0.38490483,0.0051924502,0.32835314,0.27826774,0.00070863834],"about_ca_topic_score_codex":0.0000069868106,"about_ca_topic_score_gemma":0.000056205172,"teacher_disagreement_score":0.7958952,"about_ca_system_score_codex":0.00011524031,"about_ca_system_score_gemma":0.000017182054,"threshold_uncertainty_score":0.6469015},"labels":[],"label_agreement":null},{"id":"W2071161309","doi":"10.1109/isplc.2014.6812346","title":"Physical layer security in MIMO power line communication networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Physical layer; Power-line communication; Secrecy; MIMO; Computer science; Computer network; Wireless; Electronic engineering; Transmission (telecommunications); Communications system; Channel (broadcasting); Power (physics); Telecommunications; Engineering; Computer security","score_opus":0.009938803045263723,"score_gpt":0.2523434800962641,"score_spread":0.24240467705100038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071161309","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.78887296,0.0005260244,0.08180879,0.00084815786,0.00007486963,0.00032627993,0.0000021666856,0.0023363554,0.12520438],"genre_scores_gemma":[0.99687076,0.00018771167,0.0026566524,0.00014682481,0.000031871758,0.000036950772,0.000019194173,0.000027573033,0.000022493046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932307,0.000111597845,0.00020140014,0.00010119109,0.00009423516,0.00016851084],"domain_scores_gemma":[0.99877703,0.0001614343,0.000022870283,0.0009578606,0.00003756232,0.00004325807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027910175,0.00011846288,0.00017037264,0.00006999251,0.000030856103,0.000027847645,0.00045674812,0.00010032723,0.00005189176],"category_scores_gemma":[0.000024894374,0.00012261722,0.000040662257,0.00020144401,0.000039558356,0.00014786431,0.00013339147,0.00040991075,0.000033062326],"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.000050127357,0.0017303639,0.009316348,0.00017487003,0.00012686756,0.0000030850176,0.014103969,0.17285697,0.012333307,0.6917513,0.048456784,0.049096026],"study_design_scores_gemma":[0.00019899574,0.000023368633,0.0013422443,0.000033634897,0.0000027536396,9.073588e-7,0.000037941074,0.973814,0.0048853485,0.00637086,0.013087273,0.00020267784],"about_ca_topic_score_codex":0.00005396165,"about_ca_topic_score_gemma":0.00027107334,"teacher_disagreement_score":0.800957,"about_ca_system_score_codex":0.00004579807,"about_ca_system_score_gemma":0.000002975909,"threshold_uncertainty_score":0.50001854},"labels":[],"label_agreement":null},{"id":"W2072266431","doi":"10.1109/icc.2014.6883407","title":"Bounds on secret key rates in fading channels under practical channel estimation schemes","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Key (lock); Key generation; Computer science; Channel (broadcasting); Fading; Computer network; Upper and lower bounds; Pre-shared key; Wireless; Key distribution; Public-key cryptography; Computer security; Telecommunications; Mathematics; Encryption","score_opus":0.03126642646143379,"score_gpt":0.3098824490818715,"score_spread":0.2786160226204377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072266431","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.17846312,0.00006891342,0.7826814,0.002646605,0.00017326238,0.00030235408,0.0000014418458,0.0018063795,0.03385651],"genre_scores_gemma":[0.9822412,0.000048768372,0.017277608,0.00022448107,0.00003912188,0.000060055514,0.000020536603,0.00003426468,0.000053972257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992068,0.00006609189,0.00022703354,0.00014327111,0.00014764306,0.00020918548],"domain_scores_gemma":[0.99923974,0.0002710221,0.00003158795,0.00037174235,0.000033809614,0.00005207022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036703097,0.00014458012,0.00016119296,0.00019618958,0.00004929616,0.00009054372,0.00016557987,0.00012519052,0.000053914657],"category_scores_gemma":[0.00016036264,0.00014826789,0.000027240329,0.0002014916,0.00003024609,0.0003390282,0.00005007493,0.00028703792,0.00007604141],"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.000026018382,0.00020628587,0.00024880772,0.00017233452,0.00005312424,0.0000028347897,0.0023309852,0.21764387,0.0062426366,0.7604972,0.0042031435,0.008372736],"study_design_scores_gemma":[0.00017172574,0.00003296941,0.00023035887,0.00007720655,0.000002660734,0.0000029800551,0.000082168845,0.94185925,0.04224503,0.012756472,0.0023469809,0.00019220985],"about_ca_topic_score_codex":0.000020658517,"about_ca_topic_score_gemma":0.000023731534,"teacher_disagreement_score":0.80377805,"about_ca_system_score_codex":0.00009764487,"about_ca_system_score_gemma":0.000009023162,"threshold_uncertainty_score":0.6046189},"labels":[],"label_agreement":null},{"id":"W2072267094","doi":"10.1109/milcom.2013.219","title":"Inferring Wireless Communications Links and Network Topology from Externals Using Granger Causality","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Robustness (evolution); Network topology; Inference; Wireless ad hoc network; Computer network; Wireless network; Wireless; Causality (physics); Granger causality; Topology (electrical circuits); Distributed computing; Data mining; Machine learning; Artificial intelligence; Telecommunications; Mathematics","score_opus":0.03929304619211728,"score_gpt":0.28989824572819983,"score_spread":0.25060519953608257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072267094","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.9447954,0.002507796,0.047576502,0.00050972233,0.00007860069,0.0002545709,0.000006401306,0.00089007866,0.0033809105],"genre_scores_gemma":[0.94812185,0.0015427727,0.049921043,0.0002301628,0.000058129066,0.000058859434,0.000013811636,0.000030032981,0.000023344786],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915016,0.00011211079,0.0003072692,0.00013263417,0.00007571085,0.00022214162],"domain_scores_gemma":[0.9982339,0.00031201946,0.000045319342,0.0012620046,0.00006659383,0.00008013348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015206219,0.00014327157,0.00022661615,0.00005128586,0.0001408736,0.00008852247,0.00052752707,0.0002268852,0.00023626497],"category_scores_gemma":[0.000015212589,0.00015197761,0.00003102841,0.00011587184,0.00015101669,0.0002712465,0.00043861143,0.00046543317,0.000022436461],"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.000013913572,0.00033081364,0.43687004,0.0002595356,0.00091378944,0.000007318342,0.0070437742,0.010078075,0.20658943,0.14059293,0.015433074,0.18186732],"study_design_scores_gemma":[0.0003239585,0.000018115627,0.07082238,0.0002494235,0.000050117305,0.000014526645,0.00023682529,0.88171273,0.006855253,0.030825939,0.008065579,0.0008251427],"about_ca_topic_score_codex":0.0044968785,"about_ca_topic_score_gemma":0.00073476194,"teacher_disagreement_score":0.87163466,"about_ca_system_score_codex":0.000046329144,"about_ca_system_score_gemma":0.000007488097,"threshold_uncertainty_score":0.6797965},"labels":[],"label_agreement":null},{"id":"W2075357945","doi":"10.1109/itw.2014.6970892","title":"Dirty interference cancellation for Gaussian broadcast channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Transmitter; Channel (broadcasting); Computer science; Interference (communication); Transmission (telecommunications); Gaussian; Computer network; Channel state information; Focus (optics); Topology (electrical circuits); Telecommunications; Independent and identically distributed random variables; Mathematics; Wireless; Engineering; Random variable; Electrical engineering; Physics","score_opus":0.017653772644025015,"score_gpt":0.24799722717825115,"score_spread":0.23034345453422614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075357945","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.0075530987,0.0000675469,0.9502673,0.0002487589,0.00014762094,0.00020539625,0.0000037887075,0.001002262,0.040504202],"genre_scores_gemma":[0.98852646,0.000050330313,0.010923537,0.000049894505,0.00005977123,0.0000793919,0.000013135635,0.000018330591,0.0002791296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962896,0.000012706233,0.00012406336,0.00007938079,0.00004330092,0.00011156039],"domain_scores_gemma":[0.99956506,0.000056137244,0.000016747086,0.00029531526,0.000034211524,0.000032518372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010267296,0.00007453689,0.000086541266,0.000045099554,0.000032312277,0.000029869903,0.00018447041,0.000047588823,0.000053974614],"category_scores_gemma":[0.000017152692,0.000072880655,0.000025035959,0.00005733158,0.000014485032,0.00008804821,0.000026647476,0.000062691266,0.000016051034],"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.000027066515,0.00007333156,0.00063333317,0.0004595859,0.00006624619,2.0186198e-7,0.0033420469,0.016184337,0.04314458,0.2286884,0.053406708,0.6539742],"study_design_scores_gemma":[0.00017739131,0.000044086868,0.00023294153,0.000051087638,0.000004167533,0.0000010253158,0.00003384251,0.7176145,0.0988362,0.004267568,0.17850623,0.00023097664],"about_ca_topic_score_codex":0.000025158906,"about_ca_topic_score_gemma":0.000053241714,"teacher_disagreement_score":0.98097336,"about_ca_system_score_codex":0.00003377103,"about_ca_system_score_gemma":0.0000031925306,"threshold_uncertainty_score":0.29719868},"labels":[],"label_agreement":null},{"id":"W2077664724","doi":"10.1109/infocom.2014.6848161","title":"Scheduling in a secure wireless network","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless network; Base station; Wireless; Distributed computing; Computer network; Dynamic priority scheduling; Fair-share scheduling; Maximum throughput scheduling; Round-robin scheduling; Mathematical optimization; Quality of service","score_opus":0.007122276794472298,"score_gpt":0.21350025301028813,"score_spread":0.20637797621581583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077664724","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.7070443,0.00035337036,0.21378301,0.0002479166,0.00011200689,0.00016508946,4.6514262e-7,0.0023927696,0.0759011],"genre_scores_gemma":[0.9699203,0.00009118343,0.029752273,0.00010302596,0.000061542865,0.000024592597,0.0000030624822,0.000023382256,0.000020664047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994753,0.000034491706,0.00016092698,0.000080468984,0.000068596986,0.00018020296],"domain_scores_gemma":[0.9995202,0.00006444842,0.000011751041,0.00035588094,0.000014975613,0.00003277026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002329133,0.000084008934,0.0001200234,0.000055048826,0.000021447737,0.000021483207,0.00023813974,0.000078693236,0.0000404003],"category_scores_gemma":[0.000011128321,0.00008985039,0.000021633554,0.00021505472,0.000014286158,0.000083566294,0.00005111505,0.00021441508,0.000030808573],"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.000006475696,0.000059384303,0.014488656,0.00015102437,0.000029732804,0.000002886969,0.0012851341,0.42509297,0.0040278826,0.4784205,0.0070037735,0.06943158],"study_design_scores_gemma":[0.00014014158,0.000007300625,0.0012826498,0.00007431118,0.0000014362038,0.0000015760395,0.000031686603,0.9739594,0.002772084,0.0049685994,0.016572602,0.0001882462],"about_ca_topic_score_codex":0.0000187977,"about_ca_topic_score_gemma":0.00019134406,"teacher_disagreement_score":0.5488664,"about_ca_system_score_codex":0.000030326206,"about_ca_system_score_gemma":0.0000036017036,"threshold_uncertainty_score":0.3663993},"labels":[],"label_agreement":null},{"id":"W2077980607","doi":"10.1109/dcc.2010.21","title":"Information Flows in Video Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Coding tree unit; Computer science; Context-adaptive binary arithmetic coding; Coding (social sciences); Multiview Video Coding; Context-adaptive variable-length coding; Variable-length code; Scalable Video Coding; Tunstall coding; Shannon–Fano coding; Theoretical computer science; Markov chain; Rate–distortion theory; Algorithm; Real-time computing; Video tracking; Artificial intelligence; Data compression; Motion compensation; Video processing; Decoding methods; Mathematics; Machine learning; Statistics","score_opus":0.006595255575406383,"score_gpt":0.22148500435057614,"score_spread":0.21488974877516975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077980607","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.8212379,0.000011431067,0.030131724,0.00019095029,0.00015096147,0.00013818812,0.0000013235054,0.0015147579,0.14662276],"genre_scores_gemma":[0.98747754,0.000027641134,0.012399431,0.000051716786,0.000007969295,0.000018044348,0.0000058885216,0.000004637666,0.0000071413947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973756,0.0000040501754,0.00012908995,0.000017192107,0.00004617397,0.00006592409],"domain_scores_gemma":[0.99972683,0.000022361532,0.000007770681,0.00021223513,0.000014782141,0.000015996573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010787737,0.000038984246,0.0000438725,0.00010027506,0.000011227158,0.00002564226,0.00013304915,0.000050241615,0.000110414345],"category_scores_gemma":[0.00002261286,0.000041315714,0.000009420362,0.00009817633,0.0000057648485,0.00048353014,0.000025197798,0.00019752664,0.00007822617],"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.0000064683886,0.000052229323,0.007291159,0.00018388979,0.000017586939,0.0000012123011,0.00962567,0.004740368,0.29731074,0.38750648,0.01866943,0.27459478],"study_design_scores_gemma":[0.00030430435,0.0000071279787,0.008679971,0.000029457979,0.0000015094474,0.000005117695,0.00021826911,0.6407313,0.12425045,0.002287729,0.22317275,0.000312],"about_ca_topic_score_codex":0.000030876,"about_ca_topic_score_gemma":0.00039142623,"teacher_disagreement_score":0.6359909,"about_ca_system_score_codex":0.000014535795,"about_ca_system_score_gemma":0.000003117595,"threshold_uncertainty_score":0.16848059},"labels":[],"label_agreement":null},{"id":"W2078449661","doi":"10.1109/isit.2012.6283412","title":"Partial decode-forward binning for full-duplex causal cognitive interference channels","year":2012,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Dirty paper coding; Communication source; Algorithm; Encoder; Code word; Channel (broadcasting); Coding (social sciences); Decodes; Theoretical computer science; Mathematics; Computer network; Precoding; Statistics; MIMO","score_opus":0.041417393197694476,"score_gpt":0.3009832578396332,"score_spread":0.2595658646419387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078449661","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.3049321,0.00026210825,0.69090384,0.000075503136,0.00027582853,0.00035700534,0.000022241924,0.0011472175,0.0020241865],"genre_scores_gemma":[0.9889983,0.00005550124,0.010212221,0.00007549752,0.00017486881,0.0003323,0.000039467635,0.000040414787,0.00007143343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916077,0.000024920544,0.00023470841,0.000112941205,0.00008650664,0.00038012708],"domain_scores_gemma":[0.9993089,0.0002118231,0.00003291313,0.00024120022,0.00009280452,0.00011239817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023167866,0.00015595529,0.00017259212,0.00008874923,0.000065748754,0.000043585445,0.0002333544,0.00009905061,0.00015365703],"category_scores_gemma":[0.00008229895,0.00015825895,0.000058413974,0.00010672501,0.000040120245,0.00035133277,0.000097799275,0.0001585454,0.00006555094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008254114,0.0013848774,0.015446103,0.0015319239,0.0018333002,0.0000071930817,0.06618012,0.013360053,0.23624186,0.19788107,0.08030438,0.38500372],"study_design_scores_gemma":[0.00075837894,0.00017292167,0.0004320865,0.00021330353,0.000056951456,0.00001510395,0.0009895224,0.44369137,0.533192,0.00028901114,0.019374741,0.0008146054],"about_ca_topic_score_codex":0.000015245422,"about_ca_topic_score_gemma":0.000018230752,"teacher_disagreement_score":0.68406624,"about_ca_system_score_codex":0.000045684566,"about_ca_system_score_gemma":0.00000879962,"threshold_uncertainty_score":0.64536124},"labels":[],"label_agreement":null},{"id":"W2080257599","doi":"10.1109/glocom.2001.965721","title":"Coding for the Slepian-Wolf problem with turbo codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Algorithm; Distributed source coding; Encoder; Serial concatenated convolutional codes; Concatenated error correction code; Coding (social sciences); Decoding methods; Encoding (memory); Variable-length code; Binary number; Turbo; Theoretical computer science; Block code; Mathematics; Artificial intelligence; Arithmetic; Engineering; Statistics","score_opus":0.02495451027252609,"score_gpt":0.2243430274925475,"score_spread":0.1993885172200214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080257599","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.008780746,0.0024959948,0.7405559,0.0053185336,0.0000854609,0.002217968,0.000020280282,0.0059157065,0.23460945],"genre_scores_gemma":[0.95328516,0.00035768544,0.045480974,0.00010001047,0.00002136329,0.00014759663,0.0000023329078,0.000027639275,0.0005772234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995985,0.000008990777,0.00010961756,0.00007067856,0.00007518399,0.00013702166],"domain_scores_gemma":[0.99933493,0.00020529915,0.000016096252,0.00038363528,0.000037552596,0.000022478938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010285312,0.00008639606,0.000085104664,0.000028200482,0.00009112747,0.000047283556,0.00028838814,0.000035853882,0.00014460472],"category_scores_gemma":[0.000008018309,0.000054668417,0.00002559515,0.00009517865,0.00003535755,0.000090488575,0.000026082898,0.00010377852,0.000014895484],"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.000031749893,0.00019834438,0.0010016378,0.0006420112,0.0005267434,0.0000033927117,0.008789729,0.01731591,0.012950343,0.4173161,0.31377593,0.2274481],"study_design_scores_gemma":[0.00036410685,0.00007319695,0.00012250409,0.00009023744,0.000030095214,0.000012649986,0.00028517912,0.6543877,0.07571714,0.0013654525,0.26716703,0.00038465633],"about_ca_topic_score_codex":0.000011797836,"about_ca_topic_score_gemma":0.000058394566,"teacher_disagreement_score":0.94450444,"about_ca_system_score_codex":0.000023476729,"about_ca_system_score_gemma":0.0000017362657,"threshold_uncertainty_score":0.22293134},"labels":[],"label_agreement":null},{"id":"W2081672511","doi":"10.1002/ett.1318","title":"Information rates for multi‐dimensional modulation over multiple antenna wireless channels","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","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":"McGill University","funders":"","keywords":"Transmitter; Beamforming; Computer science; Channel (broadcasting); Transmitter power output; Wireless; Signal-to-noise ratio (imaging); Dimension (graph theory); SIGNAL (programming language); Code rate; Antenna (radio); Channel capacity; Power (physics); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Electrical engineering; Physics; Engineering; Decoding methods","score_opus":0.037578603217770616,"score_gpt":0.26949789561720955,"score_spread":0.23191929239943893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081672511","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.07788838,0.00011725307,0.91777,0.00027694568,0.0001849071,0.0008276668,0.00018443141,0.0016484096,0.0011020036],"genre_scores_gemma":[0.95287764,0.00073681545,0.045270074,0.00016938277,0.000026126268,0.00028498677,0.00044104163,0.00007947969,0.000114475995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0001930514,0.0005720033,0.0001423561,0.0001784908,0.0002627495],"domain_scores_gemma":[0.9979819,0.00031766808,0.00010965508,0.0012502705,0.00024278648,0.00009770343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027458137,0.00025160675,0.00020365231,0.00037385087,0.00086848345,0.000062852785,0.0006657948,0.00008806226,0.000055562028],"category_scores_gemma":[0.000037844122,0.00029003565,0.00015481871,0.00038385944,0.00012003475,0.0008649581,0.000018754283,0.000422891,0.00016235912],"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.0002221382,0.0026156756,0.00078526506,0.00023935149,0.00067727146,0.0000034319462,0.017389432,0.78396857,0.03730467,0.0032406226,0.010188498,0.14336507],"study_design_scores_gemma":[0.0010567027,0.000057911588,0.007863461,0.000058811573,0.000019152796,0.000016525404,0.00011123667,0.9655833,0.0069723316,0.00004288205,0.01780483,0.00041282378],"about_ca_topic_score_codex":0.000025323772,"about_ca_topic_score_gemma":0.00003493068,"teacher_disagreement_score":0.8749892,"about_ca_system_score_codex":0.00012088858,"about_ca_system_score_gemma":0.000026174495,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2081833206","doi":"10.1109/tit.2011.2177579","title":"Single-Sample Robust Joint Source–Channel Coding: Achieving Asymptotically Optimum Scaling of SDR Versus SNR","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Companding; Mathematics; Decoding methods; Additive white Gaussian noise; Decibel; Gaussian; Channel (broadcasting); Algorithm; Computer science; Topology (electrical circuits); Telecommunications","score_opus":0.03534057016149927,"score_gpt":0.23131068069945662,"score_spread":0.19597011053795735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081833206","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.019103311,0.00004448717,0.97519165,0.000042309708,0.00060473196,0.00022199535,0.00003828992,0.0008323379,0.003920902],"genre_scores_gemma":[0.98431724,0.00007160378,0.01540555,0.000057432877,0.000035720437,0.000047306377,0.000020777747,0.000034375094,0.000009972535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860567,0.00008178117,0.00065288536,0.000073667776,0.0002703477,0.00031566952],"domain_scores_gemma":[0.9985367,0.0006180671,0.00013566134,0.00048659203,0.00009988523,0.00012310862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073616713,0.00020511486,0.00023115428,0.00039102705,0.00018472027,0.000057216188,0.00026452792,0.00017231861,0.000117447664],"category_scores_gemma":[0.00006717937,0.00022794092,0.00014010629,0.00027062956,0.000094375486,0.0015464331,0.0000053737194,0.0004148683,0.00006729109],"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.000187029,0.000227336,0.000003356608,0.00022886744,0.00016352534,7.483885e-8,0.009532883,0.914248,0.004116965,0.017187735,0.00009942338,0.05400484],"study_design_scores_gemma":[0.0021474864,0.00030145553,0.00008276362,0.0005456729,0.00018879022,0.000015866284,0.0053322027,0.45146972,0.5327995,0.0015579275,0.004399989,0.0011586769],"about_ca_topic_score_codex":0.000008562163,"about_ca_topic_score_gemma":0.0000017316534,"teacher_disagreement_score":0.96521395,"about_ca_system_score_codex":0.00017325366,"about_ca_system_score_gemma":0.000016591499,"threshold_uncertainty_score":0.92951614},"labels":[],"label_agreement":null},{"id":"W208299792","doi":"","title":"Quadratic Forms on Complex Random Matrices and Multi-Antenna Channel Capacity","year":2004,"lang":"en","type":"article","venue":"Defense Technical Information Center (DTIC)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Channel capacity; Random matrix; Mathematics; Ergodic theory; MIMO; Channel (broadcasting); Information theory; Mutual information; Hypergeometric function; Measure (data warehouse); Quadratic equation; Matrix (chemical analysis); Eigenvalues and eigenvectors; Topology (electrical circuits); Computer science; Pure mathematics; Telecommunications; Statistics; Combinatorics; Physics","score_opus":0.0382555386375347,"score_gpt":0.2544759675274337,"score_spread":0.21622042888989898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W208299792","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.28687295,0.0001372884,0.6973319,0.00095389865,0.00020880203,0.0016936692,0.00019270141,0.0048182053,0.007790594],"genre_scores_gemma":[0.9837545,0.00033318897,0.015051576,0.000582311,0.0000147916135,0.00010402732,0.00013312101,0.00002429905,0.000002195939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985899,0.000030220634,0.0006767895,0.00012623152,0.00026874783,0.0003081659],"domain_scores_gemma":[0.99902254,0.00009412996,0.00012322611,0.00052767457,0.00009823819,0.00013418718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028115828,0.00026076523,0.00031227127,0.00027814767,0.00013738417,0.0001411331,0.00032695077,0.0001838713,0.00001747688],"category_scores_gemma":[0.00009396069,0.00023441654,0.00009443187,0.0002386891,0.00012250229,0.0010026809,0.00011616204,0.00039875862,0.00013418682],"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.0030564042,0.00765866,0.0046055685,0.0103877215,0.0016842781,0.00008534005,0.06263339,0.10312169,0.049005963,0.6428034,0.041194163,0.07376348],"study_design_scores_gemma":[0.0344642,0.000958329,0.02669789,0.002007257,0.0001825679,0.0005913643,0.0014904168,0.842641,0.01515866,0.017428255,0.05409666,0.004283388],"about_ca_topic_score_codex":0.000026950956,"about_ca_topic_score_gemma":0.000044373584,"teacher_disagreement_score":0.7395193,"about_ca_system_score_codex":0.0001631345,"about_ca_system_score_gemma":0.000009814065,"threshold_uncertainty_score":0.95592296},"labels":[],"label_agreement":null},{"id":"W2083353654","doi":"10.1109/isit.2013.6620252","title":"Time-asynchronous Gaussian multiple access channel with correlated sources","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Gaussian; Entropy (arrow of time); Offset (computer science); Encoder; Coding (social sciences); Channel code; Channel (broadcasting); Algorithm; Computer science; Variable-length code; Source code; Asymptotically optimal algorithm; Combinatorics; Mathematics; Discrete mathematics; Decoding methods; Physics; Statistics; Telecommunications; Mathematical analysis","score_opus":0.009371902492176308,"score_gpt":0.21030396202489735,"score_spread":0.20093205953272103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083353654","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.86788684,0.00033198923,0.053970437,0.0004985399,0.00006859864,0.0009573998,0.0000057435886,0.007193995,0.06908646],"genre_scores_gemma":[0.9961512,0.00005266108,0.003048144,0.00007653475,0.00001850315,0.00015379975,0.00002194613,0.000053887452,0.0004233294],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993253,0.000021108339,0.00017339701,0.00013238419,0.00011685316,0.00023097565],"domain_scores_gemma":[0.99923176,0.00006293786,0.00003170614,0.00052468386,0.00006123124,0.000087659035],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000047330108,0.00016535076,0.00016195029,0.0001009065,0.000068608766,0.0001327229,0.00053867715,0.0001000427,0.00102932],"category_scores_gemma":[0.000008393764,0.000135206,0.000026267508,0.00020287135,0.00006773598,0.00048419315,0.00010631265,0.00019848725,0.0007421112],"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.00015282958,0.0018331826,0.05371996,0.0011781026,0.0022372082,0.00006443887,0.027888667,0.35124406,0.06878356,0.004984617,0.3531231,0.13479029],"study_design_scores_gemma":[0.0004858203,0.0000636826,0.0073847566,0.000082794395,0.0000129872415,0.000017375902,0.0001977985,0.9540678,0.033673342,0.00020967961,0.0032601857,0.0005437632],"about_ca_topic_score_codex":0.00034934076,"about_ca_topic_score_gemma":0.00008461243,"teacher_disagreement_score":0.60282373,"about_ca_system_score_codex":0.00004395211,"about_ca_system_score_gemma":0.000009225227,"threshold_uncertainty_score":0.9998839},"labels":[],"label_agreement":null},{"id":"W2084779827","doi":"10.1109/wcl.2014.030514.140092","title":"Achieving Secure Communications over Wiretap Channels via Security Codes from Resilient Functions","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"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; Encoding (memory); Information-theoretic security; Concrete security; Theoretical computer science; Binary number; Channel (broadcasting); Cryptography; Computer security; Computer network; Algorithm; Mathematics; Arithmetic","score_opus":0.015731213389507528,"score_gpt":0.24660599212685066,"score_spread":0.23087477873734313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084779827","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.81212646,0.0024615692,0.16010946,0.013748295,0.0008343712,0.0010872716,0.00036307628,0.004487809,0.0047816737],"genre_scores_gemma":[0.9818607,0.002273016,0.012637431,0.0012503775,0.00018345214,0.0006598865,0.00093066937,0.00018028326,0.000024201181],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962265,0.0010482162,0.0010527651,0.00052298605,0.0004999262,0.00064963155],"domain_scores_gemma":[0.98523813,0.0015037499,0.00029565682,0.0124821095,0.00021494948,0.0002654084],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00071362336,0.0006294308,0.0006946694,0.0004322984,0.001206947,0.00028183768,0.006262241,0.00034399115,0.000073],"category_scores_gemma":[0.00007069851,0.0007338048,0.00029750925,0.00087852863,0.00094255345,0.0007110995,0.0012295303,0.0017020331,0.00021296667],"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.00007658957,0.002079757,0.017139362,0.00042210374,0.0018026413,0.0000055273076,0.027094712,0.019998752,0.7386073,0.03050878,0.120731525,0.041532964],"study_design_scores_gemma":[0.0013554518,0.00007246741,0.007923208,0.0006990134,0.00031046016,0.0000226782,0.0005625516,0.76761514,0.014558988,0.0027280091,0.20166346,0.002488542],"about_ca_topic_score_codex":0.00091769267,"about_ca_topic_score_gemma":0.0014659851,"teacher_disagreement_score":0.7476164,"about_ca_system_score_codex":0.00037616814,"about_ca_system_score_gemma":0.000035638288,"threshold_uncertainty_score":0.9995113},"labels":[],"label_agreement":null},{"id":"W2084948657","doi":"10.1117/12.907446","title":"Improving side information generation using dynamic motion estimation for distributed video coding","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Computer science; Motion compensation; Motion estimation; Coding (social sciences); Reference frame; Quarter-pixel motion; Computer vision; Coding tree unit; Inter frame; Artificial intelligence; Multiview Video Coding; Block-matching algorithm; Decoding methods; Video processing; Frame (networking); Algorithm; Video tracking; Telecommunications; Mathematics","score_opus":0.014717202624816477,"score_gpt":0.2428845929762438,"score_spread":0.2281673903514273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084948657","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.87069273,0.00008931827,0.12729695,0.00028677145,0.00026801197,0.0008146745,0.00011819303,0.00030901932,0.00012432037],"genre_scores_gemma":[0.70896024,0.000049745096,0.2903744,0.000023097917,0.00018469885,0.00021880753,0.00013885272,0.00004609791,0.0000040935133],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814105,3.0700196e-8,0.00084410555,0.00017225828,0.00044607406,0.0003964615],"domain_scores_gemma":[0.9979508,0.00012525402,0.00042331757,0.000084611675,0.0013176124,0.00009842174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008253104,0.0002905438,0.0003157292,0.00016645278,0.00013901074,0.00016610775,0.000557826,0.00023163721,0.0000026307268],"category_scores_gemma":[0.00064319995,0.00029144253,0.00035289687,0.0003049817,0.00008502097,0.0027643908,0.000106188396,0.00025203289,8.384462e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002351847,0.000049587135,0.00009588994,0.0008292639,0.00016427628,3.9149777e-9,0.00035588065,0.00971595,0.82245857,0.16209579,0.0006158766,0.0035953973],"study_design_scores_gemma":[0.0004014355,0.000043045657,0.00021046223,0.00013057285,0.00008916902,0.000005687689,0.00032762726,0.8034821,0.19423969,0.0002751659,0.0005617257,0.00023327967],"about_ca_topic_score_codex":0.000009772389,"about_ca_topic_score_gemma":2.3170341e-7,"teacher_disagreement_score":0.7937662,"about_ca_system_score_codex":0.0005173349,"about_ca_system_score_gemma":0.000018322382,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null},{"id":"W2087276028","doi":"10.1109/ita.2009.5044975","title":"On the rate distortion theory for causal video coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Algorithm; Artificial intelligence","score_opus":0.01809707620478208,"score_gpt":0.25367891547146637,"score_spread":0.2355818392666843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087276028","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.069303796,0.00010442603,0.8824147,0.0025098163,0.000099641096,0.0005017268,0.0000054793063,0.0017886831,0.043271754],"genre_scores_gemma":[0.9982744,0.000040421426,0.0009172302,0.0005206161,0.000021409167,0.000045860997,0.0000056062318,0.00001047844,0.00016401867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996792,0.00003785751,0.000097373384,0.00005449604,0.000044183776,0.00008690892],"domain_scores_gemma":[0.9992678,0.00038031559,0.000014019683,0.00030395403,0.000018844523,0.000015038701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036974633,0.000061946754,0.00005583022,0.00002681101,0.00007057564,0.000023464909,0.00016203878,0.00003232353,0.00004565727],"category_scores_gemma":[0.00007005232,0.00004410044,0.000030390762,0.00004858537,0.000013213227,0.00005759701,0.000008432355,0.00008473283,0.000011957116],"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.0000076085266,0.000009006089,0.000002041444,0.0000037912107,0.0000051280576,8.1028254e-8,0.00014609806,0.00024788798,0.007229047,0.9742381,0.010818153,0.0072930595],"study_design_scores_gemma":[0.00031118793,0.0001564575,0.0016198987,0.000079378304,0.00001781895,0.0000017496255,0.00014476635,0.06228386,0.3276517,0.5735567,0.033772595,0.0004038623],"about_ca_topic_score_codex":0.0000012649778,"about_ca_topic_score_gemma":0.0000040677037,"teacher_disagreement_score":0.9289706,"about_ca_system_score_codex":0.000043529595,"about_ca_system_score_gemma":0.0000025736026,"threshold_uncertainty_score":0.17983638},"labels":[],"label_agreement":null},{"id":"W2087514446","doi":"10.5923/j.ajsp.20110101.04","title":"Exploring the Distributed Video Coding in a Quality Assessment Context","year":2012,"lang":"en","type":"article","venue":"American Journal of Signal Processing","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Computer science; Motion compensation; Distributed source coding; Encoder; Coding (social sciences); Data compression; Video quality; Artificial intelligence; Decoding methods; Motion estimation; Computer vision; Reference frame; Algorithm; Variable-length code; Mathematics; Frame (networking); Statistics","score_opus":0.09945236816761303,"score_gpt":0.33297650010285124,"score_spread":0.2335241319352382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087514446","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.8328015,0.0010215765,0.1653591,0.0003527252,0.000057791087,0.00006957193,0.0000025820018,0.00008164161,0.00025349844],"genre_scores_gemma":[0.9956617,0.00019490649,0.003922109,0.00007751928,0.00010316544,0.000016568934,0.0000012981769,0.00002230564,4.763171e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985124,0.00019958764,0.00064630667,0.000060227023,0.00030107194,0.00028040924],"domain_scores_gemma":[0.9989187,0.00031150776,0.00038122752,0.00016257563,0.00012981743,0.00009614792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016206513,0.0001302524,0.00032411932,0.00013349977,0.0000943676,0.00007397928,0.00038544313,0.000017452652,0.000008160949],"category_scores_gemma":[0.00004907722,0.000101248086,0.0000680685,0.0005019112,0.00015117161,0.0010762525,0.000050615836,0.00060370314,0.0000010346198],"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.00003245531,0.000105313164,0.022878515,0.00008293214,0.00005151886,0.0000046659657,0.006994088,0.0020472517,0.0121284295,0.00074785494,0.00007569783,0.95485127],"study_design_scores_gemma":[0.0029272607,0.000785312,0.6860827,0.005551135,0.00021048465,0.000592932,0.1312682,0.0733669,0.07790899,0.0018556747,0.01689098,0.0025594067],"about_ca_topic_score_codex":0.00004059429,"about_ca_topic_score_gemma":0.000006538035,"teacher_disagreement_score":0.95229185,"about_ca_system_score_codex":0.00024637973,"about_ca_system_score_gemma":0.000054493918,"threshold_uncertainty_score":0.4128777},"labels":[],"label_agreement":null},{"id":"W2088124680","doi":"10.1109/tit.2014.2332336","title":"Private Broadcasting Over Independent Parallel Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Fading; Broadcasting (networking); Gaussian; Coding (social sciences); Computer science; Channel code; Block (permutation group theory); Encoding (memory); Theoretical computer science; Topology (electrical circuits); Mathematics; Algorithm; Computer network; Decoding methods; Combinatorics; Statistics","score_opus":0.00914837261323207,"score_gpt":0.2203186316881497,"score_spread":0.21117025907491763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088124680","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.018087924,0.000011453292,0.97044754,0.00003442521,0.00038834545,0.00020855348,0.000011260328,0.0012771131,0.009533369],"genre_scores_gemma":[0.99649876,0.00006454485,0.0029413302,0.0002680113,0.000026288912,0.000114259514,0.000010256951,0.000022524722,0.000054025113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.000080571226,0.00038190617,0.00007181758,0.00021568968,0.00018847587],"domain_scores_gemma":[0.99921227,0.00014961943,0.000070699025,0.00045182096,0.00005002036,0.00006556114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047880804,0.00015950992,0.00013282288,0.00027449528,0.00015444489,0.0000891207,0.00027266072,0.00012130339,0.00019399957],"category_scores_gemma":[0.000010859298,0.0001711048,0.000071608316,0.00017565291,0.000038010356,0.001107015,0.0000023771247,0.0003566055,0.00030010656],"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.00005158765,0.000056473993,0.000005183002,0.0001224796,0.0000750219,2.0443781e-7,0.0038669482,0.6861279,0.0007589216,0.063653566,0.0004598764,0.24482183],"study_design_scores_gemma":[0.001605878,0.00014621935,0.0003087982,0.00023144567,0.00004523015,0.00002386568,0.00042391624,0.79013115,0.112021156,0.025902139,0.068111144,0.0010490752],"about_ca_topic_score_codex":0.000003958889,"about_ca_topic_score_gemma":0.0000016291693,"teacher_disagreement_score":0.97841084,"about_ca_system_score_codex":0.000083985346,"about_ca_system_score_gemma":0.000007599429,"threshold_uncertainty_score":0.6977451},"labels":[],"label_agreement":null},{"id":"W2088335436","doi":"10.1109/tifs.2015.2407153","title":"Key Generation Over Wiretap Models With Non-Causal Side Information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Key (lock); Computer science; Channel (broadcasting); Upper and lower bounds; Gaussian; Function (biology); Theoretical computer science; Topology (electrical circuits); Artificial intelligence; Combinatorics; Discrete mathematics; Algorithm; Mathematics; Telecommunications; Physics; Computer security; Mathematical analysis","score_opus":0.01903624676730526,"score_gpt":0.21596368516515427,"score_spread":0.19692743839784901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088335436","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.10783279,0.00001753707,0.8853587,0.00008194983,0.00020608869,0.00033897115,0.00008239229,0.00044739107,0.005634183],"genre_scores_gemma":[0.99389297,0.00018362743,0.005403345,0.00025301048,0.00002309266,0.00007758225,0.00014800295,0.000014278285,0.000004072298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989276,0.000021324511,0.0004346092,0.00007890527,0.0003559051,0.00018168491],"domain_scores_gemma":[0.99909896,0.000020889136,0.00009535324,0.0003437661,0.000290373,0.00015065033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020840294,0.00020977734,0.00017480405,0.00025678403,0.00015751563,0.00021245868,0.00012052953,0.00015965887,0.000006925761],"category_scores_gemma":[0.0000033824774,0.00020283557,0.00004051628,0.00024290326,0.000070573195,0.005735985,0.0000031983602,0.0003239173,0.000029745124],"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.00013007708,0.00006880086,0.000027856273,0.0001786368,0.0001685548,8.5393157e-7,0.047402993,0.85335857,0.00013856588,0.024905683,0.00871171,0.06490772],"study_design_scores_gemma":[0.0007698106,0.00011692959,0.000053680753,0.00002687739,0.000025899202,0.000016765958,0.00039945415,0.98463553,0.006010013,0.0028670072,0.004783471,0.0002945565],"about_ca_topic_score_codex":0.00008113355,"about_ca_topic_score_gemma":0.0001347783,"teacher_disagreement_score":0.8860602,"about_ca_system_score_codex":0.00012082173,"about_ca_system_score_gemma":0.00004888605,"threshold_uncertainty_score":0.82713944},"labels":[],"label_agreement":null},{"id":"W2089373874","doi":"10.1109/vtcspring.2013.6692745","title":"Secure Transmission in OFDM Systems by Using Time Domain Scrambling","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":29,"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":"Orthogonal frequency-division multiplexing; Subcarrier; Scrambling; Computer science; Time domain; Additive white Gaussian noise; Transmission (telecommunications); Frequency domain; Secure transmission; Channel (broadcasting); Electronic engineering; Algorithm; Computer network; Telecommunications; Engineering","score_opus":0.009700963338873528,"score_gpt":0.2225906079046385,"score_spread":0.21288964456576498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089373874","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.8072664,0.0027266396,0.17143647,0.00020339071,0.000054377586,0.0007380275,0.000004749708,0.0017594815,0.015810462],"genre_scores_gemma":[0.98075485,0.00009417876,0.01889168,0.000024142644,0.000013104461,0.00003880862,0.0000117466925,0.000037824742,0.00013365399],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00005178145,0.00026801406,0.000106479616,0.00012173183,0.00018923258],"domain_scores_gemma":[0.9995522,0.000037156053,0.000020228088,0.00030280178,0.000028174212,0.00005944266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016456032,0.000121236,0.00016406592,0.00011971691,0.000032535627,0.000073705116,0.00023020676,0.00012849596,0.00021689491],"category_scores_gemma":[0.0000030554002,0.00011902576,0.000026908901,0.00020382521,0.000015101734,0.0002781313,0.00002645331,0.00019689254,0.00007766836],"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.0000021397993,0.000054950837,0.00016196936,0.00019069672,0.00002092895,0.000001799567,0.0011295296,0.012341802,0.960317,0.0012166805,0.017637838,0.006924663],"study_design_scores_gemma":[0.00018414012,0.0000073471733,0.000026682623,0.00020921756,0.0000025569195,0.0000050092153,0.00016806039,0.96924025,0.017114077,0.00038522333,0.012421489,0.00023593551],"about_ca_topic_score_codex":0.0004341463,"about_ca_topic_score_gemma":0.000003832373,"teacher_disagreement_score":0.95689845,"about_ca_system_score_codex":0.000093044226,"about_ca_system_score_gemma":0.0000067011115,"threshold_uncertainty_score":0.48537296},"labels":[],"label_agreement":null},{"id":"W2090480652","doi":"10.1109/isit.2007.4557544","title":"Precoding for the AWGN Channel with Discrete Interference","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Precoding; Transmitter; Additive white Gaussian noise; Channel (broadcasting); Interference (communication); Zero-forcing precoding; Channel state information; Transmission (telecommunications); Topology (electrical circuits); Computer science; Mathematics; Algorithm; Telecommunications; Combinatorics; Wireless; MIMO","score_opus":0.023045712960685645,"score_gpt":0.26326819041796035,"score_spread":0.2402224774572747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090480652","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.0038359356,0.00013448666,0.9802991,0.00024203805,0.000036711008,0.00024923775,0.0000018795339,0.00060932885,0.014591252],"genre_scores_gemma":[0.9863554,0.000067539055,0.013299341,0.000044334472,0.000024444395,0.00006451245,0.0000020912532,0.000017217502,0.00012511486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999662,0.000003862227,0.00009705837,0.000058559188,0.00004664651,0.00013191835],"domain_scores_gemma":[0.9994075,0.00022157785,0.000013134922,0.00030766104,0.000028889543,0.00002127642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022128092,0.00006691663,0.00005777635,0.000030135667,0.000054054726,0.000026826794,0.00028591987,0.000026722453,0.000014328903],"category_scores_gemma":[0.000010678623,0.000040813735,0.000018762108,0.000070346054,0.000026239084,0.0000820732,0.000036766603,0.0000916516,0.0000030637534],"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.0004769095,0.00016135791,0.0026842935,0.0008276199,0.00085538736,0.000005571366,0.026126875,0.019892525,0.028250484,0.44878748,0.037075084,0.4348564],"study_design_scores_gemma":[0.00057207246,0.00021157395,0.0025081625,0.00024807872,0.000036912068,0.00001472055,0.001911973,0.51052403,0.43173915,0.0036350186,0.047900237,0.00069807214],"about_ca_topic_score_codex":0.000011992355,"about_ca_topic_score_gemma":0.00020773431,"teacher_disagreement_score":0.98251945,"about_ca_system_score_codex":0.000020555106,"about_ca_system_score_gemma":0.0000026852633,"threshold_uncertainty_score":0.16643357},"labels":[],"label_agreement":null},{"id":"W2091925007","doi":"10.1109/isita.2008.4895518","title":"Gaussian Z-interference channel with a relay link: Achievable rate region and asymptotic sum capacity","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Interference (communication); Co-channel interference; Channel (broadcasting); Relay; Zero-forcing precoding; Signal-to-noise ratio (imaging); Topology (electrical circuits); Adjacent-channel interference; Channel capacity; Single antenna interference cancellation; Computer science; Noise (video); Gaussian noise; Telecommunications; Electronic engineering; Mathematics; Physics; Algorithm; Engineering; MIMO; Precoding; Power (physics); Combinatorics","score_opus":0.02917082521230757,"score_gpt":0.2066653116894791,"score_spread":0.17749448647717153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091925007","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.8692574,0.00021185896,0.10000776,0.00097638334,0.00003950486,0.00020677129,0.0000016509879,0.0015459047,0.027752794],"genre_scores_gemma":[0.99400777,0.0007429744,0.0048328917,0.00007123374,0.000017337996,0.000027582546,0.0000033903887,0.000026929923,0.0002698816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994457,0.000037227284,0.00013473353,0.00013939422,0.00006977605,0.00017317798],"domain_scores_gemma":[0.9993835,0.00004309009,0.000026546291,0.00043997366,0.00003460493,0.000072293355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000906837,0.00012837825,0.00013279638,0.000070979404,0.00009823343,0.000025415875,0.00017963599,0.00011596358,0.000013882612],"category_scores_gemma":[0.00001197251,0.000113391856,0.000017431892,0.00012718541,0.000106549895,0.00019858556,0.00005308748,0.0003345756,0.000011976928],"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.0014009096,0.0017094436,0.078301415,0.004595989,0.0022642922,0.0011702945,0.13770287,0.04732646,0.10309296,0.48069975,0.1122078,0.029527834],"study_design_scores_gemma":[0.0029909476,0.001290918,0.056446124,0.0015813204,0.0000988677,0.0024219896,0.00079522014,0.5877931,0.32482722,0.0044213217,0.014046968,0.0032859913],"about_ca_topic_score_codex":0.0000889307,"about_ca_topic_score_gemma":0.00012319295,"teacher_disagreement_score":0.54046667,"about_ca_system_score_codex":0.00002847979,"about_ca_system_score_gemma":0.0000105522895,"threshold_uncertainty_score":0.46239856},"labels":[],"label_agreement":null},{"id":"W2093554016","doi":"10.1109/tcomm.2012.12.110670","title":"Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":424,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Transmitter; Channel (broadcasting); Channel state information; MIMO; Topology (electrical circuits); Computer science; Secrecy; Antenna (radio); Selection (genetic algorithm); Nakagami distribution; Signal-to-noise ratio (imaging); Algorithm; Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Combinatorics; Computer security","score_opus":0.03391912688999205,"score_gpt":0.2874597000552449,"score_spread":0.25354057316525286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093554016","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.020923976,0.0011109662,0.9729557,0.0009551905,0.00037642068,0.0011295504,0.00006575277,0.00087651715,0.0016059018],"genre_scores_gemma":[0.9828965,0.002810279,0.0120467385,0.00008385342,0.000031827098,0.001967548,0.000031212705,0.000058681537,0.000073351475],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986703,0.00013990262,0.00046646467,0.00015943003,0.000149636,0.00041426247],"domain_scores_gemma":[0.9980481,0.00030652483,0.000051775733,0.0013868115,0.0000969516,0.00010978811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004245842,0.00022851824,0.00024387648,0.0003499936,0.00030908664,0.000037269365,0.0007773855,0.00016640105,0.00006623786],"category_scores_gemma":[0.0000055788178,0.00027835817,0.00014141093,0.00057276734,0.00009462225,0.00046482577,0.0000045583356,0.0005755573,0.000035364283],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066320924,0.027840454,0.001955632,0.002119,0.0020782936,0.000001099853,0.13478576,0.07167867,0.38268077,0.049869,0.010147364,0.31618074],"study_design_scores_gemma":[0.001547876,0.00021736677,0.00037126426,0.00031081119,0.00012595262,0.000014958894,0.0006148437,0.61965615,0.32426327,0.0025337003,0.049214453,0.0011293467],"about_ca_topic_score_codex":0.00008225341,"about_ca_topic_score_gemma":0.00068339036,"teacher_disagreement_score":0.96197253,"about_ca_system_score_codex":0.00027986272,"about_ca_system_score_gemma":0.000023223593,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2095214648","doi":"10.1109/tit.2013.2256952","title":"MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":67,"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 Toronto","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; MIMO; Computer science; Channel (broadcasting); Transmission (telecommunications); Converse; Computer network; Secure transmission; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Mathematics; Telecommunications; Computer security; Combinatorics; Physics","score_opus":0.015694880566927083,"score_gpt":0.22808261236903907,"score_spread":0.21238773180211198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095214648","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.10088024,0.00002103609,0.89342403,0.000027374805,0.00012374953,0.00047524864,0.000048422018,0.00082584395,0.0041740425],"genre_scores_gemma":[0.9912804,0.00006493935,0.0082277125,0.00006645192,0.00001268205,0.00027939386,0.000024801846,0.000030288975,0.000013358846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989949,0.00006787905,0.00044111675,0.00008826997,0.00021683032,0.00019100246],"domain_scores_gemma":[0.9988492,0.00016259242,0.00010936952,0.00060260907,0.00018469809,0.00009150891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019315882,0.00019714647,0.00019399104,0.0003963991,0.00014123858,0.000118187534,0.0004984613,0.00012507707,0.00019963342],"category_scores_gemma":[0.00000573912,0.00018437221,0.000062518404,0.00029146348,0.00010135815,0.0034330797,0.0000030927201,0.00032742263,0.00006630951],"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.00011885008,0.00013595448,0.000021484673,0.00019309919,0.00011859848,2.075225e-7,0.0057563963,0.95911306,0.001578438,0.0041761273,0.00009781262,0.028689988],"study_design_scores_gemma":[0.0010357767,0.00024049351,0.0006678324,0.00019900872,0.0000397638,0.000014592707,0.0013125802,0.8685303,0.1243163,0.0028925678,0.00020072365,0.00055010547],"about_ca_topic_score_codex":0.00020227235,"about_ca_topic_score_gemma":0.000053624397,"teacher_disagreement_score":0.8904001,"about_ca_system_score_codex":0.0000556778,"about_ca_system_score_gemma":0.000025056148,"threshold_uncertainty_score":0.7518481},"labels":[],"label_agreement":null},{"id":"W2096141515","doi":"10.1186/1687-6180-2012-78","title":"Distributed transform coding via source-splitting","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Wireless Communication Security Techniques","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 Manitoba","funders":"","keywords":"Distributed source coding; Algorithm; Rate distortion; Computer science; Entropy (arrow of time); Gaussian; Source code; Mathematics; Quantization (signal processing); Theoretical computer science; Coding (social sciences); Decoding methods; Variable-length code; Statistics","score_opus":0.014785664047219454,"score_gpt":0.27992446582408137,"score_spread":0.2651388017768619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096141515","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.0566302,0.018987458,0.91816294,0.00015730697,0.00018842211,0.00015373001,0.0000041003236,0.00056721363,0.0051486325],"genre_scores_gemma":[0.99189556,0.001380609,0.0062889187,0.00007752784,0.00027263458,0.000013110562,0.0000061253113,0.00005880658,0.0000067355795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982586,0.000082143844,0.0006183691,0.00012667426,0.0003489542,0.00056526484],"domain_scores_gemma":[0.99926484,0.00016952085,0.00016642708,0.00015291515,0.000069464666,0.00017680875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008396753,0.00024496036,0.00027796393,0.00024454028,0.00026680744,0.00013506359,0.00039600604,0.0000929285,0.00004215324],"category_scores_gemma":[0.00004100082,0.00023793208,0.00007681417,0.00045147503,0.000061146995,0.0021238683,0.000027938471,0.0011116787,0.000011326993],"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.000036905265,0.0001066113,0.0038371745,0.00019396967,0.000011824095,0.000010256613,0.0018800793,0.026824007,0.005133753,0.00025441078,0.00004766815,0.96166337],"study_design_scores_gemma":[0.0032765744,0.000387795,0.004420193,0.0074453685,0.00008161895,0.0016307039,0.0035903186,0.47321287,0.19768594,0.011714426,0.29322585,0.0033283324],"about_ca_topic_score_codex":5.208269e-7,"about_ca_topic_score_gemma":0.0000015801703,"teacher_disagreement_score":0.958335,"about_ca_system_score_codex":0.00028281953,"about_ca_system_score_gemma":0.000018309744,"threshold_uncertainty_score":0.9702589},"labels":[],"label_agreement":null},{"id":"W2096297385","doi":"10.1109/isit.2010.5513405","title":"On the achievable rates in decentralized networks with Randomized Masking","year":2010,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Transmitter; Computer science; Channel (broadcasting); Entropy power inequality; Interference (communication); Transmission (telecommunications); Upper and lower bounds; Information theory; Masking (illustration); Topology (electrical circuits); Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications; Combinatorics; Entropy rate; Statistics; Principle of maximum entropy; Artificial intelligence","score_opus":0.005880159251118996,"score_gpt":0.21840263747577982,"score_spread":0.21252247822466083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096297385","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.80177134,0.00025187532,0.13422026,0.0016283542,0.00014350169,0.0013364868,6.687212e-7,0.0015098338,0.059137687],"genre_scores_gemma":[0.99308723,0.00022211653,0.0063111205,0.00016764051,0.000009795632,0.0001372957,0.0000028463776,0.000023483155,0.000038440652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993993,0.000095793475,0.00017019473,0.00007667322,0.000084146544,0.0001738737],"domain_scores_gemma":[0.99856055,0.0009248398,0.00002272359,0.0004494815,0.000017596192,0.000024785026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060879905,0.00010733375,0.0002083605,0.000051443563,0.00004237913,0.00005519587,0.00029285369,0.000067011904,0.00024265092],"category_scores_gemma":[0.0000707682,0.00006115834,0.00003355452,0.0001676534,0.000066291555,0.000067110865,0.000027880731,0.00048717853,0.000007741095],"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.006931789,0.000119468,0.0014218106,0.000024903613,0.0001338482,0.000005671854,0.0010670748,0.14091434,0.0047495286,0.8378089,0.0038032304,0.0030194416],"study_design_scores_gemma":[0.027321145,0.000013050365,0.00025782248,0.000077931116,0.000010616957,0.0000036763565,0.000058065114,0.9493183,0.015021224,0.005209768,0.0024414575,0.00026697014],"about_ca_topic_score_codex":0.000051879822,"about_ca_topic_score_gemma":0.0006347504,"teacher_disagreement_score":0.8325991,"about_ca_system_score_codex":0.000014144677,"about_ca_system_score_gemma":0.000005489207,"threshold_uncertainty_score":0.26568574},"labels":[],"label_agreement":null},{"id":"W2096448522","doi":"10.1109/cwit.2009.5069532","title":"On the feedback capacity of a discrete non-binary noise channel with memory","year":2009,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Noise (video); Channel (broadcasting); Binary number; Computer science; Fading; Channel capacity; Algorithm; Control theory (sociology); Mathematics; Telecommunications; Arithmetic; Artificial intelligence","score_opus":0.013362552020516697,"score_gpt":0.21334723861980837,"score_spread":0.19998468659929167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096448522","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.9122645,0.000042853357,0.0075530577,0.0015167866,0.000017617589,0.0003158028,0.000006298067,0.00051307015,0.07776996],"genre_scores_gemma":[0.99784327,0.000037737063,0.0017764197,0.00021185317,0.000010096643,0.000019462927,0.0000024569042,0.000014787425,0.00008393398],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999514,0.00002292806,0.00013111094,0.00008017439,0.00013279697,0.00011899121],"domain_scores_gemma":[0.9991569,0.00007462377,0.000028563414,0.0006743434,0.000034671986,0.00003090313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116563155,0.00011267957,0.00013092766,0.000048055022,0.000039096605,0.000010681994,0.00030343357,0.00004652231,0.000043377604],"category_scores_gemma":[0.00000910215,0.00007015145,0.00003522815,0.0001423472,0.000060006765,0.00008772637,0.000025727426,0.00018837927,0.000011710202],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063468475,0.0015213271,0.00035521778,0.0006712639,0.00059230323,0.000029436354,0.034331072,0.095516846,0.42804426,0.2930023,0.12971126,0.01559002],"study_design_scores_gemma":[0.0009037454,0.0010050116,0.018182676,0.0005541673,0.000037201644,0.000015057712,0.0010321081,0.1894892,0.77502835,0.012210938,0.00065351266,0.00088802073],"about_ca_topic_score_codex":0.000037416936,"about_ca_topic_score_gemma":0.000017139755,"teacher_disagreement_score":0.3469841,"about_ca_system_score_codex":0.000024406387,"about_ca_system_score_gemma":0.0000057476923,"threshold_uncertainty_score":0.28606933},"labels":[],"label_agreement":null},{"id":"W2096924655","doi":"10.1109/icassp.2014.6854695","title":"Efficient jamming strategies on a MIMO Gaussian channel with known target signal covariance","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Jamming; MIMO; Covariance; Closed-form expression; Channel (broadcasting); Gaussian; Computer science; Mathematical optimization; Mathematics; Control theory (sociology); Telecommunications; Statistics; Physics; Artificial intelligence","score_opus":0.009337763533795337,"score_gpt":0.2171156558205921,"score_spread":0.20777789228679677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096924655","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.036579724,0.000093744275,0.8423157,0.0003180601,0.000053486907,0.00024204924,0.000003990334,0.0018757507,0.11851754],"genre_scores_gemma":[0.96848917,0.00000965749,0.031208573,0.00008300334,0.000045164685,0.00005113753,0.0000065113695,0.000036130372,0.000070668655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992262,0.000040460458,0.0001635748,0.00016070406,0.00017441408,0.0002346496],"domain_scores_gemma":[0.9993064,0.00007610497,0.00003085282,0.0004811232,0.000040299365,0.00006524803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017988021,0.00017224305,0.00016429114,0.000094467476,0.000077637604,0.000083024635,0.00029445312,0.00006950456,0.00009177555],"category_scores_gemma":[0.000006832946,0.00014356793,0.00002765954,0.0001661994,0.000048305486,0.00006906388,0.000034853,0.00021556449,0.000051830575],"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.000026150776,0.00010237551,0.00001631047,0.00008701039,0.00003860712,0.0000032733585,0.0013836625,0.8275993,0.003787242,0.16273035,0.0012595836,0.0029661614],"study_design_scores_gemma":[0.00032463812,0.00020221916,0.00020258222,0.00017227362,0.000006466441,0.0000063105713,0.00047958488,0.95501566,0.03123616,0.001029115,0.010915003,0.00040996438],"about_ca_topic_score_codex":0.00002681396,"about_ca_topic_score_gemma":0.00003029073,"teacher_disagreement_score":0.93190944,"about_ca_system_score_codex":0.0000435678,"about_ca_system_score_gemma":0.000017634215,"threshold_uncertainty_score":0.585453},"labels":[],"label_agreement":null},{"id":"W2097440336","doi":"10.1109/tit.2006.871608","title":"On the joint source-channel coding error exponent for discrete memoryless systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":75,"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":"Exponent; Additive white Gaussian noise; Mathematics; Channel (broadcasting); Source code; Decoding methods; Discrete mathematics; Topology (electrical circuits); Algorithm; White noise; Combinatorics; Computer science; Statistics; Telecommunications","score_opus":0.01852788324696426,"score_gpt":0.22141527418384127,"score_spread":0.20288739093687702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097440336","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.008000182,0.00002895295,0.9853379,0.00023021156,0.00047613145,0.00087896234,0.00010273743,0.00092927867,0.0040156357],"genre_scores_gemma":[0.9984008,0.000026299322,0.00021149551,0.00013801195,0.00003331441,0.00096006837,0.000027263393,0.00003232034,0.0001703998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890494,0.0000924341,0.00049634953,0.000080833095,0.00022012954,0.00020530983],"domain_scores_gemma":[0.9987881,0.00046096064,0.00010742931,0.00052209874,0.00008300313,0.000038387472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063274836,0.00018906897,0.00016448268,0.00024054086,0.00036849422,0.00013204207,0.0002653841,0.0001028937,0.000034711735],"category_scores_gemma":[0.000010247824,0.00015385673,0.00013029008,0.00014036262,0.00006113075,0.0005128738,0.0000018095404,0.0002767122,0.00008188814],"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.000054661235,0.000037033486,5.3892634e-8,0.00012964908,0.00004335677,7.6128636e-8,0.0019883304,0.8380008,0.0005513654,0.154445,0.0020742274,0.0026754444],"study_design_scores_gemma":[0.0007419739,0.00011324312,0.000011897622,0.00032813897,0.000051264185,0.00000961996,0.004469896,0.83427864,0.13671388,0.0135111995,0.009209309,0.000560967],"about_ca_topic_score_codex":0.000024210145,"about_ca_topic_score_gemma":0.000005652539,"teacher_disagreement_score":0.9904007,"about_ca_system_score_codex":0.00015566578,"about_ca_system_score_gemma":0.000010844419,"threshold_uncertainty_score":0.6274096},"labels":[],"label_agreement":null},{"id":"W2097679877","doi":"10.1109/isit.2006.262008","title":"Lossless Source Coding using Tree Structured Random Binning","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Entropy encoding; Lossless compression; Variable-length code; Decoding methods; Tunstall coding; Computer science; Algorithm; Data compression; Context-adaptive binary arithmetic coding; Entropy (arrow of time); Random variable; Random binary tree; Theoretical computer science; Tree (set theory); Arithmetic coding; Source code; Binary tree; Mathematics; Statistics","score_opus":0.013364283882250742,"score_gpt":0.23208948337145857,"score_spread":0.21872519948920782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097679877","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.47430232,0.00029006557,0.50898695,0.000027319997,0.000062528234,0.00012976408,0.0000018861008,0.0018893008,0.014309892],"genre_scores_gemma":[0.96745235,0.000018378847,0.03227678,0.000021882592,0.00007161442,0.000007005187,0.000010073375,0.000044743727,0.00009719114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992706,0.000030390682,0.00025169158,0.00011250551,0.00013079456,0.00020402444],"domain_scores_gemma":[0.9994474,0.00007065916,0.00003472449,0.0003820252,0.00003383897,0.000031339237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120488396,0.0001429075,0.00018538527,0.00012723927,0.00009643467,0.0000761677,0.00026049037,0.00008881825,0.00006124086],"category_scores_gemma":[0.000009282487,0.00014720847,0.000053577765,0.0001986526,0.000035507484,0.00014759238,0.00006152142,0.00017266987,0.000005725411],"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.000031595944,0.000047297406,0.0042870515,0.00015518113,0.000085807806,0.000008613123,0.0008821137,0.2481945,0.6917053,0.021195645,0.0047577373,0.028649207],"study_design_scores_gemma":[0.0010340821,0.0000056599865,0.000841864,0.000071662835,0.000018614179,0.000018356,0.000115110364,0.73675495,0.25201288,0.0014076263,0.0073000677,0.00041911931],"about_ca_topic_score_codex":0.00019228143,"about_ca_topic_score_gemma":0.00010238905,"teacher_disagreement_score":0.49315003,"about_ca_system_score_codex":0.000077562756,"about_ca_system_score_gemma":0.000006743458,"threshold_uncertainty_score":0.60029876},"labels":[],"label_agreement":null},{"id":"W2097790167","doi":"10.1109/isit.2001.935987","title":"On the Poor-Verdu conjecture for the reliability function of channels with memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Counterexample; Conjecture; Erasure; Computer science; Decoding methods; Reliability (semiconductor); Function (biology); Binary number; Coding (social sciences); Mathematics; Algorithm; Discrete mathematics; Statistics; Arithmetic","score_opus":0.01798386297064743,"score_gpt":0.20382285701424338,"score_spread":0.18583899404359594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097790167","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.5026859,0.001474013,0.3958756,0.02381948,0.00048704533,0.0045958883,0.000039110168,0.0025856884,0.068437256],"genre_scores_gemma":[0.9988104,0.00006014471,0.00048757222,0.00027446085,0.000022006368,0.00014500167,0.0000016264354,0.000015326168,0.00018345306],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960476,0.000028126544,0.00011237659,0.00007181999,0.0001005323,0.00008241154],"domain_scores_gemma":[0.99864507,0.0006303809,0.000027040951,0.0006303694,0.000055380395,0.000011751981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021958156,0.00008015264,0.0000843538,0.000019739122,0.00007060555,0.000012129026,0.00024111604,0.000049767546,0.00027812266],"category_scores_gemma":[0.000043039236,0.00003799247,0.000039187362,0.00009784416,0.000063208056,0.00004334043,0.000019267456,0.0001424761,0.000005491877],"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.00029877588,0.00040028413,0.00010639555,0.00045780698,0.00048985856,4.804765e-7,0.007350754,0.22691903,0.0061448384,0.3140151,0.37397823,0.069838464],"study_design_scores_gemma":[0.0008957914,0.0006836849,0.0005800354,0.00010401562,0.00007418843,0.0000047113626,0.0010968725,0.6764601,0.23317099,0.01425522,0.072232515,0.00044190235],"about_ca_topic_score_codex":0.000015322235,"about_ca_topic_score_gemma":0.000016173737,"teacher_disagreement_score":0.4961245,"about_ca_system_score_codex":0.000021033913,"about_ca_system_score_gemma":0.0000023345767,"threshold_uncertainty_score":0.30452484},"labels":[],"label_agreement":null},{"id":"W2098132403","doi":"10.1109/isit.2010.5513651","title":"Partial zero-forcing precoding for the interference channel with partially cooperating transmitters","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Zero-forcing precoding; Precoding; Transmitter; Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Adjacent-channel interference; Noise (video); Computer science; Gaussian noise; Channel capacity; Topology (electrical circuits); Mathematics; Telecommunications; Control theory (sociology); Algorithm; MIMO; Combinatorics","score_opus":0.019111044906934493,"score_gpt":0.23839786492276607,"score_spread":0.21928682001583158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098132403","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.07039635,0.000032232318,0.92582643,0.00065771095,0.00015841534,0.0004706091,0.0000034975415,0.00077701564,0.001677752],"genre_scores_gemma":[0.98235184,0.000025380117,0.01703937,0.00011350971,0.00006477501,0.0003364724,0.000003834748,0.000035598583,0.00002920422],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999351,0.000013604795,0.00020285592,0.0001256078,0.00007942634,0.00022750009],"domain_scores_gemma":[0.99923664,0.0002417889,0.0000260186,0.00039299438,0.000059570655,0.00004297729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025858375,0.00013533258,0.0001209584,0.00003232571,0.00017960905,0.00011376114,0.00039813906,0.000059821232,0.000035108587],"category_scores_gemma":[0.000025787049,0.00009132502,0.00003778069,0.00008656488,0.00005717681,0.00019369177,0.00003037776,0.00031914638,0.0000029844298],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018758244,0.000116706906,0.001118307,0.00041600104,0.00043252215,0.0000026841021,0.021719458,0.09973772,0.60799915,0.0824293,0.0044451146,0.18139547],"study_design_scores_gemma":[0.00025055002,0.0000542313,0.000053599106,0.000058840367,0.000018740817,0.000006171571,0.00017115568,0.73530054,0.2607972,0.00016259345,0.0029042324,0.00022215588],"about_ca_topic_score_codex":0.00002457058,"about_ca_topic_score_gemma":0.00061705074,"teacher_disagreement_score":0.91195554,"about_ca_system_score_codex":0.00001390823,"about_ca_system_score_gemma":0.000016062477,"threshold_uncertainty_score":0.37241262},"labels":[],"label_agreement":null},{"id":"W2098434322","doi":"10.1109/cwit.2013.6621603","title":"Approximate bounds for limited backhaul uplink multicell processing with single-user compression","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Base station; Backhaul (telecommunications); Decodes; Telecommunications link; Constant (computer programming); Decoding methods; Algorithm; Computer network","score_opus":0.018269245955584806,"score_gpt":0.22687630961701308,"score_spread":0.20860706366142828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098434322","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.15944311,0.0003856311,0.816253,0.00040639352,0.00005590889,0.0019307333,0.0000049876608,0.00458123,0.016939001],"genre_scores_gemma":[0.730964,0.000013043077,0.26816615,0.00007280507,0.000019301786,0.0003361004,0.000030240304,0.000063474705,0.00033488905],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915284,0.000015491209,0.00025045287,0.00017654186,0.00013606067,0.00026859448],"domain_scores_gemma":[0.9990637,0.00008341925,0.000057833087,0.0004908595,0.00022779463,0.000076422686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090526264,0.00019346541,0.00018972413,0.00009227785,0.00015934672,0.00028160212,0.00032514383,0.00012695635,0.000065923516],"category_scores_gemma":[0.0000120202585,0.00015605081,0.00003474945,0.0001637809,0.00006319617,0.00046467414,0.00006854219,0.00018111154,0.000028110997],"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.00016377377,0.0013510078,0.0017403436,0.0040110964,0.00022842153,0.0000029020962,0.004610792,0.016931778,0.72205955,0.007571592,0.038771197,0.20255753],"study_design_scores_gemma":[0.00052046013,0.000056980658,0.00015096755,0.00018985815,0.000013092656,0.000002276335,0.00007763862,0.857667,0.12532483,0.00029457966,0.015380641,0.00032166077],"about_ca_topic_score_codex":0.000034385288,"about_ca_topic_score_gemma":0.000046624857,"teacher_disagreement_score":0.84073526,"about_ca_system_score_codex":0.000065665634,"about_ca_system_score_gemma":0.000012245575,"threshold_uncertainty_score":0.6363567},"labels":[],"label_agreement":null},{"id":"W2102783949","doi":"10.1109/icc.2007.438","title":"Sending Correlated Gaussian Sources over a Gaussian MAC: To Code, or not to Code","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Fusion center; Transmission (telecommunications); Additive white Gaussian noise; Gaussian; Coding (social sciences); Source code; Decoding methods; Code (set theory); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Mathematics; Wireless; Statistics; Cognitive radio; Physics; Combinatorics","score_opus":0.023919800243618384,"score_gpt":0.30386460128473336,"score_spread":0.27994480104111497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102783949","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.65563184,0.00008520023,0.27036145,0.0017770532,0.00046190558,0.0011637881,0.00006231486,0.0067537935,0.06370265],"genre_scores_gemma":[0.97059745,0.0000409558,0.025787832,0.0012123225,0.000041527903,0.0000326367,0.000015092284,0.00009887626,0.0021733148],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833643,0.000025530555,0.0004891042,0.00029283858,0.00030275437,0.0005533157],"domain_scores_gemma":[0.9984369,0.00021550765,0.00004365239,0.00086967426,0.000048692422,0.00038552127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004552324,0.00028286563,0.00029805154,0.00043875043,0.00012043024,0.00008202645,0.0006117656,0.00019910355,0.0007804558],"category_scores_gemma":[0.00007172577,0.00026005405,0.00006543666,0.00077930465,0.000029410083,0.00016473241,0.00022545537,0.00036017827,0.00036539204],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001458486,0.0005923744,0.010232925,0.00052791944,0.00068122614,0.00041032664,0.050998747,0.020883577,0.3540212,0.0796684,0.38144907,0.09907576],"study_design_scores_gemma":[0.0010326587,0.0002581321,0.023826554,0.00061939715,0.00005047875,0.000084033716,0.0022138122,0.046009023,0.50884706,0.00023246132,0.41484848,0.0019778963],"about_ca_topic_score_codex":0.00021806617,"about_ca_topic_score_gemma":0.0025427733,"teacher_disagreement_score":0.3149656,"about_ca_system_score_codex":0.00020927917,"about_ca_system_score_gemma":0.000017409999,"threshold_uncertainty_score":0.99998516},"labels":[],"label_agreement":null},{"id":"W2103113479","doi":"10.1109/tit.2009.2025554","title":"Precoding for the AWGN Channel With Discrete Interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Mathematics; Channel (broadcasting); Precoding; Combinatorics; Computer science; Telecommunications","score_opus":0.011977445169591662,"score_gpt":0.2304539970844034,"score_spread":0.21847655191481175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103113479","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.00063873874,0.000026373998,0.99434924,0.0003116326,0.00012101239,0.00042583165,0.000029917064,0.0006304287,0.003466831],"genre_scores_gemma":[0.9976096,0.00012317309,0.0017094899,0.00025838922,0.000011743165,0.00023135831,0.0000064853602,0.000009876795,0.00003985402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950236,0.000022306938,0.00020943939,0.00004814985,0.00009059258,0.00012715915],"domain_scores_gemma":[0.9992912,0.00022969117,0.00004350868,0.00034601256,0.00006137482,0.00002823332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024034083,0.00011346718,0.00008312043,0.00011887362,0.00019964062,0.00007447111,0.0002679663,0.000050832794,0.000025419342],"category_scores_gemma":[0.00000441047,0.00008115094,0.00004850147,0.00013326552,0.000038821552,0.000852202,5.9162323e-7,0.00020295737,0.00002100282],"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.00036610966,0.000048931037,4.3654993e-7,0.00009640078,0.00012735857,9.770762e-8,0.01181231,0.39044142,0.00038965058,0.048872244,0.0008282356,0.5470168],"study_design_scores_gemma":[0.0013530857,0.0007313938,0.00013062396,0.00040187282,0.00011303481,0.000023062683,0.0032337313,0.70435596,0.24988234,0.025350858,0.013571291,0.0008527252],"about_ca_topic_score_codex":0.0000013369388,"about_ca_topic_score_gemma":0.0000042844035,"teacher_disagreement_score":0.9969709,"about_ca_system_score_codex":0.00004781099,"about_ca_system_score_gemma":0.000009461688,"threshold_uncertainty_score":0.33092391},"labels":[],"label_agreement":null},{"id":"W2103335393","doi":"10.1109/isit.2010.5513331","title":"AEP of Output when Rate is above capacity: The Gaussian case","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codebook; Gaussian; Channel capacity; Equipartition theorem; Channel (broadcasting); Relay; Mathematics; Computer science; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Telecommunications; Physics","score_opus":0.020514667019713804,"score_gpt":0.2340310033078966,"score_spread":0.2135163362881828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103335393","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.9048722,0.00010341562,0.008277684,0.0025704731,0.00017785434,0.00028429276,0.000030785155,0.00089814287,0.08278519],"genre_scores_gemma":[0.990807,0.000041385898,0.008602115,0.00021933115,0.000025109308,0.000018273404,0.0000015181138,0.000021126596,0.00026416776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995144,0.000030164503,0.00018538602,0.000073942276,0.00007814921,0.00011797647],"domain_scores_gemma":[0.99887186,0.00008516108,0.00003224495,0.00091994077,0.000051102343,0.000039688166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245555,0.000094574025,0.00011519159,0.0000478279,0.000047898106,0.000026315834,0.00034829267,0.00008469521,0.0003583784],"category_scores_gemma":[0.000023728617,0.00006868124,0.00004533186,0.00007890171,0.00008674142,0.00007536664,0.000067377914,0.00034297814,0.000032437456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014583594,0.00017746311,0.0014942336,0.00033619348,0.0003610444,0.00012033856,0.058115754,0.00018769187,0.30252913,0.37913787,0.1456491,0.1118766],"study_design_scores_gemma":[0.00027974986,0.00002778963,0.0007191438,0.000029663737,0.000030915944,0.0003579429,0.0007271469,0.03396408,0.70373964,0.014348156,0.24533823,0.00043756363],"about_ca_topic_score_codex":0.0005723846,"about_ca_topic_score_gemma":0.00088334776,"teacher_disagreement_score":0.4012105,"about_ca_system_score_codex":0.000010147274,"about_ca_system_score_gemma":0.000007265694,"threshold_uncertainty_score":0.39239922},"labels":[],"label_agreement":null},{"id":"W2103402422","doi":"10.1109/tit.2008.2011436","title":"Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Queen's University","funders":"","keywords":"Gaussian; Exponent; Mathematics; Distortion (music); Source code; Upper and lower bounds; Discrete mathematics; Algorithm; Topology (electrical circuits); Computer science; Combinatorics; Mathematical analysis; Physics; Telecommunications","score_opus":0.01534998377513118,"score_gpt":0.22538147524452534,"score_spread":0.21003149146939415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103402422","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.015879344,0.000116412695,0.97946227,0.00010086706,0.0008692806,0.00088335417,0.00009020562,0.0015693263,0.0010289662],"genre_scores_gemma":[0.9985958,0.00015817466,0.0003431782,0.00018387259,0.00005738964,0.0004745801,0.000056966775,0.000028549483,0.00010153563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860656,0.000079557525,0.0006961775,0.00011231068,0.00024358231,0.00026181046],"domain_scores_gemma":[0.99900526,0.00013386179,0.0001642758,0.00047779892,0.00012996195,0.00008884953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006278635,0.00023050199,0.0002831571,0.00039051345,0.0002869602,0.00014496378,0.00026111442,0.00013777894,0.000017537848],"category_scores_gemma":[0.000010079921,0.0002515969,0.00014714427,0.00015326287,0.000042773383,0.0016640049,0.0000013794538,0.00027085855,0.00004636071],"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.00025529164,0.00029470594,4.7851483e-7,0.0007023658,0.00017985556,6.949264e-7,0.012122272,0.7056211,0.0066185356,0.07157222,0.0024113974,0.20022103],"study_design_scores_gemma":[0.0021666766,0.00043423404,0.000069030175,0.00068409054,0.00013711005,0.00003208091,0.0059632445,0.5154141,0.44885716,0.014286577,0.010552867,0.0014027812],"about_ca_topic_score_codex":0.000006591607,"about_ca_topic_score_gemma":0.0000012437844,"teacher_disagreement_score":0.9827164,"about_ca_system_score_codex":0.00026721915,"about_ca_system_score_gemma":0.000015759691,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W2104128911","doi":"10.1016/j.sysconle.2008.06.006","title":"Robust coding for a class of sources: Applications in control and reliable communication over limited capacity channels","year":2008,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Research Promotion Foundation; European Commission","keywords":"Channel capacity; Entropy (arrow of time); Mathematics; Information theory; Maximization; Class (philosophy); Dynamical systems theory; Entropy maximization; Applied mathematics; Rényi entropy; Coding (social sciences); Mathematical optimization; Computer science; Principle of maximum entropy; Statistics; Artificial intelligence","score_opus":0.02616549671541945,"score_gpt":0.21333271574985507,"score_spread":0.18716721903443562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104128911","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.8286149,0.0016991803,0.16558108,0.0005659408,0.000060588325,0.0028423662,0.00007944857,0.00037595775,0.00018057984],"genre_scores_gemma":[0.9970687,0.0001706707,0.0010104415,0.00018445303,0.000030512496,0.0014632739,0.000025655361,0.000038775775,0.000007516145],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988029,0.000118881864,0.0005388703,0.00017217221,0.00013688236,0.0002302843],"domain_scores_gemma":[0.99847734,0.00049633224,0.00017775489,0.00070354645,0.00009280998,0.000052234045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044131992,0.0001725234,0.00046809216,0.00020831951,0.00010601418,0.000030963758,0.0003268139,0.00012658718,0.0000015739926],"category_scores_gemma":[0.000027797016,0.00018917072,0.00006437036,0.00019507321,0.00011142288,0.00017685299,0.000024537436,0.00021550506,0.0000011122388],"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.00019123776,0.00024898606,0.09724431,0.0023908447,0.0005685511,0.0000021012343,0.00813982,0.4005448,0.4580212,0.026846895,0.005590447,0.00021081574],"study_design_scores_gemma":[0.0059727808,0.000051621184,0.008074221,0.0005497446,0.00006067074,0.000015102193,0.000414226,0.9672493,0.0018230171,0.000100507335,0.0151414415,0.00054741255],"about_ca_topic_score_codex":0.000484459,"about_ca_topic_score_gemma":0.000045170105,"teacher_disagreement_score":0.56670445,"about_ca_system_score_codex":0.000115545176,"about_ca_system_score_gemma":0.000009242105,"threshold_uncertainty_score":0.7714158},"labels":[],"label_agreement":null},{"id":"W2104453881","doi":"10.1109/isit.2012.6283566","title":"Multiple access channel with various degrees of asymmetric state information","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Encoder; Computer science; Channel state information; Independent and identically distributed random variables; Channel (broadcasting); Characterization (materials science); Decoding methods; Process (computing); State (computer science); Channel capacity; Algorithm; Computer network; Telecommunications; Wireless; Mathematics; Random variable","score_opus":0.01886585875500607,"score_gpt":0.24093598728147858,"score_spread":0.2220701285264725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104453881","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.36452508,0.0003796064,0.600656,0.00003318964,0.00007951913,0.00041331927,0.000019383611,0.0014382845,0.032455634],"genre_scores_gemma":[0.9882257,0.00011881131,0.011564511,0.00001718469,0.000006527676,0.000029160017,0.000016097933,0.0000116061565,0.000010406191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950606,0.000011760356,0.00018556872,0.00002731404,0.00012444166,0.00014486298],"domain_scores_gemma":[0.9994863,0.00006143178,0.000050223876,0.00028056232,0.000076763194,0.00004467096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012290537,0.00007932295,0.00010224672,0.00024808207,0.000019621048,0.000027694266,0.00026058118,0.0000363497,0.0000127107505],"category_scores_gemma":[0.00002270332,0.000066701985,0.000015195993,0.00039837582,0.000017561973,0.0016110191,0.00007057653,0.00008446076,0.000014252559],"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.00016293042,0.00084325357,0.27473834,0.0020334078,0.0006660522,0.0000012110912,0.03542818,0.27828288,0.0020875433,0.024882363,0.012893448,0.3679804],"study_design_scores_gemma":[0.001239406,0.00012982047,0.2917786,0.00010570328,0.000032190994,0.000015497262,0.00041746814,0.4762845,0.21554884,0.00029647717,0.013310744,0.0008407562],"about_ca_topic_score_codex":0.0002204397,"about_ca_topic_score_gemma":0.0000715349,"teacher_disagreement_score":0.6237006,"about_ca_system_score_codex":0.000028566403,"about_ca_system_score_gemma":0.0000059061713,"threshold_uncertainty_score":0.27200282},"labels":[],"label_agreement":null},{"id":"W2105486143","doi":"10.1109/icassp.2006.1661064","title":"A Coding Theorem for Multiterminal Estimation","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Bounded function; Statistic; Joint probability distribution; Mutual information; Mathematics; Generalization; Algorithm; Computer science; Coding (social sciences); Sufficient statistic; Discrete mathematics; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.011930437177106361,"score_gpt":0.255873502955773,"score_spread":0.24394306577866662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105486143","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.026310451,0.000038621427,0.95334566,0.00005654632,0.000023822842,0.00016689193,0.0000035606158,0.0011365052,0.018917944],"genre_scores_gemma":[0.81627256,0.000004430231,0.18353531,0.000011193094,0.000018001427,0.000055976867,0.00001807015,0.000010824101,0.00007366742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974704,0.000004666218,0.00009859961,0.000041976513,0.000036169575,0.00007154736],"domain_scores_gemma":[0.99974823,0.000061695544,0.000010292257,0.00014936482,0.00002131245,0.000009127353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007050872,0.000047531703,0.000049323557,0.00003949807,0.000030140942,0.000022734768,0.0000903074,0.00002986172,0.000018220795],"category_scores_gemma":[0.000008702622,0.000047931633,0.000021791668,0.00003955055,0.000011269575,0.00008633474,0.000010427851,0.000033314474,0.0000073506462],"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.000006188175,0.00003994742,0.00020458127,0.00012827733,0.000010207782,4.98125e-7,0.0002346909,0.017399225,0.03198908,0.8659514,0.01326794,0.070767924],"study_design_scores_gemma":[0.00009594097,0.00000516465,0.00028276767,0.0000125954275,0.000002470085,0.0000016328129,0.0000088412835,0.9274632,0.05655102,0.011156949,0.0043444857,0.00007493798],"about_ca_topic_score_codex":0.00001355862,"about_ca_topic_score_gemma":0.000014152179,"teacher_disagreement_score":0.910064,"about_ca_system_score_codex":0.000024282004,"about_ca_system_score_gemma":0.0000018861161,"threshold_uncertainty_score":0.19545953},"labels":[],"label_agreement":null},{"id":"W2106711692","doi":"10.1109/tit.2003.809560","title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":103,"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 Montréal","funders":"","keywords":"A priori and a posteriori; Computer science; Formalism (music); Key (lock); Secret sharing; Context (archaeology); Theoretical computer science; Representation (politics); Authentication (law); Channel (broadcasting); Cryptography; Computer security; Mathematics; Topology (electrical circuits); Computer network; Combinatorics","score_opus":0.014349473895898947,"score_gpt":0.2329499708838691,"score_spread":0.21860049698797016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106711692","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.07782079,0.000037863738,0.90728784,0.00028214138,0.00072770147,0.0007057307,0.00009769601,0.0010801755,0.011960076],"genre_scores_gemma":[0.99894726,0.00007829159,0.00020669804,0.00032560187,0.000012798712,0.00024090156,0.000063717605,0.000018356364,0.00010638705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986126,0.0002372243,0.00051309034,0.000101559126,0.0002941553,0.00024138525],"domain_scores_gemma":[0.99864495,0.00022617156,0.00009319461,0.0008175038,0.00014000101,0.00007815953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009574367,0.0001961483,0.00014134584,0.00022194047,0.0005003656,0.00012581986,0.00031032474,0.00012919396,0.0017045737],"category_scores_gemma":[0.00003188527,0.00017002363,0.00010442928,0.00037986197,0.0001322133,0.0013716514,0.0000029630041,0.0003891983,0.00023496048],"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.00010895711,0.000629967,0.0000184107,0.00027356893,0.000507566,5.174671e-7,0.024854971,0.29070663,0.00076070445,0.62818223,0.004871272,0.04908519],"study_design_scores_gemma":[0.0020959047,0.00023665848,0.00017341517,0.00013871622,0.0001426935,0.000020052428,0.0030731389,0.21517791,0.18879241,0.060447987,0.5284276,0.0012735031],"about_ca_topic_score_codex":0.0000039667793,"about_ca_topic_score_gemma":0.0000061649644,"teacher_disagreement_score":0.9211264,"about_ca_system_score_codex":0.00018499866,"about_ca_system_score_gemma":0.000031205138,"threshold_uncertainty_score":0.99920803},"labels":[],"label_agreement":null},{"id":"W2106861055","doi":"10.1109/acssc.2010.5757865","title":"Randomized on-off signaling for asynchronous interference channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Transmitter; Computer science; Rayleigh fading; Upper and lower bounds; Topology (electrical circuits); Asynchronous communication; Fading; Interference (communication); Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.0183296997931817,"score_gpt":0.26529508210420094,"score_spread":0.24696538231101925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106861055","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.22604144,0.00012505167,0.7450643,0.00032728023,0.0006250979,0.0011468498,0.000006625006,0.0024347175,0.024228612],"genre_scores_gemma":[0.9726404,0.00004871137,0.026651159,0.00008688165,0.00007575224,0.0003834299,0.0000076173756,0.000029314066,0.000076710654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994406,0.000025031472,0.00021679307,0.00010420884,0.000062372084,0.00015096922],"domain_scores_gemma":[0.9988814,0.00059283746,0.000025660162,0.00040070908,0.00005606275,0.000043327076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040268115,0.00011824577,0.00025420045,0.00008081635,0.00004208301,0.000048305148,0.00033667797,0.00008892614,0.0001786837],"category_scores_gemma":[0.0001320443,0.00010481365,0.000092283524,0.000052114574,0.000049214897,0.00007499809,0.000035299894,0.00024971008,0.000031734395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076805954,0.00023839319,0.000014058952,0.00027083844,0.00033862243,0.0000019919771,0.0038102951,0.010888588,0.34584773,0.49272993,0.008902839,0.12927611],"study_design_scores_gemma":[0.0264596,0.000045310488,0.000001299596,0.000057041016,0.000013546705,0.0000026229695,0.00003529497,0.37270355,0.5842602,0.008864712,0.0072332826,0.0003234926],"about_ca_topic_score_codex":0.00000655295,"about_ca_topic_score_gemma":0.000013619239,"teacher_disagreement_score":0.74659896,"about_ca_system_score_codex":0.000016276532,"about_ca_system_score_gemma":0.000007844965,"threshold_uncertainty_score":0.42741764},"labels":[],"label_agreement":null},{"id":"W2107389462","doi":"10.1109/isit.2003.1228387","title":"Capacity achieving probability measure of an input-bounded vector gaussian channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Bounded function; Constraint (computer-aided design); Measure (data warehouse); Gaussian; Probability distribution; Channel (broadcasting); Mathematical optimization; Channel capacity; Additive white Gaussian noise; Noise (video); Probability mass function; Mathematics; Gaussian noise; Distribution (mathematics); Probability density function; Computer science; Topology (electrical circuits); Applied mathematics; Algorithm; Statistics; Telecommunications; Mathematical analysis; Combinatorics; Artificial intelligence; Data mining; Physics","score_opus":0.034414032763761836,"score_gpt":0.23814248677170927,"score_spread":0.20372845400794742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107389462","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.93898326,0.00016607839,0.018807733,0.00012607168,0.00007886118,0.00044058554,0.0000074717077,0.0014756835,0.03991425],"genre_scores_gemma":[0.967834,0.000014738074,0.032046862,0.000017868992,0.000010787009,0.00003546876,0.0000041087283,0.00002641243,0.000009735247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999022,0.0001629728,0.00028806506,0.00015454809,0.00018288133,0.00018954666],"domain_scores_gemma":[0.99885327,0.000039399365,0.000043720698,0.00088477193,0.00009292829,0.00008590606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470359,0.00014763922,0.00021938939,0.000071749644,0.000055998844,0.000024473176,0.0003176202,0.00012352626,0.00006138547],"category_scores_gemma":[0.00012713946,0.00014728519,0.000054583747,0.00021567916,0.00007885853,0.00025608385,0.000029314404,0.00023848936,0.0000044783615],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004661698,0.0018068788,0.00768996,0.0020177322,0.00035729373,0.0000036671913,0.015061396,0.00253929,0.26294783,0.6811665,0.00064713263,0.025715645],"study_design_scores_gemma":[0.0005421215,0.00014782645,0.019196788,0.00015110022,0.000027335374,0.000016977881,0.00026758408,0.011897764,0.9365421,0.026363753,0.004006153,0.0008405099],"about_ca_topic_score_codex":0.000063319574,"about_ca_topic_score_gemma":0.00034476962,"teacher_disagreement_score":0.67359424,"about_ca_system_score_codex":0.000095585274,"about_ca_system_score_gemma":0.000023135504,"threshold_uncertainty_score":0.60061157},"labels":[],"label_agreement":null},{"id":"W2107484830","doi":"10.1109/allerton.2011.6120305","title":"On the capacity of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Independent and identically distributed random variables; Encoder; State information; Upper and lower bounds; State (computer science); Finite state; Computer science; Information theory; Channel capacity; Process (computing); Encoding (memory); Topology (electrical circuits); Mathematics; Algorithm; Channel (broadcasting); Computer network; Random variable; Combinatorics; Statistics; Markov chain; Mathematical analysis; Artificial intelligence","score_opus":0.04512741354612344,"score_gpt":0.22393117961261258,"score_spread":0.17880376606648912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107484830","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.90096843,0.000021084432,0.07542174,0.000165531,0.00006521247,0.00066272117,0.000044710305,0.0004392462,0.02221134],"genre_scores_gemma":[0.998841,0.00011395364,0.0006840278,0.0001784971,0.00000307161,0.00009903031,0.0000102619,0.000018148023,0.000052047577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913293,0.000073569885,0.0002901309,0.00007631812,0.0002493763,0.00017769345],"domain_scores_gemma":[0.9983198,0.0006234088,0.00012736298,0.0007621481,0.0001320052,0.000035267665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038727454,0.00015058386,0.00014161789,0.00018084848,0.00011492074,0.00005332138,0.00079244433,0.000041622327,0.00008339781],"category_scores_gemma":[0.000110219895,0.000082209,0.000038756745,0.0005282155,0.00012579867,0.00059872924,0.00016062686,0.00022618986,0.000032213535],"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.00080178457,0.00062824,0.008375674,0.0009733371,0.0009832216,0.0000064211654,0.22262391,0.6470108,0.0019039116,0.031680904,0.018386565,0.066625215],"study_design_scores_gemma":[0.0006259091,0.00014384504,0.004791705,0.000088807225,0.000020912214,0.0000041383346,0.0009548262,0.24657679,0.7415724,0.0027794552,0.0019792179,0.0004620064],"about_ca_topic_score_codex":0.00071599934,"about_ca_topic_score_gemma":0.0006926834,"teacher_disagreement_score":0.7396685,"about_ca_system_score_codex":0.000063313695,"about_ca_system_score_gemma":0.000011373075,"threshold_uncertainty_score":0.33523858},"labels":[],"label_agreement":null},{"id":"W2108236351","doi":"10.1109/18.841196","title":"The capacity-cost function of discrete additive noise channels with and without feedback","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Aperiodic graph; Markov chain; Mathematics; Noise (video); Function (biology); Channel capacity; Markov process; Topology (electrical circuits); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.007147524987580594,"score_gpt":0.20126124492046119,"score_spread":0.1941137199328806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108236351","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.09497225,0.0000335045,0.89416933,0.00006522883,0.00011418057,0.0004955102,0.00012575914,0.00041851064,0.009605731],"genre_scores_gemma":[0.9987082,0.00054864853,0.00036472958,0.00005833535,0.000009051885,0.00017255964,0.00001208926,0.000014512375,0.00011191103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993479,0.000062612635,0.00026115015,0.000055950448,0.00015038183,0.000121965364],"domain_scores_gemma":[0.9993664,0.00013337993,0.000059794766,0.00031774704,0.00007979661,0.000042854303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023681433,0.00012857895,0.00011234977,0.00010612651,0.00023330525,0.000057338348,0.00012967605,0.000066874076,0.00013578037],"category_scores_gemma":[0.0000026961457,0.0000960067,0.000034602996,0.00017036726,0.00018595128,0.00092822674,7.4669236e-7,0.00023837511,0.0000429319],"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.0010551643,0.000054447217,0.000009316685,0.00011631423,0.00026302482,8.074663e-8,0.01208893,0.11520264,0.00043620807,0.0135332495,0.0003380435,0.8569026],"study_design_scores_gemma":[0.006532038,0.001703899,0.0037475217,0.0012566055,0.0005241072,0.00010799193,0.012254805,0.22487475,0.5652953,0.019959472,0.16113713,0.0026064087],"about_ca_topic_score_codex":0.0000072557805,"about_ca_topic_score_gemma":0.000011872571,"teacher_disagreement_score":0.90373594,"about_ca_system_score_codex":0.000036949066,"about_ca_system_score_gemma":0.000009928247,"threshold_uncertainty_score":0.39150396},"labels":[],"label_agreement":null},{"id":"W2108250525","doi":"10.1109/tit.2009.2032803","title":"On the Redundancy of Slepian–Wolf Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Notation; Mathematics; Decoding methods; Discrete mathematics; Combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.009391756757221476,"score_gpt":0.22049165870512452,"score_spread":0.21109990194790304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108250525","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.00926022,0.000016817292,0.94392073,0.00034381446,0.00015316284,0.00022926852,0.000022736966,0.0005719605,0.045481313],"genre_scores_gemma":[0.99885267,0.00012244104,0.00048799606,0.0004489204,0.0000063466264,0.00003123105,0.0000037081265,0.000008307116,0.000038351278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928874,0.00006179105,0.000335365,0.000040870484,0.00016565954,0.000107590306],"domain_scores_gemma":[0.9990884,0.00028342317,0.00006890998,0.00047456918,0.000057583402,0.000027090238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666907,0.00010731681,0.000103447324,0.00020046276,0.00013211406,0.000029775067,0.00026876465,0.00007063308,0.00016518748],"category_scores_gemma":[0.0000133798785,0.00008933151,0.00007245896,0.00021873359,0.000048100443,0.0005003568,5.671533e-7,0.00028652334,0.00008480243],"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.00006903575,0.000075306576,2.1904535e-7,0.0000441299,0.000042942967,1.281126e-7,0.0046075876,0.085065685,0.0018305143,0.7279578,0.0016481534,0.1786585],"study_design_scores_gemma":[0.0006307109,0.00031702558,0.00013299182,0.00037948028,0.000037894835,0.00000951198,0.0011998841,0.059816696,0.82447505,0.10394779,0.008548114,0.000504868],"about_ca_topic_score_codex":0.0000013674769,"about_ca_topic_score_gemma":6.501568e-7,"teacher_disagreement_score":0.9895925,"about_ca_system_score_codex":0.000056489844,"about_ca_system_score_gemma":0.000010291437,"threshold_uncertainty_score":0.36428332},"labels":[],"label_agreement":null},{"id":"W2108545731","doi":"","title":"Constellation Shaping for Broadcast Channels in Practical Situations","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Constellation; Additive white Gaussian noise; Dimension (graph theory); Modulation (music); Computer science; Constellation diagram; Topology (electrical circuits); Gaussian; Telecommunications; Algorithm; Mathematics; Theoretical computer science; White noise; Decoding methods; Acoustics; Physics; Bit error rate","score_opus":0.05056101543291634,"score_gpt":0.2746899502538407,"score_spread":0.22412893482092433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108545731","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.017959386,0.0014135785,0.8708403,0.004612224,0.00034392648,0.0017323095,0.000093251205,0.0013927476,0.10161225],"genre_scores_gemma":[0.84020066,0.0014181185,0.15701963,0.00004328798,0.000028909782,0.0003214713,0.00063273025,0.0000944238,0.00024075042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962075,0.0017917333,0.00078959187,0.0005549339,0.00027127063,0.00038501545],"domain_scores_gemma":[0.9942701,0.0020708235,0.00032053454,0.002015408,0.0011888132,0.0001343111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039235046,0.00037199655,0.00045063932,0.0004321826,0.00018649624,0.0002897125,0.00093953556,0.00051404315,0.00010599838],"category_scores_gemma":[0.00090835895,0.0004799563,0.0001863658,0.0003513738,0.00017848739,0.00027016713,0.00075635785,0.0009458814,0.000024233424],"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.00005983149,0.0020353082,0.0016105195,0.002346302,0.00044407937,0.000011602728,0.06949913,0.018129602,0.009654694,0.6454855,0.0099019455,0.24082144],"study_design_scores_gemma":[0.0010673746,9.563809e-7,0.0005338629,0.0045106937,0.00009084155,0.000021268226,0.00032012098,0.79427606,0.10230475,0.06441345,0.031062506,0.0013981191],"about_ca_topic_score_codex":0.000339947,"about_ca_topic_score_gemma":0.00067946134,"teacher_disagreement_score":0.8222413,"about_ca_system_score_codex":0.0002448002,"about_ca_system_score_gemma":0.00019686935,"threshold_uncertainty_score":0.9997652},"labels":[],"label_agreement":null},{"id":"W2108739512","doi":"10.1109/glocom.2008.ecp.356","title":"Secret Key Generation and Agreement in UWB Communication Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Key generation; Shared secret; Low-density parity-check code; Key (lock); Transceiver; Computer network; Channel (broadcasting); Public-key cryptography; Decoding methods; Computer security; Wireless; Algorithm; Telecommunications; Encryption","score_opus":0.03540755572473176,"score_gpt":0.23600031534227384,"score_spread":0.20059275961754208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108739512","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.97304213,0.0012023489,0.011151666,0.0004417579,0.000029538249,0.00022188519,0.0000013486705,0.0004155923,0.013493707],"genre_scores_gemma":[0.98497283,0.004319687,0.010438669,0.00007075891,0.000014501376,0.00005296913,0.000036611,0.000010866224,0.00008312498],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956715,0.000040995517,0.00016557015,0.00006965767,0.000073179064,0.000083425686],"domain_scores_gemma":[0.9995058,0.000021159778,0.000015358211,0.00040876796,0.000023468274,0.000025412255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013646015,0.000069927235,0.000082622,0.0000869825,0.000053800766,0.000015935515,0.00014431734,0.000052367428,0.00004415107],"category_scores_gemma":[0.000006970318,0.00007698907,0.000009954767,0.000099356796,0.000030505109,0.0001576924,0.000062128995,0.00010649343,0.00000991855],"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.000036745703,0.0008575801,0.05575759,0.0004439469,0.00022652844,0.000030655512,0.10199799,0.05777165,0.30054152,0.24566053,0.13340414,0.10327114],"study_design_scores_gemma":[0.0006804282,0.000043760865,0.014697939,0.000064329826,0.0000049757928,0.000030497862,0.00025521775,0.8540799,0.10293994,0.0012753162,0.025417188,0.00051051145],"about_ca_topic_score_codex":0.000095603216,"about_ca_topic_score_gemma":0.0002595523,"teacher_disagreement_score":0.7963082,"about_ca_system_score_codex":0.00004707656,"about_ca_system_score_gemma":0.000004424628,"threshold_uncertainty_score":0.31395233},"labels":[],"label_agreement":null},{"id":"W2109446578","doi":"10.1007/978-3-642-13681-8_40","title":"Turbo Code Using Adaptive Puncturing for Pixel Domain Distributed Video Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Puncturing; Computer science; Encoder; Parity bit; Turbo code; Distributed source coding; Coding (social sciences); Decoding methods; Algorithm; Coding tree unit; Codec; Real-time computing; Theoretical computer science; Computer engineering; Variable-length code; Computer hardware; Telecommunications; Mathematics","score_opus":0.027385590623205808,"score_gpt":0.2580633238110887,"score_spread":0.2306777331878829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109446578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074150297,0.0003212165,0.99622446,0.00009782257,0.00074460247,0.0006808548,0.000121244666,0.00060457876,0.0004637348],"genre_scores_gemma":[0.41980404,0.000036260342,0.5796379,0.000106484,0.0002666408,0.000026042471,0.000034199344,0.00008110341,0.0000073306815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997847,0.000017730144,0.0004928665,0.00066343346,0.00043172078,0.0005472554],"domain_scores_gemma":[0.9977811,0.0006201568,0.00017067828,0.0010961174,0.00021228766,0.00011966866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006264348,0.00052257796,0.0005379829,0.0004999125,0.00029043437,0.0002388629,0.0016020307,0.0005241623,0.000011123974],"category_scores_gemma":[0.00008317977,0.0005320275,0.00013871028,0.0002570128,0.00054162537,0.00028960302,0.0005436007,0.0013354662,0.0000031572347],"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.00006596945,0.00006315286,0.000042621563,0.0006082265,0.00014625925,0.000043870856,0.0037383558,0.45900798,0.11839368,0.038059294,0.0000774118,0.37975317],"study_design_scores_gemma":[0.00026773653,0.000051190116,0.00001498486,0.0007770506,0.000019281468,0.000036947462,7.189759e-7,0.8082593,0.05916902,0.12404729,0.006468876,0.00088757864],"about_ca_topic_score_codex":0.000010990483,"about_ca_topic_score_gemma":0.00015102119,"teacher_disagreement_score":0.41906255,"about_ca_system_score_codex":0.00054691656,"about_ca_system_score_gemma":0.00013315897,"threshold_uncertainty_score":0.9997131},"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":"W2109908968","doi":"10.1109/isit.2009.5205799","title":"Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Gaussian; Algorithm; Coding (social sciences); Bandwidth (computing); Channel (broadcasting); Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Statistics; Physics; Combinatorics","score_opus":0.023417470267449853,"score_gpt":0.23241727868177978,"score_spread":0.2089998084143299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109908968","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.07316659,0.0003946811,0.8870085,0.00050806574,0.000097539945,0.0004967467,0.000024024788,0.004696212,0.033607647],"genre_scores_gemma":[0.9943865,0.000048603037,0.0047893017,0.00015235771,0.00006880664,0.000026902331,0.000060423616,0.000051453302,0.00041568457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988615,0.000014284603,0.00042338626,0.00019809509,0.00014151531,0.00036122114],"domain_scores_gemma":[0.9991827,0.00012419664,0.00007299687,0.00044441086,0.000069175694,0.00010649099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017512185,0.00022384716,0.00027640085,0.00017696366,0.00015599566,0.00021066367,0.0003178798,0.000088784494,0.000033221077],"category_scores_gemma":[0.00010414332,0.00022888886,0.00013045577,0.00014352817,0.000033948007,0.0003146757,0.000056330722,0.00024072832,0.00002837711],"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.00009925482,0.0005743156,0.00062243076,0.00057942193,0.00066327,0.000036256773,0.009539498,0.14315517,0.049318194,0.040215835,0.1106558,0.64454055],"study_design_scores_gemma":[0.00051210966,0.00012782568,0.00025837115,0.00020290852,0.000032577194,0.000050723054,0.00037447774,0.9185842,0.052695796,0.0074696955,0.018958604,0.00073270104],"about_ca_topic_score_codex":0.0000092609425,"about_ca_topic_score_gemma":0.0000022179754,"teacher_disagreement_score":0.9212199,"about_ca_system_score_codex":0.00007108685,"about_ca_system_score_gemma":0.000008713013,"threshold_uncertainty_score":0.93338174},"labels":[],"label_agreement":null},{"id":"W2111046425","doi":"10.1109/dcc.2006.72","title":"Side Information Aware Coding Strategy in the Quadratic Gaussian CEO Problem","year":2006,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Decoding methods; Quadratic equation; Gaussian; Rate–distortion theory; Coding (social sciences); Mathematical optimization; Rate distortion; Computer science; Distortion (music); Algorithm; Mathematics; Statistics; Telecommunications; Bandwidth (computing)","score_opus":0.011114440315724986,"score_gpt":0.22945559919171649,"score_spread":0.2183411588759915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111046425","genre_codex":"other","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.08825319,0.00013734867,0.108990595,0.0012522718,0.0000334247,0.0009835841,0.000007475345,0.0020729727,0.79826915],"genre_scores_gemma":[0.9979031,0.000025596048,0.0018392478,0.00007562139,0.00001191513,0.00006858716,0.000038570975,0.000007859075,0.000029497367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993983,0.000037220172,0.00027949343,0.00003976858,0.00011611578,0.00012912293],"domain_scores_gemma":[0.9996014,0.000051421615,0.000028282151,0.0002875893,0.000019964258,0.00001130914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019767194,0.000083116414,0.000075798285,0.00009612362,0.000042602598,0.00011206005,0.0002638795,0.000053371823,0.000023857041],"category_scores_gemma":[0.000004397747,0.00006432475,0.000018504821,0.00021606368,0.000014584664,0.00056627725,0.000019261148,0.00016950538,0.00003166287],"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.0000066396865,0.0001121455,0.0021502986,0.0005152709,0.00001901176,0.000005638481,0.00637954,0.12469658,0.002773449,0.8087927,0.025345556,0.029203163],"study_design_scores_gemma":[0.0008972575,0.00008548256,0.048095703,0.0003286332,0.000017617373,0.00003859802,0.0083527705,0.83747333,0.022663988,0.03783895,0.043093625,0.0011140088],"about_ca_topic_score_codex":0.00041794163,"about_ca_topic_score_gemma":0.0011252972,"teacher_disagreement_score":0.9096499,"about_ca_system_score_codex":0.00004957846,"about_ca_system_score_gemma":0.000010420911,"threshold_uncertainty_score":0.26230872},"labels":[],"label_agreement":null},{"id":"W2111339146","doi":"10.1109/tit.2009.2013018","title":"Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Exponent; Decoding methods; Encoder; Channel (broadcasting); Source code; Mathematics; Lossless compression; Coding (social sciences); Transmitter; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Data compression; Statistics; Telecommunications; Combinatorics","score_opus":0.015455896946020144,"score_gpt":0.2536186090595721,"score_spread":0.23816271211355197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111339146","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.0039964747,0.00005512749,0.9890539,0.000055563873,0.0005660591,0.0007819453,0.000099498655,0.0014083006,0.0039831353],"genre_scores_gemma":[0.9981691,0.00008253075,0.0009794966,0.00016468257,0.000033652406,0.000335502,0.000044289056,0.000030784493,0.00015994292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987499,0.00008083563,0.00055512134,0.000103136364,0.00024347025,0.00026752046],"domain_scores_gemma":[0.99891424,0.00026028554,0.00011609157,0.0005030599,0.0001154663,0.000090867085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005710674,0.00022311395,0.0002263025,0.0006782943,0.00027065934,0.00014223468,0.00034569434,0.00014464835,0.00001768401],"category_scores_gemma":[0.000014328768,0.00023652476,0.00012106044,0.00038599962,0.000032940945,0.0013385762,0.0000014855424,0.00030902124,0.00008404234],"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.00016681291,0.000101904065,6.6184055e-7,0.000258858,0.00012616941,2.490919e-7,0.005268831,0.8711417,0.0008074391,0.031778403,0.0010789336,0.08927008],"study_design_scores_gemma":[0.002249609,0.00023101264,0.000036562673,0.0003053338,0.00010290733,0.000020183432,0.0037563571,0.87333184,0.10340375,0.0032704065,0.012321253,0.0009707706],"about_ca_topic_score_codex":0.0000076710185,"about_ca_topic_score_gemma":0.000001417896,"teacher_disagreement_score":0.99417263,"about_ca_system_score_codex":0.0001659589,"about_ca_system_score_gemma":0.000013031338,"threshold_uncertainty_score":0.96452004},"labels":[],"label_agreement":null},{"id":"W2112256428","doi":"10.1109/glocom.2010.5683210","title":"Secrecy in Two-Way Relay Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"New York Institute of Technology","funders":"","keywords":"Secrecy; Decoding methods; Computer science; Relay; Computer network; Path loss; Wireless; Information-theoretic security; Path (computing); Computer security; Communications system; Confidentiality; Power (physics); Telecommunications","score_opus":0.008224369609528666,"score_gpt":0.25328228750764414,"score_spread":0.24505791789811548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112256428","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.80418366,0.00019925555,0.010129978,0.000090244655,0.0003653562,0.00020451291,0.0000017468328,0.0019666594,0.1828586],"genre_scores_gemma":[0.9952,0.000035338544,0.004432951,0.000016426417,0.000030672283,0.000046960427,0.000003617674,0.000021248332,0.00021282515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995526,0.000018836838,0.0001694298,0.000070460315,0.0000699339,0.00011872918],"domain_scores_gemma":[0.9993758,0.00004638562,0.000011014847,0.0005129649,0.000019056364,0.000034759323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019382505,0.00007196024,0.00009702134,0.00009502576,0.000013905588,0.000029531211,0.00025520145,0.00006179214,0.000092358816],"category_scores_gemma":[0.000015528945,0.00007209293,0.000016996186,0.00013391112,0.000015197679,0.00010367134,0.000039720355,0.00037641553,0.000084170344],"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.0000031717675,0.00007743066,0.01373399,0.00012904064,0.00002377893,0.000009593433,0.0013115148,0.009601086,0.16673312,0.7937622,0.006034117,0.00858098],"study_design_scores_gemma":[0.00095805555,0.000023663575,0.01080076,0.00015230593,0.0000071992845,0.000052901785,0.00032604107,0.6958608,0.101622894,0.004460311,0.18471213,0.0010229351],"about_ca_topic_score_codex":0.00036103075,"about_ca_topic_score_gemma":0.0011696076,"teacher_disagreement_score":0.7893019,"about_ca_system_score_codex":0.000023837478,"about_ca_system_score_gemma":0.0000045663146,"threshold_uncertainty_score":0.29398644},"labels":[],"label_agreement":null},{"id":"W2112390972","doi":"10.1109/icnf.2011.5994315","title":"Channel noise and correlation noise of video sequences in distributed video coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Encoder; Computer science; Coding (social sciences); Residual frame; Distributed source coding; Decoding methods; Correlation; Noise (video); Algorithm; Channel (broadcasting); Residual; Artificial intelligence; Computer vision; Speech recognition; Frame (networking); Reference frame; Mathematics; Telecommunications; Statistics; Variable-length code","score_opus":0.027827389544995033,"score_gpt":0.2334609945017532,"score_spread":0.20563360495675817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112390972","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.81118965,0.00052898633,0.17710309,0.000084944484,0.00010200694,0.00034423126,0.000031737254,0.0007405277,0.009874841],"genre_scores_gemma":[0.99669284,0.0003681515,0.0028609363,0.000010132781,0.000004632365,0.00002274778,0.000018712313,0.0000115074845,0.000010354193],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.000027021113,0.0002594471,0.00009195953,0.000075196964,0.000107659675],"domain_scores_gemma":[0.99957997,0.000068001944,0.000042986005,0.00023472299,0.000040045972,0.000034247536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017290698,0.0000894269,0.00014439647,0.00009541509,0.000019676912,0.0000091026795,0.00014775897,0.00007730432,0.000037771744],"category_scores_gemma":[0.00004031331,0.000092364244,0.000017841743,0.00019878065,0.000053695836,0.00023801184,0.000053956053,0.000116422634,0.0000033049205],"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.00029796694,0.0009533416,0.36658818,0.0022010712,0.00031271848,0.000044924625,0.07794871,0.03963707,0.2906513,0.18108715,0.0070410096,0.03323656],"study_design_scores_gemma":[0.00066643953,0.000072988354,0.12871906,0.00037985807,0.00002046768,0.000010198689,0.00086791837,0.6358037,0.22506723,0.0074659237,0.0003972694,0.00052896456],"about_ca_topic_score_codex":0.00035909706,"about_ca_topic_score_gemma":0.00018424234,"teacher_disagreement_score":0.5961666,"about_ca_system_score_codex":0.000038112583,"about_ca_system_score_gemma":0.000006244646,"threshold_uncertainty_score":0.37665045},"labels":[],"label_agreement":null},{"id":"W2113292808","doi":"10.1109/tit.2010.2040867","title":"Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Alphabet; Encoder; Coding (social sciences); Algorithm; Artificial intelligence; Information retrieval; Mathematics; Statistics; Philosophy; Operating system","score_opus":0.007401680144173783,"score_gpt":0.2182925791372947,"score_spread":0.2108908989931209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113292808","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.14504665,0.000008347972,0.8494106,0.0001316203,0.00020850985,0.0004788477,0.000032511543,0.00043209517,0.004250833],"genre_scores_gemma":[0.99239963,0.000111552654,0.006905242,0.0001827964,0.000013576219,0.0002845421,0.000034518365,0.000019838113,0.00004831013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999182,0.000051305364,0.00036631338,0.00006911771,0.00015704408,0.00017420533],"domain_scores_gemma":[0.9985982,0.0007465758,0.00013987866,0.00030961222,0.00015239957,0.00005329595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054563885,0.00016529395,0.00013590053,0.00020315356,0.0006114081,0.0002558369,0.00018216901,0.00012114526,0.00007690929],"category_scores_gemma":[0.000041257223,0.0001378945,0.000054875756,0.0001509967,0.000119953846,0.0034231828,0.000004864175,0.00062276836,0.000053018946],"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.00085587817,0.000052888903,0.00002172308,0.00028380397,0.00026573904,1.5703665e-7,0.028753076,0.25177917,0.004702366,0.0103348475,0.00030214837,0.7026482],"study_design_scores_gemma":[0.0021069,0.00038475206,0.00028068785,0.000312451,0.00014937519,0.00008706032,0.0065455223,0.5200488,0.41592476,0.004359229,0.048767585,0.0010328679],"about_ca_topic_score_codex":0.000008058057,"about_ca_topic_score_gemma":0.00007749997,"teacher_disagreement_score":0.847353,"about_ca_system_score_codex":0.000113356386,"about_ca_system_score_gemma":0.000022694878,"threshold_uncertainty_score":0.56231743},"labels":[],"label_agreement":null},{"id":"W2114798828","doi":"10.1109/isit.2009.5205778","title":"A computation approach to the minimum total rate problem of causal video coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Coding (social sciences); Algorithm; Artificial intelligence; Mathematics; Statistics; Computer network","score_opus":0.018047484360254298,"score_gpt":0.24942983895202914,"score_spread":0.23138235459177484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114798828","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.11738332,0.00007227998,0.8117989,0.0010909617,0.000027703629,0.0006279898,0.0000038805847,0.0008587445,0.06813623],"genre_scores_gemma":[0.9339999,0.000009366799,0.065794565,0.00009926133,0.000014775471,0.000022949904,0.000007926547,0.000009454088,0.000041808475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994803,0.00003912251,0.00020300188,0.000078646844,0.00009320212,0.000105731684],"domain_scores_gemma":[0.9996069,0.000053936117,0.000026239833,0.00023562509,0.000048191825,0.00002910387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023105633,0.000078692254,0.00010884258,0.000060235398,0.00003450848,0.000025068643,0.00019568407,0.000036806214,0.0000034820264],"category_scores_gemma":[0.000008768883,0.00006243855,0.000026574819,0.00020707217,0.0000134424035,0.00007866774,0.000034528945,0.000097016746,0.000007048292],"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.00004009623,0.0003821373,0.000115711555,0.0002460859,0.00010568209,0.0000011485363,0.01581441,0.5135353,0.16331214,0.16736287,0.05654898,0.082535416],"study_design_scores_gemma":[0.0002753204,0.000112516966,0.0040670275,0.000065153195,0.00001361235,0.000011341848,0.00037709123,0.9370856,0.053290155,0.002205837,0.0021919946,0.00030429778],"about_ca_topic_score_codex":0.0000134390075,"about_ca_topic_score_gemma":0.0000034083273,"teacher_disagreement_score":0.81661654,"about_ca_system_score_codex":0.000026559173,"about_ca_system_score_gemma":0.0000064641786,"threshold_uncertainty_score":0.25461704},"labels":[],"label_agreement":null},{"id":"W2116107552","doi":"10.1109/isit.2010.5513355","title":"Zero-forcing for the symmetric Interference Channel with conferencing encoders","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Transmitter; Encoder; Interference (communication); Channel (broadcasting); Computer science; Zero (linguistics); Gaussian; Channel capacity; Topology (electrical circuits); Telecommunications; Forcing (mathematics); Mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.019892084456962125,"score_gpt":0.2353390185395288,"score_spread":0.21544693408256665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116107552","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.03535954,0.000079898586,0.9480632,0.0002537725,0.00013392685,0.00037703893,0.0000029122032,0.0008576967,0.014872048],"genre_scores_gemma":[0.98478293,0.00006184323,0.014808923,0.000068893765,0.000024299708,0.00015889877,0.0000030118106,0.000027823768,0.00006336329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948925,0.0000072676507,0.00013940819,0.0001017939,0.00008231054,0.00017995521],"domain_scores_gemma":[0.99897164,0.00037776708,0.000026701942,0.0004974539,0.00008937121,0.000037041937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019985493,0.00011653438,0.00010977271,0.00011286923,0.00010259151,0.00006899668,0.00048547363,0.00006351584,0.000025389993],"category_scores_gemma":[0.000053198884,0.000075896234,0.000030450055,0.00021647435,0.0000508778,0.00012742246,0.00005523522,0.0003230722,0.0000052967443],"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.000060366096,0.00008862757,0.0011973396,0.00039812163,0.00036704843,0.0000017215278,0.008382369,0.009624176,0.08760182,0.73430514,0.0075063957,0.15046686],"study_design_scores_gemma":[0.00035708715,0.00008415332,0.0004989288,0.0000746723,0.000027894503,0.000013071172,0.0007960159,0.8523551,0.13594183,0.003384259,0.0060778772,0.0003891035],"about_ca_topic_score_codex":0.00008358501,"about_ca_topic_score_gemma":0.0005045548,"teacher_disagreement_score":0.9494234,"about_ca_system_score_codex":0.00001962758,"about_ca_system_score_gemma":0.000016243117,"threshold_uncertainty_score":0.30949584},"labels":[],"label_agreement":null},{"id":"W2117654872","doi":"10.1109/isit.2007.4557472","title":"Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Encoder; Channel (broadcasting); Transmitter; Decoding methods; Exponent; Computer science; Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Telecommunications; Statistics; Combinatorics","score_opus":0.025116105316979553,"score_gpt":0.28711271797202703,"score_spread":0.2619966126550475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117654872","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.051528465,0.0006012619,0.929609,0.000046176774,0.00038229543,0.0008302702,0.000017136825,0.0022319916,0.0147534],"genre_scores_gemma":[0.99272245,0.000038982987,0.0056823986,0.000042038908,0.000108885964,0.00017342187,0.000035313784,0.00008991141,0.0011065692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987559,0.000028276541,0.00041308574,0.0001833916,0.0002214574,0.00039793248],"domain_scores_gemma":[0.9988013,0.0002663362,0.00005622679,0.00066612713,0.000086739565,0.00012327696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068949454,0.00020155797,0.00025268493,0.00036608253,0.0000882629,0.00006747323,0.00049827615,0.00013521551,0.000012822118],"category_scores_gemma":[0.00004522444,0.0001989243,0.000084562635,0.00037516482,0.000028042483,0.00017998766,0.0000931888,0.00018641654,0.000038930124],"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.00060761266,0.0015889101,0.0065795267,0.0064471927,0.0025273948,0.000049283182,0.019756332,0.26527253,0.07964501,0.25229686,0.23262727,0.13260204],"study_design_scores_gemma":[0.0028823207,0.00015183951,0.0013758749,0.0002680758,0.00009157817,0.00003177841,0.004418098,0.6143194,0.19287558,0.00077997264,0.1808421,0.001963375],"about_ca_topic_score_codex":0.00013258272,"about_ca_topic_score_gemma":0.000058422847,"teacher_disagreement_score":0.941194,"about_ca_system_score_codex":0.00012267474,"about_ca_system_score_gemma":0.000006379157,"threshold_uncertainty_score":0.8111898},"labels":[],"label_agreement":null},{"id":"W2119360038","doi":"10.1109/glocom.2010.5683783","title":"Distortion Analysis of Wyner-Ziv Distributed Video Coding","year":2010,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Computer science; Codec; Encoder; Coding (social sciences); Decoding methods; Coding tree unit; Bottleneck; ENCODE; Multiview Video Coding; Algorithm; Video quality; Real-time computing; Artificial intelligence; Video processing; Video tracking; Computer hardware; Mathematics","score_opus":0.008511844442523826,"score_gpt":0.23916447768617222,"score_spread":0.2306526332436484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119360038","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.662996,0.000029056971,0.33096102,0.0000651343,0.00006656007,0.000065604836,0.000045126675,0.00083651056,0.0049350057],"genre_scores_gemma":[0.99584174,0.000037267837,0.0039097774,0.000006880484,0.000008656824,0.00001149492,0.00015564873,0.0000098767005,0.000018663633],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950385,0.000011811139,0.00022611915,0.00007242342,0.000099762976,0.00008604164],"domain_scores_gemma":[0.9992984,0.000057718866,0.00003957285,0.0005109495,0.000058884194,0.00003447379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012972874,0.000069384085,0.00016997098,0.00019473355,0.000024818428,0.000012777036,0.0002099287,0.0000697119,0.00023355354],"category_scores_gemma":[0.00004017794,0.00007060374,0.000085144886,0.00064231525,0.000033013315,0.00009606477,0.000037417583,0.00015771044,0.000004380539],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007781265,0.00013805473,0.034790937,0.00008829064,0.0012446854,0.0000011611072,0.0007233593,0.007819288,0.86107516,0.072905146,0.006322591,0.014883553],"study_design_scores_gemma":[0.0001554014,0.000013114206,0.090775944,0.000015205975,0.0004524429,9.190907e-7,0.00007181492,0.4722488,0.41954392,0.00050388643,0.015864909,0.00035363823],"about_ca_topic_score_codex":0.0000645988,"about_ca_topic_score_gemma":0.0004580235,"teacher_disagreement_score":0.4644295,"about_ca_system_score_codex":0.000026723343,"about_ca_system_score_gemma":0.0000035768048,"threshold_uncertainty_score":0.2879137},"labels":[],"label_agreement":null},{"id":"W2120193017","doi":"10.1109/ciss.2009.5054851","title":"A cross-layer approach to enhance the security of wireless networks based on MIMO","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China","keywords":"Physical layer; Computer science; Wireless Transport Layer Security; Computer network; MIMO; Wireless network; Wireless; Wireless security; Encryption; Broadcasting (networking); Key distribution in wireless sensor networks; Channel (broadcasting); Telecommunications","score_opus":0.012566029932462176,"score_gpt":0.27982814603485767,"score_spread":0.2672621161023955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120193017","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.27582785,0.00018949831,0.57302505,0.0007203248,0.00006406228,0.00071511115,0.0000069259277,0.0012473579,0.14820385],"genre_scores_gemma":[0.993355,0.000031415373,0.0056282007,0.0008304943,0.000031048836,0.00005171835,0.0000059378954,0.000019765748,0.0000464404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991353,0.00005151204,0.00025949572,0.00015725801,0.00019018995,0.00020624493],"domain_scores_gemma":[0.99868166,0.00010962494,0.00003538162,0.0010447468,0.00007088464,0.000057700923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030167078,0.00015084524,0.00018401357,0.00006270969,0.000057703488,0.000043087635,0.0006650207,0.000105929736,0.000029986237],"category_scores_gemma":[0.000016215645,0.00011673451,0.000066335095,0.00033713534,0.00004580561,0.000068546964,0.0000411805,0.00029510766,0.0000073829915],"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.00009866774,0.0008132519,0.0005042232,0.000110875495,0.000044426593,0.0000010924457,0.0021928947,0.87018436,0.009247872,0.056805737,0.016497552,0.04349907],"study_design_scores_gemma":[0.000086650805,0.000055818135,0.0017597773,0.000037885486,0.0000036279905,5.585789e-7,0.000023090643,0.9053131,0.08999138,0.00029554626,0.002249928,0.00018265126],"about_ca_topic_score_codex":0.000022535223,"about_ca_topic_score_gemma":0.000010133337,"teacher_disagreement_score":0.71752715,"about_ca_system_score_codex":0.00003783298,"about_ca_system_score_gemma":0.000009971189,"threshold_uncertainty_score":0.47602952},"labels":[],"label_agreement":null},{"id":"W2120371241","doi":"10.1109/itw.2007.4313128","title":"Distributed Estimation; Three Theorems","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Estimator; Bivariate analysis; Distributed source coding; Computer science; Coding (social sciences); Estimation; Upper and lower bounds; Algorithm; Mathematics; Decoding methods; Mathematical optimization; Statistics; Channel code","score_opus":0.010367655089488522,"score_gpt":0.2445040624983228,"score_spread":0.23413640740883426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120371241","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.023165675,0.000070673486,0.91923416,0.00008013578,0.000031347176,0.000074356576,0.000004259561,0.0020465592,0.055292834],"genre_scores_gemma":[0.95736635,0.000008809318,0.0425212,0.000025331226,0.000011094995,0.000006036423,0.00003402472,0.000012802576,0.000014373477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996209,0.0000040767663,0.00013463091,0.000047335325,0.00007628983,0.000116732845],"domain_scores_gemma":[0.99952203,0.000070152164,0.0000101623455,0.0003362863,0.000026365962,0.00003498789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020939142,0.00006128163,0.000058283396,0.00004321612,0.000029264478,0.000017716022,0.00018850373,0.000045976292,0.00010717521],"category_scores_gemma":[0.000018913432,0.000058628073,0.000019783329,0.00014087532,0.000025540128,0.00008786295,0.00001978996,0.00008794112,0.00006020506],"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.0000053426693,0.000046221747,0.0018559529,0.000030141542,0.00003640764,0.0000034415077,0.00029993616,0.0067906505,0.005216617,0.8385534,0.010665536,0.13649634],"study_design_scores_gemma":[0.00028215648,0.00002117484,0.02868967,0.000031000844,0.0000097013335,0.000012149002,0.00010780576,0.6969431,0.16157232,0.078204565,0.033631887,0.000494467],"about_ca_topic_score_codex":0.000009995644,"about_ca_topic_score_gemma":0.00007592264,"teacher_disagreement_score":0.93420064,"about_ca_system_score_codex":0.00003622112,"about_ca_system_score_gemma":0.0000023794428,"threshold_uncertainty_score":0.23907834},"labels":[],"label_agreement":null},{"id":"W2120403301","doi":"10.48550/arxiv.1109.5420","title":"Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Relay channel; Channel (broadcasting); Computer science; Broadcasting (networking); Transmitter; Topology (electrical circuits); Interference (communication); Computer network; Transmission (telecommunications); Telecommunications; Electrical engineering; Physics; Engineering; Power (physics)","score_opus":0.1193048405335296,"score_gpt":0.19562420782510126,"score_spread":0.07631936729157165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120403301","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.26161385,0.00038214904,0.7286988,0.000062256775,0.00023859632,0.001180318,0.00003807532,0.0013934172,0.0063925106],"genre_scores_gemma":[0.9960487,0.00048779097,0.0031442812,0.000024449413,0.000042375555,0.00002671188,0.000025335963,0.000076650555,0.00012371696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988481,0.00006860527,0.0002269462,0.00046512473,0.000061604886,0.00032961028],"domain_scores_gemma":[0.9982304,0.0002244492,0.00017311324,0.0011867455,0.000099266756,0.00008602049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026517667,0.00035407435,0.00029365072,0.00018437204,0.00024072875,0.00006605381,0.0014031854,0.0002650501,0.000020152635],"category_scores_gemma":[0.00002977525,0.00031927804,0.00013738476,0.00025885671,0.00014992084,0.00018379105,0.0008396339,0.0009851656,0.000008759204],"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.0008638797,0.00036311292,0.005385427,0.0020559193,0.0026310142,0.00019692922,0.016111758,0.7765456,0.00197418,0.18461469,0.0022931646,0.0069643343],"study_design_scores_gemma":[0.00087698887,0.00015175546,0.0008109919,0.001337173,0.00035983187,0.000021020944,0.001836685,0.97866803,0.0055968417,0.0085522905,0.00061753177,0.0011708286],"about_ca_topic_score_codex":0.00022229781,"about_ca_topic_score_gemma":0.00018360185,"teacher_disagreement_score":0.73443484,"about_ca_system_score_codex":0.00025623618,"about_ca_system_score_gemma":0.000047985814,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W2124840461","doi":"10.1109/isit.2007.4557603","title":"Distributed Parameter Estimation with Side Information: A Factor Graph Approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Factor graph; Decoding methods; Algorithm; Low-density parity-check code; Computer science; Belief propagation; Distributed source coding; Message passing; Expectation–maximization algorithm; Mathematics; Channel code; Maximum likelihood; Statistics","score_opus":0.011669570810708888,"score_gpt":0.22478153248576044,"score_spread":0.21311196167505156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124840461","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.03482967,0.000014820942,0.9508938,0.00003087613,0.000011916057,0.00019243514,0.000014842695,0.0014035992,0.012607995],"genre_scores_gemma":[0.7569421,0.0000061869305,0.24278463,0.000037871483,0.000003949871,0.000022975164,0.00018993196,0.000008329405,0.0000040502923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.000007932854,0.00021933325,0.00005233175,0.00014421943,0.0001454421],"domain_scores_gemma":[0.9994497,0.00006816112,0.000032599623,0.00033995425,0.00005888154,0.00005071385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001064791,0.00010464778,0.00009375902,0.000117825126,0.00003690564,0.000058298483,0.00015753061,0.000067582245,0.000019729705],"category_scores_gemma":[0.000020112146,0.000087539695,0.000023063594,0.00028172735,0.000028920156,0.00065827626,0.000021070122,0.00013271187,0.000018398354],"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.00021805994,0.00050752267,0.011069477,0.0011399576,0.0006310892,0.000008876161,0.012614275,0.17467633,0.0019502363,0.12676272,0.015803613,0.65461785],"study_design_scores_gemma":[0.00074734236,0.00008835295,0.034231324,0.0000516541,0.000022357079,0.000040353407,0.0005379532,0.9005658,0.046121366,0.0021898116,0.014587141,0.00081653363],"about_ca_topic_score_codex":0.000014083874,"about_ca_topic_score_gemma":0.000009202842,"teacher_disagreement_score":0.7258895,"about_ca_system_score_codex":0.00004668537,"about_ca_system_score_gemma":0.000005502654,"threshold_uncertainty_score":0.35697654},"labels":[],"label_agreement":null},{"id":"W2124991406","doi":"10.1109/acssc.2012.6489314","title":"Improved modeling of the correlation between continuous-valued sources in LDPC-based DSC","year":2012,"lang":"en","type":"preprint","venue":"","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":"McGill University","funders":"","keywords":"Low-density parity-check code; Algorithm; Binary number; Randomness; Computer science; Distributed source coding; Decoding methods; Correlation; Theoretical computer science; Mathematics; Channel code; Statistics; Arithmetic","score_opus":0.026418000920852544,"score_gpt":0.2528663107399213,"score_spread":0.22644830981906872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124991406","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.56608653,0.00060239225,0.42874488,0.00008683467,0.0001776583,0.00077930174,0.000024996058,0.00069224345,0.0028051299],"genre_scores_gemma":[0.98952657,0.000029411613,0.010153384,0.00001578601,0.000048848673,0.00008787688,0.00006144579,0.000054803953,0.000021855658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986332,0.00013199616,0.00065539405,0.0001702589,0.00019891717,0.00021020645],"domain_scores_gemma":[0.99839336,0.00012399256,0.00018515572,0.0011650757,0.00009517345,0.00003724075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005400684,0.0002410293,0.0004334974,0.00017263394,0.000031132568,0.00002866397,0.00068074197,0.0004573043,0.00002400644],"category_scores_gemma":[0.00005307109,0.00020817855,0.00014626901,0.0001508098,0.00004640625,0.000078638266,0.00047241664,0.0009596241,0.0000023718744],"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.000005798358,0.00004322407,0.02392982,0.00034101092,0.000054823617,6.329177e-8,0.001407477,0.96993715,0.001764807,0.00067086576,0.000054153275,0.001790826],"study_design_scores_gemma":[0.0001707979,0.0000036415408,0.0019237387,0.00026823938,0.000030693373,1.0750068e-7,0.000058609756,0.9860891,0.0105382595,0.00065066275,0.000048346486,0.00021776347],"about_ca_topic_score_codex":0.00058756216,"about_ca_topic_score_gemma":0.00011835728,"teacher_disagreement_score":0.42344004,"about_ca_system_score_codex":0.00012453439,"about_ca_system_score_gemma":0.00004705025,"threshold_uncertainty_score":0.8489275},"labels":[],"label_agreement":null},{"id":"W2126013577","doi":"10.1109/isbmsb.2009.5133844","title":"Wyner-Ziv video coding with region adaptive quantization and progressive channel noise modeling","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Communications Research Centre Canada","funders":"","keywords":"Quantization (signal processing); Computer science; Coding (social sciences); Algorithm; Decoding methods; Channel (broadcasting); Adaptive coding; Computer vision; Artificial intelligence; Speech recognition; Data compression; Mathematics; Telecommunications","score_opus":0.025336410859606136,"score_gpt":0.23511360022394903,"score_spread":0.2097771893643429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126013577","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.10137914,0.00065544416,0.89224386,0.00037469805,0.000013265889,0.00033569758,8.1336503e-7,0.0013359608,0.0036610926],"genre_scores_gemma":[0.98219824,0.00041194638,0.017227849,0.00006928587,0.000020420186,0.000027615964,0.0000076980505,0.000022150387,0.000014824651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994293,0.000020929958,0.00015105383,0.00014509402,0.00010939188,0.00014423893],"domain_scores_gemma":[0.9995443,0.000021026806,0.000035441088,0.00025392693,0.00009688127,0.000048380345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007059386,0.00013232995,0.00013230999,0.00010407383,0.00007751854,0.00004901155,0.00011351681,0.00007025916,0.000002113269],"category_scores_gemma":[0.000009690707,0.00011876078,0.0000146971815,0.0001660341,0.000024698813,0.00033408505,0.000023690984,0.00013394866,0.000001424862],"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.0002899431,0.0002505981,0.00046600727,0.00022050724,0.00016316507,0.000055737804,0.013457715,0.66502124,0.012884655,0.2235665,0.0015595456,0.08206438],"study_design_scores_gemma":[0.00017105641,0.00008041131,0.000080854596,0.00016149704,0.000008564454,0.000016672215,0.00024214192,0.9922649,0.005523986,0.0012346046,0.000036491234,0.000178813],"about_ca_topic_score_codex":0.000013571618,"about_ca_topic_score_gemma":0.000012134638,"teacher_disagreement_score":0.8808191,"about_ca_system_score_codex":0.0000415219,"about_ca_system_score_gemma":0.0000071162676,"threshold_uncertainty_score":0.4842924},"labels":[],"label_agreement":null},{"id":"W2127931873","doi":"10.1109/isit.2004.1365515","title":"On the computation of the joint source-channel error exponent for memoryless systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Channel code; Exponent; Computation; Lossless compression; Channel (broadcasting); Upper and lower bounds; Mathematics; Source model; Discrete mathematics; Combinatorics; Probability of error; Random variable; Decoding methods; Mathematical analysis; Algorithm; Computer science; Data compression; Telecommunications; Theoretical computer science; Statistics","score_opus":0.044955719061881734,"score_gpt":0.24620194780445837,"score_spread":0.20124622874257664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127931873","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.31998146,0.00012928776,0.6754708,0.0014686398,0.00018698814,0.0010220677,0.0000065866734,0.0004140038,0.0013201111],"genre_scores_gemma":[0.99912345,0.0000073167835,0.0005733526,0.000064718886,0.000015071734,0.00015989713,0.0000023783275,0.000020979489,0.000032823467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994575,0.00003588939,0.00021609906,0.00006425746,0.0001362743,0.00008999125],"domain_scores_gemma":[0.9993508,0.000111060195,0.000056521665,0.0004075543,0.000058976315,0.000015113167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222276,0.00008172988,0.00011053683,0.00003414595,0.000073584655,0.000018914285,0.000271744,0.00004241697,0.0000025554766],"category_scores_gemma":[0.000026878102,0.00004791103,0.000067505076,0.00007960385,0.000036535956,0.00002958731,0.000045785015,0.0000929576,0.0000036657516],"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.000004231184,0.000047071277,0.0000017167362,0.00011361619,0.000027522758,4.1200344e-8,0.0019929279,0.8934612,0.004525329,0.097929545,0.0016150594,0.0002817212],"study_design_scores_gemma":[0.000636994,0.00008238004,0.00032809345,0.0005040714,0.00002036094,0.000004401669,0.0029910775,0.68571967,0.29076308,0.017742634,0.0009399087,0.00026733367],"about_ca_topic_score_codex":0.00007591445,"about_ca_topic_score_gemma":0.000016958253,"teacher_disagreement_score":0.679142,"about_ca_system_score_codex":0.00007048265,"about_ca_system_score_gemma":0.000008419747,"threshold_uncertainty_score":0.19537552},"labels":[],"label_agreement":null},{"id":"W2128031934","doi":"10.1109/tit.2013.2294368","title":"Lossless Coding for Distributed Streaming Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Distributed source coding; Encoder; Decoding methods; Computer science; Algorithm; Source code; Variable-length code; Lossless compression; Entropy encoding; Upper and lower bounds; Entropy (arrow of time); Theoretical computer science; Coding (social sciences); Data compression; Mathematics; Statistics","score_opus":0.008494965284645975,"score_gpt":0.22043993110051716,"score_spread":0.2119449658158712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128031934","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.011268616,0.000009083196,0.9851144,0.000042295487,0.00019054157,0.0002471353,0.00015742297,0.0011214801,0.0018490519],"genre_scores_gemma":[0.9969702,0.000035244793,0.0026029488,0.00008851338,0.000018841702,0.0001820388,0.00006714357,0.000017725772,0.000017346156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932384,0.00004444927,0.000307176,0.00005703669,0.000111644484,0.00015584931],"domain_scores_gemma":[0.9991289,0.00037344842,0.00005836769,0.00031489177,0.00007785282,0.0000465723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037458426,0.00012694318,0.00012296985,0.00018589382,0.00021205442,0.000080294514,0.0002105699,0.00009086588,0.000030114788],"category_scores_gemma":[0.00001559789,0.00013685388,0.00007428988,0.00013931951,0.00004223384,0.00073419686,9.993395e-7,0.00017015685,0.00004340872],"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.000097003656,0.000073256946,0.000005631158,0.00040189887,0.00012378217,6.451467e-8,0.005012675,0.39028215,0.0015181571,0.122432135,0.000948507,0.47910473],"study_design_scores_gemma":[0.0010355882,0.00010367486,0.00005773201,0.00017020165,0.000053171923,0.0000058241594,0.0015273611,0.61523885,0.32195505,0.011617064,0.04763958,0.00059590454],"about_ca_topic_score_codex":0.0000023076634,"about_ca_topic_score_gemma":0.000002925768,"teacher_disagreement_score":0.98570156,"about_ca_system_score_codex":0.00007314041,"about_ca_system_score_gemma":0.000007346133,"threshold_uncertainty_score":0.55807394},"labels":[],"label_agreement":null},{"id":"W2131093212","doi":"10.1109/glocom.2010.5683999","title":"Time Correlation Analysis of Secret Key Generation via UWB Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Victoria","funders":"","keywords":"Key (lock); Computer science; Key generation; Channel (broadcasting); Spatial correlation; Secrecy; Wireless; Characterization (materials science); Algorithm; Cryptography; Computer network; Telecommunications; Computer security; Physics","score_opus":0.009888231358007609,"score_gpt":0.2261635257363186,"score_spread":0.21627529437831097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131093212","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.67898154,0.000023172457,0.31327036,0.00005000266,0.000107831576,0.000103106606,0.0000063577786,0.00054904923,0.006908591],"genre_scores_gemma":[0.99006706,0.000017680828,0.009454942,0.000016184162,0.000036025263,0.000012774909,0.00021324039,0.000013323512,0.00016875881],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951136,0.000018956369,0.00021477476,0.00007626776,0.000106659834,0.00007198005],"domain_scores_gemma":[0.99938637,0.00003252991,0.000042772823,0.00042834578,0.00008166798,0.00002828729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015709916,0.00007298366,0.00015149378,0.00027257655,0.000024269353,0.000014859961,0.0001472399,0.00010667717,0.0007888054],"category_scores_gemma":[0.000014754433,0.000077286284,0.00006266506,0.0004403809,0.000024055296,0.00014200291,0.00002375627,0.000137698,0.000038863043],"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.0000014378118,0.000027397153,0.00067882764,0.000009099075,0.00028434955,1.3969006e-7,0.00079814164,0.0932032,0.89506614,0.004631234,0.0014472117,0.0038528305],"study_design_scores_gemma":[0.000032806933,0.0000054289467,0.00089489046,0.0000013859018,0.00007053289,3.3545393e-7,0.0000041316644,0.9065355,0.09151811,0.00007927808,0.00078208523,0.000075530006],"about_ca_topic_score_codex":0.00003858255,"about_ca_topic_score_gemma":0.00013439254,"teacher_disagreement_score":0.81333226,"about_ca_system_score_codex":0.000014192796,"about_ca_system_score_gemma":0.000004023005,"threshold_uncertainty_score":0.8636867},"labels":[],"label_agreement":null},{"id":"W2131633956","doi":"10.1109/mahss.2005.1542826","title":"Distortion sum-rate performance of successive coding strategy in gaussian wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Wireless sensor network; Rate distortion; Computer science; Gaussian; Distortion (music); Coding (social sciences); Rate–distortion theory; Distributed source coding; Decoding methods; Algorithm; Source code; Mathematical optimization; Mathematics; Channel code; Telecommunications; Statistics; Computer network; Bandwidth (computing); Data compression","score_opus":0.012150833387129654,"score_gpt":0.23835735398231314,"score_spread":0.22620652059518348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131633956","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.96839887,0.0001896994,0.023602337,0.000058478985,0.000029947076,0.00014122544,0.000002254703,0.0003644225,0.007212739],"genre_scores_gemma":[0.9982184,0.00080545107,0.0007981074,0.000015242583,0.00003605691,0.000022308794,0.000014945487,0.000023905197,0.00006558719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991971,0.00004205354,0.0003672454,0.00010814688,0.000089253685,0.0001961945],"domain_scores_gemma":[0.99947584,0.00005758774,0.00006778646,0.0003191599,0.00004076624,0.000038843125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019150086,0.00012505798,0.00018809714,0.00012015604,0.00003093056,0.000019385581,0.00022118536,0.000101189275,0.000050454375],"category_scores_gemma":[0.0000053443136,0.00013004329,0.000029142762,0.00023683973,0.000041620646,0.00033611004,0.00003527956,0.0002339208,0.000005657594],"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.00003110253,0.00009556425,0.017964933,0.00020499868,0.000027920078,0.0000030206309,0.0007272505,0.90356714,0.015295857,0.006988308,0.00036147345,0.054732457],"study_design_scores_gemma":[0.00015128966,0.000018796589,0.013626461,0.000098903074,0.0000031838288,0.000001232122,0.000090843714,0.93649554,0.049165387,0.000008969097,0.00017488812,0.00016450108],"about_ca_topic_score_codex":0.000064513464,"about_ca_topic_score_gemma":0.0004935936,"teacher_disagreement_score":0.054567955,"about_ca_system_score_codex":0.00011831665,"about_ca_system_score_gemma":0.000009783354,"threshold_uncertainty_score":0.53030115},"labels":[],"label_agreement":null},{"id":"W2132472950","doi":"10.1109/isit.2011.6033718","title":"An alternative to decoding interference or treating interference as Gaussian noise","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"","keywords":"Decoding methods; Gaussian noise; Computer science; Code word; Algorithm; Transmitter; Interference (communication); Gaussian; Zero-forcing precoding; Noise (video); Topology (electrical circuits); Telecommunications; Mathematics; Theoretical computer science; Channel (broadcasting); Precoding; MIMO; Physics; Artificial intelligence","score_opus":0.06126274845906893,"score_gpt":0.31238651592624594,"score_spread":0.251123767467177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132472950","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.5123025,0.000020042768,0.3234222,0.000047697915,0.00010215237,0.00026439744,0.0000047942367,0.0018001526,0.16203603],"genre_scores_gemma":[0.9301954,0.00004503268,0.06934171,0.000116245894,0.000023419736,0.00007459748,0.000003220277,0.000035031462,0.00016536975],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912846,0.00004832011,0.00028087347,0.0002186161,0.0000901402,0.0002336181],"domain_scores_gemma":[0.99899256,0.0000636493,0.000036704798,0.0006727445,0.00006539561,0.000168928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012727392,0.00018959843,0.00017905106,0.0001816093,0.00005479087,0.000070303,0.000867317,0.000060916922,0.0010132588],"category_scores_gemma":[0.00006196475,0.00016320545,0.000029815694,0.00020073255,0.000030664167,0.00042329132,0.00016457401,0.00020376958,0.00017224078],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040555833,0.0005658533,0.009020033,0.0001879164,0.00024678998,0.00008361505,0.18133068,0.0006594182,0.14510246,0.10656473,0.0015951748,0.5542378],"study_design_scores_gemma":[0.0002653093,0.0007439059,0.0020178573,0.0005177267,0.000015084771,0.000030482255,0.0032498962,0.09758125,0.8912341,0.0030852344,0.00043838707,0.0008207533],"about_ca_topic_score_codex":0.0005543125,"about_ca_topic_score_gemma":0.0007611263,"teacher_disagreement_score":0.74613166,"about_ca_system_score_codex":0.000093216826,"about_ca_system_score_gemma":0.000014938014,"threshold_uncertainty_score":0.9998999},"labels":[],"label_agreement":null},{"id":"W2132903062","doi":"10.1109/milcom.1989.103983","title":"Diversity and coding for an interference model","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Binary number; Computer science; Interference (communication); Coding (social sciences); Diversity (politics); Keying; Diversity combining; Phase-shift keying; Algorithm; Binary symmetric channel; Theoretical computer science; Channel (broadcasting); Mathematics; Bit error rate; Statistics; Telecommunications; Law; Arithmetic; Political science; Fading; Channel capacity","score_opus":0.07201464796768081,"score_gpt":0.27087163056780056,"score_spread":0.19885698260011975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132903062","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.2933838,0.00002739887,0.6984801,0.000007708877,0.000007508326,0.000061940904,0.0000013324233,0.00031240415,0.00771776],"genre_scores_gemma":[0.9581765,0.00006627044,0.041692168,0.000022774191,0.0000012129755,0.0000065951417,7.7028886e-7,0.0000047484423,0.000028972114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998354,0.000005832141,0.00004059274,0.000046186557,0.000019418883,0.000052617426],"domain_scores_gemma":[0.9998014,0.000019123398,0.0000041695207,0.00013512386,0.000016028454,0.000024161109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065281914,0.000035673253,0.00004139465,0.00002009302,0.00016128896,0.00000778103,0.00008916453,0.00002293696,0.000004268891],"category_scores_gemma":[0.000008894004,0.000038153394,0.000007219504,0.000017770557,0.000011098573,0.00012252374,0.00012876122,0.000035776535,2.9208675e-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.000005941205,0.000038472455,0.0034737138,0.000101734644,0.000020640655,1.360483e-7,0.009104043,0.0049802316,0.013027696,0.96247625,0.00152445,0.005246679],"study_design_scores_gemma":[0.00007732175,0.000014449334,0.00007348271,0.0000064234687,0.000002481825,6.7999866e-7,0.000085706,0.9696607,0.019804776,0.009848754,0.00034196192,0.00008325493],"about_ca_topic_score_codex":0.0000059235845,"about_ca_topic_score_gemma":0.000022564995,"teacher_disagreement_score":0.9646805,"about_ca_system_score_codex":0.000011474241,"about_ca_system_score_gemma":0.0000014484928,"threshold_uncertainty_score":0.15558502},"labels":[],"label_agreement":null},{"id":"W2132972662","doi":"10.1109/icc.2008.363","title":"Symmetric Distributed Source Coding using LDPC Code","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Alberta","funders":"Serono Symposia International Foundation","keywords":"Distributed source coding; Computer science; Source code; Coding (social sciences); Wireless sensor network; Linear network coding; Low-density parity-check code; Distributed computing; Code (set theory); Decoding methods; Variable-length code; Computer engineering; Theoretical computer science; Computer network; Algorithm; Mathematics","score_opus":0.044544031110661145,"score_gpt":0.25606388453634565,"score_spread":0.21151985342568452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132972662","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.33152512,0.00028692326,0.658441,0.00003769297,0.000042628144,0.00009917018,0.000014599549,0.002480086,0.007072788],"genre_scores_gemma":[0.9827104,0.00026938494,0.016839618,0.000033480126,0.000022331182,0.0000066811767,0.000022314618,0.00003167012,0.00006408883],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.00002210472,0.00019710712,0.00009570575,0.00013020595,0.00018780111],"domain_scores_gemma":[0.99938494,0.0000799969,0.000023911465,0.00040872983,0.00004397994,0.000058464684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086109394,0.000110367575,0.00013985559,0.00016499494,0.00012379831,0.000020475518,0.00026834258,0.00007325957,0.000054825363],"category_scores_gemma":[0.000039379433,0.00012030164,0.000041768555,0.000587143,0.00004094655,0.00012725207,0.000078560486,0.00017074615,0.000025938662],"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.000041580166,0.00075848616,0.061308708,0.00077363383,0.0007491714,0.00016221407,0.007100825,0.3024609,0.32276812,0.12233095,0.13159125,0.04995417],"study_design_scores_gemma":[0.0002157748,0.000010271436,0.0016753734,0.00003593281,0.000011068157,0.0000915236,0.000076126875,0.88602483,0.07378253,0.00013488313,0.03754351,0.00039815335],"about_ca_topic_score_codex":0.00004783233,"about_ca_topic_score_gemma":0.000006573674,"teacher_disagreement_score":0.65118533,"about_ca_system_score_codex":0.00011581428,"about_ca_system_score_gemma":0.000009703963,"threshold_uncertainty_score":0.49057588},"labels":[],"label_agreement":null},{"id":"W2133129288","doi":"10.1109/isit.2003.1228272","title":"A property of the intrinsic mutual information","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"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 Montréal","funders":"","keywords":"Mutual information; Property (philosophy); Measure (data warehouse); Context (archaeology); Computer science; Key (lock); Computation; Theoretical computer science; Correlation; Information theory; Mathematics; Data mining; Algorithm; Artificial intelligence; Statistics; Computer security","score_opus":0.007682789140887497,"score_gpt":0.18637397264955233,"score_spread":0.17869118350866484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133129288","genre_codex":"other","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.17007184,0.000079546386,0.018285448,0.00021961716,0.00011693199,0.00043793063,0.0000022333122,0.00085977284,0.8099267],"genre_scores_gemma":[0.9972935,0.000020913803,0.0025463714,0.00005581362,0.0000015471998,0.000010602207,6.6177483e-7,0.0000031062725,0.00006754108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997529,0.000017352073,0.00011440608,0.0000140527345,0.00006033968,0.000040989704],"domain_scores_gemma":[0.9996679,0.000010231712,0.000015080045,0.00026747602,0.000031459378,0.000007883508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006994662,0.000031927626,0.00003892319,0.000023790573,0.000014232631,0.000006944105,0.00013846696,0.000023961917,0.00004277788],"category_scores_gemma":[0.00003665271,0.00001689753,0.000016610487,0.00011197864,0.00001850898,0.00017210035,0.000022039168,0.000062001236,0.000016088043],"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.0000066550806,0.00008595367,0.00476648,0.00030361398,0.00006698137,1.1374973e-7,0.0083915675,0.0019556568,0.011136759,0.7631053,0.05078853,0.15939243],"study_design_scores_gemma":[0.00019262356,0.000015121424,0.0027990928,0.000031147338,0.000004622908,0.000005191268,0.00020202732,0.007840072,0.4533203,0.0012602268,0.53418446,0.00014512838],"about_ca_topic_score_codex":0.00000913239,"about_ca_topic_score_gemma":0.00000741031,"teacher_disagreement_score":0.8272216,"about_ca_system_score_codex":0.000014959242,"about_ca_system_score_gemma":0.000008361213,"threshold_uncertainty_score":0.06890613},"labels":[],"label_agreement":null},{"id":"W2134169741","doi":"10.1109/wcsp.2013.6677244","title":"Secrecy-based channel assignment for device-to-device communication: An auction approach","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Eavesdropping; Computer science; Secrecy; Computer network; Interference (communication); Channel (broadcasting); Wireless; Key (lock); Transmission (telecommunications); Cellular communication; Computer security; Telecommunications; Base station","score_opus":0.03855343970506984,"score_gpt":0.27309820531298973,"score_spread":0.2345447656079199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134169741","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.011474924,0.00014301906,0.9729791,0.0012140672,0.000048630936,0.0017509562,0.000007962246,0.0020464398,0.01033487],"genre_scores_gemma":[0.7923429,0.000019786228,0.2043797,0.0005062777,0.000034264467,0.0024076118,0.00017686558,0.000048823524,0.00008376398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990418,0.00008163495,0.00029794523,0.00019061299,0.00015774499,0.00023027792],"domain_scores_gemma":[0.9981833,0.00009675318,0.00004313834,0.001351562,0.00019017122,0.00013509003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030204345,0.00018116612,0.000179595,0.00013426863,0.0001427688,0.00011134456,0.0007035414,0.00012351265,0.000096821335],"category_scores_gemma":[0.000015778072,0.0001897067,0.000052921547,0.00022597257,0.000025853175,0.0004019258,0.00007792247,0.00016435212,0.0000798308],"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.000107957305,0.003268927,0.0006139103,0.0023004021,0.00054427626,4.819692e-7,0.012700799,0.50651324,0.06693085,0.11657277,0.1431641,0.1472823],"study_design_scores_gemma":[0.0003614901,0.00008509937,0.00058827683,0.00004220262,0.000014696529,0.0000014576145,0.00060154835,0.9447191,0.031113941,0.0024814138,0.019567203,0.0004235735],"about_ca_topic_score_codex":0.00015611736,"about_ca_topic_score_gemma":0.000051959774,"teacher_disagreement_score":0.780868,"about_ca_system_score_codex":0.00014648159,"about_ca_system_score_gemma":0.000017507471,"threshold_uncertainty_score":0.7736015},"labels":[],"label_agreement":null},{"id":"W2134201128","doi":"10.1109/icc.1993.397272","title":"Analysis of the capacity region for the non-cooperative multiaccess channel with Rician fading","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Rician fading; Fading; Channel (broadcasting); Computer science; Transmission (telecommunications); Computer network; Set (abstract data type); Gaussian; Information transmission; Aloha; Telecommunications; Wireless; Throughput","score_opus":0.04395539127973148,"score_gpt":0.24149361581758624,"score_spread":0.19753822453785477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134201128","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.20548764,0.00023134603,0.7843983,0.0011822385,0.00004619748,0.0009042959,0.000015866035,0.00031291426,0.0074212044],"genre_scores_gemma":[0.9984298,0.00010084129,0.001180561,0.00006310986,0.000009477834,0.00010577017,0.0000014852238,0.000013112733,0.00009588396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995599,0.000025676594,0.00014001245,0.00008072286,0.00009260621,0.000101079946],"domain_scores_gemma":[0.99911106,0.00015542426,0.00004874592,0.00056513544,0.00010518057,0.000014462708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009760604,0.00008856449,0.00015758365,0.00008517097,0.00013292833,0.000022250568,0.00044238262,0.000040506915,0.000015604775],"category_scores_gemma":[0.000018737208,0.000045780205,0.000086110325,0.00073746644,0.000057296777,0.000103849,0.00004003326,0.00010933095,5.3278484e-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.00002923395,0.00025679157,0.0089126555,0.000180259,0.005474542,7.3481436e-7,0.055684097,0.8914271,0.005193808,0.010702687,0.006899925,0.015238173],"study_design_scores_gemma":[0.000089815476,0.000011025842,0.0028039338,0.000017583912,0.00016294881,4.598174e-7,0.0004494308,0.9692171,0.02679966,0.00001592256,0.0003509196,0.00008118371],"about_ca_topic_score_codex":0.00017498524,"about_ca_topic_score_gemma":0.0009107032,"teacher_disagreement_score":0.7929421,"about_ca_system_score_codex":0.000032358414,"about_ca_system_score_gemma":0.0000018825972,"threshold_uncertainty_score":0.18668626},"labels":[],"label_agreement":null},{"id":"W2135641237","doi":"10.1109/isit.2006.261928","title":"On the Excess Distortion Exponent for Memoryless Gaussian Source-Channel Pairs","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Exponent; Distortion (music); Mathematics; Gaussian; Quadratic equation; Channel (broadcasting); Gaussian noise; Channel code; Upper and lower bounds; Additive white Gaussian noise; Gaussian random field; Decoding methods; Gaussian process; Statistical physics; Mathematical analysis; Algorithm; Physics; Statistics; Computer science; Telecommunications; Geometry; White noise","score_opus":0.01600184812705732,"score_gpt":0.21931611079955363,"score_spread":0.2033142626724963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135641237","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.17367497,0.00015433047,0.7973975,0.0019177999,0.00015661001,0.0007417278,0.000011239491,0.0020218142,0.023924023],"genre_scores_gemma":[0.9982633,0.000016706324,0.00061461685,0.00008811711,0.00006309156,0.00037744647,0.000027587328,0.000038124963,0.000511034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937326,0.000029618268,0.00019456896,0.00010908413,0.00012965064,0.0001638483],"domain_scores_gemma":[0.99923605,0.00017197858,0.00003241542,0.0005052981,0.000028256962,0.000025990612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019255666,0.00012126837,0.00010370109,0.000054646942,0.000120767356,0.00004048089,0.0002952214,0.0000626392,0.000051556366],"category_scores_gemma":[0.000014185451,0.000090391215,0.00006681475,0.0000780322,0.000032453852,0.00006671485,0.000030584557,0.000108831526,0.000015754122],"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.00006347981,0.0005231903,0.00016519493,0.00028313292,0.000097955686,0.0000019085007,0.0027636527,0.06346184,0.009204748,0.5753935,0.32759106,0.020450326],"study_design_scores_gemma":[0.0011141928,0.00018715065,0.004643049,0.00023982802,0.000051510433,0.0000064694686,0.0018206899,0.36058894,0.40639967,0.0997932,0.12364181,0.0015134803],"about_ca_topic_score_codex":0.00009860133,"about_ca_topic_score_gemma":0.00012736129,"teacher_disagreement_score":0.8245883,"about_ca_system_score_codex":0.000083388135,"about_ca_system_score_gemma":0.0000035514563,"threshold_uncertainty_score":0.3686047},"labels":[],"label_agreement":null},{"id":"W2136689674","doi":"10.1109/isit.2010.5513287","title":"On optimal causal coding of partially observed Markov sources under classical and non-classical information structures","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Counterexample; Markov decision process; Coding (social sciences); Markov process; Markov chain; Computer science; Conjecture; Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Machine learning","score_opus":0.01607025418917735,"score_gpt":0.23942370881842087,"score_spread":0.22335345462924353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136689674","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.96175206,0.000007471944,0.033185665,0.00032734193,0.0000835106,0.00012847397,0.000006903611,0.00033582514,0.004172723],"genre_scores_gemma":[0.9846424,0.000019340494,0.015190458,0.00006957197,0.000023154933,0.000011875998,0.000015486754,0.00001399944,0.000013732025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999277,0.000021337255,0.00029430716,0.00008094865,0.00017855117,0.00014788956],"domain_scores_gemma":[0.9993445,0.00017084151,0.0000515024,0.00030859018,0.000050234732,0.00007428863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012677406,0.00013182213,0.00017368354,0.00008948214,0.000050210765,0.00006855549,0.00020246842,0.00017055775,0.000078572935],"category_scores_gemma":[0.00004926347,0.00011801872,0.000034234818,0.00007624692,0.00011994391,0.0003299956,0.00008909777,0.0004012638,0.0000042326733],"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.00013203129,0.00010599235,0.0022856642,0.00029439628,0.00014200344,0.0000020553405,0.0025740457,0.012320084,0.2026467,0.7516204,0.0068717184,0.021004917],"study_design_scores_gemma":[0.0010430722,0.0002068653,0.12006326,0.00007898285,0.000034739023,0.00001576041,0.00036969935,0.66480124,0.20082407,0.008257601,0.003641459,0.00066325977],"about_ca_topic_score_codex":0.000013883441,"about_ca_topic_score_gemma":0.00009517089,"teacher_disagreement_score":0.7433628,"about_ca_system_score_codex":0.000016787386,"about_ca_system_score_gemma":0.000016082073,"threshold_uncertainty_score":0.48126638},"labels":[],"label_agreement":null},{"id":"W2137791875","doi":"10.1109/icc.2007.597","title":"Minimum Energy Data Gathering in Correlated Sensor Networks with Cooperative Transmission","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"MIMO; Wireless sensor network; Node (physics); Transmission (telecommunications); Computer science; Cooperative MIMO; Constellation; Coding (social sciences); Topology (electrical circuits); Efficient energy use; Data transmission; Algorithm; Mathematical optimization; Channel (broadcasting); Mathematics; Computer network; 3G MIMO; Statistics; Telecommunications; Engineering","score_opus":0.016738480303399514,"score_gpt":0.24060554458761454,"score_spread":0.22386706428421504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137791875","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.035657614,0.0004105237,0.953758,0.000044830755,0.000028004844,0.00010849669,0.0000021606063,0.00075273914,0.009237621],"genre_scores_gemma":[0.97632635,0.00043797964,0.022967959,0.00004734633,0.000012936933,0.0000054894845,0.00006837653,0.00003672373,0.00009682768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929374,0.000028014569,0.00022631139,0.0001575892,0.00008850611,0.00020583071],"domain_scores_gemma":[0.99914354,0.00010333471,0.000017161883,0.00064814277,0.000030006893,0.00005783548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023213965,0.00012922856,0.00014060037,0.000086887776,0.000029676472,0.00002029498,0.00037923746,0.00011145064,0.00005348715],"category_scores_gemma":[0.0000044569856,0.00011048491,0.000009560172,0.00031942953,0.000029132369,0.00017609443,0.00006251417,0.00023426603,0.0000020160082],"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.00032355599,0.0003013062,0.0033980764,0.000063560066,0.00017737929,0.00017073286,0.004554091,0.77936476,0.029561942,0.004849567,0.0039740056,0.173261],"study_design_scores_gemma":[0.00031131276,0.000024756502,0.000440141,0.00010222691,0.0000040735863,0.000009935849,0.00018510937,0.9757626,0.012534556,0.000008563785,0.01041166,0.00020507452],"about_ca_topic_score_codex":0.00017441057,"about_ca_topic_score_gemma":0.0008745581,"teacher_disagreement_score":0.94066876,"about_ca_system_score_codex":0.000033227072,"about_ca_system_score_gemma":0.000008685169,"threshold_uncertainty_score":0.4505444},"labels":[],"label_agreement":null},{"id":"W2138057312","doi":"10.1109/tcomm.2012.050912.110147","title":"Two Useful Bounds Related to Weighted Sums of Rayleigh Random Variables with Applications to Interference Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Cumulative distribution function; Mathematics; Rayleigh distribution; Random variable; Rayleigh scattering; Upper and lower bounds; Context (archaeology); Function (biology); Constant (computer programming); Probability density function; Applied mathematics; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis; Computer science; Physics","score_opus":0.023797860561646598,"score_gpt":0.27497698142799293,"score_spread":0.2511791208663463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138057312","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.01592397,0.00059674564,0.9732659,0.00046144752,0.00016054526,0.0017003138,0.00014835339,0.0010886124,0.0066540986],"genre_scores_gemma":[0.9558477,0.00042735343,0.04047414,0.000049231694,0.000012687992,0.0029292894,0.00003365728,0.00007542852,0.00015050374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830276,0.00022851836,0.0006800505,0.00020150894,0.00023788922,0.00034929518],"domain_scores_gemma":[0.99503297,0.000607811,0.00010278486,0.0036883934,0.00029223255,0.00027582337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041520837,0.00027613252,0.0003948038,0.00052591704,0.00035229788,0.00006750765,0.0016136981,0.00012935269,0.000047890157],"category_scores_gemma":[0.0000074574327,0.00027942527,0.000085363135,0.0014790338,0.00015116905,0.00033361054,0.00002277478,0.00054022716,0.0001275067],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085562584,0.0062548146,0.0016760008,0.0007993454,0.0030972275,0.0000010313087,0.03485905,0.5127272,0.1664891,0.23742034,0.004042095,0.031778183],"study_design_scores_gemma":[0.009353309,0.0014346997,0.0015870444,0.0035398095,0.0013664773,0.000174509,0.005117506,0.16529387,0.54569185,0.002921077,0.2582292,0.005290681],"about_ca_topic_score_codex":0.00016231304,"about_ca_topic_score_gemma":0.0002260646,"teacher_disagreement_score":0.93992376,"about_ca_system_score_codex":0.00019662784,"about_ca_system_score_gemma":0.000047125784,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W2140302921","doi":"10.1109/vtcf.2006.365","title":"Source-Channel Communication in One-Helper Problem","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Fusion center; Computer science; Channel code; Channel (broadcasting); Coding (social sciences); Distributed source coding; Scheduling (production processes); Computer network; Power consumption; Source code; Linear network coding; Power (physics); Decoding methods; Algorithm; Mathematical optimization; Telecommunications; Wireless; Mathematics; Cognitive radio","score_opus":0.016153655919326243,"score_gpt":0.21645147511820567,"score_spread":0.20029781919887943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140302921","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.8930665,0.0020107476,0.09018879,0.0023084665,0.00004719713,0.0006190002,0.0000053811564,0.0047801426,0.006973764],"genre_scores_gemma":[0.9864045,0.00048302283,0.01266007,0.000032056814,0.000011114442,0.00028719808,0.00002276026,0.000041712683,0.00005757808],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988449,0.00006386655,0.00040004493,0.0002254476,0.00014480547,0.00032090818],"domain_scores_gemma":[0.9985012,0.000041784697,0.00006737682,0.0012364301,0.00012679545,0.000026433363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021499977,0.00020387431,0.00027071923,0.00054185546,0.00007433187,0.000040994324,0.0009933705,0.00048230658,0.000019447945],"category_scores_gemma":[0.000015689968,0.0002444282,0.000040949533,0.0006167282,0.00024958167,0.00016137774,0.00013341161,0.0007267189,0.00006230987],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022774715,0.0010625178,0.01673214,0.00041836305,0.00016262021,0.00003085038,0.0016693368,0.09590218,0.52637225,0.3031529,0.0050104107,0.049463667],"study_design_scores_gemma":[0.0011593845,0.000081014936,0.0032151758,0.00076698407,0.00003289861,0.00005019216,0.000375813,0.28848326,0.48589694,0.19359532,0.024984265,0.0013587562],"about_ca_topic_score_codex":0.00020346853,"about_ca_topic_score_gemma":0.0005524121,"teacher_disagreement_score":0.19258107,"about_ca_system_score_codex":0.00010659916,"about_ca_system_score_gemma":0.000025526919,"threshold_uncertainty_score":0.99674934},"labels":[],"label_agreement":null},{"id":"W2140623855","doi":"10.1109/ciss.2009.5054736","title":"Generalized degrees of freedom of the symmetric gaussian interference channel with partial unidirectional transmitter cooperation","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Interference (communication); Transmitter; Channel (broadcasting); Degrees of freedom (physics and chemistry); Topology (electrical circuits); Multiplexing; Channel capacity; Upper and lower bounds; Noise (video); Computer science; Co-channel interference; Encoder; Orthogonality; Interference alignment; Gaussian noise; Zero-forcing precoding; Signal-to-noise ratio (imaging); Gaussian; Telecommunications; Control theory (sociology); Mathematics; MIMO; Precoding; Physics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.016562151865683397,"score_gpt":0.22421574005539233,"score_spread":0.20765358818970892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140623855","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.6791374,0.00038004312,0.3063737,0.0010048377,0.00012088818,0.00045592152,0.000016542408,0.0004605394,0.012050146],"genre_scores_gemma":[0.99245065,0.0000732785,0.0073766075,0.000026038106,0.000015796024,0.000011668756,0.0000045270444,0.000008224953,0.000033227858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994633,0.00004302365,0.00021945279,0.000070065515,0.00012460278,0.000079507765],"domain_scores_gemma":[0.99953204,0.00002523104,0.000041715226,0.00029426286,0.00008765225,0.000019068884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007796411,0.0000869725,0.00013556716,0.00010261882,0.000027429905,0.000009258141,0.00024633043,0.000048998943,0.00004507604],"category_scores_gemma":[0.000007634902,0.000057152407,0.000038474496,0.0004103228,0.00005693559,0.00009304571,0.000012331089,0.000099195255,6.0017027e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024987076,0.0006185287,0.0029198143,0.00018984653,0.000302688,0.0000010371596,0.0039642737,0.3690395,0.19917697,0.39918706,0.0033063157,0.021044081],"study_design_scores_gemma":[0.0006167365,0.00021271498,0.014615278,0.00013384235,0.000028209048,0.0000074920504,0.00004356573,0.37223944,0.61110866,0.00023919526,0.0005345517,0.00022031188],"about_ca_topic_score_codex":0.00008014283,"about_ca_topic_score_gemma":0.0001299841,"teacher_disagreement_score":0.4119317,"about_ca_system_score_codex":0.00001767694,"about_ca_system_score_gemma":0.0000141867,"threshold_uncertainty_score":0.23306075},"labels":[],"label_agreement":null},{"id":"W2141746073","doi":"10.1109/tit.2012.2236381","title":"Incremental Relaying for the Gaussian Interference Channel With a Degraded Broadcasting Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Topology (electrical circuits); Broadcasting (networking); Transmitter; Interference (communication); Computer network; Transmission (telecommunications); Telecommunications; Mathematics; Physics; Power (physics)","score_opus":0.02062139363930787,"score_gpt":0.23517059458312273,"score_spread":0.21454920094381486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141746073","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.0077086636,0.00007336987,0.988311,0.00009180799,0.0002332045,0.00048037074,0.000024668723,0.0006145936,0.0024623536],"genre_scores_gemma":[0.9949707,0.00006191534,0.00424785,0.00014980216,0.000024653862,0.0004918061,0.00000804749,0.000023218216,0.000022050262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992427,0.000047760732,0.00029304007,0.000051324627,0.0001334204,0.00023171534],"domain_scores_gemma":[0.999081,0.0003941106,0.00007547749,0.00034136738,0.000051805448,0.000056252742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005594441,0.0001482409,0.00010029488,0.00016182457,0.00034663093,0.00006396089,0.00025208687,0.00007323716,0.000036131667],"category_scores_gemma":[0.00001067871,0.00011104647,0.000055833498,0.00018784631,0.00006148757,0.0014335786,0.0000021896417,0.00032951465,0.00003307972],"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.00095228787,0.00029576058,0.00005487938,0.0005766791,0.000728062,3.3111968e-7,0.08966977,0.26593167,0.003266753,0.06514091,0.0013173702,0.57206553],"study_design_scores_gemma":[0.0031152458,0.0005616381,0.0005775569,0.000989927,0.00032645467,0.00016699819,0.028087039,0.51532966,0.43256608,0.0019752262,0.014557092,0.0017470929],"about_ca_topic_score_codex":0.000006554851,"about_ca_topic_score_gemma":0.0000051544253,"teacher_disagreement_score":0.987262,"about_ca_system_score_codex":0.00011049798,"about_ca_system_score_gemma":0.000011636446,"threshold_uncertainty_score":0.45283437},"labels":[],"label_agreement":null},{"id":"W2142207149","doi":"10.1109/cdc.2004.1429570","title":"Robust capacity of white Gaussian noise channels with uncertainty","year":2004,"lang":"en","type":"article","venue":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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":"University of Ottawa","funders":"","keywords":"Shannon–Hartley theorem; Channel capacity; Mathematics; Transmitter; Capacity planning; Additive white Gaussian noise; Multiplicative function; White noise; Channel (broadcasting); Robustness (evolution); Control theory (sociology); Computer science; Mathematical optimization; Coding (social sciences); Telecommunications; Statistics; Mathematical analysis","score_opus":0.031550939341375456,"score_gpt":0.23418548781471202,"score_spread":0.20263454847333656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142207149","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.7844046,0.00018550093,0.20798662,0.00057169446,0.000611479,0.0010551856,0.000167089,0.00070061244,0.0043172077],"genre_scores_gemma":[0.98989195,0.00082120794,0.008408601,0.00035514595,0.00012163661,0.00014965815,0.000018059165,0.000089889174,0.00014388295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969984,0.00012098804,0.0008667654,0.0006521009,0.0007144894,0.0006472116],"domain_scores_gemma":[0.9968829,0.0002506255,0.00027196412,0.001483778,0.0006980138,0.00041271874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004903455,0.00065820187,0.0009814657,0.00041202488,0.00026547365,0.00016007634,0.0009036857,0.00040652,0.00015321007],"category_scores_gemma":[0.00011127024,0.0005717376,0.0001700135,0.00045283136,0.00038270638,0.0003827473,0.00006706952,0.0006417766,0.00009795951],"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.0028249032,0.0014684582,0.0014160555,0.0005724342,0.0006836271,0.00011713212,0.006640522,0.71619874,0.19303651,0.020024385,0.0053367163,0.051680524],"study_design_scores_gemma":[0.037947945,0.004080101,0.0071955253,0.006931228,0.00051029085,0.00022980163,0.0012642316,0.80085427,0.10693847,0.019062242,0.008805615,0.0061802855],"about_ca_topic_score_codex":0.00021473806,"about_ca_topic_score_gemma":0.00038521914,"teacher_disagreement_score":0.20548731,"about_ca_system_score_codex":0.00024979602,"about_ca_system_score_gemma":0.00020131518,"threshold_uncertainty_score":0.9996734},"labels":[],"label_agreement":null},{"id":"W2143627081","doi":"10.1109/cwit.2011.5872157","title":"Resource allocation for secure OFDMA decode-and-forward relay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Orthogonal frequency-division multiple access; Secrecy; Resource allocation; Frequency-division multiple access; Artificial noise; Scheduling (production processes); Optimization problem; Iterative method; Mathematical optimization; Orthogonal frequency-division multiplexing; Computer network; Power (physics); Algorithm; Transmitter; Mathematics","score_opus":0.021104997593771248,"score_gpt":0.2203561053408395,"score_spread":0.19925110774706825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143627081","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.030480776,0.0013682195,0.9378539,0.00036757605,0.000068764835,0.00054568064,0.0000055514874,0.0021141912,0.027195366],"genre_scores_gemma":[0.94343317,0.00059061137,0.055353682,0.00013528175,0.00003417454,0.00019976408,0.000019506124,0.000040123123,0.0001936948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994807,0.000018267245,0.00018265912,0.00011293779,0.00005545284,0.00014995823],"domain_scores_gemma":[0.9994298,0.00006794197,0.000027020129,0.00037604469,0.000045963843,0.00005320205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018249662,0.0001042929,0.00011211693,0.00005508272,0.000053891323,0.000017749719,0.00021453653,0.00013384588,0.000053726417],"category_scores_gemma":[0.000015620899,0.000105240826,0.000036365163,0.00008470953,0.000025856238,0.00011171414,0.000053784526,0.00013365786,0.000004151835],"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.0001271136,0.00020047213,0.0045494596,0.00046471515,0.00040369175,0.0000019026949,0.013794208,0.02336009,0.0027020453,0.5133382,0.19968061,0.24137752],"study_design_scores_gemma":[0.00034055402,0.000058349164,0.0016521125,0.00006631031,0.000036457626,0.0000051735697,0.00021590134,0.8052515,0.016674837,0.0029363118,0.1723405,0.00042203834],"about_ca_topic_score_codex":0.00002000006,"about_ca_topic_score_gemma":0.000053849253,"teacher_disagreement_score":0.91295236,"about_ca_system_score_codex":0.000023821985,"about_ca_system_score_gemma":0.000003816183,"threshold_uncertainty_score":0.42915964},"labels":[],"label_agreement":null},{"id":"W2145901689","doi":"10.1109/cwit.2007.375710","title":"On Optimum Conventional Quantization for Source Coding with Side Information at the Decoder","year":2007,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Coding (social sciences); Computer science; Quantization (signal processing); Algorithm; Distortion (music); Lossy compression; Discrete mathematics; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Bandwidth (computing); Telecommunications","score_opus":0.012418035845753095,"score_gpt":0.2480474615688988,"score_spread":0.2356294257231457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145901689","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.043385822,0.000014267464,0.94488484,0.00020576302,0.000028806253,0.0002917306,0.0000034829984,0.00042691495,0.010758346],"genre_scores_gemma":[0.9844232,0.000014738474,0.014940049,0.00026452792,0.000012790262,0.000040522988,0.00010384866,0.0000140518105,0.00018624251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995367,0.000007951255,0.00017601563,0.00004352763,0.00012601407,0.00010980097],"domain_scores_gemma":[0.99940383,0.0002569281,0.000040806106,0.00019924792,0.00007849586,0.000020660194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030739207,0.00007079811,0.00005450012,0.00006633407,0.00012553837,0.000037715075,0.000116409836,0.000043511216,0.000048903286],"category_scores_gemma":[0.00002593735,0.000051335486,0.00002446742,0.00008822942,0.000025225108,0.00024813818,0.000021948488,0.00006709938,0.00002551351],"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.00023516481,0.000052481308,0.00081286987,0.00015114155,0.00010218941,2.5803106e-7,0.0018134407,0.30234098,0.002918693,0.6394978,0.02748998,0.024585001],"study_design_scores_gemma":[0.0010148318,0.000110914,0.0019147696,0.00009034702,0.000019286925,0.000012312411,0.0004977283,0.75569415,0.11403769,0.0015625904,0.12467268,0.0003726774],"about_ca_topic_score_codex":0.000005589996,"about_ca_topic_score_gemma":0.000092073096,"teacher_disagreement_score":0.9410374,"about_ca_system_score_codex":0.0000802835,"about_ca_system_score_gemma":0.0000056527792,"threshold_uncertainty_score":0.20934004},"labels":[],"label_agreement":null},{"id":"W2145921837","doi":"10.1109/ausctw.2011.5728730","title":"Resource allocation for secure OFDMA communication systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Subcarrier; Orthogonal frequency-division multiple access; Telecommunications link; Resource allocation; Scheduling (production processes); Frequency-division multiple access; Base station; Mathematical optimization; Iterative method; Optimization problem; Computer network; Maximization; Artificial noise; Orthogonal frequency-division multiplexing; Secrecy; Transmitter; Algorithm; Mathematics","score_opus":0.03807838911643079,"score_gpt":0.23096140574228965,"score_spread":0.19288301662585886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145921837","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.061196104,0.008701882,0.61412793,0.0010188244,0.00025265367,0.003150106,0.000051136307,0.010136331,0.30136502],"genre_scores_gemma":[0.9736337,0.00037970225,0.025051972,0.000041517404,0.000018114788,0.0005522457,0.000057858924,0.000035910718,0.0002289629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999469,0.000043124463,0.0002177577,0.000081949096,0.00007332779,0.00011483915],"domain_scores_gemma":[0.99895644,0.000068493086,0.000040025418,0.0008068209,0.00009383268,0.00003440044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022836974,0.00009211795,0.00010624275,0.000071485614,0.00006721165,0.000026495976,0.00045797892,0.0000983233,0.0000348497],"category_scores_gemma":[0.000014191824,0.0000967622,0.00003385811,0.00010583624,0.00002562859,0.00014743266,0.00004799679,0.00010269021,0.000013700103],"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.000022389775,0.00012490817,0.0003773032,0.00033594927,0.000114436916,1.6995948e-7,0.007953441,0.0019790814,0.005734173,0.8874285,0.08298789,0.012941719],"study_design_scores_gemma":[0.000488363,0.000061476414,0.0009383336,0.00021998616,0.00004284717,0.0000059743293,0.0016497317,0.41539294,0.060265563,0.0043490436,0.51596856,0.00061718724],"about_ca_topic_score_codex":0.00008218088,"about_ca_topic_score_gemma":0.00003057337,"teacher_disagreement_score":0.9124376,"about_ca_system_score_codex":0.000044666624,"about_ca_system_score_gemma":0.0000054826955,"threshold_uncertainty_score":0.39458483},"labels":[],"label_agreement":null},{"id":"W2146198330","doi":"10.1109/tit.2011.2146350","title":"Feedback Capacity of a Class of Symmetric Finite-State Markov Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"International Federation of Automatic Control","keywords":"Finite state; Markov process; Markov chain; Entropy (arrow of time); Mathematics; Channel capacity; Channel (broadcasting); Symmetry (geometry); Function (biology); Noise (video); Class (philosophy); Finite set; Topology (electrical circuits); Applied mathematics; Statistical physics; Discrete mathematics; Control theory (sociology); Computer science; Combinatorics; Mathematical analysis; Telecommunications; Physics; Statistics; Quantum mechanics","score_opus":0.021283171149604256,"score_gpt":0.2088022663887609,"score_spread":0.18751909523915664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146198330","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.069194354,0.000022361472,0.9116325,0.0000067302717,0.00022739453,0.0002398346,0.00012847582,0.00034966998,0.01819873],"genre_scores_gemma":[0.9963662,0.00017860316,0.0033230502,0.000031433152,0.0000030684857,0.00005079913,0.0000052711775,0.000014608394,0.000026936938],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990053,0.000073472365,0.0005666431,0.00005098811,0.00017420245,0.00012939217],"domain_scores_gemma":[0.99896,0.00022062844,0.00015840026,0.00045338125,0.00016268215,0.00004490991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040553775,0.00013059718,0.00019511959,0.0006900011,0.000043653134,0.00000943457,0.0002549446,0.00010018345,0.00018866306],"category_scores_gemma":[0.00001683928,0.00013957804,0.0001007744,0.00056594197,0.00010601536,0.00075803365,0.0000019264899,0.00023456517,0.000047175927],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008263322,0.00095758884,0.00002703311,0.0025821305,0.000796242,0.0000011769092,0.09317775,0.26361594,0.0053748973,0.11060846,0.00064465584,0.5213878],"study_design_scores_gemma":[0.0005650053,0.00015866722,0.00018134284,0.00014678616,0.00003904533,0.000005556402,0.0006696176,0.052596636,0.9331472,0.011300278,0.0008682781,0.00032157183],"about_ca_topic_score_codex":0.00002749917,"about_ca_topic_score_gemma":0.0000035890228,"teacher_disagreement_score":0.92777234,"about_ca_system_score_codex":0.00004904006,"about_ca_system_score_gemma":0.0000150375445,"threshold_uncertainty_score":0.56918275},"labels":[],"label_agreement":null},{"id":"W2148334288","doi":"10.1109/isit.2004.1365100","title":"An approximation of the Gilbert-Elliott channel via a queue-based channel model","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Divergence (linguistics); Autocorrelation; Queue; Channel (broadcasting); Algorithm; Bit error rate; Computer science; Mathematics; Applied mathematics; Statistics; Telecommunications","score_opus":0.016298054028626805,"score_gpt":0.2327899037048734,"score_spread":0.2164918496762466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148334288","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.047878623,0.00006167104,0.9468785,0.00049026427,0.00003563856,0.00033994563,0.000006137136,0.00072899443,0.0035802394],"genre_scores_gemma":[0.9802136,0.000022559265,0.019482575,0.0001322335,0.000013139373,0.00006874872,0.000013083704,0.00003409078,0.00002001306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992947,0.000030024281,0.00024130479,0.00011324379,0.00017434581,0.00014638904],"domain_scores_gemma":[0.9989305,0.00001865848,0.00005237146,0.00088123226,0.00007376032,0.000043491822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015590643,0.00013152018,0.00013931132,0.00009633774,0.000052443702,0.000016896844,0.000525856,0.00010482159,0.0000076141378],"category_scores_gemma":[0.000009141919,0.00010745772,0.00006552648,0.0002505718,0.000049109618,0.00019299139,0.00003899349,0.00015306681,0.000004792423],"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.0000032947762,0.0000925082,0.000002848441,0.00005778231,0.000007794732,6.3807164e-8,0.00077252125,0.96258265,0.024083216,0.011922373,0.000055635413,0.00041933707],"study_design_scores_gemma":[0.00015251349,0.000012935965,0.000023858363,0.000030225838,0.000003990544,5.925004e-7,0.000024584067,0.7085994,0.27873486,0.012305197,0.000017884435,0.00009395256],"about_ca_topic_score_codex":0.00012701553,"about_ca_topic_score_gemma":0.00008940044,"teacher_disagreement_score":0.93233496,"about_ca_system_score_codex":0.00007814696,"about_ca_system_score_gemma":0.000028101977,"threshold_uncertainty_score":0.43819988},"labels":[],"label_agreement":null},{"id":"W2149271506","doi":"10.1109/isit.2009.5205547","title":"On the Degrees of Freedom of the 3-user Gaussian interference channel: The symmetric case","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Degrees of freedom (physics and chemistry); Interference (communication); Channel (broadcasting); Measure (data warehouse); Gaussian; Function (biology); Topology (electrical circuits); Irrational number; Set (abstract data type); Mathematics; Computer science; Control theory (sociology); Combinatorics; Telecommunications; Physics; Geometry; Artificial intelligence; Quantum mechanics","score_opus":0.021692069115154717,"score_gpt":0.23939533313505257,"score_spread":0.21770326401989784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149271506","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.8498589,0.0010848086,0.017904019,0.009099121,0.0002252733,0.0011396933,0.000026071177,0.0007077619,0.11995438],"genre_scores_gemma":[0.9993384,0.00008372069,0.00038828584,0.00009691122,0.000009925192,0.000012145044,3.3241966e-7,0.000009856423,0.00006044377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994076,0.00007889094,0.0002147232,0.0000639991,0.00013358056,0.00010120701],"domain_scores_gemma":[0.9984127,0.0003706264,0.00006131168,0.001089035,0.000050854313,0.00001543737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024319091,0.00009725923,0.00011494626,0.000076521945,0.000059580663,0.000014404672,0.00092147576,0.00004811483,0.00004516148],"category_scores_gemma":[0.000100707235,0.000042182615,0.00006720464,0.00048095945,0.00009987659,0.000043590833,0.00009604465,0.00023355146,0.000003437327],"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.000010396205,0.00012407887,0.00011144627,0.000034186596,0.00006012724,0.0000044531253,0.0028589508,0.008350393,0.0023393172,0.96970594,0.008724622,0.0076761125],"study_design_scores_gemma":[0.0007382966,0.0007184538,0.0276415,0.0009499819,0.00011854593,0.0003281954,0.004911457,0.47194296,0.4625617,0.025566604,0.0035795372,0.0009427703],"about_ca_topic_score_codex":0.00017694723,"about_ca_topic_score_gemma":0.00020916504,"teacher_disagreement_score":0.9441393,"about_ca_system_score_codex":0.000017986966,"about_ca_system_score_gemma":0.0000065844583,"threshold_uncertainty_score":0.17201571},"labels":[],"label_agreement":null},{"id":"W2149792368","doi":"10.1109/isit.2010.5513275","title":"On the error exponent to redundancy ratio of interactive encoding and decoding","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Decoding methods; Exponent; Redundancy (engineering); Encoding (memory); Computer science; Coding (social sciences); Algorithm; Probability of error; Ergodic theory; Low-density parity-check code; Source code; Theoretical computer science; Error detection and correction; Discrete mathematics; Mathematics; Statistics; Artificial intelligence; Pure mathematics","score_opus":0.01833751768126094,"score_gpt":0.27156084326218427,"score_spread":0.2532233255809233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149792368","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.96817994,0.000012859826,0.011949649,0.0008051619,0.000079850106,0.00017122863,0.0000012719617,0.00017974067,0.01862029],"genre_scores_gemma":[0.9918446,0.000016077527,0.007976364,0.00008107318,0.000009893557,0.000033022352,5.376178e-7,0.000010417172,0.00002804659],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999665,0.000016205442,0.00012676627,0.000063136365,0.0000621806,0.000066668246],"domain_scores_gemma":[0.99934506,0.00027584942,0.000020426645,0.00030256624,0.000028402563,0.000027675998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014085832,0.000061503466,0.00007358858,0.00006172573,0.000039112725,0.000021663072,0.00016475537,0.00002856234,0.00009659834],"category_scores_gemma":[0.00011014032,0.000046288646,0.000015627107,0.00006580988,0.000021095782,0.00008003453,0.000067040426,0.0001952252,0.000006292502],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008393095,0.000021468017,0.0001417769,0.000015582473,0.000017963184,2.9516042e-7,0.0053420183,0.00013254158,0.80022866,0.1850591,0.0017566448,0.0072755604],"study_design_scores_gemma":[0.00006217744,0.000031264237,0.0008782844,0.000071663846,0.0000029686414,0.0000021672527,0.0005761672,0.017841345,0.9769405,0.0018562842,0.0016231872,0.00011400411],"about_ca_topic_score_codex":0.000016010958,"about_ca_topic_score_gemma":0.00007224672,"teacher_disagreement_score":0.18320282,"about_ca_system_score_codex":0.000014771627,"about_ca_system_score_gemma":0.0000033939423,"threshold_uncertainty_score":0.18875961},"labels":[],"label_agreement":null},{"id":"W2149831263","doi":"10.1109/isbmsb.2010.5463126","title":"Distributed video coding without channel codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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; Distributed source coding; Context-adaptive binary arithmetic coding; Encoder; Decoding methods; Coding tree unit; Coding (social sciences); Tunstall coding; Variable-length code; Adaptive coding; Computational complexity theory; Algorithm; Theoretical computer science; Multiview Video Coding; Data compression; Computer engineering; Computer hardware; Video processing; Lossless compression; Video tracking; Mathematics","score_opus":0.013078041046216975,"score_gpt":0.24759476704879452,"score_spread":0.23451672600257753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149831263","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.42920437,0.00009960826,0.5082429,0.0006883958,0.00040273924,0.00034511776,0.00006785613,0.009055941,0.05189305],"genre_scores_gemma":[0.9917799,0.00005527435,0.00794157,0.000041185947,0.00003465039,0.000032322223,0.000038600712,0.00002375557,0.000052734817],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995433,0.000009826159,0.00013676204,0.00008161667,0.000082150786,0.00014632072],"domain_scores_gemma":[0.99938124,0.00004718385,0.00001546572,0.00045869173,0.000041930867,0.00005549662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012006116,0.00009589056,0.00011348393,0.00004905025,0.00005140742,0.000041937015,0.00028688455,0.000084679385,0.00011588816],"category_scores_gemma":[0.000034984314,0.000095064504,0.000027374466,0.000109977605,0.00003856056,0.00012226652,0.00006092963,0.00029112882,0.00004322744],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011316023,0.0001222589,0.0054586944,0.00015717909,0.0001187809,0.000005043577,0.001400651,0.0010714519,0.7525856,0.1812037,0.0490936,0.008771723],"study_design_scores_gemma":[0.00034950674,0.000017692077,0.0037098557,0.000048648093,0.00001389712,0.00001945225,0.00014483983,0.29685196,0.6176998,0.003924913,0.076596126,0.00062332547],"about_ca_topic_score_codex":0.000022602757,"about_ca_topic_score_gemma":0.00015764947,"teacher_disagreement_score":0.5625755,"about_ca_system_score_codex":0.0000164183,"about_ca_system_score_gemma":0.0000046761193,"threshold_uncertainty_score":0.38766178},"labels":[],"label_agreement":null},{"id":"W2151442132","doi":"10.1109/ciss.2009.5054708","title":"Secrecy capacity region of Gaussian broadcast channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"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":"Secrecy; Converse; Computer science; Transmitter; Information-theoretic security; Channel (broadcasting); Gaussian; Coding (social sciences); Additive white Gaussian noise; Topology (electrical circuits); Computer network; Channel capacity; Node (physics); Mathematics; Computer security; Physics; Statistics","score_opus":0.027507745400563624,"score_gpt":0.23298278421140897,"score_spread":0.20547503881084533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151442132","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.35258445,0.0005844759,0.3323308,0.0012989226,0.000105939536,0.00037866397,0.000006339625,0.0034971149,0.30921328],"genre_scores_gemma":[0.9955557,0.00017245454,0.0040992084,0.0000673805,0.000017834462,0.000004209762,0.0000036712158,0.00001016823,0.000069352565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995636,0.000016658892,0.00016484676,0.0000666627,0.00007943973,0.0001088181],"domain_scores_gemma":[0.99945384,0.00001341278,0.000024499985,0.00043644535,0.00003253544,0.00003923903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006227987,0.000081102,0.00012169927,0.00007782343,0.000019070283,0.000007948213,0.00021064114,0.00006991333,0.00002559257],"category_scores_gemma":[0.000008078864,0.0000819231,0.00003755157,0.00013824266,0.000024031759,0.00010616188,0.000016194255,0.000116459836,0.000007723683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002928023,0.0004705645,0.0005426182,0.0003169532,0.00009823282,0.00001471599,0.009072252,0.0025700172,0.086631976,0.63516706,0.028861579,0.23622476],"study_design_scores_gemma":[0.00067724497,0.0002624189,0.01500465,0.00029269943,0.000022071335,0.000093382536,0.00036994723,0.07279538,0.8082966,0.0789661,0.022234293,0.0009851581],"about_ca_topic_score_codex":0.00003613001,"about_ca_topic_score_gemma":0.000010797689,"teacher_disagreement_score":0.72166467,"about_ca_system_score_codex":0.00002642925,"about_ca_system_score_gemma":0.0000034661732,"threshold_uncertainty_score":0.3340727},"labels":[],"label_agreement":null},{"id":"W2156440304","doi":"10.1186/s13640-015-0068-3","title":"Distributed video coding supporting hierarchical GOP structures with transmitted motion vectors","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Image and Video Processing","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":"Simon Fraser University","funders":"Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Encoder; Computer science; Coding (social sciences); Algorithm; Entropy (arrow of time); Computational complexity theory; Decoding methods; Algorithmic efficiency; Real-time computing; Mathematics; Statistics","score_opus":0.019407028663596792,"score_gpt":0.27749742276784733,"score_spread":0.25809039410425055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156440304","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.6677208,0.000674341,0.329669,0.0006676273,0.00006352911,0.00012857359,0.0000091787815,0.0005102238,0.00055672845],"genre_scores_gemma":[0.98843867,0.000108690365,0.011144482,0.000096839474,0.00012597464,0.0000062340623,0.00002063029,0.000054270415,0.000004237268],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985614,0.000106240026,0.0004546273,0.00018672648,0.0003562979,0.00033472138],"domain_scores_gemma":[0.999073,0.000084775296,0.00017271015,0.0001797844,0.00021001167,0.00027969596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352407,0.00024362002,0.00027102954,0.00019413105,0.00029691076,0.00047459555,0.00022897332,0.000090791895,0.000011355182],"category_scores_gemma":[0.00015208038,0.0001989758,0.00004466242,0.000293038,0.00012859749,0.000837175,0.000028551383,0.00090457604,0.0000018209194],"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.0011838672,0.00038577052,0.023733897,0.0015386662,0.00045317697,0.0010011296,0.029145842,0.007817989,0.13526206,0.0037812153,0.007806488,0.7878899],"study_design_scores_gemma":[0.013833428,0.0025253268,0.092996545,0.007634442,0.000618336,0.010073059,0.010640668,0.27951154,0.5178716,0.03727667,0.021241505,0.005776834],"about_ca_topic_score_codex":0.0000035188023,"about_ca_topic_score_gemma":0.0000029688683,"teacher_disagreement_score":0.7821131,"about_ca_system_score_codex":0.000108598964,"about_ca_system_score_gemma":0.000060061546,"threshold_uncertainty_score":0.81139976},"labels":[],"label_agreement":null},{"id":"W2156492938","doi":"10.1109/bsc.2006.1644580","title":"A Type Covering Lemma and the Excess Distortion Exponent for Coding Memoryless Laplacian Sources","year":2006,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Lemma (botany); Exponent; Mathematics; Lossy compression; Laplace operator; Distortion (music); Coding (social sciences); Discrete mathematics; Upper and lower bounds; Source code; Mathematical analysis; Computer science; Statistics; Bandwidth (computing); Telecommunications","score_opus":0.009866678584584091,"score_gpt":0.21256069407705783,"score_spread":0.20269401549247373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156492938","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.82441956,0.0009949496,0.1662668,0.0003508164,0.0001123089,0.00047300954,0.000005154776,0.0008206143,0.0065567773],"genre_scores_gemma":[0.99811846,0.00013410093,0.0014264433,0.000026184543,0.00004834781,0.000085040854,0.000011525974,0.000019907051,0.00013000675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955046,0.000021123964,0.0001594721,0.00008165041,0.000075103686,0.000112217655],"domain_scores_gemma":[0.99957764,0.00013005045,0.00002983187,0.00021461338,0.000030814324,0.000017067185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061457,0.000084919026,0.00011707222,0.000036759626,0.00011738299,0.000068723,0.00014667505,0.00003975961,0.0000082994175],"category_scores_gemma":[0.000013920615,0.00006672603,0.000027904629,0.00006566705,0.000059288428,0.000106150634,0.000045476725,0.00006823996,0.0000014949418],"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.0005510037,0.00020339852,0.008859128,0.0013825498,0.00025647273,0.0000041539583,0.011279575,0.022136565,0.06666896,0.8189338,0.02188343,0.047840957],"study_design_scores_gemma":[0.0057113674,0.00010628095,0.014127535,0.0003336975,0.00013340157,0.000028943126,0.0023488007,0.43044728,0.35150394,0.021155866,0.17250644,0.0015964343],"about_ca_topic_score_codex":0.00016422012,"about_ca_topic_score_gemma":0.00023838872,"teacher_disagreement_score":0.79777795,"about_ca_system_score_codex":0.000039354167,"about_ca_system_score_gemma":0.000003222688,"threshold_uncertainty_score":0.27210087},"labels":[],"label_agreement":null},{"id":"W2156919496","doi":"10.1109/isit.2003.1228273","title":"A new measure for conditional mutual information and its properties","year":2003,"lang":"en","type":"article","venue":"","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":"Université de Montréal","funders":"","keywords":"Infimum and supremum; Mutual information; Measure (data warehouse); Context (archaeology); Key (lock); Computer science; Information theory; Conditional mutual information; Theoretical computer science; Upper and lower bounds; Discrete mathematics; Mathematics; Statistics; Data mining; Artificial intelligence; Computer security","score_opus":0.024212337943863668,"score_gpt":0.21627303795999053,"score_spread":0.19206070001612685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156919496","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.05770939,0.0021918805,0.89017516,0.0005867385,0.00007544993,0.0011491805,0.000032307235,0.0019619823,0.04611792],"genre_scores_gemma":[0.9866579,0.000035736623,0.013043379,0.000059403406,0.0000077006935,0.000058210466,0.000021517162,0.000005735327,0.00011037487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974835,0.0000069761027,0.00009983297,0.000026070426,0.00006007915,0.00005867572],"domain_scores_gemma":[0.99981564,0.000014897287,0.000009960078,0.00007241422,0.000058069796,0.00002902389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006945055,0.00004833323,0.000047697733,0.000037934202,0.0000314929,0.000029923156,0.00004774824,0.00003746716,0.000045917197],"category_scores_gemma":[0.00004794545,0.000044396675,0.000011129724,0.000033599463,0.0000063044195,0.00042788158,0.0000069984762,0.00004067177,0.00001257214],"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.000011982114,0.000012061464,0.00006695224,0.00019904957,0.000045643443,5.7352345e-8,0.0020227002,0.0005509694,0.009490786,0.90569335,0.06706439,0.014842072],"study_design_scores_gemma":[0.0008911448,0.00005621888,0.0002898392,0.000044466582,0.000012302573,0.000019135592,0.00030486338,0.055695664,0.33037534,0.009218305,0.60271615,0.00037658005],"about_ca_topic_score_codex":0.0000020933853,"about_ca_topic_score_gemma":0.000006597792,"teacher_disagreement_score":0.9289486,"about_ca_system_score_codex":0.0000147901965,"about_ca_system_score_gemma":0.000018600073,"threshold_uncertainty_score":0.18104438},"labels":[],"label_agreement":null},{"id":"W2156994179","doi":"10.1109/cwit.2007.375720","title":"Source Side Information Can Increase the Joint Source-Channel Coding Error Exponent","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Exponent; Encoder; Channel (broadcasting); Binary symmetric channel; Computer science; Coding (social sciences); Decoding methods; Binary number; Joint (building); Channel capacity; Algorithm; Side channel attack; Mathematics; Channel code; Statistics; Telecommunications; Cryptography; Engineering; Arithmetic","score_opus":0.02035152491611192,"score_gpt":0.2286364480141017,"score_spread":0.2082849230979898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156994179","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.27779976,0.000077931174,0.6939365,0.0009640582,0.000074964984,0.00035482904,0.000003967023,0.0021270255,0.024660949],"genre_scores_gemma":[0.9973609,0.000045244542,0.0017898962,0.00055431994,0.000039724622,0.00003163725,0.00002268962,0.00002383843,0.00013175924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990455,0.000032431657,0.00039141095,0.000066382374,0.00020921219,0.0002550967],"domain_scores_gemma":[0.99910533,0.00012587797,0.000063655505,0.00055068254,0.00006247121,0.0000919741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071083405,0.00014190654,0.00012193213,0.00015011411,0.00015057359,0.000074581956,0.00031825362,0.00007943868,0.00003959349],"category_scores_gemma":[0.00008047932,0.00011460024,0.000055360804,0.00016716373,0.0000446778,0.00028630492,0.00014078105,0.00026782585,0.00005309044],"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.00015868527,0.00035633412,0.0016395069,0.0008677878,0.0005120769,0.000012687951,0.18005395,0.19219327,0.068695925,0.0664905,0.1050803,0.383939],"study_design_scores_gemma":[0.00074393174,0.000055836867,0.005297275,0.00017533252,0.00003844291,0.00006297549,0.016914176,0.4536884,0.23454128,0.0009731781,0.28644374,0.0010654273],"about_ca_topic_score_codex":0.0009773051,"about_ca_topic_score_gemma":0.0004232091,"teacher_disagreement_score":0.71956116,"about_ca_system_score_codex":0.00013719531,"about_ca_system_score_gemma":0.0000110919045,"threshold_uncertainty_score":0.46732622},"labels":[],"label_agreement":null},{"id":"W2157463142","doi":"10.1109/isit.2002.1023363","title":"Coding for the Wyner-Ziv problem with turbo-like codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Concatenation (mathematics); Algorithm; Coding (social sciences); Decoding methods; Encoder; Theoretical computer science; Mathematics; Arithmetic; Statistics","score_opus":0.01582211061168708,"score_gpt":0.22890775786997275,"score_spread":0.21308564725828566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157463142","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.0127469655,0.0011257968,0.86528945,0.0008712887,0.00009964377,0.0016146917,0.000010217051,0.003176983,0.11506497],"genre_scores_gemma":[0.92840445,0.00015452066,0.07076195,0.0001057927,0.000009779514,0.00017276462,0.000003153288,0.000030482814,0.00035712606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955416,0.000013213828,0.00011838803,0.00008108939,0.00008085385,0.00015231043],"domain_scores_gemma":[0.9992672,0.00022030495,0.00001804401,0.00042002602,0.000049226237,0.000025150006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020038875,0.00009820452,0.00009453071,0.000029076818,0.00009909414,0.0000487553,0.00024383338,0.00004103215,0.000039932886],"category_scores_gemma":[0.000013466407,0.00006217151,0.000027284183,0.00010893902,0.000036655554,0.00008461884,0.000017498836,0.00011080084,0.000005470501],"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.000022541364,0.00008457656,0.00096420955,0.0003011933,0.000266311,0.0000012832027,0.0022417514,0.010865038,0.011995181,0.9004469,0.058606848,0.0142041445],"study_design_scores_gemma":[0.0006844591,0.00009379599,0.0001792532,0.000107601285,0.00004870001,0.000021274762,0.0007379724,0.062199783,0.29148,0.0056246817,0.6382321,0.00059034687],"about_ca_topic_score_codex":0.000011100369,"about_ca_topic_score_gemma":0.000090986076,"teacher_disagreement_score":0.91565746,"about_ca_system_score_codex":0.000028050108,"about_ca_system_score_gemma":0.000010404693,"threshold_uncertainty_score":0.25352806},"labels":[],"label_agreement":null},{"id":"W2158946869","doi":"10.1109/tcomm.2013.112213.130302","title":"MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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 Toronto","funders":"","keywords":"Codebook; Degrees of freedom (physics and chemistry); Secrecy; MIMO; Channel (broadcasting); Artificial noise; Computer science; Linear subspace; Subspace topology; Information-theoretic security; Computer network; Transmitter; Mathematics; Computer security; Algorithm; Artificial intelligence; Physics","score_opus":0.025662316516211533,"score_gpt":0.2507151855061691,"score_spread":0.22505286898995758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158946869","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.022671575,0.00036241446,0.9624709,0.0004626773,0.00011466546,0.00043339483,0.00009145792,0.0014350816,0.011957829],"genre_scores_gemma":[0.9480979,0.0010091444,0.050465748,0.000024913345,0.000016863081,0.00020637865,0.00003081196,0.00007546552,0.00007278603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872017,0.00023144201,0.000413643,0.0001892096,0.00021584347,0.00022967323],"domain_scores_gemma":[0.9952672,0.00030105785,0.000087119224,0.004019256,0.000194104,0.00013126068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023640237,0.000246947,0.00029617272,0.00030180762,0.00032638505,0.00003924479,0.0016317071,0.00014339144,0.000038002432],"category_scores_gemma":[0.000005874879,0.0002519739,0.000094891344,0.00048383037,0.00035555815,0.000250048,0.000010210271,0.00057490217,0.000026156451],"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.00008545654,0.0019633574,0.000050244656,0.00016052375,0.0003704976,5.961075e-7,0.004893798,0.86411774,0.009615167,0.024562392,0.00034445443,0.093835756],"study_design_scores_gemma":[0.00079701195,0.00056739716,0.00036402867,0.00027080657,0.0001110569,0.000023388251,0.0004277468,0.95412755,0.028502638,0.00057786267,0.013562281,0.0006682395],"about_ca_topic_score_codex":0.0002404478,"about_ca_topic_score_gemma":0.0019688904,"teacher_disagreement_score":0.9254263,"about_ca_system_score_codex":0.00006810902,"about_ca_system_score_gemma":0.000031462892,"threshold_uncertainty_score":0.99999326},"labels":[],"label_agreement":null},{"id":"W2159637183","doi":"10.1109/isit.2009.5205815","title":"The secrecy capacity region of the degraded vector Gaussian broadcast channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"","keywords":"MIMO; Computer science; Secrecy; Channel (broadcasting); Superposition principle; Gaussian; Computer network; Topology (electrical circuits); Information-theoretic security; Node (physics); Dirty paper coding; Coding (social sciences); Channel capacity; Telecommunications; Mathematics; Precoding; Computer security; Physics; Statistics","score_opus":0.02463985667516852,"score_gpt":0.22139391253790486,"score_spread":0.19675405586273634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159637183","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.65897155,0.0038497606,0.043236528,0.028950306,0.000728034,0.0019056475,0.00001348794,0.004343036,0.25800163],"genre_scores_gemma":[0.99875146,0.00052102335,0.00042779598,0.000087329194,0.000024702964,0.000010999027,9.2641085e-7,0.000011475499,0.00016429665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994327,0.000057206304,0.00017815802,0.00006812191,0.0001227423,0.00014106433],"domain_scores_gemma":[0.9990285,0.0000592919,0.000041887226,0.00080551946,0.000035607805,0.000029204364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011578414,0.000095029805,0.00009831109,0.000025394527,0.00011866043,0.000021970494,0.0005668787,0.00006582099,0.000004947919],"category_scores_gemma":[0.00002857081,0.000054959688,0.00006731966,0.0001946891,0.0000701532,0.00006662417,0.000038783317,0.00020260189,0.0000032513963],"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.00003734278,0.00025790653,0.00069137797,0.000119441574,0.00014520591,0.0000029317018,0.009814106,0.00065639603,0.053216282,0.7182398,0.033260953,0.18355827],"study_design_scores_gemma":[0.0007124085,0.00016584623,0.11298282,0.00031618084,0.00004218795,0.00008590761,0.0009782724,0.036871836,0.6790767,0.049760003,0.11809871,0.00090916816],"about_ca_topic_score_codex":0.00004518871,"about_ca_topic_score_gemma":0.00008186099,"teacher_disagreement_score":0.6684798,"about_ca_system_score_codex":0.00003926637,"about_ca_system_score_gemma":0.000007337809,"threshold_uncertainty_score":0.2241191},"labels":[],"label_agreement":null},{"id":"W2163784633","doi":"10.1109/itw.2009.5351249","title":"Broadcasting correlated Gaussian sources with bandwidth expansion","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Gaussian; Computer science; Coding (social sciences); Algorithm; Bandwidth (computing); Channel (broadcasting); Source code; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Physics; Statistics; Combinatorics","score_opus":0.007559471628939487,"score_gpt":0.20667732366339608,"score_spread":0.1991178520344566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163784633","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.7862289,0.00053571764,0.08991681,0.00042656608,0.000041617066,0.00023117302,0.0000011438883,0.0058075637,0.11681048],"genre_scores_gemma":[0.9853125,0.00006719401,0.01432075,0.00010098228,0.000015140342,0.0000051976685,0.000007664405,0.000019644569,0.00015089147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946284,0.000016115822,0.00014818138,0.00009849434,0.00011425536,0.00016010841],"domain_scores_gemma":[0.99952483,0.000028556451,0.000022206814,0.00034286806,0.000027825512,0.00005370186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006746868,0.00011775004,0.00011529617,0.00007806056,0.000064171974,0.000040301868,0.00018215526,0.00006799522,0.00007874713],"category_scores_gemma":[0.000006859515,0.00009603214,0.000019700094,0.00019724308,0.00001989305,0.00014738218,0.00001634576,0.00018565162,0.000021931497],"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.000120457495,0.00038515936,0.009741789,0.00014519214,0.00017082255,0.00006823028,0.011838194,0.054200973,0.13071938,0.024353197,0.021361018,0.7468956],"study_design_scores_gemma":[0.001939268,0.0007540765,0.039922733,0.00094752514,0.00006205527,0.00019502894,0.0012646395,0.6070848,0.306428,0.0022453074,0.03707335,0.0020832478],"about_ca_topic_score_codex":0.000015535095,"about_ca_topic_score_gemma":0.000012399781,"teacher_disagreement_score":0.7448123,"about_ca_system_score_codex":0.00002591447,"about_ca_system_score_gemma":0.000006229302,"threshold_uncertainty_score":0.3916077},"labels":[],"label_agreement":null},{"id":"W2163988682","doi":"10.1109/ccece.2009.5090214","title":"DC-guided compression scheme for distributed video coding","year":2009,"lang":"en","type":"article","venue":"","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; Université Laval","funders":"","keywords":"Encoder; Computer science; Discrete cosine transform; Coding (social sciences); Decoding methods; Algorithm; Data compression; Scheme (mathematics); Computational complexity theory; Transform coding; Bit rate; Block (permutation group theory); Theoretical computer science; Computer hardware; Image (mathematics); Mathematics; Computer vision","score_opus":0.03282111526140187,"score_gpt":0.29538320479544794,"score_spread":0.2625620895340461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163988682","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.035312973,0.000207691,0.94944745,0.00092477736,0.00006087147,0.0004348234,0.00003270432,0.0035784675,0.010000213],"genre_scores_gemma":[0.93321437,0.00006729452,0.06636937,0.00012713658,0.000024309918,0.000032898017,0.000108443506,0.000014373023,0.00004184077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994517,0.000010999253,0.00020345463,0.000093722156,0.000081105936,0.00015903074],"domain_scores_gemma":[0.999412,0.00007265001,0.000022346467,0.00038570937,0.000059419133,0.000047886962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010146807,0.0001009775,0.00013176695,0.00004811999,0.00006621547,0.00003489342,0.0002598653,0.0000738394,0.00003870146],"category_scores_gemma":[0.000036540812,0.0001001739,0.00004692081,0.00010696992,0.00001188877,0.00012722194,0.000030882868,0.00010065381,0.0000085755655],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015970798,0.00009230205,0.00019891384,0.00009003369,0.00003218527,0.0000010380512,0.00020320636,0.0013342099,0.587057,0.089248806,0.3050671,0.016659262],"study_design_scores_gemma":[0.0005313764,0.00003710009,0.0011168745,0.000104838444,0.00000703917,0.0000034608986,0.000029552582,0.35251805,0.5398117,0.0043375157,0.10117867,0.00032384787],"about_ca_topic_score_codex":0.000003570446,"about_ca_topic_score_gemma":0.0000018579873,"teacher_disagreement_score":0.89790136,"about_ca_system_score_codex":0.000050627696,"about_ca_system_score_gemma":0.0000042666097,"threshold_uncertainty_score":0.4084973},"labels":[],"label_agreement":null},{"id":"W2166542733","doi":"10.1109/isit.2006.261609","title":"Successive Coding Strategy in the m-helper Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Encoder; Coding (social sciences); Computer science; Algorithm; Gaussian; Rate distortion; Rate–distortion theory; Decoding methods; Lossy compression; Distributed source coding; Channel code; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data compression; Statistics; Physics","score_opus":0.01268759477760932,"score_gpt":0.23902623913901272,"score_spread":0.22633864436140338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166542733","genre_codex":"other","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.13780959,0.00043214342,0.017510029,0.0006818766,0.000018303168,0.00038839565,0.0000025076533,0.0010722678,0.8420849],"genre_scores_gemma":[0.99833554,0.000037148988,0.0013927602,0.000049090828,0.000018064331,0.000055827433,0.000006323319,0.000010639294,0.00009460539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995734,0.00003110754,0.00014367027,0.00005603353,0.000081264414,0.00011449106],"domain_scores_gemma":[0.9996351,0.00007726172,0.000012137265,0.00025219785,0.000015866719,0.000007432258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014035474,0.000065478125,0.000062389394,0.000050368537,0.000027023543,0.00005258457,0.00030946732,0.000040921397,0.000051699513],"category_scores_gemma":[0.000002841819,0.00004803049,0.000016209877,0.0001617945,0.000018492487,0.000122055106,0.000021218062,0.00015129278,0.000015095989],"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.0000017243252,0.00007869471,0.0027083356,0.000060892136,0.000008489311,0.00000855343,0.0010034667,0.017339794,0.011237173,0.9426087,0.020512601,0.0044315564],"study_design_scores_gemma":[0.001959966,0.00014183432,0.079269335,0.00042612018,0.00003494483,0.00006184874,0.0064732325,0.43914527,0.19629148,0.15367019,0.11998866,0.002537123],"about_ca_topic_score_codex":0.00032313445,"about_ca_topic_score_gemma":0.0006788878,"teacher_disagreement_score":0.86052597,"about_ca_system_score_codex":0.00002648266,"about_ca_system_score_gemma":0.0000048094307,"threshold_uncertainty_score":0.19586265},"labels":[],"label_agreement":null},{"id":"W2168896888","doi":"10.1109/isit.2004.1365384","title":"On the discreteness of the capacity-achieving probability measure of conditional gaussian channels","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Measure (data warehouse); Probability mass function; Probability measure; Probability distribution; Mathematics; Bounded function; Channel (broadcasting); Covariance matrix; Conditional probability distribution; Constraint (computer-aided design); Gaussian; Conditional probability; Covariance; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Mathematical analysis; Combinatorics; Statistics; Physics; Telecommunications","score_opus":0.02830993436876642,"score_gpt":0.21788049016566166,"score_spread":0.18957055579689525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168896888","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.9705855,0.0000299557,0.017612375,0.002335792,0.00005553298,0.00044288597,0.000035886736,0.00017999901,0.008722058],"genre_scores_gemma":[0.99891436,0.000004948633,0.0009659483,0.000043943804,0.000008971688,0.000042722855,0.0000031386808,0.000010893393,0.0000050877593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993157,0.00007809371,0.00021708403,0.00007279515,0.00022781723,0.00008851794],"domain_scores_gemma":[0.99907273,0.00012162112,0.000057157635,0.00066107954,0.00007018284,0.000017231072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003253814,0.000088189016,0.00012684576,0.000025254601,0.000064098655,0.000008222539,0.00046071407,0.00005232256,0.00005461396],"category_scores_gemma":[0.00009393796,0.000049012804,0.00007640485,0.0001575269,0.0002025188,0.00006211091,0.00006033011,0.000190691,0.0000013150201],"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.000003896401,0.000061750965,0.0003554516,0.00009045585,0.000029619772,4.2251525e-8,0.00080045004,0.016839903,0.019536655,0.96211815,0.000066539855,0.00009708587],"study_design_scores_gemma":[0.00019218723,0.000033212335,0.013694062,0.0002963274,0.000011439972,0.0000027223052,0.00014167307,0.0012968796,0.7689784,0.21507868,0.000118709235,0.00015568269],"about_ca_topic_score_codex":0.000051554776,"about_ca_topic_score_gemma":0.0000588553,"teacher_disagreement_score":0.74944174,"about_ca_system_score_codex":0.000053137635,"about_ca_system_score_gemma":0.00002015039,"threshold_uncertainty_score":0.19986841},"labels":[],"label_agreement":null},{"id":"W2169354172","doi":"10.1109/glocom.2013.6831156","title":"Secure OFDM transmission based on multiple relay selection and cooperation","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Relay; Computer network; Computer science; Subcarrier; Orthogonal frequency-division multiplexing; Relay channel; Transmission (telecommunications); Selection (genetic algorithm); Node (physics); Cooperative diversity; Channel (broadcasting); Multiplexing; Fading; Electronic engineering; Telecommunications; Engineering; Power (physics)","score_opus":0.005670832702526604,"score_gpt":0.1928550495690196,"score_spread":0.187184216866493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169354172","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.5433529,0.00011260376,0.44467974,0.0009730394,0.000038586008,0.0006468247,0.0000018574658,0.0022848335,0.007909646],"genre_scores_gemma":[0.98163,0.000080150916,0.01798812,0.00011936782,0.000010725684,0.00006810702,0.000016031141,0.00001940616,0.00006803568],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960524,0.000030561936,0.00011582918,0.00009147915,0.000074157375,0.00008272225],"domain_scores_gemma":[0.9996666,0.00007526557,0.000010055155,0.00015546837,0.000048483926,0.00004415735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060450555,0.00008635798,0.000070014605,0.00007009443,0.000062286985,0.00004253868,0.00006038049,0.00009040288,0.0002435189],"category_scores_gemma":[0.000014870734,0.00007865301,0.000014689768,0.000106832675,0.00000929287,0.00017691596,0.000005828189,0.00014396077,0.000026401667],"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.00003319218,0.00021652943,0.0033006892,0.00021512785,0.0000306594,5.8437945e-7,0.001326614,0.21983609,0.58951384,0.0048252116,0.03300494,0.14769651],"study_design_scores_gemma":[0.0001766,0.000036629415,0.0012929501,0.000022827271,0.0000018818948,7.941255e-7,0.000009419259,0.9064393,0.084697,0.000031187603,0.007197933,0.0000934892],"about_ca_topic_score_codex":0.000052883366,"about_ca_topic_score_gemma":0.000032905526,"teacher_disagreement_score":0.6866032,"about_ca_system_score_codex":0.00003118521,"about_ca_system_score_gemma":0.000005118585,"threshold_uncertainty_score":0.32073766},"labels":[],"label_agreement":null},{"id":"W2171404613","doi":"10.1109/cwit.2013.6621590","title":"An enhanced cross-layer authentication mechanism for wireless communications based on PER and RSSI","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"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; Physical layer; Authentication (law); Spoofing attack; Computer network; Wireless; Wireless network; Network packet; Computer security; Telecommunications","score_opus":0.023457115953581496,"score_gpt":0.3041392626381995,"score_spread":0.280682146684618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171404613","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.3995441,0.0000266467,0.5922322,0.0010509387,0.000040543357,0.0009914077,0.000014794092,0.0013348758,0.004764471],"genre_scores_gemma":[0.9276076,0.00006699693,0.07074379,0.00033314395,0.000011983944,0.0010445443,0.0000673432,0.000042654283,0.00008196821],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993003,0.000044029737,0.0002280351,0.00016140145,0.00010202716,0.000164235],"domain_scores_gemma":[0.9978818,0.00017245716,0.000037427842,0.0016113501,0.0002156096,0.000081347964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014489061,0.00014000224,0.00012990429,0.000097797936,0.0001714129,0.0001653346,0.00056662655,0.00011309955,0.0001266471],"category_scores_gemma":[0.000018930505,0.0001407718,0.00003484498,0.0000744676,0.000077470664,0.0003427014,0.000051668754,0.00013475766,0.00004283717],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007682045,0.00020757044,0.00009369764,0.000075150994,0.000021934044,2.3393369e-8,0.000959917,0.00028451192,0.6307412,0.3522271,0.00052172545,0.014859481],"study_design_scores_gemma":[0.0002399482,0.00004956444,0.0011423673,0.000019388663,0.0000068263303,2.6489437e-7,0.00007359324,0.76777786,0.22245182,0.007612388,0.0004414565,0.000184501],"about_ca_topic_score_codex":0.000039384595,"about_ca_topic_score_gemma":0.000030906307,"teacher_disagreement_score":0.76749337,"about_ca_system_score_codex":0.000044929224,"about_ca_system_score_gemma":0.000010527671,"threshold_uncertainty_score":0.57405066},"labels":[],"label_agreement":null},{"id":"W2175451653","doi":"10.1109/pacrim.2015.7334844","title":"Secrecy capacity and wireless energy harvesting in amplify-and-forward relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Relay; Jamming; Secrecy; Computer network; Computer science; Wireless; Energy harvesting; Relay channel; Energy (signal processing); Power (physics); Telecommunications; Computer security; Mathematics; Physics","score_opus":0.028301634109962268,"score_gpt":0.2182910036199994,"score_spread":0.18998936951003714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175451653","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.78307116,0.00085315946,0.19805048,0.00010166022,0.00005840945,0.00009519383,0.0000018851528,0.00095227355,0.016815746],"genre_scores_gemma":[0.99126834,0.0004871476,0.007977639,0.000077791454,0.000026703763,0.000027015047,0.0000059792396,0.000027462915,0.00010194385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929464,0.00005994279,0.00022240386,0.00013974916,0.00008816797,0.00019507048],"domain_scores_gemma":[0.99940675,0.000109688415,0.000025056343,0.00028987415,0.0000335763,0.00013504688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033894088,0.00013208574,0.00018463886,0.00009061058,0.000031836553,0.000057884972,0.00014672286,0.00014723731,0.0000045375527],"category_scores_gemma":[0.000036270263,0.00013785454,0.000012273293,0.00015665624,0.00006032204,0.00022395662,0.00012745001,0.00027733707,0.0000011045695],"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.000034422956,0.0001003344,0.074844934,0.00022394425,0.000107256536,0.000021540045,0.0061002383,0.059443977,0.0032353213,0.56228673,0.0043089925,0.28929228],"study_design_scores_gemma":[0.0004800249,0.000029634084,0.0046591633,0.00010938118,0.000007107404,0.000030838317,0.0002177973,0.9731219,0.0022066438,0.004759127,0.013924877,0.00045353879],"about_ca_topic_score_codex":0.0016293648,"about_ca_topic_score_gemma":0.0017564287,"teacher_disagreement_score":0.9136779,"about_ca_system_score_codex":0.000058045604,"about_ca_system_score_gemma":0.0000083965015,"threshold_uncertainty_score":0.56215453},"labels":[],"label_agreement":null},{"id":"W2176748244","doi":"10.2197/ipsjjip.23.554","title":"A Model for Adversarial Wiretap Channels and its Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Alberta Innovates","keywords":"Computer science; Secrecy; Adversarial system; Adversary; Alice and Bob; Secure communication; Channel (broadcasting); Computer network; Coding (social sciences); Secure coding; Secret sharing; Transmission (telecommunications); Computer security; Theoretical computer science; Cryptography; Telecommunications; Alice (programming language); Encryption; Artificial intelligence; Mathematics; Information security","score_opus":0.040268984927513296,"score_gpt":0.2779475069577659,"score_spread":0.23767852203025258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176748244","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.005555815,0.0006746965,0.9925592,0.0001740992,0.00004895758,0.00019914522,0.000004629451,0.000092524526,0.0006909504],"genre_scores_gemma":[0.95800185,0.00008750585,0.04172597,0.00006517107,0.000063586274,0.000036751815,0.0000052822743,0.0000074349728,0.0000064616315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.000004859434,0.00039753225,0.000020479192,0.00013499371,0.00007314686],"domain_scores_gemma":[0.9990592,0.00002097317,0.0002238588,0.00006299778,0.00056044076,0.000072557465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541604,0.000061435836,0.00010608538,0.00015348256,0.00005329846,0.00009526518,0.00013787496,0.00005247205,5.2912463e-7],"category_scores_gemma":[0.00007215551,0.000059309936,0.000024282876,0.00009883626,0.00001106749,0.002459276,0.000018688714,0.000107681946,0.0000013961035],"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.00013701119,0.000054624106,0.000026838647,0.0014318746,0.00007622507,2.7171097e-7,0.055298697,0.5365231,0.0016091232,0.012210345,0.007070749,0.38556114],"study_design_scores_gemma":[0.00038745967,0.000017490642,0.0000025758873,0.0000549776,0.000009880413,0.000019794186,0.00027403055,0.9868134,0.0014208555,0.0027774475,0.008155366,0.00006669762],"about_ca_topic_score_codex":1.689889e-7,"about_ca_topic_score_gemma":2.1026791e-7,"teacher_disagreement_score":0.95244604,"about_ca_system_score_codex":0.000054487824,"about_ca_system_score_gemma":0.00008198378,"threshold_uncertainty_score":0.2418589},"labels":[],"label_agreement":null},{"id":"W2188354969","doi":"10.22215/etd/2011-08829","title":"Detecting the evil twin attack in a single hop wireless network using four-square antennas","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Canadian Heritage; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless network; Square (algebra); Computer science; Wireless; Telecommunications; Mathematics; Geometry","score_opus":0.07017720567430616,"score_gpt":0.284834302938683,"score_spread":0.21465709726437684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188354969","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.9697105,0.0026451743,0.004706273,0.000017494282,0.00057164376,0.00081910164,0.0000043675363,0.0014618121,0.020063587],"genre_scores_gemma":[0.9940729,0.00038112188,0.004620696,0.00004276978,0.00017220726,0.00011279868,0.000084495565,0.00020350218,0.0003094938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806345,0.0001617493,0.0006842202,0.000314593,0.00025671092,0.0005192543],"domain_scores_gemma":[0.9983063,0.00022711445,0.00020768054,0.0010565398,0.00014479211,0.000057617814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047920828,0.00045858914,0.0005048338,0.0002319371,0.00017903578,0.00012224665,0.0009035262,0.0005215553,0.00008537944],"category_scores_gemma":[0.000053766496,0.00041438395,0.00015706586,0.00068416767,0.000036995323,0.00020846353,0.000096438744,0.0011205403,0.000017894645],"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.0006103396,0.0010631111,0.015026878,0.009155168,0.0017364982,0.00025357,0.09899103,0.109514415,0.14309378,0.0065171276,0.011931935,0.60210615],"study_design_scores_gemma":[0.0013860207,0.00022480811,0.010487962,0.0152585525,0.000370543,0.0001072049,0.016898254,0.85339296,0.080880985,0.0025470445,0.012603057,0.005842632],"about_ca_topic_score_codex":0.00066365855,"about_ca_topic_score_gemma":0.013488127,"teacher_disagreement_score":0.74387854,"about_ca_system_score_codex":0.0002345627,"about_ca_system_score_gemma":0.000047215373,"threshold_uncertainty_score":0.9998308},"labels":[],"label_agreement":null},{"id":"W2198098203","doi":"","title":"Secure Downlink Transmission in Massive MIMO System with Zero-Forcing Precoding","year":2014,"lang":"en","type":"article","venue":"European Wireless Conference","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Precoding; Telecommunications link; Zero-forcing precoding; MIMO; Base station; Path loss; Computer science; Transmission (telecommunications); Artificial noise; Computer network; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Transmitter; Engineering","score_opus":0.012187713811306823,"score_gpt":0.20007962138507995,"score_spread":0.18789190757377314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198098203","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.2937144,0.00015933425,0.6075113,0.000117168594,0.00008018913,0.00038328994,0.000006415199,0.0018888069,0.096139096],"genre_scores_gemma":[0.99426615,0.00014149032,0.0053409385,0.000023866623,0.000039857285,0.000026030913,0.000018808607,0.00009765313,0.000045195848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828905,0.0003743241,0.0004297243,0.0003251914,0.0002255364,0.0003561911],"domain_scores_gemma":[0.99892235,0.000104315324,0.00009374076,0.0006602479,0.000094519746,0.00012485604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000498237,0.00029972108,0.00033979758,0.0001827958,0.00009443018,0.00011829486,0.000678088,0.00008424667,0.000020224255],"category_scores_gemma":[0.000012445109,0.00027770913,0.000044366694,0.00026687974,0.00006402486,0.00025304419,0.00008510611,0.000541883,0.00005330051],"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.00017148671,0.00020298363,0.005564356,0.0040714587,0.00017433877,0.00029466496,0.025297316,0.05478224,0.10951409,0.22113937,0.0010009614,0.57778674],"study_design_scores_gemma":[0.001394664,0.0001553013,0.0036549894,0.006011996,0.000028985254,0.000050105056,0.0007981905,0.94799423,0.029826965,0.0001842918,0.0086749485,0.0012253269],"about_ca_topic_score_codex":0.000019874582,"about_ca_topic_score_gemma":0.00003639182,"teacher_disagreement_score":0.893212,"about_ca_system_score_codex":0.00011272145,"about_ca_system_score_gemma":0.000023242425,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W220014954","doi":"10.1109/tit.2019.2942615","title":"On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"Université de Montréal","funders":"European Commission","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); Upper and lower bounds; Dirty paper coding; Algorithm; Computer network; Theoretical computer science; Precoding; Mathematics; MIMO; Artificial intelligence","score_opus":0.02810047614797787,"score_gpt":0.2340389823542498,"score_spread":0.20593850620627194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W220014954","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.041861136,0.000060930317,0.9516952,0.00011819466,0.0009601839,0.00073288294,0.00012016706,0.0008395538,0.0036117642],"genre_scores_gemma":[0.9981577,0.0007971027,0.00044613198,0.00022115035,0.000017847222,0.0002534864,0.000035210833,0.000034273013,0.000037136044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879974,0.00015640189,0.0004944965,0.00015020948,0.00020616766,0.0001929536],"domain_scores_gemma":[0.9981071,0.0008149815,0.0001608628,0.0007649779,0.00009978234,0.00005231253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006034958,0.0003105688,0.00024263629,0.0004001987,0.00028453465,0.0003288318,0.00042405498,0.0002737519,0.00006384551],"category_scores_gemma":[0.000026913109,0.0002798652,0.00009907227,0.00011882883,0.000096508666,0.0007158622,0.00001759137,0.0012769012,0.00013689428],"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.00024099917,0.000099552635,0.0000055425508,0.0010046861,0.0002851328,5.761554e-7,0.019395849,0.8260026,0.0009065477,0.043634243,0.0014243413,0.10699994],"study_design_scores_gemma":[0.00043444283,0.000077064324,0.000057161193,0.0013430567,0.000049829767,0.000014315414,0.0016504299,0.9483756,0.027113168,0.0193162,0.0009200491,0.0006486878],"about_ca_topic_score_codex":0.000015345768,"about_ca_topic_score_gemma":0.000009970091,"teacher_disagreement_score":0.9562965,"about_ca_system_score_codex":0.00022592205,"about_ca_system_score_gemma":0.000023120216,"threshold_uncertainty_score":0.99996537},"labels":[],"label_agreement":null},{"id":"W2204421240","doi":"10.1109/milcom.2015.7357456","title":"On physical layer security for cognitive radio networks with primary user interference","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"Cognitive radio; Computer network; Computer science; Transmitter; Secrecy; Physical layer; Interference (communication); Channel (broadcasting); Computer security; Telecommunications; Wireless","score_opus":0.025918573129329426,"score_gpt":0.2645687511681297,"score_spread":0.2386501780388003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204421240","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.27556646,0.00010627593,0.6844676,0.00009542454,0.00006057461,0.00059164845,0.000014396739,0.0013347558,0.03776285],"genre_scores_gemma":[0.996176,0.000015313406,0.0032649888,0.00018461859,0.00006107507,0.00015735118,0.000032751122,0.00003475412,0.00007311819],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947006,0.000027367061,0.0001003004,0.00013219572,0.00010626996,0.00016379586],"domain_scores_gemma":[0.9992441,0.00024260847,0.000019985648,0.00028268978,0.00012696661,0.000083679195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009890256,0.0001378865,0.00017176897,0.000037492897,0.00002325757,0.000031650357,0.00020658635,0.00006207278,0.000009365958],"category_scores_gemma":[0.00002221005,0.000113632675,0.00003313031,0.00009141477,0.000047477428,0.00014073106,0.000051118594,0.00023318395,0.00001179827],"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.0028785458,0.0023463282,0.0022905497,0.0005323726,0.001029603,0.000021513035,0.024152264,0.057944015,0.0012009182,0.3133805,0.55828553,0.035937853],"study_design_scores_gemma":[0.0033803994,0.0014909956,0.0010080151,0.00054477557,0.00008380824,0.000014942312,0.0006242094,0.92973244,0.037038445,0.013517422,0.011274831,0.0012896913],"about_ca_topic_score_codex":0.000007172808,"about_ca_topic_score_gemma":0.000017069691,"teacher_disagreement_score":0.87178844,"about_ca_system_score_codex":0.00007476899,"about_ca_system_score_gemma":0.000017132139,"threshold_uncertainty_score":0.4633806},"labels":[],"label_agreement":null},{"id":"W2205029453","doi":"10.1016/j.sysconle.2015.09.013","title":"On the tightness of linear policies for stabilization of linear systems over Gaussian networks","year":2015,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear-quadratic-Gaussian control; Gaussian; Mathematics; Linear system; Logarithm; Scalar (mathematics); Control theory (sociology); Quadratic equation; Gaussian noise; Channel (broadcasting); Channel capacity; Applied mathematics; Mathematical optimization; Computer science; Optimal control; Coding (social sciences); Algorithm; Mathematical analysis; Telecommunications; Statistics","score_opus":0.022659033848535542,"score_gpt":0.24983174028016,"score_spread":0.22717270643162446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205029453","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.56061393,0.0017947584,0.4308742,0.0010590111,0.0010478569,0.003385093,0.00011922191,0.0004886158,0.0006173338],"genre_scores_gemma":[0.99923,0.000014032858,0.0000946524,0.00012729998,0.00018531027,0.00026586332,0.00001872053,0.000049488455,0.00001461302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.0002091878,0.00058195955,0.00012110464,0.00026933782,0.00020288496],"domain_scores_gemma":[0.9983204,0.0004677755,0.00024395985,0.00072018045,0.0001940671,0.000053607695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072191365,0.00017117694,0.00043578388,0.000112910915,0.000041494288,0.000026687872,0.0003795597,0.00011647481,0.000002253439],"category_scores_gemma":[0.000070908995,0.00012978629,0.0000881094,0.00017549311,0.00006592684,0.000088847926,0.00002234684,0.00014090286,0.0000021233475],"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.000063600004,0.00002946864,0.000882756,0.00051811495,0.00014988001,2.7604185e-7,0.001075773,0.9341246,0.016395096,0.040992547,0.005736382,0.00003151593],"study_design_scores_gemma":[0.00088055356,0.0000775795,0.00015667001,0.00038258385,0.00002927399,0.0000013658721,0.0003378775,0.99148154,0.0013372967,0.000024965824,0.00511898,0.00017128132],"about_ca_topic_score_codex":0.00037985973,"about_ca_topic_score_gemma":0.000013368078,"teacher_disagreement_score":0.4386161,"about_ca_system_score_codex":0.00009049497,"about_ca_system_score_gemma":0.000017071432,"threshold_uncertainty_score":0.5292532},"labels":[],"label_agreement":null},{"id":"W2207433731","doi":"10.1109/itwf.2015.7360789","title":"The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Jamming; Computer science; Channel (broadcasting); Gaussian; Computer network; Computer security; Telecommunications; Electronic engineering; Engineering; Physics","score_opus":0.021939854020623935,"score_gpt":0.21970330802822913,"score_spread":0.1977634540076052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207433731","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.9503981,0.0006121987,0.01475102,0.00048632373,0.000029481116,0.0001982789,0.0000041130306,0.00045357418,0.03306693],"genre_scores_gemma":[0.99322206,0.00007280269,0.0066012717,0.000012252274,0.000008887547,0.00001702845,6.054462e-7,0.000014369641,0.0000507161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959004,0.000019997231,0.000112698785,0.00006142451,0.00010494287,0.00011090734],"domain_scores_gemma":[0.9994906,0.0000378247,0.000022397102,0.00033417804,0.000052988227,0.000061976214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016211424,0.00007609437,0.000092783244,0.000032144042,0.00004585465,0.000024147372,0.00015653341,0.000035102188,0.0000023403381],"category_scores_gemma":[0.000015509977,0.000048192323,0.000011066883,0.0000919069,0.00011130172,0.00006704397,0.000050374045,0.00010714828,0.0000019062625],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043040127,0.0005404481,0.011788256,0.0010135922,0.0011360978,0.000028609822,0.20245174,0.0062599513,0.057563838,0.43953732,0.04336486,0.23588489],"study_design_scores_gemma":[0.004022171,0.0016793314,0.009799222,0.00076076866,0.00011216975,0.00038116772,0.036827922,0.2999088,0.4399459,0.012040504,0.19206992,0.002452133],"about_ca_topic_score_codex":0.0001423472,"about_ca_topic_score_gemma":0.00018340563,"teacher_disagreement_score":0.42749682,"about_ca_system_score_codex":0.000018953999,"about_ca_system_score_gemma":0.0000097936145,"threshold_uncertainty_score":0.1965226},"labels":[],"label_agreement":null},{"id":"W2212474043","doi":"10.1109/tit.2017.2710058","title":"The MIMO Wiretap Channel Decomposed","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"Qatar National Research Fund; Israel Science Foundation; German-Israeli Foundation for Scientific Research and Development","keywords":"MIMO; Computer science; Channel (broadcasting); Channel capacity; Gaussian; Precoding; Topology (electrical circuits); Secure transmission; Transmission (telecommunications); Dirty paper coding; Coding (social sciences); Multi-user MIMO; Telecommunications; Computer network; Mathematics; Physics; Statistics; Combinatorics","score_opus":0.015344077174099914,"score_gpt":0.2497384821419171,"score_spread":0.2343944049678172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212474043","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.0012363623,0.00027363346,0.97429025,0.00035141502,0.002208985,0.0006987189,0.000170658,0.0018681983,0.018901782],"genre_scores_gemma":[0.99578184,0.002515438,0.00064899185,0.0001400001,0.000044928405,0.0005752397,0.000055371056,0.00004637226,0.000191818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985854,0.00012974771,0.0006066734,0.00012291786,0.0002950393,0.00026020475],"domain_scores_gemma":[0.99704975,0.00034004508,0.0002607385,0.0021084303,0.00016134208,0.00007969278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079515897,0.00033720257,0.0002580712,0.000267309,0.00091485365,0.0005255483,0.0014547564,0.00039999996,0.00004794857],"category_scores_gemma":[0.00001705713,0.0002972611,0.00022909036,0.00007027588,0.0001880273,0.00076277636,0.000014971431,0.0013770693,0.00030626953],"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.00017241949,0.00009116646,4.7218538e-7,0.0005928964,0.00062190316,0.0000010500572,0.010848625,0.46323466,0.00011060258,0.016608398,0.006727179,0.5009906],"study_design_scores_gemma":[0.0013801347,0.00011481984,0.00013149157,0.0012261842,0.00025703976,0.000030158983,0.0013718172,0.5840542,0.112358,0.16243757,0.13409786,0.0025407653],"about_ca_topic_score_codex":0.00001569807,"about_ca_topic_score_gemma":0.000025940095,"teacher_disagreement_score":0.99454546,"about_ca_system_score_codex":0.00018829097,"about_ca_system_score_gemma":0.00006392116,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W2218552649","doi":"10.1109/mcom.2015.7355563","title":"Physical layer security in wireless cooperative relay networks: state of the art and beyond","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Physical layer; PHY; Wireless; Relay; Wireless network; Exploit; Telecommunications; Computer security; Power (physics)","score_opus":0.024604683587843058,"score_gpt":0.27530288895369204,"score_spread":0.25069820536584897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218552649","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.97092164,0.0019573525,0.0035046623,0.0020150708,0.00015561924,0.0006934083,0.000048054815,0.00036228032,0.020341918],"genre_scores_gemma":[0.9969045,0.0013869881,0.0013987117,0.00006922261,0.00001725671,0.00009254733,0.000019906225,0.000029630564,0.00008126233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.00029929003,0.0003385325,0.00011905403,0.00015035275,0.00016198962],"domain_scores_gemma":[0.99724513,0.00024415628,0.00008088251,0.0021720282,0.00018935832,0.000068451525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037115478,0.00015433213,0.0002589621,0.00008305858,0.000070025395,0.000027609407,0.0011045038,0.000060979757,0.000002068877],"category_scores_gemma":[0.00004590525,0.00013542965,0.000039457238,0.0005506809,0.0003790858,0.00020265974,0.0004596312,0.000577063,0.000014505995],"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.00022545572,0.005111788,0.027525188,0.00047184865,0.00069041067,0.000010275345,0.10533136,0.3645173,0.07738254,0.12679741,0.23955819,0.05237821],"study_design_scores_gemma":[0.00083855435,0.000059249272,0.0041635805,0.00015321907,0.00002563743,0.000009443012,0.0002247381,0.95544267,0.011893075,0.005074704,0.021716427,0.00039869116],"about_ca_topic_score_codex":0.000018104662,"about_ca_topic_score_gemma":0.00085716025,"teacher_disagreement_score":0.5909254,"about_ca_system_score_codex":0.00008156127,"about_ca_system_score_gemma":0.00003594231,"threshold_uncertainty_score":0.5522661},"labels":[],"label_agreement":null},{"id":"W2218632165","doi":"10.1109/milcom.2015.7357505","title":"Disguised jamming against OFDM transmission through nonlinear amplify-and-forward","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Jamming; Computer science; Orthogonal frequency-division multiplexing; Near-far problem; Electronic engineering; Transmission (telecommunications); Interference (communication); Nonlinear distortion; Synchronization (alternating current); Wireless; Communications system; Distortion (music); Noise (video); Computer network; Channel (broadcasting); Telecommunications; Engineering; Bandwidth (computing); Artificial intelligence","score_opus":0.030350954516718275,"score_gpt":0.2628586830529661,"score_spread":0.23250772853624785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218632165","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.22858182,0.0023817818,0.55886596,0.0015128329,0.00019319188,0.00065861724,0.000018699253,0.0063949395,0.20139214],"genre_scores_gemma":[0.84331393,0.0011039096,0.15510105,0.000201732,0.000046709734,0.00002360107,0.000037683843,0.0000476804,0.00012369701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927145,0.000027522121,0.00022990142,0.00013096757,0.00016089737,0.00017924044],"domain_scores_gemma":[0.9993463,0.000046742905,0.000019929656,0.00040983094,0.000048632544,0.0001285758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001638924,0.00014573931,0.00017383625,0.00004817687,0.00004654622,0.000040728926,0.00024104604,0.000115360905,0.000021346317],"category_scores_gemma":[0.000021216294,0.00013410747,0.00003660236,0.00012188324,0.000040153296,0.00023552118,0.00006164289,0.00021085572,0.000026931295],"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.00009764552,0.00036327328,0.0013031652,0.0006285412,0.00024907148,0.000025607198,0.03550641,0.0071427412,0.054882374,0.027348833,0.055567425,0.81688493],"study_design_scores_gemma":[0.000827126,0.000054558295,0.000100563615,0.00010368327,0.000016187169,0.0000061229143,0.0007916019,0.1594891,0.058027636,0.0020338425,0.7780246,0.00052497385],"about_ca_topic_score_codex":0.000034519515,"about_ca_topic_score_gemma":0.000008090257,"teacher_disagreement_score":0.81635994,"about_ca_system_score_codex":0.000047722744,"about_ca_system_score_gemma":0.000015080161,"threshold_uncertainty_score":0.5468744},"labels":[],"label_agreement":null},{"id":"W2279481688","doi":"10.1109/vtcfall.2015.7391133","title":"Secure Robust Resource Allocation in the Presence of Active Eavesdroppers Using Full-Duplex Receivers","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Jamming; Robustness (evolution); Transmitter; Computer science; Secrecy; Maximization; Transmitter power output; Physical layer; Computer network; Channel state information; Artificial noise; Secure communication; Adversary; Resource allocation; Duplex (building); Channel (broadcasting); Wireless; Computer security; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.05667941359171713,"score_gpt":0.27067066696771747,"score_spread":0.21399125337600033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279481688","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.96206087,0.00016800099,0.015308171,0.00053852715,0.00003572399,0.00040619183,0.000004794068,0.00028739462,0.021190299],"genre_scores_gemma":[0.9912347,0.000045664638,0.008620139,0.000033168668,0.000011837618,0.000013321518,0.000008350486,0.000013954776,0.000018831684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992792,0.00012155413,0.000181162,0.00009407126,0.00020460896,0.00011941097],"domain_scores_gemma":[0.99924797,0.00010545946,0.00004530819,0.00047169472,0.000097171964,0.000032391174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035352228,0.00008900871,0.00010610912,0.000098627934,0.000023306344,0.00001612716,0.00046074227,0.00007635325,0.000013361524],"category_scores_gemma":[0.000105300365,0.00007541733,0.000023673469,0.0003467665,0.00006447318,0.00020402725,0.000053615044,0.00020529098,0.0000022704623],"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.000042689902,0.000058021484,0.00025361526,0.000044300275,0.000026312959,0.0000014467444,0.029725978,0.9387667,0.016987426,0.004276662,0.0060849935,0.0037318172],"study_design_scores_gemma":[0.00034159436,0.000044345546,0.00081938,0.00008060174,0.000011520132,0.000007795438,0.025252338,0.93815756,0.027779773,0.00015623494,0.0071205157,0.00022833317],"about_ca_topic_score_codex":0.00027894802,"about_ca_topic_score_gemma":0.00020329634,"teacher_disagreement_score":0.029173832,"about_ca_system_score_codex":0.00012176634,"about_ca_system_score_gemma":0.00002577474,"threshold_uncertainty_score":0.30754295},"labels":[],"label_agreement":null},{"id":"W2279672151","doi":"10.1109/isit.2016.7541647","title":"Privacy-aware MMSE estimation","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Predictability; Binary number; Random variable; Constraint (computer-aided design); Minimum mean square error; Mathematics; Channel (broadcasting); Binary symmetric channel; Combinatorics; Computer science; Discrete mathematics; Algorithm; Statistics; Decoding methods; Channel code; Telecommunications; Arithmetic; Geometry","score_opus":0.019121971427368392,"score_gpt":0.2686938253560848,"score_spread":0.24957185392871645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279672151","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.0061407024,0.00030520474,0.93861616,0.00073384773,0.0002798239,0.00041736633,0.000035875677,0.0066283713,0.046842624],"genre_scores_gemma":[0.9539023,0.00041530043,0.04500364,0.000033328077,0.00005601857,0.00017287565,0.0000887986,0.00006301717,0.00026469067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992263,0.000027766666,0.00027405747,0.00017683001,0.00014784597,0.00014720552],"domain_scores_gemma":[0.9983072,0.000055173532,0.00005114704,0.001469606,0.00006616575,0.0000506587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011054557,0.00021083682,0.00020690006,0.00012550037,0.000026165493,0.00006053944,0.0007504843,0.0003167978,0.0002323158],"category_scores_gemma":[0.000027838441,0.00018806144,0.00007207037,0.00004747342,0.000026417953,0.00010210465,0.00079578534,0.0004051293,0.00018499939],"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.00001383601,0.00017967777,0.00052660535,0.0034955002,0.0004922949,0.000012624991,0.0032640912,0.039064772,0.0057983003,0.067439824,0.30396742,0.57574505],"study_design_scores_gemma":[0.00024551293,0.00001346431,0.00056837517,0.0011078081,0.000033073546,0.000006226521,0.000019065877,0.7601223,0.056788087,0.13419934,0.04568066,0.0012160982],"about_ca_topic_score_codex":0.000010591625,"about_ca_topic_score_gemma":0.000004596976,"teacher_disagreement_score":0.94776165,"about_ca_system_score_codex":0.00014665218,"about_ca_system_score_gemma":0.000024788167,"threshold_uncertainty_score":0.7668923},"labels":[],"label_agreement":null},{"id":"W2281178725","doi":"10.1007/s00453-015-0104-9","title":"Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Zero (linguistics); Merlin (protein); Zero-knowledge proof; Computer science; Ground zero; Physics; Philosophy; Algorithm; Biology; Linguistics","score_opus":0.01020371742461373,"score_gpt":0.24572306962393312,"score_spread":0.23551935219931938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281178725","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.43998718,0.0011128588,0.47619918,0.008520292,0.00018403429,0.033185262,0.00013495484,0.0067832456,0.033893015],"genre_scores_gemma":[0.9832817,0.00029252394,0.013410197,0.000050908,0.000007819921,0.0029130932,0.000015097755,0.000014681268,0.00001402966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993209,0.000057921912,0.00029945103,0.000074546224,0.000103194754,0.00014397808],"domain_scores_gemma":[0.9991744,0.00008703783,0.000046633693,0.00060220505,0.000048012644,0.00004172046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002738848,0.00010294416,0.00012624396,0.00012451713,0.00004125282,0.000039142546,0.0002822569,0.00009179578,0.000017001359],"category_scores_gemma":[0.000040391817,0.00008889879,0.00001769196,0.00014007065,0.0000645644,0.0006999518,0.00010039496,0.00013907059,0.000043619868],"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.000009762881,0.000041097555,0.0013403666,0.00005680202,0.000013252735,5.59242e-7,0.0008798286,0.000027247355,0.0031429646,0.012379637,0.0018375022,0.980271],"study_design_scores_gemma":[0.006741196,0.000264604,0.09068636,0.002526549,0.000025729985,0.000055151508,0.00030576452,0.12029449,0.20340168,0.11984271,0.4534917,0.0023640862],"about_ca_topic_score_codex":0.000028394266,"about_ca_topic_score_gemma":0.000035373905,"teacher_disagreement_score":0.9779069,"about_ca_system_score_codex":0.000082559374,"about_ca_system_score_gemma":0.000010516118,"threshold_uncertainty_score":0.36251876},"labels":[],"label_agreement":null},{"id":"W2283332069","doi":"","title":"On Capacity and Bounds for the Gaussian CZIC and CBZIC with Linear Coded Approximation","year":2013,"lang":"en","type":"article","venue":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Channel capacity; Computer science; Cognitive radio; Extension (predicate logic); Component (thermodynamics); Upper and lower bounds; Mathematics; Topology (electrical circuits); Applied mathematics; Mathematical optimization; Telecommunications; Algorithm; Wireless; Combinatorics; Mathematical analysis; Physics","score_opus":0.014130927871096998,"score_gpt":0.21577053104568553,"score_spread":0.20163960317458854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283332069","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.963956,0.00046384937,0.032975297,0.0009858975,0.000060432558,0.0007078179,0.000010078849,0.00044377765,0.00039685727],"genre_scores_gemma":[0.98248374,0.00036018438,0.016660476,0.00014298574,0.00007263678,0.00017476162,0.000013260408,0.000059816848,0.000032104064],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896747,0.00006782776,0.00029019377,0.00022479732,0.00017481689,0.00027487872],"domain_scores_gemma":[0.9987578,0.000498405,0.00009152499,0.00046353045,0.000100523706,0.00008823445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042121825,0.00024200937,0.00022737513,0.00013610217,0.00043153611,0.00024937163,0.00026600435,0.00011261404,0.0000050206713],"category_scores_gemma":[0.000076021446,0.0001709002,0.000041970292,0.0001631191,0.00015867433,0.0002415834,0.000045756133,0.0004298147,0.000005276663],"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.0008172841,0.00104656,0.0072943293,0.0034668127,0.002823423,0.00002694451,0.12788159,0.020177675,0.33808535,0.26522744,0.020071605,0.213081],"study_design_scores_gemma":[0.0021366698,0.00067984377,0.0059902677,0.0008168712,0.00017454693,0.00017715005,0.0015254805,0.897833,0.06332247,0.019336479,0.0067663095,0.0012409068],"about_ca_topic_score_codex":0.000042241416,"about_ca_topic_score_gemma":0.00003368269,"teacher_disagreement_score":0.8776553,"about_ca_system_score_codex":0.000049514936,"about_ca_system_score_gemma":0.000016651024,"threshold_uncertainty_score":0.69691074},"labels":[],"label_agreement":null},{"id":"W2286924897","doi":"10.1017/s1759078715001099","title":"A review of directional modulation technology","year":2015,"lang":"en","type":"review","venue":"International Journal of Microwave and Wireless Technologies","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"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":"Queen's University","keywords":"Physical layer; Computer science; Key (lock); Wireless; Cryptography; Modulation (music); Computer network; Computer security; Telecommunications; Electronic engineering; Engineering","score_opus":0.03417661417780892,"score_gpt":0.33197266799195924,"score_spread":0.2977960538141503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286924897","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044405082,0.99637717,0.0020195101,0.000288254,0.00031012777,0.00021544902,0.000043310072,0.00044962505,0.00025214005],"genre_scores_gemma":[0.0017163244,0.9940814,0.00403318,0.0000132165305,0.000052541098,0.000027355238,0.000027947028,0.000040425908,0.000007637736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980616,0.0000467632,0.0012628562,0.00014311989,0.0003552274,0.00013043848],"domain_scores_gemma":[0.9974527,0.00010383733,0.000981157,0.00035168827,0.0010824449,0.000028178936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046210559,0.00029665363,0.001377263,0.0013910633,0.000018155391,0.000024055182,0.001253075,0.0005206677,0.0000045629586],"category_scores_gemma":[0.0001880416,0.00025399248,0.0002727261,0.00046217119,0.00025569784,0.00017879096,0.000315504,0.0007417964,0.000002677872],"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.0000022522645,0.000026473544,0.0000031442821,0.010657522,0.00034467902,0.0000083550785,0.00001193771,0.0000017101136,0.00019409086,0.0007881274,0.004019863,0.98394185],"study_design_scores_gemma":[0.00010457368,0.00004107547,6.6516526e-7,0.087137595,0.00015228683,0.00076429173,0.000041956253,0.000032924254,0.0013424297,0.0024899559,0.9076849,0.00020733426],"about_ca_topic_score_codex":0.0000017776281,"about_ca_topic_score_gemma":0.00000118457,"teacher_disagreement_score":0.9837345,"about_ca_system_score_codex":0.00021869688,"about_ca_system_score_gemma":0.00013940583,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W2289922692","doi":"10.1109/glocomw.2015.7414111","title":"Verification of Key Generation from Individual OFDM Subcarrier's Channel Response","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Subcarrier; Key generation; Orthogonal frequency-division multiplexing; Physical layer; Key (lock); Computer science; Channel (broadcasting); Wireless; Computer network; Electronic engineering; Randomness; Telecommunications; Engineering; Computer security; Encryption","score_opus":0.0779485203860886,"score_gpt":0.2615325726444232,"score_spread":0.1835840522583346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289922692","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.9641998,0.00033912988,0.032727327,0.00022742452,0.00011212376,0.0001338638,0.000051279083,0.00055919494,0.0016498934],"genre_scores_gemma":[0.988218,0.00004217405,0.011387399,0.000030680392,0.00004963696,0.00003129674,0.00018655696,0.000019745079,0.00003452846],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992918,0.00010740452,0.00023707852,0.000094275456,0.00018695061,0.00008249113],"domain_scores_gemma":[0.99921376,0.000052768883,0.00004495989,0.00051125913,0.00011567229,0.00006159725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046764867,0.000083770654,0.00011318257,0.00009197387,0.000018711382,0.00002211846,0.00025653274,0.0000964147,0.000030305098],"category_scores_gemma":[0.00008512564,0.00009219899,0.000023613147,0.00013824423,0.000026560027,0.00018776878,0.0000432681,0.00008794937,0.000019097915],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038918186,0.00022032317,0.0017193917,0.00003334858,0.00024477683,0.000002366627,0.029717632,0.015271017,0.79638004,0.029404221,0.11504061,0.011577091],"study_design_scores_gemma":[0.00048085913,0.00007575531,0.010822679,0.000016057003,0.000018962259,0.000001222488,0.00050357974,0.1025957,0.8675131,0.001871195,0.015821677,0.0002792007],"about_ca_topic_score_codex":0.000107019965,"about_ca_topic_score_gemma":0.000041159696,"teacher_disagreement_score":0.099218935,"about_ca_system_score_codex":0.00005314547,"about_ca_system_score_gemma":0.00002974597,"threshold_uncertainty_score":0.37597656},"labels":[],"label_agreement":null},{"id":"W2290880884","doi":"10.1109/wcnc.2015.7127629","title":"Secrecy rate with friendly full-duplex relay","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Relay; Secrecy; Relay channel; Computer science; Fading; Channel state information; Computer network; Interference (communication); Channel (broadcasting); Power (physics); Wireless; Telecommunications; Computer security; Physics","score_opus":0.019690587254262086,"score_gpt":0.23114264808303026,"score_spread":0.21145206082876816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290880884","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.6325063,0.00033809667,0.24585724,0.00039091325,0.000084996915,0.00025138308,0.0000045536203,0.004763716,0.11580281],"genre_scores_gemma":[0.95203537,0.00003868917,0.047299635,0.00006481482,0.000021284735,0.000034151137,0.000012310127,0.000034551245,0.00045921528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947673,0.000032124844,0.00013176147,0.00009542505,0.000114640694,0.00014929217],"domain_scores_gemma":[0.9992214,0.00003207413,0.00001701524,0.0005384616,0.000082859035,0.00010820493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645071,0.00010972774,0.00011124114,0.000057326113,0.000023805389,0.000034384888,0.00025975046,0.000061169005,0.00009408023],"category_scores_gemma":[0.000015571846,0.000091490736,0.000017114278,0.00017235694,0.000030546416,0.0001794532,0.0000499861,0.00016590841,0.00014640571],"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.00024078872,0.00028938687,0.0034484724,0.0001975545,0.00038596318,0.00006720936,0.009367071,0.21653211,0.0344954,0.38029122,0.32409206,0.030592756],"study_design_scores_gemma":[0.0014447913,0.00043892767,0.0007705137,0.000091172544,0.000026978047,0.00006806988,0.0010979591,0.41393834,0.07966761,0.0013285555,0.5000258,0.0011012796],"about_ca_topic_score_codex":0.00003662261,"about_ca_topic_score_gemma":0.00009863259,"teacher_disagreement_score":0.37896267,"about_ca_system_score_codex":0.000054101485,"about_ca_system_score_gemma":0.000020815623,"threshold_uncertainty_score":0.3730884},"labels":[],"label_agreement":null},{"id":"W2290883389","doi":"10.1109/glocom.2015.7417241","title":"Secure MIMO AF Relaying Design: An Intercept Probability Constrained Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Eavesdropping; MIMO; Artificial noise; Robustness (evolution); Computer science; Channel state information; Secure transmission; Transmission (telecommunications); Interference alignment; Channel (broadcasting); Signal-to-noise ratio (imaging); Precoding; Computer network; Wireless; Mathematical optimization; Transmitter; Mathematics; Telecommunications","score_opus":0.17274338810332737,"score_gpt":0.335392778933646,"score_spread":0.16264939083031862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290883389","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.041640818,0.002386924,0.80433583,0.0021176685,0.00050072384,0.0027491227,0.00037512602,0.0059482576,0.13994552],"genre_scores_gemma":[0.77681875,0.00034867093,0.22205974,0.000099173005,0.000032426193,0.00032562658,0.00024787974,0.000043783257,0.00002393547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643964,0.0011072517,0.0008944921,0.0005075404,0.0004551246,0.0005959733],"domain_scores_gemma":[0.9920769,0.00017575432,0.00020657036,0.0060624727,0.00092756725,0.0005507815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014933968,0.00052808045,0.0005846798,0.00013247256,0.00030622043,0.00032809982,0.0047415392,0.00041669465,0.00006070652],"category_scores_gemma":[0.00022284464,0.0005875666,0.00013104186,0.0007316754,0.00080423534,0.0009883626,0.0007370969,0.0009457467,0.00014096372],"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.00039466174,0.006061824,0.009045357,0.0007335648,0.0010712498,0.00001585098,0.029410878,0.03795535,0.004892102,0.57149804,0.20858641,0.13033469],"study_design_scores_gemma":[0.0019481496,0.0003406726,0.0008539076,0.0002870148,0.00014538686,0.00016563643,0.0059059616,0.8951044,0.0010564217,0.054366447,0.03760982,0.0022161943],"about_ca_topic_score_codex":0.00029590336,"about_ca_topic_score_gemma":0.00048749815,"teacher_disagreement_score":0.85714906,"about_ca_system_score_codex":0.00081984745,"about_ca_system_score_gemma":0.00046239712,"threshold_uncertainty_score":0.9996576},"labels":[],"label_agreement":null},{"id":"W2293476944","doi":"10.1049/el.2015.2160","title":"Performance analysis of physical layer security over <i>α</i> – <i>μ</i> fading channel","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"Fading; Physical layer; Channel (broadcasting); Computer science; Electronic engineering; Computer network; Telecommunications; Engineering; Wireless","score_opus":0.012895161136774016,"score_gpt":0.23778925981728416,"score_spread":0.22489409868051013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293476944","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.9950946,0.00039905703,0.0021712624,0.00022187724,0.000035251032,0.00009033604,0.000007968042,0.00037680686,0.0016028306],"genre_scores_gemma":[0.9992364,0.00015777732,0.00016347672,0.00031834864,0.000042167572,0.00001958421,0.000028281003,0.00003029991,0.000003640433],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990333,0.000036930604,0.00020344598,0.00014457191,0.00026000605,0.00032175196],"domain_scores_gemma":[0.99925846,0.000046225905,0.000058394755,0.00051463756,0.000050149494,0.00007214446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021387756,0.00015676874,0.00031539833,0.0002506178,0.0000292346,0.000016584647,0.00036482784,0.0000563558,0.000004723014],"category_scores_gemma":[0.0000093584495,0.0001733477,0.00014061427,0.00088311627,0.00004325616,0.0002062725,0.000061258936,0.00032412878,0.0000058557366],"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.00005920987,0.00031192153,0.006788076,0.0002091129,0.0031721534,0.000005253272,0.017039701,0.45638278,0.47733745,0.006014659,0.030066183,0.002613518],"study_design_scores_gemma":[0.00024120229,0.00005518213,0.0003991711,0.00001605716,0.00024583735,0.0000012531609,0.000026785128,0.8451814,0.14554657,0.00018007893,0.007803851,0.00030262992],"about_ca_topic_score_codex":0.000012454653,"about_ca_topic_score_gemma":0.000021629354,"teacher_disagreement_score":0.3887986,"about_ca_system_score_codex":0.00019041564,"about_ca_system_score_gemma":0.00002067248,"threshold_uncertainty_score":0.7068914},"labels":[],"label_agreement":null},{"id":"W2295129189","doi":"10.1109/isit.2016.7541813","title":"Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Qatar National Research Fund; Qatar Foundation","keywords":"Channel state information; Converse; Computer science; Channel (broadcasting); Relay; Gaussian; Fading; Noise (video); Randomness; Topology (electrical circuits); Telecommunications; Computer network; Wireless; Mathematics; Physics; Artificial intelligence; Statistics; Power (physics)","score_opus":0.018074068866637517,"score_gpt":0.2354848618994076,"score_spread":0.21741079303277008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295129189","genre_codex":"other","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.32131162,0.016041024,0.22344634,0.0057725967,0.0043749735,0.0057377038,0.0021668025,0.0067503504,0.4143986],"genre_scores_gemma":[0.9945385,0.00074944925,0.004334418,0.0000073401716,0.000055212517,0.000071810755,0.000011607343,0.000057997877,0.00017367511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987711,0.00007519612,0.0005248398,0.0001819003,0.000271483,0.00017551253],"domain_scores_gemma":[0.99726975,0.00009805514,0.00023258834,0.0022295325,0.00012646941,0.00004359003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019208512,0.00026846654,0.00046476422,0.0001264758,0.000024975716,0.000012492734,0.0017528565,0.00042044418,0.00009945042],"category_scores_gemma":[0.000038001104,0.00017297154,0.00025365155,0.000118967866,0.00020300577,0.000055086723,0.0013411891,0.00052934635,0.000004554436],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083616476,0.0010031372,0.011646734,0.018136656,0.0039100656,0.0000072221565,0.036731273,0.15762334,0.11179414,0.50340307,0.13183534,0.023825394],"study_design_scores_gemma":[0.0011966161,0.00010732908,0.051736858,0.009894731,0.0003256323,0.000012233622,0.00061386876,0.21470952,0.6385172,0.07103569,0.008953075,0.002897266],"about_ca_topic_score_codex":0.00017752357,"about_ca_topic_score_gemma":0.00021800058,"teacher_disagreement_score":0.6732269,"about_ca_system_score_codex":0.00005173476,"about_ca_system_score_gemma":0.000042587708,"threshold_uncertainty_score":0.7053575},"labels":[],"label_agreement":null},{"id":"W2295830844","doi":"10.1109/spawc.2016.7536826","title":"Physical layer security for massive MIMO systems impaired by phase noise","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Artificial noise; Precoding; Telecommunications link; Computer science; MIMO; Phase noise; Physical layer; Base station; Transmission (telecommunications); Noise (video); Secrecy; Ergodic theory; Computer network; Beamforming; Electronic engineering; Topology (electrical circuits); Telecommunications; Wireless; Mathematics; Electrical engineering; Engineering; Computer security","score_opus":0.02176428847741266,"score_gpt":0.30092248377963915,"score_spread":0.27915819530222646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295830844","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.2556575,0.004655739,0.6867176,0.0016137488,0.0018920779,0.007894444,0.0073147463,0.012955739,0.021298373],"genre_scores_gemma":[0.99528944,0.0002302747,0.0012547482,0.000030008618,0.00032499788,0.0020876979,0.0003756419,0.00013982717,0.00026735736],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836653,0.00008526022,0.0004706757,0.00043632337,0.00024600618,0.0003951752],"domain_scores_gemma":[0.99761456,0.00026078243,0.0001464655,0.0016067013,0.00020879532,0.0001627212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020454208,0.00048592937,0.00068770227,0.00011406246,0.000062180596,0.00013234704,0.00095744093,0.00049355545,0.000030748262],"category_scores_gemma":[0.00003917374,0.00042361656,0.00030491827,0.000066857865,0.0000674619,0.00013623918,0.00053614815,0.00056916213,0.000039290604],"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.000073084266,0.00084238633,0.000014411498,0.0027055126,0.0005971118,0.0000042703946,0.0018860702,0.00082071626,0.082387276,0.020281563,0.8874093,0.0029782986],"study_design_scores_gemma":[0.0024778577,0.00014420066,0.0000035913781,0.00090312184,0.0001416013,0.000004262003,0.00015222433,0.6234101,0.23371741,0.022097666,0.11508542,0.0018625469],"about_ca_topic_score_codex":0.000060640694,"about_ca_topic_score_gemma":0.000005346593,"teacher_disagreement_score":0.7723239,"about_ca_system_score_codex":0.0002731719,"about_ca_system_score_gemma":0.00004643797,"threshold_uncertainty_score":0.99982154},"labels":[],"label_agreement":null},{"id":"W2296652344","doi":"10.1109/hicss.2016.713","title":"Securing D2D Wireless Links by Continuous Authenticity with Legitimacy Patterns","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"","keywords":"Legitimacy; Wireless; Computer science; Computer security; Measure (data warehouse); Wireless Transport Layer Security; Telecommunications; Wireless network; Wi-Fi array; Data mining; Politics","score_opus":0.0057780449562798795,"score_gpt":0.2008321637427621,"score_spread":0.19505411878648224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296652344","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.72684973,0.00007065484,0.2630553,0.00037796673,0.0000410742,0.00021027199,0.000035004767,0.0021636118,0.007196352],"genre_scores_gemma":[0.99775225,0.0001752189,0.0012991547,0.00008473277,0.00003131759,0.00007224539,0.000009433083,0.00006619186,0.0005094377],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990375,0.00003207524,0.00024194161,0.00019354656,0.00018814758,0.00030676296],"domain_scores_gemma":[0.9990389,0.00009787557,0.000043015098,0.0006578956,0.00006561321,0.000096748656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010737183,0.00020491632,0.00022320294,0.0000672503,0.000055415272,0.000060653198,0.00043144904,0.0001522043,0.00023984807],"category_scores_gemma":[0.0000056335193,0.00014199059,0.000043132422,0.000089296576,0.00006490225,0.00027755348,0.00009451171,0.0002707948,0.000052270643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009859531,0.000690726,0.10590873,0.00066897826,0.00072646304,0.000069477624,0.008132407,0.00006829373,0.345932,0.026872503,0.052213132,0.4586187],"study_design_scores_gemma":[0.0019100908,0.00016053766,0.002964684,0.00088406453,0.000044975073,0.00004346089,0.00037575173,0.010592448,0.93754435,0.00078095,0.04319946,0.0014992016],"about_ca_topic_score_codex":0.000090772126,"about_ca_topic_score_gemma":0.0000745023,"teacher_disagreement_score":0.5916124,"about_ca_system_score_codex":0.000074932555,"about_ca_system_score_gemma":0.000009396042,"threshold_uncertainty_score":0.57902086},"labels":[],"label_agreement":null},{"id":"W2301554092","doi":"10.1109/isit.2014.6875210","title":"A source-channel separation theorem with application to the source broadcast problem","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Converse; Source separation; Mutual fund separation theorem; Separation (statistics); Channel (broadcasting); Computer science; Simple (philosophy); Separation principle; Mathematics; Algorithm; Telecommunications; Physics; Geometry","score_opus":0.005790375793536853,"score_gpt":0.22251763467558958,"score_spread":0.21672725888205271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301554092","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.010975346,0.000028693343,0.9632675,0.001124492,0.000008775497,0.0006008356,8.21798e-7,0.0013935022,0.022600032],"genre_scores_gemma":[0.98767877,0.000011180247,0.011011668,0.0003285596,0.000057974677,0.00044670442,0.000012754788,0.00004226025,0.00041011057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.000052916916,0.00016041749,0.0001427493,0.00015399091,0.00015659633],"domain_scores_gemma":[0.9990456,0.000067847956,0.00003273776,0.0007357652,0.00006456802,0.000053461714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030868352,0.0001288102,0.00010143999,0.000058890335,0.000110930436,0.000068598354,0.00038322684,0.000055784207,0.000013923605],"category_scores_gemma":[0.000009339997,0.000087130706,0.000022941465,0.00023877437,0.000030226394,0.00009482051,0.00006192725,0.00014069062,0.00013998675],"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.000037605725,0.00007724586,0.00019565682,0.0000784721,0.000060176062,6.317675e-8,0.011948037,0.5534759,0.009513034,0.09679856,0.01717366,0.31064156],"study_design_scores_gemma":[0.00012384095,0.000060912516,0.00011926347,0.000024624505,0.000009085995,0.000006912114,0.00023557116,0.54582375,0.0121420175,0.0015575843,0.4396687,0.00022775143],"about_ca_topic_score_codex":0.000049330105,"about_ca_topic_score_gemma":0.000141151,"teacher_disagreement_score":0.97670346,"about_ca_system_score_codex":0.000036388272,"about_ca_system_score_gemma":0.0000051788566,"threshold_uncertainty_score":0.3553087},"labels":[],"label_agreement":null},{"id":"W2314565273","doi":"10.1109/twc.2016.2535442","title":"Physical Layer Authentication Enhancement Using Two-Dimensional Channel Quantization","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; False alarm; Quantization (signal processing); Physical layer; Algorithm; MIMO; Multipath propagation; Channel (broadcasting); Wireless; Test statistic; Spoofing attack; Statistical hypothesis testing; Mathematics; Statistics; Artificial intelligence; Computer network; Telecommunications","score_opus":0.04496404008474349,"score_gpt":0.3044346510291962,"score_spread":0.25947061094445273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314565273","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.25518805,0.00007870824,0.7419382,0.0008979479,0.00019803239,0.0003964022,0.000056856323,0.00091070594,0.00033513477],"genre_scores_gemma":[0.99058086,0.0004534876,0.008315641,0.00006953068,0.000036699785,0.00034125138,0.000025012932,0.00008568063,0.00009183143],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836534,0.0002042295,0.00047797742,0.00028295486,0.0003499133,0.00031957135],"domain_scores_gemma":[0.9966647,0.0003833998,0.00011145324,0.0025032503,0.0002178693,0.00011931527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020574602,0.00029581925,0.0002813293,0.00031712424,0.0005003018,0.000050128892,0.0009844664,0.00011833803,0.000072047194],"category_scores_gemma":[0.00000603722,0.00027079644,0.00014862262,0.0004967765,0.00024786752,0.00045214358,0.000018081178,0.00034059442,0.00017552484],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036601992,0.00097034866,0.000012233837,0.000037009202,0.000178957,5.426056e-7,0.0011823137,0.05872681,0.8823819,0.008703183,0.000186657,0.047583427],"study_design_scores_gemma":[0.00051905005,0.000046292855,0.000028458318,0.00020276064,0.000057749843,0.0000057846514,0.00003350828,0.5190367,0.4783182,0.0010443504,0.00033920954,0.0003678826],"about_ca_topic_score_codex":0.000040344337,"about_ca_topic_score_gemma":0.00008427265,"teacher_disagreement_score":0.7353928,"about_ca_system_score_codex":0.00034596096,"about_ca_system_score_gemma":0.000048415954,"threshold_uncertainty_score":0.9999744},"labels":[],"label_agreement":null},{"id":"W2322120353","doi":"10.1109/milcom.2014.254","title":"Digital RF Memory Jamming on OFDM SISO","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Radar jamming and deception; Jamming; Electronic engineering; Computer science; Interference (communication); Multipath propagation; Repeater (horology); Digital radio frequency memory; Orthogonal frequency-division multiplexing; Engineering; Telecommunications; Radar; Channel (broadcasting); Pulse-Doppler radar","score_opus":0.007977965861968046,"score_gpt":0.20852232867465167,"score_spread":0.20054436281268362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322120353","genre_codex":"other","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.14395122,0.00003252589,0.025093615,0.00031551236,0.00006897208,0.00009003954,0.0000020628581,0.00270344,0.82774264],"genre_scores_gemma":[0.9969569,0.000012713541,0.0021339478,0.00012512773,0.000033717137,0.000011479923,0.0000060366024,0.000024808653,0.0006952592],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995878,0.000008850322,0.00011845595,0.000076878314,0.00009558022,0.00011245884],"domain_scores_gemma":[0.99936396,0.000093863004,0.00001134535,0.00047598523,0.000016525071,0.000038338905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000778663,0.000084340434,0.00008884696,0.000060315884,0.000027887585,0.00005426854,0.00023411277,0.00004963899,0.000064147695],"category_scores_gemma":[0.0000362086,0.00008345842,0.000032440323,0.0000650818,0.000017614637,0.00015088065,0.00004933824,0.000121206096,0.00017933408],"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.000006930585,0.00010560417,0.0007233548,0.000093247436,0.000052231637,0.0000017586235,0.0007480829,0.0035666376,0.009729709,0.07776125,0.036292598,0.8709186],"study_design_scores_gemma":[0.00046256263,0.00015660598,0.0016634887,0.00010812776,0.000009563573,0.000007108017,0.0002833858,0.111209296,0.21556139,0.0024937002,0.6671556,0.0008891307],"about_ca_topic_score_codex":0.0000026654266,"about_ca_topic_score_gemma":0.000004947358,"teacher_disagreement_score":0.87002945,"about_ca_system_score_codex":0.000027808228,"about_ca_system_score_gemma":0.0000020832217,"threshold_uncertainty_score":0.34033355},"labels":[],"label_agreement":null},{"id":"W2330170324","doi":"","title":"Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Entropy rate; Joint entropy; Mathematics; Rényi entropy; Maximum entropy thermodynamics; Maximum entropy probability distribution; Min entropy; Shannon's source coding theorem; Entropy (arrow of time); Joint quantum entropy; Information theory; Conditional entropy; Transfer entropy; Statistical physics; Markov process; Entropy power inequality; Applied mathematics; Principle of maximum entropy; Statistics; Physics","score_opus":0.026424623947863952,"score_gpt":0.25578940310151305,"score_spread":0.22936477915364908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330170324","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.004700161,0.0017969342,0.9871506,0.0018832703,0.000011646131,0.0017287518,0.000030405552,0.000988303,0.001709903],"genre_scores_gemma":[0.9409334,0.00035182456,0.055687066,0.00025643723,0.000046729972,0.0024932383,0.000034027038,0.000028690993,0.00016860287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993878,0.000050729624,0.00024280713,0.00011414389,0.000057313886,0.00014723129],"domain_scores_gemma":[0.99887085,0.00025623135,0.0000332089,0.0006722824,0.000089183326,0.00007823827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002948352,0.00010789809,0.00015163248,0.00007958728,0.00011679433,0.000088561974,0.0003293702,0.000063102394,0.000010389738],"category_scores_gemma":[0.000017265993,0.00011108104,0.000025051993,0.000108850094,0.000028302074,0.0001192174,0.00004186576,0.00008523557,0.000019561805],"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.000031672625,0.00010630769,0.0002926238,0.00027716026,0.00013171652,7.373753e-8,0.001602691,0.6070256,0.023221355,0.3229447,0.020135123,0.02423091],"study_design_scores_gemma":[0.00040580492,0.000016301785,0.000065507294,0.000027861617,0.000014912235,0.0000017182716,0.00022033123,0.5501309,0.0027023081,0.00029250974,0.445939,0.00018283275],"about_ca_topic_score_codex":0.000048074675,"about_ca_topic_score_gemma":0.00007398436,"teacher_disagreement_score":0.9362332,"about_ca_system_score_codex":0.00007605994,"about_ca_system_score_gemma":0.0000066237503,"threshold_uncertainty_score":0.45297533},"labels":[],"label_agreement":null},{"id":"W2331758476","doi":"10.1109/tit.2016.2549541","title":"Signaling Over Two-User Parallel Gaussian Interference Channels: Outage Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Topology (electrical circuits); Fading; Decoding methods; Gaussian; Gaussian noise; Random variable; Signal-to-interference-plus-noise ratio; Noise (video); Statistics; Mathematics; Computer science; Physics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.011325656484158807,"score_gpt":0.24767207146870363,"score_spread":0.2363464149845448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331758476","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.012500283,0.000015494004,0.98251843,0.00009529811,0.0002146471,0.00016773082,0.00005660296,0.0010032085,0.0034283225],"genre_scores_gemma":[0.9975665,0.00010999582,0.001790059,0.00015913347,0.000016320031,0.00012592568,0.000010086501,0.00001914788,0.00020278532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998961,0.00009012973,0.00046016768,0.00009893797,0.00018566406,0.00020410422],"domain_scores_gemma":[0.99898374,0.00020892757,0.00008490169,0.0005735675,0.00007086946,0.00007798662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036525924,0.00018835305,0.00019849108,0.00068606116,0.0001210627,0.00008671662,0.0003469885,0.000102387174,0.000911008],"category_scores_gemma":[0.000007178318,0.00015273898,0.00016834844,0.0004848646,0.00006264578,0.0015573715,0.00000270502,0.00022205838,0.0003050331],"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.00024074555,0.00015064878,0.000049557046,0.00012678113,0.0017760247,0.0000014995278,0.012320283,0.69281733,0.008346981,0.058057435,0.00071290834,0.22539982],"study_design_scores_gemma":[0.004697302,0.0003045491,0.00048329492,0.0008801699,0.0011517457,0.000017960832,0.0029247971,0.3226531,0.61134225,0.026189268,0.026220098,0.0031354544],"about_ca_topic_score_codex":0.0000092114005,"about_ca_topic_score_gemma":0.0000138239675,"teacher_disagreement_score":0.98506624,"about_ca_system_score_codex":0.00012548229,"about_ca_system_score_gemma":0.000012180804,"threshold_uncertainty_score":0.99748987},"labels":[],"label_agreement":null},{"id":"W2333118136","doi":"10.1109/lcomm.2016.2549011","title":"Secure Communications in Underlay Cognitive Radio Networks: User Scheduling and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eavesdropping; Computer science; Computer network; Underlay; Scheduling (production processes); Cognitive radio; Telecommunications link; Secrecy; Transmitter; Cognitive network; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Computer security; Engineering","score_opus":0.025383898286585622,"score_gpt":0.2679925894506053,"score_spread":0.24260869116401965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333118136","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.8103974,0.0042103776,0.1731574,0.009884901,0.000055796758,0.00046080118,0.000031342483,0.00079816865,0.0010038348],"genre_scores_gemma":[0.9601776,0.019838052,0.019216958,0.00043186356,0.00001785061,0.00020511085,0.000052416915,0.00004589838,0.000014262547],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985289,0.00031935994,0.0004942102,0.0002169275,0.00013602871,0.00030457313],"domain_scores_gemma":[0.99483323,0.0010568745,0.00010304072,0.0038304105,0.000092561786,0.000083873936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444837,0.00023058568,0.00032593266,0.00057918264,0.0002786623,0.00007348106,0.0020096647,0.00013095049,0.000013820236],"category_scores_gemma":[0.000042945856,0.00022194652,0.000089952926,0.0012712871,0.0005662908,0.00051745155,0.00046368223,0.0005373146,0.000015164738],"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.00011265027,0.001074249,0.6570496,0.00030525163,0.005694201,0.000008916177,0.018692924,0.093308724,0.0531643,0.022223786,0.0056878333,0.14267758],"study_design_scores_gemma":[0.0017022132,0.000043945893,0.14921278,0.0010216598,0.0006085168,0.00001774567,0.0008164557,0.8345976,0.0020856753,0.0002063697,0.008247887,0.0014391732],"about_ca_topic_score_codex":0.000045167675,"about_ca_topic_score_gemma":0.0006899502,"teacher_disagreement_score":0.74128884,"about_ca_system_score_codex":0.00018766003,"about_ca_system_score_gemma":0.000016293221,"threshold_uncertainty_score":0.9050717},"labels":[],"label_agreement":null},{"id":"W2334908797","doi":"10.1109/mwscas.2014.6908538","title":"Joint noise distribution parameter estimation and LDPC decoding using variational Bayes","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Concordia University","funders":"","keywords":"Factor graph; Estimation theory; Algorithm; Estimator; Decoding methods; Posterior probability; Joint probability distribution; Bayes' theorem; Low-density parity-check code; Computer science; Mathematics; Applied mathematics; Bayesian probability; Mathematical optimization; Statistics","score_opus":0.02119542647598378,"score_gpt":0.24486573431577863,"score_spread":0.22367030783979486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334908797","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.18691735,0.000026019079,0.81204385,0.0000708619,0.000029162633,0.00006667756,0.000005261681,0.0003849263,0.0004558944],"genre_scores_gemma":[0.78242767,0.000016749535,0.21743976,0.000021864265,0.000016038037,0.000008660495,0.00005720822,0.000009361322,0.0000026670007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995317,0.000031426247,0.00017267882,0.00008540027,0.00008657626,0.00009225815],"domain_scores_gemma":[0.99960214,0.00011572954,0.000028677292,0.00018228263,0.000036789374,0.0000343634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020716025,0.0000792763,0.000089468995,0.00004536631,0.000068836605,0.000063174324,0.000060428098,0.000056573732,0.000030222085],"category_scores_gemma":[0.000117012256,0.000083028244,0.000018445018,0.000068241825,0.000019357414,0.0002327778,0.00003887736,0.00007841295,0.000005424559],"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.000011726852,0.00010278303,0.0055200956,0.00031126145,0.000107124746,7.0640067e-7,0.0010889809,0.18683152,0.07906738,0.53984153,0.0020787772,0.18503813],"study_design_scores_gemma":[0.00007190541,0.000005369241,0.0044398694,0.000022035289,0.0000067416436,0.00000397243,0.0000050945623,0.9784697,0.009557619,0.006986823,0.00033101437,0.00009979887],"about_ca_topic_score_codex":0.000018675411,"about_ca_topic_score_gemma":0.000005116107,"teacher_disagreement_score":0.79163826,"about_ca_system_score_codex":0.000050726223,"about_ca_system_score_gemma":0.000004298876,"threshold_uncertainty_score":0.33857936},"labels":[],"label_agreement":null},{"id":"W2339624507","doi":"10.1109/allerton.2015.7447126","title":"Erasure adversarial wiretap channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Code word; Secrecy; Computer science; Erasure; Upper and lower bounds; Adversary; Code (set theory); Channel (broadcasting); Decoding methods; Erasure code; Binary erasure channel; Constant (computer programming); Fraction (chemistry); Theoretical computer science; Algorithm; Computer network; Mathematics; Channel capacity; Computer security","score_opus":0.036393482404075625,"score_gpt":0.23881433206898198,"score_spread":0.20242084966490637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339624507","genre_codex":"other","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.19645803,0.0008831318,0.21419321,0.001502595,0.0009558052,0.0006230836,0.000007652532,0.012400636,0.5729759],"genre_scores_gemma":[0.9914306,0.000016786656,0.008215668,0.000048420712,0.00006249373,0.000017483626,0.000005344078,0.000019031286,0.00018417128],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963707,0.0000127897565,0.000078121746,0.000056628396,0.00011606962,0.00009933322],"domain_scores_gemma":[0.99954665,0.000013593922,0.000007576331,0.000309929,0.000052351475,0.00006987535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009487171,0.00007042184,0.000078399986,0.000037972193,0.000013410007,0.00002172389,0.00018371796,0.000051561507,0.00004972979],"category_scores_gemma":[0.000008930533,0.00006139652,0.000014763902,0.00009377277,0.00001851609,0.00012817416,0.000029657083,0.00009730979,0.00007247725],"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.00015758617,0.00026564245,0.0031545463,0.0001710221,0.00046257334,0.000046857862,0.02111686,0.07449104,0.010630171,0.1253841,0.7096983,0.054421265],"study_design_scores_gemma":[0.0024622912,0.00025593536,0.0005133088,0.000080810445,0.000034273395,0.00004659133,0.00083453755,0.18941957,0.14278379,0.0065314556,0.6557678,0.001269612],"about_ca_topic_score_codex":0.000022172064,"about_ca_topic_score_gemma":0.00001985072,"teacher_disagreement_score":0.7949726,"about_ca_system_score_codex":0.00003576121,"about_ca_system_score_gemma":0.000012464684,"threshold_uncertainty_score":0.25036773},"labels":[],"label_agreement":null},{"id":"W2340160310","doi":"10.1109/tvt.2016.2555946","title":"Secure Communication in OFDMA-Based Cognitive Radio Networks: An Incentivized Secondary Network Coexistence Approach","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"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":"","keywords":"Eavesdropping; Computer network; Cognitive radio; Base station; Computer science; Orthogonal frequency-division multiple access; Transmission (telecommunications); Frame (networking); Secrecy; Relay; Orthogonal frequency-division multiplexing; Wireless; Telecommunications; Computer security","score_opus":0.011540236763460924,"score_gpt":0.23068899195555487,"score_spread":0.21914875519209395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340160310","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.116800986,0.0012713672,0.87804353,0.0005147568,0.000098833174,0.00063915964,0.000037311198,0.002271295,0.00032273948],"genre_scores_gemma":[0.9865422,0.001514154,0.010782998,0.00010415913,0.000016688351,0.0009241081,0.000030040843,0.00007456175,0.000011079796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982771,0.0002903855,0.00045157687,0.00037316722,0.00016713496,0.00044058677],"domain_scores_gemma":[0.9982496,0.00023659765,0.000094183364,0.0012260226,0.000120943485,0.0000726469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036494157,0.00030405034,0.0003929509,0.0005262159,0.00018317037,0.000028081517,0.00081700756,0.0006351428,0.00006474499],"category_scores_gemma":[0.000007434393,0.0002888962,0.000097969016,0.0010993715,0.00040575475,0.00031144635,0.000008212405,0.0010713427,0.0000123425425],"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.00033281982,0.001816376,0.0008903551,0.00018149006,0.0004020714,0.000030908508,0.0007135016,0.58587533,0.013427342,0.0036373206,0.0005355129,0.39215696],"study_design_scores_gemma":[0.0045747175,0.00029918033,0.00062247884,0.0015121632,0.0001145144,0.0000422936,0.0005362769,0.8896837,0.09681917,0.0024016935,0.0021097884,0.0012839764],"about_ca_topic_score_codex":0.000019646637,"about_ca_topic_score_gemma":0.00018958849,"teacher_disagreement_score":0.8697412,"about_ca_system_score_codex":0.00022114287,"about_ca_system_score_gemma":0.000044435517,"threshold_uncertainty_score":0.9999563},"labels":[],"label_agreement":null},{"id":"W2340757385","doi":"10.1109/allerton.2015.7447177","title":"Achievable sum-rate of the two-user Gaussian interference channel through rate-splitting and successive decoding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Decoding methods; Sequential decoding; List decoding; Interference (communication); Computer science; Algorithm; Gaussian; Channel (broadcasting); Joint (building); Coding (social sciences); Mathematics; Telecommunications; Statistics; Concatenated error correction code; Block code; Physics; Engineering","score_opus":0.036514843355300454,"score_gpt":0.27820002952652834,"score_spread":0.2416851861712279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340757385","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.8322953,0.0009179994,0.100732625,0.0010967483,0.00024892503,0.00047497152,0.000008999724,0.0008463146,0.06337811],"genre_scores_gemma":[0.99552405,0.0001248575,0.0040184804,0.000098378485,0.000019699626,0.00002248708,0.0000020987902,0.000024504317,0.00016543503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992404,0.00010441835,0.0002642621,0.0001325377,0.00007475809,0.00018363811],"domain_scores_gemma":[0.99909675,0.00016323916,0.00007976852,0.000514847,0.00009295135,0.00005243904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044263754,0.00013783977,0.0001819957,0.00004109176,0.000069313704,0.00005851533,0.00047736103,0.000061027757,0.00001525305],"category_scores_gemma":[0.0001220739,0.000102846956,0.000030407848,0.00019492747,0.00008394933,0.00038061617,0.00032899773,0.00022023013,0.0000045317747],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018340778,0.00031586268,0.028336737,0.0013347692,0.00055927853,0.000012258256,0.08315636,0.027518556,0.19053653,0.6393609,0.016784495,0.011900833],"study_design_scores_gemma":[0.0010557027,0.00006821145,0.001568032,0.00070742937,0.00003575721,0.000009573165,0.004459722,0.18701519,0.783527,0.017482165,0.0034126379,0.0006585879],"about_ca_topic_score_codex":0.0002617346,"about_ca_topic_score_gemma":0.00018639922,"teacher_disagreement_score":0.62187874,"about_ca_system_score_codex":0.00004208145,"about_ca_system_score_gemma":0.000019697689,"threshold_uncertainty_score":0.4193977},"labels":[],"label_agreement":null},{"id":"W2340757643","doi":"10.1109/allerton.2015.7447185","title":"Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Orthogonal frequency-division multiplexing; Cyclic prefix; Computer science; Transmitter; Multiplexing; Channel (broadcasting); Interference (communication); Electronic engineering; Telecommunications; Engineering","score_opus":0.0554611107089544,"score_gpt":0.28142320152383926,"score_spread":0.22596209081488486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340757643","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.61327386,0.0022558954,0.34647393,0.006533337,0.00016467288,0.001989252,0.000022899276,0.0023487553,0.026937414],"genre_scores_gemma":[0.9732657,0.00018676605,0.026000991,0.00016295056,0.0000076199835,0.00026217377,0.000030090196,0.000036919482,0.000046769732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989149,0.00016929234,0.0003710774,0.00017207775,0.00012393908,0.0002487038],"domain_scores_gemma":[0.99878114,0.000120597266,0.000031721585,0.0009035955,0.000074430514,0.00008851688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032168388,0.00019811046,0.00024421324,0.00027213708,0.000028600769,0.000055522436,0.0008155468,0.00009855205,0.000034050052],"category_scores_gemma":[0.000018422543,0.00018031808,0.000019768462,0.00051551586,0.000119609045,0.00036813787,0.00010843033,0.0004587499,0.000012593234],"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.00029994734,0.00069783896,0.010170589,0.00015200934,0.0001297231,0.00004946567,0.07738234,0.84920233,0.012581212,0.034250442,0.0023333163,0.012750772],"study_design_scores_gemma":[0.0016612704,0.00013361513,0.0009955093,0.0005036745,0.000004315954,0.000010357918,0.0029614235,0.9838322,0.0062817056,0.00013880634,0.0029054065,0.00057173654],"about_ca_topic_score_codex":0.00051911175,"about_ca_topic_score_gemma":0.007388808,"teacher_disagreement_score":0.35999188,"about_ca_system_score_codex":0.00025480412,"about_ca_system_score_gemma":0.000034345856,"threshold_uncertainty_score":0.7353158},"labels":[],"label_agreement":null},{"id":"W2343701890","doi":"10.1049/iet-com.2015.0876","title":"Optimal power allocation to improve secrecy performance of non‐regenerative cooperative systems using an untrusted relay","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Secrecy; Relay; Computer science; Computer network; Power (physics); Computer security","score_opus":0.026751281704157078,"score_gpt":0.2849738364231965,"score_spread":0.25822255471903943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343701890","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.8713086,0.0003530001,0.12517552,0.000348909,0.000119295975,0.0007703778,0.00009982562,0.00038935474,0.0014350954],"genre_scores_gemma":[0.94714016,0.00041531288,0.051961217,0.000027276645,0.000020941996,0.00026174638,0.00005044083,0.000052146548,0.00007075342],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986478,0.00023339655,0.0005344227,0.00019213685,0.00017530214,0.00021692367],"domain_scores_gemma":[0.99598235,0.00018521176,0.0001334602,0.0029738082,0.0006089829,0.000116192576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982141,0.00020677297,0.0002770269,0.00019331844,0.00022223586,0.00004864745,0.00132938,0.00013532223,0.00002099187],"category_scores_gemma":[0.00005753607,0.00018281353,0.000042968026,0.00045128795,0.0001653204,0.0006318996,0.0003153515,0.00021865575,0.00002505126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021124652,0.00017983424,0.0002253875,0.000039580875,0.00009953126,1.5663167e-7,0.005008003,0.09522945,0.8885176,0.008393189,0.00027239308,0.0020137432],"study_design_scores_gemma":[0.0004385006,0.00030403733,0.0009952694,0.00041793057,0.00003327497,0.000006964625,0.0008002184,0.74650854,0.24738804,0.000014804238,0.0026115433,0.00048087063],"about_ca_topic_score_codex":0.000099365985,"about_ca_topic_score_gemma":0.000061997045,"teacher_disagreement_score":0.6512791,"about_ca_system_score_codex":0.0002458841,"about_ca_system_score_gemma":0.00007884618,"threshold_uncertainty_score":0.7454919},"labels":[],"label_agreement":null},{"id":"W2344696675","doi":"10.1109/lcomm.2016.2558145","title":"The Gaussian Diamond-Wiretap Channel with Conferencing Relays","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"University of Toronto","funders":"","keywords":"Confidentiality; Computer science; Computer network; Channel (broadcasting); Computer security; Teleconference; Gaussian; Degrees of freedom (physics and chemistry); Internet privacy; Telecommunications; Physics","score_opus":0.021851700120953246,"score_gpt":0.231995442580198,"score_spread":0.21014374245924475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344696675","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.29071993,0.0052876915,0.3660389,0.28951618,0.0006781073,0.0026606673,0.00008848668,0.007774521,0.03723554],"genre_scores_gemma":[0.99204546,0.0029830926,0.003883771,0.00046780892,0.000029640316,0.0004588316,0.000008393392,0.000058740563,0.000064239146],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989327,0.00016163632,0.00029860073,0.00013882005,0.00016963625,0.00029860303],"domain_scores_gemma":[0.994977,0.0006963897,0.00008059128,0.004099287,0.00007237108,0.000074378106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886231,0.00018892539,0.00015481871,0.00009540183,0.00053258234,0.00009408621,0.0023096658,0.00006844765,0.000007035009],"category_scores_gemma":[0.000029083409,0.000114771115,0.000054084587,0.0002383699,0.00048290807,0.00025318682,0.00018237554,0.00033692218,0.00007110738],"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.000072874725,0.00025759838,0.004584663,0.00012101337,0.0009919273,0.0000133625235,0.012681339,0.001734942,0.60050917,0.097998515,0.13064049,0.15039411],"study_design_scores_gemma":[0.003376236,0.00021561074,0.020357765,0.0022044175,0.00023159751,0.00014375539,0.0015776176,0.040627446,0.18430616,0.0053222384,0.7378228,0.0038144044],"about_ca_topic_score_codex":0.00003224975,"about_ca_topic_score_gemma":0.0003187777,"teacher_disagreement_score":0.70132554,"about_ca_system_score_codex":0.00014236654,"about_ca_system_score_gemma":0.00002193036,"threshold_uncertainty_score":0.46802303},"labels":[],"label_agreement":null},{"id":"W2358248302","doi":"10.1109/tifs.2016.2566446","title":"Delay-Aware Optimization of Physical Layer Security in Multi-Hop Wireless Body Area Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Computer network; Wireless sensor network; Network topology; Nash equilibrium; Topology (electrical circuits); Node (physics); Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.012678307871622668,"score_gpt":0.2320039779186135,"score_spread":0.21932567004699083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358248302","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.17405312,0.000018134771,0.82494706,0.000053285727,0.00010501339,0.00026801118,0.00011659483,0.000240161,0.00019865074],"genre_scores_gemma":[0.99818546,0.00066201313,0.0009960775,0.00003678755,0.000010811998,0.000058551832,0.000028995553,0.000019273146,0.0000020083173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989203,0.00004441584,0.00050519506,0.00011971202,0.00020071675,0.00020964953],"domain_scores_gemma":[0.9991421,0.00012724656,0.00011113837,0.0003532286,0.00018547836,0.000080822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016663583,0.0002101418,0.00027757048,0.000253091,0.000084075335,0.000036642556,0.0001595762,0.00019476203,0.000018224635],"category_scores_gemma":[0.0000054395655,0.00018487495,0.00008479818,0.0003007148,0.00011312549,0.0010959523,0.0000055588166,0.0003127397,0.0000036950487],"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.000112616544,0.00034755404,0.000236193,0.00024759345,0.00009292835,0.0000014705874,0.009513061,0.92777056,0.0004519938,0.004844096,0.0002695807,0.05611238],"study_design_scores_gemma":[0.0007548228,0.000054548655,0.0000970952,0.00012922374,0.0000137524285,0.0000038026103,0.00014238748,0.98726237,0.010595158,0.0005262295,0.00019483126,0.00022579485],"about_ca_topic_score_codex":0.000043488435,"about_ca_topic_score_gemma":0.000112876754,"teacher_disagreement_score":0.8241324,"about_ca_system_score_codex":0.00009159467,"about_ca_system_score_gemma":0.000017217812,"threshold_uncertainty_score":0.7538982},"labels":[],"label_agreement":null},{"id":"W2398767638","doi":"","title":"Rate-adaptive Secure HARQ Protocol for Block-Fading Channels","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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","funders":"","keywords":"Computer science; Fading; Channel state information; Transmitter; Rayleigh fading; Hybrid automatic repeat request; Computer network; Throughput; Secrecy; Link adaptation; Channel (broadcasting); Jamming; Block (permutation group theory); Code rate; Secure communication; Decoding methods; Telecommunications link; Wireless; Computer security; Telecommunications; Mathematics","score_opus":0.022186811387937568,"score_gpt":0.2581137868626792,"score_spread":0.23592697547474165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398767638","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.0030023954,0.00023159463,0.8564605,0.0037737426,0.00036576288,0.09160644,0.00024621573,0.0038615859,0.040451728],"genre_scores_gemma":[0.6142163,0.000117308686,0.12394659,0.000113724986,0.00011392515,0.2588902,0.00043212814,0.00029449238,0.0018753092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419016,0.003151726,0.0008730666,0.0008261703,0.00037481304,0.0005840716],"domain_scores_gemma":[0.9915321,0.0018848162,0.00051747053,0.0034657663,0.0023692362,0.00023061523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057713487,0.0006596034,0.000705215,0.0003444717,0.00039262947,0.0005374567,0.0024476722,0.0006977328,0.00008559465],"category_scores_gemma":[0.000909478,0.0007662893,0.00036047417,0.00033858395,0.00021078537,0.00020018978,0.0014789472,0.0012675179,0.000035473193],"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.0002717387,0.0026041383,0.00035837622,0.011648282,0.001664291,0.00001409071,0.07138323,0.05403077,0.02868412,0.6038091,0.09933429,0.12619756],"study_design_scores_gemma":[0.0013156664,0.0000017809747,0.000113259666,0.005582078,0.000063690655,0.000008665963,0.00008772304,0.5431227,0.23606937,0.01787164,0.19436127,0.0014021639],"about_ca_topic_score_codex":0.00014172585,"about_ca_topic_score_gemma":0.0003037452,"teacher_disagreement_score":0.73251396,"about_ca_system_score_codex":0.00028123535,"about_ca_system_score_gemma":0.00016875744,"threshold_uncertainty_score":0.9994788},"labels":[],"label_agreement":null},{"id":"W2399530416","doi":"10.1109/icassp.2016.7472327","title":"Energy efficient beamforming for secure communication in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Trois-Rivières; Concordia University","funders":"","keywords":"Beamforming; Computer science; Cognitive radio; Mathematical optimization; Efficient energy use; Quality of service; Base station; Transmitter power output; Underlay; Optimization problem; Iterative method; Artificial noise; Channel (broadcasting); Signal-to-noise ratio (imaging); Physical layer; Algorithm; Wireless; Mathematics; Computer network; Telecommunications; Transmitter; Engineering","score_opus":0.012659092832321599,"score_gpt":0.24414129349027963,"score_spread":0.23148220065795802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399530416","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.020909486,0.00080959173,0.97167766,0.00020994831,0.000033798482,0.00024516924,0.000007688261,0.0005686183,0.0055380277],"genre_scores_gemma":[0.9890653,0.00083973614,0.009611417,0.000057334484,0.000018247156,0.00027496993,0.000025195277,0.000028858118,0.00007898225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938655,0.000034745477,0.0002262459,0.00009911529,0.00006461805,0.00018869678],"domain_scores_gemma":[0.9990029,0.00047739522,0.000031158175,0.00039196253,0.000062185056,0.000034411158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021523632,0.00010564573,0.0001296521,0.00010525307,0.000046847796,0.000015713103,0.00028461358,0.00010028969,0.000029193052],"category_scores_gemma":[0.000027346356,0.00008591353,0.00003974251,0.00014067974,0.000040441922,0.000100546386,0.00007088234,0.000085840344,0.0000019537965],"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.00011158336,0.00031819474,0.0009268107,0.00010188322,0.00014697107,0.0000016762095,0.0032477097,0.09807714,0.0076378346,0.27563325,0.011487983,0.602309],"study_design_scores_gemma":[0.000985922,0.000030195239,0.00020164016,0.00044267235,0.000009153605,0.0000031935858,0.0002057289,0.9521936,0.025272535,0.001661152,0.018656388,0.00033777824],"about_ca_topic_score_codex":0.000028829269,"about_ca_topic_score_gemma":0.0002018637,"teacher_disagreement_score":0.9681558,"about_ca_system_score_codex":0.00010593508,"about_ca_system_score_gemma":0.0000073149404,"threshold_uncertainty_score":0.35034522},"labels":[],"label_agreement":null},{"id":"W2402414467","doi":"10.1007/978-3-319-25645-0_28","title":"New Message Authentication Code Based on APN Functions and Stream Ciphers","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Code (set theory); Authentication (law); Data Authentication Algorithm; Stream cipher attack; CBC-MAC; Stream cipher; Bounded function; Authentication protocol; Computer network; Theoretical computer science; Computer security; Cryptography; Programming language; Mathematics","score_opus":0.023151834648561607,"score_gpt":0.2530836571570288,"score_spread":0.2299318225084672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414467","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.00007180771,0.00038412202,0.9816536,0.00037806103,0.0002817356,0.00023571127,0.000012645081,0.0004652795,0.016517082],"genre_scores_gemma":[0.82175773,0.00007469003,0.17716847,0.00026738577,0.00016885044,0.000016204005,0.000038836628,0.000070884525,0.00043692804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877286,0.000015620988,0.00022248446,0.0003927733,0.00039620642,0.00020007178],"domain_scores_gemma":[0.99859875,0.00020094853,0.000064476015,0.0009131125,0.00009127767,0.00013144936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003015153,0.00025775822,0.00021960687,0.0004067324,0.00008103343,0.00013109631,0.00064279366,0.0002126259,0.00003745224],"category_scores_gemma":[0.000036932237,0.00026456505,0.000035336438,0.00020076301,0.00022147525,0.00013861383,0.0001476209,0.00050808216,0.000015838159],"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.0000068571317,0.000020493193,0.000035359582,0.00005497551,0.000013452609,0.00000424856,0.0007172586,0.20581639,0.00023561333,0.006266933,0.0010087531,0.78581965],"study_design_scores_gemma":[0.00020218191,0.00008365889,0.00011670196,0.00035032007,0.000014569188,0.0000047947647,5.806656e-7,0.959577,0.001029293,0.0293899,0.008800411,0.00043058835],"about_ca_topic_score_codex":0.000013817918,"about_ca_topic_score_gemma":0.00008961429,"teacher_disagreement_score":0.82168597,"about_ca_system_score_codex":0.00024391885,"about_ca_system_score_gemma":0.0001553102,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W2405665546","doi":"10.4086/toc.2018.v014a020","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Environment and Climate Change Canada; National Science Foundation","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.014508259151787866,"score_gpt":0.24930232802088315,"score_spread":0.2347940688690953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405665546","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.66924506,0.00012903755,0.3259402,0.000018603017,0.00006398289,0.0000797684,6.9868275e-7,0.0013084573,0.0032141977],"genre_scores_gemma":[0.96683913,0.000013869576,0.032948468,0.000048492206,0.000112098685,0.0000020631385,0.0000014370963,0.000032678327,0.0000017830885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889356,0.00017108444,0.00042979914,0.00011361508,0.00014532793,0.00024660345],"domain_scores_gemma":[0.9985068,0.00047546948,0.00008567196,0.0007293257,0.00015364877,0.00004910154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821578,0.00014290215,0.00024884034,0.00013567037,0.0001188491,0.000016078617,0.00070850586,0.00006305183,0.000011749605],"category_scores_gemma":[0.000071089504,0.00016051382,0.00005823548,0.000268393,0.00037719766,0.00013513652,0.00020915561,0.0001737822,0.0000043085424],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057528956,0.000077928555,0.0018319845,0.0001970589,0.00013059522,0.0000013794271,0.034711625,0.006326866,0.1947011,0.5435378,0.00012803813,0.21829806],"study_design_scores_gemma":[0.00029957,0.00011702747,0.008083776,0.0002259767,0.000011572894,0.000011218309,0.00076834083,0.14663365,0.7545908,0.08871866,0.00023112471,0.00030825767],"about_ca_topic_score_codex":0.0000046328055,"about_ca_topic_score_gemma":0.0000030326298,"teacher_disagreement_score":0.55988973,"about_ca_system_score_codex":0.00002625445,"about_ca_system_score_gemma":0.0000070707893,"threshold_uncertainty_score":0.6545564},"labels":[],"label_agreement":null},{"id":"W2439302226","doi":"10.1109/iwcit.2016.7491616","title":"Rate-splitting and successive decoding for Gaussian interference channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Decoding methods; Sequential decoding; List decoding; Interference (communication); Joint (building); Gaussian; Mathematics; Algorithm; Coding (social sciences); Computer science; Single antenna interference cancellation; Channel (broadcasting); Telecommunications; Concatenated error correction code; Statistics; Block code; Physics","score_opus":0.022028485666035852,"score_gpt":0.26322015113583946,"score_spread":0.2411916654698036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439302226","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.09155348,0.00016042,0.9018566,0.0007455817,0.00008156049,0.00022769647,0.0000054160732,0.00080401136,0.004565257],"genre_scores_gemma":[0.9870831,0.00017075689,0.012407556,0.00003733059,0.000029244764,0.00008784598,0.0000012636942,0.000018936824,0.0001640049],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956024,0.00001491954,0.00014507624,0.00010588204,0.000027768212,0.00014612412],"domain_scores_gemma":[0.9993283,0.0003634635,0.000023558418,0.00020511051,0.000036338944,0.000043193864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016279785,0.00008622549,0.000100774654,0.000058160495,0.00004857873,0.000045074903,0.000176174,0.00004696346,0.000032991768],"category_scores_gemma":[0.000088824796,0.00006227925,0.000018775976,0.000045155575,0.00002880898,0.00021232579,0.000071638235,0.000045599398,0.000004899979],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028375254,0.00002513842,0.0015089975,0.00031699965,0.00008027925,0.0000018074696,0.002408192,0.00004785452,0.28877467,0.19722672,0.0035527311,0.50602823],"study_design_scores_gemma":[0.0007890082,0.00007513827,0.00038734573,0.00075981574,0.000012364321,0.000005638127,0.00036291906,0.10824996,0.8667401,0.014044517,0.007953754,0.0006194241],"about_ca_topic_score_codex":0.0000047022763,"about_ca_topic_score_gemma":0.000012175711,"teacher_disagreement_score":0.89552957,"about_ca_system_score_codex":0.00002733605,"about_ca_system_score_gemma":0.000003859041,"threshold_uncertainty_score":0.2539674},"labels":[],"label_agreement":null},{"id":"W2461678157","doi":"10.1007/978-3-319-49175-2_7","title":"Detecting Algebraic Manipulation in Leaky Storage Systems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Adversary; Code (set theory); Upper and lower bounds; Algebraic number; Binary logarithm; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm; Decoding methods; Computer security","score_opus":0.019638891446530308,"score_gpt":0.23647081967447642,"score_spread":0.2168319282279461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461678157","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.0016597223,0.0010364808,0.99139255,0.000054625572,0.00070514873,0.0003627262,0.0000028382017,0.00052363664,0.0042622667],"genre_scores_gemma":[0.9831071,0.00008153805,0.016443433,0.00004305883,0.0001861421,0.000017799379,0.0000028976972,0.00005759908,0.000060423346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983358,0.000028935918,0.00044997883,0.00045490236,0.00039238774,0.0003380012],"domain_scores_gemma":[0.9985615,0.00031407116,0.000115761744,0.00088165165,0.0000735065,0.000053534743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000606939,0.00030926,0.00034245188,0.0008492933,0.000073430776,0.00015019979,0.0010336217,0.0003186779,0.000010491796],"category_scores_gemma":[0.000045326466,0.00029776306,0.00004691701,0.00026974708,0.00016893646,0.00029810518,0.00029144515,0.00069230207,0.000022601555],"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.0000032079827,0.00000962027,0.00017515106,0.00022102069,0.000010280356,0.00003378551,0.0010160891,0.49337018,0.0023000198,0.013897779,0.000009939324,0.48895293],"study_design_scores_gemma":[0.00015574614,0.000030885923,0.00024686957,0.0017341698,0.0000034150153,0.00002925139,3.5316106e-7,0.9663229,0.0023039319,0.02753278,0.0010192287,0.0006204542],"about_ca_topic_score_codex":0.00002254648,"about_ca_topic_score_gemma":0.00017695829,"teacher_disagreement_score":0.9814474,"about_ca_system_score_codex":0.0006446527,"about_ca_system_score_gemma":0.000054275242,"threshold_uncertainty_score":0.9999474},"labels":[],"label_agreement":null},{"id":"W2467251259","doi":"10.1109/tit.2017.2692215","title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Markov process; Aperiodic graph; Markov model; Mathematical optimization; Applied mathematics; Combinatorics; Statistics","score_opus":0.014241607280895673,"score_gpt":0.24529759658405986,"score_spread":0.23105598930316418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467251259","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.025320685,0.00021446554,0.96610284,0.0000324042,0.00033039565,0.0004311798,0.0006441052,0.0005616715,0.006362282],"genre_scores_gemma":[0.9849464,0.00187191,0.012673354,0.00006728186,0.000013246959,0.00018556324,0.00013039443,0.00003484674,0.00007698886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00011636917,0.00067465747,0.000129071,0.00026256597,0.00016437983],"domain_scores_gemma":[0.997972,0.0005213204,0.0003530234,0.0009022909,0.00018147519,0.000069857924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065313926,0.00028591568,0.00034304033,0.000516536,0.00025975646,0.00014079172,0.00050596206,0.00033659153,0.00008476138],"category_scores_gemma":[0.00002669197,0.0003259007,0.00012091956,0.00006558629,0.00022283586,0.0009315909,0.000018427309,0.00078808126,0.000017795372],"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.000100937476,0.00003970111,0.0000025272104,0.0011068493,0.00021809038,5.275785e-7,0.009704026,0.92996114,0.00011581463,0.0028935184,0.00031879023,0.055538077],"study_design_scores_gemma":[0.0018214278,0.00020170303,0.00029741763,0.0031564224,0.00040643493,0.000048111142,0.0037998336,0.8101599,0.137702,0.035209265,0.0049707065,0.0022267245],"about_ca_topic_score_codex":0.000019206924,"about_ca_topic_score_gemma":0.0000042078927,"teacher_disagreement_score":0.9596257,"about_ca_system_score_codex":0.00009265559,"about_ca_system_score_gemma":0.000063290005,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W2468432040","doi":"10.1109/tcomm.2016.2582873","title":"Source-Interference Recovery Over Broadcast Channels: Asymptotic Bounds and Analog Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Encoder; Algorithm; Gaussian; Mathematics; Fading; Decoding methods; Dirty paper coding; Distortion (music); Computer science; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Precoding; MIMO; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.024505061057995353,"score_gpt":0.2561437748499788,"score_spread":0.23163871379198345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468432040","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.018281952,0.0011247661,0.97420865,0.0011897169,0.000206584,0.00025539327,0.00010679909,0.0012785511,0.0033475978],"genre_scores_gemma":[0.980201,0.015315598,0.0036384838,0.00008653035,0.000015811203,0.00019696538,0.0000072125977,0.00005398361,0.00048442447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891526,0.0001513056,0.0003497504,0.00020555094,0.00013503162,0.00024312457],"domain_scores_gemma":[0.996756,0.0006691749,0.000055891964,0.0023254543,0.000082130275,0.00011135424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018534079,0.00022445868,0.00022578913,0.00028743633,0.00038218527,0.000103929146,0.00095744734,0.00014032866,0.0001225999],"category_scores_gemma":[0.000012787545,0.0002051177,0.00009203101,0.00028406893,0.00033243542,0.00037676896,0.000019315534,0.00038818436,0.00007136853],"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.00007413093,0.00080914865,0.00019426674,0.00011832601,0.0005912003,0.0000012140569,0.0031219048,0.007314535,0.03853502,0.005625059,0.0035855607,0.9400296],"study_design_scores_gemma":[0.005821356,0.0015939364,0.0032465702,0.006398134,0.00073238544,0.00028185593,0.0013821401,0.3321184,0.24011548,0.0282246,0.37382528,0.0062598777],"about_ca_topic_score_codex":0.000070948074,"about_ca_topic_score_gemma":0.0003047384,"teacher_disagreement_score":0.97057015,"about_ca_system_score_codex":0.00015287576,"about_ca_system_score_gemma":0.000024364806,"threshold_uncertainty_score":0.8364457},"labels":[],"label_agreement":null},{"id":"W2471662310","doi":"10.1109/vtcspring.2016.7504462","title":"Secrecy Enhancement via Cooperative Relays in Multi-Hop Communication Systems","year":2016,"lang":"en","type":"article","venue":"","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":"Western University","funders":"","keywords":"Secrecy; Computer science; Artificial noise; Channel state information; Transmitter; Hop (telecommunications); Computer network; Transmitter power output; Wireless; Interference (communication); Relay; Power (physics); Channel (broadcasting); Telecommunications; Computer security","score_opus":0.02580559771008496,"score_gpt":0.2673582418126619,"score_spread":0.24155264410257693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471662310","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.050595883,0.0015030099,0.9323435,0.00039957697,0.000082870334,0.00082293863,0.0000055819496,0.0009856627,0.013261012],"genre_scores_gemma":[0.9872891,0.001607928,0.0100706965,0.000028372406,0.0000060236266,0.00045203132,0.00001117997,0.000025932017,0.0005087401],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991463,0.00013410283,0.00034103505,0.000117242394,0.00010166704,0.00015969966],"domain_scores_gemma":[0.9988369,0.00014234654,0.000035812627,0.0008600522,0.00008512998,0.000039788472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028548163,0.00012628075,0.00016426182,0.00010944798,0.000041494346,0.00002629843,0.00040781935,0.000090692556,0.00010680506],"category_scores_gemma":[0.000025270843,0.00009754822,0.000021303897,0.0001697118,0.000041868032,0.00025126402,0.000106611886,0.00014310071,0.00013876299],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003606523,0.00069640507,0.0042176703,0.00020212235,0.0001786925,0.0000052446235,0.0085233115,0.005986758,0.67570746,0.23577833,0.0065259663,0.062142003],"study_design_scores_gemma":[0.0029232255,0.0001259073,0.0026562535,0.0014819372,0.000014595761,0.000011693844,0.0009857664,0.47653884,0.46621537,0.0011264147,0.046590574,0.0013294406],"about_ca_topic_score_codex":0.00015403678,"about_ca_topic_score_gemma":0.00034237772,"teacher_disagreement_score":0.9366932,"about_ca_system_score_codex":0.00024351933,"about_ca_system_score_gemma":0.000009608234,"threshold_uncertainty_score":0.39779007},"labels":[],"label_agreement":null},{"id":"W2485062826","doi":"10.1109/icc.2016.7510895","title":"Energy efficient optimization for physical layer security in cognitive relay networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Mathematical optimization; Computer science; Underlay; Physical layer; Maximization; Optimization problem; Secure transmission; Efficient energy use; Transmission (telecommunications); Cognitive radio; Interference (communication); Transmitter power output; Wireless; Power (physics); Signal-to-noise ratio (imaging); Mathematics; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.013145676389524621,"score_gpt":0.25570681261677963,"score_spread":0.242561136227255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485062826","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.054365974,0.00007349058,0.94166374,0.000109107685,0.0000387893,0.00017625738,0.000007523598,0.0004888153,0.0030763187],"genre_scores_gemma":[0.9959149,0.00012860014,0.00361355,0.000045247336,0.0000447388,0.00018040529,0.000014573217,0.000025154844,0.000032832675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994721,0.000029936204,0.00014550978,0.00012098719,0.000068171394,0.00016332776],"domain_scores_gemma":[0.9993887,0.00030396535,0.00001981659,0.00018927512,0.00006484234,0.000033403565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009849528,0.00009734268,0.000121014884,0.00006650552,0.000022635628,0.000011926666,0.00012302019,0.00007993911,0.000034993525],"category_scores_gemma":[0.00002691923,0.00007630646,0.00004055697,0.00013364357,0.000027411921,0.000074338204,0.000042330295,0.0000667323,0.0000022250867],"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.000031935328,0.0001449501,0.00007229501,0.00001218497,0.000019041412,5.629911e-7,0.00042781152,0.9567093,0.00053699565,0.023164757,0.0011874052,0.017692741],"study_design_scores_gemma":[0.00036124367,0.000022208895,0.000027498909,0.00006248346,0.000003874925,3.8747825e-7,0.000020252432,0.98605824,0.012279339,0.00043246758,0.00060642837,0.00012555673],"about_ca_topic_score_codex":0.000009900868,"about_ca_topic_score_gemma":0.000037442584,"teacher_disagreement_score":0.94154894,"about_ca_system_score_codex":0.000066587185,"about_ca_system_score_gemma":0.0000055400487,"threshold_uncertainty_score":0.3111687},"labels":[],"label_agreement":null},{"id":"W2487967768","doi":"10.1109/icc.2016.7511625","title":"A novel nonlinear secure transmission design for MU-MISO systems with limited feedback","year":2016,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Precoding; Channel state information; Transmitter; Zero-forcing precoding; Computer science; Ergodic theory; Artificial noise; Beamforming; Telecommunications link; Secure transmission; Transmission (telecommunications); Channel (broadcasting); Nonlinear system; Control theory (sociology); Topology (electrical circuits); Secure communication; Robustness (evolution); MIMO; Wireless; Computer network; Mathematics; Telecommunications; Encryption; Artificial intelligence","score_opus":0.028229608422809145,"score_gpt":0.2331965800444408,"score_spread":0.20496697162163166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487967768","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.0024189975,0.00024350469,0.993496,0.0004042941,0.000032804935,0.0008087426,0.000026076692,0.0015439069,0.0010256846],"genre_scores_gemma":[0.5892014,0.00019783137,0.4097475,0.000031781743,0.000044338547,0.00024822875,0.000012179476,0.00008244157,0.00043428084],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923164,0.000023842438,0.00022949258,0.00016066061,0.0001362012,0.00021815434],"domain_scores_gemma":[0.9990453,0.00023197124,0.00003290454,0.0004815134,0.00011976765,0.000088533976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017048689,0.000177562,0.00019617467,0.00008416715,0.00005106167,0.00003783554,0.00030014527,0.00013675661,0.000024290843],"category_scores_gemma":[0.000012611945,0.00010911819,0.00004550463,0.00014479381,0.000030052306,0.00016362382,0.000015912763,0.00008820398,0.000012615854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043795595,0.00041346,0.00007820822,0.0010558177,0.00033054312,0.0000035189382,0.001575845,0.015560752,0.89000183,0.009276717,0.024038455,0.057226893],"study_design_scores_gemma":[0.002589242,0.00032159206,0.000055112625,0.00097308034,0.00003950312,0.000034180353,0.00012727513,0.6410825,0.21730304,0.00011437261,0.13666528,0.00069479673],"about_ca_topic_score_codex":0.000013559495,"about_ca_topic_score_gemma":0.0000067232686,"teacher_disagreement_score":0.6726988,"about_ca_system_score_codex":0.000057600722,"about_ca_system_score_gemma":0.000021893733,"threshold_uncertainty_score":0.44497105},"labels":[],"label_agreement":null},{"id":"W2507273085","doi":"10.1109/spawc.2016.7536825","title":"Experimental study on channel reciprocity in wireless key generation","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"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":"Engineering and Physical Sciences Research Council; Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Wireless; Computer science; Multipath propagation; Fading; Channel (broadcasting); Coherence bandwidth; Key (lock); Electronic engineering; Delay spread; Computer network; Telecommunications; Engineering; Computer security","score_opus":0.04517197777435501,"score_gpt":0.2852378999677431,"score_spread":0.24006592219338813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507273085","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.9894851,0.000027294549,0.005135372,0.00011392249,0.00006482194,0.0003147241,0.0000014791509,0.0005890479,0.0042682765],"genre_scores_gemma":[0.99931276,0.000023131333,0.00030678866,0.000037006004,0.000036766876,0.00018935266,0.0000022078068,0.00002098256,0.00007101383],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994134,0.000050222436,0.00017269237,0.00012902111,0.00011796051,0.00011672789],"domain_scores_gemma":[0.9995469,0.000028913435,0.000014139333,0.00036540048,0.000016564012,0.000028104829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014263214,0.00009995488,0.00010362802,0.000096207696,0.000025993952,0.00001551456,0.00017806327,0.00005088857,0.000048225236],"category_scores_gemma":[0.0000070140077,0.00007703902,0.000016985503,0.00009491106,0.000013119422,0.0001438392,0.000044516255,0.000075697964,0.000042163938],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001858681,0.0013532878,0.0028611838,0.0000067324177,0.000023156073,0.000004396232,0.0056959805,0.00013465654,0.97188133,0.005405662,0.002515829,0.010099183],"study_design_scores_gemma":[0.0004898972,0.0001570285,0.002725878,0.000025061076,9.068898e-7,5.165571e-7,0.00045059758,0.005990337,0.98971874,0.00006322658,0.00020038076,0.00017746011],"about_ca_topic_score_codex":0.0000309895,"about_ca_topic_score_gemma":0.000107458705,"teacher_disagreement_score":0.017837364,"about_ca_system_score_codex":0.00015248432,"about_ca_system_score_gemma":0.0000038361345,"threshold_uncertainty_score":0.314156},"labels":[],"label_agreement":null},{"id":"W2508771649","doi":"10.1007/978-3-319-49175-2_13","title":"Almost Perfect Privacy for Additive Gaussian Privacy Filters","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mutual information; Random variable; Gaussian; Mathematics; Information theory; Distribution (mathematics); Private information retrieval; Interpretation (philosophy); Variable (mathematics); Combinatorics; Discrete mathematics; Computer science; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019534786693188252,"score_gpt":0.27954265046021504,"score_spread":0.2600078637670268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508771649","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.012453846,0.00029613992,0.9829284,0.0012041172,0.0010337032,0.0010549335,0.00010377165,0.00081803405,0.0001070799],"genre_scores_gemma":[0.7162494,0.00009984249,0.28290164,0.00019634547,0.00025269837,0.00022399974,0.000029835079,0.00004552967,7.193488e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763626,0.00007147142,0.00043133533,0.0008388557,0.00039351,0.0006285493],"domain_scores_gemma":[0.9967517,0.00083031505,0.00013364255,0.001979467,0.00017781366,0.00012701991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000602349,0.0004570019,0.0004561769,0.00052260497,0.0001613497,0.00029512882,0.0034218393,0.00032686422,0.000019323117],"category_scores_gemma":[0.00032820125,0.00040431094,0.00014674698,0.00051944255,0.0004473356,0.00030392464,0.0023483974,0.0008554965,0.000009691493],"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.000014537823,0.0000715011,0.00041892374,0.0004017726,0.00004709487,0.000009434229,0.0069347057,0.05904892,0.0050003887,0.00043427694,0.0007867866,0.92683166],"study_design_scores_gemma":[0.00043685254,0.0000982218,0.0021483924,0.0016561988,0.000014147822,0.00001799945,0.00000115634,0.8191078,0.116072394,0.054710142,0.0045548277,0.0011819216],"about_ca_topic_score_codex":0.000014083277,"about_ca_topic_score_gemma":0.00001445671,"teacher_disagreement_score":0.92564976,"about_ca_system_score_codex":0.0005141771,"about_ca_system_score_gemma":0.00022478038,"threshold_uncertainty_score":0.99984086},"labels":[],"label_agreement":null},{"id":"W2508924641","doi":"10.1109/isit.2016.7541548","title":"Helper-assisted state cancelation for multiple access channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Channel (broadcasting); Gaussian; Computer science; State (computer science); Boundary (topology); Topology (electrical circuits); Channel capacity; Sequence (biology); Computer network; Algorithm; Mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.04544860140953949,"score_gpt":0.2933353560044334,"score_spread":0.2478867545948939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508924641","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.14772233,0.00009224207,0.8470735,0.000670728,0.00017959079,0.00051283865,0.00004438277,0.0018745279,0.0018298856],"genre_scores_gemma":[0.9926678,0.00014937298,0.006322825,0.000040894658,0.000027628521,0.00028547592,0.000011337341,0.00002803971,0.00046662186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952877,0.000012117126,0.00015669545,0.00009259034,0.00006527349,0.00014454615],"domain_scores_gemma":[0.99940157,0.00015783671,0.000024366856,0.0003058535,0.000073328796,0.00003704916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008765183,0.00008358696,0.00009256678,0.00006465945,0.000039491457,0.00003847979,0.00026531,0.00004553864,0.00005455758],"category_scores_gemma":[0.000034451205,0.00006315702,0.00003172405,0.000083329825,0.00001597595,0.0003502408,0.000045190067,0.00003427195,0.000013894056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046339625,0.000104502986,0.0073096813,0.00023868908,0.00012699908,8.1180735e-7,0.0010815609,0.0032738247,0.3039833,0.0062412834,0.031727217,0.6458658],"study_design_scores_gemma":[0.0011104576,0.00003683884,0.0065972074,0.00011338344,0.0000074068157,0.0000015325899,0.000027942446,0.09628083,0.80077803,0.0034246931,0.09118076,0.00044091482],"about_ca_topic_score_codex":0.000064540465,"about_ca_topic_score_gemma":0.00030333296,"teacher_disagreement_score":0.8449455,"about_ca_system_score_codex":0.00008205044,"about_ca_system_score_gemma":0.000008014906,"threshold_uncertainty_score":0.25754684},"labels":[],"label_agreement":null},{"id":"W2509597920","doi":"10.1109/isit.2016.7541427","title":"When is noisy state information at the encoder as useless as no information or as good as noise-free state?","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Encoder; Mutual information; State (computer science); Computer science; Noise (video); Channel (broadcasting); Information theory; Binary number; Decoding methods; Binary symmetric channel; State information; Noise measurement; Channel capacity; Algorithm; Artificial intelligence; Mathematics; Noise reduction; Telecommunications; Arithmetic; Statistics","score_opus":0.008217975559925884,"score_gpt":0.22710637126738664,"score_spread":0.21888839570746077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509597920","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.5671546,0.00009504587,0.041499685,0.007607689,0.00036620648,0.002161911,0.00031071063,0.004108669,0.37669548],"genre_scores_gemma":[0.9672679,0.002259364,0.005487866,0.006064429,0.000057949248,0.00049948494,0.0002244812,0.000100956546,0.018037584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979981,0.00007116728,0.0007887646,0.0001285683,0.0006177828,0.00039557464],"domain_scores_gemma":[0.997339,0.0002601729,0.00021571771,0.001626976,0.00042149294,0.00013662223],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004220641,0.00031941946,0.00024617204,0.00021747148,0.00019483473,0.00029289658,0.0011317481,0.0001654557,0.0038200074],"category_scores_gemma":[0.00028160817,0.00019587035,0.00008175583,0.00023552043,0.00009022101,0.0052332464,0.0005378234,0.0002553967,0.017706793],"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.0006626691,0.00013639843,0.0010965323,0.0005502659,0.00053974276,0.0000053682934,0.089156,0.0012281083,0.007898806,0.027340557,0.61664253,0.254743],"study_design_scores_gemma":[0.0011201915,0.00016756426,0.00037913022,0.00011577958,0.000019958949,0.00003525781,0.0004873737,0.0040347744,0.15023601,0.014292668,0.8285117,0.0005995824],"about_ca_topic_score_codex":0.0013489801,"about_ca_topic_score_gemma":0.0005836664,"teacher_disagreement_score":0.40011328,"about_ca_system_score_codex":0.00034015544,"about_ca_system_score_gemma":0.000111934685,"threshold_uncertainty_score":0.99709064},"labels":[],"label_agreement":null},{"id":"W2513682746","doi":"10.1109/isit.2016.7541307","title":"To feedback or not to feedback","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Channel (broadcasting); Channel capacity; Interference (communication); Computer science; Transmission (telecommunications); Transmission channel; Upper and lower bounds; Control theory (sociology); Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.027037579143198834,"score_gpt":0.2788366863998788,"score_spread":0.25179910725668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513682746","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.50604767,0.000047718542,0.31880102,0.0272788,0.00038784725,0.0013197645,0.00004971891,0.008991978,0.13707551],"genre_scores_gemma":[0.94766665,0.000051539875,0.044365175,0.0013706168,0.000048390015,0.00006646505,9.941657e-7,0.00004600431,0.006384167],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992616,0.000016051888,0.0001982075,0.00014907747,0.00013993242,0.00023512107],"domain_scores_gemma":[0.9988333,0.00010270724,0.000010005746,0.0008178754,0.000057154375,0.00017893192],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011016919,0.000132478,0.00014527491,0.00011436097,0.000028339658,0.000033863864,0.0005258815,0.00006798776,0.0011399474],"category_scores_gemma":[0.00006829465,0.00008794607,0.000033044595,0.00024930132,0.000013766828,0.00012405698,0.0001867773,0.00006607139,0.0036379038],"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.00009649438,0.000053807013,0.00020600998,0.000045157394,0.00004368749,0.000004041336,0.0012132028,0.0001919358,0.30887046,0.012196404,0.4765681,0.2005107],"study_design_scores_gemma":[0.00025203192,0.000079609665,0.003395557,0.00011388978,0.000003680943,0.0000041490025,0.00006228905,0.00021283225,0.48290166,0.00018675505,0.5123709,0.0004166222],"about_ca_topic_score_codex":0.000022677928,"about_ca_topic_score_gemma":0.00014324315,"teacher_disagreement_score":0.441619,"about_ca_system_score_codex":0.00009630728,"about_ca_system_score_gemma":0.000010227581,"threshold_uncertainty_score":0.99977314},"labels":[],"label_agreement":null},{"id":"W2514702254","doi":"10.1109/iscas.2016.7539148","title":"A study on compression rate bounds in distributed video coding based on correlation noise models","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Concordia University","funders":"","keywords":"Discrete cosine transform; Decoding methods; Distributed source coding; Correlation coefficient; Computer science; Data compression; Coding (social sciences); Algorithm; Context-adaptive binary arithmetic coding; Upper and lower bounds; Coding tree unit; Correlation; Data compression ratio; Noise (video); Mathematics; Speech recognition; Image compression; Artificial intelligence; Statistics; Variable-length code; Image processing; Mathematical analysis","score_opus":0.032655138114188624,"score_gpt":0.269510801480666,"score_spread":0.23685566336647734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514702254","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.452061,0.0000074935538,0.54143244,0.00026372893,0.00006134298,0.00050770276,0.00002057594,0.0010105969,0.004635117],"genre_scores_gemma":[0.9993418,0.000013898106,0.0004033398,0.00005658566,0.000007703801,0.000096838994,0.000027216021,0.000026455373,0.000026168304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990907,0.00014309201,0.0002718905,0.00016758453,0.00017220742,0.00015456874],"domain_scores_gemma":[0.9989243,0.00038076713,0.000038570557,0.00057563256,0.0000368203,0.00004389992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107877,0.00014651212,0.00016146903,0.00019299604,0.0000522876,0.00003404256,0.00021630242,0.00007739672,0.000029249733],"category_scores_gemma":[0.000043490996,0.00011025195,0.000028054486,0.00020368643,0.000016961743,0.00021465683,0.00004256857,0.00016909989,0.00002656342],"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.00029243084,0.0013441656,0.01431421,0.000036485628,0.000028845105,0.000014979763,0.0012122297,0.91442454,0.042617094,0.014042028,0.0038442179,0.007828768],"study_design_scores_gemma":[0.001106425,0.000111412744,0.013245977,0.0003089549,0.000003536709,1.6789329e-7,0.000060952327,0.97316957,0.010979564,0.00067929906,0.00015139404,0.00018275072],"about_ca_topic_score_codex":0.000024140441,"about_ca_topic_score_gemma":0.0000389301,"teacher_disagreement_score":0.5472808,"about_ca_system_score_codex":0.00022126955,"about_ca_system_score_gemma":0.000009204751,"threshold_uncertainty_score":0.44959444},"labels":[],"label_agreement":null},{"id":"W2516026999","doi":"10.1109/mcom.2016.7537191","title":"Physical layer security issues in interference- alignment-based wireless networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":150,"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; Carleton University","funders":"","keywords":"Eavesdropping; Physical layer; Jamming; Computer science; Interference (communication); Computer network; Wireless; Computer security; Scheme (mathematics); Wireless network; Key (lock); Telecommunications; Channel (broadcasting)","score_opus":0.026748012581992827,"score_gpt":0.29148667265276956,"score_spread":0.26473866007077673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516026999","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.76560414,0.0043568495,0.17461896,0.018065963,0.0006636793,0.0017074136,0.00013844436,0.0054506343,0.029393885],"genre_scores_gemma":[0.9943769,0.0024996148,0.002467383,0.000101957834,0.00007076821,0.0003064908,0.000034348166,0.000058566253,0.000083983046],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985802,0.00025864146,0.00044189536,0.00021630235,0.00016844965,0.0003344981],"domain_scores_gemma":[0.9958104,0.00046836323,0.00007512153,0.003451338,0.00010623598,0.00008852232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821415,0.0002588199,0.00033533492,0.00021273679,0.00008487555,0.000049468934,0.002071204,0.00013475296,0.00005026143],"category_scores_gemma":[0.00003045639,0.0002277103,0.000086507294,0.00045340465,0.00027221622,0.00028318612,0.00031215942,0.00043192017,0.00016656265],"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.00019678171,0.00626683,0.021601886,0.00041650183,0.0004555067,0.000025220967,0.008632003,0.014931031,0.43869883,0.10697992,0.1407775,0.26101798],"study_design_scores_gemma":[0.0016893785,0.000107644424,0.0025282232,0.000936924,0.00003438983,0.00000548671,0.00008968484,0.8319926,0.07309076,0.0066057486,0.08178437,0.0011347457],"about_ca_topic_score_codex":0.000035572866,"about_ca_topic_score_gemma":0.0005641991,"teacher_disagreement_score":0.8170616,"about_ca_system_score_codex":0.00021990808,"about_ca_system_score_gemma":0.000023791805,"threshold_uncertainty_score":0.9285757},"labels":[],"label_agreement":null},{"id":"W2516387900","doi":"10.1109/isit.2016.7541278","title":"Structural results for two-user interactive communication","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Encoding (memory); Dynamic programming; Fidelity; Random access; Decomposition; Homogeneous; Theoretical computer science; Function (biology); Information theory; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Telecommunications; Statistics; Computer network","score_opus":0.01874246459371712,"score_gpt":0.29075467067825295,"score_spread":0.2720122060845358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516387900","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.46192077,0.0004785056,0.35651407,0.0101472065,0.0004061193,0.002032179,0.00030605865,0.007997745,0.16019735],"genre_scores_gemma":[0.9710609,0.00006352395,0.028260583,0.00004257277,0.000017668917,0.00008621775,0.000022652768,0.00001916709,0.00042672723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995446,0.000028937391,0.00018981377,0.00007958053,0.00005213811,0.00010491273],"domain_scores_gemma":[0.9987606,0.00039002253,0.000032395932,0.0007035704,0.00008704504,0.000026402979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011676179,0.00007987255,0.00008387066,0.00004846754,0.000044548433,0.000020850759,0.00036656266,0.00003929244,0.000030837084],"category_scores_gemma":[0.00007174782,0.000056587985,0.000034164714,0.00004845071,0.000033087395,0.00028959324,0.00007325681,0.00006688467,0.000020252908],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045275004,0.000057943722,0.0004001627,0.00007689941,0.0002540527,5.094604e-7,0.004806528,0.00053442636,0.19008353,0.31346065,0.18368503,0.30618754],"study_design_scores_gemma":[0.004236022,0.000091712354,0.0024047687,0.00027507354,0.000020045109,0.000007942165,0.00031792163,0.04239834,0.71294725,0.025220316,0.21130687,0.0007737194],"about_ca_topic_score_codex":0.000018809533,"about_ca_topic_score_gemma":0.00008955754,"teacher_disagreement_score":0.52286375,"about_ca_system_score_codex":0.00007457025,"about_ca_system_score_gemma":0.0000041912735,"threshold_uncertainty_score":0.23075911},"labels":[],"label_agreement":null},{"id":"W2517764325","doi":"10.1109/isit.2016.7541502","title":"Feedback does not increase the capacity of compound channels with additive noise","year":2016,"lang":"en","type":"article","venue":"","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":"University of Ottawa","funders":"","keywords":"Noise (video); Channel (broadcasting); Constraint (computer-aided design); Channel capacity; Ergodicity; Transmitter; Control theory (sociology); Saddle point; Stability (learning theory); Saddle; Point (geometry); Property (philosophy); Topology (electrical circuits); Mathematics; Computer science; Mathematical optimization; Telecommunications; Control (management); Combinatorics; Statistics","score_opus":0.014812053169776466,"score_gpt":0.21299401896334755,"score_spread":0.19818196579357109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517764325","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.9683335,0.000021403792,0.015283254,0.0010756776,0.0000421666,0.00028222028,0.00015060612,0.00058589585,0.014225286],"genre_scores_gemma":[0.9973034,0.000096722404,0.0022448914,0.00007322088,0.000025152614,0.000045757377,0.00000315584,0.00001908665,0.00018857763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994593,0.00004918179,0.00015159088,0.00008469235,0.00013347979,0.00012171383],"domain_scores_gemma":[0.9989411,0.0003145357,0.00004140807,0.000561418,0.000099704564,0.000041791227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013691968,0.0001092938,0.00014112971,0.00003975639,0.00004069234,0.000014144952,0.0003429562,0.000043703407,0.00017981323],"category_scores_gemma":[0.000026173566,0.00004561605,0.00002999295,0.000087921246,0.00021087259,0.00014578828,0.00006697983,0.000091282374,0.000018863564],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003894606,0.00052195386,0.0034875795,0.00032286235,0.00081074866,0.000011461285,0.009581195,0.0004124913,0.75405586,0.16497578,0.030838693,0.03459194],"study_design_scores_gemma":[0.00035642838,0.00004081751,0.0021664866,0.00013126164,0.000013114454,0.0000062103636,0.00017300797,0.0008812905,0.9876201,0.0010215531,0.0073883953,0.00020129136],"about_ca_topic_score_codex":0.0002674976,"about_ca_topic_score_gemma":0.00022233599,"teacher_disagreement_score":0.2335643,"about_ca_system_score_codex":0.00003540362,"about_ca_system_score_gemma":0.0000090006515,"threshold_uncertainty_score":0.19688287},"labels":[],"label_agreement":null},{"id":"W2518061183","doi":"10.1109/isit.2016.7541690","title":"The maximum Han-Kobayashi sum-rate for Gaussian interference channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Interference (communication); Gaussian; Boundary (topology); Topology (electrical circuits); Power (physics); Mathematics; Channel (broadcasting); Applied mathematics; Combinatorics; Computer science; Mathematical analysis; Physics; Telecommunications","score_opus":0.023636891861508236,"score_gpt":0.2564902053497044,"score_spread":0.23285331348819616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518061183","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.014439987,0.0003798785,0.9470087,0.008208538,0.0004974931,0.00066487613,0.000021312795,0.002453523,0.02632569],"genre_scores_gemma":[0.995416,0.0005223579,0.0022933113,0.00007053731,0.00004719369,0.00023328564,0.0000022223664,0.00003008464,0.0013850211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993874,0.000028862623,0.00018372167,0.00010812578,0.000056907033,0.00023499373],"domain_scores_gemma":[0.99892354,0.00033626123,0.000024561015,0.0006280834,0.00004006094,0.00004747844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002719433,0.00011494097,0.00009887853,0.0000372403,0.00010403491,0.00007691887,0.0006026859,0.00006224409,0.00004597833],"category_scores_gemma":[0.000056728524,0.0000627041,0.000047785463,0.00006806014,0.000062769,0.00014217384,0.000086840715,0.000073674535,0.00006872022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058742244,0.00005715235,0.00019208789,0.00010217137,0.00015148873,0.0000014335372,0.0011413789,0.000043512628,0.11052177,0.30263543,0.08292428,0.50217056],"study_design_scores_gemma":[0.00050038577,0.00009527801,0.00026048222,0.00020415179,0.000010027654,0.0000039725337,0.00018618625,0.012020663,0.48318386,0.06987753,0.43314156,0.0005159117],"about_ca_topic_score_codex":0.000008161325,"about_ca_topic_score_gemma":0.00010246078,"teacher_disagreement_score":0.980976,"about_ca_system_score_codex":0.00004479815,"about_ca_system_score_gemma":0.00000817873,"threshold_uncertainty_score":0.2556999},"labels":[],"label_agreement":null},{"id":"W2518646054","doi":"10.1109/access.2016.2604618","title":"Experimental Study on Key Generation for Physical Layer Security in Wireless Communications","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":102,"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":"Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Computer science; Multipath propagation; Testbed; Decorrelation; Key generation; Wireless; Key (lock); Physical layer; Channel (broadcasting); Anechoic chamber; Randomness; Computer network; Telecommunications; Computer security; Encryption; Algorithm","score_opus":0.09424227749366394,"score_gpt":0.38039900575613295,"score_spread":0.286156728262469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518646054","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.99350876,0.000048567923,0.0041561103,0.00025829562,0.000116981464,0.00083339866,0.000023425324,0.00037815585,0.0006762964],"genre_scores_gemma":[0.9983681,0.000036045618,0.00021126155,0.00004731813,0.00011608282,0.0011630631,0.000012152473,0.000038821418,0.00000716784],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991785,0.00009846552,0.0002309827,0.00018242223,0.0001408671,0.00016871557],"domain_scores_gemma":[0.9984908,0.00019295182,0.000039434988,0.0011863905,0.00005086511,0.00003956318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016213764,0.00014637537,0.00018137082,0.00011380274,0.00008166116,0.0000690979,0.0010518094,0.000060377548,0.000006248899],"category_scores_gemma":[0.000012890767,0.00012585604,0.00004569491,0.00015243782,0.000046716632,0.00043706704,0.00013687773,0.00013539169,0.000013117919],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006477291,0.0050383382,0.0049187276,0.000033662967,0.000076212076,0.0000020075959,0.011216113,0.00028329095,0.9525288,0.012308264,0.0056229755,0.00790684],"study_design_scores_gemma":[0.0010902752,0.0002119108,0.0013928049,0.00005383582,0.000007529776,5.299128e-7,0.00021598465,0.040032905,0.95495087,0.0007793626,0.0009575485,0.00030642297],"about_ca_topic_score_codex":0.00003219359,"about_ca_topic_score_gemma":0.00021928916,"teacher_disagreement_score":0.039749615,"about_ca_system_score_codex":0.0001580929,"about_ca_system_score_gemma":0.0000104539495,"threshold_uncertainty_score":0.51322603},"labels":[],"label_agreement":null},{"id":"W2521375007","doi":"10.1109/jsac.2016.2611979","title":"Secrecy-Based Energy-Efficient Data Offloading via Dual Connectivity Over Unlicensed Spectrums","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Secrecy; Dual (grammatical number); Computer security","score_opus":0.03865880970438533,"score_gpt":0.28795919812453746,"score_spread":0.24930038842015212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521375007","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.50540066,0.0012609753,0.4789642,0.005465398,0.0006030801,0.00055647065,0.00029977364,0.0020205688,0.005428887],"genre_scores_gemma":[0.9930383,0.0010621476,0.005393358,0.00019164078,0.000100147176,0.000043380212,0.00007631845,0.000080042024,0.000014652055],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737805,0.00070542144,0.0007322067,0.00029751618,0.00041841337,0.00046836588],"domain_scores_gemma":[0.992732,0.0018184254,0.00023712598,0.0047427304,0.00027557206,0.0001941675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008799859,0.00031526017,0.00037040515,0.0006368247,0.00036938157,0.00011576859,0.0029993674,0.00019172842,0.00010206016],"category_scores_gemma":[0.00033811096,0.00027654017,0.00008115451,0.0011537453,0.00016926505,0.0003431641,0.00032542655,0.0010636594,0.000026581652],"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.0005558275,0.006659185,0.014139948,0.00011045091,0.0011198248,0.00011371666,0.0019907472,0.074909136,0.67143846,0.06984622,0.02841331,0.13070318],"study_design_scores_gemma":[0.0029808988,0.00018194912,0.014742066,0.001208229,0.00006878199,0.00022961508,0.000049404487,0.8680844,0.076522194,0.004577362,0.030103205,0.0012519184],"about_ca_topic_score_codex":0.00007462659,"about_ca_topic_score_gemma":0.00090547366,"teacher_disagreement_score":0.7931752,"about_ca_system_score_codex":0.00076535816,"about_ca_system_score_gemma":0.00019682039,"threshold_uncertainty_score":0.99996865},"labels":[],"label_agreement":null},{"id":"W2526436503","doi":"","title":"Streaming of Markov Sources over Burst Erasure Channels","year":2015,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Erasure; Computer science; Markov chain; Computer network; Machine learning; Programming language","score_opus":0.012152631301297118,"score_gpt":0.24471577070440467,"score_spread":0.23256313940310755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526436503","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.82625717,0.006711552,0.00024690633,0.000036862988,0.00028941568,0.0002927167,0.00007890146,0.0004417026,0.1656448],"genre_scores_gemma":[0.9929047,0.001578813,0.0019088549,0.0000012913366,0.000028811995,6.167225e-7,0.00029549477,0.000042572086,0.0032388242],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99917156,0.00004233432,0.00014397516,0.00016352678,0.0003161987,0.00016238473],"domain_scores_gemma":[0.99885774,0.000039932645,0.00023451445,0.0005578163,0.0002336262,0.00007638043],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001437879,0.00021931744,0.00045471385,0.00009636781,0.00005473374,0.000009717311,0.0006329496,0.00035854135,0.0021185046],"category_scores_gemma":[0.000013627492,0.00031436683,0.00013445382,0.00007258112,0.000055270008,0.00032388125,0.00007161627,0.0002172473,0.000003907218],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078467134,0.0006063151,0.0017201764,0.008555856,0.0026773214,0.000040728388,0.5160247,0.0023199324,0.05945387,0.0021289005,0.0497464,0.35594112],"study_design_scores_gemma":[0.0060357354,0.0010665833,0.365917,0.008723883,0.002078128,0.00001202898,0.46050107,0.037396066,0.05747555,0.0011577717,0.052812114,0.0068240827],"about_ca_topic_score_codex":0.039718762,"about_ca_topic_score_gemma":0.034930155,"teacher_disagreement_score":0.3641968,"about_ca_system_score_codex":0.00027370153,"about_ca_system_score_gemma":0.000055444696,"threshold_uncertainty_score":0.99993086},"labels":[],"label_agreement":null},{"id":"W2528141713","doi":"10.1002/cpe.3966","title":"Increasing secret key capacity of OFDM systems: a geometric program approach","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Key (lock); Computer science; Orthogonal frequency-division multiplexing; Randomness; Key generation; Computer network; Channel (broadcasting); Mathematics; Computer security; Encryption","score_opus":0.03330636539040255,"score_gpt":0.2998832872455095,"score_spread":0.26657692185510695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528141713","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.79076165,0.0031583973,0.20356996,0.000036876667,0.00006443243,0.00025960058,0.0000060671,0.00026459273,0.0018784413],"genre_scores_gemma":[0.9824642,0.0014301065,0.015966002,0.000011728341,0.000012697899,0.00010111526,0.00000391583,0.0000080279315,0.0000021839335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992001,0.00013111402,0.00026274042,0.00015342602,0.00013722572,0.00011536565],"domain_scores_gemma":[0.9989837,0.00053063204,0.00012378284,0.00015295691,0.00014873374,0.000060220715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031142688,0.000104305065,0.00015836318,0.000119206,0.000072077826,0.00006052864,0.000105911124,0.000059436567,0.000002097523],"category_scores_gemma":[0.0003439839,0.00008635234,0.000014221886,0.00030200527,0.00015915706,0.0008039421,0.000049689752,0.00009316657,8.966949e-7],"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.00006777846,0.0003889804,0.0046721627,0.0010193574,0.0000942802,0.0000029032315,0.035920583,0.00038710254,0.012115596,0.028411526,0.00022463338,0.9166951],"study_design_scores_gemma":[0.0046279947,0.001451962,0.021717088,0.002500618,0.00025991333,0.0015966372,0.0467511,0.79261804,0.022479136,0.002434912,0.1004737,0.0030888796],"about_ca_topic_score_codex":0.0000638544,"about_ca_topic_score_gemma":3.750841e-7,"teacher_disagreement_score":0.9136062,"about_ca_system_score_codex":0.000018083454,"about_ca_system_score_gemma":0.000013035042,"threshold_uncertainty_score":0.35213462},"labels":[],"label_agreement":null},{"id":"W2530027684","doi":"10.1109/twc.2016.2617328","title":"Optimal Relay Selection for Secure Cooperative Communications With an Adaptive Eavesdropper","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":80,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Eavesdropping; Relay; Computer science; Jamming; Secrecy; Channel (broadcasting); Computer network; Selection (genetic algorithm); Relay channel; Channel state information; Secure communication; Wireless; Telecommunications; Computer security; Encryption; Artificial intelligence","score_opus":0.03125541988931355,"score_gpt":0.27766283058701446,"score_spread":0.24640741069770092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530027684","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.03466296,0.00019213758,0.9581422,0.0021700372,0.00008570709,0.0013790953,0.00045577012,0.0019714748,0.0009405887],"genre_scores_gemma":[0.8491511,0.0017015843,0.14589582,0.000095270436,0.000023419698,0.0026982673,0.00005982279,0.00015546841,0.00021926416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978699,0.0004068771,0.00058500073,0.0004138356,0.00027199136,0.0004523773],"domain_scores_gemma":[0.99305236,0.0010010026,0.00013921627,0.0049266643,0.00066298665,0.00021774654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031043,0.00045920254,0.00041118087,0.00037380285,0.0012803864,0.000099025136,0.0025109411,0.00028926277,0.000054678192],"category_scores_gemma":[0.0000079484935,0.00038354186,0.00015586495,0.0007245392,0.0007443651,0.0007265753,0.000024439576,0.00076845067,0.000049384347],"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.0020968402,0.0071196016,0.00018799618,0.00019566364,0.0027847376,0.000002293377,0.01374055,0.38481668,0.13827595,0.12100002,0.0037361106,0.32604358],"study_design_scores_gemma":[0.0025449349,0.0020222992,0.00007685324,0.00056542613,0.00025717137,0.00005620517,0.0012256218,0.8558928,0.11770395,0.0002960223,0.017805893,0.0015528672],"about_ca_topic_score_codex":0.000056890683,"about_ca_topic_score_gemma":0.002120143,"teacher_disagreement_score":0.8144881,"about_ca_system_score_codex":0.00043339178,"about_ca_system_score_gemma":0.00013519656,"threshold_uncertainty_score":0.99986166},"labels":[],"label_agreement":null},{"id":"W2536833123","doi":"10.1109/allerton.2008.4797644","title":"Secure broadcasting : The secrecy rate region","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":48,"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":"Secrecy; Information-theoretic security; Computer science; Converse; Computer network; Broadcasting (networking); Channel (broadcasting); Upper and lower bounds; Computer security; Mathematics","score_opus":0.032100546364115495,"score_gpt":0.21349249586724026,"score_spread":0.18139194950312476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536833123","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.5657914,0.0019854533,0.18795668,0.0024314725,0.0001981764,0.00047783478,0.0000018364043,0.0069659227,0.23419118],"genre_scores_gemma":[0.9963573,0.00090567995,0.0020776512,0.00016891754,0.000043357148,0.00002152152,0.0000028943712,0.000022245851,0.00040038803],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955916,0.00004550071,0.00012926424,0.00006964382,0.00006958786,0.00012681422],"domain_scores_gemma":[0.9993523,0.00009570464,0.00001764654,0.00047470807,0.000032907083,0.000026764483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112502144,0.00008440255,0.0000742633,0.00003256537,0.0001427908,0.000016296513,0.0002975194,0.00005019299,0.000042056563],"category_scores_gemma":[0.000024089988,0.00006248096,0.000032980755,0.00015910207,0.000044624885,0.00010370064,0.000058221573,0.0002110694,0.000038709924],"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.000031902575,0.0001703082,0.010338572,0.00038051396,0.0002813625,0.0001773871,0.03733944,0.017574906,0.042813122,0.22485663,0.56096965,0.10506617],"study_design_scores_gemma":[0.0006208778,0.000058499154,0.011224985,0.0002071466,0.000023084218,0.0008118157,0.0009106355,0.31642392,0.11178958,0.0074063563,0.5493466,0.0011765044],"about_ca_topic_score_codex":0.000016839711,"about_ca_topic_score_gemma":0.000014068034,"teacher_disagreement_score":0.4305659,"about_ca_system_score_codex":0.000024592373,"about_ca_system_score_gemma":0.0000071934196,"threshold_uncertainty_score":0.25478998},"labels":[],"label_agreement":null},{"id":"W2537125279","doi":"10.1109/camsap.2007.4498007","title":"Data Extraction from Wireless Sensor Networks Using Fountain Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Fountain code; Decoding methods; Wireless sensor network; Decodes; Concatenation (mathematics); Binary number; Source code; Encoder; Channel (broadcasting); Real-time computing; Algorithm; Theoretical computer science; Computer network; Linear code; Block code; Mathematics","score_opus":0.063125657910537,"score_gpt":0.3282572543411414,"score_spread":0.2651315964306044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537125279","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.26656535,0.00023217562,0.7299378,0.000016721067,0.000115010276,0.00009177112,0.000028394401,0.0010898245,0.001922954],"genre_scores_gemma":[0.8908602,0.00021499234,0.10843189,0.000047108657,0.0001519591,0.0000019441393,0.00023886193,0.000037436606,0.000015611333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991814,0.000030279649,0.0002688355,0.00017582624,0.0001288084,0.00021484087],"domain_scores_gemma":[0.9983989,0.00024778186,0.000039695657,0.0012202242,0.000037036833,0.00005636529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004266663,0.00012725592,0.00014024464,0.00007133957,0.00006911304,0.000057889567,0.00052092184,0.00013985921,0.000085833104],"category_scores_gemma":[0.000013337543,0.00014056997,0.000021634623,0.00015499421,0.000030958778,0.00040042883,0.00016699145,0.00026402262,0.000011733112],"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.00014491726,0.0003337593,0.011507434,0.000113031616,0.0005273011,0.00008418432,0.001031353,0.14878313,0.50235957,0.010804554,0.019301826,0.30500892],"study_design_scores_gemma":[0.00008311785,0.00000301871,0.001404757,0.000028080436,0.000012802545,0.0000065295135,0.00018301223,0.9730131,0.01663287,0.00009592902,0.00834398,0.00019280153],"about_ca_topic_score_codex":0.00063136464,"about_ca_topic_score_gemma":0.00096429355,"teacher_disagreement_score":0.82422996,"about_ca_system_score_codex":0.000096640666,"about_ca_system_score_gemma":0.0000066210114,"threshold_uncertainty_score":0.5732277},"labels":[],"label_agreement":null},{"id":"W2539938992","doi":"10.1109/itw2.2006.323813","title":"Combined Source Coding and Watermarking","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digital watermarking; Independent and identically distributed random variables; Mathematics; Embedding; Coding (social sciences); Variable-length code; Channel code; Source code; Random variable; Algorithm; Dirty paper coding; Maximization; Shannon–Fano coding; Distortion (music); Discrete mathematics; Channel (broadcasting); Computer science; Decoding methods; Statistics; Telecommunications; Mathematical optimization; Image (mathematics); Artificial intelligence","score_opus":0.005460607757358552,"score_gpt":0.18695380032717995,"score_spread":0.1814931925698214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539938992","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.8468474,0.00018231869,0.065174095,0.00021017251,0.000032546497,0.00009765518,6.446306e-7,0.0026362,0.08481894],"genre_scores_gemma":[0.99559134,0.000047568577,0.004030329,0.000025366366,0.000013417304,0.0000063768084,0.000004440269,0.0000140345,0.0002671298],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997289,0.000008125299,0.00009093822,0.000046951187,0.000040548606,0.00008454588],"domain_scores_gemma":[0.9997904,0.000027350678,0.000007069047,0.00015168986,0.000008727161,0.000014805493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056493893,0.000053895223,0.000060441966,0.00003813874,0.000037089663,0.00003471814,0.0000803679,0.00002937052,0.000020521533],"category_scores_gemma":[0.0000017407431,0.00005384185,0.000009690294,0.000039831928,0.000017368386,0.0000661571,0.00004384177,0.000062081584,0.0000053571953],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015008059,0.000113275375,0.05212185,0.00040287923,0.00007678279,0.000009692165,0.0019470855,0.004764747,0.5264418,0.2738262,0.05572794,0.084552705],"study_design_scores_gemma":[0.0007002149,0.000026053434,0.019185347,0.00009352002,0.00001284495,0.000016700891,0.00012741254,0.4032026,0.4282822,0.0067380825,0.14092574,0.00068927166],"about_ca_topic_score_codex":0.000051129577,"about_ca_topic_score_gemma":0.000012970842,"teacher_disagreement_score":0.39843786,"about_ca_system_score_codex":0.000012768635,"about_ca_system_score_gemma":7.751268e-7,"threshold_uncertainty_score":0.2195607},"labels":[],"label_agreement":null},{"id":"W2542825542","doi":"10.1109/acssc.2011.6190151","title":"On the ergodic secrecy capacity of the wiretap channel under imperfect main channel estimation","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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 Toronto","funders":"","keywords":"Independent and identically distributed random variables; Upper and lower bounds; Fading; Transmitter; Ergodic theory; Channel state information; Rayleigh fading; Computer science; Secrecy; Channel (broadcasting); Information-theoretic security; Topology (electrical circuits); Channel capacity; Dirty paper coding; Telecommunications; Mathematics; Wireless; Random variable; Statistics; Computer security; Precoding; Combinatorics; MIMO","score_opus":0.04102844637795725,"score_gpt":0.22052856247501618,"score_spread":0.17950011609705893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542825542","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.8346472,0.000078737976,0.12733717,0.000737738,0.00018210176,0.0006580718,0.000015558242,0.00079092,0.035552528],"genre_scores_gemma":[0.99886626,0.000041729345,0.0007468303,0.00019422919,0.000010812252,0.00006331988,0.0000024566166,0.000026951455,0.00004742422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992462,0.000117885334,0.00020807786,0.0000996709,0.00017068093,0.00015749168],"domain_scores_gemma":[0.998834,0.00016131143,0.000055186374,0.00088554807,0.000034725974,0.000029194242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003782759,0.00014116589,0.00013202804,0.00005736328,0.00009810668,0.000012654762,0.00056839763,0.00009526469,0.00015091033],"category_scores_gemma":[0.000052775245,0.00008392082,0.000081633516,0.00020582072,0.00010838619,0.00008314383,0.00009112957,0.0002667513,0.00002178256],"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.000022460123,0.00019303027,0.00007208529,0.00014070087,0.00015070908,4.512072e-7,0.015197384,0.01486052,0.013879907,0.94893813,0.0051018256,0.0014427869],"study_design_scores_gemma":[0.0001911299,0.000068037414,0.0063684443,0.00013862635,0.000024420053,0.000007664087,0.0004142878,0.4196693,0.40694293,0.16583374,0.000043793618,0.00029761298],"about_ca_topic_score_codex":0.0002174744,"about_ca_topic_score_gemma":0.00012680062,"teacher_disagreement_score":0.7831044,"about_ca_system_score_codex":0.00006427188,"about_ca_system_score_gemma":0.0000119296155,"threshold_uncertainty_score":0.34221917},"labels":[],"label_agreement":null},{"id":"W2543489562","doi":"","title":"Ergodic Secrecy Rates of the Full-Duplex AF and DF Relay Wire-Tap Fading Channels","year":2016,"lang":"en","type":"article","venue":"European Wireless Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Relay; Ergodic theory; Secrecy; Computer science; Electronic engineering; Computer network; Telecommunications; Physics; Channel (broadcasting); Engineering; Mathematics; Computer security","score_opus":0.027071423066646682,"score_gpt":0.2365682884750939,"score_spread":0.20949686540844722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543489562","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.9784084,0.00044654807,0.013312447,0.00035062624,0.00018342315,0.00027352327,0.000019422048,0.00051781774,0.0064878208],"genre_scores_gemma":[0.9976692,0.00145196,0.00040721867,0.00003428877,0.00005380506,0.00002269531,0.0000030128367,0.00007092765,0.00028684523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985153,0.00031875636,0.00041341898,0.00026067795,0.00020717968,0.00028463872],"domain_scores_gemma":[0.9985436,0.0002056996,0.00013825149,0.0008880604,0.00013150135,0.00009284768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004008399,0.00025193687,0.000278646,0.00009143634,0.000116736854,0.00006657602,0.0009042769,0.000069718,0.00007791072],"category_scores_gemma":[0.00008538736,0.00017025127,0.000066662404,0.00020769787,0.0003083097,0.00022854477,0.00039681498,0.00025698464,0.00004543704],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023268874,0.00005540612,0.0033813687,0.000201276,0.00008203133,0.00001262336,0.0034489618,0.00040209197,0.8690831,0.032725822,0.00092500646,0.08965902],"study_design_scores_gemma":[0.002280716,0.0002440419,0.061866608,0.0044447114,0.00009818906,0.00011870456,0.0006496273,0.055873487,0.8477078,0.0008745884,0.023704488,0.0021370216],"about_ca_topic_score_codex":0.000011285056,"about_ca_topic_score_gemma":0.000015028198,"teacher_disagreement_score":0.08752199,"about_ca_system_score_codex":0.000038327016,"about_ca_system_score_gemma":0.000026131343,"threshold_uncertainty_score":0.6942645},"labels":[],"label_agreement":null},{"id":"W2547255492","doi":"10.1109/tic-sth.2009.5444414","title":"DiStributed video coding over MIMO wireless fading channels","year":2009,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; MIMO; Multipath propagation; Precoding; Wireless; Codec; Decoding methods; Bit error rate; Channel (broadcasting); Multi-user MIMO; Computer network; Electronic engineering; Algorithm; Telecommunications; Engineering","score_opus":0.015323858879974915,"score_gpt":0.25144984185928226,"score_spread":0.23612598297930734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547255492","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.46968973,0.00037072258,0.49120793,0.00093232095,0.00026729403,0.00039986614,0.00003267821,0.007569887,0.029529553],"genre_scores_gemma":[0.9976035,0.00018962266,0.0018382026,0.00017344425,0.000053572476,0.000015114151,0.000042456144,0.000024638948,0.000059487127],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.000021509719,0.0002425071,0.00014009714,0.0001438629,0.00026869774],"domain_scores_gemma":[0.99931216,0.000060890983,0.000028117242,0.000482528,0.000038641505,0.000077671066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001295287,0.00016277347,0.00018951455,0.000100901605,0.00007691544,0.0000794946,0.00036247808,0.00010512903,0.00011734992],"category_scores_gemma":[0.000016766631,0.00017381113,0.0000582884,0.00026873386,0.000020369142,0.0002577077,0.000047842164,0.00020664619,0.000030089546],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003250174,0.000327777,0.0015442909,0.00023480065,0.00021514889,0.000042733107,0.003779474,0.019930791,0.409787,0.31151822,0.14012189,0.112465374],"study_design_scores_gemma":[0.00067388604,0.00006702302,0.0051355218,0.00026546567,0.0000227196,0.00001808243,0.00014845966,0.53694797,0.40802392,0.0056484845,0.041924763,0.0011237137],"about_ca_topic_score_codex":0.000014521199,"about_ca_topic_score_gemma":0.0000057561724,"teacher_disagreement_score":0.52791375,"about_ca_system_score_codex":0.000102174134,"about_ca_system_score_gemma":0.000005218565,"threshold_uncertainty_score":0.7087812},"labels":[],"label_agreement":null},{"id":"W2547752052","doi":"10.1109/ccece.2016.7726723","title":"Estimating the steganographic capacity of band-limited channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Steganography; Covert; Channel capacity; Computer science; Probability of error; Adversary; Channel (broadcasting); Covert channel; Algorithm; Mathematics; Telecommunications; Computer security; Artificial intelligence; Embedding","score_opus":0.025288640861016176,"score_gpt":0.23214411286367426,"score_spread":0.20685547200265808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547752052","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.85217965,0.00007748651,0.14098476,0.0004744542,0.00008926408,0.00013801936,0.0000048456855,0.0008234261,0.0052281],"genre_scores_gemma":[0.99009085,0.000034498084,0.009771861,0.000024400764,0.000018210536,0.000022287759,5.9236226e-7,0.000013729924,0.000023572118],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952936,0.000033736575,0.00017767181,0.000057120033,0.00009519329,0.00010688843],"domain_scores_gemma":[0.99922353,0.00017431607,0.000032334072,0.0004975233,0.000050117647,0.00002215122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020260007,0.00007351355,0.00009801536,0.0000672862,0.00003670245,0.000010617689,0.00031964752,0.000044725835,0.000057497487],"category_scores_gemma":[0.00004231714,0.000039538616,0.000040807205,0.00018632053,0.00008417996,0.00010177569,0.000033898086,0.0000744491,0.000006387489],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011511426,0.00012254315,0.006835504,0.00031564807,0.00026989522,9.856702e-7,0.004624799,0.0050625056,0.77811974,0.091246784,0.006986116,0.10640397],"study_design_scores_gemma":[0.00023353509,0.000025935035,0.0019858736,0.00019348685,0.000011097677,0.000004479021,0.00005097668,0.05414282,0.93598133,0.005561765,0.0015912688,0.00021744099],"about_ca_topic_score_codex":0.000022805843,"about_ca_topic_score_gemma":0.000013681492,"teacher_disagreement_score":0.15786158,"about_ca_system_score_codex":0.000012069534,"about_ca_system_score_gemma":0.0000029933883,"threshold_uncertainty_score":0.1612338},"labels":[],"label_agreement":null},{"id":"W2547852178","doi":"10.1109/tcomm.2016.2625257","title":"Secure Full-Duplex Spectrum-Sharing Wiretap Networks with Different Antenna Reception Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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":"Natural Science Foundation of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering","keywords":"Jamming; Secrecy; Computer science; Beamforming; Topology (electrical circuits); Antenna (radio); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Computer network; Mathematics; Physics; Computer security","score_opus":0.021100030737998283,"score_gpt":0.23986032186122833,"score_spread":0.21876029112323003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547852178","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.058053833,0.00040677146,0.93576133,0.0023759345,0.00013717012,0.00042274143,0.000045842313,0.002042472,0.0007538796],"genre_scores_gemma":[0.98456824,0.008398134,0.006204499,0.000052913267,0.000032792974,0.00042472634,0.000024503368,0.00009781693,0.00019639694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858123,0.00011079847,0.000432424,0.0002893957,0.0002278885,0.00035826585],"domain_scores_gemma":[0.99585116,0.00028447952,0.00009167727,0.0035363974,0.0001055874,0.00013067268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001500504,0.0003346108,0.00028504693,0.00025757332,0.00048221144,0.00008303406,0.0014913051,0.0001872634,0.00020601822],"category_scores_gemma":[0.0000043702544,0.00025997887,0.00012694155,0.00045052706,0.0002612023,0.00039057015,0.000019669842,0.0006995109,0.0000579645],"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.00082365057,0.004920506,0.0021046037,0.0004177047,0.0030855674,0.000011932006,0.0075354907,0.2222284,0.30567247,0.03888777,0.0037130283,0.41059887],"study_design_scores_gemma":[0.0020714635,0.0004604737,0.0017139016,0.0017130548,0.00023196012,0.00008199619,0.00032999567,0.90866196,0.067034364,0.0009385195,0.014928266,0.0018340481],"about_ca_topic_score_codex":0.000022547398,"about_ca_topic_score_gemma":0.0009058089,"teacher_disagreement_score":0.92955685,"about_ca_system_score_codex":0.00028321805,"about_ca_system_score_gemma":0.000017784696,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2548682766","doi":"10.1109/ccece.2016.7726710","title":"Adaptive granular HARQ LDPC-based coding for secrecy enhancement in wiretap channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université Laval","funders":"","keywords":"Retransmission; Decoding methods; Computer science; Network packet; Hybrid automatic repeat request; Algorithm; Code word; Low-density parity-check code; Information leakage; Computer network; Channel (broadcasting); Coding (social sciences); Theoretical computer science; Mathematics; Statistics","score_opus":0.02817638119409757,"score_gpt":0.2532726448618741,"score_spread":0.22509626366777655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548682766","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.025422914,0.00012465696,0.9704981,0.00051900174,0.000089988964,0.00061003526,0.0000129221135,0.0006372264,0.0020851407],"genre_scores_gemma":[0.9807439,0.00011739144,0.018336697,0.00009564708,0.000023996716,0.0005103267,0.0000087407325,0.000033240358,0.00013007729],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992176,0.000028284192,0.0002478695,0.00015346208,0.0001094071,0.00024337145],"domain_scores_gemma":[0.99930525,0.00018350835,0.000028771601,0.00038126865,0.00005454514,0.000046642777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024917547,0.00014149865,0.0001791703,0.00014094455,0.00003372522,0.000017871072,0.00026173022,0.0000767015,0.00012792894],"category_scores_gemma":[0.000025520238,0.00011597927,0.000055869597,0.00011956465,0.000029149785,0.00015349849,0.000035242396,0.000073783616,0.00002059179],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020022695,0.00038543076,0.0010721141,0.00044189533,0.0001332221,0.0000072661637,0.0027714295,0.002607325,0.6756748,0.16715968,0.0076868865,0.14185971],"study_design_scores_gemma":[0.0008913675,0.000078623045,0.00010793642,0.00027859627,0.0000054446077,3.2221527e-7,0.000047940663,0.111897126,0.87713045,0.0033832174,0.0058816792,0.00029730983],"about_ca_topic_score_codex":0.000022017046,"about_ca_topic_score_gemma":0.00007888309,"teacher_disagreement_score":0.95532095,"about_ca_system_score_codex":0.00016192874,"about_ca_system_score_gemma":0.000014564299,"threshold_uncertainty_score":0.47294974},"labels":[],"label_agreement":null},{"id":"W2549473036","doi":"10.1109/allerton.2009.5394898","title":"Feedback capacity of a class of symmetric finite-state Markov channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Finite state; Class (philosophy); Markov chain; Symmetry (geometry); Markov process; State (computer science); Channel capacity; Mathematics; Topology (electrical circuits); Channel (broadcasting); Control theory (sociology); Computer science; Discrete mathematics; Combinatorics; Telecommunications; Algorithm; Statistics; Control (management); Artificial intelligence","score_opus":0.019791127826805695,"score_gpt":0.23179354529411256,"score_spread":0.21200241746730686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549473036","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.89059114,0.00046286575,0.029019373,0.00024562154,0.000078976074,0.00031361537,0.000033777844,0.0008630572,0.07839156],"genre_scores_gemma":[0.9888196,0.00030213225,0.010725576,0.0000390127,0.0000069056655,0.0000051118836,0.0000038390413,0.0000124568905,0.00008539472],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927735,0.00002967317,0.00033338915,0.000078869714,0.00014321765,0.00013747498],"domain_scores_gemma":[0.9991601,0.0001384545,0.00006554838,0.0004986136,0.00009754144,0.00003975537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017607788,0.00010421754,0.00023464653,0.00028179763,0.000011507938,0.0000071800564,0.00028878977,0.00006960611,0.000052064635],"category_scores_gemma":[0.000063267165,0.00010659154,0.00006390038,0.0006155967,0.000040650415,0.000097198994,0.000034430836,0.00013636734,0.0000065711934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014015633,0.0017574597,0.0019400361,0.0021288649,0.000527581,0.000013893015,0.0095957685,0.061641607,0.287526,0.20276855,0.027261147,0.40469894],"study_design_scores_gemma":[0.00046200305,0.00019178116,0.0053355875,0.00013410249,0.000016253618,0.000004239183,0.00006915012,0.14361171,0.83571947,0.010188881,0.0038711524,0.00039566317],"about_ca_topic_score_codex":0.00004409187,"about_ca_topic_score_gemma":0.000007997866,"teacher_disagreement_score":0.54819345,"about_ca_system_score_codex":0.000028987351,"about_ca_system_score_gemma":0.000006724326,"threshold_uncertainty_score":0.4346677},"labels":[],"label_agreement":null},{"id":"W2549737148","doi":"10.1109/lcomm.2016.2626278","title":"The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"University of Toronto","funders":"Qatar National Research Fund","keywords":"Relay; Relay channel; Computer science; Computer network; Channel state information; Gaussian; Channel (broadcasting); Topology (electrical circuits); Transmission (telecommunications); Hop (telecommunications); Telecommunications; Wireless; Mathematics; Physics","score_opus":0.018198626645912916,"score_gpt":0.23114702632383127,"score_spread":0.21294839967791834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549737148","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.3345822,0.003499514,0.3260197,0.31720152,0.00063084194,0.0022843617,0.00008594137,0.006321457,0.009374443],"genre_scores_gemma":[0.9915603,0.0036459155,0.003259269,0.0008392243,0.000034714794,0.0004514262,0.000030990093,0.00006732803,0.000110831854],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987403,0.00032091155,0.0003437376,0.00015955724,0.00015001198,0.0002854694],"domain_scores_gemma":[0.99502164,0.00074595213,0.00008612319,0.0039571933,0.00011531874,0.00007375584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041430356,0.00020808243,0.00015704709,0.00011359846,0.0006473982,0.00012919534,0.001906247,0.000083477804,0.000008320543],"category_scores_gemma":[0.000049942857,0.00012790655,0.00005082129,0.0003943951,0.00045650674,0.00036769017,0.00013758634,0.0003266904,0.00009087901],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008874143,0.00023070717,0.0009757361,0.000054204313,0.0005556503,0.0000067323767,0.0047458606,0.006679633,0.7767346,0.027876455,0.13985242,0.042199243],"study_design_scores_gemma":[0.0034827434,0.00023875575,0.011968189,0.0011841247,0.00020252446,0.00007792054,0.00055420294,0.09540698,0.24794328,0.0009953856,0.6348705,0.0030753522],"about_ca_topic_score_codex":0.000023791054,"about_ca_topic_score_gemma":0.000315658,"teacher_disagreement_score":0.6569781,"about_ca_system_score_codex":0.00015380068,"about_ca_system_score_gemma":0.000021586979,"threshold_uncertainty_score":0.5215878},"labels":[],"label_agreement":null},{"id":"W2551453762","doi":"10.1109/allerton.2012.6483230","title":"Channel capacity in the non-asymptotic regime: Taylor-type expansion and computable benchmarks","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Taylor series; Type (biology); Applied mathematics; Computable general equilibrium; Channel (broadcasting); Asymptotic expansion; Computer science; Mathematics; Mathematical analysis; Economics; Telecommunications; Geology","score_opus":0.03060262818506441,"score_gpt":0.23399987428644364,"score_spread":0.20339724610137924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551453762","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.9729419,0.00078193925,0.008269394,0.0002781391,0.00013021629,0.0002958792,0.0000011558877,0.00027880428,0.017022569],"genre_scores_gemma":[0.9971368,0.00020882995,0.0024297812,0.0001331891,0.000035600664,0.000019367186,0.000009514135,0.0000138131145,0.000013134272],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.000052021413,0.00014398381,0.00007704616,0.0001040531,0.00022320932],"domain_scores_gemma":[0.9993972,0.000100924044,0.000016773498,0.00041615003,0.000022654485,0.000046293117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004061166,0.00010697135,0.00012282675,0.00007057668,0.000051885465,0.00002920413,0.00023524913,0.000083041494,0.0000367595],"category_scores_gemma":[0.000014722684,0.00008316433,0.000015542157,0.00020808808,0.00003925189,0.00025046195,0.000075576034,0.00023491138,0.00001021443],"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.00011557644,0.0028907554,0.11894945,0.0022747521,0.00037018184,0.000021518186,0.25585383,0.04259017,0.10139407,0.123872705,0.294876,0.05679099],"study_design_scores_gemma":[0.0010393523,0.00014923989,0.11149147,0.00025283085,0.00003556847,0.00010681269,0.0033837112,0.81260324,0.043008417,0.0045307134,0.022066085,0.0013325668],"about_ca_topic_score_codex":0.0001656742,"about_ca_topic_score_gemma":0.000051387065,"teacher_disagreement_score":0.77001303,"about_ca_system_score_codex":0.00003145144,"about_ca_system_score_gemma":0.0000030700833,"threshold_uncertainty_score":0.33913428},"labels":[],"label_agreement":null},{"id":"W2552494113","doi":"10.1109/allerton.2012.6483278","title":"Non-asymptotic fixed-rate Slepian-Wolf coding theorem","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Converse; Mathematics; Discrete mathematics; Converse theorem; Shannon–Fano coding; Algorithm; Applied mathematics; Combinatorics; Variable-length code; Computer science; Decoding methods; Pure mathematics","score_opus":0.013349196820280159,"score_gpt":0.23918740020244222,"score_spread":0.22583820338216207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552494113","genre_codex":"other","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.29052284,0.00083761563,0.18297398,0.00036133893,0.0005682,0.00046346546,0.0000066754337,0.0054260236,0.51883984],"genre_scores_gemma":[0.9932219,0.00018879675,0.006024303,0.00013674759,0.00008443249,0.000031632986,0.000007527816,0.000045042492,0.00025966688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926376,0.000032768326,0.00019867536,0.000082988896,0.00009434727,0.00032747292],"domain_scores_gemma":[0.99914986,0.00010868995,0.000023338334,0.0005846687,0.000029131017,0.00010429532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003851034,0.00014358095,0.00014675208,0.000083993626,0.00006142523,0.000038002527,0.00033876768,0.00008760484,0.00035926537],"category_scores_gemma":[0.000021576174,0.00013869302,0.000049986746,0.00015616871,0.000034929955,0.00032782578,0.00009392568,0.00019756479,0.00038446183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012384536,0.00025371637,0.02492773,0.00034561177,0.00023047783,0.0000041322596,0.007195437,0.0017783938,0.1015253,0.78082925,0.056137055,0.02676048],"study_design_scores_gemma":[0.0007140621,0.000053650914,0.030074371,0.00023207361,0.000057087058,0.000030558138,0.00065389345,0.1448468,0.723459,0.0062010908,0.09197594,0.0017014637],"about_ca_topic_score_codex":0.000014395734,"about_ca_topic_score_gemma":0.000006691477,"teacher_disagreement_score":0.77462816,"about_ca_system_score_codex":0.00006206464,"about_ca_system_score_gemma":0.000004995028,"threshold_uncertainty_score":0.5655737},"labels":[],"label_agreement":null},{"id":"W2554630205","doi":"10.1109/allerton.2012.6483473","title":"Real-time coding of Gauss-Markov sources over burst erasure channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Erasure; Binary erasure channel; Algorithm; Encoder; Markov process; Computer science; Markov chain; Network packet; Gaussian; Markov model; Upper and lower bounds; Channel (broadcasting); Mathematics; Channel capacity; Telecommunications; Physics; Statistics; Computer network","score_opus":0.014353514992049258,"score_gpt":0.24662680610219567,"score_spread":0.2322732911101464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554630205","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.9082305,0.00065004406,0.0036028558,0.00008624159,0.00014006796,0.00019984492,0.000011731027,0.0016557418,0.085423],"genre_scores_gemma":[0.9939157,0.00048052456,0.005077025,0.000015936259,0.00008454883,0.000015970933,0.000009849894,0.000036708643,0.00036374922],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927247,0.0000322282,0.00022870227,0.000072444454,0.00015444748,0.00023969478],"domain_scores_gemma":[0.99927074,0.00010085679,0.000043831613,0.0004703817,0.000040208946,0.00007398117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027729492,0.00012543931,0.00019647407,0.00009777825,0.000034468827,0.000017996415,0.0002699432,0.00010069419,0.0006119529],"category_scores_gemma":[0.000018870067,0.00012370927,0.00005407462,0.00014487629,0.000038311373,0.00026202633,0.00008231264,0.00012386682,0.000046098947],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002078821,0.00027696782,0.021158079,0.0005593774,0.0002937436,0.0000013316726,0.0103751505,0.0009079466,0.8706441,0.03624747,0.053312063,0.006202979],"study_design_scores_gemma":[0.0005018851,0.00005358353,0.016282378,0.00031805778,0.000051303035,0.000011829414,0.00040156438,0.035768203,0.90885806,0.0006528682,0.036115404,0.0009848702],"about_ca_topic_score_codex":0.00007839762,"about_ca_topic_score_gemma":0.000002915747,"teacher_disagreement_score":0.085685216,"about_ca_system_score_codex":0.000036427387,"about_ca_system_score_gemma":0.000004507309,"threshold_uncertainty_score":0.6700455},"labels":[],"label_agreement":null},{"id":"W2555336608","doi":"10.1109/access.2016.2628808","title":"Joint Secure AF Relaying and Artificial Noise Optimization: A Penalized Difference-of-Convex Programming Framework","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Artificial noise; Computer science; Relay; Robustness (evolution); Semidefinite programming; Secure transmission; Mathematical optimization; Robust optimization; Optimization problem; MIMO; Convex optimization; Physical layer; Transmission (telecommunications); Wireless; Channel (broadcasting); Algorithm; Computer network; Mathematics; Regular polygon; Power (physics); Telecommunications","score_opus":0.04152872685809027,"score_gpt":0.2889733166641995,"score_spread":0.24744458980610923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555336608","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.28839377,0.00038353354,0.7093635,0.00032223304,0.00017408095,0.00033551277,0.0000074272875,0.00064228254,0.0003776785],"genre_scores_gemma":[0.9609795,0.00041415216,0.038350366,0.000028320483,0.00007232921,0.000103960585,0.0000028936702,0.000038217862,0.000010264818],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900585,0.000050429462,0.0003819074,0.0001837019,0.0001743,0.00020379087],"domain_scores_gemma":[0.9990598,0.00016846183,0.0001083355,0.0004915251,0.00009986045,0.00007202699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578941,0.00016509107,0.00026977612,0.0001261436,0.00007484165,0.00012344019,0.00041947613,0.00017088458,0.00007482875],"category_scores_gemma":[0.00009589252,0.00013380926,0.000048505844,0.00023917628,0.00010153753,0.0003525377,0.00012220095,0.00020261326,0.0000031174754],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027592108,0.00057633757,0.023686886,0.0022080066,0.00058450573,0.000042398096,0.015711417,0.039073516,0.16420537,0.046025105,0.0018401598,0.7057704],"study_design_scores_gemma":[0.0021586013,0.00021990022,0.0066965586,0.005874722,0.00020348394,0.00005159694,0.00044275346,0.22421026,0.7024979,0.050086707,0.004816637,0.00274089],"about_ca_topic_score_codex":0.000014844996,"about_ca_topic_score_gemma":0.0000072520565,"teacher_disagreement_score":0.7030295,"about_ca_system_score_codex":0.000042358268,"about_ca_system_score_gemma":0.000017519451,"threshold_uncertainty_score":0.5456583},"labels":[],"label_agreement":null},{"id":"W2557746379","doi":"10.1109/twc.2016.2633336","title":"Robust Resource Allocation to Enhance Physical Layer Security in Systems With Full-Duplex Receivers: Active Adversary","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","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":"Carleton University","funders":"Iran National Science Foundation","keywords":"Computer science; Jamming; Secrecy; Physical layer; Maximization; Transmitter; Computer network; Transmitter power output; Adversary; Artificial noise; Resource allocation; Transmission (telecommunications); Secure communication; Channel (broadcasting); Secure transmission; Computer security; Wireless; Telecommunications; Mathematical optimization; Encryption; Mathematics","score_opus":0.023433560547200874,"score_gpt":0.26384918146071007,"score_spread":0.2404156209135092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557746379","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.41618633,0.00012566766,0.5753375,0.0033717318,0.000106996944,0.0013066507,0.00019568198,0.0014237189,0.0019457075],"genre_scores_gemma":[0.9949186,0.00089638855,0.002713481,0.00006812727,0.000025385038,0.0011667162,0.000022043658,0.00009029087,0.00009896003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804795,0.00035524656,0.00045259265,0.00040266174,0.00035010488,0.00039143628],"domain_scores_gemma":[0.99573374,0.00069606706,0.000102399754,0.003089161,0.00020076103,0.00017785424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002341253,0.00035214899,0.00038874985,0.00045678325,0.00029028658,0.000058045684,0.0014952198,0.00018063605,0.000019179202],"category_scores_gemma":[0.000010532757,0.0003162769,0.00009206269,0.001018095,0.00022735969,0.00058257295,0.000022019265,0.0007122041,0.00011052846],"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.00058189686,0.0023134346,0.000049953305,0.0001716383,0.000375982,0.0000060248694,0.016835459,0.7299845,0.120272234,0.003772875,0.0014597217,0.12417627],"study_design_scores_gemma":[0.0025791829,0.000787303,0.0007141402,0.0038169478,0.00018750095,0.000046942794,0.005624255,0.5393474,0.41524154,0.00021025515,0.02857134,0.002873171],"about_ca_topic_score_codex":0.00019775213,"about_ca_topic_score_gemma":0.0016403687,"teacher_disagreement_score":0.57873225,"about_ca_system_score_codex":0.00068733026,"about_ca_system_score_gemma":0.00006183874,"threshold_uncertainty_score":0.99992895},"labels":[],"label_agreement":null},{"id":"W2564180036","doi":"10.1109/tvt.2016.2645702","title":"Minimizing Secrecy Outage Probability in Multiuser Wireless Systems With Stochastic Traffic","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Wireless; Secrecy; Wireless network; Scheduling (production processes); Computer network; Reliability (semiconductor); Channel (broadcasting); Mathematical optimization; Distributed computing; Computer security; Telecommunications; Mathematics","score_opus":0.01183439360668706,"score_gpt":0.21203275788973022,"score_spread":0.20019836428304316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564180036","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.5216677,0.00008707336,0.4755396,0.00023385382,0.000081368045,0.0005041483,0.000013660312,0.0018479134,0.000024672849],"genre_scores_gemma":[0.9969946,0.00007218788,0.0020130395,0.000009078051,0.00000742911,0.0008046978,0.0000013702244,0.00007481485,0.000022765316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985317,0.00008039166,0.0004187659,0.00037574934,0.00019366948,0.00039971614],"domain_scores_gemma":[0.9986355,0.00014100612,0.000055357938,0.0010257977,0.00007988046,0.000062487874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019576153,0.00029391827,0.0003860705,0.00071911485,0.000082791834,0.000022368318,0.00047210674,0.00045146898,0.000013075088],"category_scores_gemma":[0.000008321165,0.00023165991,0.00006577806,0.0007091075,0.00023845249,0.00017150957,0.000003613127,0.00059077685,0.000031097716],"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.00007570747,0.00049072894,0.00007686321,0.00020086809,0.00014303855,0.000037913298,0.0004710024,0.87756467,0.045122325,0.0013257737,0.0000124363005,0.074478656],"study_design_scores_gemma":[0.0050066034,0.0006912035,0.00018885078,0.002636601,0.00012490229,0.00027481635,0.0009553668,0.74259955,0.24354586,0.0006841186,0.0012014485,0.0020906748],"about_ca_topic_score_codex":0.000020205784,"about_ca_topic_score_gemma":0.0003216064,"teacher_disagreement_score":0.4753269,"about_ca_system_score_codex":0.00025095994,"about_ca_system_score_gemma":0.000030900177,"threshold_uncertainty_score":0.9446817},"labels":[],"label_agreement":null},{"id":"W2565469751","doi":"10.1016/j.phycom.2016.12.001","title":"Cognitive radio network with secrecy and interference constraints","year":2016,"lang":"en","type":"article","venue":"Physical Communication","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"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; Cognitive radio; Secrecy; Interference (communication); Co-channel interference; Computer network; Telecommunications; Computer security; Wireless; Channel (broadcasting)","score_opus":0.016083350681746864,"score_gpt":0.24961991300952108,"score_spread":0.2335365623277742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565469751","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.8284027,0.00079868705,0.14939548,0.000787677,0.000018183306,0.00040200044,0.000018858604,0.0011312499,0.019045198],"genre_scores_gemma":[0.99661624,0.0006984868,0.0025179805,0.00002911159,0.00002505203,0.0000696986,0.00001289565,0.000020924519,0.000009583537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994671,0.00010513808,0.00011409429,0.00010329535,0.00007558083,0.00013484269],"domain_scores_gemma":[0.99874574,0.0005347318,0.000036962865,0.0005575241,0.00007237091,0.000052652467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009778828,0.00011349471,0.00014171287,0.000024458242,0.00007354352,0.000027746612,0.0003048816,0.00003601803,0.000015033911],"category_scores_gemma":[0.000026073707,0.00008236517,0.000017697548,0.00010769868,0.00038817982,0.0002144819,0.00013075164,0.00017166605,0.00001661345],"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.00010240282,0.000202537,0.0037632827,0.00007081779,0.00020293354,0.0000012482259,0.004028138,0.000088166315,0.01584526,0.1857653,0.00082170404,0.7891082],"study_design_scores_gemma":[0.012309591,0.0019850596,0.1599773,0.015648538,0.00056544616,0.00020193512,0.003069,0.15029848,0.20338231,0.43187487,0.014029996,0.006657464],"about_ca_topic_score_codex":0.0000054716756,"about_ca_topic_score_gemma":0.000017196517,"teacher_disagreement_score":0.78245074,"about_ca_system_score_codex":0.000032639313,"about_ca_system_score_gemma":0.000008115919,"threshold_uncertainty_score":0.33587542},"labels":[],"label_agreement":null},{"id":"W2568383335","doi":"10.1109/tit.2012.2218215","title":"On the Capacity of the $K$-User Cyclic Gaussian Interference Channel","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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 Toronto","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Computer science; Topology (electrical circuits); Algorithm; Combinatorics; Mathematics; Physics; Telecommunications","score_opus":0.01632402139219326,"score_gpt":0.21589665316033885,"score_spread":0.19957263176814558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568383335","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.10821981,0.000015397058,0.87255955,0.00035423605,0.0005637843,0.0003567669,0.00004791545,0.00036313184,0.017519418],"genre_scores_gemma":[0.99937993,0.000037611193,0.00009155064,0.00033135654,0.000010658315,0.00009977785,0.0000013492208,0.000010828388,0.00003692961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992579,0.00012271391,0.0002792127,0.000034036715,0.00016002284,0.00014606814],"domain_scores_gemma":[0.998931,0.0002705345,0.000078858946,0.0006419645,0.000042487918,0.00003514035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044197604,0.000116166746,0.000090175454,0.00011166678,0.00015917212,0.000022341672,0.0004341611,0.00007776355,0.00014289346],"category_scores_gemma":[0.000015903364,0.00007342372,0.00008377886,0.00020860016,0.000111776855,0.0006696949,0.0000028584986,0.0003952131,0.00011075217],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000974474,0.0002788923,0.00001708185,0.00017932469,0.00017878892,2.6312874e-8,0.04384579,0.04790402,0.003162696,0.8740355,0.0024258383,0.027874643],"study_design_scores_gemma":[0.00032771548,0.000071590664,0.0010571792,0.00029471904,0.00004238178,0.000008778127,0.0021376247,0.011862211,0.95981973,0.018432878,0.0055362647,0.00040894514],"about_ca_topic_score_codex":0.0000070743627,"about_ca_topic_score_gemma":0.000004798313,"teacher_disagreement_score":0.956657,"about_ca_system_score_codex":0.000063281535,"about_ca_system_score_gemma":0.0000075619832,"threshold_uncertainty_score":0.29941323},"labels":[],"label_agreement":null},{"id":"W2571711166","doi":"10.1049/iet-com.2016.0617","title":"Non‐linear transceiver design for secure communications with artificial noise‐assisted MIMO relay","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Artificial noise; Relay; Computer science; MIMO; Precoding; Transceiver; Mathematical optimization; Relay channel; Physical layer; Channel (broadcasting); Relaxation (psychology); Power (physics); Mathematics; Telecommunications; Wireless","score_opus":0.09101922775802859,"score_gpt":0.3226872621371945,"score_spread":0.23166803437916592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571711166","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.0132714445,0.0024366025,0.9153733,0.025825258,0.00022570764,0.0049733813,0.0005918059,0.003418522,0.03388398],"genre_scores_gemma":[0.69873744,0.0012977725,0.29833195,0.000071692164,0.00003161487,0.0011105302,0.00023402004,0.00009201257,0.000092961345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984582,0.00016965657,0.00055601535,0.00024897602,0.00020572326,0.00036144897],"domain_scores_gemma":[0.9845161,0.0006062265,0.00024153339,0.014099488,0.00040213598,0.00013453155],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053318404,0.00031833324,0.0003741271,0.00015589275,0.0023068087,0.00025677506,0.0072237686,0.00024338199,0.000020135749],"category_scores_gemma":[0.00008242188,0.00033365516,0.00016077196,0.00020626302,0.00085862115,0.0005261758,0.00047721437,0.0007245361,0.000048121554],"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.0012175309,0.008478703,0.005190032,0.0014754377,0.0049707047,0.000015849986,0.058293376,0.037973356,0.2207602,0.33161452,0.1474347,0.1825756],"study_design_scores_gemma":[0.002118083,0.00029917632,0.007332112,0.0005644079,0.00045172466,0.000034590703,0.0008731515,0.6684445,0.020444704,0.0046575977,0.2930069,0.0017730766],"about_ca_topic_score_codex":0.00008153275,"about_ca_topic_score_gemma":0.000977143,"teacher_disagreement_score":0.685466,"about_ca_system_score_codex":0.00013386592,"about_ca_system_score_gemma":0.000102285565,"threshold_uncertainty_score":0.99991155},"labels":[],"label_agreement":null},{"id":"W2581580340","doi":"10.1155/2017/7206187","title":"Physical Layer Authentication Enhancement Using Maximum SNR Ratio Based Cooperative AF Relaying","year":2017,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Defence Research and Development Canada; Western University","funders":"","keywords":"Computer science; Relay; Computer network; Physical layer; Authentication (law); Spoofing attack; Transmitter; Maximal-ratio combining; Transmission (telecommunications); Channel (broadcasting); Wireless network; Wireless; Macrocell; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Fading; Power (physics); Base station","score_opus":0.040576279678649525,"score_gpt":0.3212144891352171,"score_spread":0.2806382094565676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581580340","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.7840701,0.00070678693,0.21257664,0.00022058148,0.00008099766,0.0005619415,0.000008951123,0.00041679677,0.0013572511],"genre_scores_gemma":[0.976715,0.00048440276,0.022431504,0.000044182238,0.000050822982,0.00015753614,0.00004889795,0.000053045977,0.000014568747],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868876,0.00015807411,0.00042107055,0.0002708726,0.00017806675,0.0002831535],"domain_scores_gemma":[0.9960216,0.00025052452,0.00023854575,0.0031908574,0.00020622062,0.00009219458],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036835828,0.00025603667,0.00031914428,0.00011119582,0.0019484138,0.00041691947,0.0013733663,0.00010028117,0.000009840519],"category_scores_gemma":[0.000034051278,0.00028561582,0.00007101519,0.00012203398,0.00035269646,0.0003856104,0.00083890295,0.00043108326,0.000009438088],"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.00002532769,0.0010953342,0.0031342283,0.00039964495,0.00030725315,0.0000037378472,0.01753215,0.048792936,0.57472265,0.032190785,0.0002457575,0.3215502],"study_design_scores_gemma":[0.000308554,0.00003298324,0.00044773947,0.00021800799,0.000030108175,0.0000030943722,0.00028231653,0.9688813,0.027394999,0.00021588603,0.0018752773,0.00030974607],"about_ca_topic_score_codex":0.000068781526,"about_ca_topic_score_gemma":0.000023182634,"teacher_disagreement_score":0.92008835,"about_ca_system_score_codex":0.00013459618,"about_ca_system_score_gemma":0.000046852583,"threshold_uncertainty_score":0.9999596},"labels":[],"label_agreement":null},{"id":"W2584926063","doi":"10.1109/glocom.2016.7842142","title":"Physical Layer Secure Information Exchange Protocol for MIMO Ad Hoc Networks against Passive Attacks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Physical layer; Relay; MIMO; Wireless ad hoc network; Channel (broadcasting); Transmission (telecommunications); Protocol (science); Cryptography; Relay channel; Computer security; Wireless; Telecommunications","score_opus":0.019744693566047543,"score_gpt":0.2901261689164199,"score_spread":0.2703814753503724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584926063","genre_codex":"methods","genre_gemma":"protocol","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.003350282,0.00003588511,0.8319888,0.0012386537,0.000096772514,0.14410508,0.00005955243,0.0033991346,0.015725821],"genre_scores_gemma":[0.34979805,0.00009717097,0.0077666026,0.000416619,0.00022721959,0.6413906,0.00005399115,0.00006185948,0.00018787153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992897,0.000022169808,0.00023359935,0.00009360135,0.00012313561,0.00023778812],"domain_scores_gemma":[0.99917525,0.000114141345,0.00006306473,0.000450981,0.0001330848,0.000063501764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008104146,0.00016658597,0.00015896733,0.00006833928,0.000055802706,0.00004674313,0.00028263143,0.00013730675,0.000050210176],"category_scores_gemma":[0.000021745,0.00011886628,0.00007876188,0.000106241336,0.000029987785,0.00073813373,0.00008074955,0.00012547846,0.000048482038],"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.0000666985,0.00009068857,0.000037645765,0.00038330923,0.00006414552,4.668693e-7,0.0017697909,0.0008968986,0.0027147124,0.005460639,0.22335489,0.76516014],"study_design_scores_gemma":[0.0010415945,0.0000740311,0.00008059054,0.00015113546,0.0000048170546,6.8499634e-7,0.00004655264,0.09132394,0.017471528,0.0004263738,0.8890694,0.0003093744],"about_ca_topic_score_codex":7.0867424e-7,"about_ca_topic_score_gemma":0.000015148242,"teacher_disagreement_score":0.8242222,"about_ca_system_score_codex":0.00008759998,"about_ca_system_score_gemma":0.000010499411,"threshold_uncertainty_score":0.48472264},"labels":[],"label_agreement":null},{"id":"W2588149931","doi":"10.1109/access.2017.2667882","title":"Secrecy Energy Efficiency Maximization in Cognitive Radio Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":48,"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 à Trois-Rivières; Concordia University","funders":"China Postdoctoral Science Foundation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Mathematical optimization; Maximization; Cognitive radio; Utility maximization problem; Quality of service; Transmitter power output; Fractional programming; Convex optimization; Wireless; Mathematics; Regular polygon; Telecommunications; Transmitter","score_opus":0.032200390732275395,"score_gpt":0.3063281055353455,"score_spread":0.27412771480307013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588149931","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.17617226,0.0004845209,0.804302,0.000055427445,0.00035086853,0.00015378413,0.0000041969797,0.00050572923,0.01797121],"genre_scores_gemma":[0.99881214,0.0007544185,0.0001771298,0.000046479512,0.0000728718,0.00006527588,0.000015290678,0.00002730537,0.00002910975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993806,0.000032915603,0.00018217858,0.00013131001,0.00009445204,0.00017853576],"domain_scores_gemma":[0.99919784,0.00006594756,0.000068589456,0.0005759726,0.000054192664,0.000037435686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012372265,0.00011053317,0.00013708205,0.00011124613,0.00013179869,0.00025339436,0.0009803891,0.00010531642,0.000031367344],"category_scores_gemma":[0.000044400884,0.00012637269,0.000025862033,0.00012311141,0.000055866152,0.0006417846,0.00010829118,0.00016644876,0.0000032014411],"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.000076358614,0.00039813243,0.078975655,0.00014633888,0.00012340661,0.000070736794,0.0019641644,0.55307287,0.0016083003,0.018254925,0.005761945,0.3395472],"study_design_scores_gemma":[0.00063286023,0.000016463595,0.03621321,0.0002297581,0.000011440467,0.000004723749,0.000021931352,0.9267059,0.031790044,0.0028258523,0.0011086565,0.00043914755],"about_ca_topic_score_codex":0.00024673078,"about_ca_topic_score_gemma":0.00033706072,"teacher_disagreement_score":0.8226399,"about_ca_system_score_codex":0.000051886756,"about_ca_system_score_gemma":0.000010052463,"threshold_uncertainty_score":0.5153329},"labels":[],"label_agreement":null},{"id":"W2591260756","doi":"10.1109/cns.2016.7860534","title":"Robust and secure beamformer design for MIMO relaying with imperfect eavesdropper CSI","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Beamforming; Computer science; MIMO; Relay; Artificial noise; Physical layer; Node (physics); Signal-to-noise ratio (imaging); Channel (broadcasting); Mathematical optimization; Computer network; Wireless; Telecommunications; Mathematics; Engineering; Power (physics)","score_opus":0.02768781403102748,"score_gpt":0.2228138383688331,"score_spread":0.1951260243378056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591260756","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.07623373,0.0002922735,0.91894454,0.0003271512,0.000020362684,0.0004536247,0.000004653356,0.000845406,0.0028782343],"genre_scores_gemma":[0.7927284,0.00021028402,0.20661704,0.00004698297,0.000018186307,0.00012916306,0.000001643263,0.000046488938,0.00020175701],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942183,0.000019134497,0.00013776266,0.0001408537,0.000075890865,0.00020450892],"domain_scores_gemma":[0.999308,0.00021460894,0.000020462894,0.00034838796,0.000049052527,0.000059469436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017832905,0.00014367989,0.0001393746,0.00006683618,0.00007098963,0.000030159055,0.00015267117,0.000088812405,0.00003913762],"category_scores_gemma":[0.000019295438,0.0000884271,0.0000267718,0.000070572685,0.00004798669,0.00018449286,0.000036039797,0.00008232991,0.0000062360546],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004977158,0.00020696098,0.010474393,0.0008755608,0.0009401747,0.000008680928,0.0069524357,0.013886653,0.6428516,0.080969825,0.08399144,0.15834458],"study_design_scores_gemma":[0.0058818823,0.0013555598,0.002185928,0.0012984477,0.00018443298,0.00020703932,0.0008601084,0.0990798,0.75651574,0.005163232,0.124132715,0.0031350956],"about_ca_topic_score_codex":0.000005895224,"about_ca_topic_score_gemma":0.000018223102,"teacher_disagreement_score":0.71649474,"about_ca_system_score_codex":0.000042188512,"about_ca_system_score_gemma":0.000012177912,"threshold_uncertainty_score":0.36059526},"labels":[],"label_agreement":null},{"id":"W2593532667","doi":"10.1155/2017/7843843","title":"A Novel Secure Transmission Scheme in MIMO Two-Way Relay Channels with Physical Layer Approach","year":2017,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Encryption; MIMO; Transmission (telecommunications); Precoding; Algorithm; Physical layer; Secure transmission; Artificial noise; Computer network; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.017416615914933802,"score_gpt":0.2528230382034693,"score_spread":0.2354064222885355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593532667","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.57582515,0.0002426176,0.3772185,0.000066711786,0.00024951372,0.002515818,0.00004175144,0.0013343913,0.0425055],"genre_scores_gemma":[0.9949973,0.000023936984,0.00380932,0.000012611789,0.00006307338,0.00097371434,0.000059079284,0.000026876858,0.000034051645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891406,0.000027198625,0.0004243308,0.00011057904,0.00030282527,0.00022097936],"domain_scores_gemma":[0.99873406,0.000024151981,0.00017607003,0.0008925525,0.000099291465,0.00007389385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030973207,0.00019913942,0.00028398033,0.00017115884,0.00015695527,0.00032698218,0.00054047664,0.00013049449,0.0000033068047],"category_scores_gemma":[0.000008940276,0.00017084778,0.00004705902,0.00013708914,0.00004637052,0.0020125413,0.000054362026,0.0003386036,0.000039939554],"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.00010586477,0.00049665937,0.0011317293,0.0027562403,0.00014687434,0.0000037453824,0.064199984,0.8687846,0.021838209,0.016727133,0.001972514,0.02183643],"study_design_scores_gemma":[0.0010530744,0.000043398737,0.00027184977,0.00035373977,0.000004975329,0.000024486935,0.0007593703,0.9460059,0.004587195,0.000007965482,0.046573848,0.00031420775],"about_ca_topic_score_codex":0.00015759711,"about_ca_topic_score_gemma":0.000005444157,"teacher_disagreement_score":0.41917217,"about_ca_system_score_codex":0.000102798534,"about_ca_system_score_gemma":0.000018502917,"threshold_uncertainty_score":0.69669706},"labels":[],"label_agreement":null},{"id":"W2596303574","doi":"","title":"Non-Cryptography Authentication for Wireless Communications Based on Two Uncorrelated Attributes","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer and Internet Security","topic":"Wireless Communication Security Techniques","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":"Université Laval; Western University","funders":"","keywords":"Spoofing attack; Computer science; Transmitter; Physical layer; Authentication (law); Wireless; Computer network; Cryptography; Channel (broadcasting); Computer security; Telecommunications","score_opus":0.012284990889807517,"score_gpt":0.2649545303839524,"score_spread":0.2526695394941449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596303574","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.37856543,0.00022856166,0.61725867,0.0019380483,0.0008768269,0.00039350725,0.00003126525,0.00015376252,0.0005539251],"genre_scores_gemma":[0.98057234,0.0002022511,0.018633477,0.0003176932,0.00015181114,0.00003991729,0.000056275658,0.000022414179,0.0000037890836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889207,0.00004990042,0.00055589486,0.00011169327,0.00025874775,0.00013168635],"domain_scores_gemma":[0.9981508,0.0003148844,0.00021301313,0.00037974282,0.0008509863,0.0000905329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025397848,0.00016333992,0.0002224774,0.00035828308,0.00003866954,0.00018546394,0.0011318226,0.00007695737,0.00003416569],"category_scores_gemma":[0.000016647396,0.00015679818,0.00015130133,0.00010629936,0.0000994677,0.00035863425,0.0001329202,0.00033478905,0.000008883394],"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.00085734687,0.006040641,0.045545228,0.0005410416,0.0057830275,0.000026581367,0.021677017,0.016700523,0.013118798,0.2079334,0.29014355,0.39163285],"study_design_scores_gemma":[0.0010882128,0.00017251275,0.003395648,0.00022235124,0.000021917129,0.000020187437,0.00002163116,0.9789216,0.0028307412,0.007194606,0.005940049,0.00017057291],"about_ca_topic_score_codex":0.000033989272,"about_ca_topic_score_gemma":0.000008182374,"teacher_disagreement_score":0.962221,"about_ca_system_score_codex":0.00007542431,"about_ca_system_score_gemma":0.00001904077,"threshold_uncertainty_score":0.6394044},"labels":[],"label_agreement":null},{"id":"W2598134248","doi":"10.1007/978-3-319-62389-4_17","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Generalization; Function (biology); Theoretical computer science; Mathematics","score_opus":0.02730523446569865,"score_gpt":0.25464198189135845,"score_spread":0.2273367474256598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598134248","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.011203756,0.00046078296,0.9842488,0.0008754614,0.00028178078,0.00062753283,0.000014477116,0.000103899656,0.0021835165],"genre_scores_gemma":[0.9775855,0.0000740293,0.021994997,0.0002998507,0.000024058463,0.0000065911945,0.000004074695,0.000006961968,0.000003950768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992501,0.000027068116,0.00024348713,0.00012891144,0.00022791966,0.0001225244],"domain_scores_gemma":[0.99889946,0.00014937177,0.00014812476,0.00072537706,0.000059641705,0.000018036748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499893,0.00014942454,0.00017088998,0.00014569549,0.00016003306,0.00014693168,0.0007945153,0.00010599718,0.0000016380753],"category_scores_gemma":[0.00005346944,0.00009972805,0.000023042088,0.00007331551,0.0008920332,0.00040259658,0.00037432063,0.0004962842,6.3885994e-7],"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.000012352638,0.000024776435,0.0025207286,0.00041537045,0.000016716209,0.0000010626846,0.01943929,0.017181605,0.00062627485,0.0271031,0.00011207183,0.9325467],"study_design_scores_gemma":[0.0004001245,0.000040285915,0.02403444,0.0005865558,0.000011123547,0.000024537827,0.000004297702,0.8933618,0.001953626,0.073825054,0.005410712,0.0003474261],"about_ca_topic_score_codex":0.00004647081,"about_ca_topic_score_gemma":0.0003848828,"teacher_disagreement_score":0.9663817,"about_ca_system_score_codex":0.000043167296,"about_ca_system_score_gemma":0.000027170334,"threshold_uncertainty_score":0.40667918},"labels":[],"label_agreement":null},{"id":"W2598183357","doi":"10.1109/vtcfall.2016.7881036","title":"Hybrid Digital-Analog Communication of a Bivariate Gaussian Source over a Fading MAC","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Manitoba","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Channel state information; Gaussian; Bivariate analysis; Decoding methods; Channel (broadcasting); Algorithm; Coding (social sciences); Electronic engineering; Wireless; Mathematics; Telecommunications; Statistics; Engineering; Physics","score_opus":0.01049256804296327,"score_gpt":0.2273523995437463,"score_spread":0.21685983150078303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598183357","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.28646618,0.0005314489,0.58797467,0.0010948711,0.000043478492,0.00036321944,0.000062495485,0.0027039673,0.120759666],"genre_scores_gemma":[0.99493283,0.00027872637,0.0042032595,0.000029097917,0.000007883529,0.000019524683,0.000010969215,0.000035053978,0.0004826448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928075,0.000034315766,0.00030998973,0.00009778828,0.00012657265,0.00015060866],"domain_scores_gemma":[0.9986016,0.00016419019,0.00006832474,0.0010735331,0.00004410131,0.000048214086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014498472,0.00011771096,0.00017421634,0.000131781,0.000035874607,0.000039615432,0.00053148967,0.000048854956,0.00018602662],"category_scores_gemma":[0.000040754087,0.00009114153,0.000064707725,0.000116273266,0.000068949696,0.0003750721,0.00017448008,0.0000935723,0.000040930812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005176667,0.0003603862,0.010877328,0.0003488496,0.00065750803,0.0000047698513,0.0037469133,0.00092905085,0.23212726,0.2589829,0.0346178,0.45729545],"study_design_scores_gemma":[0.0025364375,0.0001408298,0.011200237,0.0014980698,0.00009981021,0.00005464337,0.0002792136,0.07564956,0.5998709,0.05912005,0.2475005,0.0020497523],"about_ca_topic_score_codex":0.00004577117,"about_ca_topic_score_gemma":0.000012142457,"teacher_disagreement_score":0.70846665,"about_ca_system_score_codex":0.000059655795,"about_ca_system_score_gemma":0.0000076270626,"threshold_uncertainty_score":0.3716644},"labels":[],"label_agreement":null},{"id":"W2598653415","doi":"10.1007/s11042-017-4635-8","title":"A joint correlation noise estimation and decoding algorithm for distributed video coding","year":2017,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Queensland Cyber Infrastructure Foundation","keywords":"Computer science; Decoding methods; Algorithm; Codec; Coding (social sciences); Mathematics; Statistics; Telecommunications","score_opus":0.033750701977782155,"score_gpt":0.2830928958208927,"score_spread":0.24934219384311054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598653415","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.0047058756,0.00018299274,0.99320173,0.00025299663,0.000030641335,0.00083480944,0.0003036206,0.0003068676,0.00018045999],"genre_scores_gemma":[0.70325536,0.00043016576,0.29456478,0.000011369925,0.00005299185,0.0012705753,0.00038714375,0.000019314602,0.000008310893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994598,0.00000734289,0.00020403559,0.00014978545,0.00005924128,0.00011980051],"domain_scores_gemma":[0.9991943,0.0001827231,0.00009238439,0.00040040808,0.000060384707,0.000069754926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014281849,0.00010643572,0.00013289941,0.000044704797,0.00054312404,0.0002620135,0.0001353962,0.00007872292,0.0000030065198],"category_scores_gemma":[0.00010290515,0.0001182639,0.000023993873,0.00003632684,0.000077007935,0.00035463064,0.00006562604,0.00009679049,0.0000035341607],"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":[9.966188e-7,0.000013294883,0.00021037868,0.00003892343,0.000010982782,6.7564045e-8,0.00014753705,0.00033053226,0.002501385,0.002448905,0.00024297994,0.994054],"study_design_scores_gemma":[0.0003009459,0.0000062699964,0.008311725,0.00003688775,0.000018735127,0.0000023594746,0.000026865446,0.98228407,0.0026484148,0.0013755733,0.004853358,0.00013477902],"about_ca_topic_score_codex":0.0000123220125,"about_ca_topic_score_gemma":0.000007011654,"teacher_disagreement_score":0.99391925,"about_ca_system_score_codex":0.000033899953,"about_ca_system_score_gemma":0.0000062138815,"threshold_uncertainty_score":0.48226622},"labels":[],"label_agreement":null},{"id":"W2601472403","doi":"10.1109/vtcfall.2016.7881217","title":"Secrecy Performance of Dual-Hop Threshold Relaying System with Diversity Reception","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Relay; Secrecy; Computer science; Ergodic theory; Channel state information; Signal-to-noise ratio (imaging); Computer network; Maximal-ratio combining; Hop (telecommunications); Diversity gain; Channel (broadcasting); Outage probability; Wireless; Topology (electrical circuits); Telecommunications; Fading; Mathematics; Physics; Electrical engineering; Computer security; Engineering; Power (physics)","score_opus":0.020279885832005504,"score_gpt":0.2159029881624554,"score_spread":0.19562310233044988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601472403","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.89319474,0.00020808718,0.0535855,0.00003868759,0.00017164208,0.00042432675,0.000024666599,0.0022131866,0.050139178],"genre_scores_gemma":[0.9947874,0.0007325792,0.0042124838,0.000004718523,0.00003793064,0.000044611617,0.000026286209,0.000043320684,0.00011069806],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998955,0.000036286325,0.00032961037,0.00022349715,0.00028530962,0.00017029193],"domain_scores_gemma":[0.998466,0.00003866566,0.00014719124,0.0011430142,0.00015634681,0.00004876322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011244,0.00024038092,0.0003532233,0.00016681965,0.00010169843,0.000020994858,0.00052367005,0.00031227537,0.000041652205],"category_scores_gemma":[0.000004082939,0.00019531713,0.00006853082,0.000100020334,0.000059403843,0.00018049504,0.0015910697,0.00051142654,0.00001922212],"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.0008007129,0.00043891897,0.4741485,0.06269181,0.0030024217,0.000040755676,0.022370588,0.12243891,0.035106365,0.22404408,0.01184416,0.043072782],"study_design_scores_gemma":[0.0032716142,0.0007136667,0.044384424,0.050027065,0.0005821292,0.00014145387,0.0031355591,0.5729334,0.31206968,0.0036449933,0.0023999226,0.0066961353],"about_ca_topic_score_codex":0.00005870334,"about_ca_topic_score_gemma":0.000020022451,"teacher_disagreement_score":0.45049444,"about_ca_system_score_codex":0.000297852,"about_ca_system_score_gemma":0.00002394042,"threshold_uncertainty_score":0.7964802},"labels":[],"label_agreement":null},{"id":"W2611822227","doi":"10.48550/arxiv.1705.01596","title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Channel (broadcasting); Upper and lower bounds; Markov chain; Noise (video); Control theory (sociology); Markov process; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Combinatorics; Physics; Statistics","score_opus":0.06700782821878426,"score_gpt":0.1967173244308889,"score_spread":0.12970949621210465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611822227","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.97918135,0.00024112355,0.017486388,0.000038007387,0.00007091317,0.00044844902,0.000068483365,0.00030959037,0.0021557247],"genre_scores_gemma":[0.9971148,0.0018586998,0.0007943823,0.000007798062,0.000024178635,0.0000029561454,0.000016092772,0.000041676987,0.00013942964],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991382,0.000052044838,0.00015121387,0.00040082488,0.00006768326,0.00019008295],"domain_scores_gemma":[0.9982796,0.000040274837,0.00019046638,0.0012104879,0.00015394497,0.00012526248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015671802,0.0003006409,0.0004534361,0.00017199489,0.00011497653,0.00007227725,0.0006067429,0.0003220445,0.0000059722865],"category_scores_gemma":[0.0000174067,0.00033683897,0.000046568442,0.00009216167,0.0004467973,0.00021244168,0.0006428655,0.0006267131,0.0000020192706],"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.0005721213,0.00043342155,0.61918634,0.0075836764,0.0024024786,0.0001422468,0.008984463,0.29572028,0.0039878758,0.054605123,0.00086191256,0.005520065],"study_design_scores_gemma":[0.0064629815,0.00047070137,0.15611836,0.0066131996,0.001274204,0.00010881363,0.0008915692,0.756287,0.026064754,0.034014728,0.006211088,0.005482606],"about_ca_topic_score_codex":0.00029540338,"about_ca_topic_score_gemma":0.00019764587,"teacher_disagreement_score":0.46306795,"about_ca_system_score_codex":0.00008562235,"about_ca_system_score_gemma":0.00003413163,"threshold_uncertainty_score":0.9999084},"labels":[],"label_agreement":null},{"id":"W2617309511","doi":"10.1109/tcomm.2017.2708110","title":"Joint Transceiver Design for Secure Downlink Communications Over an Amplify-and-Forward MIMO Relay","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Relay; Artificial noise; Telecommunications link; Computer science; Beamforming; Base station; Transceiver; MIMO; Mathematical optimization; Constraint (computer-aided design); Covariance matrix; Computer network; Wireless; Power (physics); Algorithm; Mathematics; Telecommunications; Physical layer","score_opus":0.09634926893443778,"score_gpt":0.326003359148615,"score_spread":0.2296540902141772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617309511","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.0022119281,0.001023909,0.9855363,0.0044640573,0.00019572466,0.0016372752,0.00057101506,0.001429462,0.0029303655],"genre_scores_gemma":[0.83914214,0.009655983,0.14927317,0.00014922193,0.000022021935,0.0014259192,0.00009625801,0.00011074655,0.00012452646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813175,0.00031817151,0.0006297659,0.00033595433,0.00021115529,0.00037318887],"domain_scores_gemma":[0.9867676,0.0007198657,0.0001838218,0.011883937,0.00021428707,0.0002304706],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00063478627,0.0003800835,0.0004102949,0.00028004166,0.003116861,0.00035233118,0.004262472,0.00035568798,0.000050634746],"category_scores_gemma":[0.00002854004,0.00043539854,0.00021581052,0.00015324935,0.00078518066,0.0009089598,0.000037849204,0.001135077,0.00003173181],"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.0006371429,0.009569455,0.00021016721,0.0010859667,0.0038947447,0.000005481892,0.045237564,0.12559935,0.09029261,0.17011791,0.021640018,0.53170955],"study_design_scores_gemma":[0.0032031743,0.0005246233,0.0018736531,0.00045424514,0.0006344697,0.000039650073,0.00067809277,0.7571913,0.029508576,0.010052646,0.19370739,0.0021321818],"about_ca_topic_score_codex":0.00013169339,"about_ca_topic_score_gemma":0.0009713602,"teacher_disagreement_score":0.8369302,"about_ca_system_score_codex":0.00015666295,"about_ca_system_score_gemma":0.00006177409,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2682285226","doi":"10.1109/ccece.2017.7946837","title":"Nash equilibria of deception strategies in the IEEE 802.22 cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Deception; Jamming; Nash equilibrium; Computer security; Computer science; Cognitive radio; Strategy; Incentive; Channel (broadcasting); Game theory; Computer network; Scheme (mathematics); Telecommunications; Wireless; Mathematical optimization; Mathematical economics; Mathematics; Economics; Microeconomics; Psychology","score_opus":0.02550530200327614,"score_gpt":0.29161642269826166,"score_spread":0.2661111206949855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2682285226","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.85141724,0.00028964886,0.061370812,0.00010454482,0.00009941851,0.00029575432,0.0000037082755,0.00029968386,0.08611916],"genre_scores_gemma":[0.99867076,0.00039553628,0.0007985835,0.000018388138,0.000043299562,0.00003430676,0.0000068627473,0.0000132443065,0.000019025376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947464,0.000057653033,0.00018120356,0.000070647475,0.000097225595,0.000118623204],"domain_scores_gemma":[0.9991564,0.00013437755,0.000059489335,0.0005944825,0.000041150146,0.000014074336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028484763,0.000085270905,0.00012244514,0.00004462969,0.000063725456,0.000114531795,0.000610961,0.00007944704,0.000052518426],"category_scores_gemma":[0.000025100126,0.000069724214,0.000034094457,0.000055342967,0.000104495644,0.00038274346,0.00005087726,0.00019147088,0.000004979652],"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.00024632138,0.0008205535,0.03160611,0.0007027848,0.00058593537,0.000034922334,0.039628517,0.072242625,0.10379072,0.47407222,0.066214256,0.21005501],"study_design_scores_gemma":[0.0017550535,0.00018015323,0.18327028,0.00070645375,0.000059372684,0.000016902119,0.011114616,0.73346925,0.0485113,0.017674118,0.0022488988,0.000993603],"about_ca_topic_score_codex":0.00010688802,"about_ca_topic_score_gemma":0.0003614572,"teacher_disagreement_score":0.66122663,"about_ca_system_score_codex":0.000017970775,"about_ca_system_score_gemma":0.000010572675,"threshold_uncertainty_score":0.2843271},"labels":[],"label_agreement":null},{"id":"W2699584971","doi":"10.1109/tcomm.2017.2764892","title":"Secure Broadcasting Using Independent Secret Keys","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"National Science Foundation","keywords":"Computer science; Broadcasting (networking); Computer network; Transmitter; Channel (broadcasting); Coding (social sciences); Channel capacity; Encryption; Computer security; Topology (electrical circuits); Mathematics","score_opus":0.07183492949968856,"score_gpt":0.31641869231116115,"score_spread":0.2445837628114726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2699584971","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.03789257,0.0005739684,0.93437487,0.0009426088,0.00046141125,0.00052086235,0.00012041272,0.0019269888,0.023186335],"genre_scores_gemma":[0.97184575,0.0014671083,0.026320225,0.000047650854,0.000025903264,0.0001153368,0.000010973332,0.00007300535,0.00009405752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880326,0.00012554196,0.00037960624,0.00019036878,0.00022796077,0.00027328145],"domain_scores_gemma":[0.9934083,0.00017840402,0.00013632125,0.0060395338,0.00012322082,0.00011417468],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00027794554,0.00023353077,0.00022189904,0.00020555357,0.0020796747,0.00027689087,0.0027939526,0.00018674707,0.00008897728],"category_scores_gemma":[0.000016412741,0.00028349503,0.0001320163,0.00014557478,0.00025320373,0.00052178156,0.00003248475,0.00097547745,0.00006709662],"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.00009001033,0.0028733304,0.0013188411,0.0006721771,0.001749174,0.000026229314,0.0167849,0.45384192,0.16605407,0.021126267,0.0035479728,0.3319151],"study_design_scores_gemma":[0.00079550064,0.00005702654,0.00096891995,0.0005245208,0.00014028067,0.000064723754,0.00045625554,0.91122705,0.06645153,0.0015833325,0.016699538,0.0010313056],"about_ca_topic_score_codex":0.00015562684,"about_ca_topic_score_gemma":0.0005046499,"teacher_disagreement_score":0.93395317,"about_ca_system_score_codex":0.00019887398,"about_ca_system_score_gemma":0.000043304404,"threshold_uncertainty_score":0.99996173},"labels":[],"label_agreement":null},{"id":"W2715771073","doi":"10.1109/ccece.2017.7946684","title":"Using friendly jamming to improve route security and quality in ad hoc networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Jamming; Computer science; Computer network; Physical layer; Wireless ad hoc network; Secrecy; Quality of service; Node (physics); Wireless; Context (archaeology); Computer security; Telecommunications; Engineering","score_opus":0.03793189262137717,"score_gpt":0.3283764090397458,"score_spread":0.29044451641836866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2715771073","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.95739925,0.00061122025,0.03654807,0.00014904902,0.00009717851,0.00023842185,0.000005734393,0.00038423922,0.004566826],"genre_scores_gemma":[0.97194695,0.00029565996,0.027626704,0.000048439597,0.000027237356,0.00001810674,0.0000018811984,0.000021619677,0.000013416488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999209,0.000040839044,0.00025988315,0.00017574744,0.000088405824,0.00022611173],"domain_scores_gemma":[0.9987991,0.000052609237,0.00005345466,0.0009761721,0.000032509488,0.00008613976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046084178,0.00012982168,0.00020142201,0.000067395646,0.00014829064,0.00017152561,0.00040663822,0.00011484838,0.000008237846],"category_scores_gemma":[0.00007729897,0.00014455066,0.000025298657,0.00005944911,0.000041734995,0.0003510895,0.00035576877,0.00027890594,0.0000020468271],"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.00014921091,0.00027992442,0.11432514,0.00075467234,0.00019379567,0.000032933687,0.027328745,0.017798895,0.07546835,0.04794155,0.001326634,0.7144002],"study_design_scores_gemma":[0.001163547,0.00009867378,0.0838872,0.0003362598,0.000019445075,0.0000067343612,0.0011190835,0.8662129,0.024509346,0.0028170825,0.0183508,0.0014789398],"about_ca_topic_score_codex":0.00061030453,"about_ca_topic_score_gemma":0.0025401046,"teacher_disagreement_score":0.848414,"about_ca_system_score_codex":0.000093089046,"about_ca_system_score_gemma":0.000008060509,"threshold_uncertainty_score":0.58946055},"labels":[],"label_agreement":null},{"id":"W2726729862","doi":"10.1109/tcomm.2017.2723565","title":"Secure Massive MIMO Relaying Systems in a Poisson Field of Eavesdroppers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"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":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Relay; Channel state information; Computer network; Telecommunications link; Computer science; MIMO; Transmission (telecommunications); Reliability (semiconductor); Secure transmission; Poisson point process; Signal-to-noise ratio (imaging); Channel (broadcasting); Antenna (radio); Power (physics); Wireless; Poisson distribution; Telecommunications; Mathematics; Encryption; Physics; Statistics","score_opus":0.030768441062426512,"score_gpt":0.3004351606004512,"score_spread":0.26966671953802474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726729862","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.17368725,0.0060716453,0.6981743,0.0179878,0.0017434673,0.0031002185,0.0003818772,0.00262525,0.096228175],"genre_scores_gemma":[0.99329597,0.002667209,0.0036585932,0.00003065825,0.000007010694,0.00023468093,0.0000053210415,0.00003609057,0.00006446544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989957,0.00011569823,0.00043053212,0.00013279704,0.00014709425,0.00017814118],"domain_scores_gemma":[0.99506813,0.00036416398,0.00014352927,0.0042821504,0.00008649047,0.000055532513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020692099,0.00015790369,0.0002517109,0.00027930157,0.00043703962,0.00007635267,0.0019036073,0.00017767408,0.000017599285],"category_scores_gemma":[0.00002023716,0.00018645117,0.000097699434,0.00017062011,0.00015223499,0.0002997527,0.000015987313,0.00071645185,0.000014852934],"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.0002599257,0.004258965,0.003004406,0.0018105021,0.0018074294,0.000028172008,0.040221725,0.5708754,0.14117843,0.08774558,0.008439566,0.14036988],"study_design_scores_gemma":[0.0026412904,0.00039874067,0.003535305,0.003602392,0.00024720185,0.000036076002,0.0055675367,0.74859595,0.2086241,0.0024120163,0.022414502,0.0019249006],"about_ca_topic_score_codex":0.0008661147,"about_ca_topic_score_gemma":0.0009203827,"teacher_disagreement_score":0.81960875,"about_ca_system_score_codex":0.00012107541,"about_ca_system_score_gemma":0.000032293854,"threshold_uncertainty_score":0.7603258},"labels":[],"label_agreement":null},{"id":"W2733866746","doi":"10.1109/isit.2017.8007046","title":"Covert communication with noncausal channel-state information at the transmitter","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transmitter; Computer science; Covert channel; Channel (broadcasting); Covert; State (computer science); Channel state information; Information theory; Telecommunications; Wireless; Mathematics; Algorithm","score_opus":0.00821366698048766,"score_gpt":0.21478895497222936,"score_spread":0.20657528799174169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733866746","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.401464,0.0006454323,0.21991174,0.01725994,0.00014791181,0.0015002884,0.00005575244,0.0028284793,0.35618648],"genre_scores_gemma":[0.9973227,0.0006256596,0.0013849384,0.0002616529,0.00000632465,0.00007235763,0.00003661379,0.000014274374,0.00027548266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995482,0.000023985922,0.00014912759,0.000042330346,0.00012531015,0.00011106569],"domain_scores_gemma":[0.99826074,0.00004035603,0.00006253933,0.0015554507,0.000056038072,0.000024874618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016300441,0.00009327447,0.000079322635,0.00002958059,0.0004311559,0.0001863616,0.00075907476,0.00004041916,0.000055306915],"category_scores_gemma":[0.000005925448,0.00006252283,0.000021767446,0.000030378369,0.00011403657,0.0009775221,0.00011527696,0.00015755967,0.00010605969],"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.00043871292,0.0002156416,0.0070162923,0.00061894936,0.00082002336,0.000005246187,0.07628011,0.021808462,0.0061211498,0.032918487,0.29167616,0.56208074],"study_design_scores_gemma":[0.0015961037,0.000103130136,0.036461316,0.00019025442,0.000042978932,0.00003759716,0.00037737493,0.18386638,0.114579216,0.0023257718,0.65949965,0.00092022994],"about_ca_topic_score_codex":0.00011843862,"about_ca_topic_score_gemma":0.0005697427,"teacher_disagreement_score":0.5958587,"about_ca_system_score_codex":0.000050815874,"about_ca_system_score_gemma":0.000006156845,"threshold_uncertainty_score":0.3316146},"labels":[],"label_agreement":null},{"id":"W2734691861","doi":"10.1109/iccchinaw.2015.7961602","title":"Secrecy analysis for forward link multi-user massive MIMO system with MRT precoding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Precoding; MIMO; Computer science; Transmitter power output; Topology (electrical circuits); Upper and lower bounds; Base station; Computer network; Antenna (radio); Secrecy; Transmission (telecommunications); Limit (mathematics); Telecommunications; Mathematics; Channel (broadcasting); Computer security; Transmitter","score_opus":0.0380650357393481,"score_gpt":0.267744421574124,"score_spread":0.22967938583477587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734691861","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.010761896,0.00014417803,0.98139924,0.00012823135,0.000046882502,0.00052462204,0.000018419367,0.0018949774,0.0050815307],"genre_scores_gemma":[0.820538,0.000012778733,0.17854734,0.00001774603,0.0000354937,0.00028162904,0.000039114468,0.000042300355,0.00048562483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991538,0.000032680986,0.00026660372,0.00017687387,0.00015175866,0.00021831486],"domain_scores_gemma":[0.9988303,0.00009477191,0.00005737862,0.00064042595,0.0002456669,0.00013144792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002696766,0.00017040508,0.00031928282,0.00024917995,0.000049455102,0.00006514082,0.0003372638,0.00011278608,0.000012111976],"category_scores_gemma":[0.00002782829,0.0001458971,0.00011304613,0.0004541955,0.000019061625,0.00020037648,0.00005844243,0.00012660619,0.000014772562],"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.00029627176,0.00033079972,0.110854976,0.00293008,0.013895108,0.000021808708,0.015749859,0.584764,0.0026291315,0.23052078,0.01845169,0.019555505],"study_design_scores_gemma":[0.0008395969,0.00006899137,0.000593354,0.000096828604,0.00034492332,0.0000032671674,0.0015191016,0.9699923,0.01222349,0.00007145247,0.013814352,0.0004323712],"about_ca_topic_score_codex":0.00007088083,"about_ca_topic_score_gemma":0.000372565,"teacher_disagreement_score":0.80977607,"about_ca_system_score_codex":0.00019970021,"about_ca_system_score_gemma":0.000022230202,"threshold_uncertainty_score":0.5949511},"labels":[],"label_agreement":null},{"id":"W2737300431","doi":"10.1109/twc.2017.2729541","title":"Optimal Beamforming for Gaussian MIMO Wiretap Channels With Two Transmit Antennas","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Precoding; MIMO; Beamforming; Computer science; Transmitter; Covariance; Channel (broadcasting); Gaussian; Mathematical optimization; Channel capacity; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Physics","score_opus":0.04069246104871444,"score_gpt":0.2996016540926724,"score_spread":0.258909193043958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737300431","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.011370007,0.0009203405,0.9767075,0.0021108089,0.0006620834,0.0027329356,0.0010624814,0.0026201925,0.0018136485],"genre_scores_gemma":[0.8815937,0.0047707716,0.107364535,0.00006814243,0.000084377476,0.00518525,0.00033880566,0.00035098803,0.00024340923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968584,0.00018795283,0.0009972478,0.0007308909,0.000459532,0.000765949],"domain_scores_gemma":[0.98848224,0.0005258391,0.00041801328,0.0098657925,0.00042116657,0.00028695512],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00048408663,0.000985734,0.0010779743,0.0006768729,0.0018197654,0.00053634937,0.005821349,0.0006915519,0.000029959025],"category_scores_gemma":[0.0000075555595,0.001065058,0.0005846426,0.00027815936,0.00075431686,0.0005306985,0.0000694716,0.0029239126,0.000024907698],"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.0002909022,0.0015221967,0.000015331552,0.0015848337,0.0021911243,0.000008352878,0.008893479,0.8355241,0.003116081,0.003875574,0.0007279039,0.14225012],"study_design_scores_gemma":[0.0022283592,0.0002776178,0.000032067554,0.0032336132,0.00072683487,0.00005446574,0.00042652147,0.93291855,0.043578874,0.0011192245,0.012871253,0.0025326025],"about_ca_topic_score_codex":0.00027435337,"about_ca_topic_score_gemma":0.0013015427,"teacher_disagreement_score":0.8702237,"about_ca_system_score_codex":0.00039962897,"about_ca_system_score_gemma":0.00024584637,"threshold_uncertainty_score":0.9995576},"labels":[],"label_agreement":null},{"id":"W2738208647","doi":"10.1109/lwc.2017.2731840","title":"Physical Layer Security in Ultra-Dense Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Physical layer; Secrecy; Stochastic geometry; Computer science; Rician fading; Fading; Computer network; Wireless; Channel (broadcasting); Telecommunications; Mathematics; Computer security; Statistics","score_opus":0.025510955519572345,"score_gpt":0.2852912983913028,"score_spread":0.25978034287173046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738208647","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.98088145,0.0003264162,0.005332666,0.0055728545,0.00022350853,0.00040832305,0.000018062463,0.000981775,0.0062549147],"genre_scores_gemma":[0.9964612,0.0014335004,0.0012065094,0.00042385358,0.00009999593,0.00025580666,0.00003215819,0.00007833944,0.000008632933],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.00021248938,0.00041896093,0.00024847165,0.00020974544,0.00042422774],"domain_scores_gemma":[0.9920454,0.00029873117,0.00015259016,0.007339174,0.00006133183,0.00010274079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003334989,0.00029131252,0.00037816036,0.00017745764,0.0005697287,0.0002581432,0.004464992,0.00015387137,0.0000072570683],"category_scores_gemma":[0.00003506454,0.0003467339,0.00012905651,0.00019240598,0.00054634723,0.0005714092,0.0003293819,0.0011147417,0.000047738602],"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.00009317816,0.0027156065,0.044651672,0.0004063884,0.00062128087,0.00009781543,0.025470918,0.08415749,0.6562538,0.053192005,0.058413997,0.073925816],"study_design_scores_gemma":[0.0012033379,0.000024594687,0.015740212,0.00039219516,0.000045391145,0.000022375354,0.00021025624,0.923031,0.044333603,0.0014610173,0.012086819,0.0014491944],"about_ca_topic_score_codex":0.00026294088,"about_ca_topic_score_gemma":0.00084949797,"teacher_disagreement_score":0.8388735,"about_ca_system_score_codex":0.00017872656,"about_ca_system_score_gemma":0.000015237522,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W2740798375","doi":"10.1109/cwit.2017.7994823","title":"Physical layer secrecy for wireless communication systems using adaptive HARQ with error contamination","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université Laval","funders":"","keywords":"Retransmission; Computer science; Hybrid automatic repeat request; Network packet; Decoding methods; Computer network; Physical layer; Error detection and correction; Wireless; Channel (broadcasting); Low-density parity-check code; Automatic repeat request; Real-time computing; Algorithm; Telecommunications; Telecommunications link","score_opus":0.06526737039360916,"score_gpt":0.3151175450374748,"score_spread":0.24985017464386564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740798375","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.58141935,0.00010635922,0.41117674,0.00010701298,0.000056871886,0.00087759085,0.000019974232,0.000664319,0.005571814],"genre_scores_gemma":[0.9844061,0.000029001943,0.015074185,0.0000107596925,0.000045479333,0.00025730472,0.0000311686,0.000051813302,0.000094156334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931705,0.00005136677,0.00018072048,0.00013774981,0.00014552016,0.00016756645],"domain_scores_gemma":[0.9981373,0.00012885187,0.0001395155,0.0013045518,0.00024414665,0.000045660225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019261091,0.00015918558,0.00023503792,0.000061628445,0.00040754103,0.00020337447,0.00065134506,0.00008586005,0.0000030980643],"category_scores_gemma":[0.0000184015,0.00014677712,0.00004366425,0.000045036693,0.000100587626,0.0005986305,0.00009323681,0.00016205719,0.000004339201],"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.00023428194,0.00046517455,0.002071727,0.0005584771,0.000562949,0.0000028698155,0.00735319,0.025777327,0.07486338,0.8636792,0.0017685137,0.022662966],"study_design_scores_gemma":[0.00044640666,0.000051833133,0.0008221579,0.00017441563,0.000029263238,0.000003911505,0.0004642361,0.9758645,0.020753695,0.00038902162,0.00076174777,0.00023880726],"about_ca_topic_score_codex":0.00028252942,"about_ca_topic_score_gemma":0.0002202395,"teacher_disagreement_score":0.9500872,"about_ca_system_score_codex":0.00013734838,"about_ca_system_score_gemma":0.000019019217,"threshold_uncertainty_score":0.5985397},"labels":[],"label_agreement":null},{"id":"W2740981266","doi":"10.1109/cwit.2017.7994825","title":"Secrecy rate maximization for MIMO wiretap channels with channel uncertainty","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Université Laval","funders":"","keywords":"MIMO; Channel state information; Computer science; Maximization; Covariance matrix; Channel (broadcasting); Transmitter; Covariance; Constraint (computer-aided design); Imperfect; Mathematical optimization; Secrecy; Precoding; Algorithm; Wireless; Telecommunications; Mathematics; Statistics; Computer security","score_opus":0.025786760086577085,"score_gpt":0.2579721903196186,"score_spread":0.2321854302330415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740981266","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.031372983,0.0000917031,0.9525075,0.0011545344,0.00020214301,0.0008848988,0.000022722292,0.001647326,0.012116224],"genre_scores_gemma":[0.9906824,0.000120111225,0.008215384,0.000078110425,0.0000651913,0.00026943992,0.000053500968,0.000050663864,0.00046518177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939513,0.000017475795,0.00015323704,0.00014810759,0.000080862854,0.00020518836],"domain_scores_gemma":[0.99874026,0.000047990496,0.00007031321,0.00095486024,0.00012873132,0.000057832596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020506632,0.00015247271,0.00016850886,0.000062064006,0.00027614264,0.00017236381,0.00052965403,0.00008681608,0.00003234888],"category_scores_gemma":[0.000042703825,0.00013443343,0.000039239803,0.000045908328,0.000057064157,0.00034205298,0.000063726664,0.000095746385,0.000009705196],"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.0005726187,0.0004124062,0.0017631447,0.0017443844,0.00097481924,0.000014851746,0.010020727,0.55779487,0.015473415,0.29676864,0.03346218,0.08099795],"study_design_scores_gemma":[0.0007895705,0.00008686739,0.00074212527,0.00010016121,0.000020987049,0.0000037903528,0.000092488415,0.9341247,0.045133263,0.010677715,0.0077727134,0.00045563615],"about_ca_topic_score_codex":0.0000743684,"about_ca_topic_score_gemma":0.00014959776,"teacher_disagreement_score":0.95930946,"about_ca_system_score_codex":0.000043585376,"about_ca_system_score_gemma":0.000013020733,"threshold_uncertainty_score":0.5482036},"labels":[],"label_agreement":null},{"id":"W2741407548","doi":"10.1109/cwit.2017.7994830","title":"On linear analog coding of sources with memory over fading and broadcast channels with correlated noise","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Manitoba","funders":"","keywords":"Fading; Encoder; Rayleigh fading; Algorithm; Computer science; Channel state information; Decoding methods; Quantization (signal processing); Mathematics; Telecommunications; Wireless","score_opus":0.013412706534979401,"score_gpt":0.23667627639876943,"score_spread":0.22326356986379003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741407548","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.9780491,0.00009820861,0.009640014,0.00004349647,0.000022355567,0.00014959197,0.000003723652,0.00033550075,0.011658015],"genre_scores_gemma":[0.9974231,0.00012744009,0.0022612137,0.00001893254,0.0000132478035,0.000008293743,0.0000032074322,0.000030938078,0.00011360349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994817,0.00001291435,0.00013325087,0.000120011035,0.00012450057,0.00012761774],"domain_scores_gemma":[0.99916124,0.000067082816,0.00008884316,0.00058756315,0.000046547535,0.00004871275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100267374,0.00013257792,0.00019305493,0.00010008523,0.0001402666,0.00005865633,0.00025094056,0.00006606237,0.000028969898],"category_scores_gemma":[0.000017891887,0.00010181412,0.000015412306,0.000056095498,0.00012871313,0.00019434391,0.00006839902,0.00018014002,0.0000021035062],"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.0019993656,0.000909951,0.18581574,0.0029747237,0.0028551605,0.00022083346,0.05032443,0.46516442,0.14953153,0.06228731,0.0054866406,0.072429895],"study_design_scores_gemma":[0.002609261,0.00068431336,0.019563958,0.0020151234,0.000092564915,0.000052948257,0.0007115723,0.68669057,0.28549263,0.00022292882,0.0008506718,0.001013438],"about_ca_topic_score_codex":0.00012337734,"about_ca_topic_score_gemma":0.000044334312,"teacher_disagreement_score":0.22152618,"about_ca_system_score_codex":0.000017285358,"about_ca_system_score_gemma":0.000006199053,"threshold_uncertainty_score":0.41518593},"labels":[],"label_agreement":null},{"id":"W2742332316","doi":"","title":"Intrinsic capacity","year":2017,"lang":"en","type":"article","venue":"International Symposium on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Generalization; Binary number; Channel (broadcasting); Encoder; Realization (probability); State (computer science); Mathematics; Convex combination; Regular polygon; Channel capacity; Topology (electrical circuits); Computer science; Algorithm; Convex optimization; Combinatorics; Mathematical analysis; Telecommunications; Statistics; Arithmetic","score_opus":0.01188079133535296,"score_gpt":0.24096647797940265,"score_spread":0.22908568664404969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742332316","genre_codex":"other","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.1151481,0.000011634749,0.022283059,0.0022899138,0.001769679,0.00024678741,0.000075750955,0.0012497801,0.8569253],"genre_scores_gemma":[0.9986583,0.000096057214,0.00057979795,0.0003881498,0.00008829318,0.00004656513,0.000043496715,0.000011331278,0.00008803182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928695,0.000024328401,0.00027450096,0.000057904854,0.0002480784,0.000108244094],"domain_scores_gemma":[0.99890506,0.000068393136,0.00013368663,0.0006984173,0.00015039647,0.0000440347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032308613,0.000113121096,0.00008616708,0.00011372058,0.00020786445,0.00033231723,0.0010035445,0.000076171425,0.00017608187],"category_scores_gemma":[0.0001305991,0.00011749525,0.00005134498,0.000023701292,0.00008397554,0.0018507626,0.00010749039,0.00020139538,0.00066460844],"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.000032749926,0.000023478535,0.00030123722,0.00001919036,0.00006340634,5.182147e-7,0.0010150296,0.0013467233,0.00074615225,0.9468301,0.003650186,0.045971222],"study_design_scores_gemma":[0.0012263296,0.00007720833,0.01995021,0.0001988097,0.000016485747,0.000029169394,0.00019037505,0.024774896,0.0967945,0.09584546,0.7600376,0.00085895974],"about_ca_topic_score_codex":0.000012027297,"about_ca_topic_score_gemma":0.0000028168588,"teacher_disagreement_score":0.8835102,"about_ca_system_score_codex":0.00013987029,"about_ca_system_score_gemma":0.000006497186,"threshold_uncertainty_score":0.8542419},"labels":[],"label_agreement":null},{"id":"W2743047657","doi":"10.1109/tifs.2018.2818650","title":"Covert Communication With Channel-State Information at the Transmitter","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Korea Electric Power Corporation; National Research Foundation of Korea; Ministry of Education","keywords":"Transmitter; Additive white Gaussian noise; Channel (broadcasting); Channel state information; Computer science; Channel capacity; Covert; Key (lock); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Wireless; Computer security; Combinatorics","score_opus":0.007838086871942923,"score_gpt":0.20477804734854915,"score_spread":0.19693996047660622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743047657","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.06485127,0.0002188886,0.92508346,0.0011392162,0.00047069788,0.001455637,0.0010314222,0.0009750196,0.0047743996],"genre_scores_gemma":[0.99331117,0.003873341,0.001230147,0.000615725,0.00001774277,0.0003358325,0.0005664729,0.000030598683,0.00001898647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984544,0.00007803546,0.00068463426,0.00012891006,0.00040661986,0.0002474036],"domain_scores_gemma":[0.9980166,0.0001030519,0.00024927733,0.0011676588,0.00037137175,0.00009202717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035932948,0.00039203535,0.00029732552,0.0002611656,0.00054066547,0.00036479434,0.00046406616,0.00033244974,0.000046485056],"category_scores_gemma":[0.0000028449329,0.000314737,0.000110788285,0.00020538799,0.0003450439,0.001713104,0.000027248678,0.0011083315,0.00008028614],"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.0010447578,0.0002184153,0.00003760409,0.003806207,0.001502947,0.0000014329796,0.20259783,0.35690594,0.000032768625,0.0040780446,0.065103136,0.36467093],"study_design_scores_gemma":[0.0020003528,0.00035316838,0.0002902118,0.0009445761,0.00027846044,0.000074789976,0.0011495701,0.74395764,0.026495622,0.02409792,0.1983456,0.0020120891],"about_ca_topic_score_codex":0.000110252,"about_ca_topic_score_gemma":0.00036050592,"teacher_disagreement_score":0.9284599,"about_ca_system_score_codex":0.00021530547,"about_ca_system_score_gemma":0.000046373814,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W2743670993","doi":"10.1109/isit.2017.8006519","title":"On the capacity of burst noise-erasure channels with and without feedback","year":2017,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Computer science; Channel (broadcasting); Ergodic theory; Noise (video); Erasure code; Mutual information; Shannon–Hartley theorem; Control theory (sociology); Mathematics; Topology (electrical circuits); Algorithm; Decoding methods; Telecommunications; Combinatorics; Physics","score_opus":0.02958316630228077,"score_gpt":0.24210954726624745,"score_spread":0.21252638096396667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743670993","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.97029006,0.000032487544,0.0018906512,0.00071211555,0.000021233804,0.00015810819,0.000004253286,0.00018849908,0.026702615],"genre_scores_gemma":[0.9984463,0.000056652163,0.001319983,0.000039106624,0.0000111960535,0.000016763983,5.347934e-7,0.000015324775,0.00009417232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965787,0.00001506805,0.00007968815,0.00006849175,0.0000982397,0.000080635],"domain_scores_gemma":[0.9989547,0.00004393141,0.000042693482,0.0008901624,0.0000430926,0.000025387406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013143846,0.000085057145,0.00011344406,0.000021178448,0.000120138495,0.000056517747,0.00035829254,0.00004303913,0.000022307266],"category_scores_gemma":[0.000026688787,0.000051864983,0.000013536813,0.000021378743,0.00015785193,0.00009431119,0.000051706906,0.00013817994,0.0000037700243],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002094938,0.0003805736,0.12154098,0.0008107163,0.0007711088,0.0000031714737,0.014529502,0.0036613047,0.06739935,0.7612989,0.017823398,0.011571491],"study_design_scores_gemma":[0.0016218979,0.00044126742,0.18139216,0.0009682298,0.00006662157,0.000028005723,0.0006073313,0.05034702,0.74059993,0.016224563,0.00652684,0.0011761198],"about_ca_topic_score_codex":0.000108817796,"about_ca_topic_score_gemma":0.00009453552,"teacher_disagreement_score":0.74507433,"about_ca_system_score_codex":0.000010397066,"about_ca_system_score_gemma":0.0000034453717,"threshold_uncertainty_score":0.21149926},"labels":[],"label_agreement":null},{"id":"W2745125159","doi":"10.1109/tvt.2017.2735414","title":"Joint Design of Optimal Precoding and Cooperative Jamming for Multiuser Secure Broadcast Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto; Queen's University","funders":"National Research Foundation of Korea","keywords":"Precoding; Jamming; Artificial noise; Covariance matrix; Base station; Computer science; Zero-forcing precoding; Covariance; Signal-to-noise ratio (imaging); Interference (communication); Asymptotically optimal algorithm; Iterative method; Algorithm; Mathematical optimization; Mathematics; Beamforming; Telecommunications; MIMO; Wireless; Statistics; Physical layer; Physics","score_opus":0.035468298721844184,"score_gpt":0.2621483525013123,"score_spread":0.22668005377946812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745125159","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.10710999,0.00036093986,0.8908916,0.00013841741,0.00012914515,0.0007466296,0.000032203603,0.0005663502,0.00002473381],"genre_scores_gemma":[0.95940346,0.00045938714,0.039611675,0.0000038870394,0.000008761341,0.00044776566,0.0000014263019,0.000041179534,0.000022464772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992073,0.000033779674,0.00028497816,0.0002004834,0.00008034713,0.00019310253],"domain_scores_gemma":[0.99888784,0.00007756132,0.0001016991,0.0007592962,0.00013956855,0.000034060227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001925624,0.00017609604,0.0003102395,0.00029491726,0.00035179337,0.00005591352,0.00035085142,0.00033018924,0.00000323501],"category_scores_gemma":[0.00002324117,0.00018735313,0.00005625453,0.00008664855,0.0002611902,0.00017476405,0.000006062725,0.00028397547,0.000001920491],"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.000044378223,0.0001194686,0.000012525676,0.0003227252,0.00029952952,0.000005229422,0.0010174244,0.62580174,0.32942554,0.0030001581,0.0000814643,0.039869785],"study_design_scores_gemma":[0.0004419325,0.00016580205,0.000008093449,0.0001811489,0.000035767065,0.000024617066,0.00028627765,0.44938582,0.5485018,0.000054949778,0.0007289446,0.00018485493],"about_ca_topic_score_codex":0.00001435029,"about_ca_topic_score_gemma":0.000007023007,"teacher_disagreement_score":0.85229343,"about_ca_system_score_codex":0.000055312357,"about_ca_system_score_gemma":0.000014055718,"threshold_uncertainty_score":0.7640039},"labels":[],"label_agreement":null},{"id":"W2750168807","doi":"10.1007/s11042-017-5103-1","title":"Decoder driven side information generation using ensemble of MLP networks for distributed video coding","year":2017,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multilayer perceptron; Peak signal-to-noise ratio; Mean squared error; Perceptron; Algorithm; Coding (social sciences); Codec; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Statistics; Mathematics","score_opus":0.04760603448161886,"score_gpt":0.2909549448834583,"score_spread":0.24334891040183942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750168807","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.024689527,0.000084195104,0.97391105,0.00007214627,0.00003217231,0.0006796102,0.00020546462,0.00012889657,0.00019691988],"genre_scores_gemma":[0.9202124,0.0002502201,0.07831967,0.000013502885,0.00008431716,0.00048254142,0.00062371325,0.0000119956085,0.0000016782138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946874,0.000007932695,0.00027284343,0.0000785453,0.000059841514,0.00011211344],"domain_scores_gemma":[0.9991207,0.00010851022,0.0001485496,0.00045639736,0.00012278248,0.000043020602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010485428,0.000088527086,0.00013078799,0.000041101554,0.00033007664,0.0001499182,0.00019793044,0.00008714397,0.000002297936],"category_scores_gemma":[0.0000624158,0.00009871572,0.000031822427,0.00004355973,0.00005506152,0.00059961696,0.000055226283,0.000073402385,0.0000012248936],"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.000012892435,0.000072032366,0.0018825652,0.0002542204,0.00010250679,1.0026569e-7,0.0009253052,0.1875738,0.16409689,0.016630417,0.0022476763,0.62620157],"study_design_scores_gemma":[0.00021692972,0.000004704568,0.0015974134,0.00002045138,0.000017351187,7.165705e-7,0.000022936472,0.97226924,0.01804623,0.00018119125,0.007518529,0.00010432712],"about_ca_topic_score_codex":0.000022867884,"about_ca_topic_score_gemma":0.000029318493,"teacher_disagreement_score":0.8955914,"about_ca_system_score_codex":0.00003195211,"about_ca_system_score_gemma":0.000010301791,"threshold_uncertainty_score":0.40255103},"labels":[],"label_agreement":null},{"id":"W2750302792","doi":"10.1109/lcomm.2017.2741458","title":"On the Secrecy Performance Analysis of SIMO Systems Over $\\kappa$ – $\\mu$ Fading Channels","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Secrecy; Notation; Computer science; Noise (video); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Arithmetic; Artificial intelligence","score_opus":0.043293201592725795,"score_gpt":0.281125965585593,"score_spread":0.2378327639928672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750302792","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.98388517,0.00032546808,0.006833614,0.0031905656,0.00020842953,0.00033590678,0.000031674484,0.00032585408,0.004863332],"genre_scores_gemma":[0.9980291,0.0009966753,0.00043251438,0.00027450465,0.00002417701,0.00016610301,0.000025845162,0.000031821255,0.000019271389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00015872618,0.00038156143,0.00012803862,0.00021499845,0.0001923653],"domain_scores_gemma":[0.99144363,0.0005795636,0.00024919622,0.0076139937,0.000074612035,0.000039027964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052494695,0.00016863875,0.00030459155,0.00033112097,0.000701265,0.00017538719,0.004033825,0.000074004936,0.00001675091],"category_scores_gemma":[0.00006514929,0.00014947206,0.00014677316,0.00038387554,0.00029459206,0.00027207087,0.00028584828,0.00040469295,0.00001723616],"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.000019426132,0.00025653106,0.01206704,0.00027739964,0.004341488,0.0000015302155,0.007001256,0.7351155,0.13686676,0.07589726,0.023006033,0.0051497505],"study_design_scores_gemma":[0.00015703966,0.000015942678,0.013067723,0.00023121123,0.0002718661,0.0000010751388,0.000102816186,0.97044665,0.00866675,0.00008554406,0.0066136043,0.0003397613],"about_ca_topic_score_codex":0.00016619622,"about_ca_topic_score_gemma":0.000038776274,"teacher_disagreement_score":0.23533115,"about_ca_system_score_codex":0.000099885176,"about_ca_system_score_gemma":0.000008440097,"threshold_uncertainty_score":0.7495917},"labels":[],"label_agreement":null},{"id":"W2751804009","doi":"10.1109/tsp.2017.2745454","title":"On Linear Precoding for the Two-User MISO Broadcast Channel With Confidential Messages and Per-Antenna Constraints","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Transmitter; Computer science; Secure transmission; Maximization; Channel (broadcasting); Optimization problem; Mathematical optimization; Artificial noise; Secrecy; Transmission (telecommunications); Multi-user; Zero-forcing precoding; Antenna (radio); MIMO; Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.027056103019477792,"score_gpt":0.2831523528942052,"score_spread":0.2560962498747274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751804009","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.020189272,0.00023535764,0.97786665,0.00035986133,0.00008793551,0.0004464094,0.00003193108,0.0003214856,0.00046110168],"genre_scores_gemma":[0.996823,0.0001335454,0.0026339733,0.00005824087,0.000054643413,0.00015779756,0.00000151245,0.00005389137,0.00008337579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.000024146864,0.00019846183,0.00021539886,0.00017619204,0.00022467738],"domain_scores_gemma":[0.9990716,0.0002708666,0.000094718875,0.0003896563,0.00011175291,0.00006142366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021328073,0.00020869555,0.00018914073,0.00009168532,0.0012506184,0.00038073538,0.0003709603,0.00008071164,0.000035580404],"category_scores_gemma":[0.0000069553034,0.00016282803,0.000056724122,0.000045794808,0.0003533158,0.00037185705,0.0000029833507,0.00037933994,0.0000037071295],"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.00067939586,0.00030822042,0.000025354995,0.0008116054,0.00051391934,0.00000960172,0.006935396,0.07908509,0.061429646,0.0005990242,0.0001754225,0.84942734],"study_design_scores_gemma":[0.0022193303,0.00027897896,0.00007302225,0.0012705501,0.00020530136,0.000086357155,0.0011307864,0.77708286,0.21574403,0.0003893272,0.0008355777,0.0006838472],"about_ca_topic_score_codex":0.00001618236,"about_ca_topic_score_gemma":0.00004114766,"teacher_disagreement_score":0.9766337,"about_ca_system_score_codex":0.000030448673,"about_ca_system_score_gemma":0.000030257179,"threshold_uncertainty_score":0.9618872},"labels":[],"label_agreement":null},{"id":"W2755224554","doi":"10.1007/s11277-017-4429-3","title":"Effect of Power Amplifier Nonlinearity on the Physical Layer Security of MIMO Systems","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; MIMO; Rayleigh fading; Secrecy; Physical layer; Nonlinear system; Diversity gain; Block code; Amplifier; Power (physics); Monte Carlo method; Telecommunications; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Fading; Mathematics; Wireless; Statistics; Physics; Electrical engineering; Computer security; Engineering; Decoding methods","score_opus":0.03207504311089258,"score_gpt":0.31725029216861617,"score_spread":0.28517524905772357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755224554","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.98266923,0.00043700286,0.00014713734,0.00085718365,0.00007591415,0.00048570585,0.00018032674,0.00017770192,0.014969783],"genre_scores_gemma":[0.99932605,0.00027050523,0.00012866987,0.000016357004,0.000029514253,0.00014763665,0.000025288762,0.000037083137,0.00001891241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854714,0.0004385002,0.00035190556,0.00014366988,0.00033309593,0.00018570694],"domain_scores_gemma":[0.9932105,0.0014319782,0.0002639835,0.004842183,0.0001946155,0.000056774512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007605721,0.00021430013,0.00043766186,0.00007114165,0.0004925816,0.00007105987,0.003137238,0.00012380906,0.000015123587],"category_scores_gemma":[0.00016305558,0.00016691534,0.00019826923,0.00011254972,0.00075145677,0.00015075754,0.0005605562,0.00068901584,0.00001601866],"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.00036496515,0.0029929162,0.0138599835,0.0021364347,0.0014049867,0.0000033319136,0.033729024,0.0007761238,0.11619551,0.8078679,0.0077854423,0.012883383],"study_design_scores_gemma":[0.0016176807,0.0009270513,0.016185327,0.0015921918,0.00025525174,0.000015485617,0.0014628947,0.75061333,0.20639615,0.0017501644,0.01793109,0.0012533972],"about_ca_topic_score_codex":0.00026241626,"about_ca_topic_score_gemma":0.000049455575,"teacher_disagreement_score":0.8061177,"about_ca_system_score_codex":0.000053629472,"about_ca_system_score_gemma":0.000026544869,"threshold_uncertainty_score":0.68066096},"labels":[],"label_agreement":null},{"id":"W2761953145","doi":"10.1109/infocom.2017.8057120","title":"Interactive message transmission over adversarial wiretap channel II","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Adversary; Adversarial system; Code word; Transmitter; Jamming; Protocol (science); Computer security; Wireless; Secure communication; Eavesdropping; Transmission (telecommunications); Alice and Bob; Shared secret; Wireless sensor network; Theoretical computer science; Cryptography; Decoding methods; Telecommunications; Alice (programming language)","score_opus":0.013863563626774858,"score_gpt":0.2680290491411867,"score_spread":0.2541654855144118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761953145","genre_codex":"other","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.20811175,0.00037420372,0.20042197,0.0020337685,0.0009460262,0.0007294266,0.00002301497,0.004185703,0.58317417],"genre_scores_gemma":[0.99703455,0.00019532496,0.002082481,0.000039515173,0.0000544323,0.000021588694,0.000006649092,0.000027385584,0.00053808093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946797,0.000017797434,0.00014221588,0.00011567373,0.00011633371,0.00014003614],"domain_scores_gemma":[0.9990273,0.000028392002,0.00004239699,0.0008144572,0.000028340428,0.000059084236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009577181,0.00012429952,0.00014038212,0.000052371706,0.00030220737,0.00007290191,0.0005949969,0.000098927776,0.00040442523],"category_scores_gemma":[0.000018111077,0.000118428856,0.00006402188,0.000023356037,0.00004635144,0.0005728496,0.00015929046,0.00022331502,0.000019855197],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049015484,0.00086407363,0.0006570923,0.000445432,0.0009626101,0.00006024169,0.055160556,0.0021186091,0.27039567,0.042049676,0.14744349,0.47935238],"study_design_scores_gemma":[0.0019577122,0.00012544167,0.009647849,0.0003335503,0.000047248133,0.000008179435,0.00025715816,0.33428544,0.4403654,0.0051870397,0.20674625,0.0010387549],"about_ca_topic_score_codex":0.00010352178,"about_ca_topic_score_gemma":0.000028320574,"teacher_disagreement_score":0.7889228,"about_ca_system_score_codex":0.0000479996,"about_ca_system_score_gemma":0.000007087079,"threshold_uncertainty_score":0.48293886},"labels":[],"label_agreement":null},{"id":"W2762622133","doi":"10.1109/infocom.2017.8057119","title":"Secret key agreement using a virtual wiretap channel","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Key (lock); Computer science; Channel (broadcasting); Computer security; Computer network","score_opus":0.04158768556955691,"score_gpt":0.28132807574108415,"score_spread":0.23974039017152723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762622133","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.6972443,0.00023908618,0.1765961,0.0005139747,0.0003454446,0.00037531642,0.0000124886765,0.0019766612,0.12269661],"genre_scores_gemma":[0.9928355,0.00009629847,0.0066756583,0.000053909243,0.000048120943,0.000014992058,0.000004493515,0.000025144942,0.00024589038],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994312,0.000013869002,0.00015226901,0.00010161719,0.00013171748,0.00016934419],"domain_scores_gemma":[0.99870086,0.000013909897,0.000043495158,0.0011499044,0.00003496861,0.00005686691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001368856,0.000114922805,0.00012610717,0.000052106974,0.00021626451,0.00012810023,0.00062454236,0.00006866467,0.00014296125],"category_scores_gemma":[0.000019608942,0.00011926052,0.000041137093,0.000026047277,0.000052611013,0.00026634464,0.00021496971,0.00013012922,0.000052087336],"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.00007852478,0.0006687184,0.0073876902,0.0006687922,0.0013335316,0.00010164672,0.032171097,0.040310644,0.35921127,0.33438608,0.062554516,0.16112751],"study_design_scores_gemma":[0.00039059346,0.00004600231,0.0026956743,0.00011029733,0.00001855992,0.0000102294125,0.00023622917,0.89613634,0.08434096,0.0014836094,0.013976285,0.0005552168],"about_ca_topic_score_codex":0.0001494204,"about_ca_topic_score_gemma":0.000088243796,"teacher_disagreement_score":0.8558257,"about_ca_system_score_codex":0.00006267273,"about_ca_system_score_gemma":0.00000868166,"threshold_uncertainty_score":0.4863303},"labels":[],"label_agreement":null},{"id":"W2766032087","doi":"10.1109/tcomm.2017.2768516","title":"Security Optimization of Exposure Region-Based Beamforming With a Uniform Circular Array","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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":"Queen's University; Queen's University Belfast; Rice University","keywords":"Beamforming; Computer science; Wireless; Context (archaeology); Information leakage; Metric (unit); Algorithm; Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Computer network; Telecommunications; Combinatorics","score_opus":0.02513715767388952,"score_gpt":0.2514067566561165,"score_spread":0.22626959898222698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766032087","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.004395427,0.00013335483,0.98778105,0.00066644524,0.000060455404,0.0004048043,0.00004371932,0.00059619546,0.00591854],"genre_scores_gemma":[0.93596655,0.0007605599,0.06292613,0.00002865699,0.00000675394,0.00021689691,0.000025601092,0.00005286818,0.00001600165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00007585046,0.00037810171,0.00015527187,0.00021612755,0.00018402329],"domain_scores_gemma":[0.99384284,0.00017228564,0.00020990428,0.0054643094,0.00023295924,0.000077721175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018222621,0.00020594455,0.00024679684,0.0002302253,0.00094115717,0.00008480019,0.0018271678,0.0001452387,0.000021753318],"category_scores_gemma":[0.00001148984,0.00021830529,0.000110517525,0.0002181812,0.00038362414,0.00045421044,0.0000071100485,0.0005050965,0.000004387854],"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.000023001769,0.00032660787,0.0001077599,0.000096499105,0.00009547507,7.4578384e-7,0.00079875655,0.99372655,0.0013224934,0.0007807302,0.0000364249,0.002684964],"study_design_scores_gemma":[0.0013912462,0.00024544616,0.00025737027,0.0006851748,0.00017288962,0.000023182356,0.00046114423,0.8464883,0.14522155,0.00061549677,0.003666037,0.000772182],"about_ca_topic_score_codex":0.0000943593,"about_ca_topic_score_gemma":0.00027109013,"teacher_disagreement_score":0.9315711,"about_ca_system_score_codex":0.0001167641,"about_ca_system_score_gemma":0.000071361705,"threshold_uncertainty_score":0.89022315},"labels":[],"label_agreement":null},{"id":"W2767012393","doi":"10.1109/tcomm.2017.2765637","title":"Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Jamming; Artificial noise; Computer science; Quality of service; Transmission (telecommunications); Transmitter power output; Secure transmission; Precoding; Covariance; Mathematical optimization; Optimization problem; Signal-to-noise ratio (imaging); Secrecy; Computer network; Channel (broadcasting); MIMO; Transmitter; Telecommunications; Mathematics; Algorithm; Computer security","score_opus":0.03821635600304873,"score_gpt":0.27179020867265397,"score_spread":0.23357385266960523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767012393","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.03721639,0.0007447033,0.9589596,0.0009491381,0.0000461702,0.0006291503,0.00024052571,0.00026709068,0.00094727665],"genre_scores_gemma":[0.8838273,0.00354197,0.11222298,0.000011011397,0.0000136092385,0.00027691296,0.000023085631,0.00004474235,0.000038369297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992005,0.00008125914,0.00027865337,0.00019031575,0.000097149925,0.00015207009],"domain_scores_gemma":[0.99700534,0.00049890723,0.000117773416,0.0020905335,0.00021320271,0.00007423626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016961983,0.00019880242,0.00026505586,0.00012410854,0.0011708697,0.000097418364,0.00091942097,0.00011540643,0.000019738976],"category_scores_gemma":[0.000012473138,0.00019452425,0.00007324759,0.00009405434,0.00035345965,0.0004425247,0.000009004041,0.00040171642,0.0000011368352],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089421746,0.0023611665,0.0002135209,0.00074080203,0.002476037,0.0000024894928,0.20519929,0.20165972,0.24853769,0.016402153,0.00045922628,0.32105368],"study_design_scores_gemma":[0.00336491,0.00059885933,0.00078792626,0.0015371981,0.00041877967,0.000011938316,0.020238828,0.47057435,0.4894618,0.001542123,0.0102464715,0.0012168178],"about_ca_topic_score_codex":0.00017938564,"about_ca_topic_score_gemma":0.0005782913,"teacher_disagreement_score":0.84673655,"about_ca_system_score_codex":0.00006195738,"about_ca_system_score_gemma":0.000038290083,"threshold_uncertainty_score":0.9005502},"labels":[],"label_agreement":null},{"id":"W2767464508","doi":"10.1007/s11276-017-1605-z","title":"Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Université du Québec à Montréal","funders":"Electronic Components and Systems for European Leadership; Bộ Giáo dục và Ðào tạo","keywords":"Eavesdropping; Computer science; Cognitive radio; Constraint (computer-aided design); Interference (communication); Performance metric; Channel (broadcasting); Computer network; Power (physics); Metric (unit); Channel state information; Computer security; Mathematical optimization; Telecommunications; Wireless; Mathematics","score_opus":0.010296717256972496,"score_gpt":0.25777343061874614,"score_spread":0.24747671336177363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767464508","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.97990465,0.003902702,0.012894677,0.00012659909,0.000027600257,0.00024769388,0.0000054871293,0.00013023331,0.0027603654],"genre_scores_gemma":[0.9763191,0.02306022,0.0004122135,0.000029604926,0.00002411821,0.000048126814,0.00006295794,0.000026846626,0.000016838443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990909,0.000061562845,0.00034677208,0.00017783987,0.00010450272,0.00021843],"domain_scores_gemma":[0.998561,0.00016092868,0.00019415338,0.00092270557,0.000101105026,0.000060063005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040386536,0.00016715772,0.00037985863,0.00031278373,0.0002049001,0.0000951914,0.0004074118,0.00021658251,0.000007648733],"category_scores_gemma":[0.00003504312,0.00019073204,0.000038858918,0.00044762873,0.00024647824,0.0003938236,0.00021329011,0.00038459952,2.395417e-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.00014542777,0.00014465285,0.43971428,0.00018511002,0.0010658674,0.0000024389274,0.004975463,0.45126918,0.00015758765,0.0130668795,0.00052483863,0.088748276],"study_design_scores_gemma":[0.00024221133,0.000017248602,0.24837735,0.00020685924,0.00006901116,0.0000012471774,0.000068802234,0.75064486,0.00009092912,0.000046321,0.000090589405,0.0001445631],"about_ca_topic_score_codex":0.00028616877,"about_ca_topic_score_gemma":0.00046075796,"teacher_disagreement_score":0.29937568,"about_ca_system_score_codex":0.00005795728,"about_ca_system_score_gemma":0.000014013431,"threshold_uncertainty_score":0.7777827},"labels":[],"label_agreement":null},{"id":"W2769254131","doi":"10.1109/vtcspring.2017.8108372","title":"Internal Collusive Eavesdropping of Interference Alignment Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia; Carleton University","funders":"","keywords":"Eavesdropping; Computer science; Computer network; Interference (communication); Decoding methods; Computer security; Channel (broadcasting); Telecommunications","score_opus":0.018125107760112655,"score_gpt":0.2640327968704162,"score_spread":0.24590768911030353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769254131","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.107886925,0.00022899956,0.5582585,0.0001509017,0.0002813473,0.00020924052,0.000004234088,0.00049730786,0.33248258],"genre_scores_gemma":[0.99632883,0.00021518825,0.00325413,0.000018999097,0.000019804249,0.000012162816,0.0000011070376,0.0000111681375,0.0001386223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.00001106359,0.00017933617,0.00006650653,0.0000667348,0.00009663931],"domain_scores_gemma":[0.9990882,0.000027274815,0.00007118446,0.0007427183,0.000040759514,0.000029845749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089335175,0.0000734574,0.00012501667,0.000034039327,0.000065148204,0.000049939994,0.00072160485,0.00004379432,0.000070991555],"category_scores_gemma":[0.000019915231,0.00007320849,0.000032095733,0.000017358008,0.000074179305,0.00012661345,0.00028590823,0.00010489387,0.000004997237],"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.00014796451,0.0005355062,0.05244083,0.0008127474,0.0015926564,0.00004838251,0.013959999,0.089886576,0.18194664,0.29617217,0.08214641,0.28031012],"study_design_scores_gemma":[0.00039296338,0.00008705029,0.010954037,0.0006682682,0.000016893826,0.000007032232,0.0002779658,0.68688333,0.29353625,0.0013546747,0.005374429,0.00044712308],"about_ca_topic_score_codex":0.00009703041,"about_ca_topic_score_gemma":0.000050544375,"teacher_disagreement_score":0.8884419,"about_ca_system_score_codex":0.0000403042,"about_ca_system_score_gemma":0.0000044059084,"threshold_uncertainty_score":0.29853556},"labels":[],"label_agreement":null},{"id":"W2769390761","doi":"10.1109/tcomm.2017.2776114","title":"Cooperative Secure Communication in Two-Hop Buffer-Aided Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Buffer (optical fiber); Hop (telecommunications); Spread spectrum; Telecommunications; Code division multiple access","score_opus":0.030481619510830667,"score_gpt":0.31254329822400323,"score_spread":0.28206167871317256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769390761","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.029195476,0.002735863,0.89881194,0.006627066,0.0005302261,0.0019442607,0.00015154884,0.0027630467,0.057240553],"genre_scores_gemma":[0.98055094,0.009203423,0.009149859,0.000109948756,0.000016698063,0.00070375914,0.000050397335,0.00007884712,0.00013614188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825144,0.00040143196,0.00058253197,0.00024040783,0.00019245039,0.0003317158],"domain_scores_gemma":[0.99002147,0.000533908,0.00015466547,0.008993543,0.0001860117,0.00011039237],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047669697,0.00031346225,0.00035069956,0.000290143,0.0016279429,0.00029591055,0.004085281,0.00018553161,0.00008102621],"category_scores_gemma":[0.000028005345,0.00037010436,0.00012513358,0.00031949207,0.00052932726,0.0007353751,0.000047778627,0.0015676599,0.00007244728],"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.000096945834,0.0020617116,0.00054888986,0.00008346467,0.0004297061,0.0000069655775,0.0080381185,0.8611524,0.004622398,0.034261815,0.003568292,0.08512926],"study_design_scores_gemma":[0.0018245609,0.0000678832,0.0018573931,0.00049914385,0.000067112494,0.000018908344,0.00053256954,0.969468,0.012671,0.0022847797,0.009730679,0.0009779828],"about_ca_topic_score_codex":0.00047703672,"about_ca_topic_score_gemma":0.009415312,"teacher_disagreement_score":0.95135546,"about_ca_system_score_codex":0.00026673297,"about_ca_system_score_gemma":0.00004344394,"threshold_uncertainty_score":0.99987507},"labels":[],"label_agreement":null},{"id":"W2772294983","doi":"10.1109/wcsp.2017.8171168","title":"Beneficial jamming design for interference alignment networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia; Carleton University","funders":"","keywords":"Eavesdropping; Jamming; Computer science; Interference (communication); Precoding; Zero-forcing precoding; Transmission (telecommunications); Scheme (mathematics); Computer network; Beamforming; Telecommunications; MIMO; Mathematics","score_opus":0.050204226494754714,"score_gpt":0.28514777880042225,"score_spread":0.23494355230566755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772294983","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.0037318526,0.000078274235,0.9901043,0.000113753806,0.00012463868,0.00024672446,0.0000016923908,0.00047550077,0.005123238],"genre_scores_gemma":[0.9276871,0.00011301598,0.071927525,0.000025619454,0.000059227077,0.00011370283,0.0000031308564,0.000018359635,0.00005233354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959326,0.000009233774,0.00012884554,0.00008083302,0.00004563729,0.00014216274],"domain_scores_gemma":[0.9991887,0.00007472825,0.00003290681,0.0006452358,0.000028452341,0.000029974022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016900788,0.00008202931,0.00009402916,0.00002326395,0.00017563772,0.00011919972,0.0005794961,0.000060255574,0.000021239628],"category_scores_gemma":[0.000027149592,0.00008426104,0.00003151944,0.000011067086,0.000022825685,0.0001280624,0.000098768935,0.000073772375,0.0000046008736],"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.00006947072,0.000105152394,0.00060687016,0.00014020038,0.00017407394,0.0000024926517,0.001655084,0.16797823,0.011271765,0.1236677,0.045165632,0.64916337],"study_design_scores_gemma":[0.00016315495,0.000049784296,0.00025207776,0.00005257591,0.000007803302,8.692521e-7,0.00004017388,0.93679535,0.05286939,0.0023427038,0.0072100502,0.00021604172],"about_ca_topic_score_codex":0.000020188767,"about_ca_topic_score_gemma":0.000031191874,"teacher_disagreement_score":0.9239552,"about_ca_system_score_codex":0.00003758331,"about_ca_system_score_gemma":0.0000041097696,"threshold_uncertainty_score":0.34360653},"labels":[],"label_agreement":null},{"id":"W2774408587","doi":"10.1109/pacrim.2017.8121886","title":"An improved cooperative jamming strategy for PHY security in a multi-hop communications system","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Jamming; Secrecy; Computer science; Beamforming; Relay; Physical layer; Wireless; Hop (telecommunications); Computer network; PHY; Communications system; Optimization problem; Mathematical optimization; Distributed computing; Computer security; Telecommunications; Algorithm; Mathematics","score_opus":0.06503890250745029,"score_gpt":0.34855942051525546,"score_spread":0.2835205180078052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774408587","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.4322108,0.001455378,0.49112767,0.0012070173,0.000349096,0.007701646,0.0004026584,0.008164234,0.05738151],"genre_scores_gemma":[0.96161413,0.00010107253,0.037572216,0.000015311258,0.000014554617,0.00057828246,0.000046208934,0.000037484206,0.000020750236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.00008235011,0.00032578062,0.00017012948,0.000060025017,0.00021465316],"domain_scores_gemma":[0.99658746,0.000105371655,0.00008375114,0.00298945,0.00016512547,0.00006883147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037610452,0.00016308874,0.00023974843,0.000090283465,0.00040663057,0.00025199796,0.0017095369,0.00012904013,0.000004876142],"category_scores_gemma":[0.000055483466,0.00017344963,0.000046135923,0.00006366065,0.00010449946,0.00062492595,0.00018684007,0.0002772015,0.0000045674383],"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.00015105575,0.0026074986,0.0058925427,0.0025966067,0.00050937926,0.00000988658,0.049676765,0.0110060135,0.2552801,0.5792032,0.0017607289,0.09130622],"study_design_scores_gemma":[0.0006223186,0.000050741728,0.00073549076,0.00007820827,0.0000063107295,0.0000014755576,0.0023699333,0.98410094,0.010809356,0.00012277608,0.0008653119,0.00023714901],"about_ca_topic_score_codex":0.0005852096,"about_ca_topic_score_gemma":0.006158296,"teacher_disagreement_score":0.97309494,"about_ca_system_score_codex":0.00014316723,"about_ca_system_score_gemma":0.000028438682,"threshold_uncertainty_score":0.7073071},"labels":[],"label_agreement":null},{"id":"W2781303461","doi":"10.1109/cns.2017.8228670","title":"Physical layer security using BCH and LDPC codes with adaptive granular HARQ","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université Laval","funders":"","keywords":"Hybrid automatic repeat request; Retransmission; Computer science; Low-density parity-check code; BCH code; Decoding methods; Forward error correction; Algorithm; Automatic repeat request; Computer network; Channel (broadcasting); Network packet; Telecommunications link","score_opus":0.031705284060681245,"score_gpt":0.28045966703240766,"score_spread":0.24875438297172642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781303461","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.97583157,0.00011222729,0.015550903,0.00008382306,0.000013832538,0.00014108274,0.000007673052,0.00048078177,0.007778088],"genre_scores_gemma":[0.98822296,0.000054649394,0.011619737,0.000017476425,0.000030809653,0.000011551679,0.000001888622,0.000025650796,0.000015268222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995172,0.00002039099,0.00008101548,0.0001276096,0.00011281817,0.00014098],"domain_scores_gemma":[0.99914134,0.000031885294,0.00003380353,0.000687396,0.000050687544,0.000054881428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007508138,0.0001294123,0.00017404833,0.000032023003,0.00021020755,0.00012364765,0.00028130598,0.000052904375,0.000009788072],"category_scores_gemma":[0.000009174967,0.00011125283,0.000023114564,0.000029369454,0.00014909077,0.0003371725,0.00012749399,0.00018636431,0.000003962894],"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.00035937407,0.0011433793,0.084189974,0.0009153751,0.0011512946,0.0001374661,0.034241684,0.004814097,0.3325025,0.50193095,0.0061839987,0.0324299],"study_design_scores_gemma":[0.00059892517,0.000088146066,0.009804519,0.00014161784,0.000052513027,0.000024236393,0.00028773706,0.793371,0.1846716,0.0085503375,0.0017827449,0.00062659144],"about_ca_topic_score_codex":0.00022185195,"about_ca_topic_score_gemma":0.00020235927,"teacher_disagreement_score":0.78855693,"about_ca_system_score_codex":0.000025188523,"about_ca_system_score_gemma":0.000007424643,"threshold_uncertainty_score":0.4536759},"labels":[],"label_agreement":null},{"id":"W2786414161","doi":"10.48550/arxiv.1805.01974","title":"Lossy Transmission of Correlated Sources over Two-Way Channels","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Converse; Additive white Gaussian noise; Lossy compression; Gaussian; Coding (social sciences); Mathematics; Modulo; Algorithm; Topology (electrical circuits); Computer science; White noise; Discrete mathematics; Statistics; Physics; Combinatorics; Geometry","score_opus":0.04179865623046022,"score_gpt":0.20075382024091612,"score_spread":0.1589551640104559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786414161","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.8642348,0.00038533288,0.12854932,0.000013746068,0.00030362574,0.00031542798,0.000033509426,0.0010294431,0.0051347637],"genre_scores_gemma":[0.99770045,0.0012224681,0.00055489654,0.000010612755,0.00005590989,0.0000014296006,0.00005370102,0.00006328999,0.00033725458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.000102165795,0.0003066652,0.00042361708,0.0000955549,0.00025513227],"domain_scores_gemma":[0.99829364,0.00008048958,0.00017863506,0.001167498,0.0001580648,0.000121701574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018030369,0.00033685056,0.00043582675,0.00033846687,0.00007032525,0.0000277571,0.001075553,0.0004998611,0.00028117048],"category_scores_gemma":[0.00001014435,0.00041055205,0.00021836687,0.00038784472,0.0002120529,0.0001519916,0.00048225737,0.0007293893,0.000038252878],"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.00012120716,0.00022856357,0.0024673494,0.00094513915,0.00053262204,0.00006435906,0.0026917118,0.97059494,0.00418928,0.013374016,0.0029298184,0.0018609703],"study_design_scores_gemma":[0.0007447182,0.00006140125,0.00056241866,0.0008644711,0.00016067493,0.000003079203,0.000082681865,0.94882333,0.029511604,0.01305287,0.0053421077,0.00079062255],"about_ca_topic_score_codex":0.00014865618,"about_ca_topic_score_gemma":0.000013034303,"teacher_disagreement_score":0.13346562,"about_ca_system_score_codex":0.00014097951,"about_ca_system_score_gemma":0.00003806572,"threshold_uncertainty_score":0.99983466},"labels":[],"label_agreement":null},{"id":"W2790153540","doi":"10.1109/twc.2018.2812881","title":"Multi-Hop Routing in Covert Wireless Networks","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Covert; Computer science; Computer network; Alice and Bob; Hop (telecommunications); Key (lock); Wireless; Wireless network; Covert channel; Transmission (telecommunications); Alice (programming language); Telecommunications; Computer security","score_opus":0.03800853480962164,"score_gpt":0.2901884406262545,"score_spread":0.25217990581663285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790153540","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.04288521,0.00088509993,0.94763106,0.0005441251,0.0011778836,0.0015435865,0.00028000053,0.0033824327,0.0016705854],"genre_scores_gemma":[0.96214074,0.015296406,0.01998575,0.00015382364,0.00008010517,0.0017191924,0.00021953143,0.00030994727,0.00009449293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586344,0.0006329796,0.0015150657,0.0007541142,0.00044192764,0.0007924977],"domain_scores_gemma":[0.98998153,0.000737907,0.0003213408,0.008396493,0.00033754413,0.0002251916],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00072892767,0.0009143694,0.0010200171,0.00091517903,0.00061460544,0.00026362648,0.0050727134,0.0012765492,0.000072268136],"category_scores_gemma":[0.000013045467,0.0011691056,0.0004180251,0.0010087211,0.0006140533,0.00032576823,0.00019160013,0.0051954817,0.000109343295],"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.00008045615,0.0030643072,0.0004026906,0.0005612589,0.0007896085,0.0000125330835,0.00559162,0.89196736,0.003467308,0.0017194913,0.0019518185,0.09039155],"study_design_scores_gemma":[0.0006302409,0.00003435518,0.00028203626,0.0013250437,0.000079693484,0.00000785245,0.00017239248,0.9901797,0.005065215,0.0001792571,0.00093453936,0.0011096792],"about_ca_topic_score_codex":0.00054877833,"about_ca_topic_score_gemma":0.0043103937,"teacher_disagreement_score":0.9276453,"about_ca_system_score_codex":0.0009525758,"about_ca_system_score_gemma":0.00016889028,"threshold_uncertainty_score":0.9990759},"labels":[],"label_agreement":null},{"id":"W2791803390","doi":"10.1109/globalsip.2017.8308617","title":"An algorithm for optimal secure signaling over cognitive radio MIMO channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Ottawa","funders":"","keywords":"MIMO; Cognitive radio; Backtracking; Computer science; Algorithm; Maximization; Constraint (computer-aided design); Channel (broadcasting); Interference (communication); Transmitter power output; Transmitter; Mathematical optimization; Wireless; Mathematics; Telecommunications","score_opus":0.02284068689941194,"score_gpt":0.3000640360019784,"score_spread":0.27722334910256646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791803390","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.067826875,0.0001781437,0.92701787,0.00006703379,0.00015947578,0.0004994759,0.000080662256,0.0011129655,0.003057521],"genre_scores_gemma":[0.86665237,0.000048227088,0.13277423,0.00004626971,0.00017070705,0.00013937094,0.000047838897,0.00004977471,0.00007123509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993265,0.00001813838,0.00016190998,0.00016493502,0.000103819824,0.00022468372],"domain_scores_gemma":[0.9990312,0.0000868737,0.0000527872,0.00063684286,0.00010813345,0.00008419742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018454225,0.00015500914,0.00017742596,0.00006108445,0.00026883063,0.0002280617,0.00057148485,0.00012471572,0.0000956104],"category_scores_gemma":[0.000028603026,0.00016504225,0.00006862749,0.00002703069,0.0000576463,0.0005313786,0.00006492689,0.00016004744,0.000008677184],"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.00009051468,0.00059096125,0.00049745856,0.00040179008,0.0009330593,0.000032255717,0.012908662,0.00822672,0.06604119,0.027253207,0.017101554,0.86592263],"study_design_scores_gemma":[0.0005455875,0.00007555764,0.00015628467,0.00007189914,0.00002134601,0.0000039309716,0.00021637755,0.84389555,0.1501317,0.000533934,0.0040054577,0.0003423914],"about_ca_topic_score_codex":0.000030015515,"about_ca_topic_score_gemma":0.000008145402,"teacher_disagreement_score":0.86558026,"about_ca_system_score_codex":0.00003145699,"about_ca_system_score_gemma":0.00001024683,"threshold_uncertainty_score":0.67302275},"labels":[],"label_agreement":null},{"id":"W2792456449","doi":"10.1109/lcomm.2018.2807425","title":"Distributed-Relay Beamforming for Secrecy Energy Efficiency With Coordinated Eavesdroppers","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Beamforming; Computer science; Secrecy; Computer network; Efficient energy use; Energy (signal processing); Computer security; Telecommunications; Electrical engineering; Engineering; Power (physics); Mathematics","score_opus":0.01576881900403084,"score_gpt":0.24671002828887,"score_spread":0.23094120928483916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792456449","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.05545261,0.00022219383,0.93713355,0.0030986639,0.00012560019,0.00038488407,0.00009581294,0.0014867161,0.0019999396],"genre_scores_gemma":[0.94440126,0.00020957289,0.053958204,0.0005957733,0.000051296203,0.00040313,0.00028750746,0.00007300536,0.00002026367],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988746,0.00007505622,0.00034918936,0.00019574529,0.00014138987,0.00036403214],"domain_scores_gemma":[0.99663955,0.00027689687,0.00009003156,0.0027047435,0.00019918289,0.00008958545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020566801,0.00023519316,0.00022078455,0.00019698974,0.00051543576,0.000076113516,0.0018681104,0.00010075738,0.000008167473],"category_scores_gemma":[0.000027446038,0.00023912513,0.000076291624,0.0005847359,0.00054991926,0.00024713684,0.00014916096,0.00025701016,0.000014003223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020783668,0.0011093462,0.001660993,0.00034264568,0.0013960596,0.000010094358,0.01108183,0.058057476,0.5969147,0.11578868,0.16328286,0.050147507],"study_design_scores_gemma":[0.0018180568,0.00038596886,0.00022866252,0.0003858371,0.00015681748,0.00008235236,0.00056786364,0.35867515,0.19658603,0.0005028847,0.43881118,0.0017991944],"about_ca_topic_score_codex":0.000053910306,"about_ca_topic_score_gemma":0.00017931357,"teacher_disagreement_score":0.8889486,"about_ca_system_score_codex":0.00018935215,"about_ca_system_score_gemma":0.000027267415,"threshold_uncertainty_score":0.975124},"labels":[],"label_agreement":null},{"id":"W2793222875","doi":"10.1049/iet-com.2017.0719","title":"Maximising the degrees of freedom of the physical‐layer secured relay networks with artificial jamming","year":2018,"lang":"en","type":"article","venue":"IET Communications","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Jamming; Physical layer; Degrees of freedom (physics and chemistry); Relay; Computer science; Layer (electronics); Telecommunications; Computer network; Physics; Nanotechnology; Materials science; Quantum mechanics; Wireless","score_opus":0.029828621906412216,"score_gpt":0.26204911993757396,"score_spread":0.23222049803116174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793222875","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.89014304,0.0023471192,0.07807525,0.005053815,0.00026006202,0.0013450852,0.000051609288,0.0008974904,0.021826552],"genre_scores_gemma":[0.9841434,0.00013331414,0.015547503,0.000019123443,0.000060506074,0.000045923713,0.0000066887774,0.000033011787,0.000010570836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906105,0.00019252635,0.0003288924,0.00008601701,0.00018167366,0.00014984315],"domain_scores_gemma":[0.995279,0.00043968967,0.0001761742,0.0038422218,0.00023928989,0.000023608172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026857606,0.00012679382,0.00018658629,0.000044421653,0.00033625416,0.000025496214,0.0022825303,0.00006976467,0.000007677648],"category_scores_gemma":[0.000050025767,0.000082166735,0.00008533229,0.0005259973,0.0010195778,0.000099090044,0.0004825273,0.0004252498,0.00000277652],"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.00011281277,0.0012501412,0.005821159,0.00017929381,0.0010140055,4.775857e-7,0.08358985,0.50872105,0.07864983,0.27141947,0.009279015,0.03996291],"study_design_scores_gemma":[0.00019439597,0.000090052825,0.005369805,0.00034674673,0.00011243552,0.0000057332027,0.0016619437,0.95940286,0.024055226,0.001037568,0.0074449764,0.00027823096],"about_ca_topic_score_codex":0.00011173788,"about_ca_topic_score_gemma":0.0011270725,"teacher_disagreement_score":0.45068187,"about_ca_system_score_codex":0.00002975799,"about_ca_system_score_gemma":0.000025848662,"threshold_uncertainty_score":0.42415473},"labels":[],"label_agreement":null},{"id":"W2796716076","doi":"10.31130/jst.2016.19","title":"Secrecy Rate and Optimal Power Allocation of the Amplify-and-Forward Relay Wire-Tap System","year":2016,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Relay; Secrecy; Rayleigh fading; Computer science; Power (physics); Mathematical optimization; Channel (broadcasting); Fading; Mathematics; Computer network; Computer security","score_opus":0.004740927597454902,"score_gpt":0.17728299911534254,"score_spread":0.17254207151788764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796716076","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.9928461,0.0003433403,0.0043374225,0.0021707427,0.000024343848,0.00005827824,0.0000016448732,0.000028928045,0.00018921621],"genre_scores_gemma":[0.9983384,0.0006184777,0.0010227655,0.0000043455952,0.0000017917104,7.373743e-8,2.3678874e-8,0.0000021878548,0.000011928766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996184,0.000024916528,0.000110782756,0.00005262683,0.000113828675,0.00007944786],"domain_scores_gemma":[0.9993986,0.00005293483,0.00014231149,0.00020621844,0.00017632729,0.000023642197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825146,0.000043891305,0.00011133305,0.000189905,0.00014701145,0.0000054384377,0.0005310068,0.000057156023,0.0000012368968],"category_scores_gemma":[0.000050491097,0.00002548071,0.000013816912,0.00030413433,0.0018111516,0.00020190101,0.00019482485,0.00011775625,1.8974175e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044091525,0.00003363405,0.008149066,0.00011199137,0.00010322893,0.0000070451615,0.004591877,0.00010219909,0.7288174,0.2236356,0.0003112881,0.03409259],"study_design_scores_gemma":[0.0040576616,0.0014127761,0.1191518,0.0036083458,0.0004909596,0.0018567445,0.07564125,0.011733469,0.75174236,0.012597724,0.016798463,0.0009084534],"about_ca_topic_score_codex":0.000010627033,"about_ca_topic_score_gemma":0.000005498256,"teacher_disagreement_score":0.21103787,"about_ca_system_score_codex":0.000043579304,"about_ca_system_score_gemma":0.000036977253,"threshold_uncertainty_score":0.6673264},"labels":[],"label_agreement":null},{"id":"W2796907741","doi":"10.31130/jst.2017.34","title":"Energy Detection with Diversity Reception","year":2017,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University; University of Alberta; Huawei Technologies (Canada)","funders":"","keywords":"Nakagami distribution; Rician fading; Monte Carlo method; Computer science; Energy (signal processing); Moment-generating function; Algorithm; False alarm; Probability density function; Applied mathematics; Diversity scheme; Square (algebra); Detector; Statistical physics; Diversity combining; Topology (electrical circuits); Fading; Channel (broadcasting); Mathematics; Statistics; Telecommunications; Physics; Combinatorics","score_opus":0.008682214355228264,"score_gpt":0.18558318225173948,"score_spread":0.17690096789651122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796907741","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.98614955,0.00009185284,0.012091883,0.00097313744,0.000027835868,0.000017367873,4.330868e-7,0.000037866455,0.00061006955],"genre_scores_gemma":[0.998343,0.0006725054,0.0009677174,0.0000029063103,0.0000034233071,1.4217403e-8,2.6205702e-8,0.0000013287777,0.000009070867],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972004,0.0000067769806,0.000046123274,0.00003824676,0.00012844976,0.00006034426],"domain_scores_gemma":[0.9993858,0.000009347052,0.00012525386,0.00024539983,0.0002160434,0.000018160548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028193888,0.000031418916,0.00006989196,0.00022792607,0.00085817586,0.000011488789,0.00085992296,0.000038676502,0.0000018039962],"category_scores_gemma":[0.000020960844,0.000024731531,0.000010116528,0.00018391055,0.0019919302,0.00037330738,0.000292649,0.000113976756,2.1412475e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085219406,0.000049412993,0.015031126,0.000029174817,0.00009236086,0.000026355261,0.0035215484,0.00013328802,0.34321955,0.017298376,0.0004963796,0.62001723],"study_design_scores_gemma":[0.001992266,0.0014053533,0.09098169,0.00043286767,0.00021370519,0.00067339226,0.020880127,0.011229883,0.8195456,0.021829387,0.030272046,0.0005436603],"about_ca_topic_score_codex":0.0000847254,"about_ca_topic_score_gemma":0.0001601236,"teacher_disagreement_score":0.6194735,"about_ca_system_score_codex":0.000044261567,"about_ca_system_score_gemma":0.000019720792,"threshold_uncertainty_score":0.733935},"labels":[],"label_agreement":null},{"id":"W2799710179","doi":"10.1109/tit.2018.2834516","title":"Capacity Achieving Distributions and Separation Principle for Feedback Gaussian Channels With Memory: the LQG Theory of Directed Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Ottawa","funders":"","keywords":"Linear-quadratic-Gaussian control; Information theory; Separation principle; Gaussian; Separation (statistics); Computer science; Control theory (sociology); Mathematics; Control (management); Artificial intelligence; Statistics; Machine learning; Physics","score_opus":0.0127012307515208,"score_gpt":0.2407918347222992,"score_spread":0.2280906039707784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799710179","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.05593637,0.000011563786,0.9400139,0.00013100321,0.00016038159,0.00083170744,0.00026810568,0.0005517633,0.0020952069],"genre_scores_gemma":[0.9962641,0.000039815786,0.003134917,0.0000800607,0.000023314704,0.00033845683,0.000086638494,0.000013375575,0.000019329133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990037,0.00012460127,0.0004581474,0.00006725433,0.00017605638,0.00017025658],"domain_scores_gemma":[0.99869317,0.00033206635,0.00018011194,0.00043258828,0.00031173276,0.000050347026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081023434,0.0001723464,0.0001611326,0.00021742609,0.00046642046,0.000098950644,0.00020869903,0.00011968462,0.000034991383],"category_scores_gemma":[0.000036221605,0.00013423526,0.000055088356,0.0003260653,0.000292369,0.002208456,0.0000033768633,0.00023127277,0.000017420896],"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.0017452019,0.00023150597,0.000028677525,0.0010905849,0.0006915942,7.958274e-8,0.07538481,0.063616864,0.0024622583,0.5242901,0.001091242,0.32936707],"study_design_scores_gemma":[0.0036019695,0.0011667748,0.0022496989,0.0006515933,0.00038389213,0.000054323245,0.0077066673,0.40472975,0.5189797,0.028079811,0.030933034,0.0014627292],"about_ca_topic_score_codex":0.0000066417647,"about_ca_topic_score_gemma":0.000016540605,"teacher_disagreement_score":0.9403277,"about_ca_system_score_codex":0.00008541714,"about_ca_system_score_gemma":0.000029307706,"threshold_uncertainty_score":0.54739547},"labels":[],"label_agreement":null},{"id":"W2799779867","doi":"10.1109/isit.2018.8437918","title":"Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Independent and identically distributed random variables; Energy (signal processing); Transmitter power output; Mathematics; Dirty paper coding; Additive white Gaussian noise; Block (permutation group theory); Channel (broadcasting); Gaussian process; Gaussian; Markov process; Discrete mathematics; Combinatorics; Statistics; Transmitter; Random variable; Computer science; Telecommunications; White noise; Physics; Precoding; MIMO","score_opus":0.024242680907298378,"score_gpt":0.2804427690806926,"score_spread":0.25620008817339424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799779867","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.26777324,0.0073347525,0.6648287,0.0011290901,0.0010235141,0.0032675448,0.00014374175,0.0049219113,0.04957747],"genre_scores_gemma":[0.9354892,0.002817648,0.059686687,0.00008131181,0.00021653327,0.00068499823,0.00012158875,0.00014668563,0.00075537007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984737,0.000024184475,0.00048223688,0.00047579213,0.0001414826,0.00040257585],"domain_scores_gemma":[0.99863374,0.00016352841,0.00009579898,0.000840373,0.00010967322,0.00015689745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037350736,0.00046911073,0.0005463557,0.00022558954,0.00016559292,0.00028644814,0.00051340205,0.0004711098,0.000029463297],"category_scores_gemma":[0.000026989255,0.00048196112,0.000098528915,0.00009550682,0.00013694355,0.00018736448,0.00054240215,0.00044110458,0.0000047160374],"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.00045862058,0.0017898,0.028555647,0.06852941,0.008665963,0.000053404816,0.029270072,0.048825294,0.05145994,0.2985862,0.054519176,0.40928647],"study_design_scores_gemma":[0.00090226904,0.00027295665,0.000840925,0.0023991093,0.00029038443,0.00003941387,0.00020667537,0.8385663,0.08650299,0.027067361,0.0406358,0.0022758355],"about_ca_topic_score_codex":0.0004668332,"about_ca_topic_score_gemma":0.00018375592,"teacher_disagreement_score":0.789741,"about_ca_system_score_codex":0.000060649458,"about_ca_system_score_gemma":0.00003563163,"threshold_uncertainty_score":0.9997632},"labels":[],"label_agreement":null},{"id":"W2802595113","doi":"10.1109/access.2018.2833423","title":"Cascaded &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$\\alpha-\\mu$ &lt;/tex-math&gt; &lt;/inline-formula&gt; Fading Channels: Reliability and Security Analysis","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"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":"Fading; Nakagami distribution; Fading distribution; Cumulative distribution function; Weibull fading; Mathematics; Algorithm; Probability density function; Rayleigh fading; Statistics; Computer science; Topology (electrical circuits); Applied mathematics; Combinatorics; Decoding methods","score_opus":0.022910769159939826,"score_gpt":0.2939410104852559,"score_spread":0.27103024132531606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802595113","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.9624027,0.0017516658,0.02741535,0.0005742504,0.0010174313,0.0015064854,0.00032891444,0.0028982554,0.002104918],"genre_scores_gemma":[0.9904079,0.0022295837,0.005027042,0.00029768373,0.0008393918,0.00037378157,0.00037799982,0.00028199292,0.00016461776],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926292,0.0003937033,0.0023883807,0.0016250083,0.00138998,0.0015737407],"domain_scores_gemma":[0.99276286,0.00077207474,0.00078317703,0.0036222455,0.0013878495,0.0006717687],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002435265,0.0013745672,0.0019091129,0.0014584967,0.0009325967,0.0010310917,0.0030892491,0.0010484748,0.00015633309],"category_scores_gemma":[0.0006039087,0.001416756,0.0006787635,0.0035958958,0.0005975008,0.0034312531,0.0009953636,0.0012877622,0.00017180605],"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.0020100747,0.0077369343,0.038271952,0.011099676,0.020560758,0.00065285526,0.1263236,0.16975749,0.32338083,0.12716478,0.04956572,0.123475336],"study_design_scores_gemma":[0.0016910796,0.00021468331,0.007310033,0.00036899414,0.00097625016,0.000061837156,0.00009915378,0.8816299,0.06622098,0.005508073,0.033525843,0.0023932226],"about_ca_topic_score_codex":0.00031298806,"about_ca_topic_score_gemma":0.0016064707,"teacher_disagreement_score":0.71187234,"about_ca_system_score_codex":0.0007195119,"about_ca_system_score_gemma":0.00015925066,"threshold_uncertainty_score":0.9999005},"labels":[],"label_agreement":null},{"id":"W2803444851","doi":"10.1155/2018/9624856","title":"A Novel Approach to Enhance the Physical Layer Channel Security of Wireless Cooperative Vehicular Communication Using Decode‐and‐Forward Best Relaying Selection","year":2018,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"Alexandria University; United Arab Emirates University","keywords":"Computer science; Cooperative diversity; Computer network; Precoding; Wireless; Diversity gain; Transmission (telecommunications); Relay; Multipath propagation; Secrecy; Channel (broadcasting); Physical layer; Antenna diversity; Telecommunications; Fading; MIMO; Computer security","score_opus":0.025789521962851624,"score_gpt":0.3043111729875441,"score_spread":0.2785216510246925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803444851","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.81405854,0.0012597827,0.18286504,0.00011488236,0.00002755867,0.0007641216,0.000013648014,0.00024105379,0.00065535743],"genre_scores_gemma":[0.9685606,0.0011843158,0.029848624,0.000059289196,0.000058502083,0.00020162729,0.000025368752,0.00005786829,0.0000038123826],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832046,0.0002997627,0.0005474659,0.00032040634,0.00020454758,0.00030733185],"domain_scores_gemma":[0.99685836,0.00047695087,0.00021093425,0.0018421229,0.0005057637,0.000105874555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007068393,0.00029445032,0.00043565527,0.00015670202,0.0011565633,0.00011985443,0.0011869209,0.00014174983,9.477611e-7],"category_scores_gemma":[0.00003468078,0.00027919133,0.00006783996,0.00072724203,0.0006581252,0.0002525185,0.0013160801,0.00063748256,0.0000022508311],"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.00008041857,0.0026777321,0.0012698382,0.00080197625,0.0007199739,3.637542e-7,0.1820407,0.08417222,0.5138745,0.06273611,0.00022966629,0.1513965],"study_design_scores_gemma":[0.00016949314,0.00008748239,0.00011744966,0.00030196342,0.000045219713,0.000022179693,0.0022803482,0.97133744,0.024551932,0.00014738899,0.00063772633,0.000301371],"about_ca_topic_score_codex":0.00033524667,"about_ca_topic_score_gemma":0.00011698879,"teacher_disagreement_score":0.88716525,"about_ca_system_score_codex":0.00010439065,"about_ca_system_score_gemma":0.000038479848,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W2804928260","doi":"10.1109/icct.2017.8359631","title":"Secrecy capacity of artificial noise aided Rician/Rayleigh MIMO channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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":"Partenariat Canadien Contre Le Cancer; National Science Foundation","keywords":"Rician fading; Artificial noise; MIMO; Secrecy; Computer science; Rayleigh fading; Transmitter; Fading; Null (SQL); Electronic engineering; Computer network; Topology (electrical circuits); Channel (broadcasting); Engineering; Computer security; Electrical engineering; Data mining","score_opus":0.044235908283522384,"score_gpt":0.2677719508269214,"score_spread":0.223536042543399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804928260","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.92187685,0.00006119133,0.029101325,0.0002112086,0.0002610048,0.00022341653,0.000018454408,0.0008240897,0.047422472],"genre_scores_gemma":[0.9932878,0.00005184352,0.0064119017,0.000029073897,0.00007548588,0.000024927454,0.000004994322,0.000026683001,0.000087259665],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999231,0.000025424959,0.00029427905,0.00011847665,0.00014735147,0.00018349737],"domain_scores_gemma":[0.99838185,0.000044908673,0.00009644921,0.0013281195,0.00008806841,0.00006062487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019347356,0.00013429919,0.00023054809,0.00008790042,0.00014802247,0.00006992746,0.00075859524,0.00012044051,0.00015911779],"category_scores_gemma":[0.00008547479,0.00013965517,0.00007414059,0.00005775614,0.00011530452,0.0002556745,0.00013256982,0.00018335352,0.000043142034],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044551532,0.00043981432,0.0041027525,0.0004962363,0.00024634533,0.000008811471,0.004706785,0.0019517201,0.6066539,0.3272328,0.009917837,0.044198412],"study_design_scores_gemma":[0.00015653463,0.000027124992,0.004618344,0.00005945923,0.000012763689,0.0000021644541,0.00006742187,0.02671527,0.9504406,0.014618487,0.0029749253,0.00030691814],"about_ca_topic_score_codex":0.00035881688,"about_ca_topic_score_gemma":0.00016097669,"teacher_disagreement_score":0.34378666,"about_ca_system_score_codex":0.000038160593,"about_ca_system_score_gemma":0.000010251998,"threshold_uncertainty_score":0.5694973},"labels":[],"label_agreement":null},{"id":"W2807810272","doi":"10.1109/wcnc.2018.8377208","title":"Secrecy performance analysis over mixed α-μ and κ-μ fading channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Fading; Secrecy; Computer science; Telecommunications; Computer network; Computer security; Channel (broadcasting)","score_opus":0.01258731645188198,"score_gpt":0.23773340254869665,"score_spread":0.22514608609681466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807810272","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.9386124,0.00011084521,0.044364836,0.000026027521,0.000047274112,0.000051916475,0.0000010985112,0.0006799471,0.016105644],"genre_scores_gemma":[0.99587196,0.00020736914,0.0036645643,0.000037540412,0.00004440249,0.000010862387,0.000004515674,0.000012884972,0.00014591603],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995865,0.000011587561,0.000116466574,0.000090849615,0.000071630995,0.00012296079],"domain_scores_gemma":[0.9995684,0.000023936322,0.000013547366,0.00031869303,0.00003434917,0.000041089148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113936105,0.00008111238,0.00012279513,0.00018203513,0.00005958452,0.000039085415,0.00014209587,0.000049593265,0.00023435554],"category_scores_gemma":[0.0000056148124,0.00008032315,0.000029362118,0.00040153338,0.000044057197,0.00017912418,0.00006424074,0.00007232057,0.000018776234],"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.000058959984,0.00022830379,0.3783834,0.00083842146,0.006180797,0.000006405193,0.034169756,0.014521706,0.08823397,0.09760701,0.022850871,0.35692042],"study_design_scores_gemma":[0.00011188811,0.000028195684,0.038522687,0.000017352784,0.000069440575,0.0000017459884,0.00005192222,0.8731364,0.08100865,0.00035291642,0.0064500347,0.00024879412],"about_ca_topic_score_codex":0.000027390503,"about_ca_topic_score_gemma":0.000065193,"teacher_disagreement_score":0.8586147,"about_ca_system_score_codex":0.00002164327,"about_ca_system_score_gemma":0.000001999538,"threshold_uncertainty_score":0.3275483},"labels":[],"label_agreement":null},{"id":"W2808669017","doi":"10.1109/tdsc.2018.2846258","title":"Physical Layer based Message Authentication with Secure Channel Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; China Postdoctoral Science Foundation","keywords":"Computer science; Authentication (law); Message authentication code; Authentication protocol; Computer network; Physical layer; Data Authentication Algorithm; PHY; Hash function; Channel (broadcasting); Theoretical computer science; Computer security; Cryptography; Wireless","score_opus":0.013347861099777187,"score_gpt":0.2423302788624251,"score_spread":0.22898241776264794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808669017","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.30600294,0.000055135442,0.6923467,0.00011708718,0.00008181524,0.00017289219,0.000015721756,0.00069036294,0.0005173525],"genre_scores_gemma":[0.99508345,0.0000221617,0.004625995,0.00008036772,0.00008345837,0.000022810082,0.000007926506,0.000051446455,0.00002240133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905246,0.0000558672,0.00018281308,0.00025269832,0.00019529006,0.00026088647],"domain_scores_gemma":[0.9992543,0.00011243623,0.000044356548,0.00039364264,0.00010724277,0.00008805745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392589,0.00022311143,0.00021951899,0.00014333703,0.0003439024,0.00008426919,0.0001983831,0.00010592345,0.000022933042],"category_scores_gemma":[0.0000019286758,0.0002090632,0.000051008075,0.00027824694,0.000092899725,0.00016853464,0.0000032205348,0.00037882527,0.000018086459],"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.00063646433,0.0028260073,0.00020727454,0.0017878815,0.0013752219,0.00007139236,0.061595585,0.5922557,0.16169481,0.007122875,0.0030477915,0.16737898],"study_design_scores_gemma":[0.00033355987,0.00013704492,0.000039108614,0.00013781339,0.000038982558,0.000013140976,0.00018333204,0.7940019,0.2042344,0.00016716066,0.00046117438,0.0002524113],"about_ca_topic_score_codex":0.000018361405,"about_ca_topic_score_gemma":0.00009942509,"teacher_disagreement_score":0.6890805,"about_ca_system_score_codex":0.000041456333,"about_ca_system_score_gemma":0.000020170986,"threshold_uncertainty_score":0.852535},"labels":[],"label_agreement":null},{"id":"W2815431952","doi":"10.1109/access.2018.2853700","title":"On Physical Layer Security Over the Fisher-Snedecor ${\\mathcal{F}}$ Wiretap Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":82,"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 à Montréal","funders":"","keywords":"Secrecy; Physical layer; Fading; Computer science; Channel (broadcasting); Monte Carlo method; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Wireless; Computer security; Statistics; Combinatorics","score_opus":0.035580162284374356,"score_gpt":0.32326989071966544,"score_spread":0.28768972843529106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2815431952","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.9844812,0.000045013803,0.0028973243,0.00033259083,0.0006825522,0.0002797267,0.000012186734,0.0010082418,0.0102611575],"genre_scores_gemma":[0.9984256,0.000037546808,0.000054684548,0.000549994,0.00073019095,0.00009771423,0.000004114975,0.00006070935,0.00003943886],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988789,0.000073930045,0.00021342821,0.00023083527,0.00028107213,0.00032185216],"domain_scores_gemma":[0.9985062,0.0002554494,0.00005588302,0.0010296698,0.00008003856,0.000072759925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019963764,0.00022857448,0.0002285408,0.00008183279,0.00019735792,0.00027026684,0.0013832333,0.00011591298,0.0001472161],"category_scores_gemma":[0.00003650926,0.00018047917,0.00010079952,0.00031913872,0.00014413254,0.0005299601,0.00018028058,0.00043498576,0.00016770934],"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.0002181053,0.0015666701,0.00399861,0.0006580761,0.0009759774,0.000053033305,0.06401554,0.010518258,0.05722295,0.058196,0.7540883,0.048488516],"study_design_scores_gemma":[0.0006237546,0.00017721309,0.0059684725,0.0002499234,0.000052384086,0.0000104477085,0.00007414454,0.38733378,0.514005,0.052275993,0.03811999,0.0011088682],"about_ca_topic_score_codex":0.00006303535,"about_ca_topic_score_gemma":0.00005977412,"teacher_disagreement_score":0.71596825,"about_ca_system_score_codex":0.00007902133,"about_ca_system_score_gemma":0.000010208292,"threshold_uncertainty_score":0.73597264},"labels":[],"label_agreement":null},{"id":"W2883492073","doi":"10.1109/vtcspring.2018.8417694","title":"Physical Layer Security through Secure Channel Estimation","year":2018,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Equivocation; Physical layer; Secrecy; Computer science; Channel (broadcasting); Computer network; Secure channel; Secure coding; Wireless; Computer security; Transceiver; Transmission (telecommunications); Secure communication; Telecommunications; Encryption; Information security","score_opus":0.01927952931537977,"score_gpt":0.2854918192754845,"score_spread":0.2662122899601047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883492073","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.48341826,0.00012911033,0.34853777,0.0009006726,0.00025554534,0.00040133848,0.000014743291,0.0061801733,0.1601624],"genre_scores_gemma":[0.9887788,0.000030402949,0.010749668,0.0001343319,0.00019008656,0.000034684257,0.000014845845,0.000029416531,0.00003772668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942183,0.000022688462,0.00013002288,0.00012088378,0.00013574601,0.0001687982],"domain_scores_gemma":[0.99935484,0.000028280649,0.000019139594,0.00048447776,0.000076413344,0.000036875204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006665767,0.00012768447,0.00012886665,0.00003488238,0.000068216854,0.000033328066,0.00025409664,0.00008282563,0.00008515357],"category_scores_gemma":[0.000014627032,0.00012544784,0.000042934375,0.00017747184,0.00006076213,0.00033796357,0.00007350662,0.00017454007,0.00028247928],"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.000033567438,0.000730924,0.000116859366,0.00040673162,0.0002463469,0.000006130799,0.083548844,0.0042663966,0.03280998,0.5759843,0.27842617,0.023423785],"study_design_scores_gemma":[0.000116637726,0.000041321906,0.000064898966,0.000022309967,0.0000071688332,0.0000036939612,0.000118047436,0.72104716,0.2039769,0.063339,0.011032849,0.00023001441],"about_ca_topic_score_codex":0.000026036532,"about_ca_topic_score_gemma":0.000033841483,"teacher_disagreement_score":0.7167808,"about_ca_system_score_codex":0.000040344028,"about_ca_system_score_gemma":0.0000059470344,"threshold_uncertainty_score":0.5115614},"labels":[],"label_agreement":null},{"id":"W2883612868","doi":"10.1109/access.2018.2859781","title":"A Collaborative PHY-Aided Technique for End-to-End IoT Device Authentication","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Computer science; Computer network; Cryptography; Authentication (law); Authentication protocol; Computer security","score_opus":0.03024612565095277,"score_gpt":0.3444718235006143,"score_spread":0.31422569784966153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883612868","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.13855857,0.0001292979,0.84914464,0.00079932413,0.00037052762,0.0030011064,0.00012269791,0.0019018414,0.005972026],"genre_scores_gemma":[0.9570115,0.00002431224,0.040395804,0.00023423151,0.00016912042,0.0020407196,0.000019895922,0.000056460667,0.000047951533],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990456,0.00004828338,0.00028869807,0.00022165252,0.00015634311,0.00023938656],"domain_scores_gemma":[0.99845296,0.00015714487,0.00007134509,0.00073938945,0.0004966086,0.000082529405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028866148,0.00017428881,0.00019640676,0.00020893598,0.00012882841,0.00014467996,0.0009379942,0.00012811978,0.00006341765],"category_scores_gemma":[0.00008487696,0.00019212067,0.00004135685,0.0007352642,0.00007842415,0.00031699063,0.00009481523,0.00013230996,0.000051592815],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006548875,0.00013140663,0.00021661508,0.00024824918,0.00012349187,0.0000011226257,0.0047430634,0.0002221601,0.93461114,0.008043476,0.03368768,0.017906075],"study_design_scores_gemma":[0.0001510718,0.000056592748,0.00042630968,0.000072540155,0.000016845617,0.000001578911,0.000046967194,0.00372849,0.94805735,0.0025584593,0.044632412,0.0002513638],"about_ca_topic_score_codex":0.000035733054,"about_ca_topic_score_gemma":0.00017357442,"teacher_disagreement_score":0.81845295,"about_ca_system_score_codex":0.00012208606,"about_ca_system_score_gemma":0.000045374636,"threshold_uncertainty_score":0.78344536},"labels":[],"label_agreement":null},{"id":"W2885421144","doi":"10.1109/tcomm.2018.2885800","title":"Robust Distributed Compression of Symmetrically Correlated Gaussian Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Compression (physics); Gaussian; Computer science; Gaussian process; Electronic engineering; Engineering; Physics","score_opus":0.03926466377736963,"score_gpt":0.2615554079986081,"score_spread":0.22229074422123846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885421144","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.01071948,0.00037854476,0.9787353,0.000518482,0.00021093563,0.00031994842,0.00022936569,0.0013417432,0.007546174],"genre_scores_gemma":[0.9819879,0.0010888685,0.016633287,0.000029731476,0.000014252057,0.00008493133,0.00006511468,0.000043865017,0.00005204451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00016731491,0.00052307866,0.00015207755,0.00021164968,0.00020426766],"domain_scores_gemma":[0.99643785,0.00041560014,0.00010757776,0.0026821163,0.00025620268,0.000100665355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016740254,0.00019110688,0.0002549335,0.0003756824,0.00041325635,0.00003279285,0.0014542823,0.00018049491,0.00012768482],"category_scores_gemma":[0.000014455063,0.000203402,0.00011380723,0.0011545126,0.00048741928,0.0001649529,0.000015768934,0.0005781882,0.0000713316],"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.00043826867,0.010532152,0.0009834686,0.0005768795,0.002389868,0.000005006937,0.014230402,0.44586167,0.14808762,0.029135088,0.034876566,0.312883],"study_design_scores_gemma":[0.0009753771,0.00033690274,0.0016568259,0.0005109371,0.00015791015,0.000016939552,0.00041385525,0.70238364,0.2615657,0.0007383751,0.030473866,0.00076966244],"about_ca_topic_score_codex":0.00007024906,"about_ca_topic_score_gemma":0.00012890066,"teacher_disagreement_score":0.9712684,"about_ca_system_score_codex":0.00009664248,"about_ca_system_score_gemma":0.000026971935,"threshold_uncertainty_score":0.8294493},"labels":[],"label_agreement":null},{"id":"W2885566751","doi":"10.23919/acc.2018.8430803","title":"Two-Way Gaussian Channels with an Intelligent Jammer","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Jamming; Nash equilibrium; Channel (broadcasting); Gaussian; Computer science; Gaussian noise; Noise (video); Mathematical optimization; Minimum mean square error; Game theory; Power (physics); Control theory (sociology); Mathematics; Algorithm; Telecommunications; Statistics; Mathematical economics; Artificial intelligence; Control (management); Physics","score_opus":0.022791109675782954,"score_gpt":0.27366796376344477,"score_spread":0.2508768540876618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885566751","genre_codex":"other","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.26819107,0.00017870918,0.3434301,0.00048588103,0.00024872206,0.00045409598,0.0000037752377,0.005218098,0.38178954],"genre_scores_gemma":[0.97353524,0.000040687548,0.02585605,0.00014414321,0.000116771334,0.000029561788,0.000006720064,0.000037071954,0.00023373701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994641,0.000020702382,0.00012758486,0.000114056325,0.00010091243,0.00017263198],"domain_scores_gemma":[0.9991838,0.000012759417,0.000014245327,0.0006447058,0.000059124,0.000085370695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009774058,0.00011451619,0.00009932116,0.00007692759,0.0000468074,0.000044563938,0.0003107327,0.000044230368,0.00064764306],"category_scores_gemma":[0.0000028491977,0.00009317515,0.00001648155,0.00014402378,0.00007634952,0.00018237095,0.000045761306,0.000114946764,0.00017417692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014544745,0.00067395996,0.0019905183,0.0001768368,0.00043599887,0.000024054027,0.02034099,0.0030235052,0.0307809,0.57857305,0.03966811,0.32416663],"study_design_scores_gemma":[0.0003251008,0.0005197234,0.00038903003,0.00008442778,0.0000142626495,0.00002519094,0.0006860793,0.08941471,0.7927466,0.0026439058,0.11245254,0.000698442],"about_ca_topic_score_codex":0.00007991019,"about_ca_topic_score_gemma":0.00025560101,"teacher_disagreement_score":0.7619657,"about_ca_system_score_codex":0.000032114767,"about_ca_system_score_gemma":0.000005722339,"threshold_uncertainty_score":0.70912373},"labels":[],"label_agreement":null},{"id":"W2885994734","doi":"10.1109/isit.2018.8437594","title":"Secure Key Agreement over Partially Corrupted Channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Calgary","keywords":"Alice and Bob; Adversary; Computer science; Key (lock); Disjoint sets; Channel (broadcasting); Cryptography; Shared secret; Key exchange; Set (abstract data type); Public-key cryptography; Theoretical computer science; Pre-shared key; Computer network; Computer security; Mathematics; Discrete mathematics; Alice (programming language); Encryption","score_opus":0.01685646573759275,"score_gpt":0.2558454098782533,"score_spread":0.23898894414066058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885994734","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.45624673,0.00045132716,0.18649659,0.0010003659,0.0012080938,0.0008287015,0.00001870091,0.0072464873,0.34650302],"genre_scores_gemma":[0.9945353,0.00007572481,0.0044119507,0.00027559546,0.00015595258,0.000035618996,0.00001102806,0.00002546285,0.000473321],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999345,0.000020250616,0.00018352116,0.00010934871,0.00014787744,0.0001939745],"domain_scores_gemma":[0.99926937,0.000019877187,0.000020170019,0.00055064,0.00007711036,0.000062852145],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010882671,0.00011857258,0.0001124695,0.000059905575,0.00005052707,0.00004020969,0.00030055468,0.00008092431,0.002020639],"category_scores_gemma":[0.000010152624,0.00011710602,0.000034452914,0.0001430526,0.000050712282,0.00011571995,0.00009424396,0.00011416175,0.00039542333],"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.00004831782,0.0003448891,0.0024234313,0.0001850343,0.0003878432,0.000014045137,0.013159121,0.0017004202,0.0802593,0.15874009,0.70091844,0.041819055],"study_design_scores_gemma":[0.00042126983,0.00013422538,0.0018178183,0.00006413671,0.000014701585,0.0000045868806,0.00009045134,0.15525433,0.23802994,0.0017365705,0.60188633,0.0005456267],"about_ca_topic_score_codex":0.000029060495,"about_ca_topic_score_gemma":0.0001458303,"teacher_disagreement_score":0.5382886,"about_ca_system_score_codex":0.00004413221,"about_ca_system_score_gemma":0.000007983443,"threshold_uncertainty_score":0.99889165},"labels":[],"label_agreement":null},{"id":"W2886433039","doi":"10.1109/access.2019.2944543","title":"On the Security Analysis of a Cooperative Incremental Relaying Protocol in the Presence of an Active Eavesdropper","year":2019,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Secure transmission; Information leakage; Secrecy; Channel state information; Relay; Physical layer; Secure communication; Jamming; Transmitter; Channel (broadcasting); Eavesdropping; Transmission (telecommunications); Context (archaeology); Wireless; Computer security; Telecommunications; Encryption; Power (physics)","score_opus":0.04493091673237438,"score_gpt":0.3611103299855469,"score_spread":0.3161794132531725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886433039","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.96357507,0.000010526492,0.00054024963,0.000064219224,0.00003923367,0.032733295,0.0001256577,0.00006861799,0.002843146],"genre_scores_gemma":[0.9622658,0.000014045381,0.00008167219,0.00004543105,0.000011480346,0.03753252,0.00002533311,0.000022077154,0.0000016776717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980101,0.00065492414,0.00050471356,0.0002619317,0.00042086796,0.0001474678],"domain_scores_gemma":[0.9970415,0.00066655723,0.0003022561,0.0018065625,0.00016390016,0.00001922476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079966965,0.00023367214,0.0004938258,0.0003511898,0.00004391657,0.0000828554,0.0027837502,0.00019664246,0.00004427373],"category_scores_gemma":[0.00009234709,0.00015430468,0.00013812842,0.000815871,0.0001307776,0.00022612259,0.00057555764,0.0010992612,0.0000010576939],"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.00036702314,0.0010753426,0.006860134,0.0012120953,0.0026591995,0.000005652513,0.07130948,0.89750373,0.011623665,0.0052850307,0.0008556347,0.0012430241],"study_design_scores_gemma":[0.00046338662,0.00014775447,0.016397223,0.00092725584,0.00031400722,8.4698627e-7,0.0021775507,0.50795245,0.467712,0.003276923,0.000071462484,0.00055912],"about_ca_topic_score_codex":0.00076278864,"about_ca_topic_score_gemma":0.0006306571,"teacher_disagreement_score":0.45608833,"about_ca_system_score_codex":0.00011370623,"about_ca_system_score_gemma":0.00005647852,"threshold_uncertainty_score":0.6292362},"labels":[],"label_agreement":null},{"id":"W2887629581","doi":"10.1109/icc.2018.8422837","title":"Improving Secrecy under High Correlation via Discriminatory Channel Estimation","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Secrecy; Precoding; Channel (broadcasting); Fading; Transmitter; Decoding methods; Artificial noise; Computer network; Wireless; Alice and Bob; Computer security; Transmission (telecommunications); Telecommunications; Alice (programming language); MIMO","score_opus":0.011070494415498485,"score_gpt":0.22996456200691476,"score_spread":0.21889406759141627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887629581","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.05853211,0.00004364891,0.93479705,0.0000917684,0.00021933053,0.00014003746,0.0000014237364,0.0015872164,0.0045874296],"genre_scores_gemma":[0.9772318,0.000011712729,0.02243798,0.00007033367,0.00006409216,0.00002961065,0.000035447447,0.000032730495,0.00008631332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943364,0.000022608807,0.0001827125,0.00011051957,0.00011275307,0.00013777478],"domain_scores_gemma":[0.99942875,0.00003806345,0.000035740097,0.00038338345,0.000073204006,0.000040887597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012321152,0.00011022398,0.00009011131,0.00010143031,0.00008847973,0.00003387548,0.00016803158,0.00009896688,0.000098994504],"category_scores_gemma":[0.00001601022,0.00011513089,0.000023388902,0.00012444454,0.000052175637,0.000360659,0.00005638847,0.00013070763,0.0001233222],"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.000023458326,0.00016234997,0.00018047707,0.00031942636,0.000103850485,0.0000016672781,0.005548889,0.06383409,0.0706513,0.4858538,0.004975914,0.36834478],"study_design_scores_gemma":[0.000086583495,0.000023077435,0.0014328199,0.000017637534,0.000007925584,0.0000022714137,0.00006363672,0.9480137,0.0341986,0.01591099,0.00009059617,0.00015215964],"about_ca_topic_score_codex":0.00014227854,"about_ca_topic_score_gemma":0.000050741946,"teacher_disagreement_score":0.9186997,"about_ca_system_score_codex":0.0001043165,"about_ca_system_score_gemma":0.000008103035,"threshold_uncertainty_score":0.46949014},"labels":[],"label_agreement":null},{"id":"W2887906137","doi":"10.1109/tcomm.2018.2881117","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Physical layer; Computer science; Authentication (law); Robustness (evolution); Authentication protocol; Lightweight Extensible Authentication Protocol; Distributed computing; Wireless","score_opus":0.03787961938960948,"score_gpt":0.336655443153291,"score_spread":0.2987758237636815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887906137","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.4905205,0.000089933965,0.48548797,0.0012328783,0.00027017476,0.0007871923,0.000026896407,0.004652125,0.016932312],"genre_scores_gemma":[0.9956302,0.00044642438,0.0030398204,0.00007744042,0.000055789886,0.00041899114,0.00003345039,0.00007317318,0.00022470062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987655,0.00021168226,0.00032759184,0.00022495055,0.00023398257,0.00023628221],"domain_scores_gemma":[0.9966355,0.00019076938,0.000063795575,0.0026786954,0.00029632737,0.00013491783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019277271,0.00021855715,0.00018802608,0.00023664079,0.00063511904,0.000086722146,0.0014359646,0.00012187704,0.00014938967],"category_scores_gemma":[0.000015060615,0.00024794764,0.000095934134,0.0005377483,0.00034971422,0.0004099291,0.00000914202,0.000763182,0.0007114732],"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.0003087268,0.012398444,0.00011438777,0.00030730892,0.0010390724,0.000002607997,0.16263574,0.076869585,0.19006798,0.062507525,0.0016460958,0.49210253],"study_design_scores_gemma":[0.00028152115,0.00052681717,0.00015374081,0.000097163924,0.000092269016,0.000013394186,0.0014225891,0.551665,0.42213228,0.008951472,0.014059964,0.00060374563],"about_ca_topic_score_codex":0.000039951956,"about_ca_topic_score_gemma":0.00015371786,"teacher_disagreement_score":0.5051097,"about_ca_system_score_codex":0.0001229294,"about_ca_system_score_gemma":0.00004290083,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2888848318","doi":"10.1109/ccece.2018.8447723","title":"Multiple Antenna Physical Layer Security Against Passive Eavesdroppers: A Tutorial","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Physical layer; Secrecy; Computer science; Relay; Computer network; Wireless; Channel (broadcasting); Wireless network; Antenna (radio); Telecommunications; Emphasis (telecommunications); Computer security","score_opus":0.013949873160724676,"score_gpt":0.25392414958206583,"score_spread":0.23997427642134114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888848318","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.9467987,0.00004482512,0.0077630887,0.00020449965,0.0005920861,0.00030832327,0.0000228727,0.0030262107,0.041239414],"genre_scores_gemma":[0.9964327,0.000047360532,0.0021914158,0.00012786806,0.0010592646,0.000033112487,0.000014847062,0.000043072727,0.000050360923],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.000042615728,0.00018859962,0.00018956976,0.00018691021,0.00027532232],"domain_scores_gemma":[0.998977,0.00009468832,0.000028328694,0.0006685586,0.00013529681,0.00009611527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000742016,0.00018692671,0.00020887442,0.00007157706,0.000079834674,0.000055951852,0.00039527717,0.000111191104,0.00006172981],"category_scores_gemma":[0.00006414867,0.00017868726,0.00009004881,0.00018944855,0.00014612869,0.00023157767,0.00013859509,0.00026715777,0.00028583957],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120350436,0.0009269552,0.0018562527,0.00015674745,0.00039731967,0.000027993876,0.030502182,0.00010657822,0.7951119,0.034737933,0.112878785,0.023177039],"study_design_scores_gemma":[0.0009738497,0.00014569894,0.00055397867,0.00007108312,0.0000184701,0.0000050599797,0.00049585546,0.52091813,0.34656832,0.002872421,0.12657697,0.0008001698],"about_ca_topic_score_codex":0.000044281885,"about_ca_topic_score_gemma":0.000095718984,"teacher_disagreement_score":0.52081156,"about_ca_system_score_codex":0.00008177925,"about_ca_system_score_gemma":0.000015292726,"threshold_uncertainty_score":0.72866553},"labels":[],"label_agreement":null},{"id":"W2892673973","doi":"10.1109/icee.2018.8472472","title":"Lower and Upper Bounds on the Capacity of a Class of Gaussian Relay Channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Concordia University","funders":"","keywords":"Relay; Relay channel; Upper and lower bounds; Gaussian; Computer science; Topology (electrical circuits); Mathematics; Algorithm; Telecommunications; Computer network; Combinatorics; Physics; Mathematical analysis","score_opus":0.021251236513609467,"score_gpt":0.23763021949475524,"score_spread":0.21637898298114577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892673973","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.94256204,0.000039871033,0.0013446107,0.00062932423,0.000054261393,0.00009937834,0.000004023552,0.0001344799,0.055131994],"genre_scores_gemma":[0.99844086,0.000053236326,0.0013036911,0.00007256885,0.00001777848,0.000008253777,4.525441e-7,0.000011237963,0.00009193324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961716,0.000025654752,0.00014054461,0.00005605245,0.000084467014,0.00007614356],"domain_scores_gemma":[0.9993701,0.000072517345,0.00002776646,0.0004623537,0.00004785148,0.000019428577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016725235,0.00006412388,0.000102727405,0.00004548304,0.000027875849,0.00000845013,0.00017692722,0.000059009493,0.00012080823],"category_scores_gemma":[0.000022267126,0.00004401027,0.000024514678,0.00008646154,0.00020757834,0.000046290726,0.000045580917,0.00010278117,0.000005287235],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852595,0.00023176687,0.0018136097,0.0002036731,0.00017688655,5.6885006e-7,0.011658486,0.00010632007,0.12475468,0.8340551,0.023541672,0.0034087],"study_design_scores_gemma":[0.00019912032,0.00029259236,0.0039327526,0.0001751364,0.000011616513,0.0000036734052,0.00026230677,0.019836048,0.9373133,0.004442124,0.03330698,0.0002243277],"about_ca_topic_score_codex":0.00004268566,"about_ca_topic_score_gemma":0.00003129587,"teacher_disagreement_score":0.829613,"about_ca_system_score_codex":0.000011998989,"about_ca_system_score_gemma":0.0000037346108,"threshold_uncertainty_score":0.17946868},"labels":[],"label_agreement":null},{"id":"W2894949059","doi":"10.1109/tit.2018.2878219","title":"Lattice-Based Robust Distributed Source Coding","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Distributed source coding; Algorithm; Computer science; Lattice (music); Shannon–Fano coding; Coding (social sciences); Source code; Variable-length code; Rate distortion; Rate–distortion theory; Theoretical computer science; Mathematics; Decoding methods; Statistics; Physics; Data compression","score_opus":0.013600685699314686,"score_gpt":0.22163363051763968,"score_spread":0.208032944818325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894949059","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.004538368,0.000007143382,0.98796624,0.000080959864,0.00024302353,0.00017745889,0.00008540296,0.0018657969,0.0050356314],"genre_scores_gemma":[0.99539053,0.000018759145,0.0041140784,0.00028649942,0.00002526428,0.00006822492,0.00004365703,0.000020234596,0.000032723972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921554,0.000060789152,0.00032351862,0.000062665866,0.00016467499,0.00017283665],"domain_scores_gemma":[0.9991246,0.00017515983,0.000056748548,0.0004517705,0.00012974117,0.0000619904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031091817,0.00014125777,0.000110746594,0.00024657635,0.00024460623,0.000080767095,0.0002493202,0.00011092992,0.0003291522],"category_scores_gemma":[0.000010361083,0.00015442696,0.000064592095,0.0003044388,0.00011396156,0.0007814124,0.0000011726372,0.00026511977,0.00045885635],"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.0001661338,0.0001252543,0.0000062593117,0.00019222689,0.00012236161,3.774491e-7,0.004246273,0.8132848,0.0011373934,0.020294055,0.0033658184,0.15705901],"study_design_scores_gemma":[0.00064441457,0.00009284385,0.000045547804,0.0001160859,0.000035206205,0.0000053528033,0.00049233483,0.70020133,0.25857013,0.0011342858,0.03823321,0.00042925045],"about_ca_topic_score_codex":0.0000040845903,"about_ca_topic_score_gemma":0.0000051162224,"teacher_disagreement_score":0.9908522,"about_ca_system_score_codex":0.00012268324,"about_ca_system_score_gemma":0.000019939373,"threshold_uncertainty_score":0.6297349},"labels":[],"label_agreement":null},{"id":"W2896569878","doi":"10.1109/tcomm.2018.2875486","title":"Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Algorithm; Minification; Scalar (mathematics); Directed acyclic graph; Dynamic programming; Source code; Partition (number theory); Mathematics; Property (philosophy); Optimization problem; Encoder; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.041390576054619765,"score_gpt":0.27514921807884907,"score_spread":0.2337586420242293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896569878","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.010694951,0.00007439427,0.98389316,0.00031320495,0.0000666767,0.0006279798,0.000097735276,0.00088665995,0.0033452164],"genre_scores_gemma":[0.7852656,0.0004625121,0.21384305,0.000057325506,0.000007728118,0.00024376882,0.000024560119,0.000039607483,0.000055817418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855757,0.00020284766,0.0005785182,0.00013424695,0.0002720932,0.00025474248],"domain_scores_gemma":[0.99628717,0.00035351093,0.00015255681,0.0027454586,0.00036605957,0.00009524309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033042507,0.0002501094,0.0002812968,0.0004204343,0.0003967399,0.00006235351,0.0012437669,0.00013388318,0.000074157295],"category_scores_gemma":[0.000010881781,0.00025670574,0.0001035117,0.0007230548,0.0004752791,0.0008851716,0.0000125235565,0.0005167882,0.00010267616],"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.00038284415,0.0012500552,0.000059700822,0.00023797728,0.0008919676,0.0000014452066,0.012057724,0.8936305,0.040189814,0.0149688525,0.0021157882,0.03421333],"study_design_scores_gemma":[0.0017058722,0.00051644706,0.0001379422,0.00026904198,0.00018250424,0.000022164011,0.00095493795,0.6746627,0.30503345,0.0002627812,0.015515237,0.00073693006],"about_ca_topic_score_codex":0.00012502904,"about_ca_topic_score_gemma":0.00025234217,"teacher_disagreement_score":0.7745707,"about_ca_system_score_codex":0.00012263349,"about_ca_system_score_gemma":0.000079141435,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W2904233643","doi":"10.1049/iet-com.2018.5216","title":"Cooperative jamming‐based physical‐layer security of cooperative cognitive radio networks: system model and enabling techniques","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of New Brunswick","funders":"","keywords":"Jamming; Physical layer; Cognitive radio; Computer science; Computer network; Layer (electronics); Telecommunications; Wireless","score_opus":0.02865989531718224,"score_gpt":0.2915801016213723,"score_spread":0.2629202063041901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904233643","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.2787738,0.00453558,0.66858745,0.00068886095,0.000094661526,0.0031474603,0.00045702007,0.0049983603,0.038716815],"genre_scores_gemma":[0.98084646,0.0008151188,0.017635433,0.000065019995,0.000055316632,0.00041996708,0.00008927601,0.000061818275,0.000011580076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856675,0.0003193143,0.00045985315,0.00023740677,0.00016882314,0.00024788297],"domain_scores_gemma":[0.9963746,0.0006700955,0.00014590057,0.001762975,0.0009518968,0.00009451058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036558535,0.00028171114,0.00045119907,0.00017343624,0.0004178702,0.00007087481,0.0009409311,0.00015829597,0.0000058223736],"category_scores_gemma":[0.00009508673,0.0002986414,0.000075255004,0.00052986527,0.00092223106,0.0003230891,0.00041127036,0.0005343506,0.000005245757],"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.00044681967,0.0046507763,0.0009980785,0.0020122088,0.0025476248,0.0000076254973,0.1765135,0.09421166,0.14849292,0.5143354,0.011910063,0.043873344],"study_design_scores_gemma":[0.00026343882,0.00012493315,0.000025259065,0.00047422724,0.000058372738,0.000003153688,0.0013120611,0.91541153,0.08104549,0.00024313491,0.00074186415,0.00029651079],"about_ca_topic_score_codex":0.000051831004,"about_ca_topic_score_gemma":0.00011957522,"teacher_disagreement_score":0.8211999,"about_ca_system_score_codex":0.00012313997,"about_ca_system_score_gemma":0.00006983514,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2904255561","doi":"10.1049/iet-com.2018.5635","title":"Secrecy performance of a two‐way communication network with two half‐duplex DF relays","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secrecy; Computer science; Duplex (building); Computer network; Telecommunications; Computer security; Chemistry","score_opus":0.020833190925555786,"score_gpt":0.2726434243523782,"score_spread":0.2518102334268224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904255561","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.7653004,0.007921156,0.03708987,0.0028904236,0.00017048304,0.0021155684,0.00006011691,0.003755833,0.18069613],"genre_scores_gemma":[0.8743568,0.0031423941,0.121738926,0.00008759449,0.000055093948,0.000326051,0.0001565703,0.000074101605,0.00006247979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830335,0.00029995225,0.00062726793,0.00018103035,0.00024582268,0.00034258602],"domain_scores_gemma":[0.9914131,0.00040351078,0.00023201102,0.0073813475,0.00047487952,0.000095116506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063200627,0.00025973254,0.00034467978,0.00015504516,0.00054550933,0.0000545545,0.0032837703,0.00011205556,0.00008539453],"category_scores_gemma":[0.00003097246,0.00027082703,0.00007316387,0.00090465246,0.0008714202,0.00043594258,0.0007682911,0.0006575419,0.00008106906],"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.0002387309,0.0012367497,0.045917835,0.0004486569,0.0010220838,0.000001402985,0.019313583,0.058818903,0.013980519,0.76459926,0.019878497,0.07454375],"study_design_scores_gemma":[0.0025931136,0.00062062574,0.013708982,0.0015899645,0.00021274113,0.00006800502,0.0005254359,0.78845483,0.020917758,0.009938419,0.15977278,0.0015973325],"about_ca_topic_score_codex":0.00026286926,"about_ca_topic_score_gemma":0.0017312171,"teacher_disagreement_score":0.75466084,"about_ca_system_score_codex":0.00011485492,"about_ca_system_score_gemma":0.00005467639,"threshold_uncertainty_score":0.99997437},"labels":[],"label_agreement":null},{"id":"W2907327353","doi":"10.48550/arxiv.1901.01626","title":"Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Lossless compression; Coding (social sciences); Channel code; Computer science; Channel (broadcasting); Variable-length code; Source code; Tunstall coding; Algorithm; Adaptive coding; Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Data compression; Statistics; Artificial intelligence","score_opus":0.06434788633977218,"score_gpt":0.2040904431851308,"score_spread":0.13974255684535863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907327353","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.2524157,0.00062342174,0.7442537,0.000049117607,0.00040190635,0.0009593777,0.000045172415,0.00060312735,0.00064849365],"genre_scores_gemma":[0.9972839,0.0016888576,0.0002674961,0.000020913165,0.000053947453,0.000008134554,0.000046618145,0.00008536978,0.00054479006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870944,0.00008761805,0.00036342174,0.0004275756,0.000102197715,0.00030972052],"domain_scores_gemma":[0.99790156,0.00040672254,0.00025756736,0.0011922697,0.00015667734,0.00008517865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036871614,0.00036701033,0.0005082061,0.0002745855,0.00014510288,0.000044062548,0.0010926569,0.00042165912,0.000053859894],"category_scores_gemma":[0.000023896826,0.00035533853,0.00038650355,0.00027630327,0.00013015271,0.0001244533,0.00048113527,0.0007981247,0.000010664862],"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.000042237643,0.00003529277,0.00006536183,0.0004013777,0.00020696773,0.000002032208,0.0017804988,0.9917751,0.001104224,0.0035784252,0.0005170892,0.00049137225],"study_design_scores_gemma":[0.0006116452,0.000032161053,0.000081452315,0.0005162917,0.00016489672,0.0000013785656,0.00037652368,0.98202163,0.009521843,0.0034403752,0.0028319005,0.00039988713],"about_ca_topic_score_codex":0.00013178392,"about_ca_topic_score_gemma":0.000009200756,"teacher_disagreement_score":0.7448682,"about_ca_system_score_codex":0.00015022133,"about_ca_system_score_gemma":0.00004025265,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W2907860850","doi":"10.1109/comst.2018.2865607","title":"A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":278,"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":"Horizon 2020 Framework Programme","keywords":"Eavesdropping; Jamming; Computer science; Physical layer; Computer network; Key (lock); Wireless; Cryptography; Beamforming; Computer security; Telecommunications","score_opus":0.09882018726467656,"score_gpt":0.35696227644069545,"score_spread":0.2581420891760189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907860850","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.9726547,0.0007185506,0.018849287,0.00022650861,0.0009691471,0.0014400259,0.0006494501,0.0011980489,0.0032942875],"genre_scores_gemma":[0.9951598,0.00056574534,0.0032296642,0.00006060037,0.00035733354,0.0003280368,0.00020983968,0.000071900635,0.000017055121],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963818,0.0023255402,0.00048652664,0.00029525755,0.00019510028,0.00031575287],"domain_scores_gemma":[0.9911663,0.005349893,0.00012650975,0.0023117252,0.00094998477,0.00009557023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022678392,0.00031551628,0.00051600736,0.0001456277,0.0006399416,0.00023553333,0.0010853425,0.00017183671,0.000006125447],"category_scores_gemma":[0.00038188096,0.0003387618,0.000075908836,0.00037936936,0.00064330624,0.00041035956,0.00025283007,0.00043249314,0.000027794964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008381107,0.0033169128,0.006301096,0.000980404,0.002737524,0.000004859893,0.1609314,0.004981923,0.37715498,0.29358345,0.105940215,0.043229133],"study_design_scores_gemma":[0.008052554,0.004384566,0.09505981,0.0015189415,0.0003909463,0.000027063279,0.010686459,0.2093491,0.2601096,0.06055105,0.34245595,0.007413957],"about_ca_topic_score_codex":0.00047578663,"about_ca_topic_score_gemma":0.001595061,"teacher_disagreement_score":0.23651573,"about_ca_system_score_codex":0.000115273026,"about_ca_system_score_gemma":0.00008519277,"threshold_uncertainty_score":0.9999064},"labels":[],"label_agreement":null},{"id":"W2913163982","doi":"10.32920/ryerson.14651595.v1","title":"Enhancement of Wyner-Ziv video coding for wireless channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; Encoder; Decoding methods; Algorithm; Coding (social sciences); Channel (broadcasting); Wireless; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.031899828977247566,"score_gpt":0.2813180670560394,"score_spread":0.24941823807879182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913163982","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.10993388,0.0012727038,0.8801693,0.00018764124,0.00071335654,0.0010335471,0.000042709027,0.0009549968,0.0056918827],"genre_scores_gemma":[0.9539659,0.0021975157,0.042461433,0.000037578822,0.00007610432,0.0008051188,0.00020073811,0.000072330586,0.00018325225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986281,0.00003567173,0.000598276,0.00029185583,0.00020695706,0.00023915702],"domain_scores_gemma":[0.99820215,0.00015468712,0.00014065347,0.0011929303,0.00025504257,0.00005454796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003013267,0.0002835803,0.0005691654,0.0001491225,0.00003535212,0.00007221976,0.00070963125,0.00032155993,0.00014735978],"category_scores_gemma":[0.000030154652,0.00032797767,0.00020926849,0.000105435254,0.00003785372,0.00007548845,0.00076362136,0.00039650121,0.0000024628805],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054622436,0.0007598873,0.000100374906,0.024622584,0.0020251814,0.0000080434575,0.012375951,0.035241585,0.7312553,0.07609126,0.03065156,0.08681367],"study_design_scores_gemma":[0.00014586022,0.00001772129,0.000005867817,0.0007714038,0.000028279612,7.028763e-7,0.00017894788,0.09693744,0.8973614,0.0009061592,0.0032863852,0.00035980414],"about_ca_topic_score_codex":0.00005084896,"about_ca_topic_score_gemma":0.000030481555,"teacher_disagreement_score":0.84403205,"about_ca_system_score_codex":0.00013723399,"about_ca_system_score_gemma":0.000051787298,"threshold_uncertainty_score":0.9999172},"labels":[],"label_agreement":null},{"id":"W2914450851","doi":"10.1145/3308897.3308944","title":"Interference Management Schemes for High Spectral Efficiency Satellite Communications","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Single antenna interference cancellation; Interference (communication); Computer science; Asynchronous communication; Communications satellite; Electronic engineering; Spectral efficiency; Adjacent-channel interference; Channel (broadcasting); Co-channel interference; Satellite; Waveform; Reuse; Noma; Telecommunications; Computer network; Telecommunications link; Engineering","score_opus":0.06000796866045134,"score_gpt":0.3342993618196767,"score_spread":0.27429139315922535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914450851","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.1429555,0.769452,0.035421982,0.0026319989,0.0009255046,0.014276238,0.00003857456,0.0018733472,0.032424852],"genre_scores_gemma":[0.53757226,0.43121237,0.030260522,0.00015896633,0.000011297346,0.0005945463,0.00011827564,0.000022196831,0.000049601047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835706,0.000093040966,0.0006035341,0.00023200829,0.00046128422,0.00025308414],"domain_scores_gemma":[0.9961488,0.0003123891,0.0001472644,0.0029605697,0.00038228472,0.000048653736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020853071,0.00020258469,0.00032161784,0.0003627185,0.00010296855,0.000050386894,0.0019214285,0.00006580853,0.00021571359],"category_scores_gemma":[0.00027617667,0.00020631177,0.000088338966,0.0015067921,0.000042958516,0.00035188397,0.00034430323,0.00022494365,0.00029904448],"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.0000031777374,0.000062436346,0.0009310189,0.00396879,0.00005212446,4.322797e-8,0.00006736923,0.00018042659,0.00012310842,0.0113530215,0.0011427597,0.98211575],"study_design_scores_gemma":[0.0014359051,0.00031706502,0.013061284,0.007838294,0.00048435517,0.000005804979,0.00006206407,0.3161338,0.006107346,0.0023571698,0.6509152,0.0012816949],"about_ca_topic_score_codex":0.0000011366292,"about_ca_topic_score_gemma":0.0000011534087,"teacher_disagreement_score":0.980834,"about_ca_system_score_codex":0.00023594039,"about_ca_system_score_gemma":0.000030517347,"threshold_uncertainty_score":0.841315},"labels":[],"label_agreement":null},{"id":"W2915498241","doi":"10.1109/lwc.2019.2922610","title":"Design and Performance Analysis of Secure Multicasting Cooperative Protocol for Wireless Sensor Network Applications","year":2019,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Computer network; Relay; Computer science; Secrecy; Beamforming; Channel state information; Wireless; Multicast; Hop (telecommunications); Transmission (telecommunications); Wireless sensor network; Computer security; Telecommunications","score_opus":0.049450084915339906,"score_gpt":0.3125135281763849,"score_spread":0.26306344326104497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915498241","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.028456423,0.00014542034,0.8527313,0.0005658946,0.00006806492,0.11694564,0.00022532944,0.0007323661,0.00012960633],"genre_scores_gemma":[0.5058184,0.00037892486,0.14364448,0.00012028478,0.00005196595,0.34952554,0.00033108282,0.00012074492,0.000008544669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969173,0.00048147276,0.0012424833,0.00058066804,0.0002946894,0.0004834055],"domain_scores_gemma":[0.99182975,0.0017692903,0.00067135337,0.005055027,0.0005637015,0.00011086454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080417935,0.00062658254,0.0012337549,0.0006174301,0.00042035608,0.00014958176,0.0025851543,0.0004744226,0.000006076224],"category_scores_gemma":[0.00001999157,0.0007181772,0.00028200442,0.0011610928,0.000514855,0.00020325586,0.0009816721,0.001281715,0.000004234477],"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.00005139324,0.00013563389,0.000884856,0.0015919468,0.0018138496,1.8925887e-7,0.0013981488,0.9782608,0.008299226,0.0006896385,0.0010148872,0.0058594407],"study_design_scores_gemma":[0.00048248083,0.00003619968,0.00035630562,0.0006251949,0.00066724414,0.0000017338525,0.00007648227,0.9900945,0.0046389555,0.00003364679,0.0023046376,0.0006826457],"about_ca_topic_score_codex":0.000029418929,"about_ca_topic_score_gemma":0.00003296135,"teacher_disagreement_score":0.7090868,"about_ca_system_score_codex":0.00021676204,"about_ca_system_score_gemma":0.00010534098,"threshold_uncertainty_score":0.9995269},"labels":[],"label_agreement":null},{"id":"W2917328431","doi":"10.1109/lwc.2019.2900310","title":"Achievable Secure Degrees of Freedom of ${K}$ -User MISO Broadcast Channel With Imperfect CSIT","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Degrees of freedom (physics and chemistry); Imperfect; Computer science; Computer network; Channel (broadcasting); Broadcasting (networking); Telecommunications; Physics","score_opus":0.011482889251643516,"score_gpt":0.22211101525899868,"score_spread":0.21062812600735517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917328431","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.9881715,0.0009880733,0.0067543653,0.0008631813,0.00010125374,0.00065251376,0.00007811066,0.00049483083,0.0018961545],"genre_scores_gemma":[0.9812478,0.0010817403,0.017261868,0.00007353986,0.000019498224,0.000111144145,0.00006490217,0.00010002974,0.000039479113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831027,0.00018469819,0.00062327215,0.00022669359,0.00033127292,0.00032382153],"domain_scores_gemma":[0.9945472,0.00033418273,0.00027207378,0.004559319,0.00021104608,0.000076216216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028420828,0.00031785935,0.00057021773,0.000320535,0.0001045543,0.000030778636,0.0026273145,0.00016213041,0.00003390777],"category_scores_gemma":[0.000009588004,0.0003201115,0.00014148098,0.00061446446,0.00043650705,0.00034118068,0.00028042652,0.000574628,0.000028518301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007969665,0.00043466012,0.006441681,0.00078033394,0.0005486414,0.0000017276883,0.004782568,0.14810434,0.8262195,0.00535987,0.005249919,0.001997073],"study_design_scores_gemma":[0.005369411,0.00076508196,0.018644584,0.0036365138,0.0004228747,0.000102192265,0.0028300488,0.5708433,0.3651116,0.00011258261,0.028689468,0.003472397],"about_ca_topic_score_codex":0.00033106093,"about_ca_topic_score_gemma":0.00019974704,"teacher_disagreement_score":0.4611079,"about_ca_system_score_codex":0.00008980771,"about_ca_system_score_gemma":0.000037920192,"threshold_uncertainty_score":0.9999251},"labels":[],"label_agreement":null},{"id":"W2917753748","doi":"10.3390/e21020213","title":"Asymptotic Rate-Distortion Analysis of Symmetric Remote Gaussian Source Coding: Centralized Encoding vs. Distributed Encoding","year":2019,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Gaussian; Independent and identically distributed random variables; Encoding (memory); Distortion (music); Distributed source coding; Algorithm; Computer science; Rate distortion; Compressed sensing; Coding (social sciences); Source code; Decoding methods; Rate–distortion theory; Mathematics; Data compression; Random variable; Variable-length code; Statistics; Artificial intelligence; Telecommunications; Bandwidth (computing); Physics","score_opus":0.010539675256807907,"score_gpt":0.23641373137151941,"score_spread":0.2258740561147115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917753748","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.72999233,0.00036072664,0.2666037,0.00009690768,0.0002261417,0.00036745984,0.000046827045,0.00092485565,0.0013810169],"genre_scores_gemma":[0.9969977,0.0004285099,0.0021879592,0.000018263974,0.000024703615,0.000006018209,0.0002475645,0.000040467996,0.000048791415],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833095,0.00014993959,0.0006001069,0.00025542447,0.00029451482,0.00036905616],"domain_scores_gemma":[0.9985783,0.00022259963,0.00021970422,0.0007866803,0.000082587285,0.00011011571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039184745,0.00022892017,0.0005790741,0.00085689704,0.000070748545,0.000055424283,0.00044735533,0.00013605684,0.0002462958],"category_scores_gemma":[0.00014445692,0.00025103273,0.00025851166,0.0024088982,0.00004010819,0.00018886956,0.00008387738,0.0002675849,0.00003687818],"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.00022566976,0.0003312271,0.11356466,0.000898898,0.0047490047,0.000017389133,0.0047616796,0.17204446,0.60798866,0.08602295,0.0016083313,0.00778706],"study_design_scores_gemma":[0.00084482663,0.000058214275,0.024792215,0.00017762923,0.0007350756,0.0000028049885,0.00016456781,0.8740688,0.09144436,0.00027102215,0.006867307,0.0005731997],"about_ca_topic_score_codex":0.00009222625,"about_ca_topic_score_gemma":0.000010502463,"teacher_disagreement_score":0.70202434,"about_ca_system_score_codex":0.00038648344,"about_ca_system_score_gemma":0.000016378266,"threshold_uncertainty_score":0.9999942},"labels":[],"label_agreement":null},{"id":"W2918569083","doi":"","title":"Intrinsic Capacity","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Generalization; Channel (broadcasting); Binary number; Encoder; Convex combination; State (computer science); Channel capacity; Realization (probability); Mathematics; Regular polygon; Decoding methods; Binary erasure channel; Computer science; Information theory; Topology (electrical circuits); Algorithm; Convex optimization; Combinatorics; Telecommunications; Arithmetic; Mathematical analysis; Statistics","score_opus":0.007868082910500965,"score_gpt":0.19756019010329598,"score_spread":0.189692107192795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918569083","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.101577155,0.000010494456,0.86195743,0.000039140257,0.00045498018,0.00026785236,0.000026929072,0.0014114074,0.03425463],"genre_scores_gemma":[0.9984948,0.00006097376,0.0010726592,0.00021099941,0.00000724071,0.0000540064,0.000006199793,0.00001295454,0.00008017714],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940795,0.000040720002,0.00024811144,0.000047364567,0.00013586857,0.000120015895],"domain_scores_gemma":[0.9993234,0.000093370545,0.000033655546,0.00044943867,0.000060033493,0.000040057726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002202758,0.000108028886,0.00010059193,0.00023224668,0.000062182415,0.000040842166,0.00019891543,0.000089286514,0.0005518614],"category_scores_gemma":[0.0000029649595,0.00011546232,0.000057539193,0.00018457122,0.000031164902,0.0010697835,8.331788e-7,0.0002960414,0.0021917145],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011191883,0.00012859261,0.000021268923,0.00036421712,0.00017838398,2.835651e-7,0.009795362,0.21079364,0.003422893,0.17498736,0.0020831006,0.59811294],"study_design_scores_gemma":[0.001905279,0.00023913934,0.0006183506,0.00022809865,0.00005371654,0.000036582343,0.0016243428,0.09283958,0.7432021,0.029667983,0.12810796,0.0014769007],"about_ca_topic_score_codex":0.0000037208847,"about_ca_topic_score_gemma":0.0000019162017,"teacher_disagreement_score":0.89691764,"about_ca_system_score_codex":0.00009115945,"about_ca_system_score_gemma":0.000009451449,"threshold_uncertainty_score":0.9985852},"labels":[],"label_agreement":null},{"id":"W2919528851","doi":"10.1007/s11042-019-7249-5","title":"Successive refinement of side information frames in distributed video coding","year":2019,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decoding methods; Discrete cosine transform; Encoder; Residual frame; Coding (social sciences); Distributed source coding; Frame (networking); Algorithm; Reference frame; Computer vision; Variable-length code; Telecommunications; Mathematics; Image (mathematics); Statistics","score_opus":0.009818088476175924,"score_gpt":0.2370952062122901,"score_spread":0.22727711773611417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919528851","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.63400716,0.00079744554,0.3501162,0.00084417436,0.00007371473,0.0031678702,0.0010010282,0.00080137595,0.009191019],"genre_scores_gemma":[0.99305725,0.00030816934,0.0058278004,0.000021015385,0.000007820442,0.00040785584,0.0003603222,0.0000062197328,0.000003561462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.0000091563725,0.0002814488,0.000063471096,0.00007727004,0.000087373344],"domain_scores_gemma":[0.99941915,0.00017524856,0.00006245959,0.00026714543,0.000048053313,0.000027954708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078757854,0.00007146981,0.0001237512,0.00008099682,0.00002117814,0.000027811024,0.00013487323,0.000057062676,0.000022197377],"category_scores_gemma":[0.0000301595,0.000075428856,0.000016081693,0.00018274394,0.000026993903,0.00030951545,0.00004765399,0.00010785231,0.000019145798],"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.000022131528,0.00023126527,0.033800807,0.0010099214,0.00008117438,3.8887336e-7,0.00484282,0.013365863,0.06428751,0.067205526,0.0014194669,0.8137331],"study_design_scores_gemma":[0.001981589,0.000052098654,0.14974126,0.00038459804,0.000028447083,0.0000020499199,0.0015278587,0.5641523,0.09595468,0.002205599,0.18320444,0.00076505396],"about_ca_topic_score_codex":0.00003985055,"about_ca_topic_score_gemma":0.000017140752,"teacher_disagreement_score":0.8129681,"about_ca_system_score_codex":0.000032792504,"about_ca_system_score_gemma":0.000007650209,"threshold_uncertainty_score":0.30758995},"labels":[],"label_agreement":null},{"id":"W2920823316","doi":"10.1109/isit.2019.8849553","title":"Wiretap Secret Key Capacity of Tree-PIN","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Upper and lower bounds; Tree (set theory); Key (lock); Computer science; Information leakage; Adversary; Random variable; Theoretical computer science; Computer network; Mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Computer security; Statistics","score_opus":0.012868806764901854,"score_gpt":0.20843410768330992,"score_spread":0.19556530091840807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920823316","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.8395371,0.00007524377,0.004208026,0.000059024354,0.000045178032,0.00012876031,0.000005285392,0.00072346657,0.15521792],"genre_scores_gemma":[0.99042207,0.000057064928,0.009177033,0.00002760434,0.000006781333,0.000007171179,0.0000055368396,0.000017308308,0.00027944933],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954563,0.00001965973,0.00016839974,0.00006812127,0.00010029742,0.00009791156],"domain_scores_gemma":[0.9993006,0.00003869542,0.000022658975,0.00057510694,0.000034218723,0.000028739742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010008741,0.00007723989,0.0001465687,0.00005642808,0.000007972967,0.0000071033037,0.0002647543,0.00006786392,0.0004619201],"category_scores_gemma":[0.0000075750027,0.000077336845,0.00004195825,0.00010500206,0.000026136298,0.00010143473,0.000043510296,0.00011849406,0.000100992176],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015420665,0.00014902852,0.028261913,0.0007068264,0.00018462981,0.0000010984685,0.0059079896,0.0014606911,0.73152477,0.19344035,0.01858069,0.01976659],"study_design_scores_gemma":[0.00034539204,0.0000574829,0.013132844,0.00007735203,0.000009365352,0.0000037400189,0.00013822671,0.07707799,0.87912005,0.0021551705,0.027497387,0.0003849685],"about_ca_topic_score_codex":0.00008148321,"about_ca_topic_score_gemma":0.00007254353,"teacher_disagreement_score":0.19128518,"about_ca_system_score_codex":0.00002526474,"about_ca_system_score_gemma":0.0000051518978,"threshold_uncertainty_score":0.5057701},"labels":[],"label_agreement":null},{"id":"W2921099176","doi":"10.1186/s13638-019-1369-5","title":"Amplify-and-forward relay identification using joint Tx/Rx I/Q imbalance-based device fingerprinting","year":2019,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Relay; Identification (biology); Keying; Fingerprint (computing); Quadrature amplitude modulation; Compensation (psychology); Algorithm; Electronic engineering; Real-time computing; Telecommunications; Bit error rate; Decoding methods; Artificial intelligence; Power (physics)","score_opus":0.04109239516597152,"score_gpt":0.2750090435197121,"score_spread":0.2339166483537406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921099176","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.95998466,0.007868455,0.028720487,0.0007512164,0.00038665684,0.00040556054,0.000005222971,0.0004794838,0.0013982535],"genre_scores_gemma":[0.97469914,0.013265736,0.011583352,0.00019885776,0.00012562764,0.000021297052,0.000015576034,0.000077856464,0.00001253536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.00032692676,0.00081275374,0.00024485972,0.0002659962,0.0003595953],"domain_scores_gemma":[0.997198,0.0005826872,0.0004179845,0.0015031197,0.00014831846,0.00014988994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012742087,0.0002851168,0.0003891355,0.00029631893,0.0007395371,0.0004263274,0.00080211065,0.0001634441,0.000012861959],"category_scores_gemma":[0.000026970882,0.00030366163,0.000090517715,0.00037761126,0.00012207875,0.00034395573,0.0003052116,0.0012835806,0.000014390967],"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.00012459209,0.00050327095,0.12617959,0.0007925866,0.0006428457,0.000018460638,0.004772917,0.10040257,0.15090507,0.019730413,0.00071467296,0.595213],"study_design_scores_gemma":[0.00050723593,0.000050207433,0.0068809832,0.0013062388,0.000047679245,0.000104839324,0.00018313974,0.96896726,0.0015885684,0.00047397125,0.01937708,0.0005128072],"about_ca_topic_score_codex":0.000015702815,"about_ca_topic_score_gemma":0.000012898205,"teacher_disagreement_score":0.86856467,"about_ca_system_score_codex":0.00017629989,"about_ca_system_score_gemma":0.00003781358,"threshold_uncertainty_score":0.9999415},"labels":[],"label_agreement":null},{"id":"W2921914961","doi":"10.1007/s00440-020-00967-w","title":"Stability of the Shannon–Stam inequality via the Föllmer process","year":2020,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Azrieli Foundation; Israel Science Foundation","keywords":"Covariance; Bounded function; Stochastic process; Gaussian process; Stability (learning theory); Entropy (arrow of time); Mathematical proof; Mathematical finance; Multivariate random variable","score_opus":0.01880990440055895,"score_gpt":0.23725446839830322,"score_spread":0.21844456399774426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921914961","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.9828605,0.0006959428,0.006118918,0.0051201517,0.000076665914,0.0007275674,0.00001296674,0.00036760615,0.004019702],"genre_scores_gemma":[0.9995874,0.00006724331,0.00007666144,0.00020487813,0.000010736205,0.000032553256,0.0000021732494,0.000011756939,0.000006600751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998529,0.0006128325,0.00040413308,0.00017914506,0.00013937659,0.00013550397],"domain_scores_gemma":[0.9986145,0.0004385917,0.00007446226,0.0007368481,0.00008542864,0.00005016709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015263738,0.00013374278,0.0001925732,0.000009901369,0.000113829265,0.000015094926,0.00053349155,0.00024680267,0.0001273591],"category_scores_gemma":[0.00041712855,0.00007776515,0.00008211078,0.0002909159,0.0004147986,0.0001004082,0.00018358728,0.00078253506,0.0000022626218],"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.0008905007,0.0009206282,0.043871734,0.0073131016,0.00084431807,0.0000022043203,0.21687047,0.0069865086,0.016079403,0.6646505,0.00071844156,0.040852174],"study_design_scores_gemma":[0.00033745242,0.00008106963,0.0046280473,0.00008230553,0.000069492766,0.00000556964,0.0008808611,0.015414873,0.08661042,0.8907475,0.00080610847,0.0003362909],"about_ca_topic_score_codex":0.000007142645,"about_ca_topic_score_gemma":0.000007477972,"teacher_disagreement_score":0.226097,"about_ca_system_score_codex":0.0000162294,"about_ca_system_score_gemma":0.00002008523,"threshold_uncertainty_score":0.33997688},"labels":[],"label_agreement":null},{"id":"W2925280121","doi":"10.1109/tit.2020.2966197","title":"Fundamental Limits of Decentralized Data Shuffling","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"Université de Montréal","funders":"National Science Foundation of Sri Lanka; European Research Council; European Commission","keywords":"Shuffling; Converse; Computer science; Distributed computing; Constraint (computer-aided design); Distributed data store; Theoretical computer science; Engineering; Mathematics","score_opus":0.0561776954809643,"score_gpt":0.2902311953398642,"score_spread":0.2340534998588999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925280121","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.004008478,0.00016643052,0.989036,0.0001254997,0.00067575043,0.0005239295,0.0014433556,0.0012534388,0.00276708],"genre_scores_gemma":[0.98893225,0.0016598671,0.008483791,0.00014472076,0.000017516228,0.00008371257,0.00063485745,0.000036801823,0.000006478848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984687,0.000103729624,0.000801922,0.00015517004,0.00030168527,0.0001687997],"domain_scores_gemma":[0.997867,0.00017765403,0.00021402704,0.0015657365,0.000089497065,0.0000860916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003831049,0.0002681134,0.0003378378,0.00029885996,0.00007693264,0.00008382231,0.0012565319,0.00028044256,0.00019249691],"category_scores_gemma":[0.000016160699,0.00031317538,0.00012460061,0.00018213062,0.00007815759,0.00091810705,0.000026957501,0.00093320664,0.000091388705],"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.00045586246,0.00029871028,0.000006131083,0.0037380585,0.001235579,0.0000015124792,0.017598763,0.6525872,0.0034202402,0.016304884,0.004496462,0.29985663],"study_design_scores_gemma":[0.0013904133,0.0001015851,0.00004734917,0.0011946864,0.00032856732,0.000010781227,0.0016410198,0.6387972,0.31582233,0.014620662,0.02467386,0.0013715532],"about_ca_topic_score_codex":0.000011747348,"about_ca_topic_score_gemma":0.0000049968376,"teacher_disagreement_score":0.9849238,"about_ca_system_score_codex":0.00013094835,"about_ca_system_score_gemma":0.000070139846,"threshold_uncertainty_score":0.99993205},"labels":[],"label_agreement":null},{"id":"W2929522431","doi":"10.1109/cwit.2019.8929920","title":"Capacity of Generalized Discrete-Memoryless Push-to-Talk Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Channel (broadcasting); Channel capacity; Transmission (telecommunications); Symmetry (geometry); Property (philosophy); Topology (electrical circuits); Convex hull; Transmission channel","score_opus":0.018376345787368076,"score_gpt":0.2522480820931349,"score_spread":0.2338717363057668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929522431","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.9576079,0.00006360755,0.01936319,0.0001771966,0.00020455134,0.00042140888,0.000016065967,0.0008279087,0.02131812],"genre_scores_gemma":[0.98603666,0.000034296525,0.013320902,0.000087332955,0.000031823478,0.000047990005,0.000011537126,0.00004106012,0.00038837735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991005,0.00004472392,0.00029748582,0.00015625083,0.00018606878,0.00021497661],"domain_scores_gemma":[0.99881214,0.00004568984,0.00003982411,0.0009412681,0.00007188064,0.00008921182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019176031,0.00015995461,0.00030006203,0.00013131049,0.000021691063,0.000024669176,0.00051548,0.000078463076,0.0004481897],"category_scores_gemma":[0.000013306129,0.00015649124,0.00007820128,0.0002271119,0.0000327467,0.00014944079,0.00013950994,0.00015509626,0.00012338562],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024326571,0.00010336571,0.0015472888,0.00032271282,0.0001293491,0.000001869391,0.0028180701,0.03532811,0.8901592,0.062034287,0.00407156,0.0034598592],"study_design_scores_gemma":[0.000547117,0.00004427758,0.0007791608,0.000069213565,0.0000091649135,0.0000044105136,0.00009744013,0.049300298,0.9406848,0.0012371958,0.0068207844,0.0004061412],"about_ca_topic_score_codex":0.00024466016,"about_ca_topic_score_gemma":0.00006553258,"teacher_disagreement_score":0.060797088,"about_ca_system_score_codex":0.000048674203,"about_ca_system_score_gemma":0.000006336012,"threshold_uncertainty_score":0.6381528},"labels":[],"label_agreement":null},{"id":"W2938954758","doi":"10.1109/isplc.2019.8693263","title":"Securing MIMO Power Line Communications with Full-Duplex Jamming Receivers","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Secrecy; Jamming; Power-line communication; Computer network; Network packet; MIMO; Wireless; Physical layer; Duplex (building); Transmission (telecommunications); Confidentiality; Channel (broadcasting); Computer security; Power (physics); Telecommunications","score_opus":0.011074661825811282,"score_gpt":0.22703595053280703,"score_spread":0.21596128870699574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938954758","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.86088985,0.0005859449,0.011836814,0.0009057226,0.00008486148,0.00053533464,0.000008400432,0.0030633174,0.12208978],"genre_scores_gemma":[0.9494222,0.0004594674,0.049562983,0.00008632598,0.000008946267,0.000033333894,0.000026507892,0.00005018155,0.00035008395],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922997,0.00003573319,0.00022467399,0.0001443731,0.00015077784,0.00021446399],"domain_scores_gemma":[0.99777126,0.00011640217,0.000041241754,0.0019176662,0.00008774572,0.00006565327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001450134,0.00016222906,0.00017630954,0.00012597759,0.00007940937,0.000049282055,0.0008756611,0.000086507556,0.00039971503],"category_scores_gemma":[0.000008126659,0.00015542518,0.000041241947,0.00026523173,0.00005972043,0.00027463486,0.00021410393,0.00035000563,0.00023966862],"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.00033039736,0.001173784,0.02437129,0.0012147262,0.0018161557,0.000026438942,0.04945634,0.13742845,0.47562623,0.18739794,0.033962388,0.087195866],"study_design_scores_gemma":[0.0019374668,0.0005917178,0.0017795209,0.00064841454,0.000060232767,0.00006616461,0.0051673674,0.5354733,0.06493798,0.00023288051,0.3870988,0.0020061755],"about_ca_topic_score_codex":0.000038628423,"about_ca_topic_score_gemma":0.00013268407,"teacher_disagreement_score":0.41068825,"about_ca_system_score_codex":0.000086483466,"about_ca_system_score_gemma":0.000014559152,"threshold_uncertainty_score":0.6338055},"labels":[],"label_agreement":null},{"id":"W2939031118","doi":"10.1109/vtcfall.2018.8690916","title":"Optimized Signaling of Binary Correlated Sources Over Gaussian Multiple Access Channels","year":2018,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Binary number; Computer science; Gaussian; Mathematics; Physics; Arithmetic","score_opus":0.02405677172124856,"score_gpt":0.2757962263140469,"score_spread":0.25173945459279834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939031118","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.94285554,0.0002263745,0.047304627,0.000058266145,0.00018522679,0.00025923792,0.0000064644987,0.001596029,0.0075082663],"genre_scores_gemma":[0.9860239,0.0000712898,0.013657112,0.000038078662,0.000048351263,0.000022126094,0.000012938329,0.000039224833,0.00008697732],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921644,0.000039150982,0.00031047818,0.00012257052,0.00013213289,0.00017925505],"domain_scores_gemma":[0.9991994,0.0001233022,0.000065555534,0.00046992293,0.000087273685,0.00005452639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015047396,0.00013920508,0.00022004209,0.00016748333,0.000059450347,0.000045670517,0.0005609342,0.00012327317,0.0006769997],"category_scores_gemma":[0.000031036045,0.0001339725,0.00005791425,0.00028955567,0.00010461495,0.00028594575,0.00018198314,0.00014972324,0.00002096688],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028777524,0.00046830982,0.009246228,0.0004479118,0.0006050951,0.000010574486,0.011030505,0.2453476,0.70602673,0.0029916698,0.018265767,0.005271821],"study_design_scores_gemma":[0.00045989914,0.0000397715,0.0006235883,0.00009061322,0.000010208341,0.000001424216,0.000081864884,0.5630489,0.43420747,0.00011480003,0.0011241152,0.00019731079],"about_ca_topic_score_codex":0.00011980341,"about_ca_topic_score_gemma":0.000008539217,"teacher_disagreement_score":0.31770134,"about_ca_system_score_codex":0.000025162104,"about_ca_system_score_gemma":0.000008750754,"threshold_uncertainty_score":0.7412672},"labels":[],"label_agreement":null},{"id":"W2942638925","doi":"10.1109/tvt.2019.2913934","title":"Secrecy Analysis in Wireless Network With Passive Eavesdroppers by Using Partial Cooperation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Computer network; Jamming; Beamforming; Computer science; Secrecy; Transmission (telecommunications); Wireless; Broadcasting (networking); Multicast; Wireless network; Secure transmission; Telecommunications; Computer security; Encryption","score_opus":0.00579213081979211,"score_gpt":0.2144010910957968,"score_spread":0.2086089602760047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942638925","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.52854544,0.000052745767,0.4704438,0.000095271884,0.000047223148,0.00022841402,0.000007915371,0.00053883437,0.000040377996],"genre_scores_gemma":[0.99756706,0.0001224277,0.0020646423,0.00003677999,0.000008206667,0.00011989102,0.00001896611,0.00004637923,0.000015679188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988622,0.000065625085,0.0002990977,0.00029222452,0.00015427498,0.00032656346],"domain_scores_gemma":[0.9991139,0.000035225054,0.000052494626,0.0006909642,0.00006549717,0.000041927113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009598836,0.00022253243,0.00037141726,0.00069565256,0.00009300696,0.000028724726,0.00028299273,0.00038172028,0.00005836749],"category_scores_gemma":[0.0000011158822,0.00023094217,0.000083206,0.00243703,0.00009661531,0.00015468439,0.00000269333,0.0006388338,0.000020507536],"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.00002018429,0.000075707074,0.0013228732,0.000013182027,0.00034092827,0.0000061762066,0.00007450497,0.9648394,0.028442495,0.00055395166,0.000019641695,0.004290966],"study_design_scores_gemma":[0.0005074189,0.00011828111,0.000063856394,0.00006934904,0.00018190713,0.000012224032,0.000119422264,0.793847,0.20421997,0.00007060959,0.00040752516,0.00038242104],"about_ca_topic_score_codex":0.00006998891,"about_ca_topic_score_gemma":0.00038439667,"teacher_disagreement_score":0.4690216,"about_ca_system_score_codex":0.00020819301,"about_ca_system_score_gemma":0.000025766074,"threshold_uncertainty_score":0.9417548},"labels":[],"label_agreement":null},{"id":"W2943221627","doi":"10.1049/el.2019.0707","title":"Secrecy outage analysis of double shadowed Rician channels","year":2019,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"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":"Rician fading; Secrecy; Computer science; Transmitter; Line-of-sight; Telecommunications; Electronic engineering; Physics; Computer security; Channel (broadcasting); Fading; Engineering","score_opus":0.006579919006149386,"score_gpt":0.2183443074745629,"score_spread":0.21176438846841353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943221627","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.9830077,0.00064205413,0.012639635,0.00060135097,0.000083784,0.0002250196,0.0000067806186,0.0004821952,0.0023114404],"genre_scores_gemma":[0.9988366,0.00013747551,0.0004892673,0.0003590716,0.000015915492,0.00002118346,0.00005761802,0.00003419566,0.00004866969],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906844,0.000026705384,0.00025774466,0.00015248658,0.0001755155,0.00031908986],"domain_scores_gemma":[0.99911344,0.00004202324,0.00006349435,0.00071348756,0.000030613824,0.00003693871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017861371,0.00014174423,0.00032448303,0.0004301864,0.00002181712,0.000024272018,0.00044563436,0.00007543844,0.00012724682],"category_scores_gemma":[0.0000030377348,0.00016290812,0.00015889423,0.00094261917,0.000020175243,0.000118489086,0.000048192273,0.0002773489,0.000034596786],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049051803,0.000100333666,0.0075464686,0.0001584907,0.0035417133,0.0000030921963,0.0028694968,0.17407,0.7660202,0.0407011,0.0025980733,0.0023420183],"study_design_scores_gemma":[0.0017814809,0.00017349758,0.004657491,0.00007722654,0.0009770605,0.0000033350939,0.0001334809,0.39729923,0.54224247,0.0010757297,0.05011411,0.0014649014],"about_ca_topic_score_codex":0.00003368711,"about_ca_topic_score_gemma":0.000050312123,"teacher_disagreement_score":0.2237777,"about_ca_system_score_codex":0.00014781371,"about_ca_system_score_gemma":0.000013198755,"threshold_uncertainty_score":0.66432005},"labels":[],"label_agreement":null},{"id":"W2944211749","doi":"10.1109/tvt.2019.2916209","title":"On Countermeasures of Pilot Spoofing Attack in Massive MIMO Systems: A Double Channel Training Based Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Precoding; Telecommunications link; Channel (broadcasting); MIMO; Spoofing attack; Computer science; Computer network; Jamming; Base station; Transmission (telecommunications); Telecommunications","score_opus":0.03464117845901562,"score_gpt":0.24675316996398947,"score_spread":0.21211199150497384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944211749","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.6026698,0.00022809416,0.3932644,0.00013567184,0.00020972668,0.0009142791,0.00002490923,0.0012560989,0.0012970314],"genre_scores_gemma":[0.9981149,0.000042432315,0.0013147196,0.000026112732,0.000005244236,0.0004098479,0.000005846924,0.00006384948,0.000017088742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986485,0.000060697406,0.00043207133,0.00029986943,0.00024322185,0.00031563616],"domain_scores_gemma":[0.99881744,0.00009258155,0.000089643174,0.00088477565,0.00008033729,0.000035197834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026458284,0.0002518101,0.00046198964,0.0011865228,0.000050637056,0.00001759981,0.00049169856,0.00031375405,0.000013411781],"category_scores_gemma":[0.0000048036395,0.00027862153,0.00008960484,0.00072591915,0.00010643905,0.00009555674,0.0000028412721,0.00077938865,0.00002395163],"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.00008585836,0.00027358547,0.000020660715,0.00024773946,0.00006279031,0.000006177871,0.0002552524,0.9778579,0.018888537,0.0015869432,0.000018700168,0.0006958653],"study_design_scores_gemma":[0.0022402352,0.00052117393,0.000029393002,0.00081806286,0.000028625072,0.000021889158,0.0009405362,0.8049886,0.1894812,0.00015420205,0.0003183591,0.00045772453],"about_ca_topic_score_codex":0.000043425767,"about_ca_topic_score_gemma":0.000031474436,"teacher_disagreement_score":0.39544508,"about_ca_system_score_codex":0.00019844744,"about_ca_system_score_gemma":0.000036239213,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W2947899572","doi":"10.1109/lcomm.2019.2920347","title":"Secrecy Performance of Correlated $\\alpha$ -$\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"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":"Secrecy; Fading; Computer science; Channel (broadcasting); Telecommunications; Topology (electrical circuits); Computer network; Mathematics; Computer security; Combinatorics","score_opus":0.01793768378011158,"score_gpt":0.2364878587204194,"score_spread":0.21855017494030785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947899572","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.9896677,0.00054375466,0.0029596654,0.001021444,0.0003036153,0.00034018527,0.000008498669,0.0007242057,0.004430907],"genre_scores_gemma":[0.9936668,0.0010870907,0.004765261,0.00023854624,0.000015293741,0.000067310706,0.000043975924,0.000048739417,0.000066978726],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989917,0.00008458811,0.00042673887,0.00012366615,0.00015704063,0.0002162243],"domain_scores_gemma":[0.99657893,0.00016728955,0.000111748726,0.0030120406,0.000083006526,0.00004700579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002419094,0.00016737965,0.00024481202,0.0002357191,0.00015791423,0.000021434642,0.0018337923,0.00010225536,0.00005285189],"category_scores_gemma":[0.000011368829,0.00019833611,0.00007704449,0.00044214446,0.00013304825,0.0003179308,0.00028495165,0.0004846253,0.00011649486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020853537,0.00023171437,0.01419005,0.00036741229,0.00028401415,7.4425066e-7,0.0074083013,0.08389918,0.8697593,0.005501792,0.008186193,0.010150442],"study_design_scores_gemma":[0.0009028722,0.00013066479,0.0045158537,0.0007393534,0.00005541961,0.000022935892,0.00018808077,0.7346248,0.22350794,0.0001952785,0.03414093,0.0009758699],"about_ca_topic_score_codex":0.000023509936,"about_ca_topic_score_gemma":0.0000042051965,"teacher_disagreement_score":0.6507256,"about_ca_system_score_codex":0.00009812621,"about_ca_system_score_gemma":0.000012872754,"threshold_uncertainty_score":0.8087912},"labels":[],"label_agreement":null},{"id":"W2949484157","doi":"10.48550/arxiv.1808.02456","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Physical layer; Authentication (law); Robustness (evolution); Authentication protocol; Distributed computing; Wireless; Computer security","score_opus":0.06738765669366464,"score_gpt":0.23881350109599314,"score_spread":0.1714258444023285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949484157","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.96208704,0.000023417379,0.031259153,0.000022484857,0.00013555645,0.00034232726,0.000006544608,0.001923665,0.004199841],"genre_scores_gemma":[0.99882746,0.00024645514,0.0002162333,0.000015272533,0.00013344316,0.000007188369,0.00010848806,0.0000720282,0.00037344074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987401,0.00014103483,0.00019535738,0.00055968727,0.00010377258,0.000260056],"domain_scores_gemma":[0.9981656,0.000053280422,0.00013085564,0.0012369674,0.00026101875,0.00015224247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016973363,0.0003212643,0.00030049376,0.00022616277,0.0001154182,0.000077944555,0.001171887,0.00032286777,0.00009759452],"category_scores_gemma":[0.00004366522,0.00040862392,0.00013350733,0.0003142656,0.00015326562,0.00027580085,0.0005048132,0.0009690106,0.00033888937],"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.00016797388,0.0010675929,0.002680813,0.0010869782,0.00057289953,0.00006570369,0.02038966,0.8474759,0.003027909,0.11888627,0.00079807604,0.0037802306],"study_design_scores_gemma":[0.00013691135,0.000107188665,0.00038989843,0.00014469496,0.00009977611,0.0000021980234,0.00044755335,0.9011633,0.01731716,0.078412555,0.0011797181,0.00059906044],"about_ca_topic_score_codex":0.00004991326,"about_ca_topic_score_gemma":0.000019861413,"teacher_disagreement_score":0.053687397,"about_ca_system_score_codex":0.00023383246,"about_ca_system_score_gemma":0.00006408013,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W2949688507","doi":"10.48550/arxiv.1110.0748","title":"Compress-Forward without Wyner-Ziv Binning for the One-Way and Two-Way Relay Channels","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Decoding methods; Relay; Computer science; Channel (broadcasting); Algorithm; Relay channel; Coding (social sciences); Telecommunications; Mathematics; Statistics","score_opus":0.10854947185902256,"score_gpt":0.2123160327048801,"score_spread":0.10376656084585753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949688507","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.47371003,0.0016375046,0.5115565,0.00013594766,0.00067895587,0.0018164836,0.00009088316,0.0020839076,0.008289759],"genre_scores_gemma":[0.994141,0.0021701537,0.0028438664,0.000044842353,0.00010258215,0.00002614712,0.000037342812,0.000099582954,0.00053447805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856824,0.000098607365,0.00028108637,0.0005858835,0.00008191114,0.00038429737],"domain_scores_gemma":[0.9975526,0.00030909377,0.000187125,0.0016582197,0.00015885748,0.00013414322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000391866,0.00042290447,0.00048974465,0.00024923688,0.00027355528,0.00010422233,0.0014059922,0.0003784524,0.000028102086],"category_scores_gemma":[0.00003125575,0.00043568367,0.00019319143,0.000224639,0.00023709575,0.00022023352,0.0012802366,0.000986099,0.000015825453],"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.00018207992,0.00016827257,0.0034808405,0.0010553716,0.0014005438,0.000029494393,0.0049218414,0.8005329,0.0013343977,0.18117332,0.002702785,0.0030181815],"study_design_scores_gemma":[0.0011321072,0.000064524036,0.0009625878,0.00059661234,0.0004478505,0.000006084744,0.00029517873,0.9520562,0.0057227137,0.026762106,0.010756767,0.0011972594],"about_ca_topic_score_codex":0.00025191723,"about_ca_topic_score_gemma":0.000081493396,"teacher_disagreement_score":0.520431,"about_ca_system_score_codex":0.00013832634,"about_ca_system_score_gemma":0.00003358738,"threshold_uncertainty_score":0.9998095},"labels":[],"label_agreement":null},{"id":"W2949743812","doi":"10.48550/arxiv.0805.4023","title":"Robust Joint Source-Channel Coding for Delay-Limited Applications","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Channel code; Bounded function; Coding (social sciences); Additive white Gaussian noise; Computer science; Gaussian; Channel (broadcasting); Decoding methods; Algorithm; Distortion (music); Mathematics; Topology (electrical circuits); Telecommunications; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.1141097164998514,"score_gpt":0.2669791748854843,"score_spread":0.15286945838563287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949743812","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.11845861,0.0011266066,0.8723898,0.00034405605,0.00021260545,0.001912532,0.00011478545,0.0036184827,0.0018225294],"genre_scores_gemma":[0.9701045,0.0041564293,0.020393206,0.00012759496,0.00028471168,0.0040094615,0.0005608555,0.00020643114,0.00015681582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982559,0.000042744337,0.0006440796,0.00047069916,0.00018278418,0.00040377938],"domain_scores_gemma":[0.99748576,0.00016950739,0.00019310672,0.0017870073,0.00023428877,0.00013032637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022531101,0.00042961692,0.0005055692,0.00028598966,0.0002429901,0.000057218276,0.0009158512,0.00054918387,0.000016071444],"category_scores_gemma":[0.000063041305,0.0005280959,0.0002749465,0.00021014595,0.000092756374,0.00009406641,0.0006771191,0.0009959332,0.00007381286],"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.00004177541,0.00061195967,0.008408944,0.0038654802,0.0012820485,0.000013441812,0.0069591175,0.88336337,0.013795134,0.0040073725,0.062636964,0.015014427],"study_design_scores_gemma":[0.001039592,0.00006646837,0.006549395,0.0010357518,0.00026350707,0.00006627308,0.00036241818,0.69928783,0.04285772,0.0034203115,0.24191019,0.003140519],"about_ca_topic_score_codex":0.000045308057,"about_ca_topic_score_gemma":0.000018177312,"teacher_disagreement_score":0.8519966,"about_ca_system_score_codex":0.00024859805,"about_ca_system_score_gemma":0.00004970568,"threshold_uncertainty_score":0.99971706},"labels":[],"label_agreement":null},{"id":"W2949935738","doi":"10.1109/isit.2015.7282426","title":"The degraded Gaussian diamond-wiretap channel","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Randomness; Relay; Upper and lower bounds; Channel (broadcasting); Gaussian; Computer science; Topology (electrical circuits); Encoder; Secrecy; Channel code; Relay channel; Coding (social sciences); Computer network; Algorithm; Mathematics; Decoding methods; Combinatorics; Statistics; Computer security; Physics","score_opus":0.038454924705965496,"score_gpt":0.26663076609450365,"score_spread":0.22817584138853814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949935738","genre_codex":"other","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.019430453,0.034413192,0.058966115,0.010003898,0.003714979,0.0031493935,0.00012358233,0.023452865,0.8467455],"genre_scores_gemma":[0.99046487,0.004673433,0.0028430112,0.00006332825,0.0001400064,0.00041553454,0.00008045269,0.00010665477,0.0012127262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876887,0.00008305687,0.00036147222,0.00021890613,0.00026368056,0.0003040317],"domain_scores_gemma":[0.99750036,0.000110225665,0.00007082793,0.0020834983,0.000105073144,0.00013000809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044493968,0.0003186077,0.00029133307,0.0000898807,0.00011178859,0.00019409656,0.0015806999,0.0003943523,0.000022251734],"category_scores_gemma":[0.000047694866,0.00023743871,0.00012419315,0.00011141006,0.000095856354,0.000063600884,0.001035932,0.001105239,0.00008576763],"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.000018923938,0.00013052003,0.00016439492,0.0006491791,0.0007453104,0.000015229801,0.008503563,0.013071778,0.00033834457,0.058229506,0.85922265,0.05891058],"study_design_scores_gemma":[0.00042429194,0.000039040056,0.0010261216,0.00043424673,0.000091649745,0.000015579912,0.00069692737,0.3956658,0.015155023,0.17342834,0.41077933,0.0022436285],"about_ca_topic_score_codex":0.00010376315,"about_ca_topic_score_gemma":0.00021743368,"teacher_disagreement_score":0.9710344,"about_ca_system_score_codex":0.00017097604,"about_ca_system_score_gemma":0.00005720076,"threshold_uncertainty_score":0.968247},"labels":[],"label_agreement":null},{"id":"W2950450451","doi":"10.48550/arxiv.1704.03606","title":"Privacy-Aware Guessing Efficiency","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Random variable; Binary number; Independent and identically distributed random variables; Mathematics; Combinatorics; Discrete mathematics; Piecewise linear function; Piecewise; Variable (mathematics); Constraint (computer-aided design); Maximization; Expression (computer science); Computer science; Statistics; Mathematical optimization; Mathematical analysis; Arithmetic","score_opus":0.08542977361175264,"score_gpt":0.20948579443375642,"score_spread":0.12405602082200379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950450451","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.6566686,0.0006077277,0.30461124,0.00008202347,0.00072431396,0.00052292494,0.00005410941,0.0038682655,0.032860793],"genre_scores_gemma":[0.99759495,0.0010674222,0.0007142671,0.000012577407,0.00006630613,0.0000020721905,0.000046747355,0.00006442113,0.00043122447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988169,0.000067473666,0.00020583085,0.00051080686,0.00008005867,0.00031891585],"domain_scores_gemma":[0.9965476,0.000057124395,0.00017778149,0.0029787265,0.000119676006,0.00011910369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018337183,0.00034497114,0.00036105467,0.00024447704,0.00027485588,0.0001664978,0.002661614,0.00044421182,0.00004622664],"category_scores_gemma":[0.000039576327,0.00045563056,0.00018224734,0.0001463855,0.00016834898,0.00025781538,0.0019491574,0.0009982322,0.00008494265],"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.000034474946,0.0002998066,0.0052511515,0.001609703,0.0004274274,0.0005080147,0.002426348,0.9258409,0.0010407313,0.046737634,0.0073467465,0.008477054],"study_design_scores_gemma":[0.00033878905,0.000017844812,0.0010101509,0.00069308246,0.00010119601,0.000004639321,0.00009358885,0.9646712,0.002595392,0.020504348,0.008874442,0.0010953093],"about_ca_topic_score_codex":0.00007051618,"about_ca_topic_score_gemma":0.000021913434,"teacher_disagreement_score":0.34092638,"about_ca_system_score_codex":0.0003026847,"about_ca_system_score_gemma":0.00007716733,"threshold_uncertainty_score":0.99978954},"labels":[],"label_agreement":null},{"id":"W2950512683","doi":"","title":"Common Randomness and Secret Key Capacities of Two-way Channels.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Channel (broadcasting); Computer science; Channel capacity; Coding (social sciences); Binary number; Key (lock); Theoretical computer science; Cryptography; Channel code; Binary erasure channel; Key generation; Information theory; Binary symmetric channel; Information-theoretic security; Discrete mathematics; Algorithm; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.023761823754686454,"score_gpt":0.2554894605825143,"score_spread":0.23172763682782788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950512683","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.6870448,0.0016112896,0.28760216,0.00010089401,0.0005560424,0.00076077116,0.00016984981,0.0008043058,0.02134988],"genre_scores_gemma":[0.9008906,0.0022853508,0.09622746,0.000027576249,0.00006002021,0.0003111946,0.00011920935,0.000077361336,0.0000012227235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979787,0.0003855025,0.0006996678,0.00041448505,0.00015231987,0.00036932938],"domain_scores_gemma":[0.9976764,0.00047019552,0.00026259324,0.0013798199,0.00009454535,0.00011647769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037583205,0.00047411257,0.0011351274,0.00038386518,0.00007005644,0.00002648748,0.0009370983,0.00041632185,0.00008580088],"category_scores_gemma":[0.000049766095,0.0005203759,0.00017986613,0.000067803674,0.0011892008,0.0000687738,0.00173771,0.0014725411,0.00001357246],"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.00012288638,0.000068371584,0.001810671,0.0009694133,0.00041966818,0.000015749827,0.032489423,0.0017734607,0.0028157972,0.9564265,0.00035051937,0.0027375605],"study_design_scores_gemma":[0.00094164466,0.000040938798,0.0010773707,0.00039528546,0.000072288334,0.0000485224,0.00040068143,0.0057988786,0.034926027,0.9550754,0.0006433264,0.0005796672],"about_ca_topic_score_codex":0.0003725075,"about_ca_topic_score_gemma":0.0003284915,"teacher_disagreement_score":0.21384579,"about_ca_system_score_codex":0.000043364427,"about_ca_system_score_gemma":0.000036674282,"threshold_uncertainty_score":0.9997248},"labels":[],"label_agreement":null},{"id":"W2950547709","doi":"10.48550/arxiv.1001.1768","title":"On the Secure DoF of the Single-Antenna MAC","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Coding (social sciences); Secure coding; Scheme (mathematics); Topology (electrical circuits); Computer science; Dimension (graph theory); Antenna (radio); Mathematics; Telecommunications; Statistics","score_opus":0.05650662461924639,"score_gpt":0.16794204756260467,"score_spread":0.11143542294335829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950547709","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.9649452,0.00009376548,0.020399665,0.0003246839,0.00044977613,0.00050939515,0.000053249074,0.00054084294,0.012683422],"genre_scores_gemma":[0.9993289,0.0002326703,0.00008768176,0.00006924496,0.000026097112,0.0000018989288,0.000007320407,0.000039188944,0.00020700577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991628,0.00012414216,0.00018148424,0.0002682784,0.00008606007,0.00017725541],"domain_scores_gemma":[0.9970717,0.0002350631,0.0001593553,0.0023817224,0.00010993431,0.000042229116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019023856,0.00024417392,0.00023371197,0.00010538536,0.00009886078,0.000027774066,0.0021695874,0.00038677352,0.00008234595],"category_scores_gemma":[0.000056900335,0.00018460263,0.0002304407,0.00030082598,0.00023490557,0.00005171686,0.001053013,0.0016801539,0.000014330481],"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.000039939914,0.00022170716,0.0008149776,0.00026660445,0.00031261615,0.000018372102,0.0009550067,0.21683341,0.01064306,0.76623577,0.0032962882,0.000362252],"study_design_scores_gemma":[0.00045881225,0.00006472349,0.002319194,0.00087387644,0.00023498671,0.0000059902595,0.00034242857,0.8321102,0.039830312,0.11585014,0.0068105035,0.0010988194],"about_ca_topic_score_codex":0.000047808633,"about_ca_topic_score_gemma":0.00011794913,"teacher_disagreement_score":0.6503856,"about_ca_system_score_codex":0.00010556116,"about_ca_system_score_gemma":0.000030006346,"threshold_uncertainty_score":0.75278765},"labels":[],"label_agreement":null},{"id":"W2950831396","doi":"10.48550/arxiv.1602.02294","title":"A Source-Channel Separation Theorem with Application to the Source Broadcast Problem","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Converse; Separation (statistics); Source separation; Channel (broadcasting); Reduction (mathematics); Argument (complex analysis); Computer science; Mutual fund separation theorem; Mathematics; Algorithm; Telecommunications; Geometry; Economics","score_opus":0.02522740399910895,"score_gpt":0.1848184136433601,"score_spread":0.15959100964425116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950831396","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.059291814,0.00006733116,0.93207926,0.0003452168,0.000041324416,0.0011658284,0.000022228496,0.0013173494,0.0056696343],"genre_scores_gemma":[0.99787813,0.00016744941,0.00069965725,0.00007171788,0.000088908164,0.000051324034,0.00004138143,0.00008033275,0.0009210891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987638,0.000116239105,0.000203243,0.0005267069,0.00010765134,0.00028233803],"domain_scores_gemma":[0.99776196,0.00009356432,0.00014551404,0.0017168473,0.0001665103,0.00011561169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025972427,0.000339399,0.00025166798,0.00019832692,0.00017737312,0.00008108183,0.0012348845,0.00026572362,0.000014778398],"category_scores_gemma":[0.000008860336,0.00027098955,0.00009574487,0.00040117247,0.00010581926,0.00015132656,0.00065086293,0.0005317018,0.00015394735],"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.000053973487,0.000036529065,0.00016885063,0.00009055658,0.00010638172,0.000002104591,0.0017104362,0.96127504,0.00034688786,0.029436376,0.0013575325,0.00541532],"study_design_scores_gemma":[0.0005597365,0.00009806303,0.00024022604,0.00053746335,0.00016441608,0.000012586911,0.00054729806,0.8585339,0.003187625,0.036789816,0.09804858,0.0012802731],"about_ca_topic_score_codex":0.00007038558,"about_ca_topic_score_gemma":0.00012741907,"teacher_disagreement_score":0.93858635,"about_ca_system_score_codex":0.00027636794,"about_ca_system_score_gemma":0.00004487941,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W2950883843","doi":"10.1109/tcomm.2019.2921966","title":"Transmit Antenna Selection in Secure MIMO Systems Over $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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; Concordia University","funders":"","keywords":"Fading; Transmitter; MIMO; Channel state information; Secrecy; Computer science; Channel (broadcasting); Channel capacity; Antenna (radio); Topology (electrical circuits); Upper and lower bounds; Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Wireless; Computer security","score_opus":0.01944448894364269,"score_gpt":0.2558385507497109,"score_spread":0.2363940618060682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950883843","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.18943623,0.0025530134,0.78987986,0.0011136187,0.0012661854,0.002530406,0.00014358846,0.0035688449,0.009508259],"genre_scores_gemma":[0.9944583,0.0028676724,0.0017004852,0.000054614222,0.000021040367,0.00050070224,0.000019734456,0.000091201,0.00028621472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983148,0.00024260105,0.0005803324,0.0002630494,0.00024173138,0.00035751486],"domain_scores_gemma":[0.9976365,0.0003111708,0.000073666124,0.0017855293,0.00010135153,0.00009175553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032381865,0.0002925861,0.00035019455,0.0006447656,0.00024818876,0.00010802038,0.0011798361,0.00025895616,0.00012163755],"category_scores_gemma":[0.0000034795567,0.00035192652,0.0001462575,0.0010411325,0.00007647808,0.00050529063,0.000007190838,0.0011338259,0.0001663949],"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.000085340536,0.0017288354,0.0009969765,0.00064366136,0.0005027497,0.0000035023625,0.010793377,0.833822,0.12728536,0.00987525,0.0013639441,0.012899005],"study_design_scores_gemma":[0.0008642487,0.00009129814,0.0006897306,0.00051932805,0.000043521904,0.000026079058,0.0004741772,0.97203183,0.0097731855,0.00026398498,0.014565816,0.00065681065],"about_ca_topic_score_codex":0.00029022107,"about_ca_topic_score_gemma":0.00062622165,"teacher_disagreement_score":0.8050221,"about_ca_system_score_codex":0.0003519621,"about_ca_system_score_gemma":0.000037362926,"threshold_uncertainty_score":0.99989325},"labels":[],"label_agreement":null},{"id":"W2951040947","doi":"10.48550/arxiv.0801.1306","title":"Capacity Bounds for the Gaussian Interference Channel","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Gaussian; Computer science; Telecommunications; Physics; Quantum mechanics","score_opus":0.09699289630834028,"score_gpt":0.27974106677695293,"score_spread":0.18274817046861264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951040947","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.77493364,0.002797333,0.20512567,0.0024353038,0.0016473696,0.0017853985,0.00018083288,0.0032196988,0.0078747505],"genre_scores_gemma":[0.99329305,0.003782395,0.0015544541,0.00012250543,0.00020545923,0.0008102443,0.00005233575,0.00007821893,0.00010133859],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888825,0.000042851683,0.0003508541,0.0002874244,0.00013101537,0.00029959015],"domain_scores_gemma":[0.99778426,0.00020533896,0.000101903985,0.0017379927,0.00010627956,0.000064217216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002207724,0.0003201524,0.00032008567,0.00009107448,0.00018991994,0.000066479006,0.0014994796,0.00034558715,0.000018020874],"category_scores_gemma":[0.00007514236,0.00027549476,0.0001813508,0.0000973825,0.00017456758,0.00008596603,0.000652652,0.001101758,0.000035877783],"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.00040388943,0.0020001307,0.15478086,0.014835997,0.008082604,0.000073506526,0.15078443,0.090055935,0.029031761,0.04914977,0.40088636,0.09991476],"study_design_scores_gemma":[0.0013342334,0.00024529378,0.16236275,0.0026860745,0.0003573061,0.00009289736,0.0007223271,0.39764214,0.120292775,0.024709322,0.2844986,0.005056268],"about_ca_topic_score_codex":0.00014061862,"about_ca_topic_score_gemma":0.00011227714,"teacher_disagreement_score":0.30758622,"about_ca_system_score_codex":0.00014808484,"about_ca_system_score_gemma":0.00004047079,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W2951380130","doi":"10.1109/tcns.2019.2923385","title":"Two-Way Gaussian Networks With a Jammer and Decentralized Control","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jamming; Nash equilibrium; Channel (broadcasting); Gaussian; Computer science; Mathematical optimization; Constraint (computer-aided design); Gaussian noise; Noise (video); Power control; Control theory (sociology); Game theory; Power (physics); Mathematics; Control (management); Telecommunications; Algorithm; Mathematical economics","score_opus":0.005577657446790629,"score_gpt":0.20087117428294934,"score_spread":0.19529351683615873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951380130","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.01882279,0.003071576,0.9743544,0.00007143073,0.0005961368,0.00135277,0.000023185945,0.0005091394,0.0011985612],"genre_scores_gemma":[0.9984891,0.0004677134,0.0005338935,0.00007855988,0.00008410988,0.00021981525,0.000002551251,0.00007394661,0.00005030429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984031,0.0001971542,0.00052056485,0.00023397517,0.00023370364,0.00041150016],"domain_scores_gemma":[0.9985867,0.000379602,0.00013733674,0.00066864624,0.000092235656,0.00013545126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032135955,0.00029133447,0.0006769259,0.00011208527,0.00008112611,0.000059417165,0.0002406912,0.00016286239,0.00004599682],"category_scores_gemma":[0.0000010313776,0.00025925244,0.0001016331,0.00026019596,0.00007530776,0.00015587923,9.342092e-7,0.00038137863,0.000013419318],"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.00028070586,0.000042229807,0.00046826052,0.00007468589,0.00037324708,0.000002154234,0.00006406557,0.99526244,0.00077566964,0.00060512935,0.00022257736,0.0018288357],"study_design_scores_gemma":[0.0065805875,0.0002299754,0.00027757947,0.0004875677,0.00015353133,0.000031862135,0.000059300906,0.9889848,0.0003224335,0.000013260893,0.0024890716,0.00037000037],"about_ca_topic_score_codex":0.000075793636,"about_ca_topic_score_gemma":0.000092585346,"teacher_disagreement_score":0.9796663,"about_ca_system_score_codex":0.00006343281,"about_ca_system_score_gemma":0.00001721859,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W2951735454","doi":"10.48550/arxiv.0809.0032","title":"A Variational Inference Framework for Soft-In-Soft-Out Detection in Multiple Access Channels","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inference; Multiuser detection; Decoding methods; Algorithm; Channel (broadcasting); Detector; Artificial intelligence","score_opus":0.09884173917998423,"score_gpt":0.3307147508745018,"score_spread":0.23187301169451757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951735454","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.39208183,0.00022572868,0.6057047,0.00010946401,0.00048064877,0.0007278186,0.000025230913,0.00058470067,0.00005984508],"genre_scores_gemma":[0.9804092,0.000971764,0.016839165,0.000058488895,0.00018393758,0.001334275,0.000117347015,0.00007768397,0.000008134177],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984334,0.00006613834,0.0005435166,0.0004253476,0.0001917589,0.0003398072],"domain_scores_gemma":[0.99801594,0.000774961,0.00015766213,0.00086134835,0.00013054172,0.000059532846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028725757,0.00032318907,0.00041765807,0.00034750934,0.00008131672,0.00008350079,0.0009940198,0.00077344786,0.000027107573],"category_scores_gemma":[0.0007373014,0.00042349513,0.00011152914,0.00023984259,0.00004825868,0.00027653793,0.0005984158,0.0014181754,0.000031217147],"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.00009328199,0.00038109446,0.60050607,0.0011032168,0.0001415841,0.000012052735,0.0105233975,0.35661486,0.0016644205,0.000974993,0.00019922,0.027785838],"study_design_scores_gemma":[0.00064335036,0.000027239616,0.29226494,0.0010351697,0.000014656111,0.000002884748,0.000042290685,0.65552515,0.009299658,0.03891266,0.0013015207,0.00093049265],"about_ca_topic_score_codex":0.00034647874,"about_ca_topic_score_gemma":0.0013064579,"teacher_disagreement_score":0.5888656,"about_ca_system_score_codex":0.00031389226,"about_ca_system_score_gemma":0.00008372545,"threshold_uncertainty_score":0.99982166},"labels":[],"label_agreement":null},{"id":"W2951765939","doi":"10.48550/arxiv.1304.2688","title":"Efficient Wireless Security Through Jamming, Coding and Routing","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Physical layer; Goodput; Computer network; Jamming; Wireless network; Linear network coding; Wireless; Distributed computing; Network packet; Telecommunications","score_opus":0.046571688850621976,"score_gpt":0.19078163579839522,"score_spread":0.14420994694777323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951765939","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.93381405,0.0002624143,0.057720575,0.000034092347,0.00020710494,0.00043041146,0.000021517004,0.0014527088,0.0060571544],"genre_scores_gemma":[0.99752617,0.0013868168,0.0008406675,0.000025459478,0.00005169186,0.000004795233,0.000023968127,0.000065984415,0.00007447396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985238,0.00010617223,0.00028387626,0.0006074782,0.0000898323,0.00038889822],"domain_scores_gemma":[0.9983498,0.00013591067,0.00015885344,0.001110129,0.00012013696,0.00012521347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022374494,0.0004098487,0.00043895186,0.0001553398,0.0001845303,0.00012468551,0.0008079552,0.00045578886,0.000039271432],"category_scores_gemma":[0.000023060968,0.0005337823,0.00012567494,0.000267224,0.00017397286,0.00014586945,0.0015327055,0.0011270663,0.00003529109],"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.00001735768,0.00014779913,0.0025845352,0.0012178097,0.0003326816,0.00009828881,0.0091562765,0.56378555,0.0008028683,0.41907164,0.0012033423,0.0015818859],"study_design_scores_gemma":[0.00022779676,0.000011891807,0.0002080177,0.0003498272,0.000060135804,0.0000044125068,0.00048565818,0.9846028,0.001234566,0.011660642,0.0005490334,0.0006051908],"about_ca_topic_score_codex":0.00035242518,"about_ca_topic_score_gemma":0.000036530357,"teacher_disagreement_score":0.42081732,"about_ca_system_score_codex":0.00029937984,"about_ca_system_score_gemma":0.00003268022,"threshold_uncertainty_score":0.9997114},"labels":[],"label_agreement":null},{"id":"W2951799516","doi":"10.48550/arxiv.0904.4735","title":"The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast Channel","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secrecy; MIMO; Computer science; Channel (broadcasting); Superposition principle; Gaussian; Computer network; Topology (electrical circuits); Information-theoretic security; Coding (social sciences); Node (physics); Dirty paper coding; Channel capacity; Telecommunications; Mathematics; Precoding; Computer security; Physics; Combinatorics; Statistics","score_opus":0.05933421882492324,"score_gpt":0.24766054590335157,"score_spread":0.18832632707842833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951799516","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.9834539,0.0031801271,0.00235871,0.002881537,0.00068919995,0.00086671626,0.00002207792,0.00097142154,0.0055763037],"genre_scores_gemma":[0.9954061,0.0038400027,0.000272128,0.00007094091,0.00013694068,0.00010004139,0.000015119382,0.000060955877,0.00009776873],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984808,0.00022104969,0.00047827035,0.0002624705,0.0002555455,0.0003018753],"domain_scores_gemma":[0.99685717,0.00012776797,0.00025157936,0.0025932053,0.00010532927,0.00006497271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030291203,0.00033536495,0.00035523195,0.00007187484,0.00020542959,0.000048060352,0.0018311051,0.00039835062,0.0000045214506],"category_scores_gemma":[0.000099858196,0.00023396197,0.00025264922,0.00022681644,0.00020388696,0.000067515604,0.0005923179,0.0014041271,0.0000111655],"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.00041825487,0.002493369,0.29346743,0.008987106,0.005002222,0.000098941215,0.08660564,0.024821518,0.08453135,0.15297136,0.083693035,0.2569098],"study_design_scores_gemma":[0.0005825937,0.00008384718,0.7644111,0.0023184433,0.00017751248,0.000059676233,0.00042707272,0.008656435,0.14530627,0.023172528,0.053103458,0.0017010719],"about_ca_topic_score_codex":0.0001757237,"about_ca_topic_score_gemma":0.00015835951,"teacher_disagreement_score":0.47094366,"about_ca_system_score_codex":0.00016449486,"about_ca_system_score_gemma":0.000046884335,"threshold_uncertainty_score":0.9540692},"labels":[],"label_agreement":null},{"id":"W2951934635","doi":"10.48550/arxiv.1006.5087","title":"Gaussian Z-Interference Channel with a Relay Link: Achievability Region and Asymptotic Sum Capacity","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interference (communication); Relay; Topology (electrical circuits); Channel (broadcasting); Noise (video); Channel capacity; Telecommunications; Computer science; Mathematics; Physics; Combinatorics; Power (physics)","score_opus":0.055545849809618984,"score_gpt":0.1767329948623837,"score_spread":0.1211871450527647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951934635","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.88369733,0.00005486652,0.11181637,0.00015835476,0.00013059659,0.0003214582,0.000017487866,0.00091971917,0.0028838357],"genre_scores_gemma":[0.99816084,0.0005629539,0.0010722206,0.00001884199,0.000040781142,0.000004813021,0.00002082145,0.00004840746,0.00007033518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987455,0.000109593675,0.00019218762,0.0006107739,0.00006506425,0.00027688255],"domain_scores_gemma":[0.9978635,0.00009437582,0.00012914334,0.0016316334,0.00011105004,0.0001703445],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00019850499,0.00035127954,0.00033858957,0.00019107628,0.000115877454,0.00006863882,0.000791434,0.00082544977,0.000013426248],"category_scores_gemma":[0.00003247325,0.00039808432,0.00008623277,0.00021655475,0.0003560016,0.000205485,0.0006995345,0.0026051525,0.000008852476],"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.0010150722,0.0009986812,0.066543885,0.0073409146,0.0018627523,0.0008784137,0.013492071,0.50841933,0.0030080823,0.3896819,0.0012930889,0.0054657804],"study_design_scores_gemma":[0.0009876188,0.00024925882,0.01869942,0.0013951759,0.00030832924,0.00008033134,0.0002779684,0.9359636,0.0046123755,0.034452863,0.0008560513,0.002117046],"about_ca_topic_score_codex":0.00022406029,"about_ca_topic_score_gemma":0.0007547835,"teacher_disagreement_score":0.4275442,"about_ca_system_score_codex":0.00015177809,"about_ca_system_score_gemma":0.000049048132,"threshold_uncertainty_score":0.9998471},"labels":[],"label_agreement":null},{"id":"W2952224110","doi":"10.48550/arxiv.1407.8494","title":"Joint Design of Optimal Cooperative Jamming and Power Allocation for Linear Precoding","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Precoding; Jamming; Computer science; Base station; Zero-forcing precoding; Secrecy; Channel (broadcasting); Computer network; Optimization problem; Transmitter power output; Physical layer; Mathematical optimization; Telecommunications; Wireless; Mathematics; Algorithm; Computer security; MIMO; Transmitter","score_opus":0.09023278522356695,"score_gpt":0.2064551929584359,"score_spread":0.11622240773486894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952224110","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.23170027,0.00007716589,0.7671735,0.000013270209,0.00005662061,0.0005132915,0.000014645113,0.00022672293,0.00022449024],"genre_scores_gemma":[0.96146065,0.00047823368,0.03792178,0.000007767612,0.00001897779,0.000007683583,0.00002752288,0.000036159272,0.000041218627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991941,0.00008878334,0.00022515682,0.0003066611,0.00003737646,0.00014793349],"domain_scores_gemma":[0.9988752,0.0001869189,0.00013664592,0.0005199587,0.00022607105,0.0000551811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003296713,0.0002061377,0.00031830388,0.00018066206,0.00006498724,0.000023054028,0.00032266288,0.0002442552,0.0000088392135],"category_scores_gemma":[0.000060525654,0.00026373696,0.00007257754,0.00010676157,0.00008154575,0.00013051683,0.0003172978,0.00030510555,0.000001982076],"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.000024947678,0.000018864688,0.000031346175,0.00023006613,0.00010667804,9.4266e-7,0.0007690072,0.98730767,0.0024620276,0.0087434435,0.0001049605,0.00020003584],"study_design_scores_gemma":[0.0002423661,0.000070690534,0.00005164308,0.00021321591,0.000053841817,7.9277726e-7,0.00014294824,0.98064214,0.017202586,0.0009435873,0.00017479036,0.00026141896],"about_ca_topic_score_codex":0.000013835713,"about_ca_topic_score_gemma":0.0000036165773,"teacher_disagreement_score":0.7297604,"about_ca_system_score_codex":0.000108140855,"about_ca_system_score_gemma":0.000037113652,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W2952946716","doi":"","title":"Rate Adaptation for Secure HARQ Protocols","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Adaptation (eye); Computer network; Psychology; Neuroscience","score_opus":0.025502289424909015,"score_gpt":0.2607698954498185,"score_spread":0.23526760602490948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952946716","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.009422158,0.0006084931,0.9419701,0.0034651232,0.00024551922,0.013432232,0.00030145244,0.0028769344,0.027677976],"genre_scores_gemma":[0.53504056,0.0007302052,0.4267446,0.0001337169,0.00012781961,0.031935945,0.0022662529,0.00032008346,0.0027008208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952108,0.0025724114,0.00077337865,0.00067538384,0.00033559685,0.00043239584],"domain_scores_gemma":[0.99174964,0.001233925,0.0004329991,0.0033562079,0.0030582063,0.00016904065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005240445,0.00049467495,0.000505521,0.00026599926,0.00031506855,0.0005166453,0.0020136544,0.00058304524,0.000109683846],"category_scores_gemma":[0.0010853171,0.0005894697,0.00027210987,0.00031699752,0.00022802272,0.00023327547,0.00096278684,0.00081774034,0.000050986408],"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.00018195003,0.0022714317,0.0007356996,0.0090239225,0.0011896429,0.000008211451,0.09242361,0.008193218,0.03381349,0.4580508,0.1406891,0.25341895],"study_design_scores_gemma":[0.0009067525,0.0000014929005,0.0004519653,0.004889763,0.00006948987,0.0000052000346,0.00013388747,0.50037336,0.23149616,0.031770073,0.22869249,0.0012093704],"about_ca_topic_score_codex":0.00015114386,"about_ca_topic_score_gemma":0.0007779568,"teacher_disagreement_score":0.5256184,"about_ca_system_score_codex":0.00022555479,"about_ca_system_score_gemma":0.00021284512,"threshold_uncertainty_score":0.99965566},"labels":[],"label_agreement":null},{"id":"W2952966314","doi":"10.48550/arxiv.0904.1892","title":"Lattice Strategies for the Dirty Multiple Access Channel","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Channel (broadcasting); Lattice (music); Computer security; Computer science; Computer network; Business; Physics; Acoustics","score_opus":0.10300304320523185,"score_gpt":0.3271324361329636,"score_spread":0.22412939292773176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952966314","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.73331267,0.007828491,0.23975469,0.0029169954,0.0011719754,0.0031852438,0.0001953481,0.005287076,0.006347491],"genre_scores_gemma":[0.99450576,0.002076167,0.0020594199,0.00019883577,0.00023080739,0.0007236621,0.000084703795,0.0000758305,0.000044800934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998886,0.00004848649,0.00034044893,0.00028204333,0.00014767205,0.00029537306],"domain_scores_gemma":[0.9976203,0.00049963704,0.00011143635,0.0015855582,0.0001326244,0.000050477447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029978025,0.0003217776,0.00031390614,0.000081199396,0.0001552497,0.0002710557,0.0020304057,0.00032634975,0.000013950218],"category_scores_gemma":[0.000082583654,0.00027180745,0.00016255665,0.00011319888,0.00006665499,0.00028951446,0.00071879226,0.0008343167,0.00001815676],"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.00025132566,0.0011162199,0.06902838,0.008791727,0.003245362,0.000027402064,0.022554673,0.6823137,0.008067339,0.040570114,0.09901272,0.06502105],"study_design_scores_gemma":[0.0011893583,0.00009286776,0.24127951,0.0010722826,0.0003680026,0.0000077608,0.0013747805,0.555698,0.030373048,0.066376686,0.099355854,0.0028118433],"about_ca_topic_score_codex":0.000139854,"about_ca_topic_score_gemma":0.00020063686,"teacher_disagreement_score":0.2611931,"about_ca_system_score_codex":0.00007790325,"about_ca_system_score_gemma":0.0000522188,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2953079802","doi":"10.48550/arxiv.1810.01567","title":"Lattice-based Robust Distributed Source Coding","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Gaussian; Rate distortion; Lattice (music); Coding (social sciences); Computer science; Distributed source coding; Quadratic equation; Algorithm; Shannon–Fano coding; Source code; Mathematics; Variable-length code; Statistical physics; Theoretical computer science; Physics; Statistics; Decoding methods; Quantum mechanics; Geometry","score_opus":0.0772510405235416,"score_gpt":0.18729611655445455,"score_spread":0.11004507603091294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953079802","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.22576481,0.00007220016,0.76828134,0.000042869462,0.00019499316,0.00026209114,0.00011987098,0.0025523992,0.002709433],"genre_scores_gemma":[0.9966441,0.00020362201,0.0025081658,0.000034983717,0.000078573845,0.0000027903077,0.00030852735,0.0000738299,0.00014542088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.00010449745,0.0002315925,0.0004906047,0.00008077746,0.00033505948],"domain_scores_gemma":[0.99782413,0.00014090863,0.00013176081,0.001586021,0.00017438282,0.00014276736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002000643,0.00035794592,0.00035023637,0.0002454722,0.00013888345,0.00008373175,0.0012681343,0.00047139823,0.00012461246],"category_scores_gemma":[0.000039010116,0.00048786163,0.00018099102,0.0004089318,0.00017997604,0.00012889947,0.00075548084,0.0008583228,0.000105673345],"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.000015861493,0.00004854298,0.0012737055,0.00023792851,0.00010156624,0.000029008894,0.00008759829,0.98920655,0.00008288474,0.0058143395,0.0029708645,0.00013113109],"study_design_scores_gemma":[0.0002872223,0.000016033237,0.00035942733,0.0002602587,0.000090643014,0.000001082812,0.000045503963,0.9873308,0.0019494321,0.0022692985,0.0068210037,0.0005693193],"about_ca_topic_score_codex":0.00006450457,"about_ca_topic_score_gemma":0.00004408148,"teacher_disagreement_score":0.77087927,"about_ca_system_score_codex":0.00043201374,"about_ca_system_score_gemma":0.00006607702,"threshold_uncertainty_score":0.9997573},"labels":[],"label_agreement":null},{"id":"W2953177019","doi":"10.1049/iet-com.2019.0198","title":"Physical layer secrecy performance of multiple antennas transmission with partial legitimate user CSI","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","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 Victoria","funders":"","keywords":"Secrecy; Physical layer; Computer science; Transmission (telecommunications); Computer network; Secure transmission; Layer (electronics); Telecommunications; Computer security; Wireless; Materials science","score_opus":0.018963444710705844,"score_gpt":0.255696522959321,"score_spread":0.23673307824861514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953177019","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.9860465,0.00026483976,0.005995487,0.00030233955,0.000021418631,0.00040149828,0.000020622778,0.00054641906,0.0064008553],"genre_scores_gemma":[0.9817104,0.0008691114,0.017121043,0.000021546437,0.000010914507,0.000099747645,0.00006179983,0.000043340828,0.000062128405],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992232,0.00007179003,0.00025092767,0.00011427994,0.00016287419,0.00017694049],"domain_scores_gemma":[0.99728096,0.00017382005,0.00006332631,0.0023148598,0.00011138636,0.000055658504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111267684,0.00014874426,0.00023099354,0.00007422392,0.00009356825,0.000021760798,0.0010445949,0.00006675884,0.000037044414],"category_scores_gemma":[0.000006025223,0.0001365866,0.00006177595,0.00024340922,0.00012892082,0.0003189191,0.0001513297,0.00033169545,0.00005242019],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032014135,0.0022153445,0.0977631,0.00113962,0.00048375982,0.0000015072663,0.019687718,0.029584104,0.76984715,0.031405438,0.0017473954,0.04580471],"study_design_scores_gemma":[0.0006967356,0.00013905292,0.006137478,0.00032755447,0.00003081615,0.00000594718,0.0001524327,0.7865652,0.15102668,0.0001018387,0.05445963,0.0003566676],"about_ca_topic_score_codex":0.000031886895,"about_ca_topic_score_gemma":0.000023432647,"teacher_disagreement_score":0.7569811,"about_ca_system_score_codex":0.000030485113,"about_ca_system_score_gemma":0.000022953946,"threshold_uncertainty_score":0.556984},"labels":[],"label_agreement":null},{"id":"W2955965660","doi":"10.1109/iswcs.2019.8877294","title":"Early Detection for Optimal-Latency Communications in Multi-Hop Links","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Hydro-Québec; École de Technologie Supérieure","funders":"","keywords":"Wireless; Channel (broadcasting); Reliability (semiconductor); Coding (social sciences); Error detection and correction; Transmission (telecommunications); Hybrid automatic repeat request; Latency (audio)","score_opus":0.037027100636306765,"score_gpt":0.2942203329294353,"score_spread":0.2571932322931285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955965660","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.6673251,0.00043272757,0.32165155,0.0002823431,0.00010812352,0.001187507,0.000008035475,0.0016902318,0.007314423],"genre_scores_gemma":[0.8851899,0.00025986228,0.1140759,0.000027435195,0.000004916809,0.00022618075,0.000011812669,0.000029086865,0.00017491242],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994379,0.000026643977,0.00023654471,0.00010030549,0.00005325317,0.00014530245],"domain_scores_gemma":[0.998689,0.00011853407,0.000024602925,0.0010794412,0.00006087094,0.00002753559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016528973,0.00009362478,0.00012341101,0.00014537724,0.00003768521,0.000027869677,0.00052858755,0.00018749952,0.000030251727],"category_scores_gemma":[0.000018939252,0.0001052486,0.00004493645,0.00018034788,0.00002094074,0.00020443315,0.00009935678,0.00035928085,0.000083134044],"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.000093408205,0.0012516184,0.037378464,0.0007928855,0.00025119464,0.0000013211346,0.014874861,0.040761422,0.60157186,0.054794587,0.0013749178,0.24685347],"study_design_scores_gemma":[0.0006860948,0.00005473264,0.0125183,0.000047059377,0.0000052231267,0.0000012880511,0.00014823096,0.9404348,0.03484956,0.00031966565,0.010655369,0.0002796721],"about_ca_topic_score_codex":0.00012816739,"about_ca_topic_score_gemma":0.00037319819,"teacher_disagreement_score":0.8996734,"about_ca_system_score_codex":0.00007335375,"about_ca_system_score_gemma":0.000006574853,"threshold_uncertainty_score":0.42919132},"labels":[],"label_agreement":null},{"id":"W2961674272","doi":"10.1109/icc.2019.8761588","title":"Towards a Win-Win Spectrum Sharing Channel: A Secrecy Perspective","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Secrecy; Computer science; Eavesdropping; Computer network; Throughput; Transmission (telecommunications); Channel (broadcasting); Forward secrecy; Computer security; Wireless; Telecommunications; Public-key cryptography; Encryption","score_opus":0.011886696851781337,"score_gpt":0.24498480454651064,"score_spread":0.2330981076947293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961674272","genre_codex":"other","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.2029043,0.00049940887,0.024667585,0.001495846,0.00024044982,0.0006215803,0.0000071497916,0.0050490787,0.7645146],"genre_scores_gemma":[0.99647015,0.00016683535,0.002407014,0.0000985423,0.00006183621,0.000040423558,0.000005418264,0.000058352158,0.0006913958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991408,0.000016391197,0.00017867745,0.00022948955,0.00016114576,0.00027347088],"domain_scores_gemma":[0.9990474,0.00002745908,0.00002217906,0.0007824433,0.000051166997,0.000069348374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014746567,0.0001748434,0.00020724868,0.0001542308,0.000034690212,0.000062680294,0.00053680094,0.0000973656,0.00078050816],"category_scores_gemma":[0.000016026628,0.00018326576,0.00007859161,0.0002492359,0.000020447602,0.00023569496,0.00021576113,0.00030343368,0.00040833701],"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.000025836429,0.00014809224,0.0015213778,0.00020222503,0.00027868236,0.000011044859,0.017762281,0.0032328013,0.0131975645,0.95634663,0.0038907947,0.003382686],"study_design_scores_gemma":[0.0015464646,0.00028660145,0.006924803,0.00035701663,0.00004406713,0.00006760367,0.0096755745,0.47534207,0.2532957,0.22346246,0.02660519,0.0023924517],"about_ca_topic_score_codex":0.00034148814,"about_ca_topic_score_gemma":0.00009287563,"teacher_disagreement_score":0.79356587,"about_ca_system_score_codex":0.00027444543,"about_ca_system_score_gemma":0.000016875962,"threshold_uncertainty_score":0.8546017},"labels":[],"label_agreement":null},{"id":"W2962760265","doi":"10.3390/e19080389","title":"On the Reliability Function of Variable-Rate Slepian-Wolf Coding","year":2017,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decoding methods; Variable (mathematics); Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.016362120831959436,"score_gpt":0.23864368948839315,"score_spread":0.22228156865643373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962760265","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.8227737,0.00009746506,0.11908075,0.0017717093,0.0007015903,0.0005019482,0.000020431387,0.0008852601,0.054167133],"genre_scores_gemma":[0.99868315,0.00006994356,0.0010839398,0.000044244705,0.000031970554,0.000022708893,0.0000026203254,0.000014193274,0.000047200127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994977,0.00006487648,0.00015395063,0.00008434564,0.00009558213,0.00010352843],"domain_scores_gemma":[0.9983094,0.0002147044,0.00008023084,0.0013287547,0.00004627374,0.00002066544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048172273,0.00007711008,0.00010394146,0.00002381286,0.0001817562,0.000045329132,0.00044979368,0.00005186624,0.00011728805],"category_scores_gemma":[0.00032828483,0.000060532944,0.000035197412,0.000029805324,0.000056692013,0.000110717425,0.00006854312,0.00018989498,0.000028739147],"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.000030444504,0.00004065047,0.0008208658,0.00004929407,0.000033819553,3.4923752e-7,0.00022620046,0.004037172,0.037628103,0.95035017,0.0055121337,0.0012708054],"study_design_scores_gemma":[0.0010869575,0.0002579257,0.0629073,0.00046593972,0.00008240277,0.0000017689053,0.00013365764,0.23792483,0.30598757,0.32932037,0.061090223,0.0007410336],"about_ca_topic_score_codex":0.0000499953,"about_ca_topic_score_gemma":0.000004367788,"teacher_disagreement_score":0.6210298,"about_ca_system_score_codex":0.000044802502,"about_ca_system_score_gemma":0.000006531418,"threshold_uncertainty_score":0.24684618},"labels":[],"label_agreement":null},{"id":"W2962835128","doi":"10.1109/tcomm.2016.2591530","title":"BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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":"Converse; Bit error rate; Computer science; Erasure; Physical layer; Algorithm; Binary number; Transmission (telecommunications); Additive white Gaussian noise; Decoding methods; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Channel (broadcasting); Telecommunications; Arithmetic; Wireless; Combinatorics","score_opus":0.04125545553687764,"score_gpt":0.2765831914220022,"score_spread":0.23532773588512457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835128","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.10082569,0.000090445,0.89283526,0.002369061,0.0000600539,0.00051106006,0.00022278885,0.001435877,0.0016497385],"genre_scores_gemma":[0.99221,0.0004683978,0.006743851,0.000058264326,0.00000998144,0.00038874015,0.000024317393,0.00006240225,0.000034053654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886745,0.00016924126,0.00029203593,0.00023332718,0.00020024012,0.00023769877],"domain_scores_gemma":[0.9962818,0.0010792086,0.00007905122,0.0022934761,0.00014288543,0.00012360446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015557322,0.00024657653,0.00023815993,0.00019545473,0.00039993104,0.000053275213,0.00069415563,0.00011050236,0.000034915043],"category_scores_gemma":[0.000009159452,0.00021226269,0.00007026194,0.00029906858,0.00040703197,0.00033569126,0.000009338556,0.00047866083,0.000043957392],"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.00095152826,0.01848455,0.0024300995,0.0010866567,0.00303701,0.0000120526465,0.04244299,0.24223986,0.19092497,0.1712914,0.004734447,0.32236445],"study_design_scores_gemma":[0.0032214404,0.0004513816,0.00048928516,0.0006288294,0.00023587397,0.000012762311,0.0008469186,0.8963297,0.08093434,0.0018467595,0.01375872,0.0012439885],"about_ca_topic_score_codex":0.000032807595,"about_ca_topic_score_gemma":0.00023902717,"teacher_disagreement_score":0.8913843,"about_ca_system_score_codex":0.00012735068,"about_ca_system_score_gemma":0.000043571665,"threshold_uncertainty_score":0.86558217},"labels":[],"label_agreement":null},{"id":"W2962953293","doi":"10.1109/iwcmc.2019.8766490","title":"Raptor Code based on punctured LDPC for Secrecy in Massive MiMo","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Eavesdropping; Fountain code; MIMO; Computer network; Secrecy; Physical layer; Raptor code; Decoding methods; Network packet; Channel (broadcasting); Artificial noise; Code (set theory); Jamming; Transmitter; Wireless; Low-density parity-check code; Computer security; Telecommunications","score_opus":0.011446607500069513,"score_gpt":0.24082225111179947,"score_spread":0.22937564361172996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962953293","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.39675063,0.00026083828,0.4114618,0.0041717486,0.000740706,0.0054809805,0.00017445735,0.0053145112,0.17564435],"genre_scores_gemma":[0.9810853,0.000011646231,0.018042304,0.0003498259,0.000014402735,0.00017032617,0.00004104213,0.000035216828,0.00024992414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999443,0.00002221718,0.00016281435,0.00012477812,0.000090778434,0.00015644345],"domain_scores_gemma":[0.99917346,0.0002064224,0.000019430332,0.0005342489,0.0000331231,0.000033324068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001225867,0.00012068606,0.0001599193,0.00013465736,0.000012763634,0.000018808549,0.00025257788,0.00010377162,0.00026260098],"category_scores_gemma":[0.000024272376,0.00011088103,0.000052498635,0.00011359892,0.000009301212,0.00006371488,0.000020334777,0.00014466538,0.00005737311],"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.000739229,0.00088888744,0.014579387,0.001637419,0.00020799338,0.000009366925,0.0030041628,0.33283854,0.25183848,0.23823245,0.12443082,0.031593278],"study_design_scores_gemma":[0.0011840913,0.00008675432,0.0015089436,0.00008586616,0.0000039592933,2.1815453e-7,0.00006758548,0.8110743,0.1237634,0.0011475196,0.06076551,0.00031183424],"about_ca_topic_score_codex":0.0000123732625,"about_ca_topic_score_gemma":0.0000985453,"teacher_disagreement_score":0.5843347,"about_ca_system_score_codex":0.00008427381,"about_ca_system_score_gemma":0.000016037075,"threshold_uncertainty_score":0.45215973},"labels":[],"label_agreement":null},{"id":"W2963090386","doi":"10.1109/tvt.2019.2931277","title":"Artificial Noise Scheme for Correlated MISO Wiretap Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Ergodic theory; Secrecy; Artificial noise; Channel (broadcasting); Noise (video); Upper and lower bounds; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer science; Correlation; SIGNAL (programming language); Mathematics; Electronic engineering; Telecommunications; Engineering; Computer security; Artificial intelligence; Transmitter; Combinatorics; Mathematical analysis","score_opus":0.011808026807163063,"score_gpt":0.23090913343898917,"score_spread":0.2191011066318261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963090386","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.4335939,0.00015367247,0.5607286,0.00062936894,0.0005806254,0.0007886086,0.000026276257,0.0033344552,0.00016449428],"genre_scores_gemma":[0.9928963,0.00009674196,0.0062418464,0.000056167464,0.000017770048,0.00046361305,0.000012560107,0.00007979588,0.0001352007],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888253,0.000020489502,0.00034056985,0.0002841286,0.00013223292,0.0003400204],"domain_scores_gemma":[0.99882376,0.00006674688,0.000046701156,0.00090948737,0.000103392755,0.000049898932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011883932,0.00023585923,0.00029981305,0.0005550488,0.00011678765,0.000024423596,0.0004557742,0.0006193865,0.00009309158],"category_scores_gemma":[0.0000063451635,0.00027231214,0.00015101454,0.0005831165,0.00009859617,0.000110439534,0.000002967367,0.00064303854,0.000302364],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010079481,0.00047216142,0.0000423886,0.00020738288,0.00040944733,0.000008541743,0.0003761216,0.13358526,0.7702408,0.0068489183,0.0008500973,0.08685812],"study_design_scores_gemma":[0.00031213454,0.00014703308,0.000004479733,0.000058139864,0.000029195176,0.000016286902,0.000070519796,0.27223393,0.7187348,0.0012922391,0.0067834766,0.00031775126],"about_ca_topic_score_codex":0.0000058347446,"about_ca_topic_score_gemma":0.000011460527,"teacher_disagreement_score":0.5593024,"about_ca_system_score_codex":0.00011928683,"about_ca_system_score_gemma":0.000019926994,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2963122821","doi":"10.1109/ita.2013.6502988","title":"New non-asymptotic random channel coding theorems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discrete mathematics; Binary number; Applied mathematics; Constant (computer programming); Combinatorics; Computer science; Arithmetic","score_opus":0.007863954225488846,"score_gpt":0.2068833226115034,"score_spread":0.19901936838601456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963122821","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.023555512,0.00023931773,0.7974651,0.0005270603,0.00016551731,0.00053762126,7.442579e-7,0.002670636,0.1748385],"genre_scores_gemma":[0.98855615,0.00018722862,0.0103478525,0.00009478274,0.00005433558,0.00005597228,0.0000036678607,0.00003223757,0.0006677881],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.00001507936,0.00016756631,0.000084118496,0.000090017646,0.00017660823],"domain_scores_gemma":[0.99934024,0.000088284854,0.000015931011,0.00043775496,0.000031969965,0.00008580904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009774403,0.000113329625,0.00014489217,0.000072242685,0.00003766669,0.00006753305,0.00032510218,0.00006576265,0.0008566204],"category_scores_gemma":[0.000013956132,0.000103024955,0.000044679753,0.0001139212,0.000016961165,0.000216286,0.000061407256,0.00013563088,0.0005151939],"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.000023421077,0.0001031013,0.00057865446,0.00025765545,0.00030002306,0.0000038297153,0.0075666266,0.0071321195,0.11813785,0.19359452,0.5435901,0.12871207],"study_design_scores_gemma":[0.0027260254,0.00004843747,0.0021826061,0.00018625843,0.00002368997,0.00001567386,0.00042212126,0.7223573,0.21077459,0.04906446,0.0111614615,0.001037396],"about_ca_topic_score_codex":0.00022058348,"about_ca_topic_score_gemma":0.000012374126,"teacher_disagreement_score":0.9650006,"about_ca_system_score_codex":0.000029792463,"about_ca_system_score_gemma":0.0000076093484,"threshold_uncertainty_score":0.9379393},"labels":[],"label_agreement":null},{"id":"W2963658073","doi":"10.1109/cns.2015.7346838","title":"Adversarial wiretap channel with public discussion","year":2015,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Adversarial system; Computer science; Channel (broadcasting); Telecommunications; Computer network; Computer security; Artificial intelligence","score_opus":0.03685030809863261,"score_gpt":0.22808735543760114,"score_spread":0.19123704733896854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963658073","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.076813504,0.00045211735,0.48916283,0.013538905,0.0006877282,0.00091865094,0.000011961608,0.014444618,0.40396968],"genre_scores_gemma":[0.99441755,0.000014109415,0.0051418706,0.00004275727,0.000045532463,0.000027036835,0.000014042757,0.000024677345,0.0002724529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995033,0.000020142757,0.00009856983,0.00008008607,0.0001585663,0.00013929786],"domain_scores_gemma":[0.9993994,0.000009495982,0.000013491832,0.00040068728,0.000057212896,0.00011969276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011971479,0.00009070071,0.00009262956,0.00006656177,0.000026069885,0.00003997432,0.00024091601,0.000055675737,0.000037089485],"category_scores_gemma":[0.0000141069895,0.000053708,0.000016892536,0.00015150008,0.000030417183,0.00029892998,0.00006494314,0.00011564522,0.00004612078],"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.00031616888,0.0008780712,0.0064093783,0.0003005356,0.0006081859,0.000049278435,0.034543924,0.020629283,0.005867832,0.20902221,0.58343947,0.13793567],"study_design_scores_gemma":[0.0038188205,0.00044894614,0.0014236473,0.00015444793,0.000040476065,0.00005482008,0.0034028504,0.45210323,0.031332113,0.009220068,0.49620533,0.001795267],"about_ca_topic_score_codex":0.000019494673,"about_ca_topic_score_gemma":0.00006944645,"teacher_disagreement_score":0.917604,"about_ca_system_score_codex":0.000056153393,"about_ca_system_score_gemma":0.000021722612,"threshold_uncertainty_score":0.21901487},"labels":[],"label_agreement":null},{"id":"W2963728200","doi":"10.1109/twc.2017.2659724","title":"Analysis and Design of Secure Massive MIMO Systems in the Presence of Hardware Impairments","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Artificial noise; Precoding; Computer science; Telecommunications link; MIMO; Base station; Noise (video); Transceiver; Transmission (telecommunications); Computer hardware; Phase noise; Secrecy; Electronic engineering; Wireless; Computer network; Transmitter; Telecommunications; Channel (broadcasting); Engineering; Artificial intelligence","score_opus":0.03368444558871831,"score_gpt":0.2853404049934569,"score_spread":0.2516559594047386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963728200","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.12023912,0.0009908996,0.8762569,0.00055995805,0.00007283293,0.0010362851,0.00021787266,0.0001452793,0.0004808789],"genre_scores_gemma":[0.9925393,0.003837703,0.003237053,0.000006383815,0.0000025229238,0.00034016004,0.000007668038,0.000018673361,0.000010532067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.00038614817,0.00046686546,0.00013327,0.00021803744,0.00014060996],"domain_scores_gemma":[0.9948201,0.00067266,0.00023441257,0.004100553,0.00013573054,0.00003654626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046094987,0.00015266458,0.00034582827,0.00035809353,0.00035539997,0.000069357775,0.002333948,0.00011018692,0.0000051414354],"category_scores_gemma":[0.000014796764,0.00013946883,0.00010257181,0.00044814716,0.00039934326,0.00025274607,0.000019864317,0.000396249,0.000001111113],"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.00009572234,0.002074436,0.0070887515,0.00079856266,0.0027048087,0.000005823728,0.029383188,0.8966205,0.0237874,0.006670288,0.00029788158,0.030472629],"study_design_scores_gemma":[0.00060939864,0.00010868597,0.0141406255,0.00048386908,0.00050359924,0.0000071595855,0.0023993796,0.9593044,0.021644883,0.0002283692,0.00019619793,0.00037343756],"about_ca_topic_score_codex":0.00065253576,"about_ca_topic_score_gemma":0.0005780492,"teacher_disagreement_score":0.8730198,"about_ca_system_score_codex":0.000043149696,"about_ca_system_score_gemma":0.000025128844,"threshold_uncertainty_score":0.5687374},"labels":[],"label_agreement":null},{"id":"W2963753797","doi":"10.1109/bsc.2018.8494701","title":"Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Decoding methods; Binary number; Decodes; Logarithm; Upper and lower bounds; Algorithm; Low-density parity-check code; Distributed source coding; Mathematics; Coding (social sciences); Computer science; Binary code; Discrete mathematics; Theoretical computer science; Variable-length code; Arithmetic; Statistics","score_opus":0.03599085928043774,"score_gpt":0.2952396737729533,"score_spread":0.2592488144925156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963753797","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.005801989,0.0020991378,0.94667333,0.004068429,0.0008039487,0.0030715566,0.00011535279,0.0043567065,0.03300955],"genre_scores_gemma":[0.9633325,0.0013984208,0.03263268,0.0001998748,0.0002664187,0.0013949652,0.00012017549,0.00013176691,0.0005232448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986055,0.000058147714,0.00044229795,0.0003461927,0.0002020861,0.00034576713],"domain_scores_gemma":[0.99718213,0.0006867311,0.00014127248,0.0016878146,0.00024201942,0.000060022532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043305766,0.00037083292,0.00035562553,0.00013506129,0.00021031118,0.00018658458,0.0017160532,0.00046114373,0.00014313184],"category_scores_gemma":[0.00003855615,0.00028752303,0.00018358829,0.00012986668,0.00018570501,0.000120248376,0.0013687214,0.0007914006,0.000032432523],"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.0000958578,0.00037287307,0.0004532946,0.0065425592,0.0024888334,0.000012668049,0.006743706,0.12575293,0.0070097307,0.4401936,0.38509607,0.025237886],"study_design_scores_gemma":[0.00090671604,0.0001512627,0.0008099077,0.0017884943,0.00032751696,0.00001884411,0.00093062693,0.64210033,0.05534207,0.15922925,0.13556352,0.0028314474],"about_ca_topic_score_codex":0.000089545036,"about_ca_topic_score_gemma":0.0000931326,"teacher_disagreement_score":0.95753044,"about_ca_system_score_codex":0.00019374902,"about_ca_system_score_gemma":0.0000639752,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W2963811057","doi":"10.1109/itw.2017.8277937","title":"Lossy transmission of correlated sources over two-way channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"Converse; Additive white Gaussian noise; Lossy compression; Gaussian; Coding (social sciences); Algorithm; Decoding methods; Mathematics; Computer science; Scalar (mathematics); Topology (electrical circuits); White noise; Statistical physics; Telecommunications; Statistics; Physics; Combinatorics; Geometry","score_opus":0.016494004213094163,"score_gpt":0.2775895118761295,"score_spread":0.26109550766303535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963811057","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.8791796,0.00056995754,0.051661417,0.00021433679,0.00015422411,0.00020311272,0.0000047218095,0.0011160667,0.06689659],"genre_scores_gemma":[0.99718285,0.00024142131,0.0021740694,0.000011571826,0.000016227727,0.0000068502145,0.0000036818662,0.000021663302,0.00034165962],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995161,0.000014132949,0.00017981353,0.00007561755,0.000105919025,0.00010839534],"domain_scores_gemma":[0.99909425,0.000029285411,0.000054973345,0.00074440887,0.000034013407,0.00004309176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010233718,0.00009205287,0.0001436355,0.00005485575,0.00009357011,0.000041272215,0.0005035323,0.00008263419,0.00030464437],"category_scores_gemma":[0.0000112773005,0.000084382074,0.000049080747,0.000034160916,0.00006365763,0.00017956393,0.000054456614,0.00013500397,0.000014496828],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009179715,0.0004484619,0.012166814,0.0007740612,0.00042954137,0.000015380401,0.012758198,0.02189518,0.57560563,0.048379045,0.023234423,0.30420145],"study_design_scores_gemma":[0.00066366105,0.00003431143,0.0054343347,0.00021998148,0.000016573875,0.000003554439,0.000045865545,0.23026025,0.73253846,0.0016318854,0.028827682,0.00032343072],"about_ca_topic_score_codex":0.00012231109,"about_ca_topic_score_gemma":0.00000903957,"teacher_disagreement_score":0.30387804,"about_ca_system_score_codex":0.000012582248,"about_ca_system_score_gemma":0.0000040401915,"threshold_uncertainty_score":0.34410012},"labels":[],"label_agreement":null},{"id":"W2964021047","doi":"10.3390/e21080732","title":"The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources","year":2019,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université de Montréal","funders":"Horizon 2020 Framework Programme; Knut och Alice Wallenbergs Stiftelse; Stiftelsen för Strategisk Forskning; Stiftelsen för Strategisk Forskning; European Commission","keywords":"Channel (broadcasting); Key (lock); Binary number; Upper and lower bounds; Scheme (mathematics); Computer science; Transmission (telecommunications); Class (philosophy); Channel capacity; Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Combinatorics; Computer security; Artificial intelligence; Arithmetic; Mathematical analysis","score_opus":0.006972486365565015,"score_gpt":0.19049997450788658,"score_spread":0.18352748814232156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964021047","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.9952382,0.00024731492,0.0021656884,0.00007823969,0.0000705115,0.0001897483,0.000007976848,0.0001764581,0.0018258818],"genre_scores_gemma":[0.9990559,0.00011535472,0.000713501,0.0000071314967,0.000009541497,0.000010548367,0.0000040266646,0.000018025616,0.000065931265],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945706,0.000039462622,0.00018133382,0.000062368315,0.00014352215,0.00011627216],"domain_scores_gemma":[0.99923193,0.00011120477,0.000083193336,0.0004838419,0.000067252215,0.000022585933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120531695,0.00008231248,0.00015706875,0.00003648634,0.00002484729,0.000010088236,0.00030083294,0.00005715195,0.00003360911],"category_scores_gemma":[0.000013703674,0.000058005244,0.00003428546,0.00012858912,0.000086821005,0.000051909545,0.000038249505,0.00016584352,0.000012356278],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037303267,0.00029215138,0.06006794,0.0008087008,0.0010074729,0.0000031460804,0.032349326,0.05888012,0.57746565,0.2612986,0.0049219937,0.002531863],"study_design_scores_gemma":[0.0010746176,0.0003160667,0.0046114037,0.0003219731,0.000039323382,0.0000087725675,0.00078698585,0.15988827,0.79272896,0.0012834367,0.038554553,0.00038562325],"about_ca_topic_score_codex":0.000050534785,"about_ca_topic_score_gemma":0.00001321363,"teacher_disagreement_score":0.26001516,"about_ca_system_score_codex":0.00002099231,"about_ca_system_score_gemma":0.000008582307,"threshold_uncertainty_score":0.23653853},"labels":[],"label_agreement":null},{"id":"W2964193638","doi":"10.1109/tit.2015.2453352","title":"Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Lossy compression; Channel (broadcasting); Characterization (materials science); Computer science; Atomic broadcast; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Combinatorics; Physics; Artificial intelligence; Optics","score_opus":0.02515607787475048,"score_gpt":0.22412970652069783,"score_spread":0.19897362864594736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964193638","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.011903412,0.000026652866,0.981343,0.00045159092,0.00026917722,0.0005626634,0.000017514023,0.0009847503,0.0044412618],"genre_scores_gemma":[0.9978785,0.00002785385,0.000517429,0.0005514319,0.000025634548,0.00037617562,0.000017673023,0.000033363354,0.00057195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917096,0.000071986164,0.00028640465,0.000078094665,0.00020894717,0.00018362381],"domain_scores_gemma":[0.9988953,0.0002677871,0.00008695139,0.00050425914,0.00015456609,0.00009117107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042270916,0.00017965316,0.00012959227,0.00022545451,0.00024979544,0.00014188264,0.00028941556,0.00012264961,0.00003057603],"category_scores_gemma":[0.000014585969,0.00013151286,0.000066676876,0.00023243036,0.00008172775,0.0007255844,0.0000015123233,0.00032216308,0.000101720565],"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.0008243146,0.00011036972,0.0000027609844,0.00008967513,0.00017421466,5.073781e-7,0.025970912,0.87034017,0.00005118248,0.015521022,0.011938154,0.07497669],"study_design_scores_gemma":[0.0031723392,0.0012548367,0.000009664029,0.000539986,0.00012860114,0.0000889705,0.01037602,0.48042887,0.12198391,0.008648968,0.37220627,0.0011615495],"about_ca_topic_score_codex":0.000005246177,"about_ca_topic_score_gemma":0.0000024158899,"teacher_disagreement_score":0.9859751,"about_ca_system_score_codex":0.00010696809,"about_ca_system_score_gemma":0.000035214354,"threshold_uncertainty_score":0.5362939},"labels":[],"label_agreement":null},{"id":"W2964307264","doi":"10.1109/isit.2011.6033717","title":"On the capacity of the K-user cyclic Gaussian interference channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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 Toronto","funders":"","keywords":"Interference (communication); Channel (broadcasting); Gaussian; Topology (electrical circuits); Channel capacity; Dimension (graph theory); Constant (computer programming); Power (physics); Upper and lower bounds; Telecommunications; Computer science; Mathematics; Physics; Combinatorics; Mathematical analysis; Quantum mechanics","score_opus":0.05032718656413263,"score_gpt":0.22002815885244184,"score_spread":0.16970097228830922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964307264","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.7299045,0.00002371043,0.008744852,0.0006082001,0.0001040606,0.00023540425,0.0000043914647,0.0004555853,0.25991932],"genre_scores_gemma":[0.9993228,0.000024048222,0.0003907048,0.00013261147,0.000004801883,0.000023831422,1.911701e-7,0.000010483654,0.00009055419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996368,0.000041586256,0.000117483556,0.00005164308,0.00007049454,0.00008198642],"domain_scores_gemma":[0.9990947,0.00006070346,0.00002505359,0.0007848854,0.00001965133,0.00001501087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010846356,0.000069648624,0.00006778265,0.000023198112,0.000034668046,0.000006087695,0.0006927648,0.00004009682,0.00020820057],"category_scores_gemma":[0.000025410116,0.000036065438,0.000038436723,0.0000956128,0.00007849998,0.000041761094,0.000095700634,0.00018869972,0.00002055916],"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.0000056417816,0.00008009524,0.0004458354,0.000030254445,0.000040119212,1.3685153e-7,0.008883154,0.000044264892,0.009836629,0.9740334,0.0058296258,0.00077081285],"study_design_scores_gemma":[0.00006593471,0.00003392967,0.014129971,0.0001162732,0.0000065010227,0.0000017619097,0.00030086233,0.0040943883,0.950622,0.029333498,0.0011294164,0.00016546871],"about_ca_topic_score_codex":0.000113354836,"about_ca_topic_score_gemma":0.00011408853,"teacher_disagreement_score":0.94469994,"about_ca_system_score_codex":0.000014748241,"about_ca_system_score_gemma":0.000002841887,"threshold_uncertainty_score":0.22796501},"labels":[],"label_agreement":null},{"id":"W2964323994","doi":"10.1109/allerton.2011.6120222","title":"Incremental relaying for the Gaussian interference channel with a degraded broadcasting relay","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Relay; Relay channel; Transmitter; Computer science; Channel (broadcasting); Interference (communication); Broadcasting (networking); Topology (electrical circuits); Transmission (telecommunications); Computer network; Gaussian; Telecommunications; Electronic engineering; Electrical engineering; Engineering; Physics","score_opus":0.0661959174035866,"score_gpt":0.24083869133450045,"score_spread":0.17464277393091385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964323994","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.08372608,0.00040485445,0.8648346,0.00023017911,0.000095119896,0.00088044663,0.000005431097,0.0020176235,0.04780567],"genre_scores_gemma":[0.9509655,0.00004862536,0.048607398,0.00005429096,0.000016605878,0.00021979338,0.0000026321204,0.00003518293,0.000049975417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.000017730375,0.00017505964,0.000112060916,0.00007724589,0.00018971463],"domain_scores_gemma":[0.999351,0.00012721948,0.000035993893,0.00041579813,0.000033827408,0.000036119432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019478508,0.0001253075,0.000101126345,0.00005336947,0.00013260382,0.00003053506,0.00042305127,0.00004877095,0.000043027943],"category_scores_gemma":[0.000022074666,0.0000827678,0.000032303982,0.00012059288,0.00004974005,0.00015309543,0.000084170024,0.00019937799,0.000005612299],"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.0011746222,0.0008907833,0.01792987,0.0014421202,0.0024762515,0.000040177445,0.20043449,0.004456985,0.09731282,0.34331864,0.02163193,0.3088913],"study_design_scores_gemma":[0.0017440094,0.00065833516,0.006948945,0.00087345584,0.00013659694,0.00013362578,0.0117076095,0.56494457,0.40490338,0.002277968,0.0041820407,0.0014894411],"about_ca_topic_score_codex":0.000108225635,"about_ca_topic_score_gemma":0.00012132869,"teacher_disagreement_score":0.8672394,"about_ca_system_score_codex":0.000042771182,"about_ca_system_score_gemma":0.0000074498544,"threshold_uncertainty_score":0.33751732},"labels":[],"label_agreement":null},{"id":"W2967282136","doi":"10.1109/twc.2019.2934462","title":"WFRFT-Aided Power-Efficient Multi-Beam Directional Modulation Schemes Based on Frequency Diverse Array","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":62,"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":"State Key Laboratory of Rail Traffic Control and Safety; Queen's University Belfast; Natural Science Foundation of Beijing Municipality; Beijing Municipal Science and Technology Commission; China Scholarship Council; Queen's University; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Artificial noise; Wireless; Beam (structure); Physical layer; Bit error rate; Modulation (music); Fractional Fourier transform; Transmission (telecommunications); Power (physics); Electronic engineering; Telecommunications; Optics; Channel (broadcasting); Physics; Fourier transform; Acoustics; Engineering","score_opus":0.024767165764690038,"score_gpt":0.2619575081261347,"score_spread":0.23719034236144468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967282136","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.23501383,0.00012715661,0.754355,0.0005451464,0.00060660666,0.0011606333,0.0002080436,0.0025280572,0.005455523],"genre_scores_gemma":[0.97510034,0.0002693157,0.023641713,0.00014755221,0.000013812804,0.00051284593,0.000096644806,0.000109701345,0.00010810198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978566,0.00021991228,0.0006123107,0.0004215756,0.0005077285,0.0003818778],"domain_scores_gemma":[0.995006,0.0005324086,0.00013778056,0.00391855,0.00024889453,0.00015632353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002761893,0.00042604245,0.00036782163,0.0006370983,0.0006110972,0.00008801845,0.0014330772,0.0002736111,0.00036019608],"category_scores_gemma":[0.000011410443,0.00049534254,0.0002663887,0.0008059305,0.00020503168,0.0002867747,0.000012275852,0.0010477643,0.0004927349],"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.000065039705,0.0023476714,0.00034899762,0.00007974051,0.00015431324,8.268332e-7,0.0009255546,0.8989047,0.08242785,0.002874369,0.0001389072,0.011732029],"study_design_scores_gemma":[0.0012170945,0.00012809414,0.0015742003,0.000311675,0.000036775826,0.0000032849316,0.00022817536,0.91012007,0.083910696,0.00007278688,0.0016940192,0.0007031473],"about_ca_topic_score_codex":0.000088104236,"about_ca_topic_score_gemma":0.000116958625,"teacher_disagreement_score":0.7400865,"about_ca_system_score_codex":0.0004946505,"about_ca_system_score_gemma":0.00007749045,"threshold_uncertainty_score":0.99974984},"labels":[],"label_agreement":null},{"id":"W2975077913","doi":"10.1109/isit.2019.8849363","title":"Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Lossy compression; Encoding (memory); Computation; Computer science; Theoretical computer science; Distributed source coding; Coding (social sciences); Linear network coding; Algorithm; Linear code; Mathematics; Block code; Channel code; Computer network; Artificial intelligence","score_opus":0.008102746453451347,"score_gpt":0.23257854314270432,"score_spread":0.22447579668925297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975077913","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.17753187,0.000039948598,0.81284565,0.000044395656,0.00011399453,0.00022446699,0.00003100972,0.0009485157,0.008220144],"genre_scores_gemma":[0.9899231,0.000019634452,0.009213238,0.000038828734,0.000024175912,0.000012670562,0.00074252125,0.00001149495,0.000014311553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999406,0.000048174956,0.0002702979,0.00005191375,0.000115987925,0.00010761687],"domain_scores_gemma":[0.9994108,0.00004182517,0.000055788,0.00033275495,0.00012398738,0.00003482378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023338707,0.000085353735,0.00012376314,0.00006997836,0.000036479913,0.000022777516,0.00016289827,0.00007766265,0.00012917806],"category_scores_gemma":[0.000014184095,0.000086366264,0.000033857737,0.0002788864,0.00002198419,0.0006697761,0.000038927385,0.00011631115,0.000096359734],"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.00003356829,0.00006970895,0.0016330905,0.00017957354,0.00009351104,9.564078e-8,0.0012456328,0.71173155,0.00061878626,0.22055945,0.005321369,0.058513645],"study_design_scores_gemma":[0.00031614563,0.00009801088,0.008986485,0.0000482708,0.000016061755,0.0000020753184,0.00034344767,0.96522504,0.003315416,0.011906221,0.009505968,0.000236832],"about_ca_topic_score_codex":0.000020173973,"about_ca_topic_score_gemma":0.000008139296,"teacher_disagreement_score":0.8123913,"about_ca_system_score_codex":0.000036575162,"about_ca_system_score_gemma":0.000014380333,"threshold_uncertainty_score":0.3521914},"labels":[],"label_agreement":null},{"id":"W2975582433","doi":"10.1109/isit.2019.8849438","title":"Non-Malleable Codes against Active Physical Layer Adversary","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Code word; Computer science; Adversary; Cryptography; Secret sharing; Set (abstract data type); Class (philosophy); Physical layer; Theoretical computer science; Function (biology); Fraction (chemistry); Computer security; Computer network; Decoding methods; Algorithm; Telecommunications; Wireless; Programming language","score_opus":0.008376145003172705,"score_gpt":0.2336653852258009,"score_spread":0.2252892402226282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975582433","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.699865,0.000022583308,0.0011624218,0.00006173118,0.00004299319,0.00016278189,0.0000042499496,0.0008632959,0.29781494],"genre_scores_gemma":[0.99704075,0.00008278765,0.0020401124,0.00011232311,0.000029145911,0.000024523826,0.000013183133,0.000029996201,0.000627177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952877,0.000010937639,0.0000912483,0.00010871809,0.00010555557,0.00015478175],"domain_scores_gemma":[0.99937195,0.0000613885,0.000014129342,0.0004800671,0.000032160166,0.000040327155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040134746,0.000110296816,0.00015369603,0.000047960744,0.000022648952,0.000017030276,0.00026964545,0.000059164868,0.00014613062],"category_scores_gemma":[0.0000035601324,0.00010738755,0.000052056115,0.000100030404,0.000019177878,0.00022849417,0.00008744311,0.0001928998,0.0006901655],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006365482,0.0006071361,0.0035052144,0.00036384736,0.00047030667,0.0000102405,0.008384397,0.036280975,0.8050575,0.026605299,0.06849978,0.050151605],"study_design_scores_gemma":[0.00044136657,0.00004956237,0.0024245875,0.00006914017,0.000009516956,0.0000013599544,0.00066637533,0.35569346,0.5937315,0.0007217231,0.04566705,0.00052436907],"about_ca_topic_score_codex":0.000016689479,"about_ca_topic_score_gemma":0.000008222083,"teacher_disagreement_score":0.31941247,"about_ca_system_score_codex":0.000055040597,"about_ca_system_score_gemma":0.0000090230515,"threshold_uncertainty_score":0.88709116},"labels":[],"label_agreement":null},{"id":"W2975595616","doi":"10.1109/isit.2019.8849858","title":"New Sum-Rate Capacity Results for Multi-User Interference Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Interference (communication); Gaussian; Computer science; Wireless; Wireless network; Channel capacity; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.05964104810829891,"score_gpt":0.28213602546776845,"score_spread":0.22249497735946955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975595616","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.13837743,0.000077548015,0.8440099,0.00039496,0.00046466026,0.00090911513,0.000047973073,0.0023346462,0.013383803],"genre_scores_gemma":[0.8984014,0.000047022455,0.095074885,0.00007143704,0.000031005795,0.000039919058,0.000016438027,0.000026576778,0.006291369],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993764,0.000020245685,0.00022125304,0.00014862708,0.000052493633,0.0001809364],"domain_scores_gemma":[0.9991265,0.00010045388,0.000028257635,0.00061511993,0.00006476017,0.000064907996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019669154,0.0001228796,0.00014833052,0.00006200411,0.000020990168,0.000043334625,0.00039998518,0.00009090498,0.00007013479],"category_scores_gemma":[0.000046328194,0.00011998227,0.000046485653,0.000085547406,0.000011767493,0.00018532689,0.000072620845,0.00014485455,0.00016336312],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038050453,0.00029106712,0.0015055351,0.0009369442,0.00035426285,0.0000017442089,0.0150610125,0.00987929,0.28286746,0.23040265,0.42119706,0.03712246],"study_design_scores_gemma":[0.0018546698,0.00010874733,0.00079815276,0.00015502343,0.000008859174,0.0000018218489,0.00012436468,0.25236285,0.5665671,0.0013343723,0.17606722,0.0006168266],"about_ca_topic_score_codex":0.00013869419,"about_ca_topic_score_gemma":0.0001452985,"teacher_disagreement_score":0.76002395,"about_ca_system_score_codex":0.000042035103,"about_ca_system_score_gemma":0.000010912413,"threshold_uncertainty_score":0.48927352},"labels":[],"label_agreement":null},{"id":"W2976384503","doi":"10.1109/isit.2019.8849454","title":"On the Capacity of Gaussian Multiple-Access Interference Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Interference (communication); Computer science; Channel capacity; Adjacent-channel interference; Gaussian; Electronic engineering; Channel (broadcasting); Telecommunications; Physics; Engineering","score_opus":0.04087216352682525,"score_gpt":0.25955447429965667,"score_spread":0.2186823107728314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976384503","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.94628567,0.000012487132,0.009667349,0.00027999078,0.00009643705,0.00022028858,0.0000041451535,0.00035184404,0.043081775],"genre_scores_gemma":[0.9994005,0.00002343533,0.00039107833,0.00007563392,0.000005823696,0.000022339487,0.000001276436,0.000011585321,0.00006832472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960655,0.000027602238,0.0001320004,0.000066805085,0.00007873319,0.00008832342],"domain_scores_gemma":[0.9991085,0.00020918624,0.000025112675,0.000611442,0.000027836575,0.000017954657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010729699,0.00007486609,0.00010041868,0.00004460851,0.000014866047,0.00002394136,0.0006420346,0.00004083626,0.00037471362],"category_scores_gemma":[0.000030812454,0.000051086456,0.00002886862,0.00009553015,0.00003231618,0.00010276438,0.0000980521,0.00015413685,0.000058405374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036406847,0.00020560919,0.010496718,0.0003932864,0.00013350483,5.8107236e-7,0.0053453133,0.0088992,0.1401024,0.8183848,0.010149526,0.005852595],"study_design_scores_gemma":[0.00015522413,0.000058273185,0.0033904037,0.00017467207,0.0000027810433,0.0000010327728,0.00013400771,0.13386947,0.85538644,0.0052089742,0.0013979534,0.00022075674],"about_ca_topic_score_codex":0.000075160315,"about_ca_topic_score_gemma":0.00003325664,"teacher_disagreement_score":0.81317586,"about_ca_system_score_codex":0.000018371114,"about_ca_system_score_gemma":0.0000029361997,"threshold_uncertainty_score":0.41028515},"labels":[],"label_agreement":null},{"id":"W2976956053","doi":"10.1109/isit.2019.8849577","title":"Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Lossy compression; Channel code; Lossless compression; Coding (social sciences); Computer science; Variable-length code; Tunstall coding; Algorithm; Channel (broadcasting); Decoding methods; Source code; Theoretical computer science; Context-adaptive binary arithmetic coding; Shannon–Fano coding; Adaptive coding; Context-adaptive variable-length coding; Mathematics; Coding tree unit; Telecommunications; Data compression; Statistics; Artificial intelligence","score_opus":0.02007848606354787,"score_gpt":0.24832113896398486,"score_spread":0.228242652900437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976956053","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.27409914,0.0008724602,0.71933746,0.00028666185,0.0002231638,0.0009294171,0.0000069925845,0.00089509884,0.0033495743],"genre_scores_gemma":[0.9977405,0.00023484074,0.0012961873,0.00004854588,0.000025177767,0.000048865408,0.000007459975,0.00004411547,0.00055427913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.000023965857,0.0002969256,0.000113160786,0.00013833298,0.00018063218],"domain_scores_gemma":[0.9991085,0.00029004028,0.000058894835,0.00044698193,0.000057381632,0.00003818745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028801677,0.00013698681,0.0002114559,0.00008443832,0.00006518896,0.000024757655,0.00031731362,0.000094396324,0.00022394204],"category_scores_gemma":[0.000012728305,0.0000988867,0.00011770115,0.00012910644,0.000034131743,0.00009504214,0.000047088382,0.00017407876,0.000013258194],"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.00011396062,0.0001705065,0.00030765322,0.0009505223,0.00044873447,4.77639e-7,0.029171085,0.48426798,0.41406527,0.018484779,0.011248899,0.040770136],"study_design_scores_gemma":[0.0004321128,0.00003487812,0.00008136709,0.00011990971,0.000016326556,0.0000015892581,0.0004284962,0.7947279,0.19071238,0.0004277217,0.012866483,0.00015079777],"about_ca_topic_score_codex":0.00004782059,"about_ca_topic_score_gemma":0.0000032203423,"teacher_disagreement_score":0.7236414,"about_ca_system_score_codex":0.000024418357,"about_ca_system_score_gemma":0.0000059351323,"threshold_uncertainty_score":0.40324828},"labels":[],"label_agreement":null},{"id":"W2980322243","doi":"10.1109/tvt.2019.2947375","title":"Ergodic Secrecy Rate of $K$-User MISO Broadcast Channel With Improved Random Beamforming","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Beamforming; Secrecy; Noma; Transmitter; Artificial noise; Computer science; Ergodic theory; Topology (electrical circuits); Channel (broadcasting); Fading; Computer network; Signal-to-noise ratio (imaging); Telecommunications; Mathematics; Telecommunications link; Computer security","score_opus":0.004578005143059563,"score_gpt":0.1948110092680085,"score_spread":0.19023300412494895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980322243","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.47049356,0.00018404207,0.52707285,0.00017221048,0.00010491631,0.00050227204,0.00001332719,0.0012728935,0.00018395358],"genre_scores_gemma":[0.99470824,0.00037736722,0.004471654,0.000036296184,0.000006800569,0.0002048981,0.0000054602797,0.000077164266,0.00011209386],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889755,0.00004171785,0.0003645754,0.00026068374,0.00012197015,0.00031348554],"domain_scores_gemma":[0.9986538,0.000071612594,0.000085639214,0.0010269367,0.00011242919,0.000049566257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017403769,0.0002656213,0.0004325212,0.00065160915,0.00007880178,0.000013868686,0.00047590263,0.00040319888,0.00005702082],"category_scores_gemma":[0.0000039196234,0.00025446256,0.00011447076,0.0006940491,0.00014966793,0.00016157492,0.0000045880115,0.0006935073,0.00004211387],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003047351,0.00030237614,0.00003928311,0.00030863183,0.0004886664,0.000009788036,0.0004846225,0.11497639,0.8542842,0.0011423519,0.00004021034,0.02761869],"study_design_scores_gemma":[0.002039028,0.00029768414,0.000013190408,0.00017064523,0.000055088698,0.00004527805,0.00020873707,0.051023692,0.9427506,0.00027271055,0.0027755902,0.0003477672],"about_ca_topic_score_codex":0.00003083835,"about_ca_topic_score_gemma":0.000039961407,"teacher_disagreement_score":0.52421474,"about_ca_system_score_codex":0.000078332836,"about_ca_system_score_gemma":0.000028304585,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W2982493600","doi":"10.1109/wcnc.2019.8886042","title":"Secrecy Analysis of a TAS/MRC Scheme in $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland; Concordia University","funders":"","keywords":"Secrecy; Fading; Maximal-ratio combining; MIMO; Antenna (radio); Computer science; Outage probability; Monte Carlo method; Electronic engineering; Computer network; Diversity gain; Topology (electrical circuits); Telecommunications; Statistics; Mathematics; Channel (broadcasting); Engineering; Computer security; Electrical engineering","score_opus":0.011046835713520341,"score_gpt":0.24333198086864077,"score_spread":0.23228514515512044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982493600","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.9687984,0.00020177884,0.012936288,0.000041938896,0.000038494087,0.00015806282,0.0000047436915,0.00040049077,0.01741979],"genre_scores_gemma":[0.9937784,0.00010087515,0.00591542,0.000024306688,0.000006076799,0.000018341487,0.000017565186,0.000018522005,0.00012047814],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992727,0.000025925983,0.00030167273,0.00011658958,0.00012692173,0.00015620994],"domain_scores_gemma":[0.99924004,0.00006987743,0.000038408114,0.0005793867,0.000040235587,0.00003207406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022755637,0.00010311297,0.00031960523,0.00069582305,0.000008695014,0.000014550238,0.000322744,0.00008300559,0.0005228978],"category_scores_gemma":[0.000015722506,0.00011053815,0.00009467481,0.0012636208,0.000013919039,0.00015241685,0.00008149125,0.00015427466,0.000032701173],"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.000026240567,0.0003433959,0.3671863,0.00061902043,0.003003251,0.0000068059367,0.010522822,0.1971171,0.27723745,0.13187404,0.0010857196,0.010977836],"study_design_scores_gemma":[0.0002582747,0.000019163155,0.013110639,0.000072154544,0.00006220309,6.2320873e-7,0.00024770093,0.91408825,0.0698936,0.00067899073,0.001278104,0.00029028574],"about_ca_topic_score_codex":0.0001482609,"about_ca_topic_score_gemma":0.00011728475,"teacher_disagreement_score":0.71697116,"about_ca_system_score_codex":0.000057738063,"about_ca_system_score_gemma":0.0000066929238,"threshold_uncertainty_score":0.57253647},"labels":[],"label_agreement":null},{"id":"W2987936195","doi":"10.1109/vtcfall.2019.8891253","title":"Secure DoF for the MIMO MAC: The Case of Knowing Eavesdropper's Channel Statistics Only","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Channel state information; Computer science; Physical layer; MIMO; Jamming; Computer network; Channel (broadcasting); Fading; Encryption; Gaussian; Secure communication; Computer security; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.013607255383364025,"score_gpt":0.25673497880531304,"score_spread":0.24312772342194902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987936195","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.22645934,0.004522768,0.7371123,0.0029439442,0.00074592564,0.0040820614,0.0008188678,0.0014084406,0.021906372],"genre_scores_gemma":[0.9894448,0.00018159716,0.009825434,0.00009712832,0.00003002752,0.00005363178,0.000010175534,0.000033904824,0.00032329647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994434,0.00002907676,0.00021281079,0.000083915496,0.00007834749,0.00015244783],"domain_scores_gemma":[0.9984095,0.0006743778,0.000040910665,0.0007638789,0.00008847929,0.000022862143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025459574,0.00011034721,0.00013478083,0.00003400238,0.00008223583,0.000027167598,0.00043010068,0.00006002708,0.00008229167],"category_scores_gemma":[0.000026909524,0.00006684742,0.0000548985,0.00009952587,0.000047203568,0.000046731537,0.0000892139,0.00017451192,0.000013483106],"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.00004062896,0.00012727747,0.0003083666,0.0010147983,0.00053886045,0.000031203646,0.014699328,0.020638037,0.005152274,0.77835894,0.08535243,0.09373784],"study_design_scores_gemma":[0.00039005163,0.00007417226,0.00011359023,0.00006715704,0.000054576638,0.00016664962,0.003341654,0.92529416,0.014766282,0.004835053,0.050607655,0.00028897266],"about_ca_topic_score_codex":0.00015257957,"about_ca_topic_score_gemma":0.00041214522,"teacher_disagreement_score":0.9046562,"about_ca_system_score_codex":0.000023967832,"about_ca_system_score_gemma":0.000017430639,"threshold_uncertainty_score":0.27259585},"labels":[],"label_agreement":null},{"id":"W2990309384","doi":"","title":"Secrecy Analysis of a TAS/MRC Scheme in α-μ Fading Channels.","year":2019,"lang":"en","type":"article","venue":"Wireless Communications and Networking Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Secrecy; Computer science; Fading distribution; Scheme (mathematics); Maximal-ratio combining; Telecommunications; Computer network; Electronic engineering; Mathematics; Computer security; Channel (broadcasting); Engineering; Rayleigh fading","score_opus":0.029293635360560673,"score_gpt":0.2615811920801954,"score_spread":0.23228755671963475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990309384","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.9785379,0.0046334947,0.00830501,0.0001374176,0.00007891532,0.00029561593,0.000009722639,0.00027932375,0.007722612],"genre_scores_gemma":[0.98495,0.011570546,0.003287113,0.000020130887,0.000010315739,0.000057223275,0.000063599655,0.000021986421,0.000019081544],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989291,0.00009596099,0.00045108894,0.00017938305,0.00012246045,0.00022200924],"domain_scores_gemma":[0.99775565,0.0002463445,0.00011513989,0.0017363286,0.00009595281,0.00005058364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035930777,0.00016418664,0.00045847587,0.0005001612,0.000069888316,0.00005675184,0.0009924893,0.00011889364,0.00003741001],"category_scores_gemma":[0.000004382123,0.00019081311,0.00006984897,0.0013995973,0.00012745739,0.00015545775,0.00041829643,0.00036878325,0.0000035574226],"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.00002480438,0.00028572744,0.4667121,0.00034640054,0.0013383162,0.0000016452427,0.012007604,0.012641697,0.015858898,0.28208297,0.000061976156,0.20863785],"study_design_scores_gemma":[0.00016538631,0.00001414742,0.00723988,0.00028057626,0.000055443146,8.5699736e-7,0.0002077839,0.98837227,0.0002751785,0.00069950934,0.0024663361,0.00022265453],"about_ca_topic_score_codex":0.00016430918,"about_ca_topic_score_gemma":0.0005664893,"teacher_disagreement_score":0.97573054,"about_ca_system_score_codex":0.000046260608,"about_ca_system_score_gemma":0.000022041057,"threshold_uncertainty_score":0.77811325},"labels":[],"label_agreement":null},{"id":"W2990463783","doi":"10.11648/j.jeee.20190706.11","title":"Invited Paper: Raptor Code and Massive MiMo for Secure Wireless Delivery in 5G","year":2019,"lang":"en","type":"article","venue":"Journal of Electrical and Electronic Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Eavesdropping; Computer science; MIMO; Physical layer; Artificial noise; Computer network; Fountain code; Secrecy; Transmission (telecommunications); Code (set theory); Wireless; Secure transmission; Channel (broadcasting); Computer security; Telecommunications; Decoding methods; Block code; Concatenated error correction code","score_opus":0.003685328197507719,"score_gpt":0.19372844001002806,"score_spread":0.19004311181252034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990463783","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.98054653,0.012245951,0.006327732,0.00049459934,0.0000506621,0.0002242694,0.0000027717729,0.00008539659,0.000022084703],"genre_scores_gemma":[0.99209136,0.0065914374,0.0011038284,0.00009967642,0.000053908112,0.00001486439,0.0000021857575,0.00003735805,0.0000053852777],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989461,0.000019187848,0.0003891682,0.00011749602,0.00012380023,0.00040428445],"domain_scores_gemma":[0.9993978,0.000246266,0.00007332519,0.0001247988,0.00006583637,0.00009195269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025900805,0.0001731237,0.00035905375,0.0003003759,0.000021688304,0.00003232951,0.00014600989,0.00014016755,0.0000036599522],"category_scores_gemma":[0.000037532398,0.0001678893,0.00006329791,0.0002671919,0.000012241705,0.00024809607,0.000021450713,0.0006730122,3.6697324e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039066916,0.00018056636,0.0029248719,0.0008971251,0.0005213178,0.000032475138,0.0010067079,0.03233036,0.8896869,0.016480885,0.0027885016,0.052759636],"study_design_scores_gemma":[0.003204353,0.0011503262,0.0034250047,0.0004062798,0.00006852167,0.00029824208,0.000057693214,0.89965874,0.050140537,0.0015584544,0.03924132,0.0007905331],"about_ca_topic_score_codex":0.000004219153,"about_ca_topic_score_gemma":0.000010909005,"teacher_disagreement_score":0.86732835,"about_ca_system_score_codex":0.00018409014,"about_ca_system_score_gemma":0.000026120057,"threshold_uncertainty_score":0.6846327},"labels":[],"label_agreement":null},{"id":"W2992225407","doi":"10.1063/1.5126723","title":"A minimax approach to one-shot entropy inequalities","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Perimeter Institute; University of Waterloo","funders":"Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Mathematical proof; Minimax; Information theory; Entropy (arrow of time); Quantum; Simple (philosophy); Quantum relative entropy; Smoothing","score_opus":0.06831374393054442,"score_gpt":0.28574156391851163,"score_spread":0.21742781998796723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992225407","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.39470738,0.00013153428,0.53703046,0.00021945185,0.000094817486,0.00032150082,0.0000060550155,0.00020066842,0.067288145],"genre_scores_gemma":[0.8955591,0.000021743419,0.10415957,0.000077181416,0.000106850086,0.000006025777,0.0000010177926,0.000028068227,0.000040487583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989762,0.000035129146,0.00045682988,0.00005617244,0.00033029658,0.00014541911],"domain_scores_gemma":[0.9991736,0.00016488117,0.00010118504,0.00035222975,0.00011234514,0.000095764386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027178848,0.000113539456,0.00036065053,0.000061486,0.000013361826,0.000040000803,0.00038649776,0.000050594444,0.000045713034],"category_scores_gemma":[0.000050439045,0.00010079179,0.000110783476,0.00013599155,0.00002116066,0.0001843523,0.00006150098,0.0002738058,0.00011775245],"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.000030868574,0.0008948636,0.00006966903,0.0011509474,0.0001977303,0.0000018423099,0.006207634,0.0033377162,0.029159784,0.9510333,0.0052734683,0.0026421663],"study_design_scores_gemma":[0.0009785509,0.000410911,0.00018467805,0.0009043009,0.00009578527,0.000069765774,0.0012100982,0.058212373,0.074425265,0.8570643,0.005692138,0.0007518151],"about_ca_topic_score_codex":2.8664596e-7,"about_ca_topic_score_gemma":2.4657083e-8,"teacher_disagreement_score":0.5008517,"about_ca_system_score_codex":0.000057935427,"about_ca_system_score_gemma":0.000014822777,"threshold_uncertainty_score":0.411017},"labels":[],"label_agreement":null},{"id":"W2995242809","doi":"10.1109/cwit.2019.8929922","title":"Lattice-based Robust Distributed Source Coding for Three Correlated Sources","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Gaussian; Rate distortion; Degenerate energy levels; Lattice (music); Distributed source coding; Computer science; Coding (social sciences); Quadratic equation; Algorithm; Statistical physics; Decoding methods; Theoretical computer science; Topology (electrical circuits); Mathematics; Physics; Channel code; Statistics; Combinatorics; Quantum mechanics; Geometry","score_opus":0.019800371923941948,"score_gpt":0.2221609183555821,"score_spread":0.20236054643164014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995242809","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.18511869,0.00011208501,0.80936885,0.00017240836,0.000086066146,0.0005260257,0.000032488595,0.002509909,0.0020734833],"genre_scores_gemma":[0.9860652,0.00000850284,0.013371604,0.00006292314,0.00001811383,0.000070416514,0.00018275686,0.000054167907,0.00016629616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992433,0.000016359298,0.00023711733,0.00014714082,0.000115973475,0.00024010868],"domain_scores_gemma":[0.9989476,0.00032568356,0.00004364549,0.0005493632,0.00007779035,0.00005590588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001663815,0.00015564,0.00019512475,0.000079986814,0.00006825289,0.000061934705,0.00036641973,0.00013794772,0.00019640406],"category_scores_gemma":[0.00003428007,0.00015828201,0.00007830075,0.00018623307,0.000027648348,0.000109782646,0.00004818215,0.00018938183,0.00008252334],"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.00006895829,0.00013379488,0.025057722,0.00054771814,0.00019529607,0.000001029745,0.0004430129,0.91799885,0.0120186675,0.020173762,0.01409804,0.009263163],"study_design_scores_gemma":[0.0004923309,0.000027766653,0.0007407231,0.00005866635,0.00001524171,8.561139e-7,0.000052691154,0.9641172,0.012271766,0.00019620548,0.02178902,0.00023750654],"about_ca_topic_score_codex":0.000023712844,"about_ca_topic_score_gemma":0.000050987932,"teacher_disagreement_score":0.80094653,"about_ca_system_score_codex":0.00006924337,"about_ca_system_score_gemma":0.0000130030385,"threshold_uncertainty_score":0.6454553},"labels":[],"label_agreement":null},{"id":"W2995308193","doi":"10.1109/cwit.2019.8929923","title":"Scalar Quantizer Design for Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Algorithm; Multiplicative function; Binary number; Gaussian; Computer science; Quantization (signal processing); Duplex (building); Mathematics; Electronic engineering; Engineering; Physics; Mathematical analysis; Arithmetic","score_opus":0.031816764314876074,"score_gpt":0.2710969611505302,"score_spread":0.23928019683565416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995308193","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.036696386,0.00019627805,0.9476527,0.00017251742,0.00020006372,0.00078788487,0.0000031057323,0.001783542,0.012507501],"genre_scores_gemma":[0.9198072,0.0000325043,0.0793733,0.000076672,0.000026773714,0.0001128613,0.000005696152,0.000036372883,0.0005286423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995148,0.000019759635,0.00013615961,0.00009829541,0.00007119471,0.00015978554],"domain_scores_gemma":[0.99929166,0.0001359933,0.000013423393,0.00048384792,0.000041953957,0.000033151337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022298156,0.00009271537,0.00012633104,0.00006087844,0.000022183793,0.000030596086,0.00026747654,0.0000583264,0.00018815731],"category_scores_gemma":[0.000011801509,0.00009061228,0.000047105,0.000079276586,0.000010504303,0.00011803596,0.000033439275,0.00007668631,0.00024074712],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058870577,0.00016737447,0.00052527955,0.0004887826,0.0002223353,0.0000013629704,0.0016537645,0.1003567,0.3549837,0.39555854,0.11856477,0.027418543],"study_design_scores_gemma":[0.00045280586,0.000050265524,0.00004691614,0.000031413536,0.000005997971,0.0000018790097,0.000039149152,0.4868292,0.4690399,0.00346794,0.039750494,0.00028405138],"about_ca_topic_score_codex":0.000006783786,"about_ca_topic_score_gemma":0.0000019506367,"teacher_disagreement_score":0.88311076,"about_ca_system_score_codex":0.000023866802,"about_ca_system_score_gemma":0.0000046610485,"threshold_uncertainty_score":0.36950615},"labels":[],"label_agreement":null},{"id":"W2997506252","doi":"10.48550/arxiv.2001.01159","title":"The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Mathematics; Exponent; Zero (linguistics); Function (biology); Binary number; Binary symmetric channel; Applied mathematics; Combinatorics; Statistics; Coding (social sciences); Mathematical analysis; Channel capacity; Arithmetic","score_opus":0.07651575857988922,"score_gpt":0.19934147361597343,"score_spread":0.12282571503608421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997506252","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.95943695,0.0011500564,0.030229747,0.0024667121,0.0006645706,0.0010418806,0.000059995025,0.0018441333,0.0031059785],"genre_scores_gemma":[0.9941462,0.0040772995,0.00021055533,0.00020138288,0.00007679155,0.000014336542,0.000064122876,0.000089677415,0.0011195904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803746,0.00048356585,0.00034176445,0.00057768484,0.0001340058,0.00042551087],"domain_scores_gemma":[0.9969778,0.00038798642,0.00020590198,0.0021712023,0.00010000375,0.00015710783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041005443,0.0004785397,0.00040243543,0.00009865696,0.0006731191,0.00021087707,0.0026702392,0.000316639,0.00006209907],"category_scores_gemma":[0.000057913643,0.00039230275,0.00032544325,0.00035370022,0.00033431101,0.00014220925,0.002729016,0.0011643793,0.00019879534],"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.000393321,0.0001558669,0.0009653054,0.00045586933,0.0018729044,0.00024536048,0.0029183493,0.7220908,0.009585854,0.22339159,0.036920473,0.0010043259],"study_design_scores_gemma":[0.0012677871,0.00006961946,0.0034945584,0.0002390158,0.00042607024,0.00001182635,0.0004808532,0.79103196,0.0073664417,0.08001122,0.11377543,0.0018252372],"about_ca_topic_score_codex":0.00012839299,"about_ca_topic_score_gemma":0.00029173683,"teacher_disagreement_score":0.14338036,"about_ca_system_score_codex":0.0005330231,"about_ca_system_score_gemma":0.00007386454,"threshold_uncertainty_score":0.9998529},"labels":[],"label_agreement":null},{"id":"W2998901236","doi":"10.1109/lcomm.2020.2965535","title":"Comments on “AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels”","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","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 Ottawa","funders":"","keywords":"Precoding; Secrecy; MIMO; Artificial noise; Computer science; Channel (broadcasting); Cognitive radio; Maximization; Algorithm; Wireless; Transmitter; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Mathematical optimization; Combinatorics; Computer security","score_opus":0.10336969794502628,"score_gpt":0.3277937017716794,"score_spread":0.22442400382665312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998901236","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.75001615,0.00093869143,0.15948614,0.07633235,0.0004983333,0.004194055,0.00034150993,0.0032627913,0.004929955],"genre_scores_gemma":[0.9818134,0.00041828112,0.008852123,0.0076895957,0.00006227561,0.0008228366,0.00026293387,0.000073994874,0.0000046124383],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986886,0.00021679405,0.00043313633,0.00023263152,0.00013610315,0.00029273797],"domain_scores_gemma":[0.9976041,0.0006568938,0.00008271594,0.0014598253,0.00007270751,0.00012377424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025028695,0.00023033915,0.00026843455,0.00019984815,0.00018734863,0.00008480676,0.0016306799,0.000100587335,0.000014401169],"category_scores_gemma":[0.0001002018,0.00029156313,0.00008076864,0.00036651074,0.000102299164,0.00034161058,0.00017189725,0.0005464466,0.00003172064],"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.00074227387,0.0032656873,0.005254185,0.0011264551,0.0011200762,0.000018179944,0.12419288,0.073837064,0.43730524,0.0129613085,0.13582265,0.20435402],"study_design_scores_gemma":[0.005362456,0.00052034936,0.00127272,0.0013769403,0.00010993307,0.000008338655,0.0027682942,0.76345867,0.12582326,0.0010443759,0.09598229,0.0022723884],"about_ca_topic_score_codex":0.000037215395,"about_ca_topic_score_gemma":0.000060473954,"teacher_disagreement_score":0.68962157,"about_ca_system_score_codex":0.00014534242,"about_ca_system_score_gemma":0.0000131024735,"threshold_uncertainty_score":0.9999536},"labels":[],"label_agreement":null},{"id":"W2999016727","doi":"10.1186/s13638-019-1634-7","title":"Efficient physical layer key generation technique in wireless communications","year":2020,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"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":"National Natural Science Foundation of China","keywords":"Key generation; Computer science; Randomness; Key (lock); Physical layer; Wireless; RSS; Transmitter; Bit error rate; Computer network; Algorithm; Telecommunications; Cryptography; Computer security; Channel (broadcasting); Mathematics","score_opus":0.06178977430987615,"score_gpt":0.29272182121044715,"score_spread":0.230932046900571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999016727","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.91271204,0.00934669,0.052719746,0.013492671,0.00029082072,0.0014348836,0.000024455045,0.0013434236,0.008635299],"genre_scores_gemma":[0.9744058,0.017910331,0.006639833,0.00040762423,0.00032217577,0.00018151557,0.000041821266,0.00008686241,0.00000402848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781597,0.00049539853,0.0007496842,0.00025723848,0.00029672295,0.00038498378],"domain_scores_gemma":[0.99683934,0.00045050477,0.00022595265,0.002091325,0.00014776348,0.00024510486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060854095,0.0003388442,0.00045223118,0.00025623775,0.0006916338,0.00025027496,0.0021041085,0.00016319942,0.000006157501],"category_scores_gemma":[0.000017757264,0.0003587611,0.00010612998,0.000818388,0.000282894,0.00017685896,0.0006971378,0.0019093934,0.0000132530895],"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.00015679446,0.0029889531,0.007762015,0.0002577125,0.00042778795,0.00005435552,0.025612345,0.05416414,0.25825387,0.13595329,0.003941658,0.51042706],"study_design_scores_gemma":[0.0004147574,0.00012112477,0.00029256564,0.00032952635,0.00001853543,0.00004959296,0.00015108997,0.9777875,0.0028212701,0.00037296815,0.01721499,0.00042611393],"about_ca_topic_score_codex":0.000009374688,"about_ca_topic_score_gemma":0.000048784543,"teacher_disagreement_score":0.9236233,"about_ca_system_score_codex":0.00018099998,"about_ca_system_score_gemma":0.000039388797,"threshold_uncertainty_score":0.99988645},"labels":[],"label_agreement":null},{"id":"W2999286278","doi":"10.3390/s20020438","title":"Defending Against Randomly Located Eavesdroppers by Establishing a Protecting Region","year":2020,"lang":"en","type":"article","venue":"Sensors","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Eavesdropping; Jamming; Computer network; Computer science; Transmission (telecommunications); Artificial noise; Wireless sensor network; Secrecy; Beamforming; Wireless; Computer security; Wireless network; Channel (broadcasting); Transmitter; Telecommunications","score_opus":0.020042669053734103,"score_gpt":0.20942603928269068,"score_spread":0.18938337022895657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999286278","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.9699131,0.0004394429,0.01567126,0.0016317192,0.000075423406,0.00059431733,0.000005495107,0.0041458555,0.0075233895],"genre_scores_gemma":[0.99789596,0.0001738374,0.0015039536,0.00022912178,0.00005178199,0.000031555366,0.000020212776,0.00007356191,0.000020031406],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896824,0.00011493195,0.0002771541,0.0002046407,0.0001620851,0.00027292894],"domain_scores_gemma":[0.9993401,0.00012245549,0.00006135497,0.00031071345,0.000042488886,0.00012284056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019193624,0.0001813195,0.0002170636,0.00008031494,0.00014366122,0.00011083993,0.00030366512,0.00011322683,0.000005138635],"category_scores_gemma":[0.00034384982,0.00020491105,0.000065194174,0.0004329071,0.000037118203,0.00022074263,0.00006675008,0.00057289563,0.000020583175],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018868635,0.00006226372,0.0010132662,0.000782696,0.0002674016,0.00010616445,0.036029946,0.11764635,0.7431095,0.0005630128,0.051876802,0.048353896],"study_design_scores_gemma":[0.0016436034,0.00005437123,0.000035385354,0.0003248969,0.000026021286,0.00002271046,0.0033569944,0.6550765,0.28264606,0.00007139096,0.05582039,0.0009216387],"about_ca_topic_score_codex":0.0000297128,"about_ca_topic_score_gemma":0.000004056734,"teacher_disagreement_score":0.53743017,"about_ca_system_score_codex":0.000089747846,"about_ca_system_score_gemma":0.0000091201555,"threshold_uncertainty_score":0.835603},"labels":[],"label_agreement":null},{"id":"W3000406194","doi":"10.1109/tvt.2020.2965959","title":"Deep Artificial Noise: Deep Learning-Based Precoding Optimization for Artificial Noise Scheme","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Artificial noise; Zero-forcing precoding; Scheme (mathematics); Channel (broadcasting); Deep learning; Noise (video); Computer science; Artificial neural network; Wireless; Artificial intelligence; Algorithm; MIMO; Electronic engineering; Mathematics; Telecommunications; Engineering; Transmitter","score_opus":0.020868967831511823,"score_gpt":0.24262632594441613,"score_spread":0.2217573581129043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000406194","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.021070054,0.00013800102,0.97071385,0.0024670437,0.00017677539,0.0007421432,0.0000142809995,0.004631077,0.000046753736],"genre_scores_gemma":[0.92179734,0.00007184963,0.07717977,0.00013814804,0.000056521214,0.000611321,0.00003538198,0.00010601041,0.0000036394092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845433,0.000056522167,0.00050408614,0.00040312245,0.0001917393,0.00039020393],"domain_scores_gemma":[0.9990132,0.00010700212,0.00009311536,0.000520999,0.00016328793,0.000102382335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014241372,0.00030340708,0.00034271157,0.00049448706,0.0003369734,0.00006028071,0.00046746037,0.00059028366,0.00010537674],"category_scores_gemma":[0.000057888497,0.00037886863,0.00018503726,0.0008773298,0.00013390138,0.00015698229,0.0000046790815,0.00089922256,0.000048423593],"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.000050972132,0.00009587463,0.0000046796695,0.00006618582,0.000051138668,0.000002357732,0.00013909611,0.926612,0.043818988,0.0004345327,0.000019044302,0.02870511],"study_design_scores_gemma":[0.0002029691,0.00013565831,0.0000010375164,0.000021509328,0.000036180827,0.0000023144084,0.00008291642,0.6719194,0.32612962,0.0001792755,0.0010456308,0.00024349602],"about_ca_topic_score_codex":0.000003084432,"about_ca_topic_score_gemma":0.000033700973,"teacher_disagreement_score":0.90072733,"about_ca_system_score_codex":0.00017009904,"about_ca_system_score_gemma":0.000033284377,"threshold_uncertainty_score":0.9998663},"labels":[],"label_agreement":null},{"id":"W3000465536","doi":"10.1109/tit.2020.2967048","title":"On the Commitment Capacity of Unfair Noisy Channels","year":2020,"lang":"","type":"article","venue":"University of Washington Tacoma Digital Commons (University of Washington Tacoma)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Channel (broadcasting); Cryptography; Binary symmetric channel; Binary number; Adversary; Cryptographic primitive; Channel capacity; Computer security; Point (geometry); Theoretical computer science; Noise (video); Cryptographic protocol; Computer network; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.02639158041173163,"score_gpt":0.18965010394208096,"score_spread":0.16325852353034934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000465536","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.9489446,0.00026513418,0.008057766,0.012708094,0.00025173265,0.0016587889,0.0022111756,0.00061355194,0.025289109],"genre_scores_gemma":[0.996756,0.00040684282,0.0020986726,0.00014879197,0.00004122516,3.9872134e-7,0.00015863446,0.000107565334,0.00028183966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951282,0.00065392355,0.0009673628,0.00091875956,0.0014401865,0.0008915576],"domain_scores_gemma":[0.99251074,0.0017852278,0.0017751791,0.002562473,0.0007103728,0.0006559942],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00074477884,0.0009950672,0.0019448578,0.0007421212,0.0010172089,0.00017449918,0.0067481776,0.00071516563,0.00047891485],"category_scores_gemma":[0.00030330397,0.0012740162,0.0012665322,0.0017685648,0.0024019924,0.0021413923,0.002982301,0.0019920915,0.00007755127],"study_design_candidate":"qualitative","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.006342455,0.010738136,0.014234122,0.007826529,0.009395376,0.00053938926,0.23224084,0.028685628,0.042476222,0.4678922,0.15886411,0.020764971],"study_design_scores_gemma":[0.0223753,0.012821775,0.017127862,0.011703499,0.00393563,0.00007886578,0.27062368,0.20321463,0.12240946,0.01574809,0.3087177,0.011243514],"about_ca_topic_score_codex":0.0016957151,"about_ca_topic_score_gemma":0.00036962825,"teacher_disagreement_score":0.45214412,"about_ca_system_score_codex":0.0005452165,"about_ca_system_score_gemma":0.00020399019,"threshold_uncertainty_score":0.998971},"labels":[],"label_agreement":null},{"id":"W3000658051","doi":"10.48550/arxiv.2001.02612","title":"Adaptive Coding for Two-Way Lossy Source-Channel Communication","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Algorithm; Source code; Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Artificial intelligence; Statistics","score_opus":0.11070263680260868,"score_gpt":0.20976415464548154,"score_spread":0.09906151784287286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000658051","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.026032636,0.00039460126,0.96467084,0.00019967962,0.00017993723,0.000986349,0.00012810083,0.0022875902,0.0051202704],"genre_scores_gemma":[0.99391925,0.0010503964,0.004386524,0.00006384332,0.00007606055,0.000020448613,0.00021101565,0.0001032735,0.00016921038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867624,0.00014054093,0.00029021176,0.0005172268,0.00007430014,0.00030145762],"domain_scores_gemma":[0.99749744,0.00030915267,0.00019492827,0.0016371134,0.000211624,0.00014974384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024087697,0.00038172276,0.00044730102,0.00022010342,0.00020281256,0.00007440809,0.0016864577,0.00041308394,0.000019923044],"category_scores_gemma":[0.000049537408,0.00053970516,0.00025888823,0.00030898713,0.00013796151,0.00020799317,0.001356245,0.0011106156,0.0000398847],"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.00007764751,0.000058280435,0.00005910506,0.00034281256,0.000305693,0.000009845906,0.0016417307,0.8748265,0.0003628861,0.118329085,0.0031945915,0.00079181313],"study_design_scores_gemma":[0.0004571133,0.000030723295,0.000033733217,0.00023835491,0.00010345952,0.0000012411766,0.00040907512,0.95224184,0.0017014235,0.041562513,0.0026722807,0.0005482203],"about_ca_topic_score_codex":0.00011175528,"about_ca_topic_score_gemma":0.00008225282,"teacher_disagreement_score":0.96788657,"about_ca_system_score_codex":0.0003860002,"about_ca_system_score_gemma":0.000046592562,"threshold_uncertainty_score":0.99970543},"labels":[],"label_agreement":null},{"id":"W3004619250","doi":"10.1109/jsyst.2020.2967470","title":"Artificial-Noise-Aided Energy-Efficient Secure Beamforming for Multi-Eavesdroppers in Cognitive Radio Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Graduate Research and Innovation Projects of Jiangsu Province; China Scholarship Council; National Natural Science Foundation of China","keywords":"Artificial noise; Eavesdropping; Computer science; Beamforming; Cognitive radio; Base station; Channel state information; Transmitter power output; Secure transmission; Maximization; Efficient energy use; Secrecy; Convex optimization; Computer network; Mathematical optimization; Wireless; Channel (broadcasting); Transmitter; Telecommunications; Mathematics; Engineering; Electrical engineering; Regular polygon; Encryption; Computer security","score_opus":0.058538028439763176,"score_gpt":0.2823687537131773,"score_spread":0.22383072527341413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004619250","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.06546216,0.0022055088,0.9303329,0.00011804316,0.0008337304,0.00049559184,0.000020479816,0.00034850975,0.00018305796],"genre_scores_gemma":[0.9964335,0.00022185303,0.002436938,0.00008654686,0.0006020552,0.00012013958,0.0000110178025,0.00007551482,0.000012419344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823004,0.00012660622,0.00079260103,0.00019199507,0.00023334601,0.00042544084],"domain_scores_gemma":[0.99907464,0.00015655876,0.00018499362,0.0001915814,0.00016006135,0.00023217029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005268192,0.00024376277,0.00041234196,0.00019536675,0.00016174176,0.00015689745,0.0003623502,0.00019253923,0.0000061261385],"category_scores_gemma":[0.00007479813,0.00025407824,0.00014829866,0.0003256034,0.00004030365,0.00016334974,0.000028912733,0.0006310125,0.0000035957762],"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.000032640983,0.00004099828,0.00008375681,0.00007877372,0.00007035256,0.000018789102,0.0025901378,0.98868394,0.004637539,0.00031871363,0.0014707316,0.0019736134],"study_design_scores_gemma":[0.00050565094,0.000050525854,0.000023733046,0.00038574796,0.000019994182,0.00008548537,0.00096430286,0.9902891,0.0052627577,0.000020294618,0.0021066954,0.00028569408],"about_ca_topic_score_codex":0.000030230533,"about_ca_topic_score_gemma":0.0000308269,"teacher_disagreement_score":0.9309714,"about_ca_system_score_codex":0.00025697186,"about_ca_system_score_gemma":0.000048207763,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W3005412203","doi":"10.1109/tit.2020.2971474","title":"Generalized Gaussian Multiterminal Source Coding: The Symmetric Case","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Distortion (music); Gaussian; Encoder; Coding (social sciences); Distributed source coding; Rate–distortion theory; Source code; Algorithm; Mathematics; Decoding methods; Discrete mathematics; Rate distortion; Computer science; Variable-length code; Theoretical computer science; Topology (electrical circuits); Data compression; Combinatorics; Statistics; Telecommunications; Physics","score_opus":0.017665512023352065,"score_gpt":0.23361914236221765,"score_spread":0.21595363033886558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005412203","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.013539532,0.00003712352,0.9811163,0.0005211342,0.00014059205,0.00027647903,0.0000354388,0.0011094519,0.0032239484],"genre_scores_gemma":[0.99712634,0.00009958819,0.0014511816,0.0011371068,0.000026933652,0.00009672633,0.00000777401,0.000019958126,0.000034390334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916875,0.00010590101,0.00034970723,0.00006587068,0.00016098226,0.00014877881],"domain_scores_gemma":[0.9992358,0.00019383579,0.00006180637,0.00036672974,0.00005090835,0.00009091869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002530504,0.00014776873,0.00011997709,0.00020604311,0.00027658217,0.000102067126,0.00028661868,0.00008477243,0.00016358445],"category_scores_gemma":[0.000014796219,0.0001239259,0.00008986297,0.0004909119,0.0000626025,0.00066765386,0.0000022821403,0.00039006176,0.00022151116],"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.00017843796,0.00008187506,0.00000312846,0.0002815738,0.00020062993,0.000026077172,0.038885955,0.3326633,0.0010406075,0.05233048,0.003421561,0.5708864],"study_design_scores_gemma":[0.0008994678,0.00007346545,0.000012135358,0.000039500275,0.00006768182,0.0004475151,0.0026958007,0.88193876,0.05456437,0.0005210232,0.05826219,0.00047806103],"about_ca_topic_score_codex":0.000010945408,"about_ca_topic_score_gemma":0.0000032119517,"teacher_disagreement_score":0.9835868,"about_ca_system_score_codex":0.000059151,"about_ca_system_score_gemma":0.000012495374,"threshold_uncertainty_score":0.5053552},"labels":[],"label_agreement":null},{"id":"W3005982595","doi":"10.14288/1.0387136","title":"Physical layer security for jamming signal aided multi-antenna communication systems","year":2019,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Physical layer; Jamming; Computer science; SIGNAL (programming language); Antenna (radio); Telecommunications; Computer security; Physics; Wireless","score_opus":0.012177957177283398,"score_gpt":0.19927316104803502,"score_spread":0.18709520387075163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005982595","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.98639387,0.00036862012,0.011303089,0.00002304561,0.0000811199,0.00070226245,0.00016474747,0.00048425663,0.00047897716],"genre_scores_gemma":[0.99668217,0.00017374974,0.0028943296,0.0000075726175,0.000016793494,0.0000062000568,0.00006504649,0.000032042146,0.00012212343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917257,0.00007661561,0.00015668581,0.00021183594,0.00016872339,0.00021356535],"domain_scores_gemma":[0.99878365,0.00014141177,0.00009943092,0.0006761377,0.00022925854,0.00007013502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021140226,0.00006150695,0.0003259369,0.000050046587,0.00014449033,0.000092890514,0.0006740275,0.00012881952,0.00002052991],"category_scores_gemma":[0.000012180587,0.00021824887,0.00014432265,0.00017600955,0.000108219916,0.0004046608,0.00016592832,0.00022417301,0.000024274068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017759817,0.0037320564,0.053754345,0.008216772,0.0017630677,0.00007493801,0.028711079,0.009782499,0.22038922,0.0010991854,0.057986565,0.6143127],"study_design_scores_gemma":[0.0023114365,0.0001205628,0.21200463,0.0007704499,0.00007148364,0.000023510564,0.0046437955,0.7768494,0.00012988962,0.000494486,0.0019314961,0.0006488746],"about_ca_topic_score_codex":0.015242867,"about_ca_topic_score_gemma":0.018550657,"teacher_disagreement_score":0.7670669,"about_ca_system_score_codex":0.00010681291,"about_ca_system_score_gemma":0.000020976777,"threshold_uncertainty_score":0.99935824},"labels":[],"label_agreement":null},{"id":"W3006433578","doi":"10.1109/itw44776.2019.8989345","title":"A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Communication source; Computer science; Secrecy; Decoding methods; Key (lock); Modular design; Encoding (memory); Reliability (semiconductor); Channel (broadcasting); Computer network; Code (set theory); Computer security; Theoretical computer science; Telecommunications; Programming language","score_opus":0.010414383984800475,"score_gpt":0.21940915170186875,"score_spread":0.2089947677170683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006433578","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.42454556,0.0008620942,0.51675785,0.0014143569,0.00026091645,0.0034412846,0.00013072407,0.005894872,0.046692338],"genre_scores_gemma":[0.95722413,0.000064841275,0.041686937,0.0001245439,0.000029890465,0.00018063418,0.000048837435,0.000082965125,0.00055720215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899304,0.000019085588,0.0002347661,0.00023429756,0.00021112847,0.00030766515],"domain_scores_gemma":[0.9987788,0.00011770438,0.000035029498,0.0008170023,0.00016411263,0.00008730993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128467,0.00020733119,0.00028857784,0.00021456012,0.00004067773,0.00009239979,0.00049335376,0.0001400042,0.00017602448],"category_scores_gemma":[0.00002843565,0.00018258728,0.00007207065,0.00044343804,0.000024753905,0.00027041606,0.00007557005,0.00019216153,0.000094590476],"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.00037791938,0.0008040662,0.004177082,0.0048548263,0.0017425076,0.000025968753,0.00886359,0.048003517,0.16268457,0.69814503,0.056874212,0.013446716],"study_design_scores_gemma":[0.0007510665,0.00022362113,0.0007688691,0.00016356168,0.0000325227,0.000012503249,0.00009378861,0.94322133,0.028855782,0.001800424,0.023498727,0.0005778184],"about_ca_topic_score_codex":0.000012842881,"about_ca_topic_score_gemma":0.000026735648,"teacher_disagreement_score":0.8952178,"about_ca_system_score_codex":0.000055672663,"about_ca_system_score_gemma":0.000017738168,"threshold_uncertainty_score":0.7445693},"labels":[],"label_agreement":null},{"id":"W3013736034","doi":"10.1109/ccnc46108.2020.9045329","title":"Deep Learning Decoder for MIMO Communications with Impulsive Noise","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Computer science; MIMO; Noise (video); Decoding methods; 3G MIMO; Electronic engineering; Telecommunications; Artificial intelligence; Speech recognition; Engineering; Beamforming","score_opus":0.02193850686667621,"score_gpt":0.2564804380440819,"score_spread":0.23454193117740568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013736034","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.004841449,0.00067817327,0.9728002,0.0032894828,0.000009964872,0.00045716364,0.0000041751737,0.0021565596,0.01576285],"genre_scores_gemma":[0.81027055,0.00030064993,0.1888105,0.0003295152,0.000014440241,0.00016849143,0.000037791444,0.000039124836,0.000028939234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952203,0.000027053751,0.00015176262,0.00009730218,0.00006534891,0.00013650242],"domain_scores_gemma":[0.9990428,0.00017107581,0.000027899572,0.0005877148,0.000091965056,0.00007853499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005441717,0.000104348066,0.00012688102,0.00003343178,0.00010996397,0.000035114015,0.0005646177,0.000050095605,0.00004241649],"category_scores_gemma":[0.000033856253,0.000099431876,0.0000372472,0.00015009577,0.000046322733,0.00012541619,0.00011930032,0.00022702721,0.000024526082],"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.00031593372,0.0005035473,0.015807612,0.0014224792,0.0014322775,0.000008102595,0.06449923,0.23059636,0.06696846,0.17921571,0.053075947,0.38615432],"study_design_scores_gemma":[0.0002970352,0.00007595182,0.00017044407,0.00001644122,0.000017060816,0.0000021093908,0.0005667266,0.90198576,0.007025364,0.00020741067,0.08941319,0.00022249739],"about_ca_topic_score_codex":0.000009128699,"about_ca_topic_score_gemma":0.00007545415,"teacher_disagreement_score":0.8054291,"about_ca_system_score_codex":0.000026010874,"about_ca_system_score_gemma":0.0000084470275,"threshold_uncertainty_score":0.40547144},"labels":[],"label_agreement":null},{"id":"W3014980692","doi":"10.1109/ccece43985.2019.9052395","title":"Secrecy Based Resource Allocation for D2D Communication Using Tabu Search Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Subcarrier; Computer science; Tabu search; Spectral efficiency; Resource allocation; Cellular network; Physical layer; Computer network; Heuristic; Wireless; Radio resource management; Optimization problem; Secrecy; Distributed computing; Wireless network; Algorithm; Orthogonal frequency-division multiplexing; Channel (broadcasting); Telecommunications","score_opus":0.02639796671415485,"score_gpt":0.27798565725433466,"score_spread":0.2515876905401798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014980692","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.051543742,0.00025394268,0.9396618,0.00031137184,0.00003193411,0.00085031695,0.000012729105,0.0010797267,0.006254438],"genre_scores_gemma":[0.6971271,0.000031395983,0.30231756,0.00010389474,0.000015979089,0.00006469588,0.00017034434,0.000045036144,0.0001240159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916315,0.00008639613,0.0002459598,0.00014047734,0.0001668124,0.0001972302],"domain_scores_gemma":[0.9983835,0.0002430371,0.000033922894,0.0011455492,0.00014570293,0.00004828899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050741667,0.0001245729,0.00014732427,0.00014366991,0.00009110433,0.000058183818,0.0005090446,0.00011744272,0.00010770834],"category_scores_gemma":[0.000012169371,0.00014221676,0.000054957683,0.00021886422,0.000028926777,0.00020136416,0.00007924706,0.00019413541,0.00003400188],"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.00007686555,0.00043067898,0.0021486524,0.0011499368,0.0002329191,5.7630086e-7,0.0037541783,0.22695205,0.21580513,0.07271938,0.008931954,0.4677977],"study_design_scores_gemma":[0.00026939824,0.000017517743,0.000086881235,0.00004889893,0.0000061687383,9.20557e-7,0.00014914815,0.9286247,0.052619234,0.00038326244,0.017628849,0.00016501425],"about_ca_topic_score_codex":0.000083424326,"about_ca_topic_score_gemma":0.000014143856,"teacher_disagreement_score":0.7016727,"about_ca_system_score_codex":0.0001562447,"about_ca_system_score_gemma":0.00003065179,"threshold_uncertainty_score":0.5799431},"labels":[],"label_agreement":null},{"id":"W3015227276","doi":"10.1177/1550147720916384","title":"An efficient emerging network and secured hopping scheme employed over the unsecured public channels","year":2020,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"Ministry of Science and ICT, South Korea","keywords":"Computer science; Jamming; Wireless; Secrecy; Computer network; Frequency-hopping spread spectrum; Computer security; Channel (broadcasting); Wireless network; Telecommunications","score_opus":0.017402418023203577,"score_gpt":0.2563081959770682,"score_spread":0.23890577795386464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015227276","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.5145805,0.002384135,0.47579166,0.0056431405,0.0009919594,0.00019123041,0.000057848985,0.0003153807,0.000044157943],"genre_scores_gemma":[0.9956613,0.0006737001,0.0017330976,0.00047108912,0.0013240537,0.0000052319274,0.00009176599,0.00003928527,4.7439678e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982969,0.00014405082,0.0006255802,0.00015102273,0.00048179887,0.00030061632],"domain_scores_gemma":[0.99858105,0.00017130453,0.00029897553,0.0002409257,0.00047866476,0.00022905284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040407013,0.00020908407,0.00026687142,0.00008559063,0.00012257478,0.00032235633,0.0009276634,0.00012455873,0.000032107564],"category_scores_gemma":[0.00011433146,0.00017849776,0.00011842509,0.00035169002,0.00007797303,0.000262143,0.0001329856,0.00071701885,0.0000012114515],"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.000056336292,0.000039805647,0.0011598535,0.000007771435,0.00036537607,0.000032981374,0.0007472648,0.9875082,0.00069500884,0.0011593949,0.0065813456,0.0016466618],"study_design_scores_gemma":[0.0005110246,0.00005086206,0.0018260875,0.0000910604,0.000022655131,0.0000688805,0.00021551277,0.98449904,0.00015683273,0.00010554949,0.0122524435,0.00020008051],"about_ca_topic_score_codex":0.0000031478148,"about_ca_topic_score_gemma":0.0000031723048,"teacher_disagreement_score":0.48108083,"about_ca_system_score_codex":0.0000962314,"about_ca_system_score_gemma":0.000023801078,"threshold_uncertainty_score":0.72789276},"labels":[],"label_agreement":null},{"id":"W3015787955","doi":"10.48550/arxiv.2004.03954","title":"A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Channel capacity; Upper and lower bounds; Symmetry (geometry); Coding (social sciences); Simple (philosophy); Channel (broadcasting); Computation; Mathematics; Computer science; Algorithm; Mathematical analysis; Statistics; Geometry; Telecommunications","score_opus":0.11603019044745722,"score_gpt":0.2121868979237297,"score_spread":0.09615670747627247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015787955","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.64021856,0.000039941624,0.3555502,0.00013648286,0.0001826834,0.00093661377,0.0004928878,0.0010730092,0.0013695897],"genre_scores_gemma":[0.99558663,0.00014714863,0.0037471368,0.000052097366,0.00010513751,0.000016220802,0.00024494695,0.000053821135,0.000046832294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986143,0.000093851544,0.00030185308,0.00063297385,0.00007134031,0.000285645],"domain_scores_gemma":[0.9984215,0.0001556252,0.0001686061,0.0009406205,0.0001543732,0.00015928756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028660562,0.0003514001,0.00041723062,0.00017922497,0.00014884505,0.00012303086,0.00060780614,0.00035154377,0.000005966661],"category_scores_gemma":[0.00008704718,0.00046045345,0.0001469062,0.00021406963,0.00014460688,0.00027449147,0.0005708164,0.0006715282,0.0000087943345],"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.00069050165,0.0003722607,0.00089825614,0.0058992305,0.0012952649,0.00007638453,0.016575033,0.6228235,0.008360213,0.32712734,0.0133518865,0.0025301315],"study_design_scores_gemma":[0.0009570678,0.000040883064,0.00017891277,0.0001041522,0.000090068555,0.0000026433613,0.00009589974,0.89215773,0.0060718334,0.09613496,0.0035447497,0.0006210928],"about_ca_topic_score_codex":0.0002304548,"about_ca_topic_score_gemma":0.0001423433,"teacher_disagreement_score":0.35536808,"about_ca_system_score_codex":0.00024483533,"about_ca_system_score_gemma":0.00002625416,"threshold_uncertainty_score":0.9997847},"labels":[],"label_agreement":null},{"id":"W3017308685","doi":"10.1109/tcomm.2020.2987565","title":"Lattice-Based Robust Distributed Source Coding for Three Correlated Sources","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Rate distortion; Distributed source coding; Lattice (music); Degenerate energy levels; Coding (social sciences); Rate–distortion theory; Mathematics; Algorithm; Quadratic equation; Source code; Gaussian process; Computer science; Statistical physics; Decoding methods; Theoretical computer science; Applied mathematics; Channel code; Physics; Statistics; Quantum mechanics; Geometry","score_opus":0.06467019300070098,"score_gpt":0.2588014935177366,"score_spread":0.19413130051703564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017308685","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.0020960248,0.00027513114,0.98785985,0.0053140717,0.000086392996,0.00071177905,0.00041409186,0.002811139,0.0004315379],"genre_scores_gemma":[0.9690293,0.00022986041,0.02954769,0.0003072329,0.000019024423,0.0005641782,0.00019761604,0.00008739499,0.00001770376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.00009291244,0.00044087355,0.000207819,0.00016245098,0.0002658556],"domain_scores_gemma":[0.99688506,0.00091747055,0.00008273417,0.001796295,0.0001554776,0.00016293739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015118712,0.0002444731,0.00026192825,0.00013351589,0.0006442073,0.00009123102,0.0014135024,0.00017735621,0.000055816196],"category_scores_gemma":[0.000027990774,0.0002922086,0.00018352372,0.0005998052,0.00016991168,0.00016959647,0.000009628644,0.00069558487,0.00005168003],"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.000047793514,0.00025652445,0.00003734162,0.000099802084,0.00016057317,2.799917e-7,0.000878348,0.98019755,0.0026173294,0.0011528414,0.0018340894,0.012717528],"study_design_scores_gemma":[0.0005639876,0.000066738074,0.00003766483,0.00007192985,0.000087556706,0.0000012770859,0.00012351897,0.95911896,0.012673788,0.00012804262,0.02681974,0.00030681133],"about_ca_topic_score_codex":0.000025616086,"about_ca_topic_score_gemma":0.0002043146,"teacher_disagreement_score":0.96693325,"about_ca_system_score_codex":0.000118015814,"about_ca_system_score_gemma":0.00004244417,"threshold_uncertainty_score":0.99995303},"labels":[],"label_agreement":null},{"id":"W3029883195","doi":"10.1109/tcomm.2020.2997401","title":"Security Enhancement via Antenna Selection in MIMOME Channels With Discrete Inputs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Rayleigh fading; QAM; Quadrature amplitude modulation; Computer science; Antenna (radio); Channel (broadcasting); Topology (electrical circuits); Artificial noise; Communications system; Electronic engineering; Fading; Telecommunications; Bit error rate; Mathematics; Engineering; Transmitter","score_opus":0.021637268988591363,"score_gpt":0.25126453838190155,"score_spread":0.22962726939331018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029883195","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.014576868,0.00021337545,0.9766382,0.005247497,0.00006385431,0.0006137006,0.000029744053,0.0010915995,0.0015251759],"genre_scores_gemma":[0.99190176,0.0013190793,0.0058146184,0.00031757503,0.000016040147,0.00054296246,0.000017705426,0.000054600456,0.000015672464],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00015370728,0.00039555898,0.00022745864,0.00019972396,0.00025736872],"domain_scores_gemma":[0.99853927,0.00011659387,0.00005850054,0.0010704325,0.000087199114,0.00012799115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001315484,0.0002369501,0.0002476737,0.00022850133,0.00023371038,0.00005252519,0.00090195227,0.00011389493,0.0000640995],"category_scores_gemma":[0.0000036972122,0.00025686025,0.00006829992,0.0010189769,0.00012176465,0.00033259392,0.000010941363,0.0008504384,0.000057206704],"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.00087129226,0.006309267,0.00090189226,0.001057361,0.0015458913,0.000020031406,0.073770784,0.42731598,0.42920262,0.007930226,0.0026724187,0.048402227],"study_design_scores_gemma":[0.0009840677,0.00040015296,0.00018251948,0.00025029364,0.000053708456,0.0000135157,0.00025110372,0.81797415,0.17157754,0.0006328791,0.006901106,0.0007789896],"about_ca_topic_score_codex":0.00008905856,"about_ca_topic_score_gemma":0.00087626465,"teacher_disagreement_score":0.9773249,"about_ca_system_score_codex":0.0001822386,"about_ca_system_score_gemma":0.000029317804,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W3030674378","doi":"","title":"Secret Keys from Channel Noise.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Computer science; Randomness; Initialization; Channel (broadcasting); Upper and lower bounds; Binary symmetric channel; Alice and Bob; Key (lock); Computer network; Protocol (science); Binary number; Computer security; Verifiable secret sharing; Adversary; Theoretical computer science; Channel capacity; Alice (programming language); Mathematics; Arithmetic; Statistics; Set (abstract data type)","score_opus":0.026329738865295677,"score_gpt":0.24071884263436844,"score_spread":0.21438910376907275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030674378","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.1100482,0.0010822602,0.823046,0.00031470932,0.0011880522,0.00079482596,0.00051570626,0.0032904772,0.05971977],"genre_scores_gemma":[0.6759288,0.0021181833,0.3198122,0.00015243657,0.00026165333,0.0006519562,0.0008881352,0.00018409832,0.0000025811946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748284,0.00030555404,0.0006950917,0.0007454828,0.00020016852,0.00057085545],"domain_scores_gemma":[0.9964891,0.00035356177,0.00020940165,0.0026580605,0.000084975654,0.00020486477],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00020756332,0.0006534419,0.00089770753,0.00035875003,0.00008944544,0.000048594346,0.0020518717,0.0008337448,0.00054946257],"category_scores_gemma":[0.00006930388,0.0007658435,0.00030737492,0.0000880698,0.00037437538,0.00007569839,0.003194968,0.002677967,0.0006270786],"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.000113523,0.00030072866,0.0027635964,0.0005192168,0.00158192,0.00013434993,0.028773194,0.0069513223,0.009289734,0.92731863,0.013332233,0.008921521],"study_design_scores_gemma":[0.00021414491,0.000021642296,0.0053443024,0.00019924478,0.000060940576,0.000010793729,0.0000929841,0.011569731,0.01271915,0.9644015,0.004588436,0.0007771513],"about_ca_topic_score_codex":0.00054189056,"about_ca_topic_score_gemma":0.00034298236,"teacher_disagreement_score":0.56588054,"about_ca_system_score_codex":0.00012836336,"about_ca_system_score_gemma":0.00007613547,"threshold_uncertainty_score":0.9996229},"labels":[],"label_agreement":null},{"id":"W3033035734","doi":"10.1109/lwc.2020.2999333","title":"Dynamic Spectrum Anti-Jamming in Broadband Communications: A Hierarchical Deep Reinforcement Learning Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"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":"National Natural Science Foundation of China","keywords":"Jamming; Computer science; Reinforcement learning; Frequency band; Frequency-hopping spread spectrum; Selection (genetic algorithm); Broadband; Convergence (economics); Throughput; Q-learning; Telecommunications; Algorithm; Artificial intelligence; Wireless; Bandwidth (computing)","score_opus":0.02210946267116902,"score_gpt":0.2529385481066058,"score_spread":0.2308290854354368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033035734","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.40748176,0.0040565967,0.5234096,0.051226657,0.00013925506,0.0020202245,0.0000126803725,0.0041008885,0.007552313],"genre_scores_gemma":[0.9583962,0.006376524,0.03306186,0.0012903312,0.00002505518,0.00044738667,0.000274957,0.00011972855,0.00000796666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970735,0.00059868145,0.0009980982,0.00039029174,0.0003639417,0.0005755167],"domain_scores_gemma":[0.99458593,0.0004280598,0.00018612384,0.004537909,0.00005597314,0.00020597802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047061176,0.00041949432,0.0005566436,0.00041051244,0.00046359855,0.00016516096,0.004987845,0.00019515157,0.000014167767],"category_scores_gemma":[0.000061050465,0.00052254775,0.00015345156,0.0011854902,0.0005702844,0.0004595014,0.0010362153,0.00228197,0.000054568027],"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.000041654817,0.00048749617,0.0031481406,0.00044721508,0.00028885668,0.000013655067,0.023353973,0.8660957,0.07644543,0.007483014,0.0010593216,0.021135498],"study_design_scores_gemma":[0.00055455556,0.000031014817,0.00067109184,0.00012224056,0.000022244665,0.000014105363,0.00052370044,0.9899987,0.0009449861,0.00006587758,0.0064963414,0.0005551401],"about_ca_topic_score_codex":0.00009984571,"about_ca_topic_score_gemma":0.00015433025,"teacher_disagreement_score":0.5509144,"about_ca_system_score_codex":0.00038270807,"about_ca_system_score_gemma":0.000039485873,"threshold_uncertainty_score":0.9997226},"labels":[],"label_agreement":null},{"id":"W3033929564","doi":"10.1049/el.2020.1684","title":"Comments on ‘Precoding for secrecy rate maximisation in cognitive MIMO wiretap channels’","year":2020,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","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 Ottawa","funders":"","keywords":"Secrecy; Precoding; MIMO; Convex optimization; Channel (broadcasting); Sequence (biology); Regular polygon; Computer science; Solver; Mathematical optimization; Mathematics; Algorithm; Telecommunications; Computer security","score_opus":0.03851036138574388,"score_gpt":0.2626988503597801,"score_spread":0.2241884889740362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033929564","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.89629185,0.0003051648,0.07963722,0.021257201,0.00012771787,0.0010438609,0.00002103034,0.00076102535,0.0005549305],"genre_scores_gemma":[0.99107313,0.00019890603,0.0005962912,0.0077129398,0.000060579267,0.00020083746,0.00010667594,0.000047691545,0.000002966955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913263,0.00006220686,0.00021194678,0.00017925458,0.00009055443,0.00032341937],"domain_scores_gemma":[0.9995358,0.00019563812,0.000043070137,0.00015253363,0.000022482023,0.000050478055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913423,0.00015597911,0.00016720242,0.00009602837,0.000050019364,0.000039224167,0.00021707999,0.00006544774,0.000012001484],"category_scores_gemma":[0.000055388373,0.00019535786,0.000050028866,0.0001859703,0.00001581868,0.00013073621,0.000027321474,0.00035062718,0.000012038025],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009592775,0.0003656718,0.0021216501,0.00083847257,0.0006827741,0.00002135017,0.034528557,0.05471047,0.73991734,0.017355025,0.050821368,0.09767805],"study_design_scores_gemma":[0.0028494888,0.00041827757,0.00053116307,0.00030161845,0.000036743062,0.0000019556558,0.00020877612,0.43159696,0.5408501,0.0020495648,0.020220129,0.0009352303],"about_ca_topic_score_codex":0.0000042779357,"about_ca_topic_score_gemma":0.000017200648,"teacher_disagreement_score":0.3768865,"about_ca_system_score_codex":0.00022735079,"about_ca_system_score_gemma":0.000011746549,"threshold_uncertainty_score":0.79664624},"labels":[],"label_agreement":null},{"id":"W3044105291","doi":"10.1109/tsp.2020.3010451","title":"Algorithms for Globally-Optimal Secure Signaling Over Gaussian MIMO Wiretap Channels Under Interference Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"MIMO; Transmitter power output; Mathematical optimization; Covariance matrix; Computer science; Covariance; Constraint (computer-aided design); Channel (broadcasting); Convergence (economics); Gaussian; Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.040297310458064804,"score_gpt":0.2803710837485797,"score_spread":0.2400737732905149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044105291","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.007457117,0.00024841665,0.9894921,0.0005468063,0.00013376318,0.00043842822,0.00007362342,0.0012278063,0.0003819439],"genre_scores_gemma":[0.97776246,0.000030955856,0.021291563,0.00055908255,0.00011241405,0.00013317888,0.000011171513,0.00008608482,0.000013117032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840045,0.000045370263,0.00045976372,0.00038900625,0.00029286195,0.00041257206],"domain_scores_gemma":[0.9992199,0.00011465953,0.000089294386,0.00022153545,0.00013871858,0.00021587008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015646483,0.00035766495,0.0003400504,0.0001295505,0.00028208332,0.00024400662,0.0005011786,0.0002183638,0.00022658023],"category_scores_gemma":[0.0000037924249,0.00039410757,0.00016306713,0.00038852534,0.00017304717,0.0004858547,0.0000045990178,0.00059906865,0.00001634427],"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.00016765221,0.00017815453,0.0000032440735,0.0007535036,0.00022870662,0.000008996129,0.005842869,0.6340407,0.08654919,0.0002447078,0.00035681424,0.27162546],"study_design_scores_gemma":[0.00055736623,0.00015533154,0.0000036085598,0.00040647024,0.000059219772,0.000012551434,0.0006020137,0.7701434,0.22691813,0.0003365159,0.00030788258,0.00049750524],"about_ca_topic_score_codex":0.000004523917,"about_ca_topic_score_gemma":0.0000042068073,"teacher_disagreement_score":0.9703053,"about_ca_system_score_codex":0.00012765275,"about_ca_system_score_gemma":0.0000844704,"threshold_uncertainty_score":0.9998511},"labels":[],"label_agreement":null},{"id":"W3046608666","doi":"10.1109/tifs.2020.3013210","title":"Secure Interference Exploitation Precoding in MISO Wiretap Channel: Destructive Region Redefinition With Efficient Solutions","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Key Science and Technology Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; Southeast University","keywords":"Precoding; Computer science; Zero-forcing precoding; Karush–Kuhn–Tucker conditions; Artificial noise; Channel state information; Channel (broadcasting); Convex optimization; Transmitter power output; MIMO; Optimization problem; Interference (communication); Transmitter; Mathematical optimization; Algorithm; Regular polygon; Wireless; Mathematics; Computer network; Telecommunications","score_opus":0.02736995863524533,"score_gpt":0.20817561818918356,"score_spread":0.18080565955393824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046608666","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.19091873,0.000032054275,0.8068983,0.00042626046,0.000091622336,0.00039643553,0.000047932335,0.00042829482,0.0007603611],"genre_scores_gemma":[0.99802566,0.00027616025,0.0014054453,0.0001237162,0.000010297679,0.000105191495,0.000037463415,0.000015627706,4.1683575e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990936,0.000040519597,0.00037138574,0.00013517059,0.00016835793,0.00019098358],"domain_scores_gemma":[0.99945855,0.000057671004,0.0000883602,0.00018049162,0.000120285826,0.0000946309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102289814,0.00018365054,0.00017273359,0.00021945187,0.00017624898,0.00008377215,0.000105779065,0.00012160596,0.0000058137193],"category_scores_gemma":[0.000008649258,0.0001926197,0.000039546172,0.00040235533,0.00008543474,0.00077626907,0.000003673225,0.0004289522,0.000006836841],"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.00055788254,0.00017601572,0.0000693222,0.0008253345,0.0001370612,0.0000056360373,0.20831703,0.68165755,0.0003911869,0.049085125,0.0005041011,0.058273762],"study_design_scores_gemma":[0.0008003586,0.00026665797,0.00020627068,0.00027792802,0.000026281667,0.000025398609,0.0038244487,0.9816449,0.008278966,0.0039769034,0.00027022892,0.000401635],"about_ca_topic_score_codex":0.000030212925,"about_ca_topic_score_gemma":0.00009147208,"teacher_disagreement_score":0.807107,"about_ca_system_score_codex":0.00014851538,"about_ca_system_score_gemma":0.00002081424,"threshold_uncertainty_score":0.7854803},"labels":[],"label_agreement":null},{"id":"W3048207934","doi":"10.48550/arxiv.2008.02977","title":"A Channel Model of Transceivers for Multiterminal Secret Key Agreement","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Channel (broadcasting); Key (lock); Transceiver; Computer science; Terminal (telecommunication); Variable (mathematics); Random variable; Channel capacity; Shared secret; Computer network; Telecommunications; Mathematics; Wireless; Computer security; Statistics","score_opus":0.12378915752634118,"score_gpt":0.20296951387982906,"score_spread":0.07918035635348789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048207934","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.14754738,0.00007846753,0.84859586,0.000076231525,0.00009011821,0.0007799329,0.00048606802,0.0005291141,0.0018168223],"genre_scores_gemma":[0.9946893,0.00058339344,0.004418732,0.000024922967,0.00002319814,0.00000944126,0.00011065621,0.000045743374,0.00009461075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903697,0.00003226963,0.00024755145,0.00039900205,0.0000698807,0.00021429933],"domain_scores_gemma":[0.99883544,0.000051854153,0.000124264,0.0007447643,0.00012948425,0.000114175076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000099696445,0.00028344596,0.00040065538,0.00018906897,0.000045152876,0.0000146287,0.00093616766,0.000282188,0.000015262065],"category_scores_gemma":[0.000010682077,0.00038987273,0.00028999127,0.00015736552,0.000084010164,0.00010792145,0.00021297952,0.00042355005,0.0000052424425],"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.000057991136,0.000043987948,0.000021129548,0.0007885421,0.00014680148,0.00000700896,0.0015921729,0.98640037,0.0019087318,0.008574155,0.00034176646,0.00011734431],"study_design_scores_gemma":[0.00046314418,0.000037054502,0.000018393042,0.00015447832,0.00011468434,3.2769356e-7,0.00014570789,0.9820991,0.005889969,0.010503364,0.00023750613,0.00033625486],"about_ca_topic_score_codex":0.00003989367,"about_ca_topic_score_gemma":0.00003316855,"teacher_disagreement_score":0.8471419,"about_ca_system_score_codex":0.00016814988,"about_ca_system_score_gemma":0.00006069507,"threshold_uncertainty_score":0.99985534},"labels":[],"label_agreement":null},{"id":"W3080483966","doi":"10.1109/isit44484.2020.9174376","title":"The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate","year":2020,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Exponent; Mathematics; Zero (linguistics); Binary symmetric channel; Binary number; Function (biology); Decoding methods; Applied mathematics; Combinatorics; Mathematical analysis; Channel code; Statistics; Arithmetic","score_opus":0.028453955979787806,"score_gpt":0.24261473796017344,"score_spread":0.21416078198038563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080483966","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.8979442,0.0031860853,0.020782111,0.059250325,0.00031493758,0.001006006,0.000014460521,0.0036760177,0.013825859],"genre_scores_gemma":[0.9953027,0.00088058424,0.0012197895,0.0016614175,0.000056627665,0.00010158237,0.000011264987,0.00004975429,0.00071629183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892074,0.00018456622,0.00029069322,0.00015426677,0.00018833319,0.00026142134],"domain_scores_gemma":[0.99877495,0.0002688224,0.00004503124,0.0007848606,0.000036059784,0.00009028987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029202856,0.00018706203,0.00016288535,0.000019065386,0.0004055714,0.00016112397,0.0009156344,0.00006722385,0.00017034181],"category_scores_gemma":[0.000058074518,0.00011063324,0.000095207935,0.00016774822,0.00011538065,0.000108427565,0.00035458794,0.00025983693,0.00023538384],"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.00019092919,0.00010242162,0.00057573285,0.00014719566,0.00066931493,0.000013659247,0.008377184,0.0124097075,0.33749405,0.14372668,0.4866922,0.009600927],"study_design_scores_gemma":[0.0007230126,0.0000711023,0.0029756746,0.000026836573,0.00005207681,0.000009714234,0.00036826413,0.18550374,0.09719748,0.003466629,0.7089568,0.0006486709],"about_ca_topic_score_codex":0.000036476944,"about_ca_topic_score_gemma":0.00012758482,"teacher_disagreement_score":0.24029657,"about_ca_system_score_codex":0.000081628896,"about_ca_system_score_gemma":0.0000133253825,"threshold_uncertainty_score":0.45114928},"labels":[],"label_agreement":null},{"id":"W3080854183","doi":"10.1109/isit44484.2020.9174385","title":"New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive Noise","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Ergodicity; Autoregressive model; Ergodic theory; Noise (video); Gaussian noise; Invariant (physics); Gaussian; Channel (broadcasting); Control theory (sociology); Channel capacity; Mathematics; Applied mathematics; Statistical physics; Computer science; Physics; Statistics; Pure mathematics; Telecommunications; Algorithm; Control (management)","score_opus":0.017948708747065133,"score_gpt":0.21343209773102878,"score_spread":0.19548338898396364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080854183","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.85344356,0.0020870925,0.13015486,0.0008399385,0.00006678993,0.0006205654,0.00014331013,0.0009726351,0.011671241],"genre_scores_gemma":[0.9826164,0.0003731876,0.016788647,0.000039544444,0.000013305878,0.000008070619,0.000012011584,0.000024131587,0.00012466352],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992837,0.000020385804,0.00028000952,0.000119178,0.00014084681,0.00015589657],"domain_scores_gemma":[0.99935716,0.000054949513,0.000080189115,0.0003037152,0.00007041285,0.00013357167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056597582,0.0001307525,0.00029943392,0.000046056364,0.000022304546,0.000014776675,0.0002444822,0.00008956369,0.00013954294],"category_scores_gemma":[0.000028100652,0.00013110376,0.000038294904,0.00015684862,0.000058416357,0.00023003061,0.00011546748,0.00013753086,0.0000033743308],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005480496,0.00011711987,0.0032068687,0.0013987464,0.00024681506,0.0000017451102,0.013216102,0.0088857245,0.7760859,0.015734356,0.17482091,0.0062308996],"study_design_scores_gemma":[0.00042851872,0.0000828448,0.00022873485,0.00008914051,0.000016332628,0.0000010455052,0.00016047458,0.06768024,0.92249644,0.0004996378,0.008117116,0.00019945105],"about_ca_topic_score_codex":0.0003799118,"about_ca_topic_score_gemma":0.00002599984,"teacher_disagreement_score":0.16670379,"about_ca_system_score_codex":0.000026108713,"about_ca_system_score_gemma":0.000024571818,"threshold_uncertainty_score":0.5346256},"labels":[],"label_agreement":null},{"id":"W3080863193","doi":"10.1109/isit44484.2020.9173946","title":"Adaptive Coding for Two-Way Lossy Source-Channel Communication","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Decoding methods; Source code; Algorithm; Transmission (telecommunications); Theoretical computer science; Electronic engineering; Computer network; Telecommunications; Mathematics; Artificial intelligence; Engineering; Statistics","score_opus":0.046313401518249454,"score_gpt":0.262967623144533,"score_spread":0.21665422162628353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080863193","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.0028932546,0.0004273108,0.97561204,0.00200389,0.000028524299,0.0004599056,0.000013399288,0.0023853967,0.016176261],"genre_scores_gemma":[0.96288913,0.00014624812,0.036248658,0.00040825197,0.00004472253,0.000131576,0.000030987536,0.000044459128,0.000055991488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994048,0.000035448364,0.00020909532,0.000111597525,0.000086986,0.00015207869],"domain_scores_gemma":[0.9991421,0.00019452925,0.000035009372,0.00047275567,0.00007888372,0.00007672191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013755845,0.00011959245,0.00015173662,0.000041384163,0.00009721562,0.000038944025,0.00048023576,0.00007251736,0.000038703332],"category_scores_gemma":[0.000045195935,0.0001327242,0.000059895327,0.0001354056,0.000037034017,0.0001609776,0.000128032,0.00020346938,0.000034118762],"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.00020517442,0.00021441941,0.00016719064,0.0006658234,0.00053695333,0.000001882203,0.042623304,0.1447067,0.057722688,0.4652237,0.19930643,0.08862573],"study_design_scores_gemma":[0.00032148414,0.0000393302,0.000016572209,0.000031520714,0.0000099192375,9.76584e-7,0.0006152499,0.93669295,0.037804917,0.0016267493,0.022624763,0.00021554517],"about_ca_topic_score_codex":0.000022210814,"about_ca_topic_score_gemma":0.000021915886,"teacher_disagreement_score":0.95999587,"about_ca_system_score_codex":0.00004567281,"about_ca_system_score_gemma":0.0000059056197,"threshold_uncertainty_score":0.5412336},"labels":[],"label_agreement":null},{"id":"W3086497262","doi":"10.1186/s13638-021-02065-4","title":"An overview of generic tools for information-theoretic secrecy performance analysis over wiretap fading channels","year":2021,"lang":"en","type":"review","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds National de la Recherche Luxembourg; Université du Luxembourg","keywords":"Fading; Computer science; Physical layer; Secrecy; Eavesdropping; Wireless; Computer network; Transmission (telecommunications); Cryptography; Wireless security; Computer security; Channel (broadcasting); Telecommunications; Wireless network","score_opus":0.13185284955062115,"score_gpt":0.3630556364647774,"score_spread":0.23120278691415624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086497262","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006066999,0.985402,0.012659211,0.000018748828,0.00022633481,0.0005668648,0.00005937222,0.00015614719,0.00030465564],"genre_scores_gemma":[0.09758943,0.89798594,0.0032787456,0.000043812415,0.00016980537,0.00019312618,0.00065118563,0.000084769024,0.000003211865],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967738,0.00059344666,0.0017180325,0.00021767852,0.0003117961,0.00038527008],"domain_scores_gemma":[0.9947192,0.0013196279,0.0010799012,0.002384439,0.00031955575,0.00017726173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012722398,0.0005341518,0.0019990255,0.0009447345,0.00058729417,0.00062920386,0.0019204468,0.0003292859,0.000020270034],"category_scores_gemma":[0.000029484727,0.00051561696,0.00071757194,0.0017763838,0.00015045829,0.001146505,0.00030730368,0.0011417782,0.0000017443807],"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.0000027441852,0.000042003227,0.00001863994,0.0028213717,0.0008637263,5.163554e-7,0.00047982068,0.0026155417,0.0000013107175,0.004625079,0.00004236063,0.9884869],"study_design_scores_gemma":[0.00019018163,0.000099261204,0.000020488531,0.014894507,0.0018137651,0.000061013605,0.000059604405,0.21045633,0.000008651477,0.000103972714,0.77164596,0.0006462448],"about_ca_topic_score_codex":0.0000029467076,"about_ca_topic_score_gemma":0.00000562418,"teacher_disagreement_score":0.98784065,"about_ca_system_score_codex":0.0001912124,"about_ca_system_score_gemma":0.00011000535,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W3088483589","doi":"10.1109/lcomm.2020.3025903","title":"Physical Layer Security Over Mixture Gamma Distributed Fading Channels With Discrete Inputs: A Unified and General Analytical Framework","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Fading; Computer science; Physical layer; Secrecy; Gaussian; Signal-to-noise ratio (imaging); Algorithm; Channel (broadcasting); Applied mathematics; Topology (electrical circuits); Mathematics; Telecommunications; Wireless","score_opus":0.023026879415238108,"score_gpt":0.2733684997219714,"score_spread":0.2503416203067333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088483589","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.8038106,0.0002665124,0.15554164,0.038475215,0.000044218654,0.00038227564,0.0001370918,0.0010854705,0.00025698097],"genre_scores_gemma":[0.9857268,0.00023501698,0.010930516,0.0026489177,0.00013857758,0.000094059535,0.00016351441,0.000060815855,0.0000017889845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987425,0.00017821185,0.00028381875,0.0002666546,0.00022108827,0.00030768116],"domain_scores_gemma":[0.99757475,0.0002928163,0.00006978464,0.0017920315,0.000059639766,0.0002110089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009937814,0.00029000183,0.0003484909,0.000083880215,0.00020831433,0.00014997534,0.0011726393,0.0001431394,0.0000089063615],"category_scores_gemma":[0.000050255003,0.00028256932,0.00007901631,0.0006042413,0.00034979475,0.00028307142,0.00033906265,0.00108533,0.0000082218785],"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.00059016334,0.001436436,0.019871524,0.0015175443,0.0040199296,0.00014047165,0.123015426,0.115347445,0.3786875,0.20892599,0.14070934,0.0057382104],"study_design_scores_gemma":[0.00073816924,0.000086923974,0.0014553525,0.0002613584,0.00015242805,0.00001596227,0.00015383986,0.9555705,0.012075832,0.0015358756,0.026902627,0.0010511108],"about_ca_topic_score_codex":0.000021319507,"about_ca_topic_score_gemma":0.000014524656,"teacher_disagreement_score":0.8402231,"about_ca_system_score_codex":0.0000832027,"about_ca_system_score_gemma":0.000013660905,"threshold_uncertainty_score":0.9999626},"labels":[],"label_agreement":null},{"id":"W3094216785","doi":"10.1109/tvt.2020.3034529","title":"Comments on “Precoding and Artificial Noise Design for Cognitive MIMOME Wiretap Channels”","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","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 Ottawa","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Secrecy; Bounded function; Maximization; Convergence (economics); Mathematical optimization; Sequence (biology); Precoding; Computer science; Artificial noise; Point (geometry); Regular polygon; Rate of convergence; Mathematics; Channel (broadcasting); Wireless; Telecommunications; Physical layer","score_opus":0.05976992722837755,"score_gpt":0.28264019401257734,"score_spread":0.2228702667841998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094216785","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.047506947,0.00025672663,0.94364905,0.002814059,0.0005639161,0.0019576994,0.00024039808,0.0029640598,0.0000471484],"genre_scores_gemma":[0.9858422,0.00065592566,0.010836055,0.00020344887,0.000044487893,0.0022350978,0.000044018965,0.00013079861,0.000007914803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834716,0.00008953891,0.0004510617,0.00058531796,0.00017239724,0.00035453858],"domain_scores_gemma":[0.9986951,0.00029912937,0.00010901899,0.000689128,0.00011555296,0.000092114984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018637322,0.000481469,0.00058723,0.00076157734,0.00022600162,0.00007212007,0.00052481785,0.0010980237,0.000012132002],"category_scores_gemma":[0.000026375405,0.0005857505,0.00017533824,0.00030037158,0.00019194878,0.000063102976,0.000022143675,0.001781814,0.000024077344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010495113,0.0016967304,0.000013963822,0.0023469331,0.0036027967,0.000093763636,0.0042928294,0.47095394,0.09380332,0.0051715425,0.0021791768,0.4147955],"study_design_scores_gemma":[0.00056927255,0.00042115845,0.0000046510263,0.0006799739,0.00021315027,0.000012743205,0.00017576845,0.27570525,0.7084068,0.012371653,0.00070874504,0.0007308458],"about_ca_topic_score_codex":0.000007983144,"about_ca_topic_score_gemma":0.000010141112,"teacher_disagreement_score":0.9383353,"about_ca_system_score_codex":0.0001839455,"about_ca_system_score_gemma":0.000031736396,"threshold_uncertainty_score":0.9996594},"labels":[],"label_agreement":null},{"id":"W3094374777","doi":"10.1109/tifs.2020.3032276","title":"Physical-Layer Secret Key Generation via CQI-Mapped Spatial Modulation in Multi-Hop Wiretap Ad-Hoc Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":29,"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; Université du Québec à Montréal","funders":"European Research Council; Engineering and Physical Sciences Research Council; Royal Society","keywords":"Computer science; Physical layer; Computer network; Wireless ad hoc network; Key generation; Secrecy; Key (lock); Wireless; Encryption; Wireless network; Computer security; Telecommunications","score_opus":0.022541335207689993,"score_gpt":0.23433401272891258,"score_spread":0.21179267752122258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094374777","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.17590217,0.0000587901,0.82266515,0.00024567253,0.00016699059,0.00039482894,0.00004599531,0.00041723848,0.00010317385],"genre_scores_gemma":[0.99593365,0.00063077756,0.002794929,0.0003065559,0.000054399305,0.000075241616,0.0001775723,0.00002550581,0.0000013588632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988489,0.000054020707,0.0005022221,0.00015674971,0.00022830503,0.0002098005],"domain_scores_gemma":[0.99934256,0.000040449333,0.00009712472,0.00027145137,0.00012271773,0.00012567284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012726866,0.00024006526,0.00025194482,0.00016020174,0.0001545143,0.00010981401,0.00013174649,0.00019643207,0.000017510787],"category_scores_gemma":[0.0000059956046,0.0002712305,0.00008076344,0.00033406634,0.000055253306,0.0012269295,0.0000048334887,0.00052554323,0.000017933975],"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.000073504365,0.00009045471,0.000035710324,0.00013415041,0.000050495448,8.208765e-7,0.02315382,0.78191864,0.0023322112,0.00056657556,0.00029123592,0.19135237],"study_design_scores_gemma":[0.00065008015,0.00006911049,0.00023998442,0.000023288541,0.000013949232,0.0000017674126,0.00010174353,0.98927826,0.007896479,0.0002418069,0.0012144789,0.00026906232],"about_ca_topic_score_codex":0.000040749415,"about_ca_topic_score_gemma":0.0003698147,"teacher_disagreement_score":0.82003146,"about_ca_system_score_codex":0.00008987609,"about_ca_system_score_gemma":0.00001479062,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W3098640227","doi":"","title":"One-shot capacity bounds on the simultaneous transmission of classical and quantum information","year":2020,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Perimeter Institute; University of Waterloo","funders":"U.S. Army; Australian Research Council; Generalitat de Catalunya","keywords":"Classical capacity; Quantum capacity; Quantum channel; Amplitude damping channel; Quantum information; Quantum; Converse; Qubit; Channel (broadcasting); Transmission (telecommunications); Computer science; Mathematics; Topology (electrical circuits); Statistical physics; Quantum network; Quantum mechanics; Physics; Telecommunications; Combinatorics","score_opus":0.03061822084237527,"score_gpt":0.20464415795348082,"score_spread":0.17402593711110553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098640227","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.9508415,0.00010379201,0.033999663,0.0121928025,0.0000150304195,0.00022618163,0.000031179283,0.0006758966,0.0019139545],"genre_scores_gemma":[0.9970588,0.00026091514,0.002610095,0.000053210137,0.000002314811,5.7088704e-7,0.000004969066,0.00000618468,0.000002938388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995201,0.000027270793,0.00013455562,0.00009023109,0.00012533405,0.000102507474],"domain_scores_gemma":[0.9993607,0.0001222829,0.000074112395,0.00033380662,0.00006411275,0.000045018853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006431024,0.00009261631,0.00020080761,0.00016859062,0.000087722714,0.0000060309767,0.0004953955,0.0002425364,0.000022779424],"category_scores_gemma":[0.000071736504,0.000095928204,0.00004056118,0.00026839736,0.00042752616,0.00018820405,0.00011649613,0.00035403357,0.000003970934],"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.0004585151,0.0003893286,0.0018053255,0.0013669753,0.00047458208,0.000017032908,0.029807473,0.0051760087,0.19647712,0.5327931,0.0048985295,0.226336],"study_design_scores_gemma":[0.0011771983,0.0006191693,0.0017305466,0.0003629704,0.000110202214,0.00000960244,0.004678411,0.6840196,0.19528091,0.00849652,0.10295135,0.00056351157],"about_ca_topic_score_codex":0.000031891006,"about_ca_topic_score_gemma":0.0000073780225,"teacher_disagreement_score":0.6788436,"about_ca_system_score_codex":0.000023922936,"about_ca_system_score_gemma":0.0000089855275,"threshold_uncertainty_score":0.39118385},"labels":[],"label_agreement":null},{"id":"W3100341354","doi":"","title":"Counterexamples to Additivity of Minimum Output p-Renyi Entropy for p Close to 0","year":2008,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Additive function; Counterexample; Multiplicative function; Conjecture; Mathematics; Entropy (arrow of time); Combinatorics; Discrete mathematics; Statistical physics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.017568628478430902,"score_gpt":0.2113797518526397,"score_spread":0.1938111233742088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100341354","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.93383306,0.000052218027,0.058165874,0.00042111962,0.00015029233,0.00090535346,0.0046009687,0.00034952947,0.0015215987],"genre_scores_gemma":[0.9859213,0.00010897773,0.010639665,0.00012506013,0.000035790115,0.000013766314,0.00008378985,0.000036105186,0.0030355519],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989338,0.000051013678,0.00020444933,0.00027117447,0.00023030596,0.00030928385],"domain_scores_gemma":[0.9986847,0.0002487571,0.000060793293,0.00069517945,0.00014910127,0.00016146988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010933335,0.00021225832,0.00038339017,0.00036397128,0.00018538116,0.000015323152,0.00067199545,0.0001053183,0.000039432474],"category_scores_gemma":[0.000057247045,0.0002772698,0.00016796798,0.0005186515,0.00008637779,0.0006241584,0.0002806802,0.00012552121,0.00003499101],"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.0016745526,0.000842239,0.0023819983,0.0005870289,0.00048856257,0.00014365281,0.008883971,0.0026057868,0.046428442,0.12936893,0.80400413,0.0025906798],"study_design_scores_gemma":[0.003603306,0.00075357716,0.030746173,0.00033794233,0.00013015718,0.000037722515,0.0033381195,0.008609136,0.05013605,0.0007350499,0.8998445,0.0017282625],"about_ca_topic_score_codex":0.0001240932,"about_ca_topic_score_gemma":0.00028473928,"teacher_disagreement_score":0.12863389,"about_ca_system_score_codex":0.00024809237,"about_ca_system_score_gemma":0.00006870111,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W3101985270","doi":"10.1109/twc.2015.2500578","title":"Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":177,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Precoding; Artificial noise; Telecommunications link; Base station; MIMO; Data transmission; Zero-forcing precoding; Polynomial; Ergodic theory","score_opus":0.09114750185726761,"score_gpt":0.3124666539971344,"score_spread":0.2213191521398668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101985270","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.24550067,0.0029604963,0.7441327,0.0012466077,0.0004221449,0.0013269484,0.00095931685,0.0010957348,0.002355365],"genre_scores_gemma":[0.98757684,0.002282043,0.009828116,0.0000110795845,0.000014703037,0.00015857292,0.00006798216,0.00004624707,0.000014413536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985606,0.00022280662,0.0006023252,0.00022010144,0.00020315553,0.00019102472],"domain_scores_gemma":[0.9957744,0.0003499912,0.00010342986,0.0035110211,0.00014675898,0.000114392715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000461382,0.00019039262,0.00032145332,0.00035036242,0.00012024697,0.000042497344,0.0016695957,0.0001668574,0.0000045821207],"category_scores_gemma":[0.000014135064,0.0002234456,0.000036767884,0.0005084781,0.00020832763,0.000467715,0.000044088727,0.0006107303,0.000009553092],"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.00025603833,0.003853368,0.000984607,0.0012703806,0.00074191147,0.000011032215,0.03441878,0.6807866,0.055934515,0.028853707,0.0027383668,0.1901507],"study_design_scores_gemma":[0.0003708933,0.000042294025,0.00005418776,0.00029959265,0.000038045768,0.000007338344,0.0015081727,0.9842048,0.011019059,0.00024095444,0.0019243544,0.00029030186],"about_ca_topic_score_codex":0.00023438841,"about_ca_topic_score_gemma":0.00090285327,"teacher_disagreement_score":0.74207616,"about_ca_system_score_codex":0.00012759895,"about_ca_system_score_gemma":0.000068665315,"threshold_uncertainty_score":0.9111847},"labels":[],"label_agreement":null},{"id":"W3107219844","doi":"10.1109/tifs.2020.3040877","title":"Secure Content Delivery in Two-Tier Cache-Enabled mmWave Heterogeneous Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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; University of Windsor","funders":"Xidian University; Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Base station; Throughput; Transmission (telecommunications); Resource allocation; Stochastic geometry; Artificial noise; Secrecy; Heterogeneous network; Wireless network; Wireless; Telecommunications; Channel (broadcasting); Transmitter; Computer security","score_opus":0.018655546970566043,"score_gpt":0.21428125752509386,"score_spread":0.19562571055452782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107219844","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.27440158,0.00029877227,0.72231126,0.00036590485,0.00024763247,0.0005382001,0.00010248654,0.0006418416,0.0010923173],"genre_scores_gemma":[0.9975414,0.0008359592,0.00070295687,0.0007846547,0.000021291393,0.00005326816,0.00003975988,0.000018779145,0.0000018850061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898094,0.000038407787,0.000469812,0.000115900075,0.00017051716,0.00022441562],"domain_scores_gemma":[0.9993979,0.00005096602,0.000062311345,0.00024180481,0.00010538338,0.00014166864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117442534,0.00020590528,0.00023389747,0.0001375486,0.000109389526,0.00009332712,0.00014733738,0.00013417953,0.00003336028],"category_scores_gemma":[0.0000040303967,0.00022476661,0.00007749325,0.00025881012,0.000057545356,0.0007206968,0.0000048909305,0.00055851217,0.000017698769],"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.000146011,0.00006638464,0.00010099268,0.00021448165,0.00012173234,0.000007222019,0.019600222,0.93525726,0.00016685783,0.0024700726,0.0013618866,0.040486902],"study_design_scores_gemma":[0.00083130517,0.00006877822,0.000049063205,0.00004160142,0.000017564525,0.000011037765,0.00044649432,0.98727316,0.0057218093,0.00044549716,0.004793612,0.00030006873],"about_ca_topic_score_codex":0.000100749014,"about_ca_topic_score_gemma":0.00020634255,"teacher_disagreement_score":0.7231399,"about_ca_system_score_codex":0.000082625884,"about_ca_system_score_gemma":0.000015095712,"threshold_uncertainty_score":0.9165717},"labels":[],"label_agreement":null},{"id":"W3107998045","doi":"10.1049/iet-com.2019.1344","title":"Impact of antenna correlation on the physical layer security of cooperative relaying with OSTBC system","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Physical layer; Computer science; Antenna (radio); Telecommunications; Computer security; Wireless","score_opus":0.037455460577610636,"score_gpt":0.2867812665103328,"score_spread":0.2493258059327222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107998045","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.97266835,0.0003436052,0.010878236,0.0017616138,0.000015278427,0.00069628155,0.00012773898,0.0005544745,0.012954404],"genre_scores_gemma":[0.9987724,0.0001264672,0.00093800697,0.000027001905,0.0000108816275,0.00006228128,0.000034268887,0.000027134956,0.00000158299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910915,0.00023986613,0.0002921701,0.00009147539,0.00016665639,0.000100653975],"domain_scores_gemma":[0.9972596,0.00061819964,0.00014613318,0.0016834344,0.0002468848,0.000045721514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014854636,0.00013626432,0.00025168064,0.000046919686,0.00012338634,0.00001551402,0.0009473969,0.00005541995,0.000007649519],"category_scores_gemma":[0.00007350824,0.00009624769,0.00009399778,0.00047368533,0.00019863999,0.00012604192,0.00016845365,0.0004560004,0.00001018239],"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.00031872652,0.0013540101,0.01595018,0.0006062871,0.0015168564,0.00000201706,0.123086214,0.09253619,0.13000761,0.62807894,0.0049391487,0.0016038179],"study_design_scores_gemma":[0.00033255634,0.0004108857,0.005477974,0.00040607736,0.00005839473,0.0000038799853,0.0022156409,0.9806822,0.009754949,0.00016912441,0.00026109998,0.00022721682],"about_ca_topic_score_codex":0.00006583788,"about_ca_topic_score_gemma":0.000016482802,"teacher_disagreement_score":0.88814604,"about_ca_system_score_codex":0.000080718055,"about_ca_system_score_gemma":0.000037751448,"threshold_uncertainty_score":0.3924867},"labels":[],"label_agreement":null},{"id":"W3119183140","doi":"10.1109/tvt.2021.3050104","title":"Exploiting Deep Learning for Secure Transmission in an Underlay Cognitive Radio Network","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":28,"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":"Chongqing Jiaotong University; Government of Jiangsu Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Cognitive radio; Wireless network; Transmitter; Transmitter power output; Computer network; Underlay; Wireless; Computer engineering; Channel (broadcasting); Signal-to-noise ratio (imaging); Telecommunications","score_opus":0.015285207136821029,"score_gpt":0.2567035649860879,"score_spread":0.24141835784926685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119183140","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.17530815,0.0010677791,0.82117134,0.00026271565,0.00008081271,0.00031672334,0.000003979625,0.0017102559,0.00007822223],"genre_scores_gemma":[0.979566,0.0007416014,0.019139959,0.000043995446,0.000024813873,0.00036458773,0.000025316505,0.00007964021,0.000014080999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874085,0.00011512684,0.00032443067,0.00032142937,0.00011492196,0.00038323808],"domain_scores_gemma":[0.999225,0.00018560149,0.000038966886,0.00036629965,0.00012496383,0.00005916949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001795594,0.00021645974,0.0002939682,0.00035537218,0.000219541,0.000030041841,0.00023820187,0.00050092395,0.000032728018],"category_scores_gemma":[0.000013123758,0.0002674188,0.00010736702,0.00084071176,0.00007253877,0.00017676024,0.0000023621087,0.0010612201,0.0000053252247],"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.000036667672,0.00022229114,0.000066820416,0.00010385646,0.0001041535,0.000047292047,0.001164413,0.64324325,0.037016958,0.0011298934,0.000012188105,0.31685224],"study_design_scores_gemma":[0.001217379,0.00024591855,0.00005560521,0.00047604693,0.00007370282,0.00007572036,0.0027632508,0.5379947,0.45001006,0.0033833086,0.0031397948,0.0005645274],"about_ca_topic_score_codex":0.0000030789608,"about_ca_topic_score_gemma":0.00016358573,"teacher_disagreement_score":0.80425787,"about_ca_system_score_codex":0.000118042975,"about_ca_system_score_gemma":0.000026320959,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W3120362878","doi":"10.36227/techrxiv.13571078.v1","title":"On A Class of Time-Varying Gaussian ISI Channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Columbia College","funders":"","keywords":"Mathematics; Upper and lower bounds; Gaussian; Matrix (chemical analysis); Intersymbol interference; Additive white Gaussian noise; Combinatorics; Eigenvalues and eigenvectors; Topology (electrical circuits); Mathematical analysis; Algorithm; Decoding methods; Statistics; Physics; White noise","score_opus":0.018823225519750228,"score_gpt":0.25689325363436527,"score_spread":0.23807002811461503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120362878","genre_codex":"other","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.16818206,0.0022749593,0.093904465,0.0010263796,0.0009936998,0.0012534563,0.00006962473,0.006212872,0.7260825],"genre_scores_gemma":[0.9880935,0.00053289026,0.010723581,0.00006461961,0.000041364507,0.00007724211,0.00010933224,0.000070252965,0.00028720318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893034,0.00005948153,0.00038696104,0.00023574993,0.0002140634,0.00017338614],"domain_scores_gemma":[0.99821943,0.000106958796,0.00008265675,0.001454697,0.000081385726,0.000054862892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001548036,0.00024940187,0.00043695603,0.0002015858,0.000025960202,0.00006406715,0.00064803095,0.00037134593,0.00057216815],"category_scores_gemma":[0.000031994114,0.00027419862,0.00015250352,0.00013130579,0.000030857387,0.000054238626,0.00069251854,0.0007648145,0.000040883788],"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.0000566816,0.0010359407,0.000099798766,0.008487208,0.0020173148,0.000086669075,0.013573885,0.6939779,0.08897219,0.08920763,0.058279708,0.044205073],"study_design_scores_gemma":[0.00029523275,0.000055500303,0.000067565365,0.0030180924,0.000049630966,0.000007778375,0.00013031863,0.5112374,0.472964,0.0060571856,0.0049367584,0.0011805362],"about_ca_topic_score_codex":0.000053878302,"about_ca_topic_score_gemma":0.0000097098455,"teacher_disagreement_score":0.8199115,"about_ca_system_score_codex":0.000093555245,"about_ca_system_score_gemma":0.000029951134,"threshold_uncertainty_score":0.99997103},"labels":[],"label_agreement":null},{"id":"W3120880522","doi":"10.1109/cdc42340.2020.9303941","title":"Optimality of Stationary and Deterministic Policies for Zero-Delay Coding of ℝ<sup>d</sup>-Valued Linear Markov Sources with Quadratic Cost","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Markov chain; Markov process; Alphabet; Mathematics; Markov model; Discrete mathematics; Coding (social sciences); Zero (linguistics); Markov decision process; Mathematical optimization; Combinatorics; Applied mathematics; Algorithm; Statistics","score_opus":0.030826036854486098,"score_gpt":0.27658631164595965,"score_spread":0.24576027479147355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120880522","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.5413474,0.00013307441,0.45648736,0.0002165116,0.000004324945,0.000583897,0.000108802626,0.00028291266,0.00083573925],"genre_scores_gemma":[0.8871705,0.000046718862,0.11259204,0.00007587481,0.000008964529,0.000048288908,0.000023036631,0.000024291989,0.000010310541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923927,0.000039093276,0.00036034128,0.0001120436,0.00012943393,0.00011983733],"domain_scores_gemma":[0.9991627,0.00034681294,0.000087498855,0.0002305362,0.00010957136,0.00006289546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014092951,0.0001260513,0.00028041666,0.000060779475,0.000042473293,0.000014655072,0.00018096222,0.00005009698,0.000014595221],"category_scores_gemma":[0.000087296925,0.00011586921,0.000032926895,0.00012851432,0.00013669755,0.00011050802,0.00005921741,0.00008115073,4.130292e-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.0018353362,0.0007250585,0.029403403,0.025318211,0.0016425324,0.000014831958,0.15408663,0.547074,0.0716126,0.14118351,0.006344826,0.020759042],"study_design_scores_gemma":[0.00037491237,0.00021958534,0.00055142393,0.000094395626,0.000037554924,0.0000038139042,0.0009453758,0.9799334,0.01718305,0.00022044129,0.00027591138,0.00016016368],"about_ca_topic_score_codex":0.000041383697,"about_ca_topic_score_gemma":0.0000064318588,"teacher_disagreement_score":0.43285933,"about_ca_system_score_codex":0.000015068782,"about_ca_system_score_gemma":0.00002401047,"threshold_uncertainty_score":0.47250092},"labels":[],"label_agreement":null},{"id":"W3121050167","doi":"10.1109/tit.2021.3049309","title":"Boundary of the Gaussian Han-Kobayashi Rate Region","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary (topology); Gaussian; Mathematics; Interference (communication); Function (biology); Envelope (radar); Combinatorics; Channel (broadcasting); Topology (electrical circuits); Applied mathematics; Mathematical analysis; Computer science; Physics; Telecommunications","score_opus":0.00927483194062176,"score_gpt":0.21333466880189694,"score_spread":0.20405983686127518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121050167","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.014808731,0.00007637794,0.9667571,0.00035617163,0.0004742236,0.00017521445,0.000026697035,0.0004596358,0.016865859],"genre_scores_gemma":[0.9986949,0.00023652095,0.000516632,0.00027420532,0.000008268789,0.00004280025,0.000007757102,0.00001346599,0.0002054442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991983,0.00014796843,0.00034939538,0.00005155372,0.00014399289,0.0001087956],"domain_scores_gemma":[0.9990238,0.00011374198,0.00007780769,0.000667864,0.00008564195,0.000031122127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025069359,0.000106692896,0.00011125559,0.000114522554,0.00016753917,0.00004863281,0.0002577944,0.00009255062,0.00008779413],"category_scores_gemma":[0.000011750287,0.00009410575,0.0001077535,0.0003474646,0.0000971701,0.00068511383,0.0000025457582,0.0002896627,0.000046744874],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000249014,0.00042642673,0.000032738197,0.0010104589,0.0005518424,0.000004701941,0.028571302,0.18908995,0.028679801,0.19675525,0.009588429,0.5450401],"study_design_scores_gemma":[0.00039954542,0.00002464181,0.00041161274,0.00019259282,0.00003582807,0.000034289682,0.0010675765,0.009261743,0.9439275,0.011251618,0.03312934,0.00026367436],"about_ca_topic_score_codex":0.00000291973,"about_ca_topic_score_gemma":0.000008741834,"teacher_disagreement_score":0.9838862,"about_ca_system_score_codex":0.00007067746,"about_ca_system_score_gemma":0.00005592153,"threshold_uncertainty_score":0.38375214},"labels":[],"label_agreement":null},{"id":"W3121629650","doi":"","title":"Spinal Codes Optimization: Error Probability Analysis and Transmission Scheme Design.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Windsor","funders":"","keywords":"Decoding methods; Additive white Gaussian noise; Computer science; Algorithm; Transmission (telecommunications); Transmitter; Binary symmetric channel; Channel (broadcasting); Concatenated error correction code; Block code; Low-density parity-check code; Telecommunications","score_opus":0.08811534099770948,"score_gpt":0.20952286676390194,"score_spread":0.12140752576619246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121629650","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.16373807,0.000546279,0.834468,0.00003739795,0.000025878817,0.00028808473,0.000009766269,0.0006046094,0.00028192668],"genre_scores_gemma":[0.83094853,0.0017105605,0.16718553,0.000007948206,0.000009626539,0.0000036036895,0.00008027439,0.000023817054,0.000030110099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987232,0.00020231077,0.00023701746,0.0005734341,0.00007561646,0.0001884171],"domain_scores_gemma":[0.99853146,0.000058179678,0.00008705119,0.0010107096,0.00017955794,0.00013304088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002592932,0.00028633812,0.00044983655,0.00031867204,0.00010670258,0.000093657094,0.00050676934,0.0003601292,0.00013014492],"category_scores_gemma":[0.000019434738,0.00036447714,0.00019887187,0.0009231012,0.00012373492,0.00020580422,0.00039396534,0.0005463507,0.0000014200419],"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.000022250615,0.000047457783,0.0013096457,0.00023359025,0.000393111,0.000019844552,0.00015390491,0.99664503,0.000114700044,0.00065553485,0.000016153772,0.00038875005],"study_design_scores_gemma":[0.0001400611,0.00001809485,0.0009293843,0.00012544192,0.00045838216,0.0000014888714,0.00006500234,0.99547255,0.0012027263,0.0011600987,0.000065487504,0.00036129617],"about_ca_topic_score_codex":0.000060317696,"about_ca_topic_score_gemma":0.000037276317,"teacher_disagreement_score":0.66728246,"about_ca_system_score_codex":0.00018297766,"about_ca_system_score_gemma":0.00006983722,"threshold_uncertainty_score":0.99988073},"labels":[],"label_agreement":null},{"id":"W3123137409","doi":"10.1109/tit.2021.3053166","title":"Rate Splitting and Successive Decoding for Gaussian Interference Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Interference (communication); Gaussian; List decoding; Mathematics; Sequential decoding; Coding (social sciences); Algorithm; Dirty paper coding; Joint (building); Computer science; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Statistics; Block code; Combinatorics; Concatenated error correction code; Precoding; MIMO; Physics","score_opus":0.013263367387529885,"score_gpt":0.24525816857805932,"score_spread":0.23199480119052943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123137409","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.009624668,0.000052986976,0.9870929,0.000117175376,0.00026938194,0.00019297091,0.000034556466,0.0004175997,0.0021977404],"genre_scores_gemma":[0.9945045,0.00018958074,0.004872251,0.000168636,0.000013718527,0.00016317189,0.000015380238,0.00001355387,0.000059200906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940354,0.000053243333,0.00028310655,0.00007104254,0.000056411493,0.00013268163],"domain_scores_gemma":[0.99917996,0.0003840296,0.00005313456,0.00022732982,0.00010922147,0.00004634048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031688862,0.00011085475,0.000113077214,0.00015185808,0.0001731499,0.00012763779,0.0001172397,0.000073204435,0.00005363385],"category_scores_gemma":[0.00002758066,0.00012266237,0.00004490775,0.00013968424,0.00003420209,0.0009822443,0.000002221714,0.0001797908,0.000015622752],"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.00013987836,0.00006507999,0.0000045763272,0.0008108275,0.00019544893,0.0000015362989,0.01950149,0.06326586,0.008296236,0.12781584,0.00035974727,0.77954346],"study_design_scores_gemma":[0.000626713,0.000049695933,0.000016295297,0.0003170952,0.00003169458,0.000017145709,0.002832414,0.31164056,0.6684175,0.0128003275,0.002858785,0.0003917467],"about_ca_topic_score_codex":0.0000013153848,"about_ca_topic_score_gemma":0.0000037055609,"teacher_disagreement_score":0.98487985,"about_ca_system_score_codex":0.000048947342,"about_ca_system_score_gemma":0.000017999313,"threshold_uncertainty_score":0.5002026},"labels":[],"label_agreement":null},{"id":"W3132719608","doi":"10.1109/globecom42002.2020.9348134","title":"Physical-Layer Security for Cognitive Radio Networks over Cascaded Rayleigh Fading Channels","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Secrecy; Cognitive radio; Rayleigh fading; Fading; Transmitter; Computer science; Computer network; Channel (broadcasting); Physical layer; Underlay; Path loss; Topology (electrical circuits); Electronic engineering; Telecommunications; Signal-to-noise ratio (imaging); Computer security; Wireless; Engineering; Electrical engineering","score_opus":0.030170041906387897,"score_gpt":0.27460626160624724,"score_spread":0.24443621969985935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132719608","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.31186932,0.0005883132,0.67309946,0.00074814376,0.00019373187,0.0013375917,0.000051789455,0.0036763127,0.008435326],"genre_scores_gemma":[0.9974298,0.000106785374,0.0010900005,0.00058337743,0.00044858598,0.000203815,0.000042959444,0.00006991675,0.000024751589],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909604,0.00003616262,0.00021132774,0.00022494928,0.00012539758,0.0003061418],"domain_scores_gemma":[0.9991863,0.00031610928,0.000038346894,0.00023736319,0.00007772383,0.00014416802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009049875,0.00021595556,0.0003033139,0.000043112348,0.0000801963,0.000059652488,0.00029391848,0.00012741335,0.000080109734],"category_scores_gemma":[0.000055155837,0.0002256369,0.00013712038,0.00023383224,0.000039171646,0.00023062412,0.00009711061,0.00033235663,0.00001665504],"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.0005674825,0.00085641246,0.00078166486,0.0017643875,0.0023674553,0.000041072468,0.110947736,0.1469526,0.066688634,0.12011961,0.5202674,0.02864551],"study_design_scores_gemma":[0.0005301814,0.00004720654,0.000042627777,0.00004113566,0.000029679892,0.0000014147989,0.00013993736,0.9116872,0.08030643,0.0010223537,0.0058191903,0.0003326248],"about_ca_topic_score_codex":0.000010863524,"about_ca_topic_score_gemma":0.0000034791028,"teacher_disagreement_score":0.7647346,"about_ca_system_score_codex":0.00004740262,"about_ca_system_score_gemma":0.0000073705332,"threshold_uncertainty_score":0.9201206},"labels":[],"label_agreement":null},{"id":"W3133005020","doi":"10.1016/j.phycom.2021.101293","title":"Power allocation and scaling law analysis for secured and energy efficient URLLC IoT networks","year":2021,"lang":"en","type":"article","venue":"Physical Communication","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Throughput; Internet of Things; Scaling; Reliability (semiconductor); Efficient energy use; Transmitter power output; Optimization problem; Power (physics); Computer network; Algorithm; Telecommunications; Wireless; Computer security; Mathematics","score_opus":0.009086286853525983,"score_gpt":0.24172725304885326,"score_spread":0.2326409661953273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133005020","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.489088,0.0075475615,0.49830383,0.0012998516,0.000029385568,0.00021190911,0.000013555405,0.00064132403,0.0028645797],"genre_scores_gemma":[0.992756,0.0006260607,0.006155523,0.00011978363,0.000018923058,0.00009753033,0.00019482104,0.000023704682,0.000007625568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992948,0.00011564117,0.00019566715,0.00016370718,0.00009547272,0.00013472194],"domain_scores_gemma":[0.99856925,0.00033897473,0.00005019874,0.0008367893,0.00014684042,0.000057941234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015994144,0.00012274935,0.00021984924,0.000060995095,0.00017640037,0.00008452808,0.00020879351,0.00007321461,0.000002983203],"category_scores_gemma":[0.000021974904,0.00014044772,0.00007069249,0.00038316823,0.00009100107,0.00006897583,0.00016816215,0.00014918,4.9547197e-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.000018488532,0.0002758871,0.00014873769,0.00006390667,0.000525188,2.6861238e-7,0.0026324538,0.23387735,0.012406475,0.7361709,0.00021477383,0.013665579],"study_design_scores_gemma":[0.000151398,0.000008337576,0.00080635486,0.000022201333,0.00011114592,8.600565e-7,0.00008763028,0.9853598,0.0065427613,0.0029180422,0.0038312704,0.00016022881],"about_ca_topic_score_codex":0.000041848536,"about_ca_topic_score_gemma":0.00010380437,"teacher_disagreement_score":0.7514824,"about_ca_system_score_codex":0.000039975886,"about_ca_system_score_gemma":0.0000060024536,"threshold_uncertainty_score":0.57272923},"labels":[],"label_agreement":null},{"id":"W3133347211","doi":"10.1109/globecom42002.2020.9348194","title":"Nearest APs-Based Downlink Pilot Transmission for High Secrecy Rates in Cell-Free Massive MIMO","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Telecommunications link; Information leakage; Computer science; MIMO; Secrecy; Beamforming; Spoofing attack; Transmission (telecommunications); Computer network; Channel (broadcasting); Algorithm; Electronic engineering; Telecommunications; Engineering; Computer security","score_opus":0.02498070245898787,"score_gpt":0.2475656009259756,"score_spread":0.22258489846698773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133347211","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.089332364,0.0008049498,0.8789419,0.019571442,0.000085677675,0.0017771963,0.00010369349,0.0032022689,0.006180503],"genre_scores_gemma":[0.9290219,0.000115159164,0.06999566,0.00049641525,0.000032774096,0.00016870582,0.0000958491,0.0000493925,0.000024141287],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991483,0.000040807492,0.0002966559,0.00018639478,0.000114938455,0.00021287889],"domain_scores_gemma":[0.9991361,0.00021257966,0.00002892117,0.00045733657,0.000049571016,0.00011552347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009529408,0.0001757796,0.00021571298,0.00006711278,0.00004161124,0.000040113075,0.00056451594,0.0001001483,0.0001698442],"category_scores_gemma":[0.000036691235,0.00017454494,0.00005305083,0.00023994481,0.000024642612,0.000114411865,0.000044720557,0.00023523478,0.000016664522],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081789476,0.000921884,0.0014428339,0.0033825922,0.00008940927,0.000029740686,0.00415302,0.08658665,0.74632066,0.033885267,0.085586436,0.036783602],"study_design_scores_gemma":[0.0019320297,0.00027459112,0.00035203155,0.000077271485,0.000009670517,1.8875657e-7,0.000075913355,0.32046428,0.6570085,0.0023260212,0.017118638,0.00036086346],"about_ca_topic_score_codex":0.00008458534,"about_ca_topic_score_gemma":0.000058561043,"teacher_disagreement_score":0.83968955,"about_ca_system_score_codex":0.000048536876,"about_ca_system_score_gemma":0.000033345135,"threshold_uncertainty_score":0.71177363},"labels":[],"label_agreement":null},{"id":"W3133741277","doi":"10.23977/acss.2021.050102","title":"Secure Lossy Transmission over Wiretap Channels with Side Information and State Information","year":2021,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information leakage; Lossy compression; Entropy (arrow of time); Code rate; Algorithm; Computer science; Channel (broadcasting); Transmission (telecommunications); Information theory; Rate–distortion theory; Mathematics; Channel state information; Source code; Statistics; Telecommunications; Decoding methods; Wireless; Data compression","score_opus":0.0054582575366588755,"score_gpt":0.2152779243701899,"score_spread":0.209819666833531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133741277","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.1554944,0.011014043,0.8325222,0.00004375167,0.00013665721,0.00026556948,0.000011673915,0.00018664078,0.0003250731],"genre_scores_gemma":[0.9889509,0.006298066,0.0045830933,0.000068594796,0.000022201531,0.000030418554,0.000036477784,0.000007665188,0.0000025710738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992701,0.000045845976,0.00034496965,0.00007600335,0.00014148843,0.00012163191],"domain_scores_gemma":[0.99959385,0.00005765005,0.000068541674,0.0001553509,0.00007704139,0.000047543614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014516673,0.00012361153,0.00018792301,0.00009880765,0.000042407737,0.00019806712,0.00007465425,0.000054447853,0.000001968575],"category_scores_gemma":[0.00000198694,0.000108953296,0.000011946661,0.00015189673,0.000023663106,0.002870692,0.000033695647,0.00012211902,0.0000012561006],"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.00002892919,0.000019957191,0.0015751376,0.002141731,0.000040013685,0.000009685982,0.014225425,0.41915497,0.00037122218,0.0016695762,0.00016941284,0.56059396],"study_design_scores_gemma":[0.00050268334,0.00006063556,0.0008428047,0.0007857896,0.0000039912848,0.000049391652,0.00016530935,0.93964046,0.0016808874,0.00045693576,0.055566423,0.00024471013],"about_ca_topic_score_codex":0.000014719444,"about_ca_topic_score_gemma":0.000010510915,"teacher_disagreement_score":0.8334565,"about_ca_system_score_codex":0.000021223485,"about_ca_system_score_gemma":0.0000114991135,"threshold_uncertainty_score":0.44429862},"labels":[],"label_agreement":null},{"id":"W3136372906","doi":"10.1109/tcomm.2021.3065980","title":"Lightweight Continuous Authentication via Intelligently Arranged Pseudo-Random Access in 5G-and-Beyond","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Random access; Cryptography; Authentication (law); Overhead (engineering); Transceiver; Distributed computing; Computer engineering; Wireless; Computer security; Telecommunications","score_opus":0.025724177900297625,"score_gpt":0.28288387184848235,"score_spread":0.2571596939481847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136372906","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.03632286,0.0027795979,0.9396492,0.0049374467,0.00035318956,0.00084264774,0.00007238775,0.0013575238,0.013685124],"genre_scores_gemma":[0.98171264,0.009565128,0.0077944663,0.00016267676,0.000011988207,0.00048014542,0.00004935521,0.000057547393,0.00016606344],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984125,0.00029264303,0.000591949,0.0002635059,0.00018775198,0.00025167415],"domain_scores_gemma":[0.996483,0.0005467194,0.000072417584,0.0026158695,0.00017629655,0.000105662766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027846624,0.00024011912,0.0003298247,0.00037158892,0.00029969562,0.00016239162,0.0012070838,0.00017807787,0.00012234703],"category_scores_gemma":[0.000016665392,0.00028672873,0.0001104484,0.00080503424,0.0001791565,0.00044804873,0.000021662072,0.0007690584,0.000056380395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025548626,0.0073513705,0.0008772663,0.00064051134,0.0013089331,0.000035993566,0.03291694,0.020646088,0.27825862,0.031111773,0.0029471077,0.6236499],"study_design_scores_gemma":[0.0029385053,0.00009307872,0.0024538452,0.0004900699,0.00026541084,0.00011111917,0.0011763654,0.26033238,0.69050086,0.012695984,0.02735781,0.0015845749],"about_ca_topic_score_codex":0.0000812732,"about_ca_topic_score_gemma":0.0014088532,"teacher_disagreement_score":0.94538975,"about_ca_system_score_codex":0.00015132081,"about_ca_system_score_gemma":0.000046382527,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W3136561982","doi":"10.1109/tit.2021.3138769","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Discrete mathematics; Markov process; Zero (linguistics); Coding (social sciences); Combinatorics; Algorithm; Statistics","score_opus":0.01219420957808383,"score_gpt":0.24095987537929608,"score_spread":0.22876566580121224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136561982","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.19993189,0.00015215101,0.79733473,0.000021586296,0.000055576467,0.0001865934,0.00055508077,0.00015541776,0.0016070002],"genre_scores_gemma":[0.96926343,0.0004922409,0.030074252,0.000036946894,0.0000041980957,0.000027551003,0.00006527532,0.000015811242,0.000020260708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984814,0.0002038857,0.0008397251,0.000092504524,0.0002587746,0.00012371854],"domain_scores_gemma":[0.9980225,0.0007941197,0.0002603448,0.00047452038,0.00039656166,0.000051964947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475026,0.00015867082,0.00033661845,0.00018871999,0.00011234947,0.000022639666,0.0001845836,0.00013003395,0.0001328583],"category_scores_gemma":[0.00005143861,0.00017849357,0.00010472915,0.00029281873,0.00030003686,0.0007454078,0.0000071562827,0.0002468947,0.0000033649305],"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.0004093186,0.00030890302,0.00008961327,0.0029253415,0.00042023958,0.0000011420137,0.02012737,0.9291094,0.012584721,0.014921942,0.00010416501,0.018997839],"study_design_scores_gemma":[0.00066004234,0.00010116313,0.0005431216,0.0003487052,0.000080046826,0.0000109228495,0.0023135392,0.24843183,0.7453045,0.0016361871,0.0002829286,0.00028699203],"about_ca_topic_score_codex":0.000029061042,"about_ca_topic_score_gemma":0.0000053836375,"teacher_disagreement_score":0.7693316,"about_ca_system_score_codex":0.000045281628,"about_ca_system_score_gemma":0.00007387232,"threshold_uncertainty_score":0.7278757},"labels":[],"label_agreement":null},{"id":"W3139172876","doi":"","title":"A Capacity-achieving One-way Key Agreement with Improved Finite Blocklength Analysis","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","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 Calgary","funders":"","keywords":"Key (lock); Pre-shared key; Computer science; Alice and Bob; Key-agreement protocol; Shared secret; Alice (programming language); Public-key cryptography; Cryptography; Key distribution; Computer security; Cryptographic protocol; Key generation; Protocol (science); Channel (broadcasting); Key exchange; Theoretical computer science; Computer network; Encryption","score_opus":0.010316707586200447,"score_gpt":0.21488181146293203,"score_spread":0.20456510387673157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139172876","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.05484461,0.000088572095,0.8867161,0.006783534,0.000051174553,0.0011771653,0.00036553253,0.0010396271,0.048933677],"genre_scores_gemma":[0.9958252,0.00029038952,0.0019499171,0.0010596452,0.000052956875,0.0005195105,0.00026402695,0.000013184713,0.000025193793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904525,0.000046048594,0.00040135754,0.00014022336,0.00024083612,0.00012625511],"domain_scores_gemma":[0.9990631,0.00021408644,0.00014019443,0.00027770526,0.0001932265,0.000111738314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024878595,0.00016614514,0.00016377533,0.00019392642,0.00015045461,0.00014586154,0.0003773572,0.00006751334,0.000118146054],"category_scores_gemma":[0.000039536837,0.00016263279,0.000059256123,0.000442537,0.00004162815,0.00072919397,0.000067300905,0.00022210243,0.00008743],"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.00014940654,0.000107968306,0.00017609539,0.00011482532,0.0012681815,1.7133398e-7,0.0070731686,0.0417029,0.0077262456,0.9301334,0.00013494106,0.011412692],"study_design_scores_gemma":[0.001256324,0.00028013228,0.0017892772,0.000101608945,0.000474565,0.000006036006,0.00080739986,0.7137589,0.03929138,0.002838919,0.23836899,0.0010264894],"about_ca_topic_score_codex":0.0000042162633,"about_ca_topic_score_gemma":0.0000045096995,"teacher_disagreement_score":0.94098055,"about_ca_system_score_codex":0.000066489534,"about_ca_system_score_gemma":0.000008737711,"threshold_uncertainty_score":0.6631972},"labels":[],"label_agreement":null},{"id":"W3139202565","doi":"","title":"A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Channel capacity; Upper and lower bounds; Symmetry (geometry); Simple (philosophy); Coding (social sciences); Channel (broadcasting); Computation; Mathematics; Channel code; Capacity planning; Computer science; Decoding methods; Algorithm; Statistics; Mathematical analysis; Telecommunications; Geometry","score_opus":0.020928615609263533,"score_gpt":0.253743228671858,"score_spread":0.23281461306259446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139202565","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.14649285,0.000073494084,0.81718844,0.00777851,0.000211488,0.0028511204,0.0020084986,0.0011888364,0.022206781],"genre_scores_gemma":[0.9958154,0.00011182709,0.0013404983,0.0010753383,0.00013502777,0.00097298477,0.00051702454,0.000015272195,0.000016611484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905145,0.00004194992,0.00045597026,0.00015461798,0.00016634962,0.00012963932],"domain_scores_gemma":[0.99904174,0.00029744563,0.00013935677,0.00020062625,0.00021526821,0.00010555759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004194323,0.00016031085,0.00013409977,0.00009244762,0.00020031711,0.00020072112,0.00025180992,0.00008684552,0.000013592588],"category_scores_gemma":[0.000119543634,0.00016851097,0.00003932587,0.0001138773,0.000060836766,0.0010871709,0.00005858874,0.00016194464,0.000032266464],"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.00012771453,0.000030533894,0.000006540949,0.000121903075,0.00005661372,3.3399857e-8,0.004872677,0.0027744665,0.0048367577,0.9800095,0.0009973558,0.0061659156],"study_design_scores_gemma":[0.0021032593,0.00014433754,0.0001627695,0.00005622815,0.00003724699,0.000014237095,0.00044048636,0.43630064,0.07015425,0.07232762,0.4176285,0.0006304558],"about_ca_topic_score_codex":0.0000045181982,"about_ca_topic_score_gemma":0.0000017041637,"teacher_disagreement_score":0.9076819,"about_ca_system_score_codex":0.000057689613,"about_ca_system_score_gemma":0.000006489878,"threshold_uncertainty_score":0.6871678},"labels":[],"label_agreement":null},{"id":"W3139528444","doi":"10.1109/tcomm.2021.3067058","title":"Covert Surveillance via Proactive Eavesdropping Under Channel Uncertainty","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Covert; Transmitter; False alarm; Real-time computing; Transmission (telecommunications); Channel (broadcasting); Wireless; Decoding methods; Computer security; Computer network; Artificial intelligence; Telecommunications","score_opus":0.030790753083949397,"score_gpt":0.26549407510601253,"score_spread":0.23470332202206312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139528444","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.0021079986,0.0007356996,0.98297274,0.002110413,0.00023746116,0.00032788626,0.00010552478,0.0013981004,0.01000418],"genre_scores_gemma":[0.98877496,0.0035917896,0.006692678,0.00020334224,0.000015893034,0.00034027346,0.000066337496,0.00006470104,0.00025003732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865013,0.0002655468,0.00036751418,0.00023673977,0.00020801491,0.000272057],"domain_scores_gemma":[0.9959732,0.00042995717,0.000055413217,0.003169377,0.00027161787,0.00010042192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001794882,0.00023548046,0.00025603035,0.00016085099,0.0004958724,0.0000707394,0.0009496288,0.00015420579,0.000083178],"category_scores_gemma":[0.000008662532,0.0002878507,0.00014248141,0.00068787916,0.00016793684,0.00024481036,0.000016302583,0.0007843085,0.00006827485],"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.00004391121,0.0019151458,0.000024735002,0.00013681402,0.001184009,0.0000071987893,0.0044100783,0.8723015,0.061295956,0.0080329655,0.0022183268,0.04842936],"study_design_scores_gemma":[0.0009966535,0.00008184895,0.00059195084,0.00022783774,0.00009555743,0.00009307432,0.0015070362,0.7008518,0.26163307,0.006415911,0.026091117,0.001414132],"about_ca_topic_score_codex":0.000082979794,"about_ca_topic_score_gemma":0.0010013751,"teacher_disagreement_score":0.986667,"about_ca_system_score_codex":0.0003139638,"about_ca_system_score_gemma":0.00008436624,"threshold_uncertainty_score":0.9999574},"labels":[],"label_agreement":null},{"id":"W3151935904","doi":"10.1109/iccspa49915.2021.9385753","title":"Cascaded κ-µ Fading Channels with Colluding Eavesdroppers: Physical-Layer Security Analysis","year":2021,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Secrecy; Fading; Channel (broadcasting); Transmitter; Computer science; Computer network; Physical layer; Topology (electrical circuits); Algorithm; Computer security; Wireless; Mathematics; Telecommunications; Combinatorics","score_opus":0.019721169903958877,"score_gpt":0.25963576370437685,"score_spread":0.23991459380041796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151935904","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.9010247,0.0002547943,0.064354785,0.0003118964,0.000051877243,0.00017556085,0.000010823249,0.0019343966,0.03188115],"genre_scores_gemma":[0.9953118,0.00009405416,0.004171603,0.00007367042,0.000057587727,0.000044809116,0.00002587846,0.00004142892,0.0001791582],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989664,0.000057775535,0.00019887113,0.00025525523,0.00023631987,0.00028536157],"domain_scores_gemma":[0.9989069,0.000096561955,0.000035505895,0.00072652777,0.00013389802,0.00010056759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010980565,0.00020441037,0.00038665417,0.000213916,0.000103018734,0.00011491392,0.00026305404,0.00008227735,0.00014816261],"category_scores_gemma":[0.000018873465,0.00019356109,0.00015125485,0.0017626608,0.000040900795,0.0002492316,0.00011015646,0.00028097114,0.000020443182],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006472366,0.0013050805,0.011965419,0.0007133313,0.017549891,0.00052486896,0.08685783,0.30823112,0.478319,0.0746609,0.011094792,0.008713075],"study_design_scores_gemma":[0.00021899675,0.000018873432,0.00023379778,0.00004534976,0.000291874,0.000013897009,0.0010030778,0.36701283,0.6283529,0.0005904551,0.0017733921,0.00044457967],"about_ca_topic_score_codex":0.000045739653,"about_ca_topic_score_gemma":0.00014507222,"teacher_disagreement_score":0.15003389,"about_ca_system_score_codex":0.00011454881,"about_ca_system_score_gemma":0.000021252083,"threshold_uncertainty_score":0.7893192},"labels":[],"label_agreement":null},{"id":"W3152904640","doi":"10.1109/tccn.2021.3074178","title":"Physical-Layer Security on Maximal Ratio Combining for SIMO Cognitive Radio Networks Over Cascaded κ-μ Fading Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"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":"Fading; Transmitter; Cognitive radio; Transmission (telecommunications); Computer science; Notation; Topology (electrical circuits); Algorithm; Mathematics; Computer network; Telecommunications; Channel (broadcasting); Combinatorics; Arithmetic; Wireless","score_opus":0.04295668249818185,"score_gpt":0.297516699221967,"score_spread":0.25456001672378514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152904640","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.056594186,0.00280165,0.9350363,0.00023709194,0.00048250883,0.0010254901,0.00016960119,0.0007305425,0.0029226006],"genre_scores_gemma":[0.9890156,0.008461802,0.0008020289,0.00036614118,0.00020644633,0.000836067,0.00016356912,0.00010873877,0.000039603834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981533,0.0003228958,0.00043725708,0.0004232868,0.00019844553,0.0004648081],"domain_scores_gemma":[0.9951482,0.00337922,0.000121594676,0.00082406314,0.00038154772,0.00014536596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030227343,0.00040344297,0.00046850904,0.0001978219,0.0011262766,0.0002079802,0.00039506578,0.00021598909,0.000025251318],"category_scores_gemma":[0.000020780659,0.0004867752,0.00021505954,0.0005790944,0.00024135689,0.00029597833,0.000028482114,0.0011115331,0.0000058986243],"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.00092651026,0.0040842267,0.00019148638,0.00048631174,0.0033883462,0.000035797657,0.026965939,0.10814936,0.006749111,0.010222852,0.0013791905,0.8374209],"study_design_scores_gemma":[0.0016643072,0.00020000475,0.00005075332,0.0013528086,0.00025386544,0.00001882285,0.0010078511,0.9655617,0.026136085,0.0010774449,0.0019905071,0.0006858588],"about_ca_topic_score_codex":0.00001254623,"about_ca_topic_score_gemma":0.00010167001,"teacher_disagreement_score":0.9342343,"about_ca_system_score_codex":0.00011932855,"about_ca_system_score_gemma":0.000037668924,"threshold_uncertainty_score":0.99975836},"labels":[],"label_agreement":null},{"id":"W3157275269","doi":"10.1109/jrfid.2021.3077756","title":"Securing the Inter-Spacecraft Links: Physical Layer Key Generation From Doppler Frequency Shift","year":2021,"lang":"en","type":"article","venue":"IEEE Journal of Radio Frequency Identification","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Key generation; Key (lock); Superposition principle; Computer science; Spacecraft; Physical layer; Doppler effect; Component (thermodynamics); Secrecy; Electronic engineering; Wireless; Telecommunications; Cryptography; Algorithm; Mathematics; Physics; Engineering; Aerospace engineering; Computer security","score_opus":0.027254790702024554,"score_gpt":0.26542979852174975,"score_spread":0.2381750078197252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157275269","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.8924647,0.0038904846,0.09837346,0.0028193658,0.0016673813,0.00017717028,0.000032641474,0.00020263786,0.00037214163],"genre_scores_gemma":[0.9919292,0.001084542,0.0051585706,0.000065555985,0.0015707258,0.000029231409,0.000057458998,0.000057920075,0.00004681461],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979392,0.0002358948,0.00093766267,0.00022762865,0.00043358337,0.00022601218],"domain_scores_gemma":[0.9977515,0.0001663376,0.0004609254,0.0009712997,0.00054765516,0.00010232088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005424455,0.00024020814,0.00033337847,0.00016266921,0.00016452595,0.0003149285,0.0007889535,0.00021310073,0.0000783926],"category_scores_gemma":[0.000107722815,0.00021307392,0.00021532326,0.00037926153,0.00009007662,0.000981595,0.000027893138,0.0010719107,0.00004775308],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029888115,0.00011212402,0.00045871607,0.000021876484,0.00015922777,0.00002188351,0.0033775545,0.00083744345,0.98278594,0.0051339814,0.005774014,0.0013142686],"study_design_scores_gemma":[0.00040692626,0.00004898628,0.005272049,0.0002085676,0.00013874035,0.00016360162,0.0002389913,0.0106448885,0.94293994,0.03730473,0.0022163992,0.00041615817],"about_ca_topic_score_codex":0.000056921333,"about_ca_topic_score_gemma":0.00021370045,"teacher_disagreement_score":0.09946446,"about_ca_system_score_codex":0.00031710794,"about_ca_system_score_gemma":0.00009745893,"threshold_uncertainty_score":0.8688902},"labels":[],"label_agreement":null},{"id":"W3157654480","doi":"10.1109/tcomm.2021.3077935","title":"Robust Deception Scheme for Secure Interference Exploitation Under PSK Modulations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of British Columbia","funders":"Key Science and Technology Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Deception; Channel state information; Transmission (telecommunications); Interference (communication); Artificial noise; Overhead (engineering); Channel (broadcasting); Precoding; Transmitter; Relaxation (psychology); Antenna (radio); Wireless; Computer network; Electronic engineering; Telecommunications; MIMO; Engineering","score_opus":0.09581227425649212,"score_gpt":0.2970397573741499,"score_spread":0.20122748311765776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157654480","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.004592476,0.0003840688,0.98914784,0.0020219695,0.00022499028,0.00045601605,0.0001524435,0.0011597733,0.0018604085],"genre_scores_gemma":[0.8349734,0.0016885691,0.16174556,0.000121272766,0.000018473085,0.0009831892,0.000197664,0.000060709594,0.00021117245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879813,0.00013558315,0.00044541337,0.00023851875,0.00015863802,0.00022368567],"domain_scores_gemma":[0.996519,0.00049110345,0.000066515146,0.0023844626,0.00045091388,0.000087976885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001572863,0.0002158668,0.0001989234,0.00022903724,0.0005596611,0.000103032115,0.0007522399,0.00017931765,0.00013488907],"category_scores_gemma":[0.000019415455,0.00027648633,0.00016268187,0.0005790112,0.000112203204,0.00044672817,0.000010959997,0.00050380395,0.000054005483],"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.000035665293,0.0013675495,0.000022639279,0.00017888314,0.00041487545,6.296721e-7,0.0039701955,0.8039456,0.082687676,0.05996785,0.0046757916,0.042732656],"study_design_scores_gemma":[0.00076356804,0.00007457512,0.00023817299,0.00023459728,0.00010676938,0.000016682121,0.0016871383,0.886618,0.08760584,0.010805819,0.01115939,0.00068943197],"about_ca_topic_score_codex":0.000011805819,"about_ca_topic_score_gemma":0.00063461566,"teacher_disagreement_score":0.8303809,"about_ca_system_score_codex":0.00022866372,"about_ca_system_score_gemma":0.000070403396,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W3157932900","doi":"10.48550/arxiv.2105.01448","title":"Securing the Inter-Spacecraft Links: Physical Layer Key Generation from Doppler Frequency Shift","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Key generation; Key (lock); Superposition principle; Computer science; Spacecraft; Physical layer; Doppler effect; Component (thermodynamics); Secrecy; Spectral density; Electronic engineering; Telecommunications; Wireless; Cryptography; Algorithm; Mathematics; Physics; Engineering; Aerospace engineering; Computer security","score_opus":0.07083171870248045,"score_gpt":0.20043514583755773,"score_spread":0.12960342713507728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157932900","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.8677884,0.00038609753,0.12834264,0.00028491777,0.00037790963,0.00028042158,0.000056867175,0.00088866876,0.0015940837],"genre_scores_gemma":[0.9970896,0.0007085003,0.0012230467,0.00006942053,0.00040887386,0.000009448406,0.00031577988,0.00007491406,0.00010036533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00017360052,0.00024015823,0.0006228139,0.000095850264,0.00028105438],"domain_scores_gemma":[0.9976112,0.00013375605,0.00012411193,0.0018999516,0.00012995771,0.00010101874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012726782,0.00040273272,0.00037841016,0.000121659905,0.00014719793,0.00020457094,0.0012929442,0.0005544892,0.00012982897],"category_scores_gemma":[0.000018991863,0.0004237717,0.00024331147,0.000293644,0.000112893715,0.00030705918,0.0012018718,0.0020611708,0.00005298616],"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.000038168888,0.0007791289,0.0058076642,0.00042364016,0.0020569144,0.00047720657,0.025654422,0.61818665,0.042972986,0.2943566,0.008142795,0.0011037951],"study_design_scores_gemma":[0.0004213802,0.000032901735,0.0014497266,0.00042798684,0.00022762023,0.0000034001691,0.0005925149,0.91874266,0.025185265,0.04939105,0.002281485,0.0012440012],"about_ca_topic_score_codex":0.0004834903,"about_ca_topic_score_gemma":0.0011678794,"teacher_disagreement_score":0.300556,"about_ca_system_score_codex":0.00030520957,"about_ca_system_score_gemma":0.000059550148,"threshold_uncertainty_score":0.9998214},"labels":[],"label_agreement":null},{"id":"W3161017057","doi":"10.1109/isit45174.2021.9517832","title":"Neural Computation of Capacity Region of Memoryless Multiple Access Channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Upper and lower bounds; Divergence (linguistics); Parameterized complexity; Mutual information; Boundary (topology); Kullback–Leibler divergence; Estimator; Channel (broadcasting); Mathematics; Set (abstract data type); Computation; Computer science; Algorithm; Applied mathematics; Topology (electrical circuits); Combinatorics; Mathematical analysis; Statistics; Telecommunications","score_opus":0.0887922708078204,"score_gpt":0.3008880704200598,"score_spread":0.21209579961223943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161017057","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.79535824,0.0002727611,0.20243615,0.000050532475,0.00029464264,0.00033865453,0.000013351585,0.00046016183,0.0007754883],"genre_scores_gemma":[0.9921219,0.00024192265,0.0074072606,0.000010050236,0.000024973342,0.00004599871,0.000106573214,0.00003617666,0.000005145589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.000103109836,0.00055003556,0.00019639809,0.00020631458,0.00011664777],"domain_scores_gemma":[0.9984819,0.00010652674,0.00024275287,0.0007855855,0.0003471105,0.00003608649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001384012,0.00019865087,0.00049666216,0.00018200254,0.0000171859,0.00004669673,0.00072286185,0.00027192864,0.000011302105],"category_scores_gemma":[0.000046050845,0.00023004414,0.00013771765,0.00016969399,0.000073721516,0.00017320804,0.0008202928,0.0004467625,2.897725e-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.000013699255,0.00021016049,0.0020673436,0.005359076,0.00020506144,0.000005197865,0.004355787,0.9654541,0.011518723,0.0005638749,0.0006949507,0.009552009],"study_design_scores_gemma":[0.0001454732,0.000008766919,0.0018276041,0.00042510784,0.000018538316,0.00000420942,0.00013604146,0.6879173,0.30870262,0.0005742312,0.000012633049,0.00022745876],"about_ca_topic_score_codex":0.0006796548,"about_ca_topic_score_gemma":0.00013281227,"teacher_disagreement_score":0.2971839,"about_ca_system_score_codex":0.000057573332,"about_ca_system_score_gemma":0.000024697076,"threshold_uncertainty_score":0.93809277},"labels":[],"label_agreement":null},{"id":"W3163348940","doi":"10.1109/icassp39728.2021.9414769","title":"Optimal Detection in the Presence of Non-Gaussian Jamming","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Gaussian; Detector; Transmitter; Channel (broadcasting); Algorithm; Additive white Gaussian noise; Gaussian noise; SIGNAL (programming language); Computer science; Transmission (telecommunications); Detection theory; Gaussian network model; Telecommunications; Physics","score_opus":0.011531288819310793,"score_gpt":0.2492841447967069,"score_spread":0.23775285597739612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163348940","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.8632363,0.00015961257,0.11006169,0.00021822844,0.00003751716,0.00011257864,7.226309e-7,0.00018658266,0.025986766],"genre_scores_gemma":[0.9872852,0.0000760002,0.012573322,0.000014120971,0.000006938492,0.000018353432,9.996184e-7,0.0000056451886,0.00001941237],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996688,0.00003214008,0.00011562962,0.00004653927,0.00007329855,0.00006360695],"domain_scores_gemma":[0.99957055,0.00006934979,0.000011040906,0.00032001242,0.000021356656,0.000007711572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013549134,0.000038403574,0.00005592876,0.000036308164,0.000014312088,0.000012163363,0.00018358343,0.000032685173,0.000021585955],"category_scores_gemma":[0.000024953568,0.000032243675,0.000017622462,0.00020855218,0.0000144002,0.00007685274,0.000036700458,0.000119440454,0.000002336859],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008408617,0.00015455838,0.0013794221,0.0002456769,0.000035773264,0.000022552533,0.01797325,0.03830213,0.7558233,0.0057504824,0.0008712111,0.17943321],"study_design_scores_gemma":[0.00006173199,0.000010065253,0.0045836805,0.000030769337,0.0000018224662,0.000007837393,0.0011358364,0.13323477,0.859419,0.000086044165,0.0013653503,0.00006309588],"about_ca_topic_score_codex":0.000047417456,"about_ca_topic_score_gemma":0.00021915683,"teacher_disagreement_score":0.1793701,"about_ca_system_score_codex":0.0000134136035,"about_ca_system_score_gemma":0.0000059329923,"threshold_uncertainty_score":0.1314859},"labels":[],"label_agreement":null},{"id":"W3164808597","doi":"10.1109/tcomm.2023.3256415","title":"Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"","keywords":"Intersymbol interference; Computer science; Markov chain; Markov process; Nyquist ISI criterion; Mathematical optimization; Secrecy; Iterative method; Interference (communication); Algorithm; Mathematics; Decoding methods; Computer network; Channel (broadcasting); Statistics; Computer security","score_opus":0.06085588529188848,"score_gpt":0.28098068462304443,"score_spread":0.22012479933115595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164808597","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.048753016,0.00010515857,0.93858683,0.001154197,0.00045110696,0.00055868505,0.00035182762,0.003282113,0.006757048],"genre_scores_gemma":[0.9937391,0.0016121115,0.0040961406,0.000042846965,0.000009195328,0.0002969584,0.000042856755,0.000048459016,0.00011227622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987039,0.00017358597,0.0005355104,0.00017103141,0.0001702358,0.00024573674],"domain_scores_gemma":[0.9961617,0.0008533294,0.0000840361,0.00264179,0.00016701914,0.000092105096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027887535,0.0002199326,0.0002993725,0.0005243921,0.00022364879,0.000037005262,0.0016113041,0.00015016453,0.000110159825],"category_scores_gemma":[0.000026334024,0.00025920023,0.00015676297,0.0010170982,0.00042957018,0.00021335448,0.000021366359,0.0006917237,0.00014989875],"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.0001606595,0.0031534538,0.00018942881,0.0012461565,0.0022292675,0.000008238795,0.07091508,0.3676917,0.28712747,0.048317555,0.0067493813,0.21221161],"study_design_scores_gemma":[0.00066067174,0.00018234612,0.00016689133,0.0006210501,0.000087052795,0.000012897796,0.001342549,0.6881235,0.300764,0.0045081805,0.0027881225,0.000742685],"about_ca_topic_score_codex":0.000076054625,"about_ca_topic_score_gemma":0.00019632986,"teacher_disagreement_score":0.94498616,"about_ca_system_score_codex":0.00008995311,"about_ca_system_score_gemma":0.000036189747,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W3168665672","doi":"10.1109/vtc2021-spring51267.2021.9448800","title":"Multi-Antenna Covert Communication With Jamming in the Presence of a Mobile Warden","year":2021,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Jamming; Computer science; Eavesdropping; Transmitter power output; Transmitter; Computer network; Covert; Transmission (telecommunications); Throughput; Base station; Wireless; Telecommunications","score_opus":0.016048939123801786,"score_gpt":0.2533779745569612,"score_spread":0.23732903543315942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168665672","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.8869655,0.007353084,0.08746727,0.00075147924,0.00003202657,0.00097125757,0.000010671722,0.00069102185,0.015757678],"genre_scores_gemma":[0.9527858,0.001098677,0.045897085,0.000039799546,0.0000017695601,0.000111180954,0.0000091753045,0.000010500774,0.000046001624],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00010657086,0.00017410303,0.000064863925,0.00011616424,0.00008216082],"domain_scores_gemma":[0.9987372,0.00021358984,0.000026888229,0.00093235675,0.000079199795,0.000010742251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022488846,0.00006290317,0.000107557644,0.000035640467,0.000024176423,0.000018481864,0.0004951331,0.00003532136,0.000022400796],"category_scores_gemma":[0.000030029882,0.000046641806,0.000018945144,0.00024226739,0.00004595962,0.00010831712,0.00009517612,0.00016863423,0.000002581212],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100905265,0.0027067286,0.0529124,0.0014382122,0.00041262724,0.00007688629,0.21992925,0.036821652,0.538028,0.023805087,0.00933934,0.114428945],"study_design_scores_gemma":[0.0013486047,0.00012500377,0.018179458,0.0008513837,0.000029413352,0.000054435157,0.025164684,0.6838262,0.24840412,0.0003741395,0.021032777,0.00060976844],"about_ca_topic_score_codex":0.00015226871,"about_ca_topic_score_gemma":0.0008078616,"teacher_disagreement_score":0.64700454,"about_ca_system_score_codex":0.0000205567,"about_ca_system_score_gemma":0.000015637683,"threshold_uncertainty_score":0.19019976},"labels":[],"label_agreement":null},{"id":"W3180641914","doi":"10.1109/iccworkshops50388.2021.9473807","title":"Enhancing Secrecy Capacity in Alternate AF Relaying Networks with Inter-Relay Interference","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Relay; Secrecy; Fading; Artificial noise; Computer network; Wireless; Channel state information; Linear network coding; Electronic engineering; Channel (broadcasting); Physical layer; Telecommunications; Network packet; Power (physics); Engineering; Computer security","score_opus":0.023321866273442966,"score_gpt":0.2305318468967664,"score_spread":0.20720998062332344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180641914","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.46462262,0.00022361886,0.5244874,0.00006776012,0.00008044007,0.00007511221,7.521323e-7,0.0005848304,0.009857484],"genre_scores_gemma":[0.9779194,0.00028300905,0.021501048,0.00009015276,0.000022012791,0.000035607613,0.0000072208936,0.000036200974,0.00010537721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906576,0.00007324893,0.00031036267,0.00020066396,0.00009467901,0.00025526443],"domain_scores_gemma":[0.9991578,0.00010549765,0.00003412509,0.00057420734,0.00007065279,0.000057707246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043589,0.00016517521,0.00020914627,0.00009862115,0.000032378284,0.000068256806,0.00032461598,0.000098211836,0.00011806415],"category_scores_gemma":[0.000029273731,0.00016193677,0.000032583943,0.00031323737,0.000033388278,0.00024220117,0.0001722116,0.0006376176,0.0000115219045],"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.00017767296,0.0006593681,0.09792093,0.001094582,0.00072733354,0.000745904,0.045039423,0.42377287,0.26947036,0.059332363,0.0019038888,0.0991553],"study_design_scores_gemma":[0.0005317512,0.00005630904,0.0013768977,0.0015776355,0.000012470999,0.00010867659,0.000738691,0.5902165,0.4028597,0.00075071165,0.0010427859,0.00072784757],"about_ca_topic_score_codex":0.00018994731,"about_ca_topic_score_gemma":0.0047634197,"teacher_disagreement_score":0.5132968,"about_ca_system_score_codex":0.00014457163,"about_ca_system_score_gemma":0.000016820612,"threshold_uncertainty_score":0.66035897},"labels":[],"label_agreement":null},{"id":"W3181432070","doi":"10.1109/jiot.2021.3095126","title":"Reliability Benefit of Location-Based Relay Selection for Cognitive Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Hunan Province; China Scholarship Council; National Natural Science Foundation of China","keywords":"Relay; Reliability (semiconductor); Computer science; Transmission (telecommunications); Selection (genetic algorithm); Overhead (engineering); Computer network; Stochastic geometry; Reliability engineering; Telecommunications; Statistics; Mathematics; Artificial intelligence; Engineering; Power (physics)","score_opus":0.012058976060867959,"score_gpt":0.25469269226804975,"score_spread":0.2426337162071818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181432070","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.36854982,0.0004322231,0.6302565,0.00008076151,0.00027403413,0.00011913669,0.0000039986767,0.00009350433,0.00019000284],"genre_scores_gemma":[0.97390723,0.00012163834,0.025716878,0.0000659524,0.00006283021,0.000018728317,0.000011949693,0.000030942676,0.000063876876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883056,0.00006648512,0.000642638,0.00012340806,0.00018795932,0.00014894464],"domain_scores_gemma":[0.9974475,0.00047463103,0.00031253992,0.0002163653,0.0014944148,0.000054573655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065555616,0.00012439575,0.00025895637,0.00011474546,0.00004110104,0.000033622782,0.0002717681,0.00015654684,0.00004324955],"category_scores_gemma":[0.0003853373,0.00013516152,0.00015334648,0.00023512433,0.000060529434,0.00025884333,0.000024001733,0.00053749117,9.561741e-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.0003466271,0.00032295205,0.0044208677,0.00053448585,0.00034510624,0.0000029740404,0.0027728933,0.9449634,0.028562842,0.0008110652,0.0055840076,0.011332803],"study_design_scores_gemma":[0.0003648051,0.00009936232,0.0006188814,0.0006981521,0.000041996514,0.000034405577,0.00006416608,0.62217695,0.3749145,0.0005362309,0.00033445886,0.000116097675],"about_ca_topic_score_codex":0.000027878266,"about_ca_topic_score_gemma":0.000018649938,"teacher_disagreement_score":0.60535735,"about_ca_system_score_codex":0.00014228551,"about_ca_system_score_gemma":0.00006852956,"threshold_uncertainty_score":0.5511727},"labels":[],"label_agreement":null},{"id":"W3183480454","doi":"10.1109/twc.2021.3096818","title":"Joint Resource Allocation for Ultra-Reliable and Low-Latency Radio Access Networks With Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Latency (audio); Network packet; Computer network; Transmission delay; Edge computing; Distributed computing; Computation; Energy consumption; Low latency (capital markets); Computation offloading; Efficient energy use; Enhanced Data Rates for GSM Evolution; Packet loss; Telecommunications; Algorithm","score_opus":0.027171798796177593,"score_gpt":0.2615853206823602,"score_spread":0.23441352188618259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183480454","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.02298776,0.001161588,0.97125065,0.0012905938,0.00011026006,0.00072131725,0.00004160812,0.0011077647,0.0013284686],"genre_scores_gemma":[0.9737779,0.0041959314,0.021092549,0.00016160953,0.000029205505,0.0004266321,0.00012651489,0.0001075313,0.000082152146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845445,0.00012883982,0.00053853256,0.00033895468,0.00018308601,0.00035613845],"domain_scores_gemma":[0.99645156,0.0005063594,0.000116391326,0.0024660716,0.00031997086,0.00013967304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028753656,0.00030560468,0.00036825574,0.00020246254,0.00084449456,0.00023481825,0.0009958453,0.00019893091,0.000013726765],"category_scores_gemma":[0.0000073705805,0.00034081552,0.00010436016,0.00068877044,0.00023134453,0.00040121877,0.000019861498,0.0007304273,0.000003988474],"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.000060978546,0.0008630468,0.00012099066,0.00041350638,0.0004156472,0.000002903477,0.002048753,0.9007172,0.0147950025,0.0054671266,0.001660314,0.073434524],"study_design_scores_gemma":[0.00093075196,0.000075693715,0.00031874471,0.0006102794,0.000118114425,0.00004840961,0.0003615497,0.89816904,0.09378337,0.00016614667,0.00478006,0.0006378346],"about_ca_topic_score_codex":0.000043404147,"about_ca_topic_score_gemma":0.00028641865,"teacher_disagreement_score":0.9507901,"about_ca_system_score_codex":0.00015846262,"about_ca_system_score_gemma":0.00007706376,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W3189761152","doi":"10.1109/icc42927.2021.9500621","title":"Secrecy Analysis for Energy Harvesting-Enabled Cognitive Radio Networks in Cascaded Fading Channels","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Jamming; Secrecy; Fading; Cognitive radio; Computer science; Energy harvesting; Underlay; Computer network; Physical layer; Reliability (semiconductor); Maximum power transfer theorem; Channel (broadcasting); Wireless; Transmission (telecommunications); Electronic engineering; Energy (signal processing); Telecommunications; Signal-to-noise ratio (imaging); Power (physics); Computer security; Engineering; Mathematics; Statistics","score_opus":0.022508377810597505,"score_gpt":0.252766594393617,"score_spread":0.23025821658301948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189761152","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.037656464,0.0009530065,0.9549788,0.00006606582,0.00006577441,0.00014686782,0.00000781128,0.0006542194,0.0054709553],"genre_scores_gemma":[0.99192345,0.00032253578,0.0064526983,0.00010911815,0.000060144936,0.00022499685,0.0001931713,0.000039518858,0.0006743416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989701,0.000083205705,0.00033004762,0.00022143297,0.00008930198,0.0003059166],"domain_scores_gemma":[0.998928,0.00049394503,0.000040475425,0.0003166096,0.00015196115,0.00006899264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441912,0.00016245857,0.00036201926,0.0003215355,0.000060488484,0.00008545244,0.00019154498,0.00014763889,0.000096695374],"category_scores_gemma":[0.00012773134,0.00018971016,0.00014054264,0.0014195219,0.000019513127,0.00018668703,0.00007359449,0.00018446957,0.0000010935363],"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.000024291687,0.00011427479,0.0059355972,0.00010384865,0.00160809,0.000044256976,0.0019155411,0.94160855,0.0022617602,0.029786337,0.0008522293,0.015745249],"study_design_scores_gemma":[0.00038329102,0.0000096076255,0.0007541165,0.00007166781,0.00011168321,0.000004704199,0.00025210023,0.96245676,0.033729594,0.0008124206,0.0011411792,0.00027286017],"about_ca_topic_score_codex":0.00025316916,"about_ca_topic_score_gemma":0.001583254,"teacher_disagreement_score":0.954267,"about_ca_system_score_codex":0.00009566989,"about_ca_system_score_gemma":0.000020483187,"threshold_uncertainty_score":0.7736156},"labels":[],"label_agreement":null},{"id":"W3191209711","doi":"10.3390/fi13080205","title":"Cascaded κ-μ Fading Channels with Colluding and Non-Colluding Eavesdroppers: Physical-Layer Security Analysis","year":2021,"lang":"en","type":"article","venue":"Future Internet","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Eavesdropping; Secrecy; Computer science; Fading; Physical layer; Computer network; Transmitter; Poisson point process; Computer security; Topology (electrical circuits); Poisson distribution; Telecommunications; Wireless; Channel (broadcasting); Mathematics; Statistics","score_opus":0.010713098105262936,"score_gpt":0.24106678138399584,"score_spread":0.2303536832787329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191209711","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.9807839,0.0006664877,0.0125523675,0.00032425547,0.00017646575,0.00018158514,0.000018671515,0.0005582915,0.004737974],"genre_scores_gemma":[0.99688673,0.00018660279,0.0021732936,0.00008323995,0.00037230703,0.00005034512,0.00003603454,0.000052028914,0.00015943176],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881965,0.00005566639,0.00023460777,0.0003436466,0.00021317624,0.00033325577],"domain_scores_gemma":[0.99910474,0.000077511046,0.000065279666,0.00052354083,0.00011204668,0.00011687266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013392585,0.00027471347,0.00047425617,0.00023994748,0.00008313507,0.00019069236,0.00028121023,0.0001371754,0.00005750977],"category_scores_gemma":[0.00001560148,0.00026362584,0.0001264433,0.0009884739,0.000051774598,0.00026134268,0.00020545699,0.00044549338,0.000007988502],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030246575,0.001061986,0.03727573,0.0021507805,0.025002921,0.0014552273,0.43707076,0.02490293,0.3842461,0.021121968,0.04736561,0.018043512],"study_design_scores_gemma":[0.0007367556,0.000091710346,0.0019655894,0.00042044156,0.00069557957,0.000097000186,0.0045926212,0.437559,0.5324248,0.0004169479,0.01989544,0.001104127],"about_ca_topic_score_codex":0.000055216977,"about_ca_topic_score_gemma":0.00029100047,"teacher_disagreement_score":0.43247816,"about_ca_system_score_codex":0.00012675728,"about_ca_system_score_gemma":0.00001619243,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W3191578566","doi":"","title":"Signaling Games in Higher Dimensions: Geometric Properties of Equilibrium Solutions","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Independent and identically distributed random variables; Gaussian; Scalar (mathematics); Mathematical optimization; Signaling game; Computer science; Distortion (music); Generalization; Applied mathematics; Mathematics; Quadratic equation; Mathematical economics; Mathematical analysis; Random variable; Physics; Geometry","score_opus":0.14240116132942282,"score_gpt":0.19180311373622622,"score_spread":0.049401952406803396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191578566","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.98417944,0.004867612,0.008893009,0.00004880296,0.00016163592,0.00024384294,0.000010529948,0.00048433864,0.0011107915],"genre_scores_gemma":[0.99721295,0.0015213868,0.0010473955,0.000008724552,0.000015291851,0.0000044186236,0.000021971246,0.000038641138,0.00012923729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988899,0.00011780031,0.00030925445,0.00035032642,0.00007501822,0.00025767987],"domain_scores_gemma":[0.9986395,0.000069438436,0.00010808254,0.0009613655,0.00016342646,0.000058160098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019261631,0.00022663572,0.0003977438,0.00080427737,0.000039880157,0.000031506945,0.0006491808,0.0002944003,0.00004372192],"category_scores_gemma":[0.00004239394,0.00028961175,0.00015063988,0.0012019214,0.00011729293,0.000218348,0.0011977028,0.0006292278,0.0000045622614],"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.000011820406,0.00018539907,0.0010327138,0.0006355137,0.00015249025,0.00004805095,0.0004991097,0.951579,0.03475308,0.010815791,0.000116292525,0.00017078075],"study_design_scores_gemma":[0.0012794483,0.000057891008,0.003994436,0.004831952,0.00026218197,0.0000059627205,0.0022838376,0.7331297,0.24129488,0.009502438,0.0011074877,0.0022497862],"about_ca_topic_score_codex":0.00028528966,"about_ca_topic_score_gemma":0.000054866214,"teacher_disagreement_score":0.21844926,"about_ca_system_score_codex":0.00020642331,"about_ca_system_score_gemma":0.00011871937,"threshold_uncertainty_score":0.9999556},"labels":[],"label_agreement":null},{"id":"W3193396119","doi":"10.1109/tit.2021.3107215","title":"Vector Gaussian Successive Refinement With Degraded Side Information","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Tianjin City; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Converse; Mathematics; Gaussian; Monotone polygon; Quadratic equation; Upper and lower bounds; Random variable; Algorithm; Gaussian process; Matching (statistics); Gaussian random field; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.006778377218197648,"score_gpt":0.20762778639906698,"score_spread":0.20084940918086933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193396119","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.004232194,0.000037779228,0.9702486,0.00034784203,0.00020791889,0.0002610406,0.000063056366,0.0010493553,0.02355222],"genre_scores_gemma":[0.9952522,0.00017330966,0.003714099,0.00044698437,0.000010841321,0.00020766111,0.00011839971,0.000016792226,0.00005969343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989202,0.00007581017,0.00046609747,0.00006677976,0.00028396468,0.00018714303],"domain_scores_gemma":[0.9989446,0.00013178804,0.000104363084,0.0005248217,0.00021673329,0.000077684635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019252782,0.00018757385,0.00015324341,0.00029065085,0.00018125631,0.00014955187,0.00019840557,0.000108965774,0.00025485622],"category_scores_gemma":[0.000012735978,0.00017960882,0.000062989144,0.00042287237,0.000050104827,0.0029091125,0.0000020909154,0.00033579164,0.00023994994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040726305,0.0002545652,0.000012284737,0.00070328615,0.0005422835,0.000007304182,0.021909101,0.20646721,0.0027438072,0.14276493,0.0017831225,0.6224048],"study_design_scores_gemma":[0.002366308,0.00024185995,0.00063597236,0.00042657566,0.00012409201,0.0000843412,0.0072741127,0.029190416,0.8766014,0.0024350528,0.07941535,0.0012045343],"about_ca_topic_score_codex":0.0000082657025,"about_ca_topic_score_gemma":0.000031730746,"teacher_disagreement_score":0.99102,"about_ca_system_score_codex":0.00017487722,"about_ca_system_score_gemma":0.00006817441,"threshold_uncertainty_score":0.7324235},"labels":[],"label_agreement":null},{"id":"W3198016044","doi":"10.1109/isit45174.2021.9517832","title":"Neural Computation of Capacity Region of Memoryless Multiple Access Channels","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Upper and lower bounds; Mutual information; Parameterized complexity; Divergence (linguistics); Boundary (topology); Kullback–Leibler divergence; Estimator; Channel (broadcasting); Set (abstract data type); Mathematics; Computer science; Algorithm; Topology (electrical circuits); Combinatorics; Artificial intelligence; Mathematical analysis; Statistics; Telecommunications","score_opus":0.12633980607014952,"score_gpt":0.20795036526710933,"score_spread":0.08161055919695981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198016044","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.8760431,0.00004379485,0.123038724,0.000014478484,0.00007046283,0.00007922307,0.0000056515664,0.00016203549,0.0005425278],"genre_scores_gemma":[0.99951464,0.00010718172,0.00031881666,0.0000074665227,0.000008706539,3.8439845e-7,0.000010833864,0.000012806471,0.000019155796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994792,0.00007312163,0.00015822936,0.00014362349,0.000045753895,0.0001001067],"domain_scores_gemma":[0.9992151,0.00008234103,0.00008999543,0.00036609455,0.00020871073,0.00003774826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060616894,0.00008892186,0.00018272996,0.000109929875,0.000030474139,0.000009781293,0.0003300372,0.000071143535,0.0000071139543],"category_scores_gemma":[0.00002690258,0.0001190906,0.00006766529,0.00048700365,0.000078884026,0.00030101708,0.00013147556,0.00011545333,0.0000012055613],"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.000023833594,0.0001312326,0.012345563,0.0003173111,0.000068016656,0.000046618545,0.00071355025,0.9619983,0.0116587,0.011623517,0.00016600416,0.0009073401],"study_design_scores_gemma":[0.0003640135,0.000015504134,0.0038472721,0.00006503174,0.000020739091,0.000005821413,0.00017587727,0.8225794,0.17082755,0.0019159607,0.00004005786,0.00014280865],"about_ca_topic_score_codex":0.000085561755,"about_ca_topic_score_gemma":0.000057590813,"teacher_disagreement_score":0.15916884,"about_ca_system_score_codex":0.00004569695,"about_ca_system_score_gemma":0.00001412448,"threshold_uncertainty_score":0.48563737},"labels":[],"label_agreement":null},{"id":"W3198805658","doi":"10.1109/isit45174.2021.9518202","title":"Second-Order Asymptotics for One-way Secret Key Agreement","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Alice and Bob; Key (lock); Alice (programming language); Computer science; Public-key cryptography; Cryptography; One-way function; Shared secret; Theoretical computer science; Construct (python library); Protocol (science); Order (exchange); Key-agreement protocol; Key exchange; Key distribution; Discrete mathematics; Computer security; Computer network; Mathematics; Encryption","score_opus":0.023932885897247135,"score_gpt":0.2504430442407956,"score_spread":0.22651015834354848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198805658","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.08046949,0.0011528826,0.62815076,0.0017582016,0.00034025617,0.00076119544,0.00008505217,0.0026445654,0.28463757],"genre_scores_gemma":[0.777073,0.0002749124,0.21874863,0.0004639159,0.000055422624,0.000111995534,0.00011835736,0.000047968293,0.003105748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993434,0.00001866778,0.00021488879,0.00012514186,0.000114424794,0.00018348325],"domain_scores_gemma":[0.99905527,0.0000884651,0.00001886965,0.0006037576,0.00017958826,0.000054064247],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011330141,0.000111313435,0.00014662633,0.000042246014,0.000044172397,0.000047785517,0.00021499814,0.00008581157,0.0018415451],"category_scores_gemma":[0.000033224587,0.0001283731,0.000054710865,0.00014024638,0.000014995569,0.000088883484,0.00009088165,0.00012136973,0.000048290105],"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.000016903146,0.0005592202,0.00073955423,0.0013068845,0.0008220784,0.000011240251,0.003777518,0.0042396314,0.1945372,0.547155,0.21418567,0.032649092],"study_design_scores_gemma":[0.00038947532,0.0000299907,0.00040782592,0.000041022897,0.000018521318,0.0000043030277,0.0001759818,0.033405617,0.43218458,0.002757243,0.53023034,0.00035510043],"about_ca_topic_score_codex":0.0000028823022,"about_ca_topic_score_gemma":0.00020560123,"teacher_disagreement_score":0.69660354,"about_ca_system_score_codex":0.00005991675,"about_ca_system_score_gemma":0.000023771285,"threshold_uncertainty_score":0.9990709},"labels":[],"label_agreement":null},{"id":"W3199885671","doi":"10.46470/03d8ffbd.bd54c70c","title":"Physical Layer Security Analysis of Hybrid MIMO Technology","year":2021,"lang":"en","type":"article","venue":"","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","funders":"","keywords":"MIMO; Physical layer; Computer science; Spatial multiplexing; Multi-user MIMO; Fading; Spectral efficiency; Electronic engineering; Computer network; Wireless; 3G MIMO; Single antenna interference cancellation; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.010241084089165124,"score_gpt":0.25981781273762555,"score_spread":0.24957672864846042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199885671","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.9734306,0.00027326547,0.011016769,0.00027259247,0.00001614673,0.0000391428,0.000016009177,0.00091684057,0.014018638],"genre_scores_gemma":[0.99625635,0.000098098564,0.0035273011,0.000027443388,0.000007461881,0.000011938474,0.000023110731,0.000011642622,0.00003662975],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994975,0.000021107351,0.0001653412,0.00010982949,0.000097841534,0.00010838696],"domain_scores_gemma":[0.9990697,0.0000477067,0.000021750542,0.0007261437,0.00011042263,0.000024279989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047570164,0.00008060041,0.00027890454,0.0002887557,0.000014808474,0.000007677565,0.00023548453,0.000043830412,0.00015760676],"category_scores_gemma":[0.000023569368,0.00008612746,0.00012249433,0.0013488042,0.00004841677,0.00005144356,0.00011815784,0.00015813178,0.000010017753],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007272683,0.0010334554,0.016242418,0.00022916902,0.005915061,0.000067075816,0.0016031264,0.012613439,0.54541487,0.39136916,0.008194192,0.017310744],"study_design_scores_gemma":[0.000047565216,0.0000055733626,0.00037021466,0.0000051685934,0.00014677859,0.0000028698269,0.0000725531,0.14172079,0.8504595,0.004181554,0.0028845076,0.00010293428],"about_ca_topic_score_codex":0.000010551684,"about_ca_topic_score_gemma":0.00005730795,"teacher_disagreement_score":0.3871876,"about_ca_system_score_codex":0.000021088072,"about_ca_system_score_gemma":0.000009724348,"threshold_uncertainty_score":0.3512176},"labels":[],"label_agreement":null},{"id":"W3207738372","doi":"10.1109/iswcs49558.2021.9562204","title":"To Jam or Not to Jam in Gaussian MIMO Wiretap Channels ?: Invited Paper","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"MIMO; Artificial noise; Computer science; Precoding; Jamming; Transmitter power output; Secrecy; Fading; Channel state information; Telecommunications; Computer network; Topology (electrical circuits); Channel (broadcasting); Wireless; Physical layer; Transmitter; Computer security; Engineering; Electrical engineering; Physics","score_opus":0.025558482281105785,"score_gpt":0.28101921701388943,"score_spread":0.25546073473278363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207738372","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.8708545,0.0003520409,0.023465555,0.057924777,0.00049748376,0.0015105617,0.000036488822,0.0043622525,0.04099635],"genre_scores_gemma":[0.9709028,0.00009547033,0.019172573,0.008652697,0.000043865188,0.00014394688,0.00001753051,0.00005416428,0.0009169257],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891263,0.000055251465,0.00032245312,0.00023455947,0.00017289836,0.00030218204],"domain_scores_gemma":[0.9987774,0.00007907591,0.000013687822,0.0008868651,0.00006660824,0.00017637959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016037178,0.0001794139,0.00024879866,0.00023096013,0.000030880696,0.000070395174,0.00040368873,0.00012702408,0.00070768007],"category_scores_gemma":[0.00011249896,0.00017473836,0.000043009055,0.0009134894,0.000011703036,0.0001725172,0.0002508871,0.00023012547,0.00020804885],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020574879,0.00059936714,0.0012269918,0.00042851342,0.00018630078,0.00031650948,0.035349023,0.014293643,0.5914681,0.012983781,0.25646952,0.0864725],"study_design_scores_gemma":[0.00054158765,0.00009234384,0.008140271,0.00033917377,0.000009503613,0.000019874746,0.0009561909,0.011030675,0.6649543,0.00025078168,0.31271648,0.000948821],"about_ca_topic_score_codex":0.0001475379,"about_ca_topic_score_gemma":0.0020921612,"teacher_disagreement_score":0.10004833,"about_ca_system_score_codex":0.000109622895,"about_ca_system_score_gemma":0.000019290088,"threshold_uncertainty_score":0.7748601},"labels":[],"label_agreement":null},{"id":"W3211079129","doi":"10.1109/tit.2022.3150597","title":"Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Binary symmetric channel; Decoding methods; Probability of error; Binary number; Mathematics; Upper and lower bounds; Channel (broadcasting); Algorithm; Context (archaeology); Combinatorics; Binary erasure channel; Discrete mathematics; Coding (social sciences); Channel code; Computer science; Statistics; Channel capacity; Telecommunications; Arithmetic","score_opus":0.01571022881577252,"score_gpt":0.2302066348714496,"score_spread":0.21449640605567707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211079129","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.28488982,0.00042818938,0.69979525,0.0011298544,0.0022176662,0.0017846539,0.0003737669,0.0012419114,0.008138888],"genre_scores_gemma":[0.9989236,0.000102448685,0.000081901344,0.000263636,0.000007783661,0.0005299868,0.0000054597535,0.000019161997,0.00006603081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987485,0.0002988879,0.00037465658,0.000061602695,0.00037450148,0.00014187713],"domain_scores_gemma":[0.99868286,0.00036553084,0.00012103748,0.0007461816,0.000058719877,0.000025646073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080619095,0.0001391219,0.000133556,0.00036772268,0.0005394814,0.000034021894,0.0006891384,0.000052530642,0.00020087294],"category_scores_gemma":[0.000010360737,0.00010174199,0.00014609273,0.0007000774,0.000100518286,0.0004453045,0.0000144004125,0.00051047344,0.000022243892],"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.000120728255,0.00013817895,0.0000020265545,0.00014274725,0.00013269544,1.9864663e-7,0.018323513,0.92762405,0.0010006384,0.017941825,0.0014627376,0.03311066],"study_design_scores_gemma":[0.0018311897,0.0004283968,0.0013640859,0.00019492758,0.00022674327,0.00007100016,0.036274806,0.3349766,0.5914589,0.008935113,0.023030173,0.0012080538],"about_ca_topic_score_codex":0.000010556257,"about_ca_topic_score_gemma":0.00000319569,"teacher_disagreement_score":0.7140338,"about_ca_system_score_codex":0.00014582771,"about_ca_system_score_gemma":0.000025750227,"threshold_uncertainty_score":0.41493094},"labels":[],"label_agreement":null},{"id":"W3215009688","doi":"10.1109/itw48936.2021.9611419","title":"Secret Key Capacity of Wiretapped Polytree-PIN","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Channel (broadcasting); Randomness; Key (lock); Shared secret; Information leakage; Computer network; Theoretical computer science; Adversary; Information-theoretic security; Point (geometry); Key generation; Secrecy; Topology (electrical circuits); Cryptography; Computer security; Mathematics; Combinatorics","score_opus":0.01858253250838794,"score_gpt":0.21914235380921873,"score_spread":0.20055982130083078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215009688","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.7807193,0.00064635166,0.033442605,0.00040058853,0.00007867817,0.000112058355,0.00002366706,0.0015231705,0.18305357],"genre_scores_gemma":[0.9781526,0.00016074453,0.021390367,0.000050835602,0.000010625755,0.000007212736,0.000013917649,0.000017493265,0.00019625029],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947613,0.00003361943,0.00019361159,0.00007982586,0.0001078497,0.00010897037],"domain_scores_gemma":[0.99923164,0.000041353047,0.000020832225,0.0005919614,0.00007497614,0.000039213766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007972953,0.00008070785,0.00015122723,0.000042985877,0.000016647606,0.000011002136,0.00019865696,0.00007082,0.00041180738],"category_scores_gemma":[0.000026928841,0.000088430425,0.00005033059,0.00018735163,0.00003722354,0.00008007575,0.000068110545,0.00013060376,0.0000173215],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055450946,0.00014209564,0.0031593405,0.00032304035,0.00016290548,0.000009558404,0.002640961,0.00041136603,0.8247208,0.14315026,0.013916497,0.011357623],"study_design_scores_gemma":[0.00010967132,0.000007792374,0.0013739257,0.000031328786,0.0000061009932,0.0000067139586,0.00013228568,0.011747343,0.9727522,0.0009737731,0.01271306,0.00014579395],"about_ca_topic_score_codex":0.000051270315,"about_ca_topic_score_gemma":0.0001501926,"teacher_disagreement_score":0.19743325,"about_ca_system_score_codex":0.000025352876,"about_ca_system_score_gemma":0.000015514386,"threshold_uncertainty_score":0.4509002},"labels":[],"label_agreement":null},{"id":"W3217582627","doi":"10.1109/twc.2021.3097000","title":"Joint Secure Transceiver Design and Power Allocation for AN-Assisted MIMO Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Artificial noise; MIMO; Secrecy; Transceiver; Interference (communication); Transmitter power output; Computer network; Channel (broadcasting); Physical layer; Secure communication; Electronic engineering; Wireless; Transmitter; Telecommunications; Computer security; Encryption; Engineering","score_opus":0.046993120017577876,"score_gpt":0.27378299053002186,"score_spread":0.22678987051244398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217582627","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.0062523624,0.0011071521,0.9890795,0.0010321791,0.00015499014,0.00081476534,0.00007193298,0.0010517647,0.0004353855],"genre_scores_gemma":[0.9158898,0.004669934,0.07804652,0.0001752412,0.000013272126,0.000937442,0.00011015483,0.000096484815,0.00006117367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834883,0.0003629364,0.0005013918,0.00032064965,0.00016752158,0.00029868432],"domain_scores_gemma":[0.9963848,0.00050848885,0.00007196817,0.0025282747,0.0003450666,0.0001613862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032542576,0.0002971236,0.0003259708,0.00018941313,0.00060794706,0.00012965774,0.0007037317,0.00028250305,0.000037453676],"category_scores_gemma":[0.0000067827273,0.00036212467,0.0001467212,0.0004612478,0.00019620804,0.0004130873,0.0000072630046,0.00061805325,0.0000061478027],"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.00015597862,0.0029337741,0.000009430834,0.00027682367,0.00086186966,0.000004248699,0.008160578,0.56466204,0.1687399,0.017321313,0.0034111,0.23346294],"study_design_scores_gemma":[0.00093175296,0.00016468417,0.00021485273,0.0001779553,0.00014773953,0.000042345957,0.0004440033,0.90172315,0.08925614,0.0005624892,0.0056652487,0.0006696147],"about_ca_topic_score_codex":0.000016100848,"about_ca_topic_score_gemma":0.00030018555,"teacher_disagreement_score":0.911033,"about_ca_system_score_codex":0.00012842535,"about_ca_system_score_gemma":0.00006967102,"threshold_uncertainty_score":0.99988306},"labels":[],"label_agreement":null},{"id":"W4200065057","doi":"10.1109/vtc2021-fall52928.2021.9625332","title":"Secrecy Outage Probability and Secrecy Capacity for Autonomous Driving in a Cascaded Rayleigh Fading Environment","year":2021,"lang":"en","type":"article","venue":"2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall)","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":"University of Calgary","funders":"","keywords":"Rayleigh fading; Secrecy; Relay; Fading; Computer science; Transmitter; Computer network; Secure communication; Transmission (telecommunications); Wireless; Communications system; Electronic engineering; Computer security; Telecommunications; Engineering; Channel (broadcasting); Encryption","score_opus":0.02327316765091591,"score_gpt":0.227065883454158,"score_spread":0.2037927158032421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200065057","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.89017814,0.0010814399,0.10467641,0.0013957021,0.00014988863,0.0011443439,0.00004608349,0.0009326572,0.00039533956],"genre_scores_gemma":[0.9568342,0.00097422395,0.04098279,0.00005446619,0.000036579593,0.00090814877,0.00006188111,0.00008228099,0.00006541541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99689806,0.00021465181,0.0008340925,0.0009751523,0.0002692558,0.0008088018],"domain_scores_gemma":[0.9977118,0.00022670101,0.00015748062,0.001572085,0.00017580317,0.00015612881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069502,0.0005560749,0.00087355915,0.0004598357,0.00020305884,0.00012588646,0.0007598083,0.0009692966,0.00009707612],"category_scores_gemma":[0.0003001289,0.0006663727,0.00016035893,0.0006183799,0.00037859724,0.0002977205,0.0004491973,0.0013221558,0.000017921879],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041069947,0.0009816998,0.05400995,0.0016527994,0.0007610343,0.0004755781,0.0055838483,0.006668006,0.61376137,0.18738446,0.00017322406,0.12850696],"study_design_scores_gemma":[0.0032755556,0.00024684804,0.007099785,0.0010784123,0.00021260619,0.00036353493,0.0020109504,0.18814974,0.64471006,0.11875193,0.031023744,0.003076859],"about_ca_topic_score_codex":0.000099476936,"about_ca_topic_score_gemma":0.0015124243,"teacher_disagreement_score":0.18148173,"about_ca_system_score_codex":0.00055609003,"about_ca_system_score_gemma":0.00017701446,"threshold_uncertainty_score":0.9995788},"labels":[],"label_agreement":null},{"id":"W4200084599","doi":"10.1145/3453186","title":"MEC-Based Jamming-Aided Anti-Eavesdropping with Deep Reinforcement Learning for WBANs","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Royal Military College of Canada","funders":"","keywords":"Eavesdropping; Computer science; Jamming; Reinforcement learning; Benchmark (surveying); Transmission (telecommunications); Wireless sensor network; Energy consumption; Data transmission; Wireless; Channel (broadcasting); Computer network; Artificial intelligence; Telecommunications; Engineering; Electrical engineering","score_opus":0.013136715178443397,"score_gpt":0.2413551674865831,"score_spread":0.2282184523081397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200084599","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.036479782,0.00010410944,0.9588062,0.00121884,0.000087257155,0.00029883688,0.000002243271,0.0025450832,0.0004576315],"genre_scores_gemma":[0.9452143,0.000102774124,0.053904235,0.00010172085,0.000008519779,0.0003436635,0.00003096379,0.00006687818,0.0002269929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892426,0.000027345344,0.00032425585,0.00028020923,0.00012708503,0.0003168598],"domain_scores_gemma":[0.9985936,0.00016136475,0.00005922001,0.0009859906,0.00015642606,0.000043387943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008968582,0.0002247657,0.00027336853,0.00047779642,0.0001183325,0.00004048243,0.0005850473,0.00026301772,0.000129778],"category_scores_gemma":[0.000060950457,0.0002444913,0.00009389873,0.0005015833,0.000103103106,0.00010286241,0.00001845893,0.0006609181,0.000018348033],"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.00008302601,0.00021566913,0.00026480766,0.0002805874,0.00055006554,0.000035159865,0.00096744474,0.84041655,0.03675214,0.0064765443,0.00025051416,0.11370751],"study_design_scores_gemma":[0.00074086717,0.00037180723,0.000016920954,0.00022661203,0.0000527574,0.000039864593,0.00052038144,0.23176582,0.7480199,0.0005725735,0.01732853,0.00034401912],"about_ca_topic_score_codex":0.000015149175,"about_ca_topic_score_gemma":0.00015454378,"teacher_disagreement_score":0.9087345,"about_ca_system_score_codex":0.00016200662,"about_ca_system_score_gemma":0.00003553931,"threshold_uncertainty_score":0.99700654},"labels":[],"label_agreement":null},{"id":"W4205681265","doi":"10.1109/tvt.2022.3143174","title":"Resource Allocation for URLLC-Oriented Two-Way UAV Relaying","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Flexibility (engineering); Resource allocation; Optimization problem; Constraint (computer-aided design); Mathematical optimization; Resource management (computing); Software deployment; Wireless; Transmission (telecommunications); Distributed computing; Computer network; Engineering; Algorithm; Telecommunications; Mathematics","score_opus":0.010830410893873184,"score_gpt":0.23730690337605936,"score_spread":0.22647649248218618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205681265","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.07854283,0.00027005788,0.9137384,0.0018544318,0.00024343797,0.0006945347,0.000051433806,0.0042072483,0.00039759243],"genre_scores_gemma":[0.98701537,0.000058067562,0.010341975,0.00012424827,0.000013387523,0.002231191,0.000032771677,0.00008105122,0.00010196186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880064,0.0000698247,0.00032804464,0.00029080384,0.0002075314,0.000303148],"domain_scores_gemma":[0.9988032,0.00009605299,0.000059106016,0.00092824287,0.00007200381,0.00004141506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026858193,0.00019334494,0.00021142047,0.00071862567,0.00056953676,0.000014837386,0.0005294821,0.0001892222,0.000056775287],"category_scores_gemma":[0.0000101381775,0.00024837046,0.00011948323,0.00091420935,0.00008678214,0.00008673347,0.0000090552585,0.0008684096,0.000014015483],"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.00007190527,0.00038982884,0.000015074612,0.00007458934,0.00022812144,0.0000097029315,0.00059859233,0.7462867,0.13216883,0.024450589,0.0020193704,0.093686715],"study_design_scores_gemma":[0.0011158353,0.00031233666,0.00000683099,0.000035534802,0.00007287216,0.000082074075,0.0008923769,0.21030012,0.45349738,0.0018594452,0.33129185,0.0005333462],"about_ca_topic_score_codex":0.0000101683,"about_ca_topic_score_gemma":0.000017463373,"teacher_disagreement_score":0.90847254,"about_ca_system_score_codex":0.00032518292,"about_ca_system_score_gemma":0.00001876477,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W4210320086","doi":"10.1109/globecom46510.2021.9686005","title":"Anti-Jamming in Cell Free mMIMO systems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","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":"École de Technologie Supérieure","funders":"","keywords":"Jamming; Computer science; Exploit; Real-time computing; Computer security","score_opus":0.03353475156486492,"score_gpt":0.26973714704263235,"score_spread":0.23620239547776745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210320086","genre_codex":"other","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.34455538,0.038435094,0.033265736,0.004829925,0.0019048563,0.0016979647,0.0009812023,0.0029654277,0.5713644],"genre_scores_gemma":[0.976624,0.00966158,0.013069228,0.00007617643,0.000037088197,0.00018363586,0.00018432132,0.000039494884,0.0001244641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744636,0.0005001087,0.00083880447,0.0003731554,0.00032894147,0.0005126471],"domain_scores_gemma":[0.9923566,0.00024264508,0.0001351518,0.0066457726,0.00046199185,0.00015781737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004135469,0.00035758372,0.0005613226,0.00014651853,0.00022374804,0.00034027395,0.0038408977,0.00027652335,0.00015762614],"category_scores_gemma":[0.0001240948,0.00045872433,0.00012525874,0.0013083979,0.00018654604,0.0004194643,0.0011172569,0.0007604103,0.0001915701],"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.000034522825,0.0038406183,0.06338279,0.0017470032,0.00065612706,0.00029136566,0.0055877715,0.0343163,0.060832676,0.64056134,0.108158454,0.080591045],"study_design_scores_gemma":[0.004068474,0.00012910033,0.020977711,0.0025086117,0.0002118701,0.00026448315,0.011588442,0.4874306,0.03804162,0.014206449,0.41590592,0.004666739],"about_ca_topic_score_codex":0.000744818,"about_ca_topic_score_gemma":0.0031807942,"teacher_disagreement_score":0.63206863,"about_ca_system_score_codex":0.0004940693,"about_ca_system_score_gemma":0.00027707766,"threshold_uncertainty_score":0.99978644},"labels":[],"label_agreement":null},{"id":"W4221156816","doi":"10.1109/ciss53076.2022.9751178","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Lossy compression; Encoder; Upper and lower bounds; Gaussian; Distortion (music); Algorithm; Cramér–Rao bound; Rate distortion; Function (biology); Decoding methods; Mathematics; Discrete mathematics; Computer science; Coding (social sciences); Statistics; Mathematical analysis; Physics; Telecommunications","score_opus":0.010145557330683005,"score_gpt":0.21911023057698667,"score_spread":0.20896467324630366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221156816","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.76990306,0.00061542203,0.14276588,0.00065135286,0.00031305448,0.0005504331,0.00028230916,0.0046192934,0.080299184],"genre_scores_gemma":[0.9989188,0.000041065658,0.0008096232,0.000039541093,0.0000045653624,0.000028882574,0.000072844865,0.000020740086,0.000063936466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.000053815038,0.00024240439,0.000089610854,0.00021627189,0.0001283353],"domain_scores_gemma":[0.999316,0.00019146077,0.00004587521,0.00038011,0.000027333375,0.000039257866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015138117,0.00008956324,0.00014908174,0.00020212628,0.000091418995,0.000012546407,0.00037955632,0.00003978854,0.0005009807],"category_scores_gemma":[0.000049858474,0.000094450974,0.000046938243,0.00069982366,0.000026986467,0.000038156144,0.00015187479,0.00030936784,0.000008915044],"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.00010330006,0.0007933702,0.0049646827,0.00022567056,0.00034284825,0.000025677651,0.00211061,0.179791,0.020132383,0.7037907,0.07027501,0.017444706],"study_design_scores_gemma":[0.0015865811,0.00075203617,0.009492143,0.0001605675,0.00006162952,0.000038163576,0.0014712865,0.7679957,0.14513487,0.007663477,0.064315915,0.0013276011],"about_ca_topic_score_codex":0.0000272144,"about_ca_topic_score_gemma":0.000002312433,"teacher_disagreement_score":0.6961273,"about_ca_system_score_codex":0.000105646766,"about_ca_system_score_gemma":0.000007924434,"threshold_uncertainty_score":0.54853874},"labels":[],"label_agreement":null},{"id":"W4224924102","doi":"10.1109/icassp43922.2022.9747823","title":"Data-Driven Optimization for Zero-Delay Lossy Source Coding with Side Information","year":2022,"lang":"en","type":"article","venue":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Algorithm; Decoding methods; Encoder; Lossy compression; Rate–distortion theory; Markov process; Coding (social sciences); Theoretical computer science; Data compression; Mathematics; Artificial intelligence","score_opus":0.04797476613202885,"score_gpt":0.28985177087721303,"score_spread":0.2418770047451842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224924102","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.006981171,0.00010084532,0.9857741,0.0007420975,0.00029182693,0.00057804066,0.0012931299,0.0005892174,0.0036495773],"genre_scores_gemma":[0.95674026,0.00022404647,0.040000837,0.000446395,0.00013262579,0.00024785651,0.0019342073,0.00006543569,0.00020832541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763125,0.00007774162,0.0006091623,0.00041924484,0.0009205886,0.0003420063],"domain_scores_gemma":[0.99834055,0.00020728887,0.0003268211,0.0005085428,0.00048714955,0.00012964834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000559967,0.00032723031,0.00030992893,0.00039243558,0.00057422445,0.0005513712,0.0011996768,0.00010980763,0.00045148827],"category_scores_gemma":[0.00009666752,0.00035265295,0.000048591297,0.00029505102,0.00012264372,0.0011153147,0.00038677998,0.00077005394,0.000007526418],"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.00029952443,0.00014933405,0.00005654774,0.00022762833,0.00015621052,0.000019544792,0.00073756377,0.9182461,0.0090769725,0.0026874228,0.009925139,0.05841801],"study_design_scores_gemma":[0.0006150935,0.00021078883,0.000012382888,0.00011315142,0.000050035993,0.000076828466,0.00072017004,0.986023,0.0007182769,0.0006821975,0.010355194,0.00042288718],"about_ca_topic_score_codex":0.000018466806,"about_ca_topic_score_gemma":0.0000088807765,"teacher_disagreement_score":0.9497591,"about_ca_system_score_codex":0.0003231941,"about_ca_system_score_gemma":0.00017516107,"threshold_uncertainty_score":0.99989253},"labels":[],"label_agreement":null},{"id":"W4225831761","doi":"10.23977/acss.2022.060107","title":"Physical-layer Security from Channel Resolvability","year":2022,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Secrecy; Physical layer; Channel (broadcasting); Computer science; Computer network; Wireless; Layer (electronics); Point (geometry); Computer security; Telecommunications; Mathematics","score_opus":0.016492967419280396,"score_gpt":0.2596233220298596,"score_spread":0.24313035461057922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225831761","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.88567543,0.025841514,0.0856881,0.00006706212,0.0007498376,0.00048827557,0.000102392754,0.00060037547,0.0007870018],"genre_scores_gemma":[0.99846226,0.000514631,0.00060724415,0.00003657161,0.00014784647,0.00019699626,0.0000148278,0.000017476319,0.000002132126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989443,0.00020750702,0.00026896392,0.00022960026,0.00018562774,0.0001640461],"domain_scores_gemma":[0.999224,0.00024225558,0.000047395293,0.00042148316,0.000022415927,0.00004244223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028311965,0.0001338804,0.00028376095,0.00006281355,0.000093099516,0.000044512206,0.0003201253,0.000030152618,0.000009552279],"category_scores_gemma":[0.0000031716781,0.00014299175,0.000035778827,0.00016288758,0.000034029476,0.00023619397,0.00026777838,0.0002810424,0.0000018021951],"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.000032717835,0.00041703772,0.0037847029,0.00048898027,0.000072872324,0.000019785019,0.01664019,0.92933756,0.0026029497,0.0056222677,0.0019739915,0.039006963],"study_design_scores_gemma":[0.00017938766,0.000049140708,0.00024115997,0.000049944916,0.0000025610832,0.0000027616636,0.00015904328,0.9688182,0.00062886596,0.010834408,0.018824179,0.00021034601],"about_ca_topic_score_codex":0.000120566016,"about_ca_topic_score_gemma":0.000024265499,"teacher_disagreement_score":0.11278683,"about_ca_system_score_codex":0.00006583518,"about_ca_system_score_gemma":0.000004781031,"threshold_uncertainty_score":0.5831034},"labels":[],"label_agreement":null},{"id":"W4226036023","doi":"10.1109/tac.2022.3142121","title":"Quadratic signaling with prior mismatch at an encoder and decoder: equilibria, continuity, and robustness properties","year":2022,"lang":"en","type":"article","venue":"Bilkent University Institutional Repository (Bilkent University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Stackelberg competition; Affine transformation; Mathematical optimization; Robustness (evolution); Computer science; Encoder; Gaussian; Probabilistic logic; Prior probability; Observability; Nash equilibrium; Mathematics; Mathematical economics; Applied mathematics; Artificial intelligence; Bayesian probability","score_opus":0.013072331713286967,"score_gpt":0.16855868401833055,"score_spread":0.15548635230504357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226036023","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.99101466,0.00031160977,0.003916781,0.00009231162,0.00009842103,0.0004334716,0.000032002252,0.00050796376,0.0035927927],"genre_scores_gemma":[0.9963653,0.00014232357,0.0018184227,0.000016449465,0.000019906365,0.000002361653,0.000036403184,0.000021126856,0.001577682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984782,0.00022387356,0.00018402604,0.00042816394,0.00041680585,0.0002689495],"domain_scores_gemma":[0.999084,0.000062587744,0.00010018127,0.0004106039,0.00012745862,0.00021519279],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0001583496,0.0002610565,0.00026742066,0.00040385846,0.0019360349,0.000077427525,0.0005015004,0.00009278381,0.00003173912],"category_scores_gemma":[0.0000061727133,0.0003026575,0.00005598829,0.00037035602,0.0005182497,0.00088475813,0.0008292268,0.00031784005,0.0000011736753],"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.0037608354,0.0020043093,0.08035706,0.0013618445,0.0014023082,0.0046461024,0.01716977,0.59209675,0.18208887,0.11144942,0.00096956285,0.002693171],"study_design_scores_gemma":[0.014577589,0.0020496687,0.019679178,0.0010773507,0.0014133053,0.0043562893,0.049891382,0.436662,0.050079204,0.00023737711,0.413633,0.0063437005],"about_ca_topic_score_codex":0.00016030946,"about_ca_topic_score_gemma":0.0001850269,"teacher_disagreement_score":0.4126634,"about_ca_system_score_codex":0.0010732949,"about_ca_system_score_gemma":0.00019870294,"threshold_uncertainty_score":0.99994254},"labels":[],"label_agreement":null},{"id":"W4226445202","doi":"10.1063/5.0088507","title":"Uniform continuity bound for sandwiched Rényi conditional entropy","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Conditional entropy; Mathematics; Upper and lower bounds; Entropy (arrow of time); Dimension (graph theory); Combinatorics; Simple (philosophy); Conditional quantum entropy; Statistical physics; Mathematical analysis; Discrete mathematics; Pure mathematics; Physics; Joint quantum entropy; Thermodynamics; Statistics; Principle of maximum entropy; Maximum entropy thermodynamics","score_opus":0.01971534044519943,"score_gpt":0.26862425758491204,"score_spread":0.2489089171397126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226445202","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.14485693,0.00017667393,0.851011,0.000446203,0.00015953426,0.00035152206,0.00010979297,0.00016719439,0.002721182],"genre_scores_gemma":[0.97843087,0.000014956759,0.02124615,0.00006979924,0.0001378195,0.00003459441,0.000014807376,0.000024146735,0.000026859238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990425,0.00003303307,0.000420703,0.000045584486,0.00032855113,0.00012962999],"domain_scores_gemma":[0.9991041,0.00034561197,0.00017049124,0.00018518712,0.00013511509,0.00005949287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040668,0.00009337821,0.00026782134,0.000041724325,0.0001048438,0.0000326397,0.0003312784,0.000027922293,0.00017834426],"category_scores_gemma":[0.000063329666,0.000090165166,0.00016510804,0.000091793954,0.00004634166,0.00014704042,0.00007002024,0.0003380953,0.0000047454555],"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.000045736462,0.00044249865,0.000021698523,0.00021924288,0.00018007806,0.000004395212,0.000921875,0.0033597234,0.009866069,0.96299344,0.020253766,0.0016914805],"study_design_scores_gemma":[0.0006059897,0.00011117047,0.000047661095,0.000025180867,0.000040772164,0.000049046856,0.0001661794,0.025942873,0.0075102733,0.95201886,0.01335005,0.00013195183],"about_ca_topic_score_codex":1.5766972e-7,"about_ca_topic_score_gemma":1.1226857e-7,"teacher_disagreement_score":0.83357394,"about_ca_system_score_codex":0.00014195415,"about_ca_system_score_gemma":0.000034324974,"threshold_uncertainty_score":0.36768287},"labels":[],"label_agreement":null},{"id":"W4226452241","doi":"10.1109/twc.2022.3157885","title":"Mean-Field Artificial Noise Assistance and Uplink Power Control in Covert IoT Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"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); York University","funders":"","keywords":"Stackelberg competition; Artificial noise; Computer science; Covert; Computer security; Transmission (telecommunications); Telecommunications link; Secrecy; Game theory; Wireless; Computer network; Channel (broadcasting); Transmitter; Telecommunications; Mathematics","score_opus":0.01819467926173051,"score_gpt":0.2513880791529263,"score_spread":0.2331933998911958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226452241","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.2027692,0.0029714918,0.78351456,0.0034811262,0.0006737568,0.001495745,0.00035601086,0.0016123754,0.0031257141],"genre_scores_gemma":[0.99699855,0.0007679427,0.0008402762,0.00027621948,0.000008147184,0.0009881667,0.000011587985,0.000062064784,0.000047025507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998263,0.00034242086,0.0005917718,0.00024510777,0.00027544217,0.0002822786],"domain_scores_gemma":[0.99679023,0.000730924,0.00008783659,0.002229229,0.00007054848,0.00009121899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042679132,0.00023733792,0.000342029,0.0003722305,0.00068626786,0.00008430749,0.0011406688,0.00012318969,0.00006681667],"category_scores_gemma":[0.0000059663544,0.00030364573,0.00008681589,0.00059861405,0.00012811423,0.00011840261,0.000023521387,0.001269176,0.000012878927],"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.0004006732,0.0031340397,0.0005313059,0.00021665465,0.0004666005,0.000016326585,0.010976081,0.8154202,0.051307976,0.061693016,0.0023487064,0.053488433],"study_design_scores_gemma":[0.0011589018,0.0001936443,0.00036094987,0.00013867105,0.000058902177,0.0000323191,0.0018805478,0.977256,0.006139487,0.0004602237,0.011506913,0.0008134332],"about_ca_topic_score_codex":0.00023985235,"about_ca_topic_score_gemma":0.0006788125,"teacher_disagreement_score":0.7942294,"about_ca_system_score_codex":0.000365711,"about_ca_system_score_gemma":0.000047880196,"threshold_uncertainty_score":0.9999416},"labels":[],"label_agreement":null},{"id":"W4230675624","doi":"10.1002/wcm.723","title":"Joint optimization of power scheduling and rate‐distortion performance in<i>one‐helper</i>problem","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Security Techniques","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":"Concordia University; Queen's University","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Coding (social sciences); Rate–distortion theory; Optimization problem; Gaussian; Channel code; Decoding methods; Information theory; Source code; Fusion center; Algorithm; Wireless; Telecommunications; Mathematics; Cognitive radio","score_opus":0.024924281214584214,"score_gpt":0.23310509517172573,"score_spread":0.20818081395714153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230675624","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.94723934,0.003839999,0.047341414,0.000045931596,0.000020243886,0.00031200668,0.000002685049,0.00024368064,0.00095472764],"genre_scores_gemma":[0.9047485,0.018006153,0.07712038,0.000013173008,0.0000059817294,0.00005293913,0.00002350297,0.000026777976,0.0000025980962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895823,0.00009950619,0.00053262006,0.00015447436,0.0000903353,0.00016484942],"domain_scores_gemma":[0.9987576,0.000121198565,0.00013149064,0.00082718825,0.00011371058,0.000048812886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038253237,0.0001450568,0.00026880248,0.00019347692,0.000265586,0.000022772649,0.00032762665,0.00009258228,0.0000035216747],"category_scores_gemma":[0.0000112381595,0.00017534426,0.00002683042,0.0002882046,0.00023236948,0.00023087833,0.00037249434,0.00029750634,6.5660515e-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.000015895626,0.00043486946,0.034534197,0.0006811936,0.00007107679,0.0000012559502,0.017659344,0.8274752,0.02638546,0.004748554,0.000020090532,0.08797288],"study_design_scores_gemma":[0.0002890774,0.000045044846,0.01157769,0.00036122397,0.0000067246924,0.000015393176,0.00030838483,0.9836707,0.0032021087,0.000029674373,0.00028221073,0.00021177558],"about_ca_topic_score_codex":0.00003326623,"about_ca_topic_score_gemma":0.000010230546,"teacher_disagreement_score":0.1561955,"about_ca_system_score_codex":0.00005465326,"about_ca_system_score_gemma":0.000020104102,"threshold_uncertainty_score":0.7150332},"labels":[],"label_agreement":null},{"id":"W4235898637","doi":"10.31130/jst.2015.12","title":"Capacity of Bernoulli-Gaussian Interference Channels in Rayleigh Fading with Full CSI","year":2015,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Upper and lower bounds; Rayleigh fading; Channel state information; Fading; Gaussian; Bernoulli's principle; Channel (broadcasting); Channel capacity; Mathematics; Transmitter; Piecewise; Interference (communication); Control theory (sociology); Topology (electrical circuits); Computer science; Telecommunications; Mathematical analysis; Physics; Combinatorics; Wireless","score_opus":0.02020149842799908,"score_gpt":0.2029118081558591,"score_spread":0.18271030972786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235898637","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.99459267,0.00016683017,0.0038602902,0.0009058032,0.000021383883,0.00003889617,9.7472e-7,0.00002344049,0.00038968725],"genre_scores_gemma":[0.99647737,0.00016897834,0.0033432096,0.000002663044,0.0000022426104,4.370456e-8,4.504708e-8,0.0000021620567,0.0000032843975],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955,0.000015892094,0.00012156522,0.00005282656,0.0001580251,0.00010167826],"domain_scores_gemma":[0.9993769,0.000023185958,0.00012323102,0.00018423896,0.0002566281,0.000035847188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060326926,0.00004988994,0.00015600247,0.0005379856,0.00005357587,0.000005152741,0.0008256549,0.000050123697,0.0000013814107],"category_scores_gemma":[0.00004660869,0.00003867522,0.000011142629,0.0007673173,0.0017637593,0.00026724773,0.00013332212,0.00023098558,2.153274e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004146019,0.00038920526,0.060675107,0.00031021092,0.0002378833,0.00014372534,0.119791724,0.006832632,0.6252023,0.12094896,0.0009354723,0.06411818],"study_design_scores_gemma":[0.0041366373,0.0037253774,0.011772179,0.002999828,0.0001399928,0.0012614055,0.110641494,0.034342345,0.7872661,0.03887612,0.003956962,0.0008816097],"about_ca_topic_score_codex":0.00007598581,"about_ca_topic_score_gemma":0.000102089296,"teacher_disagreement_score":0.16206375,"about_ca_system_score_codex":0.00007050188,"about_ca_system_score_gemma":0.00006541238,"threshold_uncertainty_score":0.64986444},"labels":[],"label_agreement":null},{"id":"W4250445649","doi":"10.1109/isit.2014.6874782","title":"Table of contents","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Office of Naval Research; National Institute of Information and Communications Technology; Russian Academy of Sciences; University at Buffalo; University of California, Davis; University of California, Riverside; University of California, Los Angeles; University of Illinois at Urbana-Champaign; École Normale Supérieure de Lyon; Pontifícia Universidade Católica do Rio de Janeiro; Lomonosov Moscow State University; Universität Rostock; ITMO University; Shahid Rajaee Teacher Training University; Ministry of Public Security of the People's Republic of China; Alexandria University; University of Science and Technology of China; Universidade Federal de Pernambuco; Singapore University of Technology and Design; University of Tsukuba; National Taiwan University; Austrian Institute of Technology; National Taiwan Normal University; Bilkent Üniversitesi; University of California, Irvine; Oulun Yliopisto; National Chiao Tung University; Technische Universität München; Xidian University; Nanjing University of Science and Technology; Universitetet i Bergen; Chinese University of Hong Kong; Universidad de Buenos Aires; Centre National de la Recherche Scientifique; University of Tokyo; Tartu Ülikool; Kharazmi University; Danmarks Tekniske Universitet; Hong Kong Polytechnic University; Kungliga Tekniska Högskolan; Qatar University; Orta Doğu Teknik Üniversitesi; Mahidol University; Universidad Carlos III de Madrid; Tsinghua University; Branco Weiss Fellowship – Society in Science; King Abdullah University of Science and Technology; Indian Institute of Technology Madras; American University in Cairo; Institute for Research in Fundamental Sciences; Strong; University of Hong Kong; Tel Aviv University; Electronics and Telecommunications Research Institute; Hebrew University of Jerusalem; Beijing Institute of Technology; Queen's University; Iran Telecommunication Research Center; Universidad Complutense de Madrid; Shanghai Educational Development Foundation; Technion-Israel Institute of Technology; Concordia University; Institute for Infocomm Research; Chalmers Tekniska Högskola; University of California, San Diego; University of Johannesburg; Southern Methodist University; Worcester Polytechnic Institute; Aalto-Yliopisto; Gyeongsang National University; California State University, Northridge; Pusan National University; Jet Propulsion Laboratory; Technische Universität Dresden; Pohang University of Science and Technology; Bar-Ilan University; Università degli Studi di Brescia; Dankook University; Yonsei University; Sharif University of Technology; Chinese Academy of Sciences; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; Griffith University; University of Newcastle Australia; Sun Yat-sen University; École Polytechnique Fédérale de Lausanne; Nanyang Technological University; Agency for Science, Technology and Research; University College London; York University; University of South Australia; Institute of Science and Technology Austria; University of Tokushima; University of Cyprus; Princeton University; University of Patras; Shanghai Jiao Tong University; Raytheon Company; Rutgers, The State University of New Jersey; Technische Universität Darmstadt; Ben-Gurion University of the Negev; McMaster University; University of Science and Technology Beijing; University of Ottawa; Intel Corporation; Hong Kong University of Science and Technology; North Carolina State University; Université du Luxembourg; Eidgenössische Technische Hochschule Zürich; Max-Planck-Institut für Mathematik in den Naturwissenschaften; Southeast University; Nanjing University; Indian Institute of Technology Bombay; Institut national de recherche en informatique et en automatique (INRIA); University College Dublin; Université de Lorraine; McGill University; Drexel University; University of Notre Dame; Tata Institute of Fundamental Research; Colorado State University; Centre National d’Etudes Spatiales; Institute for Information and Communications Technology Promotion; University of Arizona; Indian Institute of Science; University of Waterloo; City University of Hong Kong; Lawrence Berkeley National Laboratory; Seoul National University; Northwestern University; Politecnico di Torino; Budapesti Műszaki és Gazdaságtudományi Egyetem; University of Minnesota; Massachusetts Institute of Technology; Helsingin Yliopisto; Syracuse University; Magyar Tudományos Akadémia; Samsung; Universidade Estadual de Campinas; Universitat Pompeu Fabra; Arizona State University; Turun Yliopisto; Yale University; University of California, Santa Barbara; University of Wisconsin-Madison; Norges Teknisk-Naturvitenskapelige Universitet; Consejo Nacional de Investigaciones Científicas y Técnicas; École Normale Supérieure; Rice University; Georgia Institute of Technology; University of Toronto; Ulsan National Institute of Science and Technology; Imperial College London; Korea Advanced Institute of Science and Technology; University of Alberta; California Institute of Technology; Universidad de Chile; Beijing Jiaotong University; Iowa State University; Korea University; Jacobs University; Carnegie Mellon University; Institució Catalana de Recerca i Estudis Avançats; Louisiana State University; University of Southern California; Purdue University; University of Texas at Austin; Ohio State University; Lunds Universitet; University of Sydney; Indian National Science Academy; Aalborg Universitet; National University of Singapore","keywords":"Table (database); Computer science; Database","score_opus":0.013633670503543045,"score_gpt":0.22215232476178182,"score_spread":0.20851865425823876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250445649","genre_codex":"other","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.14923252,0.00016349243,0.2034091,0.00009700995,0.00006125496,0.0000991798,0.0000022047834,0.001379191,0.64555603],"genre_scores_gemma":[0.9932352,0.000026706397,0.0065623047,0.00002134576,0.0000035326555,0.0000038882276,0.0000011970603,0.0000057448833,0.00014011544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982744,0.000006280927,0.00007150869,0.000020562396,0.00003456629,0.000039632305],"domain_scores_gemma":[0.99973065,0.000019299929,0.0000071524046,0.00021089346,0.000020861087,0.000011134691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046013287,0.000024648067,0.00005299029,0.0000187602,0.0000048230077,0.000002612092,0.00011189492,0.000017976186,0.00006665409],"category_scores_gemma":[0.000010235126,0.000023959115,0.000009070357,0.000039796552,0.000009677734,0.000034021134,0.000017436898,0.000028296381,0.000013103113],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004012524,0.00008973572,0.0069411504,0.0002036296,0.000060726,1.6422244e-7,0.000506322,0.001534278,0.3465529,0.52616364,0.07038326,0.047560163],"study_design_scores_gemma":[0.00015413901,0.000017216844,0.001724375,0.000022033111,0.0000025327176,5.877319e-7,0.000023219942,0.07795146,0.7609847,0.002111146,0.15690193,0.00010663291],"about_ca_topic_score_codex":0.00001907921,"about_ca_topic_score_gemma":0.0000067118544,"teacher_disagreement_score":0.84400266,"about_ca_system_score_codex":0.0000030461015,"about_ca_system_score_gemma":6.100017e-7,"threshold_uncertainty_score":0.097702436},"labels":[],"label_agreement":null},{"id":"W4280530302","doi":"10.1109/wcnc51071.2022.9771727","title":"Physical Layer Authentication for LEO Satellite Constellations","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Physical layer; Computer science; Transmitter; Spoofing attack; Authentication (law); Fading; Computer network; Satellite; Node (physics); False alarm; Channel (broadcasting); Wireless; Telecommunications; Computer security; Artificial intelligence; Engineering","score_opus":0.05421901260512946,"score_gpt":0.2884848776591816,"score_spread":0.23426586505405217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280530302","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.75648934,0.02716118,0.15950905,0.007961989,0.0021013836,0.005808053,0.0007345751,0.0055540456,0.034680415],"genre_scores_gemma":[0.9863945,0.008844078,0.0027661272,0.00009435821,0.00010606582,0.0012260382,0.0003784203,0.00006367126,0.0001266913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.0002596617,0.00043601787,0.00029366717,0.00023387665,0.000345155],"domain_scores_gemma":[0.9970747,0.0006703234,0.00014868198,0.0018702896,0.00013839471,0.00009756747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045498466,0.00024893132,0.0003283473,0.00017390116,0.0012700567,0.00014758074,0.0012367346,0.00007946032,0.00004670421],"category_scores_gemma":[0.000006739823,0.0003073894,0.00010677289,0.00047874614,0.00027190408,0.00017942805,0.00052223465,0.00062403694,0.0000052509267],"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.00004127711,0.00054214615,0.0012062014,0.00015410331,0.00028277474,0.0000013247914,0.009817938,0.0024474617,0.029293617,0.27160797,0.0036476266,0.68095756],"study_design_scores_gemma":[0.00030537357,0.000054255062,0.00014253253,0.000048632828,0.000057368947,0.000010952566,0.0007476467,0.74751323,0.0009327782,0.0051803007,0.2445974,0.00040955006],"about_ca_topic_score_codex":0.000021350388,"about_ca_topic_score_gemma":0.00008263263,"teacher_disagreement_score":0.74506575,"about_ca_system_score_codex":0.00012547916,"about_ca_system_score_gemma":0.00005817014,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W4282556227","doi":"10.36227/techrxiv.20055920","title":"Reputation-Aware Relay Selection with Opportunistic Spectrum Access: A Blockchain Approach","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Relay; Computer science; Blockchain; Cognitive radio; Computer network; Secrecy; Latency (audio); Computer security; Reputation; Credibility; Selection (genetic algorithm); Telecommunications; Wireless; Artificial intelligence","score_opus":0.03201545788076131,"score_gpt":0.2740884944302809,"score_spread":0.24207303654951956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282556227","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.011494134,0.00023172284,0.9192625,0.0005218317,0.0002180131,0.001612145,0.00009335231,0.008648948,0.057917345],"genre_scores_gemma":[0.9571222,0.00030216415,0.038786378,0.00007471922,0.00008638392,0.0015221228,0.0009829465,0.00017866316,0.00094440795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814063,0.00013507793,0.00048075366,0.000526435,0.00043031387,0.00028677218],"domain_scores_gemma":[0.99831945,0.00007665846,0.00018123728,0.0012345461,0.0000869771,0.00010114905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003555955,0.00040415127,0.0004031572,0.00040758407,0.00018077201,0.00023957982,0.0011085281,0.0002753608,0.0007882832],"category_scores_gemma":[0.000021273321,0.0004224871,0.00009286233,0.00049719197,0.000048789785,0.00010470565,0.0010320944,0.001721125,0.000005409184],"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.000016809487,0.00010998984,0.00043786445,0.00056812295,0.00020587156,0.000010471703,0.00062295527,0.98687196,0.00002436742,0.00489278,0.005353338,0.0008854418],"study_design_scores_gemma":[0.00017739112,0.00006216031,0.0002521408,0.0001015714,0.000076375574,0.000058857182,0.0003178321,0.9882739,0.00050488615,0.0019399469,0.0074225804,0.00081232504],"about_ca_topic_score_codex":0.0002703198,"about_ca_topic_score_gemma":0.00012179855,"teacher_disagreement_score":0.9456281,"about_ca_system_score_codex":0.00054435636,"about_ca_system_score_gemma":0.00017973146,"threshold_uncertainty_score":0.9998227},"labels":[],"label_agreement":null},{"id":"W4282582198","doi":"10.36227/techrxiv.20055920.v1","title":"Reputation-Aware Relay Selection with Opportunistic Spectrum Access: A Blockchain Approach","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Relay; Blockchain; Computer network; Cognitive radio; Secrecy; Computer security; Latency (audio); Reputation; Selection (genetic algorithm); Credibility; Telecommunications; Wireless; Artificial intelligence","score_opus":0.03201545788076131,"score_gpt":0.2740884944302809,"score_spread":0.24207303654951956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282582198","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.011494134,0.00023172284,0.9192625,0.0005218317,0.0002180131,0.001612145,0.00009335231,0.008648948,0.057917345],"genre_scores_gemma":[0.9571222,0.00030216415,0.038786378,0.00007471922,0.00008638392,0.0015221228,0.0009829465,0.00017866316,0.00094440795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814063,0.00013507793,0.00048075366,0.000526435,0.00043031387,0.00028677218],"domain_scores_gemma":[0.99831945,0.00007665846,0.00018123728,0.0012345461,0.0000869771,0.00010114905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003555955,0.00040415127,0.0004031572,0.00040758407,0.00018077201,0.00023957982,0.0011085281,0.0002753608,0.0007882832],"category_scores_gemma":[0.000021273321,0.0004224871,0.00009286233,0.00049719197,0.000048789785,0.00010470565,0.0010320944,0.001721125,0.000005409184],"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.000016809487,0.00010998984,0.00043786445,0.00056812295,0.00020587156,0.000010471703,0.00062295527,0.98687196,0.00002436742,0.00489278,0.005353338,0.0008854418],"study_design_scores_gemma":[0.00017739112,0.00006216031,0.0002521408,0.0001015714,0.000076375574,0.000058857182,0.0003178321,0.9882739,0.00050488615,0.0019399469,0.0074225804,0.00081232504],"about_ca_topic_score_codex":0.0002703198,"about_ca_topic_score_gemma":0.00012179855,"teacher_disagreement_score":0.9456281,"about_ca_system_score_codex":0.00054435636,"about_ca_system_score_gemma":0.00017973146,"threshold_uncertainty_score":0.9998227},"labels":[],"label_agreement":null},{"id":"W4283218341","doi":"10.1155/2022/5342655","title":"Statistical Characteristics and Security Analysis over Multi-Cascade κ-μ Shadowed Channels","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Henan Polytechnic University","keywords":"Cascade; Eavesdropping; Probability density function; Fading; Cumulative distribution function; Reliability (semiconductor); Computer science; Correctness; Channel (broadcasting); Statistics; Statistical physics; Algorithm; Mathematics; Topology (electrical circuits); Telecommunications; Physics; Engineering; Computer security","score_opus":0.010301090317398894,"score_gpt":0.263630084694524,"score_spread":0.2533289943771251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283218341","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.8972915,0.00032208115,0.10182362,0.00004624913,0.00014652192,0.0000937888,0.00019571191,0.00007187098,0.000008660396],"genre_scores_gemma":[0.9839251,0.00049296906,0.015356867,0.000030390018,0.000025611804,0.000013545171,0.00013357075,0.000018857818,0.0000030754277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99896145,0.00004908617,0.0005185705,0.00008719871,0.0002685994,0.00011508293],"domain_scores_gemma":[0.9994126,0.00007613311,0.00020892886,0.0001373403,0.00008891192,0.00007608895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022266264,0.00010822858,0.0002900843,0.0002711501,0.00008108948,0.000019147976,0.00014506072,0.000036618763,0.00009896874],"category_scores_gemma":[0.000016107391,0.00012124621,0.000083164625,0.00035094866,0.00002768885,0.00026360102,0.0000070091114,0.00039677543,2.503166e-7],"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.0006606429,0.000962009,0.05820002,0.0005216655,0.002696216,0.0003233548,0.04953565,0.79791325,0.0445306,0.008287265,0.00050141383,0.03586794],"study_design_scores_gemma":[0.0013834224,0.00018836332,0.93208724,0.000028829169,0.0006090264,0.00002237598,0.0009250363,0.056482937,0.0017759941,0.0013112919,0.004821274,0.0003642133],"about_ca_topic_score_codex":0.0000057424922,"about_ca_topic_score_gemma":0.00002558346,"teacher_disagreement_score":0.87388724,"about_ca_system_score_codex":0.00007559071,"about_ca_system_score_gemma":0.000013121055,"threshold_uncertainty_score":0.49442768},"labels":[],"label_agreement":null},{"id":"W4285042956","doi":"10.22215/etd/2022-15015","title":"Optimal Detection in the Presence of Non-Gaussian Jamming","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Ministry of Higher Education and Scientific Research; Ministry of Education, Libya","keywords":"Jamming; Transmitter; Computer science; Gaussian; Eavesdropping; Additive white Gaussian noise; Channel (broadcasting); Gaussian noise; Detector; Electronic engineering; Channel state information; Algorithm; Telecommunications; Wireless; Computer network; Engineering; Physics","score_opus":0.009046152155926721,"score_gpt":0.268189383118491,"score_spread":0.25914323096256425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285042956","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.88960737,0.00055790757,0.004427239,0.000040198385,0.0003435792,0.0008213036,0.000009025061,0.0004812154,0.103712186],"genre_scores_gemma":[0.9972622,0.00023271011,0.0018065716,0.0000053745134,0.000012430703,0.0002690821,0.00011875704,0.00002824234,0.00026467512],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992523,0.00005913288,0.00027161723,0.00010011695,0.00021425709,0.000102585815],"domain_scores_gemma":[0.9993158,0.00010082582,0.000066553075,0.0004833415,0.000023317645,0.000010165288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026190325,0.00011917565,0.00015032521,0.00020120035,0.00004452674,0.000018026962,0.00060582714,0.00011793713,0.0001372557],"category_scores_gemma":[0.000023233379,0.000108286535,0.00004957009,0.00030734504,0.000010928956,0.00008531518,0.000030765885,0.00054525695,0.0000019804268],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018234426,0.00046397414,0.00031162196,0.003908317,0.00024873862,0.000026943608,0.20263858,0.09641935,0.1865146,0.00583565,0.004781264,0.4986686],"study_design_scores_gemma":[0.0004566004,0.00024003883,0.017882673,0.0005343426,0.000066643224,0.0000147105275,0.06555344,0.275985,0.61646456,0.00041564766,0.02120083,0.0011855421],"about_ca_topic_score_codex":0.00030161542,"about_ca_topic_score_gemma":0.0014135852,"teacher_disagreement_score":0.49748307,"about_ca_system_score_codex":0.00005695778,"about_ca_system_score_gemma":0.000015178519,"threshold_uncertainty_score":0.44157967},"labels":[],"label_agreement":null},{"id":"W4285464686","doi":"10.32920/ryerson.14651595","title":"Enhancement of Wyner-Ziv video coding for wireless channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; Encoder; Decoding methods; Algorithm; Coding (social sciences); Channel (broadcasting); Wireless; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.031899828977247566,"score_gpt":0.2813180670560394,"score_spread":0.24941823807879182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285464686","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.10993388,0.0012727038,0.8801693,0.00018764124,0.00071335654,0.0010335471,0.000042709027,0.0009549968,0.0056918827],"genre_scores_gemma":[0.9539659,0.0021975157,0.042461433,0.000037578822,0.00007610432,0.0008051188,0.00020073811,0.000072330586,0.00018325225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986281,0.00003567173,0.000598276,0.00029185583,0.00020695706,0.00023915702],"domain_scores_gemma":[0.99820215,0.00015468712,0.00014065347,0.0011929303,0.00025504257,0.00005454796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003013267,0.0002835803,0.0005691654,0.0001491225,0.00003535212,0.00007221976,0.00070963125,0.00032155993,0.00014735978],"category_scores_gemma":[0.000030154652,0.00032797767,0.00020926849,0.000105435254,0.00003785372,0.00007548845,0.00076362136,0.00039650121,0.0000024628805],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054622436,0.0007598873,0.000100374906,0.024622584,0.0020251814,0.0000080434575,0.012375951,0.035241585,0.7312553,0.07609126,0.03065156,0.08681367],"study_design_scores_gemma":[0.00014586022,0.00001772129,0.000005867817,0.0007714038,0.000028279612,7.028763e-7,0.00017894788,0.09693744,0.8973614,0.0009061592,0.0032863852,0.00035980414],"about_ca_topic_score_codex":0.00005084896,"about_ca_topic_score_gemma":0.000030481555,"teacher_disagreement_score":0.84403205,"about_ca_system_score_codex":0.00013723399,"about_ca_system_score_gemma":0.000051787298,"threshold_uncertainty_score":0.9999172},"labels":[],"label_agreement":null},{"id":"W4287854949","doi":"10.1109/mnet.002.2100312","title":"Autonomous Collaborative Authentication with Privacy Preservation in 6G: From Homogeneity to Heterogeneity","year":2022,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"H2020 European Research Council; National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Computer security; Overhead (engineering); Information sharing; Computer network; World Wide Web","score_opus":0.0170007635704327,"score_gpt":0.24865339090557173,"score_spread":0.23165262733513903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287854949","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.98727804,0.0003005422,0.010093829,0.00027825663,0.00033878558,0.00069900445,0.000058782847,0.00056498614,0.00038774096],"genre_scores_gemma":[0.9898276,0.000026207765,0.008870958,0.00012332278,0.00018681021,0.0008150323,0.000098107885,0.000038181213,0.000013799882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99888545,0.00019288332,0.00025985597,0.00022336662,0.00021643878,0.00022200725],"domain_scores_gemma":[0.9990202,0.000094793824,0.00006106519,0.0007022807,0.00006227488,0.00005936073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026668058,0.00014076185,0.00017768129,0.00008448481,0.00014403294,0.00003934161,0.00047676984,0.00004849109,0.00002409382],"category_scores_gemma":[0.000012131855,0.00016413769,0.000021623935,0.00093318854,0.000019596659,0.00018415845,0.00015107226,0.0002536451,0.000009298388],"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.000091758215,0.000101109064,0.015713245,0.000011170605,0.00005275296,0.000003762147,0.0042856787,0.96575534,0.0038469997,0.00033831722,0.008264222,0.0015356475],"study_design_scores_gemma":[0.001839866,0.00058709877,0.38818246,0.00018642684,0.00007374209,0.000007693736,0.0004691718,0.26990798,0.0708983,0.009614431,0.25635582,0.0018770152],"about_ca_topic_score_codex":0.00016247512,"about_ca_topic_score_gemma":0.0008463587,"teacher_disagreement_score":0.69584733,"about_ca_system_score_codex":0.00034032273,"about_ca_system_score_gemma":0.000044118584,"threshold_uncertainty_score":0.66933405},"labels":[],"label_agreement":null},{"id":"W4287855148","doi":"10.1109/mnet.005.2100336","title":"Audio-Based Security Techniques for Secure Device-to-Device Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Security Techniques","field":"Engineering","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 New Brunswick; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Jamming; Computer security; Computer network; Key (lock); Secure communication; Transmission (telecommunications); Secure transmission; Telecommunications; Encryption","score_opus":0.02778900915874035,"score_gpt":0.2883409479884754,"score_spread":0.2605519388297351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287855148","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.09213602,0.02781715,0.6123429,0.037348937,0.012382538,0.02989697,0.0030667114,0.071160756,0.11384803],"genre_scores_gemma":[0.9293138,0.00012868922,0.06303251,0.0020285551,0.00058504805,0.004565226,0.00018840126,0.00012378914,0.000033991015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838734,0.00021742751,0.00042797846,0.00025619453,0.00026144306,0.00044960453],"domain_scores_gemma":[0.9969032,0.00046738767,0.000092103786,0.0022686368,0.00014119242,0.00012752415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007398378,0.00025270903,0.00031102996,0.00014791726,0.0006973104,0.000057401452,0.0019849732,0.000117415286,0.0000401316],"category_scores_gemma":[0.000025221325,0.00032553525,0.0001411987,0.0008572828,0.000060637925,0.000104830855,0.00039549466,0.0006831667,0.00001574151],"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.00007177066,0.00023770882,0.0003198575,0.00022295106,0.000115780975,0.0000023583175,0.0015205261,0.114959225,0.001835704,0.0067581763,0.8669564,0.006999539],"study_design_scores_gemma":[0.00016941497,0.00008711571,0.000045751294,0.000060285372,0.000026237787,0.000003386086,0.0000619763,0.048714757,0.0047893953,0.00448875,0.94115186,0.0004010912],"about_ca_topic_score_codex":0.000029809988,"about_ca_topic_score_gemma":0.00021691954,"teacher_disagreement_score":0.83717775,"about_ca_system_score_codex":0.0003021145,"about_ca_system_score_gemma":0.000058622136,"threshold_uncertainty_score":0.99991965},"labels":[],"label_agreement":null},{"id":"W4288752527","doi":"10.1007/s11432-021-3262-3","title":"Outage-driven link selection for secure buffer-aided networks","year":2022,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"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":"","keywords":"Secrecy; Computer science; Computer network; Channel state information; Communication source; Queue; Channel (broadcasting); Queueing theory; Transmission (telecommunications); Wireless; Computer security; Telecommunications","score_opus":0.012298448084369903,"score_gpt":0.25974184022435853,"score_spread":0.24744339213998862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288752527","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.25820762,0.00014910511,0.71451384,0.002171867,0.0017151887,0.0016292813,0.00005469529,0.003556583,0.018001853],"genre_scores_gemma":[0.9881575,0.000030794818,0.011280082,0.00018858023,0.000044229724,0.0002607908,0.000019275683,0.000006282832,0.000012437011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834037,0.000034204066,0.0003636169,0.00016410305,0.0007253086,0.00037238796],"domain_scores_gemma":[0.99931556,0.000067660745,0.00013285225,0.0002591071,0.00014692853,0.000077915276],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002182355,0.00012429961,0.000120627854,0.0005244916,0.002194901,0.00042632455,0.001407493,0.00003860721,0.000050960705],"category_scores_gemma":[0.00012718086,0.00012309998,0.000050032755,0.0025940437,0.0004912524,0.003859552,0.00025041198,0.00027619483,0.000009102987],"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.000004432053,0.000010469583,0.0005996534,0.000021804797,0.0000034332725,4.251616e-8,0.0044830074,0.9509013,0.00097430265,0.017091516,0.003162336,0.022747666],"study_design_scores_gemma":[0.00010349636,0.00009437891,0.0011074941,0.000006428487,0.0000022708434,0.000009766106,0.000573076,0.97429276,0.001823768,0.0011023752,0.02071537,0.00016884875],"about_ca_topic_score_codex":0.000025299712,"about_ca_topic_score_gemma":0.000010749861,"teacher_disagreement_score":0.7299499,"about_ca_system_score_codex":0.00023619752,"about_ca_system_score_gemma":0.00015487785,"threshold_uncertainty_score":0.9991041},"labels":[],"label_agreement":null},{"id":"W4289655492","doi":"10.1109/isit50566.2022.9834771","title":"Two-terminal source coding with common sum reconstruction","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"University of Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Modulo; Source code; Algorithm; Distributed source coding; Computer science; Computation; Coding (social sciences); Binary number; Theoretical computer science; Rate distortion; Lossy compression; Terminal (telecommunication); Discrete mathematics; Variable-length code; Mathematics; Decoding methods; Arithmetic; Artificial intelligence; Computer network; Statistics","score_opus":0.0074796377199129,"score_gpt":0.2318155201879125,"score_spread":0.2243358824679996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655492","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.7397527,0.000043347067,0.07178499,0.001062847,0.0031650062,0.00083056587,0.00030514775,0.0024509118,0.18060447],"genre_scores_gemma":[0.9979317,0.00004960342,0.0005148073,0.00052315526,0.000102495345,0.00028407245,0.00029544835,0.00003354323,0.000265159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983285,0.00016246294,0.00052784337,0.00013765189,0.0006446957,0.00019884424],"domain_scores_gemma":[0.99899346,0.00017338223,0.00023027329,0.00042681486,0.000113239155,0.00006283097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066022435,0.00020975963,0.00017538478,0.00036818447,0.00038405592,0.00016193361,0.00072598207,0.00005189735,0.000893193],"category_scores_gemma":[0.000012489456,0.00022869447,0.00007615122,0.00025400717,0.0000682891,0.001235147,0.00014332596,0.0005883325,0.00009958665],"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.0010459536,0.0001857025,0.0017288865,0.00010820737,0.00042342945,0.000014836363,0.008619547,0.6028153,0.010170748,0.2773672,0.008435282,0.089084946],"study_design_scores_gemma":[0.0042175474,0.0007935503,0.0007638689,0.000325858,0.00009616764,0.002211663,0.00877339,0.6390872,0.08018889,0.009971514,0.251457,0.0021133255],"about_ca_topic_score_codex":0.000022883045,"about_ca_topic_score_gemma":0.000008376076,"teacher_disagreement_score":0.26739568,"about_ca_system_score_codex":0.0006489507,"about_ca_system_score_gemma":0.000023658806,"threshold_uncertainty_score":0.9779837},"labels":[],"label_agreement":null},{"id":"W4291722333","doi":"10.1109/tvt.2022.3175971","title":"Secure Transmission for MISO Wiretap Channels Using General Multi-Fractional Fourier Transform: An Approach in Signal Domain","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Windsor","funders":"Natural Science Foundation of Heilongjiang Province; National Natural Science Foundation of China","keywords":"Artificial noise; Transmitter; Transmission (telecommunications); Computer science; Secure transmission; Interference (communication); Superposition principle; Transmitter power output; SIGNAL (programming language); Noise (video); Electronic engineering; Signal-to-noise ratio (imaging); Channel (broadcasting); Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.024563900415730016,"score_gpt":0.2668105868319682,"score_spread":0.24224668641623817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291722333","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.20549078,0.00021074811,0.79182166,0.00038473555,0.00013618516,0.00086464797,0.00008966821,0.0009792896,0.000022282904],"genre_scores_gemma":[0.8186229,0.000055551543,0.17966312,0.00005077933,0.000022807557,0.0014185738,0.000052853105,0.000092520044,0.00002091981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982168,0.00013494176,0.0004603529,0.00043340662,0.00029922058,0.00045526403],"domain_scores_gemma":[0.9992139,0.000037548878,0.000053765027,0.00055173814,0.00005639038,0.00008668631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036246746,0.00032005113,0.00036217604,0.001038593,0.0005009969,0.000025316773,0.00056817953,0.00043745118,0.000101476806],"category_scores_gemma":[9.637977e-7,0.00038410322,0.0001974151,0.0008493405,0.000113086884,0.00025407883,0.000003960305,0.001287884,0.0000013233873],"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.00008313039,0.0007485863,0.000005195578,0.00006159,0.00007431207,0.000008821329,0.0008944731,0.8906019,0.07586037,0.0005515406,0.000019606723,0.031090524],"study_design_scores_gemma":[0.0013019507,0.00019605734,0.000004706288,0.000020560381,0.00003242873,0.000117060685,0.0005086116,0.9185866,0.071870424,0.0017015601,0.005254783,0.00040524805],"about_ca_topic_score_codex":0.000031151434,"about_ca_topic_score_gemma":0.000022937124,"teacher_disagreement_score":0.61313206,"about_ca_system_score_codex":0.00040017389,"about_ca_system_score_gemma":0.000057477777,"threshold_uncertainty_score":0.99986106},"labels":[],"label_agreement":null},{"id":"W4292157874","doi":"10.1016/j.eswa.2022.118394","title":"GPDS: A multi-agent deep reinforcement learning game for anti-jamming secure computing in MEC network","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"National Key Research and Development Program of China; State Key Laboratory of Industrial Control Technology; Zhejiang University; Hunan Provincial Innovation Foundation for Postgraduate; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Jamming; Artificial intelligence; Computer security; Distributed computing","score_opus":0.016364903858268578,"score_gpt":0.2595943896520062,"score_spread":0.24322948579373763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292157874","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.0043960605,0.0029429484,0.9885523,0.0000748108,0.00008610253,0.0026505745,0.0000037168809,0.00093679136,0.00035673234],"genre_scores_gemma":[0.96390635,0.000084508894,0.022954855,0.00005172468,0.00012561626,0.012621614,0.00011889804,0.000076348966,0.000060095954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851406,0.00009814197,0.0005112383,0.0002721864,0.00023059426,0.00037379045],"domain_scores_gemma":[0.9989795,0.00015229576,0.00015046643,0.00058197184,0.00006707648,0.0000686976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044619324,0.00020168963,0.0002909824,0.00014343865,0.0004698229,0.0000613864,0.0004510339,0.00005892,0.000010961369],"category_scores_gemma":[0.000008987696,0.0002233309,0.000051961655,0.00051815313,0.000024100058,0.00008466919,0.00017048481,0.00039018775,0.000005085861],"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.000004562501,0.000036513113,0.00043380258,0.000076644894,0.000031716267,7.728879e-7,0.0049262717,0.98921865,0.00047138473,0.003295024,0.00047187702,0.0010327635],"study_design_scores_gemma":[0.00039381481,0.000038351718,0.000071118346,0.000080744045,0.0000051559205,0.000011859199,0.0029436068,0.806178,0.00011903661,0.000010370489,0.18990445,0.00024352976],"about_ca_topic_score_codex":0.00013780124,"about_ca_topic_score_gemma":0.000048215792,"teacher_disagreement_score":0.9655974,"about_ca_system_score_codex":0.00039341167,"about_ca_system_score_gemma":0.000026235966,"threshold_uncertainty_score":0.910717},"labels":[],"label_agreement":null},{"id":"W4292969453","doi":"10.1109/tifs.2022.3201386","title":"On Message Authentication Channel Capacity Over a Wiretap Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"National Natural Science Foundation of China","keywords":"Computer science; Channel (broadcasting); Computer network; Code word; Secrecy; Alice and Bob; Message authentication code; Channel capacity; Authentication (law); Key (lock); Topology (electrical circuits); Coding (social sciences); Transmitter; Decoding methods; Computer security; Telecommunications; Mathematics; Cryptography; Combinatorics; Alice (programming language)","score_opus":0.011732698473157617,"score_gpt":0.20909324173522306,"score_spread":0.19736054326206545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292969453","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.41319478,0.000045452078,0.5793017,0.00041850927,0.000834727,0.00077262835,0.00075949734,0.0012287908,0.0034438733],"genre_scores_gemma":[0.99898463,0.00013611751,0.00016782207,0.00035440837,0.0000109013545,0.0002520724,0.000060306913,0.000020135758,0.000013580645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989024,0.000055514887,0.00035989267,0.0001223735,0.00036113625,0.0001987246],"domain_scores_gemma":[0.9992641,0.00008303167,0.000087248394,0.00042293064,0.000070182265,0.00007246277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026959545,0.0001944511,0.00017324589,0.00029737808,0.0005368136,0.00007799214,0.00019029743,0.00009199738,0.000115127834],"category_scores_gemma":[0.0000058588603,0.00022342325,0.00008296915,0.00028825417,0.00007043676,0.00068304554,0.000007052276,0.00059717445,0.000018696046],"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.00045295438,0.001033414,0.000014046127,0.00089892914,0.00056659296,0.00000422588,0.16710652,0.46053421,0.00084192783,0.28251222,0.019839117,0.06619584],"study_design_scores_gemma":[0.0007784599,0.00026381656,0.00021311072,0.000052819152,0.000043906035,0.000021276792,0.00094110146,0.9347504,0.00885587,0.045904454,0.0075623887,0.0006124265],"about_ca_topic_score_codex":0.000042746466,"about_ca_topic_score_gemma":0.000026440019,"teacher_disagreement_score":0.58578986,"about_ca_system_score_codex":0.00016687215,"about_ca_system_score_gemma":0.000014070233,"threshold_uncertainty_score":0.9110936},"labels":[],"label_agreement":null},{"id":"W4295973897","doi":"10.4108/eetinis.v9i32.1909","title":"Intelligent Bi-directional Relaying Communication for Edge Intelligence based Industrial IoT Networks","year":2022,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Huawei Technologies (Canada)","funders":"","keywords":"Rayleigh fading; Enhanced Data Rates for GSM Evolution; Computer science; Channel (broadcasting); Group (periodic table); Range (aeronautics); Communications system; Channel state information; Order (exchange); Fading; Signal-to-noise ratio (imaging); Telecommunications; Wireless; Engineering; Business; Physics","score_opus":0.06043244985038614,"score_gpt":0.2573885266375754,"score_spread":0.19695607678718924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295973897","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.0016268026,0.0027535022,0.9870001,0.00030020758,0.0041670054,0.0026347581,0.00012441372,0.0009899028,0.00040328517],"genre_scores_gemma":[0.9936759,0.001364942,0.00073946425,0.00010427224,0.00069370784,0.0028291275,0.00025330653,0.00013615681,0.00020315945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630404,0.0006896249,0.0013533275,0.0005460596,0.0004883095,0.0006186638],"domain_scores_gemma":[0.9968595,0.0014490734,0.00029761653,0.0009922734,0.00015510693,0.00024646745],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015890864,0.0005257848,0.00061488943,0.00057346816,0.0014189413,0.00024639477,0.0008204138,0.0005582077,0.00029182766],"category_scores_gemma":[0.00004899382,0.00060497684,0.00029791085,0.0010011003,0.00015929835,0.00016907093,0.00004753728,0.0025584379,0.0000058015426],"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.00025373133,0.00018081084,0.000045440895,0.00002007769,0.00015819607,0.0000010440023,0.0001780309,0.9421387,0.000016980639,0.0011759701,0.0040377025,0.051793344],"study_design_scores_gemma":[0.00063883344,0.0003434772,0.000002861453,0.00021376405,0.000075775024,0.000018906065,0.0008860039,0.8596259,0.0012117333,0.00005339789,0.13640386,0.00052552],"about_ca_topic_score_codex":0.00020372627,"about_ca_topic_score_gemma":0.00004187224,"teacher_disagreement_score":0.99204904,"about_ca_system_score_codex":0.00070237496,"about_ca_system_score_gemma":0.000093307994,"threshold_uncertainty_score":0.9998811},"labels":[],"label_agreement":null},{"id":"W4299831463","doi":"10.48550/arxiv.1512.06298","title":"Streaming Data Transmission in the Moderate Deviations and Central Limit\\n Regimes","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Erasure; Decoding methods; Encoder; Large deviations theory; Noisy-channel coding theorem; Limit (mathematics); Coding (social sciences); Central limit theorem; Computer science; Channel (broadcasting); Mathematics; Range (aeronautics); Algorithm; Block code; Statistics; Telecommunications; Mathematical analysis","score_opus":0.1566397823080948,"score_gpt":0.22330703138284197,"score_spread":0.06666724907474716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299831463","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.61552763,0.0027495753,0.3727106,0.0008937095,0.00012587478,0.0013106384,0.00022575131,0.000464474,0.0059917686],"genre_scores_gemma":[0.97911984,0.018009765,0.0022559832,0.00003112805,0.0000414749,0.0000027634774,0.00033970672,0.00004894896,0.00015040104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973962,0.0005788867,0.00039545159,0.0009785864,0.00014409152,0.0005067897],"domain_scores_gemma":[0.995771,0.0003493284,0.00019994928,0.0033297068,0.00013637364,0.00021366282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007198837,0.0004867586,0.00047299912,0.000338276,0.00027007115,0.00021743363,0.0032035273,0.00047559149,0.000021019634],"category_scores_gemma":[0.000056123583,0.0005165975,0.000086487045,0.0006686284,0.00019873568,0.0008874699,0.0017280788,0.0014595033,0.000008445373],"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.00015486794,0.00052186893,0.0029362552,0.00058752985,0.00029483187,0.00019477821,0.016920954,0.84565634,0.00010153019,0.11286272,0.0014403934,0.018327957],"study_design_scores_gemma":[0.0005389841,0.00002210429,0.0023563884,0.00048078998,0.00018410021,0.000008150165,0.0019815434,0.97654635,0.00008371493,0.011525272,0.00572883,0.00054377294],"about_ca_topic_score_codex":0.00063909293,"about_ca_topic_score_gemma":0.0003756754,"teacher_disagreement_score":0.3704546,"about_ca_system_score_codex":0.00032789618,"about_ca_system_score_gemma":0.00021804744,"threshold_uncertainty_score":0.99972856},"labels":[],"label_agreement":null},{"id":"W4300803856","doi":"10.1109/icc45855.2022.9838746","title":"Towards Improving the Security of Cognitive Radio Networks-Based Energy Harvesting","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Transmitter; Cognitive radio; Rayleigh fading; Jamming; Computer network; Underlay; Fading; Computer science; Energy harvesting; Channel (broadcasting); Energy (signal processing); Wireless; Physical layer; Telecommunications; Signal-to-noise ratio (imaging); Physics","score_opus":0.05840315086530686,"score_gpt":0.3067867448102028,"score_spread":0.24838359394489593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300803856","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.097546466,0.004996708,0.48620036,0.022491595,0.003792147,0.002386801,0.0028113562,0.0037584212,0.37601614],"genre_scores_gemma":[0.99683714,0.0005659356,0.0010521766,0.0003272232,0.0000451468,0.0006934378,0.0003585633,0.000037446,0.0000829442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820286,0.00044140368,0.0004877611,0.00018975626,0.00048806643,0.00019013092],"domain_scores_gemma":[0.9968985,0.00094293524,0.00024534223,0.0015259754,0.00033627552,0.00005101213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057965005,0.00018779498,0.00019907228,0.00021070549,0.0005204485,0.000088531946,0.0033645402,0.000056519377,0.0004850267],"category_scores_gemma":[0.00014711336,0.00019598604,0.000116576106,0.0004010538,0.0002590997,0.0001650232,0.00072681456,0.0008938026,0.0000032792711],"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.00012642049,0.0009703783,0.0006887716,0.000044451168,0.00051073224,0.000005305349,0.004250458,0.09339103,0.009056259,0.8017027,0.0056559155,0.08359757],"study_design_scores_gemma":[0.0002942684,0.000068577,0.0002740475,0.00008669317,0.0000232261,0.000007465027,0.00087964576,0.9833354,0.003348128,0.0028023308,0.008645612,0.00023462705],"about_ca_topic_score_codex":0.000514346,"about_ca_topic_score_gemma":0.00030865573,"teacher_disagreement_score":0.8992907,"about_ca_system_score_codex":0.00024396504,"about_ca_system_score_gemma":0.00013695241,"threshold_uncertainty_score":0.79920787},"labels":[],"label_agreement":null},{"id":"W4300856996","doi":"10.48550/arxiv.1103.3054","title":"On the Capacity of Memoryless Finite-State Multiple Access Channels with\\n Asymmetric Noisy State Information at the Encoders","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent and identically distributed random variables; Encoder; State (computer science); State information; Upper and lower bounds; Channel (broadcasting); Finite state; Channel capacity; Computer science; Information theory; Topology (electrical circuits); Mathematics; Computer network; Algorithm; Combinatorics; Random variable; Statistics; Mathematical analysis; Markov chain","score_opus":0.09174483541347649,"score_gpt":0.18928580283003957,"score_spread":0.09754096741656308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300856996","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.81384146,0.000047606514,0.17731975,0.00012041718,0.0003008768,0.0018834319,0.000292916,0.0003228293,0.0058707152],"genre_scores_gemma":[0.99681824,0.0024456577,0.00014692095,0.00012249529,0.00001574055,0.000025868778,0.00007358044,0.00007312378,0.00027839784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680626,0.00065818854,0.0008452633,0.0006704066,0.00036506978,0.0006548089],"domain_scores_gemma":[0.99157244,0.0025052542,0.0013577141,0.0036250015,0.0007490883,0.00019050344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011901918,0.00082125707,0.00074522407,0.0009807931,0.00063173304,0.00022262905,0.0046509565,0.00039650657,0.00016779313],"category_scores_gemma":[0.0003800266,0.000644263,0.0003511595,0.0022677905,0.00090446015,0.0014901996,0.0028130326,0.0018993401,0.00013824545],"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.0004029223,0.00014744201,0.0009547733,0.00038063058,0.0004476627,0.000013222131,0.008808743,0.97683704,0.000035541474,0.0108839935,0.00018573372,0.0009022706],"study_design_scores_gemma":[0.0016872707,0.00027580783,0.0024196007,0.0008618469,0.00034035507,0.0000074967265,0.0014393218,0.9130451,0.054881003,0.022210466,0.0011760077,0.0016556993],"about_ca_topic_score_codex":0.0028077187,"about_ca_topic_score_gemma":0.0011620704,"teacher_disagreement_score":0.18297677,"about_ca_system_score_codex":0.00074810133,"about_ca_system_score_gemma":0.00015483705,"threshold_uncertainty_score":0.9996009},"labels":[],"label_agreement":null},{"id":"W4303959454","doi":"10.48550/arxiv.2007.04080","title":"Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Probability of error; Binary symmetric channel; Decoding methods; Binary number; Mathematics; Upper and lower bounds; Channel (broadcasting); Context (archaeology); Algorithm; Binary erasure channel; Channel code; Coding (social sciences); Combinatorics; Discrete mathematics; Statistics; Computer science; Channel capacity; Telecommunications; Arithmetic; Mathematical analysis","score_opus":0.10115476988804077,"score_gpt":0.20603985622857854,"score_spread":0.10488508634053777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303959454","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.9810921,0.00096496084,0.011509128,0.0006767115,0.0005859395,0.0009930829,0.00008089453,0.000794236,0.0033029802],"genre_scores_gemma":[0.99836814,0.0012294048,0.00009638406,0.00006849776,0.000043166438,0.000008721106,0.000011219953,0.00005745036,0.00011699127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866974,0.00028006212,0.00025851143,0.00040472162,0.00014825918,0.00023871569],"domain_scores_gemma":[0.99735034,0.00027984788,0.00021108046,0.001973887,0.00010885293,0.00007602189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027609162,0.00033907566,0.0004044381,0.000267266,0.00014839618,0.000040925628,0.00254888,0.00029229515,0.000026043801],"category_scores_gemma":[0.00005993778,0.00027523577,0.00033829577,0.0009169871,0.00022732624,0.00010345926,0.002435524,0.0010565493,0.000019607938],"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.000108933345,0.00022532,0.0011679557,0.001452509,0.00083029136,0.00006147265,0.004955269,0.91550714,0.0023807103,0.067339666,0.00527392,0.00069684343],"study_design_scores_gemma":[0.0007573732,0.000091528535,0.012933937,0.0008142661,0.00051237445,0.0000070325987,0.0022185042,0.92564493,0.036512926,0.016985718,0.0021471705,0.0013742272],"about_ca_topic_score_codex":0.00010046027,"about_ca_topic_score_gemma":0.000034654284,"teacher_disagreement_score":0.050353948,"about_ca_system_score_codex":0.00019812642,"about_ca_system_score_gemma":0.0000587911,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W4309738116","doi":"10.36227/techrxiv.21547695.v1","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Pre-shared key; Physical unclonable function; Computer network; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.037165653452710196,"score_gpt":0.2783774802418525,"score_spread":0.2412118267891423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309738116","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.9737319,0.00019735719,0.020769248,0.00016140282,0.00039361237,0.00044801267,0.00016981013,0.0016687961,0.0024599133],"genre_scores_gemma":[0.9928298,0.00016826826,0.0052259206,0.00005700264,0.00060853723,0.00024291917,0.0006382498,0.00009556746,0.00013371366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984977,0.00020450293,0.00028346322,0.0004641718,0.00027868204,0.00027145707],"domain_scores_gemma":[0.998607,0.00008916718,0.00008389607,0.0010220137,0.00009580524,0.0001021094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022864256,0.00038854594,0.00047383606,0.00015017355,0.00026653692,0.00018277256,0.00036339447,0.00020688634,0.0002064126],"category_scores_gemma":[0.000017498885,0.00043787388,0.00013341084,0.0002059445,0.00007032791,0.00021808446,0.0013138896,0.0013913114,0.000012193769],"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.000021525775,0.00066770473,0.00021905675,0.0007211979,0.00054368685,0.000011906627,0.010268145,0.7607349,0.15235266,0.057072308,0.015777593,0.0016092632],"study_design_scores_gemma":[0.00013978535,0.000024394501,0.00007232494,0.000024258672,0.00007929367,0.0000036143094,0.00014922883,0.96934706,0.01513867,0.009140301,0.005359193,0.0005218534],"about_ca_topic_score_codex":0.00048460384,"about_ca_topic_score_gemma":0.00007341377,"teacher_disagreement_score":0.20861214,"about_ca_system_score_codex":0.00030296322,"about_ca_system_score_gemma":0.00006127683,"threshold_uncertainty_score":0.9998073},"labels":[],"label_agreement":null},{"id":"W4309741840","doi":"10.36227/techrxiv.21547695","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Physical unclonable function; Pre-shared key; Computer network; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.037165653452710196,"score_gpt":0.2783774802418525,"score_spread":0.2412118267891423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309741840","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.9737319,0.00019735719,0.020769248,0.00016140282,0.00039361237,0.00044801267,0.00016981013,0.0016687961,0.0024599133],"genre_scores_gemma":[0.9928298,0.00016826826,0.0052259206,0.00005700264,0.00060853723,0.00024291917,0.0006382498,0.00009556746,0.00013371366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984977,0.00020450293,0.00028346322,0.0004641718,0.00027868204,0.00027145707],"domain_scores_gemma":[0.998607,0.00008916718,0.00008389607,0.0010220137,0.00009580524,0.0001021094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022864256,0.00038854594,0.00047383606,0.00015017355,0.00026653692,0.00018277256,0.00036339447,0.00020688634,0.0002064126],"category_scores_gemma":[0.000017498885,0.00043787388,0.00013341084,0.0002059445,0.00007032791,0.00021808446,0.0013138896,0.0013913114,0.000012193769],"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.000021525775,0.00066770473,0.00021905675,0.0007211979,0.00054368685,0.000011906627,0.010268145,0.7607349,0.15235266,0.057072308,0.015777593,0.0016092632],"study_design_scores_gemma":[0.00013978535,0.000024394501,0.00007232494,0.000024258672,0.00007929367,0.0000036143094,0.00014922883,0.96934706,0.01513867,0.009140301,0.005359193,0.0005218534],"about_ca_topic_score_codex":0.00048460384,"about_ca_topic_score_gemma":0.00007341377,"teacher_disagreement_score":0.20861214,"about_ca_system_score_codex":0.00030296322,"about_ca_system_score_gemma":0.00006127683,"threshold_uncertainty_score":0.9998073},"labels":[],"label_agreement":null},{"id":"W4310360835","doi":"10.36227/techrxiv.21568656.v1","title":"Bit-Interleaved Coded Energy-Based Modulation with Iterative Decoding","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise error probability; Decoding methods; Computer science; Algorithm; Coding gain; Energy (signal processing); Turbo code; Modulation (music); Coding (social sciences); Bit error rate; Theoretical computer science; Mathematics; Fading; Statistics; Physics","score_opus":0.018905905146468997,"score_gpt":0.248205955793354,"score_spread":0.229300050646885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310360835","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.04780366,0.00019090399,0.92690337,0.00018855388,0.00017517654,0.0003998913,0.000055672044,0.0036802702,0.020602534],"genre_scores_gemma":[0.92949355,0.00006511543,0.06888236,0.00012586686,0.000028995888,0.0005462777,0.00063060736,0.00009408471,0.00013316209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874574,0.00011643584,0.00035027094,0.00032148996,0.00027372906,0.00019235938],"domain_scores_gemma":[0.9985637,0.00010498237,0.000111372596,0.0010600938,0.00010278174,0.00005707427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014700681,0.00033191981,0.0003335952,0.00031848438,0.00009789933,0.00013243627,0.00057837047,0.00018097462,0.0005867983],"category_scores_gemma":[0.000008933336,0.00033633813,0.00009211608,0.0001858203,0.00003468275,0.00010508328,0.0004323141,0.0006977742,0.0000034462075],"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.000044325923,0.00007081943,0.00032946226,0.00024682787,0.00019271423,0.000008555154,0.0012355308,0.9726059,0.0024347731,0.0123779755,0.0018556167,0.00859749],"study_design_scores_gemma":[0.00021785626,0.00003420788,0.000103778744,0.00017582334,0.000016640586,0.000001269434,0.000072796676,0.97180134,0.02200764,0.0016959705,0.003422513,0.00045015465],"about_ca_topic_score_codex":0.00011809725,"about_ca_topic_score_gemma":0.00026221763,"teacher_disagreement_score":0.88168985,"about_ca_system_score_codex":0.00038570378,"about_ca_system_score_gemma":0.00005777927,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W4310360836","doi":"10.36227/techrxiv.21568656","title":"Bit-Interleaved Coded Energy-Based Modulation with Iterative Decoding","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise error probability; Decoding methods; Computer science; Algorithm; Coding gain; Energy (signal processing); Turbo code; Modulation (music); Coding (social sciences); Theoretical computer science; Mathematics; Fading; Statistics","score_opus":0.018905905146468997,"score_gpt":0.248205955793354,"score_spread":0.229300050646885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310360836","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.04780366,0.00019090399,0.92690337,0.00018855388,0.00017517654,0.0003998913,0.000055672044,0.0036802702,0.020602534],"genre_scores_gemma":[0.92949355,0.00006511543,0.06888236,0.00012586686,0.000028995888,0.0005462777,0.00063060736,0.00009408471,0.00013316209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874574,0.00011643584,0.00035027094,0.00032148996,0.00027372906,0.00019235938],"domain_scores_gemma":[0.9985637,0.00010498237,0.000111372596,0.0010600938,0.00010278174,0.00005707427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014700681,0.00033191981,0.0003335952,0.00031848438,0.00009789933,0.00013243627,0.00057837047,0.00018097462,0.0005867983],"category_scores_gemma":[0.000008933336,0.00033633813,0.00009211608,0.0001858203,0.00003468275,0.00010508328,0.0004323141,0.0006977742,0.0000034462075],"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.000044325923,0.00007081943,0.00032946226,0.00024682787,0.00019271423,0.000008555154,0.0012355308,0.9726059,0.0024347731,0.0123779755,0.0018556167,0.00859749],"study_design_scores_gemma":[0.00021785626,0.00003420788,0.000103778744,0.00017582334,0.000016640586,0.000001269434,0.000072796676,0.97180134,0.02200764,0.0016959705,0.003422513,0.00045015465],"about_ca_topic_score_codex":0.00011809725,"about_ca_topic_score_gemma":0.00026221763,"teacher_disagreement_score":0.88168985,"about_ca_system_score_codex":0.00038570378,"about_ca_system_score_gemma":0.00005777927,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W4312050867","doi":"10.1109/tcomm.2022.3218822","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Upper and lower bounds; Encoder; Lossy compression; Gaussian; Mathematics; Distortion (music); Algorithm; Discrete mathematics; Cramér–Rao bound; Combinatorics; Computer science; Mathematical analysis; Statistics; Telecommunications; Physics","score_opus":0.0212321375510016,"score_gpt":0.2501063285394391,"score_spread":0.2288741909884375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050867","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.030216778,0.0006749893,0.95072716,0.0018130374,0.0004093114,0.0007576395,0.0013954516,0.0023548426,0.011650757],"genre_scores_gemma":[0.9963146,0.00079934625,0.0022378599,0.00006479645,0.0000040374093,0.0003458728,0.00011437976,0.000049692484,0.00006942904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985374,0.00028501658,0.0004966593,0.00015794003,0.0003203231,0.00020263504],"domain_scores_gemma":[0.99635184,0.00087310205,0.00011263486,0.0024977042,0.00008522258,0.00007950264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025432685,0.00018385057,0.00024756367,0.00053016696,0.0007823692,0.00002779502,0.001644268,0.00008479793,0.0002531866],"category_scores_gemma":[0.000017477962,0.00022282962,0.00014418093,0.0014579193,0.00016296726,0.00009655586,0.000025636164,0.0011284127,0.000025362417],"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.000117724114,0.0031950881,0.00007199137,0.000099103105,0.00053708104,0.0000033933495,0.0029886186,0.8947452,0.009174565,0.05473049,0.005348738,0.028988047],"study_design_scores_gemma":[0.0022023262,0.0010287253,0.0009301508,0.00036960817,0.00029162105,0.000057665075,0.0021584602,0.8414284,0.090417705,0.005039375,0.05442802,0.0016479164],"about_ca_topic_score_codex":0.00005589534,"about_ca_topic_score_gemma":0.000035187648,"teacher_disagreement_score":0.96609783,"about_ca_system_score_codex":0.00028165587,"about_ca_system_score_gemma":0.000034952907,"threshold_uncertainty_score":0.9086728},"labels":[],"label_agreement":null},{"id":"W4312708751","doi":"10.1049/cmu2.12445","title":"Distributed secure transmission for covert communication under multi‐user network","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Covert; Collusion; Computer network; Computer security; Transmission (telecommunications); Covert channel; Robustness (evolution); Telecommunications","score_opus":0.02975631721788517,"score_gpt":0.2822354633162386,"score_spread":0.2524791460983534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312708751","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.0017605204,0.012203057,0.96803594,0.009228314,0.00014968775,0.0019022767,0.00094354735,0.0028842313,0.0028924143],"genre_scores_gemma":[0.8533488,0.003271268,0.13627037,0.00038277986,0.00002018244,0.0024295547,0.0040132385,0.00009487077,0.00016894264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998388,0.00040973836,0.000487721,0.00018027058,0.00021332175,0.00032097078],"domain_scores_gemma":[0.9949027,0.00060831395,0.000110615445,0.004140589,0.00014494265,0.00009288254],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005658014,0.00021696668,0.00025047237,0.00009317373,0.0015349494,0.0000662834,0.00306129,0.00011249754,0.00012334899],"category_scores_gemma":[0.0000236061,0.0002685973,0.00015127976,0.00057863106,0.00013467105,0.00021363249,0.0008576037,0.00078000006,0.000009629654],"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.00007249352,0.0010518847,0.0005146961,0.00012988066,0.00034179824,4.5646198e-7,0.0032863542,0.40839657,0.0036171866,0.28035474,0.2886917,0.013542267],"study_design_scores_gemma":[0.00053658476,0.000029246658,0.00044006162,0.000032585172,0.00003478096,0.0000049664627,0.0003865359,0.19208331,0.00026702974,0.0056046033,0.80027974,0.00030058183],"about_ca_topic_score_codex":0.00003954015,"about_ca_topic_score_gemma":0.000113061134,"teacher_disagreement_score":0.85158825,"about_ca_system_score_codex":0.00030977582,"about_ca_system_score_gemma":0.000049481972,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W4312903180","doi":"10.1109/tifs.2022.3212198","title":"The Impact of Side Information on Physical Layer Security Under Correlated Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"European Regional Development Fund; Consejería de Economía, Innovación, Ciencia y Empleo, Junta de Andalucía","keywords":"Fading; Transmitter; Physical layer; Computer science; Secrecy; Outage probability; Channel state information; Copula (linguistics); Fading distribution; Computer network; Telecommunications; Computer security; Wireless; Channel (broadcasting); Mathematics; Econometrics; Rayleigh fading","score_opus":0.011208790775914017,"score_gpt":0.2447430772286412,"score_spread":0.23353428645272717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312903180","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.87753105,0.000027861704,0.11684757,0.00017996908,0.0005088136,0.0006005712,0.0004211199,0.00047694825,0.0034060755],"genre_scores_gemma":[0.9995513,0.00014787537,0.00003604978,0.00008009423,0.000011417885,0.000092318536,0.000065710956,0.000012349504,0.0000028621778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988364,0.00006768608,0.00046515776,0.000068695255,0.0003562959,0.00020577892],"domain_scores_gemma":[0.9990614,0.00020244472,0.00015911888,0.00036753097,0.00013974123,0.00006977021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028943844,0.00019366966,0.00019684395,0.00022914166,0.00063611043,0.00010779782,0.00021354378,0.00008194316,0.000021736743],"category_scores_gemma":[0.0000075970866,0.00016568841,0.00015442725,0.0003752044,0.00009137676,0.0011733648,0.000010039155,0.0007180787,0.000012294995],"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.00011765821,0.00008441906,0.00000710841,0.000047401743,0.00012988209,1.6379052e-7,0.019304393,0.9452548,0.00008385549,0.01531353,0.0013092038,0.018347578],"study_design_scores_gemma":[0.00064563524,0.00037941057,0.00018914983,0.000028819197,0.000025608491,0.000014019884,0.0017464301,0.9680513,0.008933921,0.01619549,0.0034786465,0.00031153223],"about_ca_topic_score_codex":0.00010095423,"about_ca_topic_score_gemma":0.000009762051,"teacher_disagreement_score":0.122020245,"about_ca_system_score_codex":0.00022144333,"about_ca_system_score_gemma":0.00003359838,"threshold_uncertainty_score":0.6756577},"labels":[],"label_agreement":null},{"id":"W4313291262","doi":"10.1109/ojcoms.2022.3232065","title":"New LLRT-Based Methods for Active Eavesdropper Detection in Cell-Free Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"False alarm; Overhead (engineering); Computer science; Telecommunications link; MIMO; Spectral efficiency; Constant false alarm rate; Computer network; Spoofing attack; Real-time computing; Algorithm; Artificial intelligence","score_opus":0.048549162510954466,"score_gpt":0.35908495530092926,"score_spread":0.3105357927899748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313291262","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.018502405,0.002970114,0.9491833,0.021050746,0.001003829,0.0028341715,0.00010954247,0.00018188846,0.004163991],"genre_scores_gemma":[0.54147416,0.00025162267,0.45772183,0.00021326287,0.000019969202,0.00019646427,0.000003144868,0.000034714652,0.00008480267],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99825764,0.0008012779,0.0005126836,0.00009003233,0.0001775697,0.00016078878],"domain_scores_gemma":[0.9960867,0.0007789612,0.00039268064,0.0025080848,0.00017545406,0.000058106405],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016406862,0.00013347543,0.000256501,0.00008459035,0.0005896266,0.000082640225,0.007690473,0.00007249235,0.000033740074],"category_scores_gemma":[0.00009355361,0.00012482356,0.00035037758,0.000553183,0.00007711584,0.00023567874,0.0014167026,0.0011215265,6.0386924e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030934086,0.001172593,0.00022340158,0.00014056114,0.00073039765,8.960159e-7,0.02791209,0.19861452,0.34183905,0.0025671367,0.16959263,0.25689736],"study_design_scores_gemma":[0.0042308965,0.00025388875,0.0005884307,0.00015265327,0.00016306192,0.000032043117,0.006750902,0.28482231,0.48695216,0.016576836,0.19888239,0.00059442944],"about_ca_topic_score_codex":0.0000964758,"about_ca_topic_score_gemma":0.000098219796,"teacher_disagreement_score":0.5229718,"about_ca_system_score_codex":0.00074341136,"about_ca_system_score_gemma":0.00023879383,"threshold_uncertainty_score":0.9976784},"labels":[],"label_agreement":null},{"id":"W4313315845","doi":"10.1109/commnet56067.2022.9993858","title":"Deep Reinforcement Learning Based Anti-Jamming Using Clear Channel Assessment Information in a Cognitive Radio Environment","year":2022,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Jamming; Computer science; Denial-of-service attack; Cognitive radio; Channel (broadcasting); Computer network; Wireless; Reinforcement learning; Telecommunications; Artificial intelligence; The Internet","score_opus":0.018093736065754918,"score_gpt":0.25069985905019454,"score_spread":0.2326061229844396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313315845","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.16201608,0.000051439984,0.8336982,0.000057977762,0.000045942008,0.0005238172,0.0000016250006,0.0004644349,0.0031404668],"genre_scores_gemma":[0.9926664,0.00006493322,0.0068158284,0.00011358469,0.000006953795,0.00019137647,0.00010908526,0.000022676772,0.000009143452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988531,0.00010985585,0.00038118652,0.00010197854,0.00032767357,0.00022623068],"domain_scores_gemma":[0.9995872,0.00006893182,0.00008273042,0.00020398549,0.000016864073,0.00004033349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047071718,0.00013985983,0.00015721076,0.00032140838,0.00020605519,0.000044711604,0.00018114592,0.000039787483,0.00047240633],"category_scores_gemma":[0.000013185128,0.00017724498,0.000040697687,0.00020110767,0.000019091205,0.0004427275,0.00020863947,0.00049371255,0.000008035372],"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.0000067364344,0.000022466997,0.00028596254,0.000021631558,0.000012107206,0.000001612882,0.0014547685,0.9955429,0.0003574116,0.00010757654,0.000011216449,0.0021756238],"study_design_scores_gemma":[0.0004717323,0.000076489945,0.0005835427,0.000030449344,0.0000072896337,0.0000028677655,0.0033188765,0.99158394,0.0017601496,0.00001164629,0.0019519096,0.00020113101],"about_ca_topic_score_codex":0.000077387245,"about_ca_topic_score_gemma":0.000003389888,"teacher_disagreement_score":0.8306503,"about_ca_system_score_codex":0.00079730514,"about_ca_system_score_gemma":0.000025288717,"threshold_uncertainty_score":0.72278404},"labels":[],"label_agreement":null},{"id":"W4313534845","doi":"10.1109/ojcoms.2023.3234338","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","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":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Pre-shared key; Computer network; Physical unclonable function; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.08087695697281036,"score_gpt":0.3260999161008283,"score_spread":0.24522295912801792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313534845","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.9936732,0.000243564,0.0022467524,0.0027225304,0.00024858472,0.00029325116,0.00003690126,0.00014672504,0.00038849245],"genre_scores_gemma":[0.9909064,0.0011065438,0.0075269793,0.00010184959,0.00020660006,0.000025275056,0.00001666818,0.00003778961,0.00007185765],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.0003624238,0.00034850414,0.00010565195,0.00020900491,0.00017951187],"domain_scores_gemma":[0.9976053,0.00025873835,0.00021729396,0.0015759475,0.00026644126,0.00007622969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085322926,0.00015692295,0.00029114308,0.000049716167,0.0007381153,0.00024096825,0.0022139463,0.0000798106,0.0000054441607],"category_scores_gemma":[0.000042575088,0.0001310431,0.00021654989,0.0006822724,0.00021752274,0.00066433556,0.0009956815,0.00075967197,0.000010053333],"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.00002333083,0.00079799176,0.0007129796,0.000116267016,0.0010962385,0.0000019130407,0.050035335,0.14610028,0.6192845,0.0150064025,0.1638002,0.003024545],"study_design_scores_gemma":[0.00048997434,0.000037659058,0.00052477507,0.00010383689,0.00014126602,0.000030314863,0.0013893694,0.9565433,0.020625869,0.007741975,0.012094815,0.00027683415],"about_ca_topic_score_codex":0.000066499604,"about_ca_topic_score_gemma":0.00003531324,"teacher_disagreement_score":0.81044304,"about_ca_system_score_codex":0.00016661467,"about_ca_system_score_gemma":0.0000821666,"threshold_uncertainty_score":0.56770605},"labels":[],"label_agreement":null},{"id":"W4313895184","doi":"10.3390/e25010122","title":"Physical Layer Security in Two-Way SWIPT Relay Networks with Imperfect CSI and a Friendly Jammer","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Relay; Jamming; Computer science; Eavesdropping; Secrecy; Computer network; Relay channel; Physical layer; Channel state information; Signal-to-noise ratio (imaging); Channel (broadcasting); Energy (signal processing); Telecommunications; Wireless; Computer security; Power (physics); Mathematics; Physics","score_opus":0.006960378507535208,"score_gpt":0.2516348673284031,"score_spread":0.24467448882086792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313895184","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.99501187,0.0003019788,0.002150086,0.00016985116,0.00004772013,0.00019854396,0.0000041984085,0.0009911322,0.0011246338],"genre_scores_gemma":[0.99879694,0.00029409656,0.0006313614,0.000033010627,0.00008781682,0.000078240286,0.000014787733,0.000046169393,0.000017567187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991636,0.00006692261,0.00014583222,0.000183844,0.00013514645,0.00030460255],"domain_scores_gemma":[0.99935704,0.00012053344,0.00002306052,0.0004096172,0.000020089261,0.00006965232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015989138,0.00016148508,0.00020816052,0.000108297354,0.000044571778,0.000040162264,0.00017961468,0.000059012764,0.000015019789],"category_scores_gemma":[0.000014835149,0.00014757959,0.000033517583,0.0004485822,0.000053903386,0.00014110593,0.000104078455,0.00044713798,0.00003235347],"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.00058616855,0.0011053939,0.17663161,0.00063736446,0.00080633827,0.0006674044,0.05792615,0.34680873,0.08727753,0.20734532,0.08421119,0.03599679],"study_design_scores_gemma":[0.0014276506,0.00013451421,0.013886397,0.00013316725,0.000022550359,0.000016465448,0.00023731054,0.95907706,0.012328418,0.001434484,0.010723818,0.00057814294],"about_ca_topic_score_codex":0.000075972406,"about_ca_topic_score_gemma":0.00014596176,"teacher_disagreement_score":0.6122683,"about_ca_system_score_codex":0.00005365255,"about_ca_system_score_gemma":0.000007125323,"threshold_uncertainty_score":0.6018121},"labels":[],"label_agreement":null},{"id":"W4315777823","doi":"10.1109/gcwkshps56602.2022.10008698","title":"GRAND for Rayleigh Fading Channels","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Fading; Decoding methods; Algorithm; Rayleigh fading; Computer science; BCH code; Code (set theory); Multipath propagation; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.019436392833521138,"score_gpt":0.2510370625127393,"score_spread":0.23160066967921814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777823","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.47650778,0.015319533,0.41893497,0.004918867,0.018161068,0.008168331,0.001390353,0.016531259,0.040067844],"genre_scores_gemma":[0.99257034,0.0002738162,0.003637372,0.0003031589,0.0002844232,0.0018962716,0.00014867737,0.00014342103,0.0007425392],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979712,0.0001293388,0.00050291035,0.00038726645,0.00040220693,0.00060707727],"domain_scores_gemma":[0.9983755,0.0003307501,0.000099576115,0.0009949678,0.00006222434,0.00013698591],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006822698,0.00033835857,0.0004234286,0.00027397624,0.00065791485,0.000119112236,0.0011653942,0.0001278437,0.00092401827],"category_scores_gemma":[0.000041586747,0.0004242081,0.00024143596,0.00075634685,0.000052818647,0.0002324643,0.00032303494,0.0007321977,0.000025913016],"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.00013771122,0.00029082832,0.00026546564,0.00026139047,0.000343583,0.000026082815,0.0042436225,0.17123784,0.008666484,0.0074432134,0.7680881,0.038995665],"study_design_scores_gemma":[0.0015490954,0.00013719071,0.000090267975,0.00007375258,0.00007387075,0.00005418829,0.0009414712,0.24119388,0.014157539,0.0072285356,0.73319864,0.0013015607],"about_ca_topic_score_codex":0.000016288315,"about_ca_topic_score_gemma":0.000024572524,"teacher_disagreement_score":0.51606256,"about_ca_system_score_codex":0.0003840528,"about_ca_system_score_gemma":0.000028744616,"threshold_uncertainty_score":0.9999893},"labels":[],"label_agreement":null},{"id":"W4315783193","doi":"10.1109/gcwkshps56602.2022.10008779","title":"Analytical Method of Physical Layer Authentication for Performance Evaluation","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Wireless Communication Security Techniques","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":"Western University","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Eavesdropping; Physical layer; Computer science; Authentication (law); Binary number; Probability density function; Benchmark (surveying); Noise (video); Algorithm; Receiver operating characteristic; Channel (broadcasting); Stability (learning theory); Variance (accounting); Mathematics; Statistics; Artificial intelligence; Machine learning; Computer network; Telecommunications","score_opus":0.03759380676408463,"score_gpt":0.3355786586556045,"score_spread":0.29798485189151985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783193","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.7750244,0.0004271857,0.21696326,0.00054534164,0.0006359147,0.0018767776,0.00014484323,0.0008174828,0.0035647752],"genre_scores_gemma":[0.98653185,0.000038589806,0.011856627,0.000045684963,0.00010127441,0.0011325665,0.00013423503,0.000052693624,0.000106470754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998082,0.00025968775,0.00044886852,0.00027412624,0.00065276824,0.00028255332],"domain_scores_gemma":[0.9984047,0.0003966032,0.00012817731,0.0008242276,0.00018082162,0.00006547552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015374334,0.00019646493,0.00033595396,0.00019788857,0.00020491667,0.000026702286,0.0006279237,0.00007608281,0.00034946227],"category_scores_gemma":[0.00008198382,0.00022983865,0.00018496937,0.0006848519,0.0000470039,0.00018428429,0.00015422014,0.00041258932,0.000010583123],"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.00017101785,0.0008348183,0.00084963714,0.00031769695,0.00038081474,8.722742e-7,0.0048210686,0.55047613,0.029084632,0.021094127,0.032980986,0.3589882],"study_design_scores_gemma":[0.00037629882,0.00008275448,0.00089833396,0.000019126748,0.000111777896,0.0000040889813,0.0002287099,0.976394,0.012678853,0.0012081879,0.0077667786,0.0002310817],"about_ca_topic_score_codex":0.000006567894,"about_ca_topic_score_gemma":0.0000048031334,"teacher_disagreement_score":0.42591786,"about_ca_system_score_codex":0.00034961614,"about_ca_system_score_gemma":0.00005310663,"threshold_uncertainty_score":0.9372548},"labels":[],"label_agreement":null},{"id":"W4319994188","doi":"10.2139/ssrn.4347462","title":"Identity-Based Attack Detection Using Received Signal Strength in Mimo Systems","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"SIGNAL (programming language); Identity (music); MIMO; Computer science; Signal strength; Computer security; Speech recognition; Political science; Telecommunications; Acoustics; Physics; Wireless","score_opus":0.024631919058431432,"score_gpt":0.28075974078028076,"score_spread":0.25612782172184934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319994188","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.9088974,0.0013222996,0.08857493,0.0000441311,0.00020369748,0.00016423748,0.0000023862221,0.0006626463,0.00012823944],"genre_scores_gemma":[0.997581,0.0019830985,0.0002289571,0.000006182656,0.00010326557,0.000016644106,0.0000072753355,0.00005129825,0.000022274548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977947,0.00017388204,0.00040127378,0.00012988708,0.00027455477,0.0012256972],"domain_scores_gemma":[0.99946064,0.00007342915,0.00009336447,0.0002506339,0.000067387315,0.000054518554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016366002,0.00015690108,0.00019714932,0.0005663941,0.00013298928,0.0001174228,0.00037800948,0.00012603805,0.000008214446],"category_scores_gemma":[0.000029868188,0.00018019941,0.00007638228,0.0008663441,0.000022473954,0.00042146991,0.000032238517,0.0018179346,0.000030500853],"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.00006105009,0.00011220873,0.00334356,0.00018327053,0.00025583958,0.000027520415,0.000527727,0.8628853,0.09809323,0.011286854,0.00013839136,0.023085084],"study_design_scores_gemma":[0.0006539412,0.00009032196,0.0006578188,0.000185617,0.000020770794,0.00011250549,0.0009884088,0.98108023,0.006674691,0.008426694,0.00076694635,0.00034204393],"about_ca_topic_score_codex":0.00015442994,"about_ca_topic_score_gemma":0.002452543,"teacher_disagreement_score":0.11819497,"about_ca_system_score_codex":0.0018609486,"about_ca_system_score_gemma":0.00035108885,"threshold_uncertainty_score":0.7898122},"labels":[],"label_agreement":null},{"id":"W4323065265","doi":"10.1109/tvt.2023.3251943","title":"Secrecy Performance Analysis of Heterogeneous Networks With Unreliable Wireless Backhaul and Imperfect Channel Estimation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Queen's University; Queen's University Belfast; Royal Academy of Engineering","keywords":"Backhaul (telecommunications); Nakagami distribution; Fading; Secrecy; Eavesdropping; Wireless; Computer science; Computer network; Transmitter; Channel (broadcasting); Artificial noise; Telecommunications; Computer security","score_opus":0.007157958093598131,"score_gpt":0.2125862709370113,"score_spread":0.20542831284341317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323065265","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.5464953,0.000099847035,0.4520456,0.00004517865,0.000030362584,0.00013292285,0.000008413684,0.0011272806,0.000015066321],"genre_scores_gemma":[0.99683106,0.0016425374,0.0012764202,0.000010058175,0.0000031632949,0.00016446157,0.00002102955,0.00004157379,0.000009671631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911755,0.000026068194,0.00025765446,0.00021808628,0.00013396636,0.00024666343],"domain_scores_gemma":[0.9991585,0.00006409265,0.000055382447,0.0006100352,0.00007239834,0.00003959045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013457275,0.0001891566,0.00035512482,0.0013658985,0.000117289936,0.000014343472,0.00022944334,0.00028949886,0.000010005848],"category_scores_gemma":[0.0000018550483,0.00018961489,0.00007344998,0.0031264082,0.0001450031,0.00010259919,0.0000045524653,0.0003627787,0.0000063941657],"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.000011868357,0.000027288419,0.00009646908,0.000047282534,0.00044589562,0.0000035016315,0.0000666926,0.978012,0.001976128,0.000059606944,0.0000055952155,0.019247666],"study_design_scores_gemma":[0.00015841256,0.00013469315,0.00019176891,0.000059443042,0.00024030718,0.00001740812,0.00003336642,0.87948585,0.11944224,0.000050971015,0.0000224398,0.00016310433],"about_ca_topic_score_codex":0.000017888839,"about_ca_topic_score_gemma":0.00006318782,"teacher_disagreement_score":0.4507692,"about_ca_system_score_codex":0.00005133187,"about_ca_system_score_gemma":0.000009583926,"threshold_uncertainty_score":0.7732271},"labels":[],"label_agreement":null},{"id":"W4327808488","doi":"10.1109/tmc.2023.3258750","title":"Optimal Random Access Strategies for Trigger-Based Multiple-Packet Reception Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Notation; Network packet; Channel (broadcasting); Computer science; Algorithm; Discrete mathematics; Mathematics; Arithmetic; Computer network","score_opus":0.04334691770578537,"score_gpt":0.31602089040250614,"score_spread":0.2726739726967208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327808488","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.21049735,0.00003137568,0.7843393,0.000068332454,0.0005860895,0.00096974545,0.00004783229,0.0033918505,0.00006811235],"genre_scores_gemma":[0.99161524,0.00009014407,0.0071764677,0.000034256613,0.00007816301,0.00084827805,0.000052004918,0.000081612845,0.00002385702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987056,0.000079080884,0.00040460387,0.00026950147,0.00017923868,0.0003619361],"domain_scores_gemma":[0.99834836,0.00095024775,0.00006637335,0.00045684332,0.00010807013,0.000070080714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041251746,0.00024325325,0.00029078432,0.00041508948,0.0003313097,0.00023296835,0.00045046303,0.00015260853,0.00003003944],"category_scores_gemma":[0.000009927544,0.0002783534,0.00019437366,0.00064397196,0.000050123977,0.00034368128,0.000003945635,0.00033293467,0.00003256736],"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.00006296533,0.0000560035,0.0000024755138,0.000095890464,0.00003097951,6.641806e-7,0.00040727452,0.96464735,0.0038053046,0.000014088669,0.00068118144,0.030195802],"study_design_scores_gemma":[0.0014391753,0.00009110101,0.000011013683,0.00011197415,0.000016666125,0.0000013219958,0.0002891747,0.91016895,0.0857812,0.000077964134,0.0017477748,0.0002636755],"about_ca_topic_score_codex":0.000014483187,"about_ca_topic_score_gemma":0.000015243752,"teacher_disagreement_score":0.78111786,"about_ca_system_score_codex":0.00010399466,"about_ca_system_score_gemma":0.000041367537,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W4376605106","doi":"10.1016/j.aeue.2023.154709","title":"Identity-based attack detection using received signal strength in MIMO systems","year":2023,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"RSS; MIMO; Computer science; Algorithm; Identity (music); Pattern recognition (psychology); Artificial intelligence; Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.040330611116812375,"score_gpt":0.32499173890876704,"score_spread":0.2846611277919547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376605106","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.9684724,0.007224644,0.022411434,0.0008612387,0.00026258355,0.00016401704,0.000014103253,0.00017464961,0.00041489117],"genre_scores_gemma":[0.98918694,0.008893227,0.0017947389,0.000024830284,0.000039137165,0.0000137835395,0.000020955571,0.000021527743,0.0000048313054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883264,0.0001336601,0.00052244205,0.00007295184,0.00027819115,0.00016013705],"domain_scores_gemma":[0.99882305,0.0001867776,0.000197209,0.000417768,0.00032902588,0.00004617218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005862727,0.00010490542,0.00016619466,0.0005688952,0.0000901461,0.00013288645,0.0010873862,0.0000756721,0.000005159297],"category_scores_gemma":[0.000042866057,0.000119034106,0.00006295795,0.00043445392,0.00005337576,0.00042631113,0.00013744,0.0005124953,0.0000032649243],"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.00020455032,0.00095874,0.009336443,0.00020957475,0.0015009644,0.000049372207,0.0028342237,0.632827,0.18342452,0.09372986,0.0012111278,0.07371364],"study_design_scores_gemma":[0.0005169235,0.000060104583,0.0013715529,0.00022501769,0.000022414235,0.000051718118,0.00021974425,0.98168397,0.0028759823,0.0018690232,0.010938046,0.00016547547],"about_ca_topic_score_codex":0.00005737599,"about_ca_topic_score_gemma":0.0004377437,"teacher_disagreement_score":0.34885702,"about_ca_system_score_codex":0.00031899358,"about_ca_system_score_gemma":0.00008740013,"threshold_uncertainty_score":0.485407},"labels":[],"label_agreement":null},{"id":"W4379117199","doi":"10.1109/jiot.2023.3282214","title":"Adaptive Physical-Layer Authentication for IoT in MIMO Communication Systems Using Support Vector Machine","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Spoofing attack; Authentication (law); Physical layer; MIMO; Computer network; Wireless; Link layer; Support vector machine; Channel (broadcasting); Computer security; Artificial intelligence; Telecommunications","score_opus":0.05210300379520688,"score_gpt":0.3107130308842381,"score_spread":0.2586100270890312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379117199","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.9207076,0.00036036008,0.07727312,0.00019009676,0.00041974147,0.00041402702,0.000016889482,0.0003359945,0.0002822138],"genre_scores_gemma":[0.9923802,0.000097912,0.007289411,0.000013817617,0.000059643447,0.000036323476,0.000014506465,0.00004540952,0.00006278673],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.000096510674,0.00053272786,0.0001002863,0.00020688624,0.00019411885],"domain_scores_gemma":[0.998942,0.00019982169,0.00025657157,0.0003784863,0.00017305095,0.000050073486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074308034,0.00013755295,0.00027354874,0.00035266072,0.000044418062,0.00006893017,0.00063392904,0.00008344234,0.000008200495],"category_scores_gemma":[0.000055149263,0.00014343072,0.000105607214,0.00025113916,0.00004572301,0.00029879675,0.000067517874,0.00042916054,0.000009870326],"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.00031403982,0.00065832667,0.001541025,0.00092543446,0.00076546706,0.000018161056,0.089503564,0.12984884,0.7243064,0.021335533,0.01696857,0.013814639],"study_design_scores_gemma":[0.00027940058,0.00006119533,0.00026388012,0.00040813594,0.00002128498,0.000029471825,0.0002155707,0.9605954,0.035799664,0.0017603544,0.00042853606,0.00013705723],"about_ca_topic_score_codex":0.00013509602,"about_ca_topic_score_gemma":0.00001115654,"teacher_disagreement_score":0.8307466,"about_ca_system_score_codex":0.00021599278,"about_ca_system_score_gemma":0.000027875229,"threshold_uncertainty_score":0.5848935},"labels":[],"label_agreement":null},{"id":"W4379117226","doi":"10.1109/twc.2023.3280464","title":"Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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; Ericsson (Canada)","funders":"","keywords":"Stackelberg competition; Covert; Jamming; Computer science; Secrecy; Exploit; Artificial noise; Computer network; Stochastic geometry; Computer security; Game theory; Transmitter; Mathematics; Channel (broadcasting)","score_opus":0.021472602832984158,"score_gpt":0.2680532102910516,"score_spread":0.24658060745806745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379117226","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.20331676,0.0010425661,0.7891162,0.0005372541,0.0002039209,0.0005777644,0.00010986069,0.003677101,0.0014185439],"genre_scores_gemma":[0.9712722,0.015091963,0.012961872,0.000081579805,0.00001995685,0.00029433006,0.000089736175,0.00013022945,0.000058137335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980122,0.00029629655,0.0006067705,0.00030480218,0.0002632605,0.00051666726],"domain_scores_gemma":[0.99529207,0.000632301,0.000112770445,0.003661293,0.00013628839,0.00016526016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005582269,0.00034837704,0.00036672107,0.0005227254,0.0013973576,0.00016144791,0.0015019842,0.00027300176,0.00002762122],"category_scores_gemma":[0.0000057470415,0.000439259,0.000130602,0.0012986443,0.00028812527,0.00054934353,0.00007208174,0.0011276121,0.000046650755],"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.00006299877,0.0009924821,0.00050231634,0.00034085373,0.00061184855,0.000006410353,0.018156335,0.794673,0.018533027,0.007894,0.0025192709,0.15570742],"study_design_scores_gemma":[0.00039983893,0.000029567325,0.00016039687,0.00023699221,0.000056643148,0.000015045992,0.001185583,0.9874308,0.0048679775,0.00022154053,0.0049358145,0.0004597602],"about_ca_topic_score_codex":0.000101939826,"about_ca_topic_score_gemma":0.0006029413,"teacher_disagreement_score":0.77615434,"about_ca_system_score_codex":0.00021378297,"about_ca_system_score_gemma":0.00003376249,"threshold_uncertainty_score":0.99990267},"labels":[],"label_agreement":null},{"id":"W4382289048","doi":"10.1007/978-981-99-1203-2_11","title":"Beamforming Technique for Improving Physical Layer Security in an MIMO-OFDM Wireless Channel","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Physical layer; Beamforming; MIMO; Channel sounding; MIMO-OFDM; Orthogonal frequency-division multiplexing; Computer science; Multi-user MIMO; Wireless; Electronic engineering; Telecommunications link; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.021575788712661678,"score_gpt":0.2543283388842433,"score_spread":0.23275255017158158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382289048","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.0053102835,0.006870693,0.97554815,0.00007134988,0.0010228389,0.005607269,0.00013122564,0.0019571146,0.003481053],"genre_scores_gemma":[0.9967493,0.0005690296,0.00043009716,0.000026320826,0.00073954684,0.0009433089,0.00015007841,0.0002631541,0.00012919803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817884,0.000051628194,0.0006175593,0.000483229,0.00018564124,0.00048307373],"domain_scores_gemma":[0.99849045,0.0005066054,0.00015840883,0.0006843359,0.00007104104,0.000089175395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005895718,0.0005419312,0.00090379664,0.000364348,0.00008113487,0.00012310199,0.00042435728,0.0011160298,9.827545e-7],"category_scores_gemma":[0.000024548792,0.00056196575,0.000118984884,0.00014070184,0.00006215447,0.00015667593,0.00014980756,0.0013955664,8.2919854e-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.00012490017,0.00015206824,0.0002538996,0.009085535,0.00022571754,0.000090965135,0.008743201,0.8413849,0.005375829,0.066004775,0.0003226601,0.068235554],"study_design_scores_gemma":[0.0002250189,0.00007376824,0.0000062239374,0.0015277289,0.000019922876,0.000012148378,0.000019781799,0.980212,0.00048254698,0.015715504,0.0010152989,0.00069010776],"about_ca_topic_score_codex":0.00015833527,"about_ca_topic_score_gemma":0.0013442314,"teacher_disagreement_score":0.991439,"about_ca_system_score_codex":0.00018658757,"about_ca_system_score_gemma":0.000020912508,"threshold_uncertainty_score":0.9996832},"labels":[],"label_agreement":null},{"id":"W4382365049","doi":"10.1109/itw55543.2023.10161609","title":"The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Ottawa","funders":"","keywords":"Secrecy; Transmitter; Encoder; Computer science; Coding (social sciences); Computer network; Channel capacity; Channel (broadcasting); Computer security; Gaussian; Telecommunications; Topology (electrical circuits); Mathematics; Statistics; Electrical engineering; Physics; Engineering","score_opus":0.024233002935032676,"score_gpt":0.23168649723777288,"score_spread":0.2074534943027402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382365049","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.96691394,0.00022602548,0.00600432,0.0037001427,0.00012219437,0.0005465524,0.000015979009,0.0021193398,0.020351509],"genre_scores_gemma":[0.9977453,0.0004857992,0.00027551327,0.00006701631,0.000019833102,0.00009472555,0.000013301031,0.00003352198,0.00126501],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919134,0.00010337339,0.00020263297,0.00010422038,0.00017587114,0.00022256108],"domain_scores_gemma":[0.9985974,0.00034645383,0.00004349421,0.00090701814,0.00006675728,0.00003891613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048117212,0.00013181167,0.00013745231,0.000054830787,0.00020901771,0.00003908401,0.0005196641,0.000064754706,0.00007738674],"category_scores_gemma":[0.00002913883,0.00006805233,0.000044556644,0.000527352,0.00018199919,0.00008232454,0.00014454527,0.00019739852,0.000057896897],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032761745,0.00027045974,0.010299611,0.0008832532,0.0019886321,0.000026884854,0.06162419,0.06825077,0.326588,0.25931707,0.23658815,0.03383535],"study_design_scores_gemma":[0.00045632132,0.00009524257,0.008783728,0.00013193065,0.000036524434,0.000015576448,0.00201811,0.16131882,0.7765082,0.0039926535,0.04608762,0.00055528956],"about_ca_topic_score_codex":0.00012407098,"about_ca_topic_score_gemma":0.0009232804,"teacher_disagreement_score":0.44992018,"about_ca_system_score_codex":0.000044834258,"about_ca_system_score_gemma":0.00000966015,"threshold_uncertainty_score":0.27750933},"labels":[],"label_agreement":null},{"id":"W4383753047","doi":"10.1109/tvt.2023.3293481","title":"Covert Communication in Two-Hop Cooperative Cognitive Radio System","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","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 New Brunswick","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Covert; Underlay; Transmitter; Cognitive radio; Computer network; Computer science; Transmitter power output; Transmission (telecommunications); Covert channel; Interference (communication); Overlay; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Channel (broadcasting)","score_opus":0.01250856251808129,"score_gpt":0.262036222337571,"score_spread":0.2495276598194897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383753047","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.57618934,0.00054603367,0.40834197,0.0008215216,0.00020679057,0.0010195356,0.000075229655,0.011052369,0.001747196],"genre_scores_gemma":[0.99750966,0.00085141463,0.00073430507,0.00002790543,0.000005444765,0.00074584904,0.000029343608,0.00005933627,0.000036769656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988088,0.00014272217,0.00036059253,0.0002389895,0.00015533104,0.00029357173],"domain_scores_gemma":[0.9987677,0.00019199488,0.000042185875,0.000841039,0.000117317926,0.000039767136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024721367,0.00021902008,0.00030880887,0.0011493006,0.0001678085,0.000025920182,0.00050475623,0.0002830841,0.000016200946],"category_scores_gemma":[0.000012269723,0.00025446466,0.00006936808,0.00207404,0.0001867331,0.00015334353,0.0000072705675,0.00088927493,0.00028445883],"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.00014354402,0.0007443836,0.00034870623,0.00047179483,0.00078656623,0.00022336404,0.0043667858,0.76348704,0.09867234,0.035497624,0.0014283495,0.093829505],"study_design_scores_gemma":[0.0019025326,0.00012846447,0.00015299085,0.00083092164,0.00005717796,0.00008387437,0.0039019377,0.4163337,0.5736204,0.0005608072,0.0017394976,0.000687692],"about_ca_topic_score_codex":0.000052839478,"about_ca_topic_score_gemma":0.0003049998,"teacher_disagreement_score":0.47494808,"about_ca_system_score_codex":0.0003097775,"about_ca_system_score_gemma":0.000025387519,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W4384946062","doi":"10.1109/iwcmc58020.2023.10182942","title":"LDPC and ultra-massive multi-input multi-output for secrecy in 6G","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Eavesdropping; Physical layer; Low-density parity-check code; MIMO; Computer network; Jamming; Wireless; Secure transmission; Decoding methods; Secrecy; Artificial noise; Wireless network; Beamforming; Channel (broadcasting); Computer security; Telecommunications; Encryption","score_opus":0.04477915214774469,"score_gpt":0.2938765958925635,"score_spread":0.2490974437448188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384946062","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.44394335,0.00071437884,0.5377298,0.0012363656,0.00025530846,0.0022988452,0.00010316397,0.008392256,0.005326548],"genre_scores_gemma":[0.9539843,0.00054069987,0.04463986,0.000057721743,0.000014459463,0.00026205875,0.000036238678,0.000043954828,0.00042067477],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.000023217997,0.00022007569,0.00015921096,0.00006787469,0.00023008381],"domain_scores_gemma":[0.9993269,0.00022449368,0.000019701432,0.00033273766,0.00003927832,0.00005691257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018724412,0.00013383069,0.00017408532,0.00020765152,0.000039728253,0.000032693508,0.0002087015,0.00011374116,0.000011911021],"category_scores_gemma":[0.00008938614,0.00014006525,0.000037175916,0.00026339816,0.00003139906,0.00013097742,0.000055275334,0.00015792219,0.00002932339],"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.00009891611,0.0009290698,0.05635351,0.0026955653,0.00047170598,0.00006817182,0.034489054,0.027413536,0.48483002,0.061482746,0.048160195,0.2830075],"study_design_scores_gemma":[0.0019638687,0.000039203922,0.023505999,0.000113584116,0.000009498894,0.000003088095,0.00083013484,0.85546446,0.09922794,0.00062518223,0.017640976,0.0005760742],"about_ca_topic_score_codex":0.00007169606,"about_ca_topic_score_gemma":0.00045988997,"teacher_disagreement_score":0.8280509,"about_ca_system_score_codex":0.000046340858,"about_ca_system_score_gemma":0.000010993351,"threshold_uncertainty_score":0.57116956},"labels":[],"label_agreement":null},{"id":"W4385801059","doi":"10.1109/iccci59363.2023.10210105","title":"Robust Data Exchange Across Wind Turbines","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Carleton University","funders":"","keywords":"Wind power; Computer science; Software deployment; Smart grid; Relay; Wireless; Secrecy; Benchmark (surveying); Distributed computing; Grid; Turbine; Topology (electrical circuits); Computer network; Telecommunications; Engineering; Aerospace engineering; Computer security; Electrical engineering; Power (physics)","score_opus":0.14440522394015412,"score_gpt":0.3215837179459155,"score_spread":0.17717849400576138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385801059","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.7947453,0.0029771933,0.029114917,0.004145957,0.0010359247,0.0009913999,0.00082089665,0.054752097,0.11141627],"genre_scores_gemma":[0.99112874,0.0012711659,0.0055815037,0.00008450791,0.00009597194,0.000017458742,0.00047663075,0.000051740742,0.0012922516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994368,0.0000121657695,0.00012215863,0.00013095564,0.00010003469,0.0001978898],"domain_scores_gemma":[0.9983837,0.00005102283,0.000009832565,0.0014981815,0.000021248006,0.000036035857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022378915,0.00008595691,0.000091780676,0.000051301166,0.00005078904,0.000049879316,0.00093536667,0.000060258633,0.00015479178],"category_scores_gemma":[0.000024452025,0.00008562424,0.000014814235,0.0003566969,0.000025620056,0.00026141887,0.00069967256,0.00011258905,0.00039013583],"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.000002642977,0.000031022235,0.0011914023,0.00023227339,0.00006231828,0.00001337958,0.0025906786,0.0062090554,0.0040848507,0.0016528496,0.9348065,0.04912302],"study_design_scores_gemma":[0.00020343333,0.000009582164,0.0064664264,0.000041724496,0.0000056774197,0.0000059676017,0.0005011264,0.3732233,0.008209201,0.00035346716,0.61056554,0.0004145733],"about_ca_topic_score_codex":0.000038405025,"about_ca_topic_score_gemma":0.00016063736,"teacher_disagreement_score":0.36701423,"about_ca_system_score_codex":0.0000149194975,"about_ca_system_score_gemma":0.0000032660198,"threshold_uncertainty_score":0.5014537},"labels":[],"label_agreement":null},{"id":"W4386057507","doi":"10.1109/isit54713.2023.10206990","title":"Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Ministry of Education; National Research Foundation; National Science Foundation","keywords":"Lossy compression; Decoding methods; Computer science; Encoding (memory); Algorithm; Rate–distortion theory; Encoder; Theoretical computer science; Gaussian; Computation; Data compression; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.009160112584267278,"score_gpt":0.24076454683402612,"score_spread":0.23160443424975885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386057507","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.658431,0.000025662348,0.3367919,0.00027067747,0.000029906356,0.00020792978,0.00023410795,0.0034891479,0.00051966583],"genre_scores_gemma":[0.98446333,0.000013770052,0.014385302,0.000046521705,0.00002136835,0.000036036454,0.0009688163,0.00003284658,0.000032023625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934804,0.00002561132,0.00016813299,0.0001387764,0.0001538791,0.00016554282],"domain_scores_gemma":[0.99943614,0.00010085497,0.000023966364,0.00031352742,0.000053271047,0.00007223943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053102372,0.00012992184,0.00017395578,0.00008654209,0.00005356845,0.000080520986,0.00023657367,0.000057278972,0.000038534825],"category_scores_gemma":[0.00001418558,0.000112098576,0.000022274487,0.00042782916,0.000029977224,0.00008745202,0.00006944319,0.00010984817,0.000065670516],"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.00018592448,0.000068052424,0.027435586,0.00018921834,0.00078209373,0.000054295724,0.016332064,0.7298759,0.061414357,0.0077537983,0.11177316,0.04413555],"study_design_scores_gemma":[0.001430856,0.00021990864,0.13091628,0.00028255925,0.00006941632,0.000007824662,0.0035384544,0.6917656,0.12973295,0.007554961,0.032907143,0.0015740562],"about_ca_topic_score_codex":0.00018946428,"about_ca_topic_score_gemma":0.00035125733,"teacher_disagreement_score":0.3260323,"about_ca_system_score_codex":0.000036564565,"about_ca_system_score_gemma":0.0000062998583,"threshold_uncertainty_score":0.45712474},"labels":[],"label_agreement":null},{"id":"W4386072351","doi":"10.1109/isit54713.2023.10206791","title":"The Cardinality Bound on the Information Bottleneck Representations is Tight","year":2023,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Information bottleneck method; Cardinality (data modeling); Combinatorics; Bottleneck; Hamming distance; Alphabet; Upper and lower bounds; Mathematics; Hamming code; Characterization (materials science); Function (biology); Discrete mathematics; Variable (mathematics); Random variable; Computer science; Algorithm; Decoding methods; Mutual information; Block code","score_opus":0.02572784857464373,"score_gpt":0.27348441220238223,"score_spread":0.2477565636277385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386072351","genre_codex":"other","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.24789314,0.00016433538,0.006963508,0.05650954,0.0003675797,0.00103353,0.000053758784,0.0063516176,0.680663],"genre_scores_gemma":[0.9980893,0.00053522165,0.00014771006,0.00042580676,0.000020060485,0.00013326848,0.000022618842,0.000008841079,0.0006171728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994631,0.000045048797,0.00016755804,0.000043373562,0.00016984827,0.000111113164],"domain_scores_gemma":[0.99878687,0.00037177798,0.00002185487,0.0007521751,0.00004920685,0.000018092775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003714061,0.00006121907,0.000048039423,0.000041345706,0.00032520443,0.00015500272,0.0003359024,0.00003342663,0.00005964207],"category_scores_gemma":[0.000054307824,0.000036054145,0.000042091695,0.00032364635,0.000046114717,0.0002211638,0.00006681528,0.00014085643,0.0005708187],"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.0000021344918,0.000004308864,0.00025941766,0.000010914026,0.000041328196,1.5109394e-7,0.0023017148,0.00082158303,0.00013805681,0.20954221,0.7788764,0.008001731],"study_design_scores_gemma":[0.000060186652,0.000008135923,0.012861948,0.000011556642,0.0000059296794,9.4969647e-7,0.0010244792,0.03575435,0.0145842945,0.010840356,0.92472494,0.00012286959],"about_ca_topic_score_codex":0.000059798236,"about_ca_topic_score_gemma":0.00002841939,"teacher_disagreement_score":0.75019616,"about_ca_system_score_codex":0.000035711444,"about_ca_system_score_gemma":0.000007882698,"threshold_uncertainty_score":0.733691},"labels":[],"label_agreement":null},{"id":"W4386075162","doi":"10.1109/isit54713.2023.10206487","title":"Gaussian Broadcast Channels with Bidirectional Conferencing Decoders and Correlated Noises","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Gaussian; Channel (broadcasting); Upper and lower bounds; Decoding methods; Lambda; Noise (video); Computer science; Gaussian noise; Topology (electrical circuits); Mathematics; Telecommunications; Algorithm; Computer network; Discrete mathematics; Physics; Combinatorics; Mathematical analysis; Image (mathematics); Optics; Artificial intelligence; Quantum mechanics","score_opus":0.016348434393403763,"score_gpt":0.22567217124463396,"score_spread":0.20932373685123018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386075162","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.91927266,0.00027241636,0.026387233,0.00059556833,0.0001880487,0.00028560072,0.000009635856,0.008381424,0.04460743],"genre_scores_gemma":[0.99763787,0.00039127519,0.0015309317,0.000032674558,0.000013949731,0.00002953146,0.00002170444,0.000027079746,0.000314965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.000013622662,0.000108800996,0.0001026838,0.00009043527,0.00014207463],"domain_scores_gemma":[0.9996643,0.000062384686,0.000014109877,0.00017044989,0.000034253095,0.000054512773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007129674,0.00009977373,0.000102194586,0.00015790894,0.0000696819,0.000046902995,0.00008800579,0.00008381636,0.00006409681],"category_scores_gemma":[0.000008738217,0.00008981237,0.000012469952,0.00030977748,0.000043181906,0.00011394339,0.000037417325,0.00017862575,0.00003956155],"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.00025364666,0.00033966542,0.08639974,0.0013187245,0.0020763304,0.00019079077,0.03283403,0.22995187,0.09105247,0.11499928,0.1692588,0.27132463],"study_design_scores_gemma":[0.0008618089,0.000106798914,0.020548776,0.00027430526,0.000030436819,0.00010149007,0.0015391739,0.8990084,0.05291494,0.000955888,0.022805525,0.0008524494],"about_ca_topic_score_codex":0.00006672916,"about_ca_topic_score_gemma":0.00008415845,"teacher_disagreement_score":0.66905653,"about_ca_system_score_codex":0.000023552257,"about_ca_system_score_gemma":0.0000121144285,"threshold_uncertainty_score":0.3662442},"labels":[],"label_agreement":null},{"id":"W4386212465","doi":"10.1109/siu59756.2023.10223930","title":"Secrecy Outage Probability of SWIPT-OFDMA Schemes with Transmit Antenna Selection","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Wireless; Secrecy; Maximum power transfer theorem; Computer network; Frequency-division multiple access; Telecommunications; Power (physics); Orthogonal frequency-division multiplexing; Computer security; Channel (broadcasting)","score_opus":0.017939284574184363,"score_gpt":0.2280304318238388,"score_spread":0.21009114724965444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386212465","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.8942708,0.000090790214,0.09724608,0.00040391256,0.000022883814,0.0003748604,0.000009131973,0.004169947,0.0034115976],"genre_scores_gemma":[0.9900606,0.00016329961,0.009504369,0.00000999514,0.000010890205,0.000085180785,0.000010453138,0.0000276545,0.00012752417],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993657,0.000026491018,0.00020335667,0.00011955232,0.00013644673,0.00014844586],"domain_scores_gemma":[0.99949014,0.00004174428,0.000024386858,0.00032203353,0.000088636116,0.00003306008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017808788,0.00010734382,0.00015962863,0.00011633092,0.00003004099,0.000012810026,0.00018729655,0.00006918416,0.000093119445],"category_scores_gemma":[0.000011918291,0.000093858034,0.000039192746,0.00064724346,0.000044945686,0.00014640782,0.00002289471,0.00014900274,0.000011851179],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013587611,0.0003672385,0.11007173,0.0030736963,0.00055098813,0.000005164237,0.0062585687,0.0064491862,0.69937736,0.07566002,0.002103286,0.09594689],"study_design_scores_gemma":[0.0005589839,0.00016307372,0.029954761,0.00021976736,0.000035609388,0.000006369812,0.00024418076,0.22933999,0.72361994,0.0076046977,0.0076981597,0.0005544886],"about_ca_topic_score_codex":0.000050543687,"about_ca_topic_score_gemma":0.00014689079,"teacher_disagreement_score":0.22289081,"about_ca_system_score_codex":0.00003156723,"about_ca_system_score_gemma":0.000015201629,"threshold_uncertainty_score":0.38274196},"labels":[],"label_agreement":null},{"id":"W4386322005","doi":"10.1109/jiot.2023.3310587","title":"Low-Complexity Dynamic Directional Modulation: Vulnerability and Information Leakage","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"CHIST-ERA; Foreign Affairs and International Trade Canada; Ministério da Ciência, Tecnologia, Inovações e Comunicações; Università degli Studi di Ferrara; Universidade Estadual de Campinas; Politechnika Wrocławska; Oulun Yliopisto; Aalborg Universitet; Technological University Dublin; Instituto Nacional de Telecomunicações; Trinity College Dublin; Inyuvesi Yakwazulu-Natali; Science Foundation Ireland; National Research Foundation; Business Finland; Fundação de Amparo à Pesquisa do Estado de São Paulo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Instituto de Telecomunicações; Concordia University; Academy of Finland; RWTH Aachen University; BioDelivery Sciences International","keywords":"Information leakage; Computer science; Wireless; Leakage (economics); Antenna (radio); Electronic engineering; Transmission (telecommunications); Computer network; Telecommunications; Engineering","score_opus":0.017968242477971543,"score_gpt":0.26394528676228457,"score_spread":0.24597704428431302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386322005","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.9270714,0.00003811964,0.07052479,0.00024164822,0.00039573238,0.00007533276,0.0000062597437,0.00046736264,0.0011793405],"genre_scores_gemma":[0.9963208,0.0001608046,0.00339368,0.000036699283,0.000028600394,0.0000050401595,0.000013312148,0.000010781869,0.000030304784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.00004587524,0.00041920962,0.000058854446,0.00021874727,0.000115888695],"domain_scores_gemma":[0.99942905,0.00007091055,0.00012540861,0.00016786285,0.00015455461,0.000052194013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055854826,0.000095793905,0.00014161087,0.00023185299,0.000060313003,0.00008591515,0.00022811435,0.00006978109,0.000047886682],"category_scores_gemma":[0.000071352086,0.000099772034,0.000048742466,0.00018581763,0.00008217595,0.0016403339,0.00005475009,0.00040814606,0.000016867954],"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.00032753407,0.00040587527,0.014595883,0.0029757083,0.00084202364,0.000026442336,0.062131613,0.1290163,0.19488291,0.021515308,0.054188922,0.5190915],"study_design_scores_gemma":[0.00028321435,0.000040037194,0.037616428,0.00017548964,0.000008274548,0.0001322821,0.000101003476,0.9214067,0.026230082,0.011756917,0.002048638,0.00020096477],"about_ca_topic_score_codex":0.000026566504,"about_ca_topic_score_gemma":0.000006249721,"teacher_disagreement_score":0.79239035,"about_ca_system_score_codex":0.00010489076,"about_ca_system_score_gemma":0.000011756701,"threshold_uncertainty_score":0.40685856},"labels":[],"label_agreement":null},{"id":"W4386323222","doi":"10.1109/icce-taiwan58799.2023.10226772","title":"Secure Communication with Physical Layer Coding Scheme","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Education and Early Childhood Development","funders":"Ministry of Science and Technology","keywords":"Communication source; Computer science; Secrecy; Computer network; Encryption; Computer security; Secure communication; Physical layer; Decoding methods; Cryptography; Information-theoretic security; Message authentication code; Secure coding; Information security; Wireless; Telecommunications; Security service","score_opus":0.02044017593248255,"score_gpt":0.2610817794370843,"score_spread":0.2406416035046018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386323222","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.86785245,0.0002081511,0.014359969,0.0014018469,0.000030376248,0.0003453374,0.0000070195338,0.014041986,0.10175289],"genre_scores_gemma":[0.98679775,0.0002939423,0.012583865,0.000039054703,0.000017175409,0.000056523037,0.000035783036,0.000033258537,0.00014264735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955416,0.000023233742,0.000090246285,0.00007633522,0.0001201657,0.00013584958],"domain_scores_gemma":[0.9991706,0.00007875385,0.0000143136995,0.0006633259,0.000039468294,0.000033546454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094940995,0.000090445494,0.00010130296,0.0000745464,0.00006567977,0.00003330365,0.00032879773,0.000042776923,0.000030284224],"category_scores_gemma":[0.0000059379963,0.0000809443,0.00002287525,0.00040119217,0.000036076024,0.00015448764,0.00009968121,0.00020488087,0.0001826082],"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.000024469731,0.00020222878,0.0029188131,0.0003282341,0.0002698893,0.000010672638,0.012463248,0.004460636,0.13587993,0.68377393,0.12964624,0.03002171],"study_design_scores_gemma":[0.0004004487,0.000039498023,0.0022333039,0.00014579007,0.000013297277,0.0000069609646,0.0007413313,0.8264729,0.110260755,0.0033593287,0.05578567,0.0005407226],"about_ca_topic_score_codex":0.0000095544865,"about_ca_topic_score_gemma":0.000023627617,"teacher_disagreement_score":0.82201225,"about_ca_system_score_codex":0.000029615196,"about_ca_system_score_gemma":0.0000054274037,"threshold_uncertainty_score":0.33008125},"labels":[],"label_agreement":null},{"id":"W4386552795","doi":"10.1109/ojcoms.2023.3313352","title":"Empowering Security and Trust in 5G and Beyond: A Deep Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Intrusion detection system; Bandwidth (computing); Internet of Things; Distributed computing; Deep learning; Artificial intelligence; Computer network; Computer security","score_opus":0.03128956785249813,"score_gpt":0.30950634054412535,"score_spread":0.2782167726916272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386552795","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.9549002,0.0063903844,0.0069918926,0.0043058167,0.00021629574,0.0011429193,0.0000038355283,0.000302951,0.025745714],"genre_scores_gemma":[0.9771805,0.012604892,0.010053101,0.00006208579,0.000010465911,0.000028878616,0.0000029358812,0.00002028596,0.0000368659],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999056,0.00018193308,0.0004085953,0.00007142717,0.0001413697,0.0001407226],"domain_scores_gemma":[0.99862593,0.00016979862,0.00016545763,0.0009193093,0.00006824493,0.000051270603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013794764,0.000105929605,0.00020617097,0.00006850885,0.00031584874,0.00014221926,0.0019878764,0.00007295059,0.0000028123554],"category_scores_gemma":[0.000048622787,0.000092922295,0.00007802055,0.00044842728,0.00018894052,0.00037500472,0.0011193899,0.000872184,8.7743086e-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.000056920388,0.00045047514,0.022453211,0.00075297634,0.0009983412,0.0000050140557,0.46083325,0.4348204,0.015414189,0.014326056,0.018222194,0.031666975],"study_design_scores_gemma":[0.0009184196,0.00004289141,0.0037017856,0.00026565845,0.000038319355,0.000093360715,0.016051156,0.9631521,0.0010528207,0.0027837483,0.011598075,0.0003016644],"about_ca_topic_score_codex":0.000033745415,"about_ca_topic_score_gemma":0.00002776556,"teacher_disagreement_score":0.5283317,"about_ca_system_score_codex":0.00010400718,"about_ca_system_score_gemma":0.000025333644,"threshold_uncertainty_score":0.37892613},"labels":[],"label_agreement":null},{"id":"W4387717425","doi":"10.1109/lwc.2023.3324981","title":"EsaNet: Environment Semantics Enabled Physical Layer Authentication","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"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":"Fundamental Research Funds for the Central Universities; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Spoofing attack; Physical layer; Computer network; Wireless network; Authentication (law); Wireless; Wireless security; Computer security; Telecommunications","score_opus":0.02934541922318499,"score_gpt":0.2619509789833638,"score_spread":0.2326055597601788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387717425","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.96661067,0.00016710779,0.014770834,0.0120843835,0.0001821101,0.0005990531,0.000038620565,0.004248091,0.0012991129],"genre_scores_gemma":[0.99315614,0.002101356,0.0034809995,0.00034061202,0.00007147501,0.0004256584,0.0002411239,0.00010600282,0.000076613636],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983962,0.000187695,0.00041775007,0.00024956206,0.00033484062,0.0004139269],"domain_scores_gemma":[0.9954716,0.0003259056,0.00009198648,0.0039675217,0.00003982753,0.00010315913],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002899335,0.0002777958,0.0002880338,0.0003089891,0.00030649116,0.00008959028,0.0019880477,0.000110621004,0.000022223332],"category_scores_gemma":[0.000011926913,0.00032519354,0.00012401975,0.0006389612,0.00028353257,0.0002577331,0.00035023948,0.0005092847,0.0011017644],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051943666,0.0002696732,0.0003609897,0.000109340064,0.00017774291,0.0000049545697,0.004937604,0.017012214,0.9278305,0.008793534,0.029923273,0.01057496],"study_design_scores_gemma":[0.00044983882,0.000020555015,0.0025962286,0.00010710003,0.0000802089,0.0000084711355,0.0002893928,0.8373848,0.08110281,0.000847451,0.07625832,0.0008548043],"about_ca_topic_score_codex":0.000020280766,"about_ca_topic_score_gemma":0.00001019116,"teacher_disagreement_score":0.8467277,"about_ca_system_score_codex":0.00017879093,"about_ca_system_score_gemma":0.0000135455975,"threshold_uncertainty_score":0.99992},"labels":[],"label_agreement":null},{"id":"W4387872657","doi":"10.1109/icc45041.2023.10279803","title":"Doubly Securing Large-Scale D2D Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Manitoba; York University","funders":"","keywords":"Covert; Jamming; Computer science; Secrecy; Exploit; Stackelberg competition; Computer network; Computer security; Reliability (semiconductor); Stochastic geometry; Artificial noise; Transmitter; Power (physics); Mathematics","score_opus":0.011898002304535147,"score_gpt":0.24006552513263546,"score_spread":0.22816752282810032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387872657","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.29577327,0.0008477843,0.4301483,0.0007294535,0.0006035886,0.00050002296,0.000013659186,0.039692476,0.23169143],"genre_scores_gemma":[0.9960432,0.0005068005,0.0027578536,0.00007044775,0.00006615346,0.00004606616,0.000027295951,0.000042588774,0.00043959435],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993466,0.000015006979,0.00015867924,0.00010209418,0.00009972892,0.00027790168],"domain_scores_gemma":[0.9993728,0.00004633696,0.000011492109,0.0004931886,0.00002189771,0.000054309738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019331994,0.00009941531,0.000108247834,0.000103374594,0.00006133706,0.000038645125,0.00030316072,0.00008767384,0.00014230248],"category_scores_gemma":[0.0000035636467,0.00010683152,0.000043332755,0.00042770457,0.000013110511,0.00012199741,0.000151121,0.0002048088,0.00026690515],"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.000013675795,0.00013333309,0.0062374393,0.00028867257,0.00019027841,0.000035780384,0.0076625776,0.35933757,0.0058944346,0.054749236,0.518178,0.04727901],"study_design_scores_gemma":[0.0001321748,0.000005033062,0.0009586749,0.000021619398,0.00000299027,0.0000018802128,0.00013949374,0.90950954,0.0044802325,0.0005473907,0.08400942,0.00019156521],"about_ca_topic_score_codex":0.000007932727,"about_ca_topic_score_gemma":0.000066860455,"teacher_disagreement_score":0.70026994,"about_ca_system_score_codex":0.000029295958,"about_ca_system_score_gemma":0.0000031772136,"threshold_uncertainty_score":0.43564627},"labels":[],"label_agreement":null},{"id":"W4387883697","doi":"10.1109/icc45041.2023.10278964","title":"Securing Cognitive Radio Networks via Relay and Jammer-Based Energy Harvesting on Cascaded Channels","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Relay; Jamming; Computer network; Underlay; Cognitive radio; Computer science; Energy harvesting; Rayleigh fading; Transmitter; Fading; Wireless; Energy (signal processing); Secrecy; Physical layer; Exploit; Channel (broadcasting); Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Computer security; Mathematics; Physics","score_opus":0.017987359812425233,"score_gpt":0.232908435191772,"score_spread":0.2149210753793468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387883697","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.49570712,0.0007822318,0.47485533,0.00046448133,0.00034402858,0.00042051164,0.0000106271855,0.01029622,0.017119458],"genre_scores_gemma":[0.9980953,0.00029461444,0.0009243913,0.00019705559,0.000082625724,0.000092688606,0.00004557749,0.000068364265,0.00019941479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907154,0.00006590572,0.00022222903,0.00020434591,0.00012928393,0.0003066711],"domain_scores_gemma":[0.9990435,0.00050471834,0.000036229656,0.00027724236,0.000041316707,0.00009697853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022564385,0.0001909179,0.00018918613,0.00021935005,0.00011827163,0.00006454476,0.00016582765,0.00014233353,0.00002210844],"category_scores_gemma":[0.000050079718,0.00020656269,0.000040276096,0.0004242184,0.000046438156,0.0001289455,0.000080440106,0.00029034476,0.000015026561],"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.00006291515,0.000091358124,0.0006028274,0.0002217487,0.00025080165,0.0001092344,0.0023179904,0.8150401,0.00895892,0.012103184,0.0059222574,0.15431863],"study_design_scores_gemma":[0.00033358144,0.00004064851,0.00047464485,0.00022731592,0.00001035464,0.0000067729716,0.00007951281,0.95362455,0.042729404,0.00017974169,0.0019956557,0.00029780087],"about_ca_topic_score_codex":0.00012620397,"about_ca_topic_score_gemma":0.000050397262,"teacher_disagreement_score":0.5023882,"about_ca_system_score_codex":0.00004557511,"about_ca_system_score_gemma":0.000007041956,"threshold_uncertainty_score":0.8423382},"labels":[],"label_agreement":null},{"id":"W4387918077","doi":"10.1109/twc.2023.3325384","title":"Achieving Covert Communication in Large-Scale SWIPT-Enabled D2D Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Artificial Intelligence in Medicine (Canada); Ericsson (Canada)","funders":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Covert; Wireless; Computer network; Scale (ratio); Telecommunications","score_opus":0.019122862894883696,"score_gpt":0.2626043478042409,"score_spread":0.24348148490935723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918077","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.15152678,0.0013803432,0.8262279,0.002825203,0.00039836738,0.0014287282,0.00016496125,0.0074748998,0.00857284],"genre_scores_gemma":[0.9743546,0.019395996,0.004469573,0.00017092211,0.000016100148,0.0010417148,0.00020788006,0.0001420733,0.00020111934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733895,0.0005112856,0.0008522085,0.00033022245,0.00031673728,0.00065057434],"domain_scores_gemma":[0.9932679,0.00091570016,0.00011647275,0.0054182988,0.00013476347,0.0001468488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008957548,0.00038447577,0.00046550832,0.000863024,0.00081432547,0.00013409284,0.002783954,0.00034665153,0.00006850413],"category_scores_gemma":[0.000009594075,0.00048027793,0.0001902805,0.002628203,0.00021723995,0.00056828785,0.00006340001,0.0017219515,0.0002377048],"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.00007139337,0.001757744,0.0014968563,0.00019393658,0.00027847596,0.000006576953,0.008403669,0.89418316,0.0075592087,0.005916895,0.0058899606,0.07424213],"study_design_scores_gemma":[0.000808618,0.000032364354,0.0020837146,0.00037230543,0.000035800524,0.000006323498,0.0008766609,0.9824212,0.0030593725,0.00029598683,0.009382699,0.0006249396],"about_ca_topic_score_codex":0.00013395732,"about_ca_topic_score_gemma":0.003105613,"teacher_disagreement_score":0.8228278,"about_ca_system_score_codex":0.00036180936,"about_ca_system_score_gemma":0.000049353577,"threshold_uncertainty_score":0.9997649},"labels":[],"label_agreement":null},{"id":"W4387950938","doi":"","title":"Covert communication with noncausal channel-state information at the transmitter","year":2018,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Transmitter; Computer science; Channel (broadcasting); Covert channel; State (computer science); Covert; Channel state information; Telecommunications; Computer network; Wireless; Algorithm; Philosophy","score_opus":0.005108702033563898,"score_gpt":0.1855741636915736,"score_spread":0.1804654616580097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387950938","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089094066,0.002356812,0.15102598,0.004477231,0.00010914376,0.0010299261,0.00017172932,0.0022680135,0.8376702],"genre_scores_gemma":[0.13611996,0.023291642,0.06584268,0.0010135905,0.00012355506,0.0012484927,0.0059746304,0.0018544934,0.76453096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963323,0.0019351388,0.00053652556,0.0003108839,0.0005037308,0.00038140488],"domain_scores_gemma":[0.9943063,0.00060970715,0.00041477493,0.0037367088,0.0008090036,0.00012345056],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020631016,0.0004724371,0.00038133241,0.0002967842,0.00038207925,0.0003115783,0.0019250588,0.00033960215,0.0010692178],"category_scores_gemma":[0.00009999324,0.0004008241,0.00012275144,0.00049521495,0.00057515886,0.00037670817,0.00044414925,0.0005542213,0.00066805637],"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.000030776464,0.00017905042,0.00012169805,0.00036499687,0.00033832935,0.0000016466852,0.016356481,0.00008338741,0.00029585185,0.007968427,0.92750406,0.046755306],"study_design_scores_gemma":[0.00047488743,9.745042e-7,0.00013644305,0.0014874192,0.00004592972,0.000016264448,0.00006563353,0.008012414,0.0131335,0.0003160575,0.97576845,0.0005420047],"about_ca_topic_score_codex":0.00076910405,"about_ca_topic_score_gemma":0.008086921,"teacher_disagreement_score":0.13522902,"about_ca_system_score_codex":0.00020318471,"about_ca_system_score_gemma":0.000074920456,"threshold_uncertainty_score":0.9998444},"labels":[],"label_agreement":null},{"id":"W4387969887","doi":"10.1109/cns59707.2023.10288672","title":"High-speed OFDM Physical-Layer Key Exchange","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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; Physical layer; Key generation; Key (lock); Orthogonal frequency-division multiplexing; Channel (broadcasting); Wireless; Aloha; Key exchange; Computer network; NIST; Throughput; Telecommunications; Public-key cryptography","score_opus":0.029981671146320162,"score_gpt":0.26855167159007026,"score_spread":0.2385700004437501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387969887","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.91577756,0.000096223885,0.0029535252,0.001149058,0.00018492763,0.00025244217,0.000014176322,0.014999898,0.064572185],"genre_scores_gemma":[0.99652267,0.00021915212,0.0013950629,0.00007193383,0.00009029573,0.000033740787,0.000028779106,0.00004224496,0.0015961464],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994667,0.000012824807,0.000109426896,0.00009962627,0.00012777322,0.00018362497],"domain_scores_gemma":[0.9993093,0.000058830192,0.000011381032,0.0005430128,0.00003134665,0.000046142966],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007117755,0.00010442429,0.00013315388,0.00010833001,0.000032805132,0.00002577891,0.00029601346,0.000051754072,0.00020363284],"category_scores_gemma":[0.00000783681,0.0001035484,0.00003812113,0.00040563845,0.000022427708,0.00011032156,0.000118967975,0.00012922674,0.001316472],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077272825,0.00020716537,0.00019358065,0.00026247345,0.00013721731,0.000016605552,0.007094861,0.0032185088,0.2381515,0.14068055,0.5805932,0.029436596],"study_design_scores_gemma":[0.0005026122,0.00007226786,0.003754043,0.000053948646,0.000011220631,0.000002531465,0.00025038572,0.18858959,0.57535446,0.01933318,0.21128348,0.00079229],"about_ca_topic_score_codex":0.000041510568,"about_ca_topic_score_gemma":0.00001640985,"teacher_disagreement_score":0.36930972,"about_ca_system_score_codex":0.000030428397,"about_ca_system_score_gemma":0.0000027717801,"threshold_uncertainty_score":0.9994611},"labels":[],"label_agreement":null},{"id":"W4388408173","doi":"10.3390/e25111522","title":"Energy-Limited Joint Source–Channel Coding of Gaussian Sources over Gaussian Channels with Unknown Noise Level","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"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":"Tangled Art + Disability; Tel Aviv University; Israel Science Foundation","keywords":"Gaussian noise; Additive white Gaussian noise; Shannon–Hartley theorem; Gaussian; Mathematics; Pulse-position modulation; Algorithm; Computer science; Topology (electrical circuits); White noise; Physics; Telecommunications; Statistics; Pulse (music); Combinatorics; Pulse-amplitude modulation","score_opus":0.02815704184092932,"score_gpt":0.23360444175209388,"score_spread":0.20544739991116456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388408173","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.76769257,0.0006643321,0.21985392,0.0011026192,0.0004268771,0.00051063386,0.00009288244,0.0053023314,0.004353814],"genre_scores_gemma":[0.997444,0.00037679233,0.0012028434,0.00005987906,0.000119245284,0.000072215655,0.00006844658,0.000111108995,0.0005454725],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848044,0.000067912806,0.00040725654,0.00024574948,0.00034930065,0.0004493473],"domain_scores_gemma":[0.9988744,0.00007643641,0.00012555713,0.00072431227,0.00006199226,0.00013727855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019025756,0.00028735533,0.00038557404,0.00044396226,0.00011167105,0.000057350942,0.00042678037,0.00014022073,0.00008868859],"category_scores_gemma":[0.000022016118,0.00026567938,0.00010666261,0.0007299079,0.00010539141,0.0001684691,0.0001590586,0.0002517831,0.000032120537],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032424706,0.0007012243,0.0039785756,0.0016817037,0.0016976134,0.00016040906,0.03806402,0.1770285,0.5075778,0.19229567,0.055280533,0.021209745],"study_design_scores_gemma":[0.0017541747,0.00021484257,0.0062020896,0.00097311626,0.00008093568,0.00002301676,0.001162189,0.44683707,0.49993426,0.0018030648,0.039767776,0.0012474981],"about_ca_topic_score_codex":0.00013074241,"about_ca_topic_score_gemma":0.00003807978,"teacher_disagreement_score":0.26980856,"about_ca_system_score_codex":0.00008169484,"about_ca_system_score_gemma":0.000021163902,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W4389169165","doi":"10.1109/tit.2023.3338215","title":"On a Class of Time-Varying Gaussian ISI Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Columbia College","funders":"","keywords":"Channel (broadcasting); Upper and lower bounds; Computer science; Algorithm; Combinatorics; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.010432682626857485,"score_gpt":0.2313363599901174,"score_spread":0.22090367736325991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389169165","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.020159561,0.000009873621,0.9332366,0.00015733279,0.00040963214,0.00035544956,0.00008793612,0.0027546121,0.042828985],"genre_scores_gemma":[0.99919945,0.000107122716,0.00027599902,0.00011350115,0.000009344364,0.00009576625,0.000025208326,0.000021516746,0.00015208429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.000056089924,0.00036609342,0.000057682275,0.00019881704,0.00015387073],"domain_scores_gemma":[0.9991575,0.00024828533,0.00006478545,0.00043224945,0.000052693173,0.0000445159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035204337,0.00012840284,0.00014215079,0.00061961287,0.00011744821,0.00003073707,0.00023021699,0.0001068691,0.00023068712],"category_scores_gemma":[0.000009254514,0.00013670602,0.00008224685,0.00052053854,0.00004389859,0.00063271297,0.0000016571631,0.00025352783,0.0012366697],"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.0000944123,0.00006338408,3.2837602e-7,0.0001965118,0.00009878167,5.643453e-7,0.0066095875,0.8670347,0.0026534898,0.036343798,0.0028146068,0.084089875],"study_design_scores_gemma":[0.0007525917,0.00018142696,0.000023345803,0.00034817352,0.00002937471,0.0000063965426,0.0006225419,0.51263106,0.46200547,0.015133121,0.0077543654,0.0005121314],"about_ca_topic_score_codex":0.0000027266058,"about_ca_topic_score_gemma":6.400143e-7,"teacher_disagreement_score":0.9790399,"about_ca_system_score_codex":0.000063501975,"about_ca_system_score_gemma":0.000011050299,"threshold_uncertainty_score":0.999541},"labels":[],"label_agreement":null},{"id":"W4389544151","doi":"10.1109/ccpqt60491.2023.00047","title":"Physical Layer Enhanced Encryption over Wireless Channel","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Encryption; Computer science; Physical layer; Cryptography; Computer network; Wireless; Probabilistic encryption; Channel (broadcasting); Algorithm; Telecommunications","score_opus":0.01979780306907706,"score_gpt":0.2744134719944794,"score_spread":0.2546156689254023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389544151","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.9534159,0.000014926354,0.023006633,0.00012890331,0.00009081066,0.00012645588,0.0000034195382,0.005467089,0.017745892],"genre_scores_gemma":[0.9989725,0.00016556504,0.00024750922,0.000040887684,0.00007791729,0.00008308786,0.000022282595,0.000033322514,0.000356964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994533,0.000016574995,0.000109930224,0.000107295375,0.00013514225,0.00017773671],"domain_scores_gemma":[0.99950397,0.000048927166,0.000012496789,0.00036961,0.000025803842,0.000039189134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007031468,0.00010235939,0.00011634747,0.000096540534,0.00003572672,0.000021668251,0.0002057021,0.000061602645,0.000067205816],"category_scores_gemma":[0.0000059438744,0.00010426163,0.000046874055,0.00034757916,0.000019961826,0.00015162319,0.00007104467,0.00013739786,0.0005250305],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039985193,0.000054474738,0.000020746293,0.00006954423,0.000033573382,0.0000019250465,0.0022521408,0.0024756233,0.93545073,0.022531448,0.02115969,0.015946103],"study_design_scores_gemma":[0.00012577254,0.000011976184,0.0011046575,0.000021081665,0.0000035109197,4.5273188e-7,0.00007916292,0.34219143,0.65047824,0.0032462114,0.0025280726,0.00020943367],"about_ca_topic_score_codex":0.000010608783,"about_ca_topic_score_gemma":0.00001294505,"teacher_disagreement_score":0.3397158,"about_ca_system_score_codex":0.00003517826,"about_ca_system_score_gemma":0.000003819736,"threshold_uncertainty_score":0.674838},"labels":[],"label_agreement":null},{"id":"W4389989653","doi":"10.1155/2023/9895680","title":"Retracted: Statistical Characteristics and Security Analysis over Multi-Cascade <i>κ</i>-<i>μ</i> Shadowed Channels","year":2023,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cascade; Computer science; Statistical analysis; Computer security; Operations research; Statistics; Engineering; Mathematics","score_opus":0.012039575123728675,"score_gpt":0.27246639049600874,"score_spread":0.2604268153722801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389989653","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.9462579,0.00016954272,0.052741274,0.00007177501,0.0002011949,0.00011265402,0.00017902484,0.0002524136,0.00001420246],"genre_scores_gemma":[0.98648214,0.0024103054,0.010738561,0.000030472513,0.000056026718,0.000007062358,0.00024118445,0.000029018884,0.000005230152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99870056,0.000036342262,0.00067852304,0.00011556493,0.00029263512,0.0001763828],"domain_scores_gemma":[0.99915,0.00014968525,0.00023365603,0.00018004674,0.00017036809,0.00011625443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030083462,0.0001510143,0.0003816228,0.00042840873,0.000047604495,0.000034621924,0.00014839397,0.0001301899,0.000022965576],"category_scores_gemma":[0.0000482331,0.00015787555,0.000103404884,0.0008178174,0.000043458596,0.00044866963,0.000004643913,0.00041544018,0.0000020112286],"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.0011657812,0.0012367539,0.13549632,0.0024217714,0.0067147026,0.0012832552,0.07117503,0.39100832,0.27596858,0.0081566805,0.0050530885,0.10031973],"study_design_scores_gemma":[0.0008899353,0.0000764972,0.949698,0.00008708613,0.00044467108,0.0000088360275,0.00028779072,0.04100047,0.0036600004,0.00088229193,0.0026642529,0.00030021425],"about_ca_topic_score_codex":0.000004763846,"about_ca_topic_score_gemma":0.000048473554,"teacher_disagreement_score":0.81420165,"about_ca_system_score_codex":0.000041780055,"about_ca_system_score_gemma":0.000013583388,"threshold_uncertainty_score":0.6437978},"labels":[],"label_agreement":null},{"id":"W4390189529","doi":"10.1109/milcom58377.2023.10356292","title":"Constant Scaling Asymptotics of Communication Bounds in Covert Channels Against Selective Adversary","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"Tsinghua Shenzhen International Graduate School","keywords":"Code word; Binary number; Transmitter; Covert; Adversary; Mathematics; Constraint (computer-aided design); Adversary model; Computer science; Constant (computer programming); Upper and lower bounds; Distribution (mathematics); Simple (philosophy); Square root; Algorithm; Decoding methods; Computer network; Statistics; Arithmetic; Mathematical analysis","score_opus":0.014240440785015891,"score_gpt":0.24882199176299696,"score_spread":0.23458155097798108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390189529","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.90194166,0.0007349098,0.009698415,0.0003253477,0.00012792471,0.00056291063,0.000027307231,0.0027657088,0.08381579],"genre_scores_gemma":[0.9952517,0.002087276,0.0024599296,0.00004745682,0.000005576003,0.00002867315,0.00006133435,0.000027140495,0.00003091369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991812,0.000068865775,0.0003418761,0.00009314652,0.00013937723,0.00017551906],"domain_scores_gemma":[0.9990499,0.00023275705,0.000047108682,0.00055285083,0.00008663654,0.00003072751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036174947,0.00010788334,0.00019884747,0.0002924529,0.000041433,0.000017641925,0.00036683047,0.000099640034,0.000008742109],"category_scores_gemma":[0.00005058149,0.00012545472,0.000038371734,0.00083860406,0.00008015573,0.0001632424,0.00014382639,0.00023248594,0.000016395827],"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.00008723558,0.0005603372,0.02787781,0.00078866765,0.0004969056,0.00001965072,0.032974835,0.62238723,0.104820624,0.1410567,0.027982887,0.040947106],"study_design_scores_gemma":[0.0006344221,0.00003328197,0.0039631804,0.00039542592,0.0000101551495,0.0000023472912,0.0017719094,0.8563832,0.12842278,0.005368104,0.0025762708,0.00043889706],"about_ca_topic_score_codex":0.00005712429,"about_ca_topic_score_gemma":0.000083059866,"teacher_disagreement_score":0.23399599,"about_ca_system_score_codex":0.00013627044,"about_ca_system_score_gemma":0.000027431257,"threshold_uncertainty_score":0.5115895},"labels":[],"label_agreement":null},{"id":"W4390357257","doi":"10.1109/tcomm.2023.3347768","title":"IRS-Assisted Covert Communication With Equal and Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Covert; Transmitter power output; Transmission (telecommunications); Computer science; Signal-to-noise ratio (imaging); Wireless; Throughput; Statistical power; Computer network; Power (physics); Algorithm; Channel (broadcasting); Mathematics; Telecommunications; Transmitter; Statistics","score_opus":0.03447038401678132,"score_gpt":0.25948539314202695,"score_spread":0.22501500912524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357257","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.17531896,0.0032555878,0.77200675,0.009882667,0.00023127465,0.0033858025,0.0005125123,0.015862912,0.019543521],"genre_scores_gemma":[0.97311795,0.008327436,0.017194368,0.00007271065,0.00000594004,0.00089526805,0.0000880209,0.00008589125,0.00021242973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00029457873,0.000465038,0.00023037803,0.00026716953,0.00030460051],"domain_scores_gemma":[0.9952808,0.0010118488,0.00006638698,0.0033790846,0.0001454289,0.0001164455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003708211,0.00028314764,0.0002890649,0.00037558074,0.0008022039,0.00011404279,0.0012439472,0.00016699063,0.00003893048],"category_scores_gemma":[0.000008448452,0.00029367502,0.00008179681,0.00096275605,0.0005235758,0.00039857725,0.000019011237,0.00075148244,0.000066483146],"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.00040119598,0.0027786442,0.00022062563,0.0011562166,0.0015578103,0.000007942738,0.052382387,0.08975737,0.017409729,0.064717755,0.0062406263,0.7633697],"study_design_scores_gemma":[0.0060159247,0.0011917716,0.006325129,0.0018840574,0.00068571494,0.00013850468,0.010838764,0.78943247,0.053903274,0.011977089,0.1134392,0.0041680783],"about_ca_topic_score_codex":0.00009968853,"about_ca_topic_score_gemma":0.0011944324,"teacher_disagreement_score":0.797799,"about_ca_system_score_codex":0.00015857925,"about_ca_system_score_gemma":0.00006081874,"threshold_uncertainty_score":0.99995154},"labels":[],"label_agreement":null},{"id":"W4390534264","doi":"10.1109/tmc.2023.3347580","title":"Cooperative Deep Reinforcement Learning Enabled Power Allocation for Packet Duplication URLLC in Multi-Connectivity Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Retransmission; Network packet; Computer network; Reinforcement learning; Scheduling (production processes); Telecommunications link; Distributed computing; Artificial intelligence","score_opus":0.015167811872945696,"score_gpt":0.2680953196626805,"score_spread":0.25292750778973483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390534264","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.079293884,0.00041453235,0.91754586,0.00004739422,0.0002745053,0.0011498873,0.0000018664077,0.0011911634,0.00008088884],"genre_scores_gemma":[0.99466676,0.00019078027,0.004143197,0.000027801327,0.000027352067,0.0008198329,0.000030554074,0.00006369405,0.000030058825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987599,0.000107151216,0.0004109339,0.00031448703,0.00012354754,0.00028392783],"domain_scores_gemma":[0.99901044,0.00045971255,0.00004427315,0.00033765275,0.000097674245,0.000050257917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034254,0.00021940403,0.000218015,0.0002557287,0.00022746537,0.00011587299,0.000176697,0.00015797901,0.00002016939],"category_scores_gemma":[0.000012588051,0.00025348045,0.000100438985,0.00048682708,0.000029507783,0.00024613,0.0000040607983,0.0006412703,0.000011516897],"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.000009861174,0.00006348016,0.000009211878,0.00006621573,0.000044417146,8.7282183e-7,0.0014043306,0.9719054,0.002837832,0.00022445641,0.00001723042,0.023416687],"study_design_scores_gemma":[0.00032831845,0.00009978614,0.000057371053,0.00021470756,0.000015998254,0.000002774332,0.00019572547,0.9733427,0.024718126,0.000018208708,0.00076497556,0.00024127796],"about_ca_topic_score_codex":0.000029812134,"about_ca_topic_score_gemma":0.0000844466,"teacher_disagreement_score":0.91537285,"about_ca_system_score_codex":0.00037874878,"about_ca_system_score_gemma":0.00002499721,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W4390590880","doi":"10.1109/tvt.2023.3348272","title":"UAV-Relayed Finite-Blocklength Covert Communication With Channel Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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":"National Natural Science Foundation of China","keywords":"Covert; Transmission (telecommunications); Transmitter; Channel (broadcasting); Relay; Transmitter power output; Computer science; Power (physics); Real-time computing; Algorithm; Computer network; Telecommunications; Physics","score_opus":0.007303910244404928,"score_gpt":0.2208678879026273,"score_spread":0.21356397765822235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590880","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.018971557,0.0018834,0.968632,0.0017370526,0.00014752864,0.00040545748,0.000027411776,0.007638234,0.00055738894],"genre_scores_gemma":[0.98317325,0.0017007748,0.014440664,0.000052006773,0.00000767886,0.00045048824,0.000026383894,0.00008740596,0.000061336556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.000050965587,0.000295653,0.00026311242,0.00019689028,0.00024941654],"domain_scores_gemma":[0.9985095,0.00016224323,0.000032018004,0.0011694569,0.00007999501,0.000046753063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001471247,0.0002551267,0.00022784491,0.0008074458,0.00018717952,0.00006979604,0.00050442066,0.00041283268,0.000036278965],"category_scores_gemma":[0.000006093222,0.0002545012,0.00007772485,0.0010800315,0.00017575687,0.0002555,0.0000046347895,0.0009870968,0.00014754117],"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.00004064779,0.00024999393,0.0000028581617,0.00024186974,0.0004438641,0.00003240636,0.00071204995,0.7690802,0.0060883807,0.009499977,0.00085979246,0.21274792],"study_design_scores_gemma":[0.00024585065,0.00014402384,0.000004060041,0.00032973848,0.00006690757,0.000058931273,0.00008472117,0.8532403,0.13628258,0.0023625395,0.0068605524,0.00031975468],"about_ca_topic_score_codex":0.000017672377,"about_ca_topic_score_gemma":0.000057263493,"teacher_disagreement_score":0.9642017,"about_ca_system_score_codex":0.00018386934,"about_ca_system_score_gemma":0.000032206022,"threshold_uncertainty_score":0.9999907},"labels":[],"label_agreement":null},{"id":"W4390961202","doi":"10.48550/arxiv.2401.06859","title":"Joint Power Optimization and AP Selection for Secure Cell-Free Massive MIMO","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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":"Queen's University; Queen's University Belfast; European Commission; Government of the United Kingdom","keywords":"Eavesdropping; Computer science; Joint (building); Telecommunications link; Mathematical optimization; Heuristic; Optimization problem; Selection (genetic algorithm); Power (physics); Power control; MIMO; Channel (broadcasting); Computer network; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.032143624841453264,"score_gpt":0.1752622287918999,"score_spread":0.14311860395044662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390961202","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.109346606,0.0008392855,0.8792515,0.00021023588,0.00046831282,0.0011478055,0.00016539625,0.0022105828,0.0063602985],"genre_scores_gemma":[0.9865049,0.001089302,0.011772367,0.000019782752,0.000045071785,0.000012895277,0.00008519557,0.00008072205,0.00038975067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990197,0.00004478411,0.00019129783,0.0004854032,0.00005291346,0.00020590374],"domain_scores_gemma":[0.99889207,0.00005645081,0.00009106556,0.00071604847,0.00016092992,0.000083431456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012346994,0.000291699,0.0002652279,0.00032646063,0.00008888396,0.000095686584,0.00044281888,0.00044573614,0.00003832671],"category_scores_gemma":[0.000021390622,0.00037873373,0.00013295554,0.00027995752,0.000054249478,0.00012460019,0.0009074643,0.00068502425,0.000008949473],"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.000012830138,0.000026482083,0.000041055024,0.00063740247,0.00009693905,0.0000065350273,0.00038902322,0.97112626,0.00038934016,0.021835985,0.0053842273,0.000053903215],"study_design_scores_gemma":[0.00028132647,0.000035903875,0.000017881579,0.00016546043,0.00012325676,0.0000021650221,0.00012196542,0.96241826,0.003621676,0.03154679,0.0012619871,0.00040332804],"about_ca_topic_score_codex":0.00002798092,"about_ca_topic_score_gemma":0.00003220362,"teacher_disagreement_score":0.8771583,"about_ca_system_score_codex":0.00028464018,"about_ca_system_score_gemma":0.000047795314,"threshold_uncertainty_score":0.9998665},"labels":[],"label_agreement":null},{"id":"W4391021929","doi":"10.1109/cdc49753.2023.10383642","title":"Reinforcement Learning for Zero-Delay Coding Over a Noisy Channel with Feedback","year":2023,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Reinforcement learning; Lossy compression; Computer science; Coding (social sciences); Markov process; Markov chain; Source code; Theoretical computer science; Decoding methods; Markov decision process; Block code; Algorithm; Channel (broadcasting); Mathematics; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.021680261206460005,"score_gpt":0.2540751132417851,"score_spread":0.23239485203532512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391021929","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.044920594,0.00005285311,0.90580404,0.00025836827,0.000081951825,0.0007712777,0.0000025567429,0.0069192564,0.0411891],"genre_scores_gemma":[0.9938788,0.00013895758,0.0033960927,0.00008151862,0.000024561037,0.00023734341,0.000045125773,0.00005581769,0.0021418105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.000009851303,0.00017133968,0.000115496754,0.00013511753,0.00025057571],"domain_scores_gemma":[0.9994876,0.000093015464,0.000028505307,0.0002969381,0.0000475477,0.00004642264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018373202,0.00012636854,0.00013423443,0.00013144045,0.00009924066,0.0000444123,0.00019544405,0.000059382077,0.00005003919],"category_scores_gemma":[0.000017879644,0.00011695888,0.000039542887,0.00027860017,0.000017935265,0.0001420454,0.00007621792,0.00015887401,0.000055743123],"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.00004264199,0.000017509194,0.000235574,0.0003228822,0.00015387888,0.000004370842,0.002938887,0.9046652,0.008775615,0.030474331,0.04979855,0.0025706182],"study_design_scores_gemma":[0.0004510316,0.00008507529,0.00017061176,0.000093206734,0.000009422389,0.0000025349668,0.00021150555,0.94181424,0.013361547,0.00032604556,0.043203533,0.00027122058],"about_ca_topic_score_codex":0.000018863855,"about_ca_topic_score_gemma":0.000014558896,"teacher_disagreement_score":0.94895816,"about_ca_system_score_codex":0.000060532388,"about_ca_system_score_gemma":0.000007679059,"threshold_uncertainty_score":0.47694448},"labels":[],"label_agreement":null},{"id":"W4391807095","doi":"10.1109/twc.2024.3363186","title":"Covert D2D Communication Underlaying Cellular Network: A System-Level Security Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"York University; Ericsson (Canada)","funders":"National Natural Science Foundation of China","keywords":"Cellular network; Computer science; Covert; Perspective (graphical); Computer network; Computer security; Artificial intelligence","score_opus":0.032062331873142606,"score_gpt":0.271511761084661,"score_spread":0.2394494292115184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391807095","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.0072449083,0.011042018,0.93873817,0.0016392643,0.00067234016,0.001054972,0.00032425017,0.008258955,0.031025153],"genre_scores_gemma":[0.9844302,0.0071794284,0.006998264,0.000078557365,0.000052700478,0.0008081898,0.00008819795,0.00018773679,0.00017673496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972488,0.00056558877,0.0007776004,0.00044689354,0.00042159692,0.00053949445],"domain_scores_gemma":[0.9932558,0.0010187651,0.00009187329,0.0051420033,0.00030817618,0.00018340503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006609969,0.0004925779,0.00047692237,0.0004699555,0.0011385763,0.0003829091,0.0025066263,0.0003547207,0.00006116091],"category_scores_gemma":[0.0000058059377,0.0005821547,0.00032498472,0.001390991,0.00039692599,0.0006725343,0.000047312784,0.0019069056,0.00024828262],"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.00005195176,0.0009133971,0.000016693224,0.0010510611,0.0015126279,0.000017685881,0.011818342,0.099531576,0.011698167,0.8257489,0.009443236,0.03819636],"study_design_scores_gemma":[0.00039422218,0.000060610866,0.000015047337,0.0016570324,0.0002322722,0.00005201309,0.0038459213,0.954611,0.018627672,0.006761848,0.012717873,0.0010245092],"about_ca_topic_score_codex":0.00042253835,"about_ca_topic_score_gemma":0.0008297122,"teacher_disagreement_score":0.9771853,"about_ca_system_score_codex":0.001460508,"about_ca_system_score_gemma":0.00013841764,"threshold_uncertainty_score":0.999663},"labels":[],"label_agreement":null},{"id":"W4391952613","doi":"10.1109/tvt.2024.3367362","title":"Enabling Deep Learning-Based Physical-Layer Secret Key Generation for FDD-OFDM Systems in Multi-Environments","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Physical layer; Key (lock); Orthogonal frequency-division multiplexing; Computer science; Electronic engineering; Layer (electronics); Computer network; Telecommunications; Engineering; Materials science; Channel (broadcasting); Wireless; Computer security; Nanotechnology","score_opus":0.026410964962477072,"score_gpt":0.2663892021730431,"score_spread":0.23997823721056605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952613","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.14401455,0.0010624211,0.85193545,0.00017438653,0.00023885524,0.0005861878,0.000013622997,0.0019627302,0.0000118131775],"genre_scores_gemma":[0.9938885,0.00025715536,0.0043574804,0.000016234446,0.000029917634,0.0012833145,0.000028416765,0.00009205566,0.000046933957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988675,0.000062237414,0.00030103672,0.00033927042,0.00014461242,0.0002853419],"domain_scores_gemma":[0.9993224,0.00008944659,0.00003020437,0.000495751,0.00002524514,0.000036962345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016584592,0.0002307066,0.00025429745,0.00078219466,0.000119461285,0.000061721636,0.00026204553,0.00038682594,0.000007201762],"category_scores_gemma":[0.000008569281,0.00025955794,0.00011347145,0.00053416786,0.0000679141,0.00013823617,0.0000025010065,0.0007991427,0.000039739716],"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.000003833353,0.00012999344,0.0000042862084,0.00009664851,0.000046665336,0.0000058314986,0.00014803826,0.7797837,0.21033622,0.0003119865,0.00001153691,0.009121209],"study_design_scores_gemma":[0.0002698687,0.000070871196,0.0000022313286,0.00008419767,0.000023139914,0.0000039362567,0.00006319683,0.7312168,0.26009977,0.000044677465,0.007940644,0.00018068231],"about_ca_topic_score_codex":0.0000171474,"about_ca_topic_score_gemma":0.000054504893,"teacher_disagreement_score":0.84987396,"about_ca_system_score_codex":0.00028349215,"about_ca_system_score_gemma":0.000015611697,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W4391992316","doi":"10.1109/jproc.2024.3364256","title":"Physical Layer Covert Communication in B5G Wireless Networks—its Research, Applications, and Challenges","year":2024,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":45,"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":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Physical layer; Covert; Computer network; Layer (electronics); Wireless; Computer science; Wireless network; Network layer; Telecommunications; Nanotechnology; Linguistics; Materials science; Philosophy","score_opus":0.05756803683498696,"score_gpt":0.3109112964948197,"score_spread":0.25334325965983273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391992316","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.9320039,0.051197443,0.00017820176,0.00380518,0.000063065934,0.0009902242,0.000006306223,0.0007004452,0.01105519],"genre_scores_gemma":[0.9660033,0.033371504,0.00020334055,0.0000092214,0.000052305877,0.00030435025,8.594699e-7,0.000029825462,0.000025286861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.00002144515,0.0001782116,0.00014304633,0.00020287746,0.00016120251],"domain_scores_gemma":[0.9993327,0.00020401037,0.000026733072,0.0002764121,0.00013152171,0.00002857327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006028278,0.00009700121,0.00014215671,0.00012523205,0.00006769109,0.00006414323,0.000681732,0.000080862344,9.57158e-7],"category_scores_gemma":[0.00001975911,0.00008392689,0.000031768122,0.00044360457,0.0001269554,0.00024885894,0.00021474973,0.0005287448,0.000003778868],"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.000030242192,0.00032471612,0.0010105154,0.0050448105,0.00013761547,4.6961205e-7,0.013585008,0.0010948634,0.15634054,0.68402034,0.013594744,0.12481617],"study_design_scores_gemma":[0.00032134244,0.000054534285,0.0030479962,0.0026058226,0.000033029704,0.000014106955,0.0013607993,0.6525734,0.22705248,0.044841636,0.06754237,0.0005524481],"about_ca_topic_score_codex":0.000011890165,"about_ca_topic_score_gemma":0.000014277782,"teacher_disagreement_score":0.6514786,"about_ca_system_score_codex":0.000067190056,"about_ca_system_score_gemma":0.000009180946,"threshold_uncertainty_score":0.34224394},"labels":[],"label_agreement":null},{"id":"W4392152655","doi":"10.1109/globecom54140.2023.10437531","title":"Covert Communication via IRS with Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Covert; Computer network; Computer security; Telecommunications","score_opus":0.010869740067377696,"score_gpt":0.21326371134761712,"score_spread":0.20239397128023942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392152655","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.8033799,0.00052151293,0.101494834,0.002357638,0.000055800883,0.0012932791,0.000017682463,0.018097928,0.07278145],"genre_scores_gemma":[0.9867412,0.00041920517,0.012197587,0.00003800468,0.0000063886714,0.00017892329,0.000050554947,0.00004119679,0.00032697123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993189,0.000049281658,0.00019897419,0.000101454796,0.00015839585,0.00017297963],"domain_scores_gemma":[0.99886626,0.00015685742,0.000018814804,0.00086394337,0.000054687738,0.00003940786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019823162,0.00012167828,0.00013670778,0.00009955536,0.00008193607,0.00003702372,0.000430226,0.00006851742,0.00008511836],"category_scores_gemma":[0.000009659763,0.00010944887,0.00003103991,0.0003695257,0.00008349159,0.0002107307,0.000052501484,0.0001780653,0.00008810496],"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.0002440983,0.00066116813,0.007522742,0.002789599,0.0008477919,0.000017846378,0.08517126,0.13224174,0.04310575,0.38067368,0.08903126,0.25769308],"study_design_scores_gemma":[0.0020862247,0.00040995257,0.011201104,0.00053735514,0.000079207886,0.00002417728,0.0048315204,0.6263809,0.14642143,0.027602205,0.17818043,0.0022454455],"about_ca_topic_score_codex":0.00007391282,"about_ca_topic_score_gemma":0.00028006325,"teacher_disagreement_score":0.4941392,"about_ca_system_score_codex":0.00006791177,"about_ca_system_score_gemma":0.000016244257,"threshold_uncertainty_score":0.44631955},"labels":[],"label_agreement":null},{"id":"W4392158201","doi":"10.1109/globecom54140.2023.10437887","title":"Secure Terahertz Indoor Communications Using Blockage Feature-Based Artificial Noise in 6G","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Terahertz radiation; Computer science; Feature (linguistics); Noise (video); Telecommunications; Artificial intelligence; Optoelectronics; Materials science","score_opus":0.047306411125461086,"score_gpt":0.29808898299214315,"score_spread":0.25078257186668207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158201","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.95961875,0.00050603284,0.016661357,0.004164549,0.00017844743,0.0009054964,0.00005610065,0.007219424,0.010689858],"genre_scores_gemma":[0.97843564,0.00008368629,0.021038674,0.00013682556,0.000024986397,0.00008253466,0.000094157906,0.00005261468,0.000050902734],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906516,0.000091343725,0.00028896838,0.00014211271,0.00015015477,0.00026227196],"domain_scores_gemma":[0.99821836,0.00016609656,0.000033189994,0.0014795797,0.00004687345,0.00005587656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026116255,0.00016227098,0.00018763078,0.0004103664,0.00010390743,0.0000664703,0.00080356805,0.00016841367,0.00004551124],"category_scores_gemma":[0.000035124,0.00018110553,0.0000586661,0.0011119789,0.0000663337,0.00013611079,0.00020330984,0.0004843078,0.00007321245],"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.00007185048,0.0009961951,0.019207966,0.0005618044,0.00019178183,0.00007946582,0.010177312,0.08019886,0.731166,0.047254365,0.04848812,0.061606262],"study_design_scores_gemma":[0.00024527783,0.0000098431465,0.002111218,0.00009617798,0.000008543893,0.0000022067236,0.00019066404,0.9333646,0.04315617,0.0009845373,0.019495845,0.0003348971],"about_ca_topic_score_codex":0.000111832385,"about_ca_topic_score_gemma":0.00084647577,"teacher_disagreement_score":0.85316575,"about_ca_system_score_codex":0.00014140403,"about_ca_system_score_gemma":0.000036675712,"threshold_uncertainty_score":0.73852694},"labels":[],"label_agreement":null},{"id":"W4392158327","doi":"10.1109/globecom54140.2023.10437020","title":"Robust Deep Joint Source Channel Coding with Time-Varying Noise","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Joint (building); Coding (social sciences); Channel code; Noise (video); Decoding methods; Speech recognition; Telecommunications; Artificial intelligence; Engineering; Mathematics; Statistics","score_opus":0.032405098066856736,"score_gpt":0.21795367682786246,"score_spread":0.18554857876100572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158327","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.09502535,0.00019094883,0.80795884,0.0007798568,0.000080771184,0.00048609223,0.000004222966,0.020968853,0.07450508],"genre_scores_gemma":[0.9880084,0.0001364442,0.010777226,0.00007215099,0.000035291312,0.00005822679,0.00002304602,0.0000753477,0.00081389956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928916,0.00001874612,0.00016739841,0.00013171919,0.00014597588,0.00024700738],"domain_scores_gemma":[0.9993542,0.000056657,0.00002284027,0.00046455467,0.00003769258,0.00006407415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017124553,0.00013671769,0.0001549151,0.0001783061,0.00009141302,0.000052135543,0.00024213886,0.00006281889,0.000118229545],"category_scores_gemma":[0.000014385014,0.00012864108,0.00003352211,0.00043354664,0.000026660071,0.00014715183,0.00012281338,0.0001877924,0.0004408745],"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.000011442812,0.000041854426,0.00016123411,0.00022543965,0.00012144454,0.000021616397,0.0042455853,0.91967255,0.046556372,0.0019086536,0.017341431,0.009692368],"study_design_scores_gemma":[0.00013763453,0.000014083917,0.00015608958,0.00007740401,0.0000063559078,0.000008376623,0.00015651833,0.9682143,0.029010808,0.00007956689,0.0019051235,0.00023377253],"about_ca_topic_score_codex":0.000020340356,"about_ca_topic_score_gemma":0.000013199756,"teacher_disagreement_score":0.892983,"about_ca_system_score_codex":0.000050527986,"about_ca_system_score_gemma":0.0000059551735,"threshold_uncertainty_score":0.56666964},"labels":[],"label_agreement":null},{"id":"W4392158351","doi":"10.1109/globecom54140.2023.10436880","title":"Covert Communication Based on Non-Ideal Detection of Overt Channels","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Windsor","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China","keywords":"Computer science; Covert; Ideal (ethics); Covert channel; Computer network; Computer security","score_opus":0.013739698827109032,"score_gpt":0.24448763792740047,"score_spread":0.23074793910029143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158351","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.6596467,0.00014717165,0.22249815,0.0009681567,0.00042487506,0.0010953771,0.000031738426,0.00924233,0.105945535],"genre_scores_gemma":[0.9984354,0.00019982686,0.0010962724,0.00006423418,0.000010363378,0.000061509425,0.000038306018,0.000027030648,0.00006708758],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994131,0.000037939164,0.00020292109,0.00007755464,0.00015578148,0.00011275473],"domain_scores_gemma":[0.9989246,0.00016213875,0.000034391483,0.0007997851,0.00005143215,0.00002765509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022870801,0.00009054019,0.00012403727,0.00021733128,0.000045497123,0.000013922182,0.00029942067,0.00008424279,0.000033281223],"category_scores_gemma":[0.000026211921,0.000098302975,0.00004624621,0.0004251782,0.000025688236,0.000091385766,0.000054081782,0.00014596619,0.000075925454],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006876724,0.00019764663,0.00042632344,0.0003308037,0.00007673564,0.0000014455602,0.0011376545,0.22282316,0.698149,0.006009597,0.024559168,0.046219658],"study_design_scores_gemma":[0.00011968547,0.00003105444,0.00094702037,0.00003482414,0.0000025100112,2.0278577e-7,0.000023582068,0.5728647,0.42282933,0.00025802478,0.002809673,0.00007937275],"about_ca_topic_score_codex":0.000092340924,"about_ca_topic_score_gemma":0.000035179608,"teacher_disagreement_score":0.35004157,"about_ca_system_score_codex":0.00005779139,"about_ca_system_score_gemma":0.000007979957,"threshold_uncertainty_score":0.40086788},"labels":[],"label_agreement":null},{"id":"W4392399515","doi":"10.5220/0012454400003648","title":"Towards Generalized Diffie-Hellman-esque Key Agreement via Generic Split KEM Construction","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Key (lock); Computer science; Computer security","score_opus":0.015588381184232848,"score_gpt":0.24267377318062222,"score_spread":0.22708539199638939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392399515","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.28788584,0.006230269,0.6093761,0.0011759443,0.0012743036,0.0006142249,0.000022261675,0.00825801,0.085163094],"genre_scores_gemma":[0.9001769,0.0020713503,0.096600175,0.00013241652,0.0001583137,0.00012425028,0.000049203827,0.00006247463,0.0006249365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894506,0.00004374956,0.0003395221,0.00022480825,0.000212854,0.00023403196],"domain_scores_gemma":[0.9992167,0.0000255517,0.00001982585,0.00061129,0.00004606211,0.00008059834],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014629107,0.0002119719,0.00019948563,0.00017690255,0.000054222215,0.00012592017,0.00030413014,0.0001286848,0.0009441223],"category_scores_gemma":[0.0000050906388,0.00020659952,0.000100509285,0.00030656203,0.000055240493,0.00017669771,0.00011332138,0.00023287002,0.00023476714],"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.000013477112,0.000089930036,0.00017428628,0.0007229718,0.0004570808,0.000034777375,0.0016518406,0.0050506876,0.14749208,0.29355085,0.040320653,0.51044136],"study_design_scores_gemma":[0.00027507194,0.000036835914,0.00038842994,0.00009372736,0.000045205976,0.000066765366,0.00007114065,0.45678037,0.15718918,0.0065775285,0.37784272,0.00063300045],"about_ca_topic_score_codex":0.00013026258,"about_ca_topic_score_gemma":0.00005465234,"teacher_disagreement_score":0.61229104,"about_ca_system_score_codex":0.00021851869,"about_ca_system_score_gemma":0.000024144274,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W4396624167","doi":"10.3389/frcmn.2024.1370496","title":"Secure authentication in MIMO systems: exploring physical limits","year":2024,"lang":"en","type":"article","venue":"Frontiers in Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"MIMO; Authentication (law); Computer science; Computer security; Computer network; Channel (broadcasting)","score_opus":0.03289620937097304,"score_gpt":0.25910164873367725,"score_spread":0.2262054393627042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396624167","genre_codex":"review","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.25551847,0.42605218,0.30228695,0.0019944813,0.0021706198,0.0015325893,0.00002540007,0.002898905,0.0075204186],"genre_scores_gemma":[0.950486,0.042066943,0.0068422444,0.000009173175,0.000047959365,0.0004639972,0.000035302706,0.000034241428,0.000014114119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991703,0.00011996968,0.00028640684,0.0001557179,0.00007752123,0.00019005353],"domain_scores_gemma":[0.99869627,0.00017466066,0.000019984675,0.0010470866,0.000020135518,0.000041868065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028284834,0.00013393756,0.00020126355,0.00030013875,0.00006454062,0.00012137603,0.00056464097,0.00010126957,9.166555e-7],"category_scores_gemma":[0.000009052062,0.00015075725,0.000031682885,0.0005980285,0.0000891606,0.00033065566,0.00014698863,0.00060605834,0.0000023520313],"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.000027073775,0.0006194557,0.022975259,0.0012601233,0.00030171985,0.000019646168,0.040589303,0.11555407,0.0005932408,0.21247844,0.038256902,0.56732476],"study_design_scores_gemma":[0.00007638645,0.000007823943,0.00095080695,0.00048245816,0.000008620537,0.0000022682261,0.00056841463,0.97146475,0.000019082798,0.0012220738,0.025046393,0.00015094198],"about_ca_topic_score_codex":0.00003142353,"about_ca_topic_score_gemma":0.000071635826,"teacher_disagreement_score":0.85591066,"about_ca_system_score_codex":0.00013114983,"about_ca_system_score_gemma":0.000010633498,"threshold_uncertainty_score":0.61477023},"labels":[],"label_agreement":null},{"id":"W4396983017","doi":"10.1109/ncic61838.2023.00046","title":"Deep Learning Based Adaptive Physical Layer Key Distribution","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Key (lock); Computer science; Layer (electronics); Artificial intelligence; Materials science; Nanotechnology; Computer security","score_opus":0.02106301789163666,"score_gpt":0.2562036776862292,"score_spread":0.23514065979459253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396983017","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.17371492,0.00004964051,0.8008249,0.00027882648,0.000053618536,0.00017679126,0.0000101844535,0.010938241,0.013952908],"genre_scores_gemma":[0.99848574,0.000019591647,0.0011220805,0.000012961227,0.000027984723,0.000041718573,0.00016437827,0.00002096437,0.00010457465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955845,0.000026612894,0.00008259744,0.00008265221,0.00010587783,0.0001438039],"domain_scores_gemma":[0.9996043,0.00009981222,0.0000113586775,0.00021220511,0.00003796883,0.000034363235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007579258,0.00007973733,0.00008697434,0.00004266037,0.000054951874,0.000020200192,0.0001388861,0.000044636075,0.000039197996],"category_scores_gemma":[0.000021501895,0.00008256964,0.000036289308,0.00031921046,0.00002131499,0.000085139356,0.000044884633,0.00020413999,0.0003034538],"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.000035550027,0.00024879733,0.0015858656,0.00010815628,0.0001192859,0.000015639478,0.0025893124,0.72615117,0.034285452,0.13596079,0.026948314,0.07195168],"study_design_scores_gemma":[0.00006944054,0.000023980956,0.0013952137,0.000008927378,0.0000025254583,2.106289e-7,0.0000619678,0.96366704,0.025565755,0.0007965722,0.008304861,0.00010349548],"about_ca_topic_score_codex":0.000007225786,"about_ca_topic_score_gemma":0.0000078743,"teacher_disagreement_score":0.8247708,"about_ca_system_score_codex":0.000054391592,"about_ca_system_score_gemma":0.0000039060387,"threshold_uncertainty_score":0.39003858},"labels":[],"label_agreement":null},{"id":"W4399169495","doi":"10.1109/smc-iot62253.2023.00027","title":"Design of Physical Layer secure communication for real wireless propagation environment","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Physical layer; Computer science; Wireless; Key (lock); Radio propagation; Layer (electronics); Transmission (telecommunications); Computer network; Application layer; Distributed computing; Computer security; Telecommunications","score_opus":0.034255799733452684,"score_gpt":0.2682448504970826,"score_spread":0.23398905076362989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169495","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.21351366,0.00006148068,0.77907926,0.00035334326,0.000024150097,0.0016197048,0.000021750351,0.0023610995,0.0029655616],"genre_scores_gemma":[0.98180157,0.0006430877,0.016972056,0.000005785422,0.000013630408,0.00038122485,0.00009789793,0.000031757056,0.000053018237],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.000057696063,0.00018695589,0.00008630788,0.00012536743,0.00011476444],"domain_scores_gemma":[0.99912035,0.00021219885,0.000043447435,0.00056675804,0.00003442384,0.000022816295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023693978,0.000090828384,0.00013629626,0.00007286327,0.00004430826,0.000009874619,0.0002789081,0.00006203236,0.000009698023],"category_scores_gemma":[0.000006976203,0.00009153712,0.000039927978,0.00013998667,0.000040429804,0.00010606223,0.00006659348,0.000085484375,0.000019166413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004070222,0.00022965767,0.00012065795,0.00038329963,0.00010288195,3.3087682e-7,0.0068833237,0.13845322,0.6994233,0.1137279,0.008505772,0.032128952],"study_design_scores_gemma":[0.00014537854,0.000042551444,0.00021751395,0.000023382549,0.000008627238,2.1269965e-7,0.00009760189,0.7630756,0.23262762,0.0028216885,0.00083254115,0.00010730397],"about_ca_topic_score_codex":0.000010186826,"about_ca_topic_score_gemma":0.0000032294474,"teacher_disagreement_score":0.7682879,"about_ca_system_score_codex":0.000049420276,"about_ca_system_score_gemma":0.000007309234,"threshold_uncertainty_score":0.37327754},"labels":[],"label_agreement":null},{"id":"W4399800473","doi":"10.1109/ojcoms.2024.3416808","title":"From 5G to 6G Networks: A Survey on AI-Based Jamming and Interference Detection and Mitigation","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Jamming; Interference (communication); Computer science; Telecommunications; Computer security; Physics; Channel (broadcasting)","score_opus":0.03952200624806048,"score_gpt":0.3152591608913827,"score_spread":0.2757371546433222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399800473","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.69460964,0.0064350152,0.2848866,0.011737708,0.00073748856,0.0008445772,0.00007414606,0.00022824899,0.00044658832],"genre_scores_gemma":[0.9887365,0.0015282999,0.009335323,0.0003113133,0.000034648096,0.000019034414,0.0000049050523,0.000020329393,0.0000096459935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991256,0.00030534127,0.0003015068,0.00008532102,0.00010052084,0.00008172567],"domain_scores_gemma":[0.99809206,0.0007399562,0.00008219778,0.00090114784,0.00012770426,0.00005691622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094870693,0.00010022132,0.0001456637,0.000046498033,0.00022386484,0.0004067982,0.0014048925,0.00007168566,0.0000030117512],"category_scores_gemma":[0.000069000234,0.00008385808,0.0000668463,0.00029676734,0.000095005315,0.00029483158,0.00030044754,0.0006316771,0.0000014124593],"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.0002472806,0.00043796512,0.007983581,0.00027883498,0.0016965403,0.000002753124,0.05136876,0.11469167,0.123584285,0.0016614256,0.11312433,0.58492255],"study_design_scores_gemma":[0.00042953863,0.00016073608,0.021339642,0.0023117785,0.00008585236,0.000016704173,0.00074574247,0.93745434,0.024091998,0.0018328878,0.011172084,0.00035866932],"about_ca_topic_score_codex":0.00021127202,"about_ca_topic_score_gemma":0.0004332791,"teacher_disagreement_score":0.82276267,"about_ca_system_score_codex":0.00012378857,"about_ca_system_score_gemma":0.00003438996,"threshold_uncertainty_score":0.39227644},"labels":[],"label_agreement":null},{"id":"W4400114562","doi":"10.1109/ietc61393.2024.10564473","title":"Secrecy and Resilience in Next-Gen Wi-Fi: Exploring a Multi-User Down-Link Non-Orthogonal Transmission Framework","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Link (geometry); Computer science; Secrecy; Resilience (materials science); Transmission (telecommunications); Computer network; Computer security; Telecommunications; Physics","score_opus":0.041110795563430225,"score_gpt":0.2820967139097497,"score_spread":0.2409859183463195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400114562","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.38341656,0.005223391,0.607916,0.00052835775,0.00011226812,0.00027915684,0.000003519649,0.0015438881,0.0009768688],"genre_scores_gemma":[0.91796166,0.003885608,0.077814534,0.00004184562,0.000041286374,0.00012612765,0.0000043950054,0.000042968426,0.000081552105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990267,0.000032892844,0.00028897662,0.00025749748,0.00015880457,0.00023508361],"domain_scores_gemma":[0.9993435,0.00015474406,0.000010043816,0.00037477276,0.00001926203,0.000097683376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024035128,0.00017715157,0.00017188434,0.0002179545,0.00004624153,0.00013018693,0.00027914712,0.00015903269,0.000080108],"category_scores_gemma":[0.000022174208,0.00017137491,0.000042405372,0.00040380596,0.000041112628,0.00061563775,0.000084174964,0.00059866114,0.00002080219],"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.00003412041,0.00012322966,0.0058292435,0.0013206694,0.000072780815,0.00009487095,0.023126762,0.007543838,0.06948499,0.060541984,0.0004886047,0.8313389],"study_design_scores_gemma":[0.00041446468,0.00005163841,0.01563922,0.0032819372,0.00001734574,0.0000227744,0.0006641709,0.88961095,0.043389253,0.00603928,0.0399772,0.00089176255],"about_ca_topic_score_codex":0.000040080642,"about_ca_topic_score_gemma":0.000043993343,"teacher_disagreement_score":0.8820671,"about_ca_system_score_codex":0.00005465663,"about_ca_system_score_gemma":0.000019970534,"threshold_uncertainty_score":0.69884664},"labels":[],"label_agreement":null},{"id":"W4400488061","doi":"10.1109/tgcn.2024.3425792","title":"Federated Learning-Enabled Jamming Detection for Stochastic Terrestrial and Non-Terrestrial Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Jamming; Terrestrial plant; Computer science; Terrestrial ecosystem; Ecology; Biology; Physics; Ecosystem","score_opus":0.022691614786784726,"score_gpt":0.2573253716229446,"score_spread":0.2346337568361599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400488061","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.010015559,0.0030972634,0.9843709,0.0001970227,0.00066864165,0.0006121848,0.0000065148306,0.00092204486,0.00010989716],"genre_scores_gemma":[0.9930187,0.0048029087,0.0013155953,0.00002131295,0.00028606626,0.0004193891,0.000023488954,0.00007437318,0.000038199036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888563,0.000121002835,0.0003767083,0.00024839287,0.0000946772,0.00027360968],"domain_scores_gemma":[0.9984543,0.0009110387,0.00004837855,0.00047588572,0.000022279937,0.00008814843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035471676,0.00023682848,0.00023776264,0.00023914858,0.00097132113,0.00042146764,0.00025482208,0.00020379698,0.0000028004113],"category_scores_gemma":[0.000001564049,0.00026506532,0.000084399595,0.00037272516,0.000116705734,0.00023191757,0.000013418989,0.0008714624,0.0000016410036],"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.000065031505,0.000026571224,0.000002358301,0.00003381133,0.00011907546,6.007947e-7,0.00032021748,0.028724376,0.00057925255,0.000009089198,0.00004931061,0.9700703],"study_design_scores_gemma":[0.00048586656,0.00014331269,0.000003523485,0.00030581738,0.00008873629,0.000014028967,0.000061007006,0.9867238,0.0002913562,0.00010935468,0.011518924,0.0002542801],"about_ca_topic_score_codex":0.00016889912,"about_ca_topic_score_gemma":0.0005785429,"teacher_disagreement_score":0.9830553,"about_ca_system_score_codex":0.00008065152,"about_ca_system_score_gemma":0.000020119905,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W4401109326","doi":"10.1007/s11277-024-11461-0","title":"The Impact of Diverse Jamming Schemes against LTE-Based Remote Detonation Devices","year":2024,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Jamming; Computer science; Waveform; Detonation; Transmitter; Synchronization (alternating current); Electronic engineering; Real-time computing; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.031927857537321976,"score_gpt":0.3193104391427576,"score_spread":0.2873825816054356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401109326","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.95008934,0.021510705,0.013943576,0.0022744185,0.00014442623,0.00059445505,0.0001675613,0.002245055,0.009030469],"genre_scores_gemma":[0.99094635,0.003630091,0.0051221796,0.00002383109,0.000025672289,0.00004507525,0.00012898259,0.00005052865,0.000027268265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880695,0.00015922052,0.0003902505,0.00014959312,0.00026666574,0.00022733629],"domain_scores_gemma":[0.9971107,0.0009953525,0.00008070482,0.0015419356,0.00020581987,0.000065454726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045724772,0.0002044829,0.0001912051,0.00020237938,0.00048988435,0.00016873798,0.0015494557,0.000108255874,0.000015835689],"category_scores_gemma":[0.000053098618,0.00016979048,0.0002420913,0.00060022646,0.0003479553,0.00028703417,0.0002569099,0.00052034494,0.0000228372],"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.000042273135,0.00023215853,0.0021370922,0.0005597355,0.00095929875,0.0000047456824,0.009753165,0.0067750206,0.05345171,0.03632783,0.0041043735,0.8856526],"study_design_scores_gemma":[0.000114783266,0.000025997211,0.0012999148,0.00034151808,0.000027258438,0.0000024379235,0.0006384575,0.9781168,0.0035874115,0.00026500583,0.0153585505,0.00022183439],"about_ca_topic_score_codex":0.00021986637,"about_ca_topic_score_gemma":0.00030802732,"teacher_disagreement_score":0.9713418,"about_ca_system_score_codex":0.0002837058,"about_ca_system_score_gemma":0.00014784402,"threshold_uncertainty_score":0.69238544},"labels":[],"label_agreement":null},{"id":"W4401211760","doi":"10.1109/tifs.2024.3436885","title":"Integrated Communications and Security: RIS-Assisted Simultaneous Transmission and Generation of Secret Keys","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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; Engineering and Physical Sciences Research Council; European Commission; Queen's University; Southeast University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Transmission (telecommunications); Computer security; Computer network; Telecommunications","score_opus":0.018774333083553595,"score_gpt":0.2432424407792955,"score_spread":0.2244681076957419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211760","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.23930235,0.002333639,0.7546521,0.0005107343,0.00020747625,0.0005730083,0.0004627907,0.0008556615,0.0011022594],"genre_scores_gemma":[0.98553824,0.009891399,0.004296223,0.00005039277,0.000008763302,0.000036578345,0.00015412581,0.000019276184,0.000005024738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900615,0.00006432543,0.0005020172,0.00012618129,0.00016914622,0.00013215162],"domain_scores_gemma":[0.9990685,0.00021541525,0.000056715442,0.00040592902,0.00015154344,0.00010191445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021947856,0.00020283028,0.00022403203,0.00029625217,0.00022015594,0.0001727095,0.00013250626,0.00020034285,0.000013869986],"category_scores_gemma":[0.000006657572,0.0002023245,0.00004996399,0.00030479167,0.00021343738,0.0008087138,0.0000071430572,0.00047529422,0.0000023081298],"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.000052318752,0.0000982468,0.000013809181,0.001331992,0.000218521,0.0000021390442,0.032666635,0.0025156895,0.005089753,0.017043872,0.0007089714,0.940258],"study_design_scores_gemma":[0.0002587401,0.00009027972,0.0000145593,0.0001779782,0.000054488417,0.000032965258,0.00046598972,0.96372026,0.011127547,0.002477068,0.021361668,0.0002184282],"about_ca_topic_score_codex":0.00007268077,"about_ca_topic_score_gemma":0.00011848926,"teacher_disagreement_score":0.9612046,"about_ca_system_score_codex":0.00005297295,"about_ca_system_score_gemma":0.000027641012,"threshold_uncertainty_score":0.8250554},"labels":[],"label_agreement":null},{"id":"W4401326099","doi":"10.1109/tccn.2024.3438379","title":"Generative AI for Secure Physical Layer Communications: A Survey","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":63,"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; Physical layer; Computer network; Layer (electronics); Telecommunications; Wireless","score_opus":0.08242531335143641,"score_gpt":0.3473854756081475,"score_spread":0.26496016225671104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401326099","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.0032178352,0.016876336,0.97413933,0.001202073,0.00028459352,0.00091951183,0.0005892002,0.0012057022,0.0015654302],"genre_scores_gemma":[0.9600771,0.032152385,0.005753534,0.0003107296,0.00008654472,0.0012839544,0.00020041411,0.0000875769,0.00004777172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986531,0.00035587425,0.0003289974,0.00027331707,0.0001253652,0.00026331283],"domain_scores_gemma":[0.9948247,0.0032997024,0.00003737091,0.001477411,0.00027361553,0.000087202534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044622217,0.00027479188,0.0002758057,0.00022819848,0.0007448648,0.00025181702,0.0007781258,0.00013569744,0.000008514402],"category_scores_gemma":[0.000008884428,0.00029722994,0.00013624478,0.00058567646,0.00034873342,0.00029683014,0.000029395647,0.0008719217,0.00001642731],"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.00007424707,0.0005957415,0.00005127025,0.0002527949,0.0009222637,0.0000013621973,0.006279788,0.0012258401,0.002160812,0.009195071,0.0027316208,0.9765092],"study_design_scores_gemma":[0.0003149865,0.00010382092,0.000045511522,0.0007197982,0.00013569347,0.000008646195,0.00022575415,0.9500621,0.003482101,0.0023605956,0.042099956,0.0004410149],"about_ca_topic_score_codex":0.000030909392,"about_ca_topic_score_gemma":0.00055745454,"teacher_disagreement_score":0.9760682,"about_ca_system_score_codex":0.000086150474,"about_ca_system_score_gemma":0.00004306966,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W4401806895","doi":"10.1109/lwc.2024.3448614","title":"Covert Communications for Text Semantic With Finite Blocklength","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","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":"Dalhousie University","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Covert; Theoretical computer science; Computer network","score_opus":0.023875735656729406,"score_gpt":0.26744422764846404,"score_spread":0.24356849199173464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401806895","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.098393805,0.017187746,0.7883993,0.06693052,0.0007866342,0.004014823,0.00065524573,0.013811934,0.009820039],"genre_scores_gemma":[0.9440743,0.006057591,0.046882626,0.0007100979,0.000060197013,0.0016101495,0.00032464764,0.00019674626,0.00008365019],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815845,0.00018478562,0.0006026637,0.00033467726,0.00026432596,0.00045507058],"domain_scores_gemma":[0.98970574,0.0024877316,0.0000796994,0.007445886,0.00016000874,0.000120944394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003944424,0.0003986942,0.0003891774,0.0004222605,0.00053955865,0.0003361674,0.004197106,0.00015839057,0.000013967416],"category_scores_gemma":[0.000033856417,0.00040992192,0.00017667115,0.00086008833,0.0006415819,0.00048682242,0.00038422362,0.0008382981,0.00010883604],"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.00012205035,0.0013196736,0.0008345413,0.0034156416,0.0033584924,0.000027498992,0.016268177,0.03253348,0.2622163,0.23725119,0.23576197,0.20689099],"study_design_scores_gemma":[0.0004010455,0.00004916072,0.0000653228,0.0006993924,0.00013936164,0.000030875348,0.00017442714,0.6627642,0.006930368,0.00039640837,0.32760355,0.00074590876],"about_ca_topic_score_codex":0.000055231598,"about_ca_topic_score_gemma":0.00028056174,"teacher_disagreement_score":0.8456805,"about_ca_system_score_codex":0.00023703097,"about_ca_system_score_gemma":0.0000746365,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W4402156735","doi":"10.1109/icc51166.2024.10622458","title":"Federated Learning-based MARL for Strengthening Physical-Layer Security in B5G Networks","year":2024,"lang":"en","type":"article","venue":"","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":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Computer science; Layer (electronics); Physical layer; Telecommunications; Materials science; Nanotechnology; Wireless","score_opus":0.013546910258778539,"score_gpt":0.26819213619133725,"score_spread":0.2546452259325587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402156735","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.3250536,0.0012035299,0.6556985,0.0004395784,0.00019715009,0.00069403404,0.000009787752,0.0076978914,0.009005924],"genre_scores_gemma":[0.99806094,0.00004445681,0.0014111288,0.00003718328,0.00007482758,0.00017778177,0.000052967658,0.00006351397,0.00007719979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921554,0.000051073384,0.00021249005,0.00018145873,0.00008991192,0.00024951602],"domain_scores_gemma":[0.99932295,0.00039569318,0.0000140446955,0.00018733575,0.000037077676,0.00004288768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020956968,0.00016286879,0.00018408468,0.00013030805,0.00005910583,0.00015910108,0.0001625915,0.000109298744,0.00004686342],"category_scores_gemma":[0.000030672672,0.00016672563,0.00007868476,0.00033578754,0.000020399126,0.00013563003,0.00003802548,0.0005344002,0.000011345524],"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.00003052299,0.00015775453,0.00045053085,0.00050639495,0.00009810864,0.000010976513,0.0021056316,0.9227592,0.003460575,0.008859001,0.01068241,0.050878897],"study_design_scores_gemma":[0.00015408403,0.000025410542,0.00004228768,0.000111083755,0.0000048133816,4.3286448e-7,0.00006224082,0.97643036,0.00854251,0.00063571683,0.013798371,0.00019270249],"about_ca_topic_score_codex":0.00002994847,"about_ca_topic_score_gemma":0.00011720124,"teacher_disagreement_score":0.6730073,"about_ca_system_score_codex":0.0000897945,"about_ca_system_score_gemma":0.000018090015,"threshold_uncertainty_score":0.6798874},"labels":[],"label_agreement":null},{"id":"W4402474941","doi":"10.1109/ccece59415.2024.10667215","title":"Impact of Hardware Impairments on Physical Layer Security of Cell-Free Massive MIMO","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Physical layer; MIMO; Computer science; Layer (electronics); Computer hardware; Hardware security module; Embedded system; Computer network; Computer security; Telecommunications; Cryptography; Wireless; Materials science; Channel (broadcasting); Nanotechnology","score_opus":0.012187139695525404,"score_gpt":0.2868142290280378,"score_spread":0.2746270893325124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474941","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.9769498,0.00016703598,0.0006909048,0.00004950771,0.000048058264,0.00017776896,0.00013998892,0.0006307632,0.021146182],"genre_scores_gemma":[0.999024,0.00006846564,0.00076897454,0.000005346998,0.000024453866,0.000016942313,0.000012750447,0.000033041215,0.000046041896],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929786,0.000029836627,0.00021127949,0.00012049897,0.0001983252,0.00014218716],"domain_scores_gemma":[0.9989988,0.00010354003,0.000029495422,0.00076123705,0.000057106277,0.000049827504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006915397,0.00014741207,0.0002312589,0.00012357815,0.000011162803,0.000015444428,0.00041341016,0.00007068689,0.00014190558],"category_scores_gemma":[0.000013775519,0.00012373306,0.000211974,0.00020403323,0.000038439128,0.00011289416,0.00012953447,0.00022089388,0.000024038694],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011347232,0.0026164197,0.003334483,0.0036061578,0.0012626346,0.00004895914,0.019734379,0.008806835,0.71535873,0.037401903,0.20107679,0.006639199],"study_design_scores_gemma":[0.00033880316,0.00042164006,0.0032915787,0.00027040506,0.000032544216,0.000002084146,0.00012161146,0.08659485,0.90249926,0.0055147405,0.00062905863,0.00028343903],"about_ca_topic_score_codex":0.00007699001,"about_ca_topic_score_gemma":0.000005289967,"teacher_disagreement_score":0.20044774,"about_ca_system_score_codex":0.000094800685,"about_ca_system_score_gemma":0.000027988443,"threshold_uncertainty_score":0.50456876},"labels":[],"label_agreement":null},{"id":"W4402626708","doi":"10.1109/twc.2024.3459628","title":"Secure Transmission in Cell-Free Massive MIMO Under Active Eavesdropping","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"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":"Engineering and Physical Sciences Research Council; European Commission; Queen's University; Queen's University Belfast; Department for the Economy; Government of the United Kingdom","keywords":"Eavesdropping; Computer science; MIMO; Transmission (telecommunications); Computer network; Wireless; Computer security; Telecommunications; Channel (broadcasting)","score_opus":0.02065979265706951,"score_gpt":0.2666127867306031,"score_spread":0.2459529940735336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402626708","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.020005753,0.0034385098,0.9572602,0.004390378,0.00038024454,0.0008085586,0.00019876659,0.0030855425,0.010432041],"genre_scores_gemma":[0.98188686,0.009047556,0.00807005,0.000092682385,0.000017976272,0.00053903216,0.000039758637,0.0001358045,0.0001702821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981213,0.00024995217,0.00057933823,0.0003608295,0.0002956759,0.00039289487],"domain_scores_gemma":[0.9959209,0.00064369425,0.000045395147,0.0031676956,0.00008061659,0.00014169831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020665668,0.00037856676,0.00033577668,0.0007774885,0.0003400927,0.00014392672,0.0020017535,0.0003175053,0.00011424686],"category_scores_gemma":[0.0000028474735,0.00042777517,0.00020923669,0.0012303946,0.00020650067,0.00054889894,0.000021208889,0.0017912487,0.00008967363],"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.00010441169,0.002203796,0.0000101567575,0.0011846104,0.00063509,0.00004101104,0.02327439,0.32935566,0.1515628,0.033336867,0.0042805662,0.45401064],"study_design_scores_gemma":[0.0010091983,0.0000934498,0.00012401638,0.0017904305,0.00013321021,0.000021927846,0.0018491801,0.7227611,0.24248022,0.0054788846,0.023043005,0.0012154076],"about_ca_topic_score_codex":0.00010112222,"about_ca_topic_score_gemma":0.0004647411,"teacher_disagreement_score":0.9618811,"about_ca_system_score_codex":0.00051775674,"about_ca_system_score_gemma":0.0001007561,"threshold_uncertainty_score":0.99981743},"labels":[],"label_agreement":null},{"id":"W4403752250","doi":"10.1002/9781394170944.ch11","title":"Physical‐Layer Authentication for 6G Systems","year":2024,"lang":"en","type":"other","venue":"","topic":"Wireless Communication Security Techniques","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":"Western University","funders":"","keywords":"Layer (electronics); Computer science; Authentication (law); Computer security; Materials science; Nanotechnology","score_opus":0.020915925412664155,"score_gpt":0.28615107338322054,"score_spread":0.26523514797055636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403752250","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050175872,0.003457561,0.05485471,0.000061200364,0.00044805906,0.0007587622,0.00007335469,0.00757017,0.93277115],"genre_scores_gemma":[0.042231493,0.00027423818,0.0036197589,0.0000117714735,0.0004719809,0.00091742724,0.0000958721,0.0012127408,0.9511647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995248,0.000009245695,0.00012660636,0.00014104598,0.00008810217,0.00011025524],"domain_scores_gemma":[0.99927765,0.000027297503,0.000027387132,0.00062257436,0.000018757171,0.000026354146],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000050292638,0.00016187197,0.00019839077,0.0001557722,0.000007797501,0.00006048814,0.00025759917,0.00017164527,0.0001244545],"category_scores_gemma":[0.000004774301,0.00015289852,0.0000762371,0.00007819313,0.000015595715,0.000021656744,0.00003414766,0.0001286655,0.00083984016],"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":[1.7246563e-7,0.000009379979,7.567692e-8,0.0007730064,0.000061051054,8.758881e-8,0.000094486066,0.000009861686,0.00044478284,0.058798622,0.93929935,0.0005091543],"study_design_scores_gemma":[0.000028573206,0.000004924388,1.5825204e-7,0.00026496666,0.000033701584,4.6941497e-7,0.000016155383,0.04684024,0.0008756359,0.0011752115,0.9505846,0.00017537041],"about_ca_topic_score_codex":0.000034442284,"about_ca_topic_score_gemma":0.000012578012,"teacher_disagreement_score":0.057623412,"about_ca_system_score_codex":0.000043406882,"about_ca_system_score_gemma":0.0000052316577,"threshold_uncertainty_score":0.99993813},"labels":[],"label_agreement":null},{"id":"W4404171063","doi":"10.1016/j.dcan.2024.10.019","title":"Joint jammer selection and power optimization in covert communications against a warden with uncertain locations","year":2024,"lang":"en","type":"article","venue":"Digital Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Jiangsu Provincial Key Research and Development Program; Canadian Anesthesiologists' Society","keywords":"Computer science; Joint (building); Selection (genetic algorithm); Power (physics); Covert; Telecommunications; Computer network; Operations research; Artificial intelligence","score_opus":0.015768489223992054,"score_gpt":0.23558375610054136,"score_spread":0.21981526687654931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404171063","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.040333,0.09626052,0.768446,0.008631723,0.00012453245,0.0021709944,0.00013938615,0.003806289,0.080087505],"genre_scores_gemma":[0.9598871,0.027139224,0.012243529,0.000076223,0.000009402838,0.00021290463,0.0003499111,0.000048652466,0.00003304608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991145,0.00007523469,0.00033996298,0.00018803208,0.00009444069,0.00018784334],"domain_scores_gemma":[0.998174,0.00025887275,0.000037298232,0.0013686055,0.000087685476,0.000073507625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001930112,0.00018622803,0.00018201095,0.00024808754,0.00022957656,0.0004785811,0.0004878823,0.00012089964,0.0000054849],"category_scores_gemma":[0.0000154734,0.00018730578,0.000028444496,0.00067355763,0.00024572693,0.0006962438,0.00037017,0.00051220384,0.0000031118823],"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.000033316373,0.00050014356,0.005440514,0.00024689297,0.00039521008,0.0000046761447,0.005723105,0.68631613,0.00019656729,0.080393195,0.0034690506,0.21728122],"study_design_scores_gemma":[0.00014338801,0.000035920606,0.0004923127,0.00029489183,0.000013998254,0.00001865867,0.00025906446,0.97710407,0.00000995406,0.00031544836,0.021081157,0.00023113484],"about_ca_topic_score_codex":0.000036485006,"about_ca_topic_score_gemma":0.00033186472,"teacher_disagreement_score":0.9195541,"about_ca_system_score_codex":0.000110805246,"about_ca_system_score_gemma":0.000033961634,"threshold_uncertainty_score":0.7638108},"labels":[],"label_agreement":null},{"id":"W4406785297","doi":"10.1109/icc52391.2025.11160896","title":"Joint Task Offloading and User Scheduling in 5G MEC Under Jamming Attacks","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","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 Ottawa","funders":"","keywords":"Jamming; Computer science; Scheduling (production processes); Joint (building); Task (project management); Computer network; Computer security; Engineering; Operations management","score_opus":0.026927490638776565,"score_gpt":0.2749852131881776,"score_spread":0.24805772254940103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406785297","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.5990348,0.005083747,0.32582048,0.0011533607,0.00055764907,0.0011350525,0.000029228262,0.0039059322,0.06327975],"genre_scores_gemma":[0.92774314,0.0016175925,0.07005992,0.00012709366,0.000033106495,0.000106534164,0.000024781753,0.000046844554,0.00024101476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985873,0.00006530262,0.00054764596,0.0003670701,0.00015449876,0.00027816414],"domain_scores_gemma":[0.99877185,0.00012992362,0.00006478214,0.0009145752,0.000055443015,0.000063412444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041224703,0.00032970528,0.00046973772,0.0005063993,0.00005021921,0.00014237523,0.00044771485,0.00047208034,0.000038031776],"category_scores_gemma":[0.000049008813,0.0003841478,0.00007692403,0.0001887437,0.000040086965,0.00012965332,0.0010689193,0.0013825685,0.0000065949193],"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.000017067583,0.00016098843,0.0055855303,0.00578786,0.0006637981,0.00002520512,0.00758041,0.78567004,0.024881532,0.122222826,0.0031266855,0.044278055],"study_design_scores_gemma":[0.00074143807,0.00001714973,0.0056173936,0.006194799,0.00008360217,0.0000098011105,0.001443527,0.9087306,0.05095964,0.015178913,0.008953553,0.0020695392],"about_ca_topic_score_codex":0.00048631258,"about_ca_topic_score_gemma":0.0005095709,"teacher_disagreement_score":0.3287083,"about_ca_system_score_codex":0.00028165668,"about_ca_system_score_gemma":0.000053443713,"threshold_uncertainty_score":0.99986106},"labels":[],"label_agreement":null},{"id":"W4408353286","doi":"10.1109/icassp49660.2025.10887653","title":"Movable Antenna Aided Physical Layer Security with No Eavesdropper CSI","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Physical layer; Computer science; Computer security; Computer network; Telecommunications; Wireless","score_opus":0.006168301400538597,"score_gpt":0.23652130372582958,"score_spread":0.230353002325291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408353286","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.66674304,0.00014962614,0.022312302,0.000267485,0.00008250178,0.00032530722,0.000006568999,0.0031422814,0.30697086],"genre_scores_gemma":[0.9888276,0.000039215334,0.009335558,0.00018281335,0.000029243447,0.00005211267,0.0000074792656,0.000026766671,0.001499255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.000027309872,0.00014505391,0.00015840559,0.00012846981,0.00021321907],"domain_scores_gemma":[0.9990726,0.00006511194,0.000014588391,0.00069864804,0.000103372986,0.000045655026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007352597,0.0001611614,0.00020519878,0.00009029999,0.0000534067,0.000044325316,0.00033682765,0.00007048756,0.00008937395],"category_scores_gemma":[0.000014505638,0.00013552376,0.000050067407,0.00029849098,0.00005450498,0.00013387593,0.0001041954,0.00026584524,0.0001521167],"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.00026081508,0.0016247387,0.01644669,0.0013412352,0.0009388313,0.000030110557,0.006146178,0.0030415952,0.32315487,0.4248503,0.21825929,0.0039053422],"study_design_scores_gemma":[0.0014684865,0.0001285119,0.003694774,0.00037764446,0.00006311464,0.000009274323,0.00039824052,0.6305296,0.2615271,0.011280147,0.0894007,0.001122416],"about_ca_topic_score_codex":0.00005020522,"about_ca_topic_score_gemma":0.00007790533,"teacher_disagreement_score":0.627488,"about_ca_system_score_codex":0.000054955057,"about_ca_system_score_gemma":0.000023766173,"threshold_uncertainty_score":0.55264986},"labels":[],"label_agreement":null},{"id":"W4408928998","doi":"10.1007/978-3-031-82014-4_13","title":"Converse Techniques for Identification via Channels","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Converse; Computer science; Identification (biology); Algorithm; Theoretical computer science; Mathematics; Geometry","score_opus":0.014311821520713896,"score_gpt":0.25669563407910306,"score_spread":0.24238381255838917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408928998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070953265,0.00034457044,0.9941937,0.00022717513,0.0007476067,0.0008042187,0.000016365804,0.00096928666,0.0026900263],"genre_scores_gemma":[0.39436364,0.0005496572,0.6025058,0.00071049365,0.00046952776,0.0003350791,0.00009079425,0.00011193366,0.00086310075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.00001002745,0.00040461065,0.00046804151,0.00025868166,0.00026083287],"domain_scores_gemma":[0.9983346,0.00026493342,0.000103034465,0.0010277336,0.00022404449,0.000045643625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048924075,0.00029185397,0.00031037937,0.0007193129,0.000106248706,0.00015515996,0.0013386356,0.0003274882,0.00001081194],"category_scores_gemma":[0.000044259486,0.00032642743,0.00008700246,0.00024498216,0.0002956163,0.00020912908,0.00026898025,0.00043241223,0.000007688222],"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.0000034971997,0.000011727204,0.000002428101,0.0002477227,0.000015183972,0.000001988779,0.0003500514,0.006895912,0.0024870744,0.012273284,0.0004908626,0.9772203],"study_design_scores_gemma":[0.00008677538,0.000036926405,0.0000042787947,0.0005424374,0.000012347681,0.000005629317,1.2832781e-7,0.6866648,0.13179575,0.15721852,0.023125842,0.0005065531],"about_ca_topic_score_codex":0.000006457314,"about_ca_topic_score_gemma":0.000018396993,"teacher_disagreement_score":0.9767137,"about_ca_system_score_codex":0.00028555124,"about_ca_system_score_gemma":0.000083941486,"threshold_uncertainty_score":0.99991876},"labels":[],"label_agreement":null},{"id":"W4410811445","doi":"10.1007/978-3-031-85008-0_2","title":"Cyber Security Technologies for Privacy in 6G Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Advanced sciences and technologies for security applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer security; Internet privacy; Computer science; Business","score_opus":0.014331099574644755,"score_gpt":0.27475947395298317,"score_spread":0.26042837437833843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410811445","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.00072069257,0.10874304,0.6500551,0.010515427,0.00045713305,0.02541111,0.002077704,0.038528893,0.16349089],"genre_scores_gemma":[0.68783236,0.10884424,0.16982351,0.00011888102,0.0000670811,0.02933156,0.00043770132,0.00020274705,0.0033419384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978448,0.0000060889993,0.00062673603,0.0008095827,0.00017145871,0.00054131943],"domain_scores_gemma":[0.9977051,0.0006155487,0.00021455254,0.001275375,0.00015833596,0.00003106305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035554674,0.0005008048,0.00062830927,0.0007220561,0.00047533898,0.00010978883,0.0018898146,0.001071528,0.0000024823375],"category_scores_gemma":[0.00015656782,0.000530901,0.00015575472,0.0004989875,0.0013128085,0.0002925296,0.0006935233,0.00083785487,0.0000013302987],"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.000005525785,0.00002372666,0.000011151187,0.00025475543,0.000024162764,2.0938245e-7,0.00007086866,0.0003279624,0.000032404852,0.86241925,0.0010864054,0.1357436],"study_design_scores_gemma":[0.00017729653,0.00005140813,0.00000143455,0.00017621237,0.000020101148,0.0000016935392,0.0002810438,0.013761667,0.00077620987,0.57581747,0.4085527,0.00038275102],"about_ca_topic_score_codex":0.000006136649,"about_ca_topic_score_gemma":0.00019790733,"teacher_disagreement_score":0.6871117,"about_ca_system_score_codex":0.00016743457,"about_ca_system_score_gemma":0.000057796413,"threshold_uncertainty_score":0.99971426},"labels":[],"label_agreement":null},{"id":"W4413180438","doi":"10.1109/gcwkshp64532.2024.11100742","title":"Signal Detection in Non-Gaussian Barrage-Jammed Multiple Antenna Systems Via Decision Fusion","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Detection theory; Antenna (radio); Fusion; Gaussian; SIGNAL (programming language); Sensor fusion; Electronic engineering; Telecommunications; Artificial intelligence; Engineering; Physics; Detector","score_opus":0.008483046881632905,"score_gpt":0.23108614842617506,"score_spread":0.22260310154454216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413180438","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.23067498,0.0009656703,0.7642364,0.000035689984,0.00042561488,0.0003709272,0.0000029756295,0.0019205961,0.0013671722],"genre_scores_gemma":[0.99699867,0.00027623135,0.0024515986,0.000009445346,0.000056578803,0.000102527185,0.000009444862,0.000051302057,0.00004421424],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989577,0.000044944536,0.00037464875,0.00020882384,0.00019889885,0.00021502009],"domain_scores_gemma":[0.99927384,0.00019615186,0.00001643539,0.00041437728,0.000031258347,0.0000679108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033173285,0.00016586512,0.00018030609,0.00042586416,0.00004900867,0.00012289602,0.00024657373,0.00017151952,0.00006276007],"category_scores_gemma":[0.000020677473,0.00015593112,0.000056127607,0.0005022793,0.000017099976,0.0002842498,0.00008005814,0.00035167293,0.00011351091],"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.000024712514,0.000042492662,0.0002962739,0.00029494383,0.00002365904,0.00003703366,0.0011100537,0.0052345055,0.7660543,0.00017265552,0.00046488384,0.22624454],"study_design_scores_gemma":[0.00016112956,0.000022352284,0.0012093331,0.00036894216,0.0000034657107,0.000016994707,0.00010384653,0.9588136,0.03609251,0.00014840787,0.0028741586,0.00018523833],"about_ca_topic_score_codex":0.00041108154,"about_ca_topic_score_gemma":0.000822725,"teacher_disagreement_score":0.9535791,"about_ca_system_score_codex":0.00019942319,"about_ca_system_score_gemma":0.0000088662955,"threshold_uncertainty_score":0.63586867},"labels":[],"label_agreement":null},{"id":"W4413755039","doi":"10.1109/tit.2025.3603494","title":"Multivariate Analytic Combinatorics for Cost Constrained Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"H2020 European Research Council; National Science Foundation","keywords":"Multivariate statistics; Mathematics; Combinatorics; Computer science; Discrete mathematics; Statistics","score_opus":0.011770013073238618,"score_gpt":0.2595444928571003,"score_spread":0.2477744797838617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755039","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.00054517126,0.00001705346,0.9875812,0.00012381648,0.0006932393,0.000726891,0.000104879204,0.0009338853,0.009273881],"genre_scores_gemma":[0.9975133,0.00005418606,0.0014276676,0.00024718553,0.000006042958,0.0005028419,0.000029601657,0.000012589919,0.00020659805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.000040809267,0.0003739031,0.00006486668,0.00009350762,0.00015868485],"domain_scores_gemma":[0.99903595,0.0003708324,0.00005096984,0.00035478908,0.00014622374,0.00004122216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035421268,0.00014040458,0.00015530038,0.00043292707,0.00017488257,0.000070232476,0.0002243144,0.000120278935,0.000043459328],"category_scores_gemma":[0.000019013476,0.0001562382,0.00009162978,0.00035981307,0.00005930444,0.0005823715,0.0000012108602,0.00021209985,0.000039139068],"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.0001362271,0.00013453541,0.0000011291673,0.00037540417,0.000282673,1.6539259e-7,0.0023552394,0.23094535,0.00054565066,0.628705,0.002090676,0.13442792],"study_design_scores_gemma":[0.002316968,0.00007906363,0.000020390029,0.00019526042,0.00010093118,0.0000030183328,0.0008747847,0.7517165,0.13476883,0.07346572,0.035963275,0.00049528957],"about_ca_topic_score_codex":0.000003347096,"about_ca_topic_score_gemma":0.0000014478228,"teacher_disagreement_score":0.9969681,"about_ca_system_score_codex":0.00014319611,"about_ca_system_score_gemma":0.00003448562,"threshold_uncertainty_score":0.63712084},"labels":[],"label_agreement":null},{"id":"W4414054218","doi":"10.1109/lwc.2025.3607032","title":"Joint Transmit Probabilities Optimization for AoI-Constrained Covert Communications With Multiple Friendly Jammers","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"National Key Research and Development Program of China; Ontario Ministry of Research and Innovation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Covert; Joint (building); Channel (broadcasting); Jamming; Throughput; Noise (video); Selection (genetic algorithm); Artificial noise; Sampling (signal processing)","score_opus":0.02008483865894526,"score_gpt":0.2458992257003919,"score_spread":0.22581438704144666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414054218","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.02431488,0.0008895278,0.9430155,0.022473551,0.00015548196,0.003211109,0.00025518553,0.0021024304,0.0035823006],"genre_scores_gemma":[0.77677715,0.0012936438,0.21651909,0.0007832045,0.00001438243,0.004045197,0.00044570793,0.000085405074,0.00003624409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978413,0.00027017316,0.0008467186,0.00034995793,0.00022715561,0.00046467464],"domain_scores_gemma":[0.9921592,0.0011046834,0.00016889311,0.006117859,0.00034918048,0.000100187346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042122212,0.00042684932,0.0005078666,0.00046008697,0.0007648309,0.00017169579,0.0032104126,0.00019545334,0.000012457898],"category_scores_gemma":[0.000054434102,0.00046780697,0.00019153005,0.0008152403,0.0011524282,0.0005035439,0.00024394039,0.0006214072,0.0000056671015],"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.00034056153,0.0022718145,0.003165501,0.0025511268,0.0027019177,0.0000028072407,0.011124408,0.51451147,0.13923793,0.17203367,0.04212558,0.10993325],"study_design_scores_gemma":[0.001771411,0.000068096895,0.00013760458,0.00052288733,0.00014893962,0.000006059038,0.0010071172,0.9378953,0.013621286,0.00034790052,0.043686178,0.0007872347],"about_ca_topic_score_codex":0.000091663205,"about_ca_topic_score_gemma":0.0005179769,"teacher_disagreement_score":0.75246227,"about_ca_system_score_codex":0.000402208,"about_ca_system_score_gemma":0.00014036137,"threshold_uncertainty_score":0.9997774},"labels":[],"label_agreement":null},{"id":"W4414229146","doi":"10.1109/twc.2025.3607091","title":"Jamming Detection and Channel Estimation for Spatially Correlated Beamspace Massive MIMO","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","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":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Graduate Research and Innovation Projects of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Jamming; Channel (broadcasting); Telecommunications link; MIMO; Minimum mean square error; Transmission (telecommunications); Random access; Multivariate random variable","score_opus":0.01553188673237768,"score_gpt":0.26219842313470804,"score_spread":0.24666653640233036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229146","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.01487835,0.00040063015,0.98005575,0.0013845538,0.00029402724,0.0009921931,0.000058610727,0.0012609325,0.0006749311],"genre_scores_gemma":[0.98048866,0.001305545,0.016632719,0.00008368258,0.000008203308,0.001285577,0.00003259328,0.00005462661,0.00010840248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884593,0.00011071948,0.00044204053,0.00023821215,0.00012298695,0.00024009148],"domain_scores_gemma":[0.9975188,0.0005605681,0.00009282305,0.0015482984,0.00020692301,0.00007258358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020958994,0.0002568916,0.00026685398,0.0004810726,0.0007812184,0.0001107432,0.00063677394,0.00024636634,0.000004268227],"category_scores_gemma":[0.000019840736,0.00031927062,0.00010204442,0.0005856512,0.00018194482,0.00029500094,0.000013067829,0.00055599463,0.000007996638],"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.00010991028,0.0005166651,0.000009367503,0.00039914795,0.0004482318,4.990526e-7,0.002771669,0.33463457,0.0416996,0.008142128,0.000317011,0.6109512],"study_design_scores_gemma":[0.0005317271,0.000064987835,0.000055466946,0.00025710207,0.000095463605,0.000002994758,0.00022332683,0.91976684,0.07634518,0.0010453446,0.0013328675,0.00027871912],"about_ca_topic_score_codex":0.00009294264,"about_ca_topic_score_gemma":0.00068135746,"teacher_disagreement_score":0.9656103,"about_ca_system_score_codex":0.0002162508,"about_ca_system_score_gemma":0.00004392093,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W4414539293","doi":"10.1109/icc52391.2025.11162114","title":"A Two-Stage CAE-Based Federated Learning Framework for Efficient Jamming Detection in 5G Networks","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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","keywords":"Autoencoder; Federated learning; Jamming; Encoder; Convergence (economics); Deep learning; Unsupervised learning; Data modeling","score_opus":0.010384288602101468,"score_gpt":0.27267485684342563,"score_spread":0.2622905682413242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414539293","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.10169626,0.00016215154,0.8940393,0.00007561204,0.00010334536,0.00038263737,6.076688e-7,0.0012948168,0.002245279],"genre_scores_gemma":[0.97276795,0.000014019244,0.026762987,0.00009392946,0.000016403343,0.00023218906,0.000009766213,0.000027839285,0.00007490305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.00006057647,0.0002595502,0.00015029426,0.00006738729,0.00023158066],"domain_scores_gemma":[0.99921894,0.00043149284,0.00003107869,0.00023837897,0.00005369663,0.00002643191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031737777,0.00012941405,0.00015776324,0.0002320208,0.00014080571,0.00010103126,0.00014826946,0.00016044271,0.000014316022],"category_scores_gemma":[0.000140457,0.00014892596,0.000048580412,0.00054554746,0.00001583851,0.000038991875,0.000027770608,0.00051871204,0.0000018129804],"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.00001582237,0.000020490663,0.00016269511,0.000048619964,0.000009288873,4.645148e-7,0.0000876381,0.9669572,0.0025049783,0.0064909295,0.000020291018,0.023681574],"study_design_scores_gemma":[0.00030701733,0.000015481986,0.000103960854,0.00015790404,0.0000040079053,1.238476e-7,0.00015271745,0.9404634,0.056346633,0.000138023,0.0021777165,0.00013299086],"about_ca_topic_score_codex":0.00013967045,"about_ca_topic_score_gemma":0.0004565231,"teacher_disagreement_score":0.8710717,"about_ca_system_score_codex":0.00019577141,"about_ca_system_score_gemma":0.000018545152,"threshold_uncertainty_score":0.6073025},"labels":[],"label_agreement":null},{"id":"W4415828031","doi":"10.1016/j.comnet.2025.111825","title":"Novel secure user scheduling for uplink wireless networks against potential eavesdroppers","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Ministry of Science ICT and Future Planning; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Telecommunications link; Secrecy; Scheduling (production processes); Base station; Channel state information; User equipment; Wireless; Wireless network","score_opus":0.007955866449695299,"score_gpt":0.2290825939709418,"score_spread":0.2211267275212465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415828031","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.009148202,0.0015041403,0.9846886,0.00026576457,0.0017600857,0.0005980796,0.000005367038,0.0016139768,0.00041580052],"genre_scores_gemma":[0.8543382,0.00044860624,0.14320439,0.0007457065,0.00085081323,0.00012876389,0.00013634408,0.00008905498,0.000058062695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844676,0.000033107197,0.00048331468,0.00036843194,0.00011620832,0.0005521497],"domain_scores_gemma":[0.99867284,0.00016686982,0.00007288705,0.00083619484,0.00014672954,0.00010449448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024349047,0.00035070523,0.00039633276,0.0001674353,0.00022322469,0.00019983397,0.0008673209,0.00043195923,0.000005494187],"category_scores_gemma":[0.000004735141,0.00040525116,0.0002094253,0.00041576006,0.000074952586,0.00017590675,0.00034589207,0.00070660835,0.0000022849606],"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.000012087317,0.000036357353,0.00006854631,0.00005719927,0.00012180193,0.0000016243928,0.00005423057,0.9266219,0.00019381223,0.004243605,0.012008093,0.05658073],"study_design_scores_gemma":[0.00057582674,0.000016901056,0.0001635699,0.00029577396,0.000029908488,0.0000030660808,0.000010997098,0.9854108,0.00016552316,0.00012463755,0.01282819,0.00037479072],"about_ca_topic_score_codex":0.000004250505,"about_ca_topic_score_gemma":0.000009828311,"teacher_disagreement_score":0.84519005,"about_ca_system_score_codex":0.0001138237,"about_ca_system_score_gemma":0.000026331503,"threshold_uncertainty_score":0.99983996},"labels":[],"label_agreement":null},{"id":"W4415971194","doi":"10.1109/tdsc.2025.3629675","title":"Incentive Mechanism Design for Collaborative Physical Layer Authentication: A Centralized Governance Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Stackelberg competition; Incentive; Authentication (law); Physical layer; Mechanism design; Wireless; Key (lock); Reliability (semiconductor); Layer (electronics)","score_opus":0.02454033996746111,"score_gpt":0.2740580008034,"score_spread":0.24951766083593888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415971194","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.007746469,0.0012046075,0.9861889,0.00041580907,0.00057032926,0.0024502873,0.00022082312,0.00045574072,0.0007470616],"genre_scores_gemma":[0.9157128,0.0009692316,0.082575254,0.000094532086,0.00006309065,0.00027270577,0.000013663454,0.000067243105,0.00023147762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733263,0.00034194285,0.00064350455,0.00075205596,0.00030748695,0.0006223695],"domain_scores_gemma":[0.99764055,0.000920692,0.000229054,0.0006663029,0.00040188944,0.00014151275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046493777,0.00056448777,0.00072079373,0.00020155674,0.00097598234,0.00029790078,0.00052217505,0.00033748258,0.000018356764],"category_scores_gemma":[0.000020569312,0.00065085466,0.00022147776,0.0010144016,0.0001393564,0.00034746778,0.000016355385,0.00081519334,0.0000058933906],"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.0012338094,0.0037639167,0.00000569228,0.002687773,0.0028107238,0.000009820974,0.04307011,0.4244416,0.022505127,0.41112372,0.0016583463,0.08668934],"study_design_scores_gemma":[0.0015216625,0.00014360853,0.000008579697,0.0005268949,0.00028063476,0.000004279783,0.00094729866,0.83885735,0.1508423,0.005125138,0.0012383838,0.00050388166],"about_ca_topic_score_codex":0.000027957973,"about_ca_topic_score_gemma":0.000010913648,"teacher_disagreement_score":0.9079663,"about_ca_system_score_codex":0.0003361275,"about_ca_system_score_gemma":0.0002102046,"threshold_uncertainty_score":0.9995943},"labels":[],"label_agreement":null},{"id":"W4416219098","doi":"10.1016/j.automatica.2025.112685","title":"Integrity attacks on multi-level secured channels: A structured fusion approach","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fusion; Sensor fusion; Key (lock); Cryptography; Data integrity","score_opus":0.04598907361626403,"score_gpt":0.2997079245115547,"score_spread":0.25371885089529067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416219098","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.3233983,0.00071362604,0.60033256,0.0013691742,0.0009878667,0.0021011354,0.00008507959,0.0128230015,0.058189243],"genre_scores_gemma":[0.90619105,0.00004248001,0.09325226,0.00015176687,0.00001954948,0.00012363495,0.000042210122,0.000030057954,0.0001469788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00008529795,0.00032640703,0.00020656934,0.0001797478,0.0002334788],"domain_scores_gemma":[0.9988551,0.00011340215,0.00004143329,0.00087314175,0.000060733346,0.000056165147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019857589,0.00022396389,0.00027583208,0.00022098742,0.00009907538,0.00008106458,0.0005541239,0.00023056444,0.00004141],"category_scores_gemma":[0.00011055614,0.00021382305,0.00007450251,0.00036747588,0.000052858464,0.0001188547,0.00014892001,0.000574766,0.000033899425],"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.00012389202,0.0024715376,0.0005953774,0.004833237,0.0012435431,0.000020888541,0.028052684,0.014052163,0.04357061,0.30643937,0.1407523,0.4578444],"study_design_scores_gemma":[0.00050126476,0.000024906321,0.004958371,0.00026321513,0.000020746442,0.000003076627,0.00023276226,0.97093815,0.01612298,0.0029156834,0.0037042813,0.0003145604],"about_ca_topic_score_codex":0.000015230798,"about_ca_topic_score_gemma":0.000013497295,"teacher_disagreement_score":0.956886,"about_ca_system_score_codex":0.0001234559,"about_ca_system_score_gemma":0.00002580295,"threshold_uncertainty_score":0.8719451},"labels":[],"label_agreement":null},{"id":"W4416410083","doi":"10.48550/arxiv.2503.20223","title":"Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","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 Toronto","funders":"","keywords":"Partition (number theory); Beamforming; Artificial noise; Physical layer; Wireless; Channel (broadcasting); Transmission (telecommunications); Secrecy","score_opus":0.06071138248804963,"score_gpt":0.3283635071385713,"score_spread":0.2676521246505217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416410083","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.8249691,0.006491481,0.16123176,0.00024673127,0.00064793444,0.0028995585,0.00030171682,0.0021498478,0.0010618333],"genre_scores_gemma":[0.98681587,0.0024518685,0.007601501,0.000058086123,0.00004956507,0.0017399183,0.00070201827,0.00011513189,0.00046602578],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977804,0.00020447595,0.0009544366,0.0004592873,0.00018700447,0.00041441616],"domain_scores_gemma":[0.99634516,0.0003615439,0.00025033305,0.0027286892,0.00023798394,0.000076303004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006624731,0.0004930249,0.0007507972,0.0004295113,0.00013232272,0.00012141692,0.001844135,0.00078389404,0.0000051990137],"category_scores_gemma":[0.00008020468,0.00060120726,0.00018939373,0.00030362632,0.00006943726,0.00021200156,0.0009952363,0.001527162,0.000013000783],"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.00051592593,0.006286742,0.35339943,0.05206081,0.002951456,0.00003590191,0.03651922,0.31947428,0.032872025,0.108712316,0.041238163,0.045933723],"study_design_scores_gemma":[0.0062501086,0.0001134259,0.0063127982,0.0116439955,0.00020693352,0.000010089093,0.0009998761,0.8761358,0.018597981,0.0010351338,0.07608488,0.0026089626],"about_ca_topic_score_codex":0.00047423464,"about_ca_topic_score_gemma":0.00050950085,"teacher_disagreement_score":0.55666155,"about_ca_system_score_codex":0.00047497303,"about_ca_system_score_gemma":0.00012912508,"threshold_uncertainty_score":0.9996439},"labels":[],"label_agreement":null},{"id":"W4416514043","doi":"10.1109/itw62417.2025.11240394","title":"Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Sherbrooke O.E.M (Canada); Université de Sherbrooke","funders":"","keywords":"Communication complexity; Bounded function; Protocol (science); Communications protocol; Coding (social sciences); Information theory; Data compression; Computational complexity theory","score_opus":0.013485986664880378,"score_gpt":0.3067944042913879,"score_spread":0.2933084176265075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416514043","genre_codex":"other","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.083539225,0.0002898149,0.2940138,0.0007142267,0.00017152404,0.01890385,0.0000134421425,0.0035892494,0.5987649],"genre_scores_gemma":[0.9800222,0.0000142101635,0.017120596,0.000031287964,0.000006358475,0.0024846848,0.0000032363446,0.000015430029,0.00030199465],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935687,0.00004809873,0.0002774464,0.00009684355,0.00011171073,0.00010904912],"domain_scores_gemma":[0.9986262,0.0001761768,0.000042905085,0.0010403168,0.00009251182,0.000021914224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114585244,0.00010096033,0.00017963279,0.00014086743,0.000034260815,0.000029903904,0.00087521307,0.00006739678,0.00010121845],"category_scores_gemma":[0.000093698174,0.00009758076,0.000042715277,0.00020544846,0.000029588648,0.00022583747,0.00054158486,0.00019356572,0.0000043798777],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025946635,0.0011195869,0.014110499,0.005379693,0.00073705945,0.0000053475414,0.0069696824,0.013020989,0.4894313,0.22160003,0.15629512,0.09107124],"study_design_scores_gemma":[0.0008263418,0.000052484185,0.0062653967,0.0023739762,0.0000145839285,0.0000013443381,0.00033293132,0.132062,0.82060397,0.013482678,0.023685215,0.0002990869],"about_ca_topic_score_codex":0.000046190526,"about_ca_topic_score_gemma":0.000022849841,"teacher_disagreement_score":0.896483,"about_ca_system_score_codex":0.00006994739,"about_ca_system_score_gemma":0.000016749707,"threshold_uncertainty_score":0.3979228},"labels":[],"label_agreement":null},{"id":"W4416582895","doi":"10.1109/tnse.2025.3636073","title":"To Trust or Not to Trust: On Calibration in ML-Based Resource Allocation for Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calibration; Resource allocation; Channel (broadcasting); Reliability (semiconductor); Rayleigh fading; Key (lock); Function (biology); Monotonic function; Fading","score_opus":0.013879365993826989,"score_gpt":0.25560358837288655,"score_spread":0.24172422237905955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582895","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.06664368,0.000017749833,0.93123436,0.0006555059,0.00028779812,0.00063101016,0.00000512338,0.00042572382,0.00009906509],"genre_scores_gemma":[0.98951936,0.00003481435,0.009183191,0.0007317178,0.000046992212,0.00041039105,0.0000025460342,0.000027968848,0.00004302243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988407,0.000014732736,0.00027228476,0.00029605994,0.00020081206,0.00037542844],"domain_scores_gemma":[0.9991883,0.00022336692,0.000015868594,0.00039117786,0.00005773739,0.00012357149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005469717,0.00018070842,0.00017957638,0.00058580836,0.00020644374,0.00011217956,0.0003287082,0.00009990055,0.000002872864],"category_scores_gemma":[0.000022061964,0.00019216981,0.00003076364,0.0021316886,0.000036206882,0.00019555612,0.0000039018328,0.00023914444,0.0000012188183],"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.00008213869,0.00001989989,0.0000056652484,0.000031162952,0.0000042517777,2.9325534e-7,0.00013928875,0.97306436,0.0025317962,0.0005003102,0.00037019353,0.023250628],"study_design_scores_gemma":[0.00021167264,0.00009002757,0.00028234438,0.00029677714,0.0000063775624,4.112678e-7,0.000026841924,0.9725337,0.023387585,0.00000863024,0.0029584933,0.00019713408],"about_ca_topic_score_codex":0.000012455617,"about_ca_topic_score_gemma":0.000090199006,"teacher_disagreement_score":0.9228757,"about_ca_system_score_codex":0.00024926141,"about_ca_system_score_gemma":0.00006258697,"threshold_uncertainty_score":0.78364575},"labels":[],"label_agreement":null},{"id":"W4416922352","doi":"10.1109/jsac.2025.3639454","title":"Efficient Covert Communication With Ambient OFDM WiFi Backscatter","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"National Natural Science Foundation of China","keywords":"Backscatter (email); Covert; Transmission (telecommunications); Orthogonal frequency-division multiplexing; Covert channel; Throughput","score_opus":0.012259489735952941,"score_gpt":0.2662666177299913,"score_spread":0.25400712799403835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922352","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.76008594,0.010100268,0.048138667,0.02181877,0.00057599426,0.0022258724,0.000059436003,0.0025623054,0.15443277],"genre_scores_gemma":[0.98306763,0.004106284,0.011855331,0.0005496057,0.000017309787,0.00016258132,0.000042312786,0.000050193637,0.00014874898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978699,0.0005318994,0.00073763856,0.00018154508,0.00032795264,0.00035106175],"domain_scores_gemma":[0.99508667,0.0006475234,0.00017505708,0.0034628743,0.00052276166,0.00010511635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005757499,0.0002842112,0.0003408687,0.00094914105,0.00046685027,0.00017418142,0.0025748848,0.00016122877,0.00002848115],"category_scores_gemma":[0.00007561341,0.00027436428,0.000075258635,0.0023123396,0.00022250848,0.00014198794,0.00019445944,0.001840402,0.000036169607],"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.0007907974,0.009069724,0.02337623,0.00037442852,0.0018623582,0.000035090787,0.010371794,0.51126224,0.041926857,0.15917246,0.15132633,0.09043172],"study_design_scores_gemma":[0.0067391098,0.0005649229,0.09356974,0.007650213,0.0002835852,0.00042333663,0.0010287979,0.56862044,0.043197654,0.0071938913,0.26794645,0.0027818533],"about_ca_topic_score_codex":0.00002683801,"about_ca_topic_score_gemma":0.0002857378,"teacher_disagreement_score":0.22298172,"about_ca_system_score_codex":0.0006986185,"about_ca_system_score_gemma":0.00016368844,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W4417029541","doi":"10.1007/s11276-025-04061-8","title":"Rank optimization technique of physical layer secrecy capacity in MIMO wiretap channel","year":2025,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"MIMO; Physical layer; Covariance; Secure transmission; Covariance matrix; Artificial noise; Channel (broadcasting); Wireless; Optimization problem; Rank (graph theory)","score_opus":0.016402942911476447,"score_gpt":0.2386521781519885,"score_spread":0.22224923524051204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417029541","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.09106843,0.0004125566,0.90252954,0.0000867574,0.0001137979,0.00063887716,0.000007134609,0.0007503835,0.004392494],"genre_scores_gemma":[0.99483824,0.00044961664,0.0042248215,0.000041205556,0.000051436105,0.0003056703,0.000029302448,0.000041816176,0.000017893359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988308,0.00011603529,0.00041944048,0.00021046975,0.00014030216,0.0002829759],"domain_scores_gemma":[0.9990142,0.00014552254,0.00007343429,0.00063286803,0.00009098883,0.000043015956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002740281,0.00022587512,0.00043328974,0.00027144264,0.000042644675,0.000020713349,0.00045801266,0.00028388738,0.000010157835],"category_scores_gemma":[0.000017125993,0.00025644008,0.00009556198,0.0008703052,0.000100966434,0.0001632448,0.000115278024,0.00055033056,0.0000012039953],"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.000016660124,0.000115160816,0.00029567836,0.0001366881,0.000033857785,0.0000012543359,0.0004744946,0.9825982,0.0033447128,0.007440803,0.00034500548,0.005197509],"study_design_scores_gemma":[0.00028256563,0.000015214525,0.00042405227,0.00040086955,0.000011628763,0.000001005147,0.000026062582,0.96615154,0.031227363,0.0011357376,0.00011541544,0.00020857327],"about_ca_topic_score_codex":0.00007579453,"about_ca_topic_score_gemma":0.000071174,"teacher_disagreement_score":0.9037698,"about_ca_system_score_codex":0.00011205484,"about_ca_system_score_gemma":0.000021242697,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"W4417285377","doi":"10.1109/pimrc62392.2025.11275473","title":"Physical Layer Security in Cell-Free Massive MIMO with Hardware Impairments and Pilot Contamination","year":2025,"lang":"","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Lakehead University","funders":"","keywords":"Eavesdropping; Physical layer; MIMO; Artificial noise; Telecommunications link; Software deployment; Jamming; Noise (video)","score_opus":0.008952993777202095,"score_gpt":0.24980830417160238,"score_spread":0.24085531039440028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417285377","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.95430946,0.00073974987,0.007811572,0.0014821747,0.00007872842,0.0012684875,0.000045209395,0.0004560056,0.033808637],"genre_scores_gemma":[0.9966474,0.0004130344,0.002123697,0.00013038654,0.000022694365,0.00017835127,0.000022583401,0.000042135252,0.0004197235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982788,0.00017764645,0.00043379315,0.00043904746,0.00028244476,0.00038828215],"domain_scores_gemma":[0.99828696,0.00023106221,0.00009721089,0.001111432,0.00017431995,0.000099040975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002320814,0.00040008634,0.00048479254,0.00035528748,0.000090207934,0.00013895579,0.00060957915,0.00016505618,0.000056430406],"category_scores_gemma":[0.00004518295,0.00040690493,0.000050269697,0.0005863626,0.00014533418,0.00046114155,0.0005814461,0.0006732139,0.00000913494],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030718166,0.026897432,0.23715101,0.016507572,0.0022652033,0.0004865959,0.1100067,0.0056215683,0.1116231,0.37283993,0.058077358,0.05545171],"study_design_scores_gemma":[0.017670544,0.002622724,0.09775608,0.0033275925,0.000347099,0.000014872792,0.006219095,0.40140992,0.43326452,0.0295427,0.005083672,0.0027411727],"about_ca_topic_score_codex":0.00038074216,"about_ca_topic_score_gemma":0.0008912862,"teacher_disagreement_score":0.39578837,"about_ca_system_score_codex":0.000342781,"about_ca_system_score_gemma":0.00007694981,"threshold_uncertainty_score":0.9998383},"labels":[],"label_agreement":null},{"id":"W66989960","doi":"10.48550/arxiv.0806.1062","title":"Capacity of Block-Memoryless Channels with Causal Channel Side Information","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Transmitter; Channel (broadcasting); Block (permutation group theory); Channel capacity; Computer science; Function (biology); Mathematics; Channel state information; Telecommunications; Algorithm; Topology (electrical circuits); Wireless; Combinatorics","score_opus":0.03967464817307425,"score_gpt":0.23506577451323302,"score_spread":0.19539112634015876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66989960","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.9861656,0.00016062925,0.0077217957,0.000120932404,0.00028478238,0.0005645984,0.00007833972,0.0010810216,0.0038223276],"genre_scores_gemma":[0.9966961,0.0012647124,0.0014650371,0.000055352517,0.00009189458,0.00019120262,0.00015407936,0.00006106522,0.000020543834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850136,0.00005522385,0.0006196978,0.00020440055,0.00032702726,0.00029231107],"domain_scores_gemma":[0.997928,0.000055911165,0.00030156574,0.0013252409,0.0002957273,0.00009355662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018504314,0.00038911458,0.00053910847,0.0002973788,0.00007240055,0.000030848787,0.0007330681,0.00043306328,0.000007982892],"category_scores_gemma":[0.000038275262,0.0004069142,0.00010250806,0.00021066403,0.00015390487,0.00038746343,0.0004509728,0.0009928223,0.000036665268],"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.0002652794,0.00097504025,0.0765396,0.013634303,0.0026731407,0.00007711544,0.09282764,0.77565914,0.011713654,0.001992284,0.015254311,0.008388516],"study_design_scores_gemma":[0.0022752972,0.0003558866,0.123293445,0.00407898,0.0002803629,0.00022789075,0.00085473503,0.10762554,0.74452287,0.001589361,0.010404924,0.0044907294],"about_ca_topic_score_codex":0.0003665189,"about_ca_topic_score_gemma":0.000059816608,"teacher_disagreement_score":0.7328092,"about_ca_system_score_codex":0.00014448079,"about_ca_system_score_gemma":0.00006981715,"threshold_uncertainty_score":0.9998383},"labels":[],"label_agreement":null},{"id":"W6901618406","doi":"10.60692/zvrxw-2d823","title":"Effects of CSI Knowledge on Secrecy of Threshold-Selection Decode-and-Forward Relaying","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Secrecy; Relay; Node (physics); Bottleneck; Channel state information; Channel (broadcasting); Information-theoretic security; Wireless","score_opus":0.021056476213720605,"score_gpt":0.2303555490138784,"score_spread":0.20929907280015778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901618406","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.96135896,0.000025010195,0.024867244,0.000005512897,0.00015279195,0.00035839446,0.000010631446,0.00037064232,0.012850799],"genre_scores_gemma":[0.99940073,0.0000044545377,0.000489066,0.000004305488,0.000016622696,0.000055055065,0.0000033158826,0.000014096597,0.000012351999],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915224,0.000029902812,0.0004918103,0.000067323315,0.00014210757,0.00011663215],"domain_scores_gemma":[0.9989375,0.000023176162,0.00032408326,0.0005328202,0.00014159452,0.000040820498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027334623,0.00013264439,0.00025541842,0.00025002993,0.00013373482,0.00006915173,0.00027826603,0.00012542808,0.000001766081],"category_scores_gemma":[0.000038540926,0.00012564514,0.00005413111,0.000073498566,0.000038188176,0.0006056617,0.00007924649,0.000122041514,0.000030947616],"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.0003386834,0.00004815856,0.425572,0.04326997,0.00080121256,0.0000026280918,0.43131232,0.005309943,0.003733277,0.05632357,0.0006804099,0.03260782],"study_design_scores_gemma":[0.002413062,0.0002472022,0.22258149,0.00401989,0.000107899126,0.000026971315,0.0025274826,0.17515425,0.59167886,0.00005751455,0.00048192148,0.00070345675],"about_ca_topic_score_codex":0.0000059235717,"about_ca_topic_score_gemma":5.592421e-7,"teacher_disagreement_score":0.5879456,"about_ca_system_score_codex":0.00007000631,"about_ca_system_score_gemma":0.000009954093,"threshold_uncertainty_score":0.512366},"labels":[],"label_agreement":null},{"id":"W6920242196","doi":"10.60692/v2pff-y3p32","title":"Secrecy Performance of Small-Cell Networks with Transmitter Selection and Unreliable Backhaul under Spectrum Sharing Environment","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; Cognitive radio; Backhaul (telecommunications); Artificial noise; Transmitter power output; Selection (genetic algorithm)","score_opus":0.01306069200095012,"score_gpt":0.15847893468821647,"score_spread":0.14541824268726636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920242196","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.6674376,0.000025516485,0.33072212,0.000012108065,0.000029752402,0.00014292035,0.0000040040504,0.00020940398,0.0014165401],"genre_scores_gemma":[0.996833,0.000017704868,0.0029886088,0.000026528756,0.000015923115,0.000039615097,0.00001816633,0.000018944824,0.000041506697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000020697911,0.00038206094,0.0001031442,0.00013401137,0.00016915072],"domain_scores_gemma":[0.9994989,0.0000059962304,0.000094966366,0.00032056434,0.000033912063,0.00004567035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013904297,0.00014799855,0.00018019976,0.000104432314,0.00006531067,0.00007356113,0.00011273456,0.00009528785,0.000022221873],"category_scores_gemma":[4.510254e-7,0.00013927398,0.000025881507,0.00016222592,0.000017071594,0.00042223273,0.000042292922,0.00015177102,0.000019228877],"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.00006265511,0.000009378167,0.21333449,0.0026105342,0.0001428462,0.0000016240556,0.026053647,0.75622356,0.00011833647,0.00052871584,0.000027167102,0.0008870327],"study_design_scores_gemma":[0.00078956614,0.00006981567,0.023315674,0.0004201116,0.000039893424,0.00007428144,0.002378599,0.9244092,0.047908716,0.0000029025812,0.00026703547,0.00032421216],"about_ca_topic_score_codex":0.000004427387,"about_ca_topic_score_gemma":9.9145e-7,"teacher_disagreement_score":0.32939538,"about_ca_system_score_codex":0.00009703307,"about_ca_system_score_gemma":0.000010331882,"threshold_uncertainty_score":0.5679428},"labels":[],"label_agreement":null},{"id":"W6920287107","doi":"10.60692/tg7nc-fkb53","title":"Effects of CSI Knowledge on Secrecy of Threshold-Selection Decode-and-Forward Relaying","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Secrecy; Relay; Node (physics); Bottleneck; Channel state information; Channel (broadcasting); Information-theoretic security; Wireless","score_opus":0.021056476213720605,"score_gpt":0.2303555490138784,"score_spread":0.20929907280015778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920287107","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.96135896,0.000025010195,0.024867244,0.000005512897,0.00015279195,0.00035839446,0.000010631446,0.00037064232,0.012850799],"genre_scores_gemma":[0.99940073,0.0000044545377,0.000489066,0.000004305488,0.000016622696,0.000055055065,0.0000033158826,0.000014096597,0.000012351999],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915224,0.000029902812,0.0004918103,0.000067323315,0.00014210757,0.00011663215],"domain_scores_gemma":[0.9989375,0.000023176162,0.00032408326,0.0005328202,0.00014159452,0.000040820498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027334623,0.00013264439,0.00025541842,0.00025002993,0.00013373482,0.00006915173,0.00027826603,0.00012542808,0.000001766081],"category_scores_gemma":[0.000038540926,0.00012564514,0.00005413111,0.000073498566,0.000038188176,0.0006056617,0.00007924649,0.000122041514,0.000030947616],"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.0003386834,0.00004815856,0.425572,0.04326997,0.00080121256,0.0000026280918,0.43131232,0.005309943,0.003733277,0.05632357,0.0006804099,0.03260782],"study_design_scores_gemma":[0.002413062,0.0002472022,0.22258149,0.00401989,0.000107899126,0.000026971315,0.0025274826,0.17515425,0.59167886,0.00005751455,0.00048192148,0.00070345675],"about_ca_topic_score_codex":0.0000059235717,"about_ca_topic_score_gemma":5.592421e-7,"teacher_disagreement_score":0.5879456,"about_ca_system_score_codex":0.00007000631,"about_ca_system_score_gemma":0.000009954093,"threshold_uncertainty_score":0.512366},"labels":[],"label_agreement":null},{"id":"W6920555768","doi":"10.60692/cxk8n-gnq64","title":"Secrecy Performance of Small-Cell Networks with Transmitter Selection and Unreliable Backhaul under Spectrum Sharing Environment","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; Cognitive radio; Backhaul (telecommunications); Artificial noise; Transmitter power output; Selection (genetic algorithm)","score_opus":0.01306069200095012,"score_gpt":0.15847893468821647,"score_spread":0.14541824268726636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920555768","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.6674376,0.000025516485,0.33072212,0.000012108065,0.000029752402,0.00014292035,0.0000040040504,0.00020940398,0.0014165401],"genre_scores_gemma":[0.996833,0.000017704868,0.0029886088,0.000026528756,0.000015923115,0.000039615097,0.00001816633,0.000018944824,0.000041506697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000020697911,0.00038206094,0.0001031442,0.00013401137,0.00016915072],"domain_scores_gemma":[0.9994989,0.0000059962304,0.000094966366,0.00032056434,0.000033912063,0.00004567035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013904297,0.00014799855,0.00018019976,0.000104432314,0.00006531067,0.00007356113,0.00011273456,0.00009528785,0.000022221873],"category_scores_gemma":[4.510254e-7,0.00013927398,0.000025881507,0.00016222592,0.000017071594,0.00042223273,0.000042292922,0.00015177102,0.000019228877],"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.00006265511,0.000009378167,0.21333449,0.0026105342,0.0001428462,0.0000016240556,0.026053647,0.75622356,0.00011833647,0.00052871584,0.000027167102,0.0008870327],"study_design_scores_gemma":[0.00078956614,0.00006981567,0.023315674,0.0004201116,0.000039893424,0.00007428144,0.002378599,0.9244092,0.047908716,0.0000029025812,0.00026703547,0.00032421216],"about_ca_topic_score_codex":0.000004427387,"about_ca_topic_score_gemma":9.9145e-7,"teacher_disagreement_score":0.32939538,"about_ca_system_score_codex":0.00009703307,"about_ca_system_score_gemma":0.000010331882,"threshold_uncertainty_score":0.5679428},"labels":[],"label_agreement":null},{"id":"W6977013692","doi":"10.60825/q0kn-jz16","title":"Mise à jour des intrants et des méthodes de calcul de l’ogive de maturité de la morue franche du nord du golfe du Saint Laurent (3Pn, 4RS) sur la période 1983-2023","year":2025,"lang":"fr","type":"report","venue":"Fisheries and Oceans Canada / Pêches et Océans Canada - Publications","topic":"Wireless Communication Security Techniques","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":true,"ca_institutions":"Fisheries and Oceans Canada","funders":"","keywords":"Western europe; Limiting","score_opus":0.02487012504691439,"score_gpt":0.25651814726891586,"score_spread":0.23164802222200148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977013692","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.78958255,0.01972547,0.05406389,0.08991355,0.0008075445,0.0019395615,0.012826826,0.001315083,0.029825507],"genre_scores_gemma":[0.8377797,0.09538114,0.050683744,0.0037063004,0.00043803055,0.001102899,0.0025663176,0.00045463955,0.007887201],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934088,0.0017178925,0.001374006,0.0008702755,0.0009137499,0.0017152731],"domain_scores_gemma":[0.9920188,0.0035046248,0.00049749005,0.0015105786,0.0012408581,0.0012276251],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029586465,0.001155008,0.0012005344,0.0004190735,0.001409758,0.0010976135,0.0017553006,0.0010662185,0.00026157804],"category_scores_gemma":[0.0037368196,0.0013847688,0.00027880515,0.0010881245,0.0011251929,0.00070659624,0.00047591567,0.0023286035,4.788337e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.000032830543,0.00024054402,0.2571026,0.0023314308,0.00078641984,0.00032471743,0.007555121,0.0038875148,0.00015634431,0.018815383,0.7015121,0.0072550103],"study_design_scores_gemma":[0.0003991931,0.000026887832,0.16264926,0.00080316386,0.0002905487,0.0007121728,0.0025108275,0.00593307,0.0003159681,0.001036818,0.82421064,0.0011114232],"about_ca_topic_score_codex":0.99233437,"about_ca_topic_score_gemma":0.99934417,"teacher_disagreement_score":0.1226986,"about_ca_system_score_codex":0.011458438,"about_ca_system_score_gemma":0.040641163,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W6977128854","doi":"10.60692/7ymy8-sqh83","title":"Managing Neonatal and Early Childhood Syndromic Sepsis in Sub-District Hospitals in Resource Poor Settings: Improvement in Quality of Care through Introduction of a Package of Interventions in Rural Bangladesh","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Wireless Communication Security Techniques","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 British Columbia","funders":"","keywords":"Triage; Psychological intervention; Sepsis; Public health; Emergency department; Resuscitation; Quality management; Intervention (counseling)","score_opus":0.013816635169352621,"score_gpt":0.23655613608833997,"score_spread":0.22273950091898737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977128854","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.99825317,0.000078867095,0.00072164246,0.000062670995,0.000030629224,0.0005646988,0.00011631947,0.000046124216,0.00012585832],"genre_scores_gemma":[0.99960464,0.000006291292,0.00026132405,0.0000028078962,0.000005639631,0.00006815644,0.00004112467,0.000009499771,5.345951e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99812746,0.000086938875,0.001387421,0.00009676388,0.0001601293,0.00014127156],"domain_scores_gemma":[0.9987628,0.000011058852,0.00061126985,0.0005358354,0.00006259955,0.000016436526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006121995,0.00012986522,0.0004084426,0.0005483523,0.00002451521,0.0000417018,0.00026978052,0.0000931463,0.0000012239541],"category_scores_gemma":[0.00004982489,0.00014325764,0.00006709856,0.00022144597,0.00004722751,0.00090459513,0.00014697973,0.0001683156,8.492164e-7],"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.000049232367,0.000017872699,0.6798738,0.007424267,0.000035754896,0.0000014326881,0.30444387,0.00092540774,0.00019081339,0.00018991782,0.000012474669,0.006835144],"study_design_scores_gemma":[0.0011229406,0.00005116215,0.9373467,0.0022783827,0.0000058838436,0.0000024360538,0.048914447,0.0009538491,0.009178156,0.00000796892,0.0000038936987,0.00013417841],"about_ca_topic_score_codex":0.0005089861,"about_ca_topic_score_gemma":0.00006484442,"teacher_disagreement_score":0.25747287,"about_ca_system_score_codex":0.00022093717,"about_ca_system_score_gemma":0.000009080679,"threshold_uncertainty_score":0.5841877},"labels":[],"label_agreement":null},{"id":"W6986585972","doi":"","title":"Pre-Privacy Amplification: A Post-Processing Technique for Quantum Key Distribution with Application to the Simplified Trusted Relay","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"Strong","keywords":"Quantum key distribution; Relay; Key (lock); Construct (python library); Power (physics); Quantum computer; Quantum","score_opus":0.011044911552668048,"score_gpt":0.22866266235705585,"score_spread":0.2176177508043878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986585972","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.638643,0.0001191292,0.34959963,0.0035358698,0.000114731534,0.0051866546,0.000621436,0.0020969005,0.00008262144],"genre_scores_gemma":[0.9653536,0.00016082011,0.011770656,0.000022327567,0.000047605598,0.00031079733,0.012590709,0.00015667563,0.0095868055],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9987375,0.0000517157,0.00024620604,0.00038319133,0.00028136256,0.00030001812],"domain_scores_gemma":[0.9978841,0.00009657302,0.0002728603,0.0010258507,0.00063178624,0.000088857916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003080209,0.00030472904,0.00036156535,0.0002469795,0.00038411573,0.000055035736,0.0010350432,0.00037841464,0.0000064390056],"category_scores_gemma":[0.000041897838,0.00030141656,0.00011519168,0.0007055558,0.00006137352,0.0002213506,0.000077579345,0.00036304558,0.000022899088],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0032355448,0.0004063271,0.00022861306,0.007975756,0.0007830254,0.0000085142665,0.53484684,0.020296693,0.33055988,0.013980435,0.028684318,0.058994036],"study_design_scores_gemma":[0.003626379,0.0016843397,0.054444857,0.005373144,0.0017697215,0.00003129531,0.39311934,0.17446569,0.26748776,0.0035164151,0.0888251,0.0056559546],"about_ca_topic_score_codex":0.002806746,"about_ca_topic_score_gemma":0.013508195,"teacher_disagreement_score":0.33782896,"about_ca_system_score_codex":0.00024254285,"about_ca_system_score_gemma":0.000084664156,"threshold_uncertainty_score":0.9999438},"labels":[],"label_agreement":null},{"id":"W6990534493","doi":"","title":"Distributed lossy source coding using BCH-DFT codes","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","keywords":"Distributed source coding; Lossy compression; Decoding methods; Encoder; Binary number; Context-adaptive binary arithmetic coding; Coding (social sciences); Quantization (signal processing); Variable-length code","score_opus":0.01917089811362026,"score_gpt":0.2505669615455036,"score_spread":0.23139606343188335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990534493","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.9573697,0.00078583026,0.00036715833,0.000008712367,0.0010515676,0.00090156123,0.002251125,0.0047896933,0.032474678],"genre_scores_gemma":[0.9895825,0.0005920286,0.0039337,0.0000665951,0.00007640713,0.00013754504,0.004449435,0.0005361452,0.0006256605],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957371,0.00038845144,0.0012776915,0.0008516391,0.00081757084,0.0009275565],"domain_scores_gemma":[0.9963791,0.0004223152,0.0005313433,0.0018232503,0.0004785913,0.00036544475],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00091626483,0.0011024941,0.0011700899,0.00057998556,0.0011139022,0.00023563294,0.0016169233,0.0013629142,0.00013828077],"category_scores_gemma":[0.0006033273,0.0013744931,0.00040998912,0.00075889676,0.00009568717,0.0007085608,0.00024506036,0.0026194085,0.00017961679],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026104972,0.00049518334,0.00017603164,0.0057306667,0.0016468465,0.00009463695,0.00011786639,0.023623757,0.5697099,0.18579625,0.0002259269,0.21212189],"study_design_scores_gemma":[0.0013078649,0.00011574775,0.0005996689,0.0038700507,0.000663465,0.00008387947,0.0004487377,0.041742753,0.5832859,0.0134467175,0.34948328,0.0049519273],"about_ca_topic_score_codex":0.00025589374,"about_ca_topic_score_gemma":0.0006728004,"teacher_disagreement_score":0.34925735,"about_ca_system_score_codex":0.001253008,"about_ca_system_score_gemma":0.000035844234,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W7015017120","doi":"","title":"Security enhancements for sparse MIMO systems: A compressive sensing - artificial noise technique","year":2018,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Physical layer; Artificial noise; MIMO; Compressed sensing; Adversary; Wireless; Randomness; Secrecy; Noise (video)","score_opus":0.022576947612751058,"score_gpt":0.26545015282404005,"score_spread":0.242873205211289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015017120","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.91617155,0.0013058247,0.00058932946,0.00001023371,0.00427751,0.009728282,0.0060077286,0.00586904,0.056040473],"genre_scores_gemma":[0.981453,0.000373983,0.012124682,0.000047298498,0.00019238412,0.0018179883,0.002962723,0.00054179045,0.0004861327],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99521524,0.00035071516,0.001647319,0.00105462,0.0007705606,0.0009615397],"domain_scores_gemma":[0.9956231,0.00032577637,0.00073755305,0.0019039762,0.0011042241,0.00030534685],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010716898,0.001146274,0.0012552923,0.00066443556,0.0010468106,0.0002425032,0.0012639095,0.0015499553,0.00005603403],"category_scores_gemma":[0.00040674437,0.0014244623,0.00043070014,0.00054439163,0.000112005306,0.0006948459,0.00020679717,0.0017701137,0.00013259747],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005272206,0.00048726203,0.0000026844677,0.0059868954,0.0009932793,0.00005334241,0.00017955656,0.0004044724,0.8776496,0.046063278,0.00044959527,0.06720281],"study_design_scores_gemma":[0.000448216,0.0001425776,0.000010090732,0.0025332763,0.00023934853,0.0000247808,0.00035499563,0.0045230724,0.8820019,0.019788051,0.088242345,0.0016913571],"about_ca_topic_score_codex":0.00023828231,"about_ca_topic_score_gemma":0.00096043,"teacher_disagreement_score":0.08779275,"about_ca_system_score_codex":0.0011973222,"about_ca_system_score_gemma":0.000056533594,"threshold_uncertainty_score":0.99974626},"labels":[],"label_agreement":null},{"id":"W7016009648","doi":"","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources with Applications to Networked Control","year":2021,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Markov chain; Markov process; Encoder; Lossy compression; Markov decision process; Coding (social sciences); Optimal control; Control theory (sociology); Markov model; Rate of convergence","score_opus":0.004928368903094874,"score_gpt":0.191419791308291,"score_spread":0.18649142240519614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016009648","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.34631348,0.0022375104,0.45600215,0.022795204,0.00080063957,0.010363207,0.0017514667,0.013644521,0.14609182],"genre_scores_gemma":[0.9197635,0.0013212551,0.03635207,0.000115073875,0.0001258045,0.000045784698,0.0021253952,0.00023624048,0.03991486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986643,0.00011482664,0.00026409508,0.00037682007,0.00027636593,0.0003035793],"domain_scores_gemma":[0.9983213,0.00018831911,0.00020573818,0.0009278555,0.0001649162,0.00019185683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004654151,0.00038288417,0.0005842812,0.0004334798,0.00017295912,0.000063203115,0.0008777631,0.00037037293,0.0001700757],"category_scores_gemma":[0.000009833815,0.0004625043,0.00015137946,0.00096291275,0.00005983889,0.00048396143,0.00011784872,0.0005683836,0.000014638929],"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.0031501795,0.0011104499,0.011459908,0.008271889,0.0053194677,0.00041683632,0.021921862,0.09520111,0.0030032126,0.06523038,0.77751344,0.0074012917],"study_design_scores_gemma":[0.0020485006,0.00032183767,0.004144586,0.0030131096,0.00074823847,0.0000021264668,0.0070178322,0.002979327,0.04788202,0.00022303205,0.9287761,0.002843277],"about_ca_topic_score_codex":0.0004695725,"about_ca_topic_score_gemma":0.00013266454,"teacher_disagreement_score":0.57345,"about_ca_system_score_codex":0.00010292906,"about_ca_system_score_gemma":0.00014938579,"threshold_uncertainty_score":0.9997827},"labels":[],"label_agreement":null},{"id":"W7021061897","doi":"","title":"Multiple Antenna Broadcast Channels with Random Channel Side Information","year":2011,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Channel state information; Transmitter; Additive white Gaussian noise; Transmission (telecommunications); Antenna (radio); Range (aeronautics); Rayleigh fading; Noise (video); Gaussian","score_opus":0.0036054374815553208,"score_gpt":0.1390657052268562,"score_spread":0.1354602677453009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021061897","genre_codex":"other","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.11635491,0.0026556216,0.0032034295,0.0004016063,0.0013863122,0.0017363452,0.0011191394,0.00045626183,0.8726864],"genre_scores_gemma":[0.9953665,0.0011189607,0.00076224137,0.00015882423,0.000040714043,0.00006319641,0.0003829713,0.00005132498,0.002055248],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830586,0.000030536867,0.0003809734,0.00013397192,0.000905062,0.00024361351],"domain_scores_gemma":[0.9991937,0.00012369837,0.00020450875,0.00032102386,0.0000028771933,0.0001541744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000009549607,0.00029656372,0.0003571587,0.00006510168,0.000105167805,0.000033739507,0.00033194385,0.000075039294,0.000013683086],"category_scores_gemma":[0.0000047836725,0.00029055236,0.000029088433,0.0000819663,0.00003364719,0.0007982152,0.000049146973,0.00027356058,6.1154077e-9],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.044747874,0.0007436786,0.015801733,0.046370395,0.007813404,0.0005653773,0.050924033,0.019863674,0.11615874,0.17487784,0.037582316,0.48455095],"study_design_scores_gemma":[0.0039892984,0.00027178656,0.019806486,0.0032029857,0.00017357345,0.000020808966,0.020146012,0.09623499,0.7387746,0.0017168445,0.11298595,0.0026766278],"about_ca_topic_score_codex":0.003496056,"about_ca_topic_score_gemma":0.049927898,"teacher_disagreement_score":0.87901163,"about_ca_system_score_codex":0.000008356095,"about_ca_system_score_gemma":0.00048765144,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W7023745133","doi":"","title":"The prevalence and impact of bypassing phase 2 trials in neurologic drug development","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Canadian Institutes of Health Research","keywords":"Drug development; Phase (matter); Clinical trial; Drug; MEDLINE","score_opus":0.038311789950783305,"score_gpt":0.32207586761081786,"score_spread":0.28376407766003453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023745133","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.9940037,0.0018074757,2.6060843e-7,0.0000074231807,0.00028578265,0.0008444381,0.00024211353,0.00060641486,0.0022023912],"genre_scores_gemma":[0.99357736,0.004932022,0.00043887174,0.00000878054,0.000009592494,0.00029696178,0.00017832278,0.00014596713,0.0004120982],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960812,0.00093544193,0.0016540105,0.00043963204,0.0004365768,0.00045318014],"domain_scores_gemma":[0.996365,0.0019559823,0.0005969119,0.00080679334,0.00015718368,0.0001181372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0045006857,0.000518132,0.00095188036,0.0004729577,0.00044842137,0.00009589322,0.00088540034,0.00040054368,0.000021158825],"category_scores_gemma":[0.0022076438,0.00043478605,0.0002451748,0.0006043996,0.000065708664,0.0003303741,0.00015992761,0.001305085,0.000014914139],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055896473,0.00037048556,0.00043583795,0.003901898,0.0005904155,0.00004898887,0.00035770272,0.00073189446,0.10864444,0.006571063,0.00003976188,0.87774855],"study_design_scores_gemma":[0.007936817,0.00083170395,0.117154144,0.0069364137,0.0007727936,0.00005243361,0.0010664078,0.004344573,0.7801744,0.038778584,0.036297638,0.005654095],"about_ca_topic_score_codex":0.00011579096,"about_ca_topic_score_gemma":0.0009069717,"teacher_disagreement_score":0.87209445,"about_ca_system_score_codex":0.00044425807,"about_ca_system_score_gemma":0.00006266604,"threshold_uncertainty_score":0.9998104},"labels":[],"label_agreement":null},{"id":"W7023803883","doi":"","title":"Occurrence of Pyrenophora Tritici-repentis causing tan spot in argentina","year":2010,"lang":"en","type":"article","venue":"Conicet","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Hyporeflexia; TSG101; Liquation; Gestational period; Dysgeusia; Diafiltration","score_opus":0.014455973973564058,"score_gpt":0.2588494328155745,"score_spread":0.24439345884201044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023803883","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.996092,0.00047006487,0.0007083585,0.00006629427,0.00021422168,0.00013882131,0.000046196437,0.00024613613,0.0020179085],"genre_scores_gemma":[0.99752194,0.00020212131,0.0021887696,0.000014555874,0.000012971709,0.000017195964,0.000022449127,0.0000109498515,0.000009020263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930245,0.000021805063,0.00029287877,0.000109466666,0.000099166646,0.00017424158],"domain_scores_gemma":[0.99923885,0.00006619895,0.000046879177,0.0005541038,0.000054300344,0.000039655068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022052367,0.00009740445,0.00018496253,0.00012868398,0.000020644618,0.000020494968,0.00027620912,0.00008567834,0.00015661922],"category_scores_gemma":[0.000057531764,0.000118048505,0.000034826982,0.00023266028,0.00006856308,0.00011358009,0.00007242582,0.00036432184,0.000015873933],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010951952,0.00019606891,0.012817211,0.00042352398,0.000030869134,0.000022725533,0.0012927057,0.00020604182,0.9500092,0.0077817035,0.005173928,0.022035044],"study_design_scores_gemma":[0.00094560324,0.000039316044,0.012182329,0.00034257467,0.000022694741,0.000034692614,0.00014507746,0.016533958,0.8977206,0.0012760488,0.07011208,0.00064504467],"about_ca_topic_score_codex":0.000050914172,"about_ca_topic_score_gemma":0.00017959054,"teacher_disagreement_score":0.06493815,"about_ca_system_score_codex":0.00002313046,"about_ca_system_score_gemma":0.00002249491,"threshold_uncertainty_score":0.48138785},"labels":[],"label_agreement":null},{"id":"W7024497780","doi":"","title":"Solon and the Rhetoric of <i>Stasis</i>","year":2018,"lang":"en","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rhetoric; Series (stratigraphy); Association (psychology); George (robot)","score_opus":0.013967378939467123,"score_gpt":0.21434865152190263,"score_spread":0.20038127258243552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024497780","genre_codex":"other","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.1235843,0.000023403885,0.004260779,0.00018182534,0.000111692374,0.00047428938,0.00001655023,0.00071778614,0.8706294],"genre_scores_gemma":[0.9151809,0.083590895,0.0011509423,0.000024146468,0.000028820778,0.0000017326138,0.0000022866682,0.000015313432,0.000004957108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947196,0.00007924157,0.000109408,0.00010964698,0.000095558054,0.00013416221],"domain_scores_gemma":[0.99928707,0.00010219874,0.00004679059,0.00045377592,0.000085320804,0.00002483841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015050666,0.000105672356,0.00015859184,0.0019318443,0.00008786122,0.000014283375,0.00039249274,0.00006782034,0.000008100446],"category_scores_gemma":[0.000021120211,0.000093185896,0.00004678177,0.002475091,0.00033054003,0.00016055802,0.00017855779,0.00013879659,0.00000461427],"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.0012969512,0.00053616136,0.0017559781,0.0010169452,0.0011934104,0.00005542647,0.13299963,0.00012650655,0.0025143442,0.54681265,0.01067243,0.30101955],"study_design_scores_gemma":[0.0006306119,0.00003953936,0.000047383415,0.000026017746,0.00003075173,0.0000037134207,0.00017228287,0.0015477696,0.011344697,0.000008505646,0.98603475,0.000113968934],"about_ca_topic_score_codex":0.0030228347,"about_ca_topic_score_gemma":0.0016675174,"teacher_disagreement_score":0.9753623,"about_ca_system_score_codex":0.000052960677,"about_ca_system_score_gemma":0.000032427866,"threshold_uncertainty_score":0.4569642},"labels":[],"label_agreement":null},{"id":"W7029612806","doi":"","title":"Iterative receivers for digital communications via variational inference and estimation","year":2008,"lang":"en","type":"dissertation","venue":"University of Oulu Repository (University of Oulu)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Proteogenomics","score_opus":0.011401921496395878,"score_gpt":0.21490302400114192,"score_spread":0.20350110250474604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029612806","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.51780486,0.001654336,0.384955,0.000324696,0.00057706214,0.0024419962,0.0013454632,0.0011380523,0.08975851],"genre_scores_gemma":[0.94424766,0.0011529933,0.05043436,0.0000016644252,0.000009880803,4.4843995e-7,0.0017286852,0.0000252626,0.002399071],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991203,0.000059925656,0.0002115911,0.00024142512,0.00023213364,0.00013463161],"domain_scores_gemma":[0.99799734,0.00028978527,0.00040224052,0.00067574484,0.00055433484,0.00008052796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007537924,0.00022188519,0.0004052853,0.0003093888,0.0005091144,0.000023225912,0.0008430505,0.00035688002,0.000016687587],"category_scores_gemma":[0.000030309426,0.00036161832,0.00016079377,0.00020443996,0.00034884596,0.00078486785,0.00014556282,0.0003036879,0.000002827615],"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.005120129,0.003889509,0.014455061,0.014450681,0.010490534,0.00033147683,0.530636,0.041417845,0.065989114,0.07066732,0.04159827,0.20095408],"study_design_scores_gemma":[0.005363952,0.000816146,0.054219533,0.0024420822,0.0014569637,0.00010759357,0.057541713,0.82847106,0.006466748,0.0031490275,0.036774226,0.0031909226],"about_ca_topic_score_codex":0.00025952008,"about_ca_topic_score_gemma":0.0001519243,"teacher_disagreement_score":0.7870532,"about_ca_system_score_codex":0.00019341212,"about_ca_system_score_gemma":0.00013429529,"threshold_uncertainty_score":0.9998836},"labels":[],"label_agreement":null},{"id":"W7092205663","doi":"10.1109/tifs.2025.3622317","title":"Polar-Domain Multi-User Key Generation in Near-Field Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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; Engineering and Physical Sciences Research Council; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Department for the Economy","keywords":"Telecommunications link; Precoding; Channel state information; Decorrelation; MIMO; Base station; Channel (broadcasting); Key generation; Physical layer; Overhead (engineering)","score_opus":0.014276607840664474,"score_gpt":0.2513515399323341,"score_spread":0.23707493209166963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092205663","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.0636992,0.00015711294,0.93045425,0.0010444525,0.0002349973,0.00042056074,0.00007185725,0.00037523243,0.0035423387],"genre_scores_gemma":[0.97998613,0.001012115,0.018263323,0.0005378237,0.0000055461587,0.000099491626,0.00006689467,0.000009664187,0.000019018384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914414,0.000052628344,0.00044932193,0.00008626229,0.0001154731,0.000152188],"domain_scores_gemma":[0.9990748,0.00008511633,0.000045946013,0.00064896734,0.00009828375,0.000046867164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021662364,0.00014972077,0.00015691356,0.0003042811,0.00026938153,0.00014882418,0.00024978296,0.00017457233,0.00001327466],"category_scores_gemma":[0.000008685306,0.00017278767,0.000050626753,0.00040141697,0.00008566279,0.00082648563,0.000007750762,0.00048138463,0.000012612746],"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.00014787541,0.00084365834,0.0012456488,0.0007631044,0.0003603595,0.000002059764,0.056667395,0.07411408,0.002508645,0.51290685,0.021156652,0.32928365],"study_design_scores_gemma":[0.0011048823,0.00005089388,0.0004948944,0.00010110964,0.00002100928,0.000003993076,0.00062189606,0.87190986,0.015731746,0.004935208,0.10463645,0.0003880816],"about_ca_topic_score_codex":0.00015520638,"about_ca_topic_score_gemma":0.001281927,"teacher_disagreement_score":0.91628695,"about_ca_system_score_codex":0.00009602624,"about_ca_system_score_gemma":0.000031598513,"threshold_uncertainty_score":0.70460767},"labels":[],"label_agreement":null},{"id":"W7097026278","doi":"","title":"On the capacity-achieving distribution of the non-coherent Rician fading channel,” Canadian workshop on information theory","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rician fading; Fading; Fading distribution; Amplitude; Transmitter; Channel (broadcasting); Transmission (telecommunications); Distribution (mathematics)","score_opus":0.013527594414244143,"score_gpt":0.20396101586212298,"score_spread":0.19043342144787884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097026278","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.69004935,0.00005495115,0.067046925,0.0016130236,0.00036884137,0.0010544839,0.00006091656,0.00038141035,0.23937012],"genre_scores_gemma":[0.9994895,0.000029086354,0.0000568044,0.00031988186,0.000008001226,0.000045424647,0.000016821732,0.000010969821,0.000023504514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992644,0.00012717865,0.00021682477,0.00005544943,0.00015190522,0.00018423483],"domain_scores_gemma":[0.99903286,0.00024201881,0.000059291262,0.0005726651,0.000045217726,0.00004794924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052474596,0.0001180819,0.000095414776,0.00007903259,0.00020460873,0.00004154828,0.00034774255,0.0000819217,0.00004789196],"category_scores_gemma":[0.00023053575,0.00007567849,0.000053944823,0.00028499076,0.000044440236,0.00015856624,0.000021649328,0.0003284402,0.00001767002],"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.0000032589237,0.000016019178,0.00006584894,0.000023740084,0.000023663557,6.5984366e-8,0.002255896,0.011380317,0.00020371188,0.9791546,0.0025994633,0.004273417],"study_design_scores_gemma":[0.001354891,0.00026503362,0.039510984,0.0037671644,0.0001224179,0.000019253765,0.01565969,0.2147252,0.42274687,0.09884634,0.20012543,0.0028567363],"about_ca_topic_score_codex":0.0012101363,"about_ca_topic_score_gemma":0.0046753353,"teacher_disagreement_score":0.8803083,"about_ca_system_score_codex":0.00028204374,"about_ca_system_score_gemma":0.000025452586,"threshold_uncertainty_score":0.3086079},"labels":[],"label_agreement":null},{"id":"W7104183573","doi":"","title":"Adaptive Cooperative Transmission Design for Ultra-Reliable Low-Latency Communications via Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","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 Victoria","funders":"","keywords":"Markov decision process; Transmission (telecommunications); Network packet; Reinforcement learning; Link adaptation; Reliability (semiconductor); Data transmission; Latency (audio); Coding (social sciences)","score_opus":0.04421592938892122,"score_gpt":0.286742917389954,"score_spread":0.24252698800103278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104183573","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.0042937556,0.0071832133,0.97606885,0.0012475793,0.00019064157,0.0031539025,0.0000064811306,0.00083279476,0.007022756],"genre_scores_gemma":[0.93234926,0.012685919,0.051866595,0.00021884168,0.00003379695,0.0012743846,0.00013968948,0.00011723327,0.001314255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964489,0.0005225976,0.0013612227,0.0006032066,0.0002812711,0.00078281737],"domain_scores_gemma":[0.99495864,0.0013249135,0.0002936234,0.0024111057,0.00080490886,0.00020683414],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009760534,0.00067520014,0.00075019174,0.000387583,0.0014909788,0.00012733652,0.0020319617,0.0005132164,0.00019885946],"category_scores_gemma":[0.0002251929,0.0007761383,0.00029060253,0.0010665506,0.00032905934,0.00065616594,0.00030901944,0.0014951917,0.000095659794],"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.00043752012,0.0006234614,0.0020243174,0.000640492,0.00095510756,0.0000026891973,0.012403185,0.8657098,0.07834254,0.014125258,0.0014212996,0.023314351],"study_design_scores_gemma":[0.0012805882,0.00045855113,0.0003983785,0.0014318099,0.00022437287,0.0000017536767,0.0009725514,0.82213014,0.15696359,0.000826883,0.014561199,0.0007501552],"about_ca_topic_score_codex":0.00018440274,"about_ca_topic_score_gemma":0.000026534484,"teacher_disagreement_score":0.9280555,"about_ca_system_score_codex":0.0006086873,"about_ca_system_score_gemma":0.00027448407,"threshold_uncertainty_score":0.99980897},"labels":[],"label_agreement":null},{"id":"W7104471027","doi":"10.71781/10391","title":"An exploration of approximation chains","year":2024,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domain (mathematical analysis); Maxim; Term (time)","score_opus":0.06472505183648569,"score_gpt":0.3530334898551882,"score_spread":0.2883084380187025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104471027","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.6457915,0.0014523952,0.0134718185,0.00007020788,0.00087072485,0.0024646525,0.00015220058,0.00020114375,0.3355254],"genre_scores_gemma":[0.9739821,0.00024100929,0.01867896,0.0000014103232,0.000040891682,0.00018102428,0.005239021,0.00007097775,0.0015645841],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926746,0.000030225547,0.00032355255,0.00016165596,0.00014057764,0.00007650589],"domain_scores_gemma":[0.99924916,0.000013736683,0.00008756808,0.0005484158,0.0000732193,0.000027927694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019021342,0.0001459851,0.0002073425,0.0001782945,0.000022891816,0.0001517701,0.0006080841,0.00021234859,0.00024799706],"category_scores_gemma":[0.0000082258475,0.00016660299,0.00003639754,0.00017923862,0.000009649835,0.0010426809,0.000030363619,0.00021603862,0.000114611285],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034731864,0.0001610343,0.0000034094116,0.0010351973,0.0001330406,0.0000025395032,0.07757098,0.0019567597,0.07819199,0.006333166,0.0010444551,0.8335327],"study_design_scores_gemma":[0.00021610716,0.00012134445,0.00006670031,0.0013699804,0.00013082611,0.0000013868159,0.012396489,0.15071319,0.8017259,0.005013977,0.02742401,0.0008200674],"about_ca_topic_score_codex":0.000024139485,"about_ca_topic_score_gemma":0.0003900211,"teacher_disagreement_score":0.83271265,"about_ca_system_score_codex":0.00004720845,"about_ca_system_score_gemma":0.00003709991,"threshold_uncertainty_score":0.6793873},"labels":[],"label_agreement":null},{"id":"W7131063257","doi":"10.1109/iccvw69036.2025.00671","title":"Tuning-Free Multi-Event Long Video Generation via Synchronized Coupled Sampling","year":2025,"lang":"","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Coherence (philosophical gambling strategy); Sampling (signal processing); Noise reduction; Consistency (knowledge bases); Inference; Focus (optics); Video denoising; Synchronization (alternating current); Baseline (sea)","score_opus":0.035060471458330085,"score_gpt":0.3052437598808508,"score_spread":0.2701832884225207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131063257","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.020124342,0.0068066074,0.9663765,0.0012474069,0.0008074871,0.0012150629,0.000011782296,0.0019277282,0.00148311],"genre_scores_gemma":[0.8166958,0.002143646,0.17945045,0.00025947054,0.00013994986,0.00021406276,0.000101877355,0.000095021904,0.0008996996],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966175,0.00023091033,0.0014154288,0.0006541443,0.00041231993,0.00066967093],"domain_scores_gemma":[0.9956956,0.0003639049,0.00021323358,0.003153815,0.00040452727,0.0001688987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009571165,0.0006250491,0.0007163783,0.00056600187,0.0004853461,0.00037740145,0.0016507314,0.0005326826,0.0007479512],"category_scores_gemma":[0.0004160327,0.0007630705,0.0002743081,0.00088894565,0.00012626525,0.0005067354,0.0010678915,0.0008758146,0.00008101602],"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.000100816374,0.0013465734,0.0016966654,0.0018773605,0.0016812983,0.000022382508,0.0029620628,0.1723327,0.6436603,0.040378,0.0093641905,0.124577634],"study_design_scores_gemma":[0.0017980419,0.000033165816,0.0007224492,0.000505977,0.00012197942,0.0000046259934,0.00006863824,0.9451055,0.047717165,0.0004602195,0.0028186666,0.0006435944],"about_ca_topic_score_codex":0.00058423827,"about_ca_topic_score_gemma":0.0014124692,"teacher_disagreement_score":0.7965715,"about_ca_system_score_codex":0.0010042667,"about_ca_system_score_gemma":0.00019186937,"threshold_uncertainty_score":0.99948204},"labels":[],"label_agreement":null},{"id":"W79764082","doi":"10.1007/978-1-4614-7085-4_11","title":"Optimal Coding and Control for Linear Gaussian Systems Over Gaussian Channels Under Quadratic Cost","year":2013,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gaussian; Linear-quadratic-Gaussian control; Quadratic equation; Coding (social sciences); Mathematics; Computer science; Control (management); Mathematical optimization; Applied mathematics; Control theory (sociology); Optimal control; Statistics; Physics; Artificial intelligence; Geometry; Quantum mechanics","score_opus":0.02073049868951634,"score_gpt":0.2463522751478801,"score_spread":0.22562177645836376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79764082","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.00019469368,0.032051876,0.8577905,0.00053393794,0.003802225,0.021722516,0.0016635323,0.0030451098,0.07919557],"genre_scores_gemma":[0.9661152,0.0004403989,0.00029334522,0.000104530474,0.0011380367,0.0030129447,0.00013085552,0.0004331774,0.028331535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671435,0.00013352298,0.0013770041,0.00060700247,0.0004571162,0.00071099517],"domain_scores_gemma":[0.99689215,0.0006541309,0.0005431678,0.0012849595,0.00028550753,0.00034010437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006903383,0.0009543871,0.0018860288,0.00039575988,0.0002271637,0.0005533258,0.0006103705,0.0010555837,0.00006623923],"category_scores_gemma":[0.0000371734,0.00094240287,0.00028258594,0.000046594734,0.00014535894,0.00031275104,0.00006454407,0.00076958374,0.000113704606],"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.00013841166,0.0000487637,0.00002272542,0.0064736544,0.0028651345,0.000025906042,0.00065195246,0.052500576,0.0022206632,0.91875917,0.015460503,0.00083257275],"study_design_scores_gemma":[0.003974626,0.00015310492,0.000013583067,0.002944355,0.00039995337,0.00006969706,0.00015602479,0.8184324,0.000031113246,0.00042793903,0.17199957,0.0013976576],"about_ca_topic_score_codex":0.00020505268,"about_ca_topic_score_gemma":0.000023706545,"teacher_disagreement_score":0.9659205,"about_ca_system_score_codex":0.00038677102,"about_ca_system_score_gemma":0.00007113655,"threshold_uncertainty_score":0.9993026},"labels":[],"label_agreement":null},{"id":"W925244956","doi":"10.1007/978-3-319-17470-9_13","title":"Limited View Adversary Codes: Bounds, Constructions and Applications","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Computer science; Adversary; Adversary model; Decoding methods; Upper and lower bounds; Code (set theory); Theoretical computer science; Adversarial system; List decoding; Construct (python library); Block code; Discrete mathematics; Mathematics; Algorithm; Concatenated error correction code; Computer network; Computer security","score_opus":0.02068158502302986,"score_gpt":0.25278353363241934,"score_spread":0.23210194860938949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W925244956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029346156,0.0058566593,0.9833597,0.00015115844,0.00018776463,0.0004406776,0.000027132599,0.000599124,0.009348426],"genre_scores_gemma":[0.39704838,0.0061174715,0.5949178,0.0006996325,0.00055615656,0.00020869909,0.00011444519,0.00015908398,0.00017837214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877703,0.000013643897,0.00029889264,0.00040066446,0.0002889463,0.00022081948],"domain_scores_gemma":[0.99852586,0.00019719209,0.000072158815,0.00090660254,0.00018050306,0.00011766336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027260525,0.0002694679,0.000306396,0.00043726654,0.00014492853,0.00013764956,0.0007830225,0.00023862557,0.000015996244],"category_scores_gemma":[0.000019865205,0.00029173208,0.00003726085,0.00030735426,0.0009310333,0.00019262526,0.00034216876,0.0006159642,0.0000146569355],"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.0000021769781,0.000014922059,0.000035997626,0.00014304086,0.00002623428,0.0000044681374,0.00052699976,0.016589137,0.00013748163,0.041519977,0.00030436512,0.9406952],"study_design_scores_gemma":[0.0003270213,0.00006885982,0.00007495422,0.00085993035,0.000043222735,0.00022752024,0.0000019769461,0.30852035,0.00071686023,0.3334755,0.35438636,0.0012974628],"about_ca_topic_score_codex":0.000007610311,"about_ca_topic_score_gemma":0.00006284298,"teacher_disagreement_score":0.93939775,"about_ca_system_score_codex":0.00021604131,"about_ca_system_score_gemma":0.00014261766,"threshold_uncertainty_score":0.9999535},"labels":[],"label_agreement":null}]}