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 "k user interference channels achievable secrecy rate and degrees of freedom"):
  Abstract: In this work, we consider achievable secrecy rates for symmetric K-user (K ≥ 3) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels. Achievable secrecy rates are derived for very strong interference. In addition, we derive the secure degrees of freedom for a range of channel parameters. As a by-product of our approach, we also demonstrate that nested lattice codes are useful for K-user symmetric interference channels without secrecy constraints in that they yield higher degrees of freedom than previous results.

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 "the gaussian many to one interference channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  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 "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "capacity of symmetric k user gaussian very strong interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong interference alignment")
  Member "interference alignment on the deterministic channel and application to fully connected awgn interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the feasibility of interference alignment in compounded mimo broadcast channels with antenna correlation and mixed user classes")

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)