human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "unimodular lattices for the gaussian wiretap channel"
  Abstract: In a recent paper, the authors introduced a lattice invariant called "Secrecy Gain" which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for unimodular lattices by using tools from Modular Forms and show that, for some families of unimodular lattices, indexed by the dimension, the secrecy gain exponentially goes to infinity with the dimension.

Connected through hyperedge HE-1 (induced by source paper "on the secrecy gain of ell modular lattices"):
  with members:
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-2 (induced by source paper "probability estimates for fading and wiretap channels from ideal class zeta functions"):
  with members:
    - "nonasymptotic probability bounds for fading channels exploiting dedekind zeta functions"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "diversity multiplexing gain tradeoff a tool in algebra"
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "an algebraic look into mac dmt of lattice space time codes"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-3 (induced by source paper "nonasymptotic probability bounds for fading channels exploiting dedekind zeta functions"):
  with members:
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "an algebraic look into mac dmt of lattice space time codes"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-4 (induced by source paper "some results related to the conjecture by belfiore and sol e"):
  with members:
    - "lattice codes for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-5 (induced by source paper "lattice codes for the gaussian wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels"
    - "secrecy gain a wiretap lattice code design"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "on wiretap networks ii"
    - "golden space time trellis coded modulation"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"):
  with members:
    - "diversity multiplexing gain tradeoff a tool in algebra"
    - "on a conjecture by belfiore and sol e on some lattices"
    - "an algebraic look into mac dmt of lattice space time codes"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-7 (induced by source paper "on a conjecture by belfiore and sol e on some lattices"):
  with members:
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-8 (induced by source paper "lattice code design for the rayleigh fading wiretap channel"):
  with members:
    - "secrecy gain a wiretap lattice code design"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "on wiretap networks ii"
    - "applications of ldpc codes to the wiretap channel"

Question: Please tell me which class the center node 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)