{"id":"W2027150172","doi":"10.1109/tcomm.2012.071812.110739","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Network-Coded Two-Way Relay Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Phase-shift keying; Detector; Linear network coding; Relay channel; Binary number; Transmission (telecommunications); Node (physics); Bit error rate; Algorithm; Channel (broadcasting); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Network packet; Physics; Arithmetic; Electrical engineering; 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.002414313,0.000822892,0.001101958,0.0007401761,0.0003847773,0.001716917,0.001277628,0.001571958,0.000636928],"category_scores_gemma":[0.009329107,0.0004227814,0.0004752915,0.001084217,0.00163936,0.002302182,0.001354333,0.0008198277,0.0002756807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001305926,"about_ca_system_score_gemma":0.001189057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001306538,"about_ca_topic_score_gemma":0.001133271,"domain_scores_codex":[0.9979079,0.0008295577,0.0001122695,0.0002911124,0.0006411162,0.0002181527],"domain_scores_gemma":[0.9953274,0.003398109,0.0004263117,0.0002679678,0.0005152781,0.00006497058],"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.0002416766,0.00006694631,0.0007588787,0.0002812911,0.00007462982,0.0004751756,0.0004188812,0.8178292,0.01465189,0.1063036,0.0006926178,0.05820525],"study_design_scores_gemma":[0.00001526802,0.00004459856,0.00005938374,0.00001245279,0.00000943756,0.0001143865,0.00002022746,0.9826262,0.003430299,0.01332467,0.0003265657,0.00001642857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0206788,0.0005163683,0.9767084,0.0001969532,0.00002227022,0.00003249435,0.00003354746,0.0001237879,0.001687382],"genre_scores_gemma":[0.8565085,0.0005282518,0.141104,0.0001170076,0.00003850643,0.00005764414,0.00005224298,0.00002709018,0.001566809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002414313,"threshold_uncertainty_score":0.01276827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07165189234788484,"score_gpt":0.2955124079014607,"score_spread":0.2238605155535758,"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."}}