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: "performance evaluation for the co existence of embb and urllc networks synchronized versus unsynchronized tdd"
  Abstract: To ensure the high level of automation required in today's industrial applications, next-generation wireless networks must enable real-time control and automation of dynamic processes with the requirements of extreme low-latency and ultra-reliable communications. In this paper, we provide a performance assessment for the co-existence of a macro (eMBB) and a local factory (URLLC) network and evaluate the network conditions under which the latency and reliability requirements of factory automation applications are met. In particular, we evaluate the co-existence of the eMBB and URLLC networks under two scenarios: (i) synchronized TDD, in which both networks follow the same TDD pattern, and (ii) unsynchronized TDD, in which the eMBB and URLLC networks follow different TDD patterns. Simulation results show that the high downlink interference from the macro base stations towards the factory results in a reduction of the downlink URLLC capacity and service availability in case of synchronized TDD and a reduction of the uplink URLLC capacity and service availability in case of unsynchronized TDD. Finally, it is shown that a promising case for co-existence is the adjacent channel allocation, for both synchronized and unsynchronized TDD deployments. Here, the required isolation to protect the URLLC network in the worst-case scenario where the factory is located next to a macro site can be handled via the factory wall penetration loss (e.g., considering high concrete or metal-coated building walls) along with other solutions such as filters, larger separation distance, and band pairing.

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)