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 for gaussian channels with interference structured codes outperform gaussian signaling"):
  Abstract: In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wiretap channel, the 2-user interference channel with confidential messages, the 2-user interference channel with an external eavesdropper. Best known achievable schemes to date for these channels use Gaussian signaling. In this work, we show that structured codes outperform Gaussian random codes at high SNR when channel gains are real numbers.

Includes members:
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  Member "providing secrecy with structured codes tools and applications to two user gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "providing secrecy with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference")
  Member "k user interference channels achievable secrecy rate and degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the secure degrees of freedom of the k user interference channel with delayed csit")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "a layered lattice coding scheme for a class of three user gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "the case for structured random codes in network capacity theorems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")

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)