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 "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"):
  Abstract: We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI at the transmitters was found in [1], [2] to be M/(M+1). One of the key ingredients of the optimal achievable scheme in [1], [2] is to align cooperative jamming signals with the information symbols at the eavesdropper to limit the information leakage rate. This required perfect eavesdropper CSI at the transmitters. Motivated by the recent result in [3], we propose a new achievable scheme in which cooperative jamming signals span the entire space of the eavesdropper, but are not exactly aligned with the information symbols. We show that this scheme achieves the same secure d.o.f. of M/(M+1) in [1], [2] but does not require any eavesdropper CSI; the transmitters blindly cooperative jam the eavesdropper.

Includes members:
  Member "secure degrees of freedom of one hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "artificial noise alignment for secure multicast using multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "blind mimome wiretap channel with delayed csit")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "on the secure degrees of freedom of the multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "ergodic secret alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure retrospective interference alignment")
  Member "real interference alignment with real numbers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")
  Member "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "preserving confidentiality in the gaussian broadcast channel using compute and forward")

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)