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 secrecy rate of interference networks using structured codes"):
  Abstract: This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than randomly generated codebooks for such channels. For a class of interference channels, we show that an equivocation sumrate that is within two bits of the maximum possible legitimate communication sum-rate is achievable using lattice codes.

Includes members:
  Member "providing secrecy with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference")
  Member "two hop secure communication using an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks")
  Member "a layered lattice coding scheme for a class of three user gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "strong interference alignment")
  Member "sum capacity of the gaussian interference channel in the low interference regime":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  Member "the case for structured random codes in network capacity theorems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")
  Member "on the secure degrees of freedom in the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "friendly jamming in a mimo wiretap interference network a nonconvex game approach")
  Member "low density lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "neural fuzzy extractors a secure way to use artificial neural networks for biometric user authentication")

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)