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: "multi stream opportunistic network decoupling relay selection and interference management"
  Abstract: We study multi-stream transmission in the $K \times N \times K$ channel with interfering relay nodes, consisting of $K$ multi-antenna source--destination (S--D) pairs and $N$ single-antenna half-duplex relay nodes between the S--D pairs. We propose a new achievable scheme operating with partial effective channel gain, termed multi-stream opportunistic network decoupling (MS-OND), which achieves the optimal degrees of freedom (DoF) under a certain relay scaling law. Our protocol is built upon the conventional OND that leads to virtual full-duplex mode with one data stream transmission per S--D pair, generalizing the idea of OND to multi-stream scenarios by leveraging relay selection and interference management. Specifically, two subsets of relay nodes are opportunistically selected using alternate relaying in terms of producing or receiving the minimum total interference level. For interference management, each source node sends $S \,(1 \le S \le M)$ data streams to selected relay nodes with random beamforming for the first hop, while each destination node receives its desired $S$ streams from the selected relay nodes via opportunistic interference alignment for the second hop, where $M$ is the number of antennas at each source or destination node. Our analytical results are validated by numerical evaluation.

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)