{"id":"W2124298966","doi":"10.1109/glocom.2010.5684225","title":"Transmission Schemes for Two-User Linear Multi-Access Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Time division multiple access; Computer network; Decoding methods; Relay channel; Transmission (telecommunications); Symbol rate; Single antenna interference cancellation; Interference (communication); Telecommunications; Bit error rate; Channel (broadcasting)","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.00128375,0.0007702385,0.0005655015,0.000535012,0.0006378313,0.0009235298,0.001499345,0.0008560642,0.00321266],"category_scores_gemma":[0.002779899,0.0002787513,0.0004788269,0.0006316521,0.0008563947,0.001727441,0.001171148,0.0007005933,0.0008207631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008427351,"about_ca_system_score_gemma":0.0004042365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006838161,"about_ca_topic_score_gemma":0.0007059776,"domain_scores_codex":[0.9990559,0.0004452135,0.00005236283,0.0001094013,0.0002310114,0.0001060034],"domain_scores_gemma":[0.9985531,0.0007764144,0.0001810104,0.0002457435,0.0002078011,0.00003587561],"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.0003008283,0.000160231,0.0008370457,0.0008882456,0.0001356321,0.0007275922,0.000946044,0.3837183,0.02561215,0.3849145,0.003912834,0.1978466],"study_design_scores_gemma":[0.0000637302,0.0002682338,0.0001658651,0.00005780795,0.00005304037,0.0006370015,0.00009003836,0.9427414,0.006205583,0.04019694,0.009455654,0.00006484076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01665496,0.001472294,0.9736419,0.0002574544,0.0000767711,0.0001240004,0.00004072406,0.0002293678,0.007502476],"genre_scores_gemma":[0.7704238,0.002012406,0.2187182,0.0002119473,0.0001459451,0.0003507787,0.00008938758,0.00003880967,0.008008703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00321266,"threshold_uncertainty_score":0.01074743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05527827233620437,"score_gpt":0.3545937532144842,"score_spread":0.2993154808782798,"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."}}