{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001347213,0.0002277311,0.0003092333,0.0004905822,0.0005905688,0.0003732236,0.00519158,0.0001305768,0.00001823009],"category_scores_gemma":[0.0002722593,0.0002237451,0.00006584343,0.003124645,0.00009775552,0.001199049,0.0007825055,0.00180367,0.00001630016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004343583,"about_ca_system_score_gemma":0.0002154796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001255392,"about_ca_topic_score_gemma":0.00031497,"domain_scores_codex":[0.9968963,0.001270652,0.0007387409,0.0002126781,0.0002692437,0.0006123661],"domain_scores_gemma":[0.9959036,0.0009384746,0.0003394068,0.002144958,0.0003775824,0.0002960024],"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.0002509604,0.01183176,0.1892099,0.00004044069,0.0003522586,0.0001348602,0.009265142,0.1008001,0.001441611,0.4511584,0.02913429,0.2063802],"study_design_scores_gemma":[0.00126624,0.00009231744,0.1425803,0.0005521452,0.00001410591,0.0002192044,0.00006783774,0.8455492,0.000095496,0.0008013393,0.008135593,0.0006262303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0741175,0.004298352,0.8957744,0.01702884,0.001700734,0.0008283802,0.00001959385,0.0003603643,0.005871858],"genre_scores_gemma":[0.9878463,0.009703743,0.001547114,0.000602357,0.0001248285,0.00006229963,0.00005283741,0.0000195428,0.0000409329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9137288,"threshold_uncertainty_score":0.9647334,"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."}}