{"id":"W2063601473","doi":"10.1109/tcomm.2013.031213.120686","title":"Outage Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Relay Networks in the Presence of Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Outage probability; Scheduling (production processes); Computer science; Hop (telecommunications); Interference (communication); Upper and lower bounds; Co-channel interference; Topology (electrical circuits); Single antenna interference cancellation; Channel state information; Channel (broadcasting); Relay channel; Closed-form expression; Computer network; Control theory (sociology); Fading; Mathematics; Telecommunications; Mathematical optimization; Wireless","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.001989183,0.0005687125,0.0008542251,0.0005706507,0.0005671661,0.001061131,0.0007019895,0.0006209257,0.0007366068],"category_scores_gemma":[0.007537999,0.000377567,0.0003144158,0.000786086,0.001135751,0.0009349003,0.0008079377,0.000495187,0.0001189165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001728989,"about_ca_system_score_gemma":0.0007520768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003521258,"about_ca_topic_score_gemma":0.002067958,"domain_scores_codex":[0.9991142,0.0003423426,0.00003578966,0.00007906025,0.0002506429,0.0001780619],"domain_scores_gemma":[0.9919558,0.006236774,0.0007477212,0.0002843308,0.0006248151,0.0001505928],"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.0001606316,0.00002542223,0.002051061,0.0000725171,0.00003529385,0.0005937191,0.0001598481,0.9626988,0.00385808,0.02277611,0.0004948329,0.007073677],"study_design_scores_gemma":[0.000003273678,0.00001989041,0.0003176585,0.000003898713,0.000008055049,0.00009349525,0.00003320702,0.9954295,0.000366947,0.003610657,0.0001068678,0.000006515494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4735194,0.001973997,0.5115174,0.0006482619,0.00006980133,0.00003769592,0.0001703692,0.0002671684,0.01179586],"genre_scores_gemma":[0.9952872,0.0003098691,0.00382155,0.00002080606,0.00002165546,0.000009882571,0.00002161955,0.00001381929,0.0004934391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003521258,"threshold_uncertainty_score":0.01254469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08063186284505632,"score_gpt":0.3159307185270514,"score_spread":0.2352988556819951,"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."}}