{"id":"W2083650523","doi":"10.1109/ciss.2013.6552262","title":"A partial decode-forward scheme for a network with N relays","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Linear network coding; Decoding methods; Upper and lower bounds; Computer science; Topology (electrical circuits); Block (permutation group theory); Markov chain; Gaussian; Relay channel; Computer network; Encoding (memory); Scheme (mathematics); Markov process; Network topology; Power (physics); Mathematics; Algorithm; Network packet; Combinatorics","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.001053939,0.001008733,0.0009214464,0.0003886423,0.0005755252,0.0008419084,0.001135037,0.0008759483,0.001684318],"category_scores_gemma":[0.002785936,0.0003480508,0.000581521,0.0005358947,0.001159881,0.001653058,0.001222671,0.0006833161,0.0003112084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001200252,"about_ca_system_score_gemma":0.001160527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002934517,"about_ca_topic_score_gemma":0.003101457,"domain_scores_codex":[0.9994521,0.0001868132,0.00003151111,0.00009407929,0.0001428712,0.00009276252],"domain_scores_gemma":[0.9989568,0.0006551774,0.0001080406,0.000127303,0.0001202499,0.0000323668],"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.0002844497,0.0000524499,0.0003918374,0.0003171294,0.00008094176,0.0003019428,0.0004009142,0.7819116,0.01503007,0.1608939,0.001745266,0.0385896],"study_design_scores_gemma":[0.00003363031,0.0001122486,0.00008242748,0.0000205054,0.0000355129,0.0001561671,0.00002919838,0.9719319,0.003286226,0.02307566,0.001214951,0.00002170527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04709459,0.0007683015,0.9476349,0.0003981498,0.00003553173,0.00007099019,0.0001558163,0.0001511815,0.003690597],"genre_scores_gemma":[0.8752468,0.0009308804,0.1194375,0.00011772,0.00003941308,0.0001729694,0.0001304522,0.00002123388,0.00390306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002934517,"threshold_uncertainty_score":0.008708537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02940993401304649,"score_gpt":0.2608344890259209,"score_spread":0.2314245550128744,"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."}}