{"id":"W2554673546","doi":"10.1109/allerton.2012.6483483","title":"A decoding procedure for compress-and-forward and quantize-and-forward relaying","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Multicast; Computer science; Relay; Scheme (mathematics); Linear network coding; Gaussian; Algorithm; Computer network; Theoretical computer science; Mathematics","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.001632566,0.00120014,0.0008213064,0.001186803,0.00115194,0.0008386712,0.0008771532,0.001453268,0.00345822],"category_scores_gemma":[0.00543746,0.0004217433,0.0008721814,0.0007767514,0.001208389,0.001313728,0.001175917,0.001600261,0.002065103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007520699,"about_ca_system_score_gemma":0.002071348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001625847,"about_ca_topic_score_gemma":0.002005405,"domain_scores_codex":[0.9983364,0.0004346251,0.0001280276,0.0001998508,0.0007919259,0.0001092552],"domain_scores_gemma":[0.9981616,0.0008029051,0.0001357596,0.0004256286,0.0004390206,0.00003500626],"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.000259655,0.0001130296,0.0004411883,0.0003168842,0.00008185716,0.0005673363,0.0004271801,0.1205597,0.06483588,0.3564816,0.005487544,0.4504282],"study_design_scores_gemma":[0.0001007105,0.0004011057,0.0003990669,0.00009473342,0.00008221482,0.002042049,0.00009236734,0.7250813,0.1344629,0.1003001,0.03673448,0.0002088749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001120022,0.00008343823,0.9974354,0.00005061572,0.00004706484,0.0001045951,0.00004008534,0.0001725764,0.0009463321],"genre_scores_gemma":[0.07970504,0.0004849617,0.9129567,0.0001604748,0.0001451194,0.0004065585,0.0002806459,0.0001531436,0.005707358],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00345822,"threshold_uncertainty_score":0.01156896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05388004770787041,"score_gpt":0.3094361042699274,"score_spread":0.255556056562057,"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."}}