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 gain of ell modular lattices"):
  Abstract: We show that for every $\ell>1$, there is a counterexample to the $\ell$-modular secrecy function conjecture by Oggier, Sol\'e and Belfiore. These counterexamples all satisfy the modified conjecture by Ernvall-Hyt\"onen and Sethuraman. Furthermore, we provide a method to prove or disprove the modified conjecture for any given $\ell$-modular lattice rationally equivalent to a suitable amount of copies of $\mathbb{Z}\oplus \sqrt{\ell}\,\mathbb{Z}$ with $\ell \in \{3,5,7,11,23\}$. We also provide a variant of the method for strongly $\ell$-modular lattices when $\ell\in \{6,14,15\}$.

Includes members:
  Member "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achieving secrecy capacity of the gaussian wiretap channel with polar lattices")
  Member "unimodular lattices for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probability estimates for fading and wiretap channels from ideal class zeta functions")
  Member "secrecy gain a wiretap lattice code design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")

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)