human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "secrecy capacity scaling in large 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$. Finally, we study the improvement (to the detriment of legitimate nodes) the eavesdroppers achieve in terms of the information leakage rate in a large cooperative network in case of collusion. We show that again the zero-cost secure communication is possible, if $n_e^{(2+\frac{2}{\alpha})}(\log n_e)^{\gamma}=o(n_l)$ holds, for some positive $\gamma$; i.e., in case of collusion slightly fewer eavesdroppers can be tolerated compared to the non-colluding case.

Includes members:
  Member "constrained colluding eavesdroppers an information theoretic model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scaling laws for secrecy capacity in cooperative wireless networks")
  Member "scaling laws for secrecy capacity in cooperative wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming")
  Member "multi receiver wiretap channel with public and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint relay selection and power allocation in large scale mimo systems with untrusted relays and passive eavesdroppers")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi antenna jamming in covert communication")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "diversity multiplexing tradeoff for the multiple antenna wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "physical layer security in three tier wireless sensor networks a stochastic geometry approach")

Question: Please tell me which class the source paper 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)