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: "an algebraic look into mac dmt of lattice space time codes"
  Abstract: In this paper we are concentrating on the diversity-multiplexing gain trade-off (DMT) of some space-time lattice codes. First we give a DMT bound for lattice codes having restricted dimension. We then recover the well known results of the DMT of algebraic number field codes and the Alamouti code by using the union bound and see that these codes do achieve the previously mentioned bound. During our analysis interesting connections to the Dedekind's zeta-function and to the unit group of algebraic number fields are revealed. Finally we prove that both the number field codes and Alamouti code are in some sense optimal codes in the multiple access channel (MAC).

Connected through hyperedge HE-1 (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 error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-2 (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 error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-3 (induced by source paper "inverse determinant sums and connections between fading channel information theory and algebra"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "diversity multiplexing gain tradeoff a tool in algebra"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "maximal orders in the design of dense space time lattice codes"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-4 (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"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

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)