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 "on the secure degrees of freedom of the multiple access channel"):
  Abstract: A $K$-user secure Gaussian Multiple-Access-Channel (MAC) with an external eavesdropper is considered in this paper. An achievable rate region is established for the secure discrete memoryless MAC. The secrecy sum capacity of the degraded Gaussian MIMO MAC is proven using Gaussian codebooks. For the non-degraded Gaussian MIMO MAC, an algorithm inspired by interference alignment technique is proposed to achieve the largest possible total Secure-Degrees-of-Freedom (S-DoF). When all the terminals are equipped with a single antenna, Gaussian codebooks have shown to be inefficient in providing a positive S-DoF. Instead, a novel secure coding scheme is proposed to achieve a positive S-DoF in the single antenna MAC. This scheme converts the single-antenna system into a multiple-dimension system with fractional dimensions. The achievability scheme is based on the alignment of signals into a small sub-space at the eavesdropper, and the simultaneous separation of the signals at the intended receiver. Tools from the field of Diophantine Approximation in number theory are used to analyze the probability of error in the coding scheme. It is proven that the total S-DoF of $\frac{K-1}{K}$ can be achieved for almost all channel gains. For the other channel gains, a multi-layer coding scheme is proposed to achieve a positive S-DoF. As a function of channel gains, therefore, the achievable S-DoF is discontinued.

Includes members:
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "on the secure dof of the single antenna mac":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi antenna jamming in covert communication")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "real interference alignment with real numbers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")
  Member "the secrecy capacity region of the degraded vector gaussian broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure hybrid digital analog coding with side information at the receiver")
  Member "providing secrecy with structured codes tools and applications to two user gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")

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)