{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540957,0.000844329,0.0008684343,0.0005474475,0.0004316469,0.0008906955,0.001021043,0.001075901,0.001122108],"category_scores_gemma":[0.004687319,0.0005239215,0.0005058566,0.0009272855,0.0009571434,0.001354347,0.001245444,0.0006590947,0.0001961651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008677577,"about_ca_system_score_gemma":0.0007312535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001451573,"about_ca_topic_score_gemma":0.001375388,"domain_scores_codex":[0.9990883,0.0005103127,0.00002066128,0.0000822847,0.0001896316,0.0001089492],"domain_scores_gemma":[0.9987337,0.0009855779,0.00009586131,0.00006792854,0.00007623193,0.00004080552],"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.0000948312,0.00005966715,0.0002322026,0.00005462269,0.00002360063,0.00007162333,0.0001007196,0.9291954,0.00262454,0.04154909,0.0007160413,0.02527759],"study_design_scores_gemma":[0.000009623786,0.00001834439,0.00002035577,0.000001878503,0.000003630969,0.000007287201,0.00000770611,0.985442,0.0003840146,0.01392893,0.0001739401,0.000002220348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02911605,0.0001677261,0.9683896,0.0001907939,0.00001191886,0.00003012861,0.00002406084,0.00008166531,0.001988129],"genre_scores_gemma":[0.8595982,0.0002934378,0.137665,0.00007702212,0.00004687381,0.0001848049,0.00005086334,0.00005209595,0.002031779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001540957,"threshold_uncertainty_score":0.008149445,"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."}}