{"id":"W2791285730","doi":"10.1109/lcomm.2018.2797877","title":"A Power-Efficient and Social-Aware Relay Selection Method for Multi-Hop D2D Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Exploit; Computer network; Upload; Selection (genetic algorithm); Power consumption; Transmission (telecommunications); Power (physics); Telecommunications; Computer security; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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","sts"],"consensus_categories":[],"category_scores_codex":[0.0010686,0.0002256401,0.0002471464,0.000247659,0.003004892,0.0002852533,0.004389046,0.00009965364,0.000009193599],"category_scores_gemma":[0.00005971306,0.0002455077,0.0001132323,0.0008415057,0.0005961594,0.0003135289,0.001603255,0.0004047985,0.00003485168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001597626,"about_ca_system_score_gemma":0.00007827817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002026959,"about_ca_topic_score_gemma":0.0002268059,"domain_scores_codex":[0.9977265,0.000886623,0.0004533624,0.0004177866,0.0001695086,0.000346244],"domain_scores_gemma":[0.9943531,0.0007900257,0.0002434915,0.003928876,0.0005955544,0.00008894345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006092908,0.002003552,0.0007597791,0.00007613199,0.0005190427,9.054443e-7,0.0569487,0.0006155109,0.1733532,0.3693897,0.06915349,0.327119],"study_design_scores_gemma":[0.0006032112,0.00005856483,0.0005640479,0.00003083246,0.00002089272,0.00001228579,0.000169843,0.8873305,0.0008051487,0.0000621909,0.1100361,0.0003064165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002475705,0.0005323349,0.9311536,0.06429308,0.0001807947,0.000625009,0.00001213941,0.0003097621,0.0004176082],"genre_scores_gemma":[0.4864642,0.0003426659,0.5087097,0.004030264,0.00004292264,0.0002800595,0.00002185948,0.00002147886,0.00008683818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8867149,"threshold_uncertainty_score":0.9999997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1046367194452691,"score_gpt":0.3780376339120289,"score_spread":0.2734009144667598,"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."}}