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: "scaling laws for secrecy capacity in cooperative wireless networks"
  Abstract: We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a network with $n_l$ legitimate nodes, $n_e$ eavesdroppers, and path loss exponent $\alpha\geq 2$. As long as $n_e^2(\log(n_e))^{\gamma}=o(n_l)$, for some positive $\gamma$, we show one can obtain unbounded secure aggregate rate. This means zero-cost secure communication, given fixed total power constraint for the entire network. We achieve this result through (i) the source using Wyner randomized encoder and a serial (multi-stage) block Markov scheme, to cooperate with the relays and (ii) the relays acting as a virtual multi-antenna to apply beamforming against the eavesdroppers. Our simpler parallel (two-stage) relaying scheme can achieve the same unbounded secure aggregate rate when $n_e^{\frac{\alpha}{2}+1}(\log(n_e))^{\gamma+\delta(\frac{\alpha}{2}+1)}=o(n_l)$ holds, for some positive $\gamma,\delta$.

Connected through hyperedge HE-1 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming"):
  with members:
    - "energy efficient routing in wireless networks in the presence of jamming"
    - "optimal energy and data routing in networks with energy cooperation"
    - "jamming based on an ephemeral key to obtain everlasting security in wireless environments"
    - "secure degrees of freedom of one hop wireless networks"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "efficient wireless security through jamming coding and routing"
    - "everlasting secrecy by exploiting non idealities of the eavesdropper s receiver"
    - "on secrecy capacity scaling in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "secrecy capacity in large cooperative networks in presence of eavesdroppers with unknown locations"):
  with members:
    - "principles of physical layer security in multiuser wireless networks a survey"

Connected through hyperedge HE-3 (induced by source paper "secrecy capacity scaling in large cooperative wireless networks"):
  with members:
    - "constrained colluding eavesdroppers an information theoretic model"
    - "multi receiver wiretap channel with public and confidential messages"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "an overview of the transmission capacity of wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "diversity multiplexing tradeoff for the multiple antenna wire tap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

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)