{"id":"W2120752472","doi":"10.1109/cwit.2009.5069512","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Protocol (science); Relay; Cooperative diversity; Outage probability; Channel (broadcasting); Upper and lower bounds; Selection (genetic algorithm); Exploit; Scheme (mathematics); Power (physics); Distributed computing; Fading; Mathematics; Computer security","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.0002991004,0.0001173835,0.000111002,0.00005596336,0.000363593,0.0002167293,0.0006533584,0.00004251801,0.0001091232],"category_scores_gemma":[0.00003069561,0.00009857301,0.00004378102,0.0002980177,0.00002712583,0.00033682,0.00003380665,0.000091528,0.000005362201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003316164,"about_ca_system_score_gemma":0.0001533103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.844253e-7,"about_ca_topic_score_gemma":0.00001103294,"domain_scores_codex":[0.9991281,0.0001123151,0.0001889849,0.0002728923,0.0001091426,0.0001885826],"domain_scores_gemma":[0.998859,0.0001196575,0.00005383433,0.0005296598,0.0003171962,0.0001206616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004846496,0.0003467264,0.00004072046,0.000002532489,0.000006626208,0.000001264867,0.00005181963,0.01152232,0.0007542134,0.7857947,0.01280299,0.1886276],"study_design_scores_gemma":[0.0006663013,0.0004369859,0.0003158819,0.00001144902,0.000001111366,0.000001493489,0.00000292685,0.9375899,0.0004186203,0.0004462481,0.05996185,0.0001471954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004629253,0.000002222123,0.9582283,0.001893925,0.00005130384,0.03411784,0.000001309552,0.000262307,0.005438178],"genre_scores_gemma":[0.2946804,0.000007327639,0.3532531,0.01810724,0.000485791,0.3311071,0.00008920578,0.00002432984,0.002245557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9260676,"threshold_uncertainty_score":0.4019691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0916778520068448,"score_gpt":0.3727935192452325,"score_spread":0.2811156672383877,"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."}}