{"id":"W2095010751","doi":"10.1109/jsac.2012.121011","title":"Distributed Opportunistic Channel Access in Wireless Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Optimal stopping; Computer network; Channel (broadcasting); Throughput; Wireless network; Wireless; Transmission (telecommunications); Stopping time; Channel state information; Mathematical optimization; Telecommunications; Mathematics; Statistics; Power (physics)","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.002021104,0.0007133734,0.0009762481,0.000644644,0.0006832266,0.001547606,0.001232028,0.001208512,0.0007099159],"category_scores_gemma":[0.005791754,0.0004422703,0.0004673928,0.001049102,0.001514019,0.001646712,0.001064938,0.0007047246,0.0001294379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267366,"about_ca_system_score_gemma":0.001053526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001698177,"about_ca_topic_score_gemma":0.001337684,"domain_scores_codex":[0.9977998,0.001095887,0.00008042019,0.0003056317,0.0004462306,0.0002719348],"domain_scores_gemma":[0.9951928,0.003584429,0.0004931484,0.0002388728,0.0003673428,0.0001234748],"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.0001386056,0.00005655325,0.001484627,0.0002656822,0.0001179323,0.000745214,0.0002827466,0.7148661,0.003568439,0.2400964,0.001616459,0.03676119],"study_design_scores_gemma":[0.00002220864,0.00005375356,0.0001848234,0.00001247979,0.00001742462,0.0001580698,0.00004542747,0.9405353,0.000433894,0.0570772,0.001444722,0.00001471139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02953753,0.002227495,0.9613418,0.0003487827,0.00008619687,0.00006503286,0.00004531202,0.0001302695,0.006217609],"genre_scores_gemma":[0.9591496,0.001440018,0.03636198,0.00009563399,0.00009971426,0.0001233269,0.00003920038,0.00002261895,0.002668055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002021104,"threshold_uncertainty_score":0.01068872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1038579147569856,"score_gpt":0.3465843828383741,"score_spread":0.2427264680813885,"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."}}