{"id":"W1988956019","doi":"10.1109/glocom.2009.5426101","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Resource allocation; Mathematical optimization; Transmission (telecommunications); Channel (broadcasting); Computational complexity theory; Range (aeronautics); Decoding methods; Linear network coding; Computer network; Algorithm; Mathematics; Telecommunications; Engineering","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.0003814966,0.0001139062,0.0001324258,0.0000959652,0.0001820136,0.0001706608,0.0002176843,0.00006292354,0.00002340287],"category_scores_gemma":[0.00003109576,0.0001051952,0.00001370572,0.0005200576,0.00002432526,0.0005073551,0.0001213037,0.0001834365,0.00001053914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004340726,"about_ca_system_score_gemma":0.00002807617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005092513,"about_ca_topic_score_gemma":0.00009095941,"domain_scores_codex":[0.9991153,0.0001564314,0.0001957975,0.0002811924,0.00008064464,0.0001706177],"domain_scores_gemma":[0.9994978,0.0000864856,0.0000417568,0.0002086136,0.00009759711,0.00006769572],"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.00005815449,0.0001848345,0.003284697,0.000004268242,0.00002750193,0.000004195965,0.002515938,0.1741299,0.00262487,0.3198712,0.004721286,0.4925732],"study_design_scores_gemma":[0.0002992923,0.0001278972,0.0110684,0.00001675236,0.00000210089,0.00001298717,0.00001338705,0.9873793,0.0002199954,0.0001108124,0.0006140245,0.000135083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08257282,0.0005936738,0.9099483,0.003360325,0.00003937704,0.0002287503,1.722487e-7,0.0001332046,0.00312332],"genre_scores_gemma":[0.9658056,0.001222454,0.03153254,0.0009492589,0.00002384502,0.000009674731,0.000004981203,0.000003845879,0.0004477887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8832328,"threshold_uncertainty_score":0.4289736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519073622647098,"score_gpt":0.258964138700792,"score_spread":0.243773402474321,"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."}}