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: "joint transmit precoding for the relay interference broadcast channel"
  Abstract: Relays in cellular systems are interference limited. The highest end-to-end sum rates are achieved when the relays are jointly optimized with the transmit strategy. Unfortunately, interference couples the links together making joint optimization challenging. Further, the end-to-end multi-hop performance is sensitive to rate mismatch, when some links have a dominant first link while others have a dominant second link. This paper proposes an algorithm for designing the linear transmit precoders at the transmitters and relays of the relay interference broadcast channel, a generic model for relay-based cellular systems, to maximize the end-to-end sum-rates. First, the relays are designed to maximize the second-hop sum-rates. Next, approximate end-to-end rates that depend on the time-sharing fraction and the second-hop rates are used to formulate a sum-utility maximization problem for designing the transmitters. This problem is solved by iteratively minimizing the weighted sum of mean square errors. Finally, the norms of the transmit precoders at the transmitters are adjusted to eliminate rate mismatch. The proposed algorithm allows for distributed implementation and has fast convergence. Numerical results show that the proposed algorithm outperforms a reasonable application of single-hop interference management strategies separately on two hops.

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)