{"id":"W2061131139","doi":"10.1109/twc.2011.092011.110558","title":"Theoretical Bounds for Minimum Interference in Full Multi-Interface Multi-Channel Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Channel (broadcasting); Interference (communication); Computer science; Wireless; Wireless network; Polynomial; Algorithm; Function (biology); Upper and lower bounds; Interference alignment; Discrete mathematics; Combinatorics; Topology (electrical circuits); Mathematics; Telecommunications; MIMO; Mathematical analysis","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.005262062,0.00207871,0.001859905,0.002960044,0.001612831,0.004568867,0.003833139,0.0018378,0.006923094],"category_scores_gemma":[0.03641947,0.001140354,0.001107325,0.004146208,0.003117562,0.008026172,0.003372036,0.00392632,0.001861751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004397813,"about_ca_system_score_gemma":0.002477194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00173297,"about_ca_topic_score_gemma":0.001700737,"domain_scores_codex":[0.9950206,0.001211412,0.0001705393,0.0005451602,0.002167214,0.0008850313],"domain_scores_gemma":[0.9713908,0.0236472,0.001095006,0.00143209,0.001976156,0.0004587131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002642317,0.0001487699,0.0005860789,0.0005752901,0.00006457375,0.000137593,0.0002719631,0.6178158,0.002638951,0.3142348,0.006738994,0.05652301],"study_design_scores_gemma":[0.0000263992,0.00006960752,0.0002420362,0.0001326679,0.00002910295,0.0001372581,0.00008558532,0.8032228,0.001986753,0.1903478,0.003689834,0.00003020205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01127809,0.002776216,0.9680605,0.0008526111,0.0001011273,0.0000621432,0.0002234235,0.0003556921,0.01629023],"genre_scores_gemma":[0.6538951,0.00957945,0.3260345,0.001100024,0.0007617119,0.001065952,0.0007701361,0.0006455263,0.006147668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006923094,"threshold_uncertainty_score":0.03190851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09028385438033766,"score_gpt":0.3147542187902825,"score_spread":0.2244703644099449,"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."}}