human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal link scheduling in millimeter wave multi hop networks with mu mimo radios"
  Abstract: This paper studies the maximum throughput achievable with optimal scheduling in multi-hop mmWave picocellular networks with Multi-user Multiple-Input Multiple-Output (MU-MIMO) radios. MU-MIMO enables simultaneous transmission to multiple receivers (Space Division Multiplexing) and simultaneous reception from multiple transmitters (Space Division Multiple Access). The main contribution is the extension to MU-MIMO of the Network Utility Maximization (NUM) scheduling framework for multi-hop networks. We generalize to MU-MIMO the classic proof that Maximum Back Pressure (MBP) scheduling is NUM optimal. MBP requires the solution of an optimization that becomes harder with MU-MIMO radios. In prior models with one-to-one transmission and reception, each valid schedule was a matching over a graph. However, with MU-MIMO each valid schedule is, instead, a Directed Bipartite SubGraph (DBSG). In the general case this prevents finding efficient algorithms to solve the scheduler. We make MU-MIMO MBP scheduling tractable by assuming fixed power allocation, so the optimal scheduler is the Maximum Weighted DBSG. The MWDBSG problem can be solved using standard Mixed Integer Linear Programing. We simulate multi-hop mmWave picocellular networks and show that a MU-MIMO MBP scheduler enables a 160% increase in network throughput versus the classic one-to-one MBP scheduler, while fair rate allocation mechanisms are used in both cases.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)