{"id":"W2150060124","doi":"10.1109/twc.2010.07.081669","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Node (physics); Resource allocation; Mathematical optimization; Transmission (telecommunications); Decoding methods; Selection (genetic algorithm); Algorithm; Computer network; Mathematics; Telecommunications","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.0005584371,0.000225452,0.0002371274,0.000293238,0.0009873532,0.000232667,0.00106884,0.0001722672,0.00003006475],"category_scores_gemma":[0.00001703149,0.0002424344,0.00004763439,0.0009675556,0.0002238331,0.0006732087,0.00005322547,0.001184936,0.0000252523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006926549,"about_ca_system_score_gemma":0.00008740229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003670257,"about_ca_topic_score_gemma":0.002517184,"domain_scores_codex":[0.9983589,0.0004228193,0.000403322,0.0004071349,0.0001467787,0.0002610392],"domain_scores_gemma":[0.9975032,0.000557484,0.0001078,0.001476702,0.0002166887,0.0001381897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008886874,0.001332695,0.0007054263,0.00001951143,0.0001535788,0.000002212925,0.005216716,0.3119065,0.02899327,0.118319,0.0004004001,0.5328618],"study_design_scores_gemma":[0.0004933974,0.00007968258,0.001134478,0.00004324668,0.00001385505,0.00002666355,0.00004401336,0.995271,0.00154571,0.00005700011,0.001025834,0.0002651154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1011034,0.0002272597,0.894096,0.003381017,0.0001538098,0.0003953244,0.000005118335,0.0001966451,0.0004414852],"genre_scores_gemma":[0.9606853,0.004328219,0.03426925,0.0002739034,0.00001620056,0.000212461,0.00001256018,0.00002002916,0.0001820708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8598267,"threshold_uncertainty_score":0.9886189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100030405739163,"score_gpt":0.2708555445789591,"score_spread":0.2498552405215675,"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."}}