{"id":"W2177944699","doi":"10.1109/twc.2009.081580","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Protocol (science); Relay; Upper and lower bounds; Computer network; Outage probability; Channel (broadcasting); Selection (genetic algorithm); Cooperative diversity; Power (physics); Topology (electrical circuits); Mathematics; Fading","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","sts"],"consensus_categories":[],"category_scores_codex":[0.00040983,0.0002615549,0.0002411432,0.000221583,0.00188001,0.0002879964,0.002701229,0.0001182218,0.00004567793],"category_scores_gemma":[0.000009876377,0.0002660649,0.0001464125,0.0007996138,0.0001620879,0.0005719815,0.00000919914,0.0004673397,0.00001349592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000128002,"about_ca_system_score_gemma":0.0002944403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004221728,"about_ca_topic_score_gemma":0.0001006747,"domain_scores_codex":[0.9981323,0.0004660796,0.0004517626,0.0004252311,0.0002113265,0.0003132768],"domain_scores_gemma":[0.9952348,0.0005731792,0.0001511073,0.003274486,0.0005573066,0.0002091263],"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.0001554945,0.003784213,0.000006919946,0.00001105777,0.00006079309,0.000001119586,0.0003660583,0.2063696,0.003418609,0.1968481,0.001422502,0.5875555],"study_design_scores_gemma":[0.001120806,0.0005470727,0.00006942967,0.00006289248,0.00001191559,0.000003852575,0.00001603803,0.9780894,0.001962304,0.0002810648,0.01751275,0.0003224948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00001890111,0.00001074255,0.9683219,0.004582238,0.0001199603,0.02555983,0.0000307685,0.0004976309,0.0008580229],"genre_scores_gemma":[0.7949437,0.00007497938,0.06354024,0.002179495,0.00004818843,0.138917,0.00005779877,0.00002534135,0.0002132281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9047816,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09081092780281547,"score_gpt":0.3593649179714254,"score_spread":0.2685539901686099,"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."}}