{"id":"W4312825914","doi":"10.1007/978-3-031-06947-5_20","title":"Maximum Multipath Diversity in Coded Cooperative Relay Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Decoding methods; Node (physics); Algorithm; Diversity gain; Coding (social sciences); Channel (broadcasting); Relay channel; Multipath propagation; Computer network; Theoretical computer science; Fading; Mathematics; 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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006076933,0.0003210222,0.0004876745,0.0005444151,0.001135492,0.00008044744,0.003168704,0.0004348199,0.0003688118],"category_scores_gemma":[0.00004042926,0.0003529411,0.00006991693,0.0003831119,0.0003604414,0.0002435187,0.01121472,0.00167833,0.00001556822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688024,"about_ca_system_score_gemma":0.00007213477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002167927,"about_ca_topic_score_gemma":0.0002753727,"domain_scores_codex":[0.9982578,0.0002642167,0.0004756175,0.0005404885,0.0001959861,0.0002658962],"domain_scores_gemma":[0.9968404,0.0002890754,0.0003404742,0.002269328,0.0001973624,0.00006336421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009246546,0.00004189391,0.0001098198,0.000004429011,0.00003690096,0.00000819229,0.0004972394,0.0006475414,0.00002353255,0.9405057,0.0005510554,0.0575644],"study_design_scores_gemma":[0.002381735,0.0005535795,0.0003133994,0.0005249468,0.00005861018,0.0000720055,0.0003213568,0.1507871,0.00009479465,0.2672099,0.5757226,0.001960035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0008035948,0.1327622,0.2044411,0.02778374,0.0004441285,0.002882532,0.00005128276,0.001882834,0.6289486],"genre_scores_gemma":[0.7981957,0.1517993,0.01089482,0.002087423,0.00002756596,0.0002472725,0.000169023,0.00007139643,0.03650754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7973921,"threshold_uncertainty_score":0.9998922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03848897724243196,"score_gpt":0.2546081736918402,"score_spread":0.2161191964494083,"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."}}