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: "technical report on optimal link scheduling in millimeter wave multi hop networks with space division multiple access and multiplexing"
  Abstract: In this paper we study the maximum throughput achievable with optimal scheduling in multi-hop networks with highly directive antenna arrays capable of Space Division Multiplexing (SDM) at the transmitter and Space Division Multiple Access (SDMA) at the receiver. This network model is relevant for future millimeter wave (mmWave) systems, which are expected to implement self-backhauled cellular networks with very high data rates, relying on carrier frequencies between 10-300 GHz, channels with a very large bandwidth, and a large number of antenna elements, even in mobile devices. #R##N#We adapt mmWave channel propagation, antenna array and link rate models to the classic throughput-optimality and Network Utility Maximization (NUM) scheduling framework for multi-hop networks. Directional antenna gains, transmission towards multiple destinations at once, and simultaneous reception of signals from multiple sources, are all new characteristics not featured in the existing NUM literature. We verify that the classic NUM convergence lemmas are still valid under this new set of constraints, and discuss a series of algorithms to achieve or approximate the performance of the optimal Maximum Back Pressure (MBP) solution. Finally, our analysis serves as an estimation of the potential improvement in cellular network throughput capacity due to the integration of SDM/SDMA techniques and multi-hop.

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)