{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082517,0.001232967,0.0009630705,0.0006502771,0.0005738539,0.0008812815,0.0006785227,0.0006689611,0.0009270855],"category_scores_gemma":[0.003463058,0.0004358399,0.000549176,0.0007987642,0.00104156,0.00105116,0.0009062008,0.0005779614,0.0003130447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008504527,"about_ca_system_score_gemma":0.0007475231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259676,"about_ca_topic_score_gemma":0.00129971,"domain_scores_codex":[0.9988459,0.000467547,0.00005372774,0.0001884215,0.0002738849,0.0001705545],"domain_scores_gemma":[0.9983657,0.001093671,0.0001999852,0.0001235203,0.0001700945,0.00004714304],"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.0002538469,0.00004680513,0.0009032755,0.0001408896,0.00007578646,0.0006000745,0.0002793949,0.8895855,0.01450716,0.05883264,0.001186254,0.03358841],"study_design_scores_gemma":[0.00001279566,0.00006988824,0.0001164944,0.000006600673,0.00001662634,0.00009869217,0.00004039432,0.9869501,0.001742089,0.0105794,0.000355044,0.00001186554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04380204,0.0005483036,0.9522321,0.0001707799,0.00002700085,0.00003674081,0.00004426845,0.0001082605,0.003030428],"genre_scores_gemma":[0.9569782,0.0006606077,0.04089203,0.00004269825,0.00003070346,0.00006092408,0.00004314211,0.0000150291,0.001276672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001259676,"threshold_uncertainty_score":0.006170511,"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."}}