{"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,"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","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031043,0.0004592025,0.0004111809,0.0003738028,0.001280386,0.00009902514,0.002510941,0.0002892628,0.00005467819],"category_scores_gemma":[0.000007948493,0.0003835419,0.000155865,0.0007245392,0.0007443651,0.0007265753,0.00002443958,0.0007684507,0.00004938435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004333918,"about_ca_system_score_gemma":0.0001351966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005689068,"about_ca_topic_score_gemma":0.002120143,"domain_scores_codex":[0.9978699,0.0004068771,0.0005850007,0.0004138356,0.0002719914,0.0004523773],"domain_scores_gemma":[0.9930524,0.001001003,0.0001392163,0.004926664,0.0006629867,0.0002177465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00209684,0.007119602,0.0001879962,0.0001956636,0.002784738,0.000002293377,0.01374055,0.3848167,0.138276,0.121,0.003736111,0.3260436],"study_design_scores_gemma":[0.002544935,0.002022299,0.00007685324,0.0005654261,0.0002571714,0.00005620517,0.001225622,0.8558928,0.117704,0.0002960223,0.01780589,0.001552867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03466296,0.0001921376,0.9581422,0.002170037,0.00008570709,0.001379095,0.0004557701,0.001971475,0.0009405887],"genre_scores_gemma":[0.8491511,0.001701584,0.1458958,0.00009527044,0.0000234197,0.002698267,0.00005982279,0.0001554684,0.0002192642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8144881,"threshold_uncertainty_score":0.9998617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03125541988931355,"score_gpt":0.2776628305870145,"score_spread":0.2464074106977009,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}