{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484199,0.000553305,0.0003065478,0.000331736,0.0002976859,0.000735467,0.0003937777,0.0004925247,0.006417315],"category_scores_gemma":[0.002559271,0.0001766525,0.0002798698,0.0004553574,0.0007452214,0.00118833,0.0008194026,0.0009579997,0.001944263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003902188,"about_ca_system_score_gemma":0.0008475549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008674287,"about_ca_topic_score_gemma":0.001450781,"domain_scores_codex":[0.99972,0.00007542137,0.0000159415,0.00003584003,0.0001292338,0.0000234815],"domain_scores_gemma":[0.9994013,0.000293677,0.00005899842,0.0001646526,0.00006709207,0.00001430669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001375016,0.00007103265,0.0003757424,0.0004043412,0.00002174209,0.0003950052,0.000322073,0.1787967,0.04470297,0.5636476,0.004682864,0.2064424],"study_design_scores_gemma":[0.00001683656,0.0001130461,0.0002885625,0.00007144684,0.00001603832,0.0007164003,0.00005820598,0.7455416,0.04931552,0.1787314,0.02508938,0.00004150648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009029735,0.0002040699,0.9790022,0.0001498054,0.00004809155,0.00006338696,0.0001071009,0.0002058043,0.01118973],"genre_scores_gemma":[0.3297959,0.00133259,0.6535538,0.0002124353,0.00009285594,0.0002731125,0.0003042136,0.0004012082,0.01403386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006417315,"threshold_uncertainty_score":0.02146804,"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."}}