{"id":"W2005713623","doi":"10.1109/tit.2013.2284914","title":"A Unified Relay Framework With Both D-F and C-F Relay Nodes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Decoding methods; Node (physics); Upstream (networking); Computer science; Computer network; Link Access Procedure for Frame Relay; Downstream (manufacturing); Topology (electrical circuits); Cover (algebra); Mathematics; Telecommunications; Combinatorics; Engineering; Physics; 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.001323796,0.0017495,0.001286737,0.0008661815,0.001377756,0.002212175,0.002699995,0.001828466,0.003667115],"category_scores_gemma":[0.001456754,0.0005106503,0.0009409021,0.0009146546,0.001655034,0.003161101,0.002538477,0.001887506,0.001685404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001591759,"about_ca_system_score_gemma":0.00216208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004366661,"about_ca_topic_score_gemma":0.005557517,"domain_scores_codex":[0.998849,0.0003499378,0.00006120754,0.0003245224,0.0002550387,0.0001602571],"domain_scores_gemma":[0.9992667,0.0002240586,0.00007023654,0.0001420914,0.0002310943,0.00006577373],"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.0002258969,0.0000798749,0.0003703625,0.0003705253,0.00009852122,0.0009757975,0.0004735588,0.2777499,0.01523205,0.6151465,0.008780209,0.08049677],"study_design_scores_gemma":[0.00009218531,0.0004836517,0.0001741236,0.0001174002,0.0001798969,0.001320183,0.0002348404,0.8010361,0.007563842,0.1445508,0.04408769,0.0001592883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003886507,0.001306159,0.9851927,0.0003006125,0.000105968,0.00009141255,0.0001170958,0.0002259746,0.008773605],"genre_scores_gemma":[0.4723912,0.004612639,0.503718,0.000521072,0.0003322424,0.0004720546,0.0002853595,0.0001390957,0.01752835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004366661,"threshold_uncertainty_score":0.01226771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01165889505227139,"score_gpt":0.22406793583766,"score_spread":0.2124090407853887,"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."}}