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: "stability analysis of tdd networks revisited a trade off between complexity and precision"
  Abstract: In this paper, we revisit the stability region of a cellular time division duplex (TDD) network. We characterize the queuing stability region of a network model that consists of two types of communications: (i) users communicating with the base station and (ii) users communicating with each other by passing through the base station. When a communication passes through the base station (BS) then a packet cannot be delivered to the destination UE until it is first received by the BS queue from the source UE. Due to the relaying functionality at the BS level, a coupling is created between the queues of the source users and the BS queues. In addition, contrarily to the majority of the existing works where an ON/OFF model of transmission is considered, we assume a link adaptation model (i.e. multiple rate model) where the bit rate of a link depends on its radio conditions. The coupling between the queues as well as the multiple rate model are the main challenges that highly increase the complexity of the stability region characterization. In this paper, we propose a simple approach that permits to overcome these challenges and to provide a full characterization of the exact stability region as a convex polytope with a finite number of vertices. An approximated model is proposed for reducing the computational complexity of the exact stability region. For the multi-user scenario, a trade-off is established between the complexity and the preciseness of the approximated stability region compared to the exact one. Furthermore, numerical results are presented to corroborate our claims.

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)