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: "diversity multiplexing gain tradeoff a tool in algebra"
  Abstract: Since the invention of space-time coding numerous algebraic methods have been applied in code design. #R##N#In particular algebraic number theory and central simple algebras have been on the forefront of the research. #R##N#In this paper we are turning the table and asking whether information theory can be used as a tool in algebra. We will first derive some corollaries from diversity-multiplexing gain (DMT) bounds by Zheng and Tse and later show how these results can be used to analyze the unit group of orders of certain division algebras. The authors do not claim that the algebraic results are new, but we do find that this interesting relation between algebra and information theory is quite surprising and worth pointing out.

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"
    - "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"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-2 (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"
    - "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"
    - "maximal orders in the design of dense space time lattice codes"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-3 (induced by source paper "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"):
  with members:
    - "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"
    - "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)