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: "treating interference as noise in cellular networks a stochastic geometry approach"
  Abstract: The interference management technique that treats interference as noise (TIN) is optimal when the interference is sufficiently low. Scheduling algorithms based on the TIN optimality condition have recently been proposed, e.g., for application to device-to-device communications. TIN, however, has never been applied to cellular networks. In this work, we propose a scheduling algorithm for application to cellular networks that is based on the TIN optimality condition. In the proposed scheduling algorithm, each base station (BS) first randomly selects a user equipment (UE) in its coverage region, and then checks the TIN optimality conditions. If the latter conditions are not fulfilled, the BS is turned off. In order to assess the performance of TIN applied to cellular networks, we introduce an analytical framework with the aid of stochastic geometry theory. We develop, in particular, tractable expressions of the signal-to-interference-and-noise ratio (SINR) coverage probability and average rate of cellular networks. In addition, we carry out asymptotic analysis to find the optimal system parameters that maximize the SINR coverage probability. By using the optimized system parameters, it is shown that TIN applied to cellular networks yields significant gains in terms of SINR coverage probability and average rate. Specifically, the numerical results show that average rate gains of the order of $21\%$ over conventional scheduling algorithms are obtained.

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)