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: "mobile jammers for secrecy rate maximization in cooperative networks"
  Abstract: We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by multiple multi-antenna cooperating nodes (helpers) who have the ability to move. While Alice transmits, the helpers transmit noise that is designed to affect the entire space except Bob. We consider the problem of selecting the helper weights and positions that maximize the system secrecy rate. It turns out that this optimization problem can be efficiently solved, leading to a novel decentralized helper motion control scheme. Simulations indicate that introducing helper mobility leads to considerable savings in terms of helper transmit power, as well as total number of helpers required for secrecy communications.

Connected through hyperedge HE-1 (induced by source paper "improving wireless physical layer security via exploiting co channel interference"):
  with members:
    - "joint power control in wiretap interference channels"
    - "secrecy transmit beamforming for heterogeneous networks"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law"
    - "mimo interference alignment over correlated channels with imperfect csi"
    - "interference alignment for secrecy"
    - "on cooperative relaying schemes for wireless physical layer security"

Connected through hyperedge HE-2 (induced by source paper "mobile beamforming spatially controlled relay communications"):
  with members:
    - "cooperative transmission for relay networks based on second order statistics of channel state information"
    - "network beamforming using relays with perfect channel information"

Connected through hyperedge HE-3 (induced by source paper "on the secrecy capacity of a mimo gaussian wiretap channel with a cooperative jammer"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law"
    - "on cooperative relaying schemes for wireless physical layer security"
    - "solutions for the mimo gaussian wiretap channel with a cooperative jammer"
    - "the secrecy capacity of the mimo wiretap channel"

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)