{"id":"W2042494064","doi":"10.1109/isit.2012.6283633","title":"A deterministic approach to random access interference channel","year":2012,"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":"Channel (broadcasting); Interference (communication); Transmission (telecommunications); Throughput; Computer science; Computer network; Interference alignment; Channel capacity; Co-channel interference; Random access; Mathematical optimization; Telecommunications; Topology (electrical circuits); Mathematics; Wireless; MIMO; 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.00129988,0.001178705,0.001125285,0.00102801,0.0008224769,0.001875241,0.002178481,0.001460187,0.004541619],"category_scores_gemma":[0.004273821,0.0006307067,0.0009311271,0.001349934,0.001582838,0.002021088,0.001131453,0.002060614,0.001492515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001761227,"about_ca_system_score_gemma":0.0017746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002817962,"about_ca_topic_score_gemma":0.002624159,"domain_scores_codex":[0.9975652,0.0008733109,0.00007514426,0.0003665824,0.0008094904,0.0003103578],"domain_scores_gemma":[0.9974867,0.001391539,0.0002836049,0.0003406688,0.0004272151,0.00007018221],"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.00002956132,0.00002953633,0.0001920136,0.0000951241,0.00003137234,0.0001950705,0.00006777957,0.2086097,0.00125752,0.7774748,0.002699416,0.009318017],"study_design_scores_gemma":[0.00001558156,0.00004269256,0.000100787,0.00002789202,0.00002303983,0.0002116698,0.00002461725,0.7960885,0.0006889504,0.19398,0.008753691,0.00004260373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002813738,0.0009520844,0.976992,0.0005599073,0.0001985575,0.00005339345,0.0001796548,0.0001518478,0.01809889],"genre_scores_gemma":[0.6801904,0.008039469,0.2688994,0.001110377,0.001335951,0.0008048229,0.0004187417,0.0001891026,0.03901167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004541619,"threshold_uncertainty_score":0.01519316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1260835179978463,"score_gpt":0.3366878119550603,"score_spread":0.2106042939572139,"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."}}