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 k user gaussian interference channels a unified view"):
  Abstract: We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user interference channel with confidential messages (IC-CM), and 3) K-user interference channel with confidential messages and one external eavesdropper (IC-CM-EE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K-1)/(2K-1). We show converses for IC-EE and IC-CM, which imply a converse for IC-CM-EE. We show achievability for IC-CM-EE, which implies achievability for IC-EE and IC-CM. We develop the converses by relating the channel inputs of interfering users to the reliable rates of the interfered users, and by quantifying the secrecy penalty in terms of the eavesdroppers' observations. Our achievability uses structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller sub-space at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.

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 "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  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 "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")

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)