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: "improved transmission strategies for cognitive radio under the coexistence constraint"
  Abstract: In this work, we consider an interference-mitigation based cognitive radio system where a secondary transmitter is to communicate with its corresponding receiver without affecting the communication between a primary transmitter-receiver pair. In this case, the secondary transmitter must satisfy a coexistence constraint which requires that no rate degradation occurs at the primary user (PU), even when the latter utilizes only a single-user decoder. To achieve a non-zero rate of the secondary user (SU) under this constraint, Jovicic and Viswanath previously proposed a scheme (referred to as the JV scheme) that utilizes relaying by the secondary transmitter to overcome the interference caused by the simultaneous transmission of the SU's message. In this case, the interference caused by the signals corresponding to PU's message at the secondary receiver (from both the direct and the relay links) is mitigated by employing dirty paper coding (DPC) at the secondary transmitter. However, the interference caused by the SU's message at the primary receiver is not eliminated in this case and, thus, will limit the power (and, hence, the rate) that can be used by the secondary transmitter to transmit its own message. In our work, the use of clean relaying by the secondary transmitter and/or receiver (i.e., relaying without simultaneous transmission of SU's own message) is proposed to improve the quality of the relayed signal and, thereby, increases the rate achievable by the SU. Two improved transmission schemes are proposed: (i) clean relaying by secondary transmitter (CT) and (ii) clean relaying by secondary transmitter and receiver (CTR). The CT scheme utilizes DPC to mitigate interference at the secondary receiver whereas the CTR scheme utilizes coding for multiple access channels with common messages to enable decoding of both PU's and SU's messages at the secondary receiver. The CT scheme can be viewed as a generalization of the JV scheme and, therefore, performs at least as well as the latter. The CTR scheme, on the other hand, is shown to outperform the CT scheme in terms of the multiplexing gain achievable under full channel state information at the transmitter (CSIT) and in terms of the rate achievable with statistical CSIT. Numerical simulations are provided to illustrate these advantages.

Connected through hyperedge HE-1 (induced by source paper "practical design for multiple antenna cognitive radio networks with coexistence constraint"):
  with members:
    - "cooperative cognitive networks optimal distributed and low complexity algorithms"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "optimal and robust transmit designs for miso channel secrecy by semidefinite programming"
    - "cognitive radio with partial channel state information at the transmitter"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding"
    - "cognitive radio an information theoretic perspective"

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)