{"id":"W2156419975","doi":"10.1109/wcnc.2007.338","title":"Diversity Order Bounds for Wireless Relay Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Codebook; Relay; Computer science; Outage probability; Diversity gain; Wireless; Encoding (memory); Coding (social sciences); Linear network coding; Upper and lower bounds; Wireless network; Algorithm; Computer network; Telecommunications; Mathematics; Decoding methods; Fading; Artificial intelligence; Statistics","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.002959457,0.001330295,0.001099832,0.001778937,0.0009500758,0.002507617,0.001356793,0.001066436,0.003148675],"category_scores_gemma":[0.02139799,0.000676398,0.0006339853,0.001496855,0.002455702,0.003610293,0.001701939,0.002646742,0.0008225117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00339081,"about_ca_system_score_gemma":0.001211846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159503,"about_ca_topic_score_gemma":0.001199648,"domain_scores_codex":[0.9976077,0.00053773,0.00008081045,0.00019077,0.001253574,0.0003293337],"domain_scores_gemma":[0.969853,0.02468398,0.001266039,0.001701144,0.002054988,0.0004409029],"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.0002177917,0.00005375882,0.001203857,0.0002506316,0.00005780144,0.0002477436,0.0003454511,0.5128696,0.006859988,0.4482907,0.002769194,0.02683352],"study_design_scores_gemma":[0.00002604165,0.00009644362,0.0006742279,0.00008202349,0.00002501608,0.0003041242,0.00006303802,0.6043456,0.003794844,0.3873527,0.003185002,0.0000509141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.062291,0.006812649,0.894829,0.001075992,0.0001419691,0.00006422409,0.0003751369,0.0005657553,0.03384427],"genre_scores_gemma":[0.9325492,0.00744301,0.0526236,0.0002952314,0.0003875315,0.0002108833,0.0004457708,0.0002380455,0.005806794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00339081,"threshold_uncertainty_score":0.02460212,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0382499728672371,"score_gpt":0.2825049202106363,"score_spread":0.2442549473433992,"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."}}