{"id":"W2202812032","doi":"10.1109/tit.2015.2491941","title":"Exploiting the <inline-formula> <tex-math notation=\"LaTeX\">$N$ </tex-math></inline-formula>-to-1 Mapping in Compress-and-Forward Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Algorithm; Linear network coding; Computer science; Relay; Constraint (computer-aided design); Diagonal; Notation; Relaxation (psychology); Bin; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Computer network; Network packet","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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003641007,0.0006309655,0.0005975008,0.00104758,0.001510445,0.0008561536,0.001721108,0.000267401,0.00003748669],"category_scores_gemma":[0.0002372507,0.0005429317,0.0002461447,0.001908815,0.0001906441,0.005291388,0.0001235279,0.0009786028,0.0005282029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004520505,"about_ca_system_score_gemma":0.0002892532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001344221,"about_ca_topic_score_gemma":0.00009891955,"domain_scores_codex":[0.9952588,0.0005938358,0.001804862,0.0005475821,0.0009862041,0.0008086824],"domain_scores_gemma":[0.9954919,0.001140712,0.000631415,0.001532812,0.0008018433,0.0004013298],"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.0001742816,0.0002479455,0.00003379502,0.0001209729,0.000157692,0.000006253008,0.067485,0.1988892,0.00208795,0.4040903,0.0005704796,0.3261361],"study_design_scores_gemma":[0.002321176,0.0001777042,0.0004518041,0.0005599254,0.00004798606,0.00007308507,0.002006673,0.9447662,0.001891924,0.003944271,0.0428075,0.0009517013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09953065,0.0003415325,0.8909087,0.001946452,0.0009851365,0.001116343,0.00003791954,0.0005505107,0.004582726],"genre_scores_gemma":[0.9818855,0.0006277245,0.01419714,0.002289271,0.0001171918,0.0003436614,0.00005421069,0.00004985169,0.0004354389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8823549,"threshold_uncertainty_score":0.9997895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03869117171445596,"score_gpt":0.2660263468825533,"score_spread":0.2273351751680973,"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."}}