{"id":"W2803323405","doi":"10.1109/tvt.2018.2839352","title":"Directed-Hypergraph-Based Channel Allocation for Ultradense Cloud D2D Communications With Asymmetric Interference","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Hypergraph; Computer science; Potential game; Interference (communication); Channel allocation schemes; Channel (broadcasting); Nash equilibrium; Context (archaeology); Cloud computing; Distributed computing; Mathematical optimization; Computer network; Theoretical computer science; Wireless; Mathematics; Telecommunications; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008431156,0.0002320499,0.0002315074,0.0009675148,0.0002561759,0.0000190241,0.0004032803,0.0002918045,0.000005407604],"category_scores_gemma":[0.000009898436,0.0002331511,0.00006758275,0.001740842,0.0002912251,0.0001175979,0.000001532072,0.0003082269,0.00002834787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001348483,"about_ca_system_score_gemma":0.00002826398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009649564,"about_ca_topic_score_gemma":0.0001620892,"domain_scores_codex":[0.9990104,0.00003270458,0.000279874,0.0002940927,0.00009476717,0.000288184],"domain_scores_gemma":[0.9985231,0.0001078488,0.00006858031,0.0009510589,0.0002976749,0.00005177193],"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.0001860043,0.0005239492,0.0000277877,0.0001906748,0.0004058521,0.000003968924,0.0003579088,0.8847196,0.04514636,0.0009499336,0.0003233523,0.06716461],"study_design_scores_gemma":[0.0008154506,0.0005011868,0.00000470676,0.0001127886,0.00007761289,0.0000257062,0.0001245162,0.7564694,0.2403698,0.000218479,0.0009737969,0.0003065799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004704486,0.0001771707,0.9910936,0.0005600703,0.0004120412,0.0007233575,0.00003852723,0.002153701,0.0001369886],"genre_scores_gemma":[0.9575567,0.00009323999,0.04141884,0.00004098814,0.00003551623,0.0007215135,0.00002424046,0.00007182632,0.00003715909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9528522,"threshold_uncertainty_score":0.9507625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01261474978366775,"score_gpt":0.229713355189824,"score_spread":0.2170986054061562,"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."}}