{"id":"W2131829656","doi":"10.1109/ciss.2009.5054744","title":"Successive relaying for the half-duplex parallel relay channel","year":2009,"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":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Linear network coding; Gaussian; Markov chain; Coding (social sciences); Dirty paper coding; Duplex (building); Computer network; Decoding methods; Markov process; Encoding (memory); Topology (electrical circuits); Channel code; Algorithm; Channel (broadcasting); Mathematics; MIMO; Precoding; Physics; Statistics; Network packet; Chemistry; Combinatorics; Artificial intelligence","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.0008002864,0.0005917329,0.0005405358,0.0003127786,0.0005158829,0.0008767106,0.0007306712,0.000958669,0.001676001],"category_scores_gemma":[0.001918783,0.0002774897,0.0004438531,0.0005070374,0.001052012,0.00103489,0.0006917155,0.0006923085,0.0002888558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018475,"about_ca_system_score_gemma":0.0007440581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321711,"about_ca_topic_score_gemma":0.001826938,"domain_scores_codex":[0.9995841,0.000154569,0.00001152855,0.00006973829,0.000113012,0.00006699724],"domain_scores_gemma":[0.9985524,0.001032334,0.0001682084,0.00007618321,0.0001252255,0.00004563559],"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.000167513,0.00004343743,0.0003080318,0.0001991868,0.00004580431,0.0006062357,0.0002503655,0.8141019,0.009639738,0.1565031,0.001215708,0.01691899],"study_design_scores_gemma":[0.00001991055,0.00006413122,0.0001010227,0.000006994849,0.00001492472,0.0001531213,0.00003310506,0.9693886,0.001280084,0.02812427,0.0008005269,0.00001336741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1141146,0.000985255,0.8764383,0.0006537124,0.00005608475,0.00006125366,0.0001041994,0.00008602653,0.007500574],"genre_scores_gemma":[0.9386019,0.001674322,0.05299148,0.0001000804,0.00007759259,0.0001159828,0.00009265332,0.00002221462,0.006323833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002321711,"threshold_uncertainty_score":0.007389605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05556343512317685,"score_gpt":0.304557993301544,"score_spread":0.2489945581783672,"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."}}