{"id":"W2107068971","doi":"10.1186/1687-1499-2013-236","title":"Decoding techniques for alternate-relaying BICM cooperative systems","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Detector; Decoding methods; Network packet; Exploit; Algorithm; Relay; Transmission (telecommunications); Bit error rate; Real-time computing; Computer network; Telecommunications","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001054102,0.0002451841,0.0003154014,0.0002200349,0.002289957,0.001609837,0.002244103,0.00008141323,0.00000630069],"category_scores_gemma":[0.00003552627,0.0002129221,0.00009236544,0.0004301128,0.0001133646,0.0008482512,0.0007886156,0.0006640724,0.00001141986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056292,"about_ca_system_score_gemma":0.00005407882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001035316,"about_ca_topic_score_gemma":0.000009679552,"domain_scores_codex":[0.9979942,0.0005332097,0.0006041948,0.00028747,0.0001933581,0.00038758],"domain_scores_gemma":[0.996461,0.001115956,0.0003924,0.00133616,0.0005076558,0.0001868827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007542124,0.00008029473,0.0006712223,0.00001120199,0.00007362552,0.000001989908,0.0007899259,0.00025678,0.001530449,0.1365228,0.00153725,0.8585169],"study_design_scores_gemma":[0.0005089175,0.0002427526,0.0001870934,0.0008315031,0.00001490346,0.0001842142,0.0001847914,0.9054991,0.0002839479,0.001147314,0.09046435,0.0004511014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02018838,0.02115632,0.9421906,0.007608539,0.001051657,0.001369045,0.000002564896,0.0003782233,0.006054644],"genre_scores_gemma":[0.9338254,0.03633217,0.02848331,0.000654138,0.0003117802,0.0002299428,0.000005340774,0.00002783021,0.0001301218],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9137073,"threshold_uncertainty_score":0.9994266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06290618820964414,"score_gpt":0.3110375627117491,"score_spread":0.248131374502105,"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."}}