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 "generalized interference alignment part ii application to wireless secrecy"):
  Abstract: In contrast to its wired counterpart, wireless communication is highly susceptible to eavesdropping due to the broadcast nature of the wireless propagation medium. Recent works have proposed the use of interference to reduce eavesdropping capabilities in wireless wiretap networks. However, the concurrent effect of interference on both eavesdropping receivers (ERs) and legitimate receivers has not been thoroughly investigated, and careful engineering of the network interference is required to harness the full potential of interference for wireless secrecy. This two-part article addresses this issue by proposing a generalized interference alignment (GIA) technique, which jointly designs the transceivers at the legitimate partners to impede the ERs without interfering with LRs. In Part I, we have established a theoretical framework for the GIA technique. In Part II, we will first propose an efficient GIA algorithm that is applicable to large-scale networks and then evaluate the performance of this algorithm in stochastic wireless wiretap network via both analysis and simulation. These results reveal insights into when and how GIA contributes to wireless secrecy.

Includes members:
  Member "the feasibility conditions for interference alignment in mimo networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "topological interference management with user admission control via riemannian optimization")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "interference assisted secret communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "jammer assisted resource allocation in secure ofdma with untrusted users")
  Member "on cooperative relaying schemes for wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "cooperative jamming for secure communications in mimo relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna jamming in covert communication")
  Member "outage probability of general ad hoc networks in the high reliability regime":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure transmission in linear multihop relaying networks")
  Member "ergodic secret alignment":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure retrospective interference alignment")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")

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)