{"id":"W1982972072","doi":"10.1109/lcomm.2012.012412.112327","title":"Joint Relay Assignment and Power Allocation for Multicast Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Relay; Unicast; Computer network; Mathematical optimization; Optimization problem; Power (physics); Algorithm; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007658569,0.0001760957,0.0001783597,0.00009627156,0.0007557208,0.0001802745,0.001283132,0.00006029397,0.000007981889],"category_scores_gemma":[0.00008358615,0.0001721853,0.00005911431,0.0003002948,0.0001948399,0.0007109124,0.0005953321,0.0002632083,0.00001801317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001162839,"about_ca_system_score_gemma":0.0000246247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003294848,"about_ca_topic_score_gemma":0.00001113553,"domain_scores_codex":[0.9985692,0.0003840036,0.0003409174,0.0002353427,0.0001276847,0.000342837],"domain_scores_gemma":[0.996796,0.0005235929,0.0001375303,0.00221785,0.0001749828,0.0001500428],"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.00004107487,0.001503971,0.003047215,0.00003461663,0.0004267192,0.000001009781,0.02292404,0.0203169,0.1285051,0.6292667,0.07306614,0.1208666],"study_design_scores_gemma":[0.001406003,0.0001240915,0.009326815,0.0001154186,0.0000460152,0.00002453891,0.0002736404,0.8671566,0.002823872,0.00006862824,0.1178002,0.0008342455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006308873,0.002169158,0.9607701,0.02919541,0.0003261518,0.0006034369,0.000002716394,0.0001255649,0.0004986346],"genre_scores_gemma":[0.9108992,0.001131492,0.08297563,0.004509921,0.00005949946,0.0003237,0.00002099679,0.00001603251,0.00006359133],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9045902,"threshold_uncertainty_score":0.7021512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06813157986102504,"score_gpt":0.3003387715295912,"score_spread":0.2322071916685661,"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."}}