{"id":"W2113141637","doi":"10.1109/ciss.2011.5766167","title":"On linear processing for dual-hop multi-channel relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Pairing; Relay; Channel (broadcasting); Maximization; Permutation (music); Computer science; Permutation matrix; Relay channel; Topology (electrical circuits); Path (computing); Algorithm; Mathematics; Mathematical optimization; Power (physics); Telecommunications; Computer network; Physics; 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.0009484934,0.0008735058,0.0005779546,0.0004469706,0.000410388,0.001139774,0.0005482339,0.0008974707,0.00193501],"category_scores_gemma":[0.001801188,0.0003321546,0.0005960697,0.0007201778,0.00122947,0.001450344,0.0009773802,0.00117737,0.0005289594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009718118,"about_ca_system_score_gemma":0.0006244301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008874362,"about_ca_topic_score_gemma":0.0007657172,"domain_scores_codex":[0.9992843,0.0003301856,0.0000242599,0.00009940763,0.0001684295,0.00009339026],"domain_scores_gemma":[0.9990886,0.0006085111,0.00007639273,0.0000683378,0.000136019,0.00002218574],"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.00007939673,0.00006581122,0.0002659875,0.0002020649,0.00004057752,0.0004589907,0.0002050808,0.6308359,0.0083989,0.3396955,0.001265411,0.01848637],"study_design_scores_gemma":[0.0000070333,0.00007104221,0.00007434978,0.00001696305,0.00001238027,0.00009441095,0.00003014906,0.9350783,0.001345,0.06205196,0.001201709,0.00001667417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0186207,0.001421121,0.9643542,0.0004432964,0.00008736541,0.00004205007,0.00004625927,0.00004984567,0.01493518],"genre_scores_gemma":[0.8683971,0.004256046,0.1159721,0.0003667547,0.000360028,0.0001914826,0.00009560768,0.00006085093,0.0103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00193501,"threshold_uncertainty_score":0.007050991,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1756022395484777,"score_gpt":0.3270017334281078,"score_spread":0.1513994938796301,"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."}}