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 "inverse determinant sums and connections between fading channel information theory and algebra"):
  Abstract: This work considers inverse determinant sums, which arise from the union bound on the error probability, as a tool for designing and analyzing algebraic space-time block codes. A general framework to study these sums is established, and the connection between asymptotic growth of inverse determinant sums and the diversity-multiplexing gain tradeoff is investigated. It is proven that the growth of the inverse determinant sum of a division algebra-based space-time code is completely determined by the growth of the unit group. This reduces the inverse determinant sum analysis to studying certain asymptotic integrals in Lie groups. Using recent methods from ergodic theory, a complete classification of the inverse determinant sums of the most well-known algebraic space-time codes is provided. The approach reveals an interesting and tight relation between diversity-multiplexing gain tradeoff and point counting in Lie groups.

Includes members:
  Member "fast decodable asymmetric space time codes from division algebras":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "diversity multiplexing gain tradeoff a tool in algebra":
    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 "an algebraic look into mac dmt of lattice space time codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probability estimates for fading and wiretap channels from ideal class zeta functions")
  Member "an error probability approach to mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "lattice code design for the rayleigh fading wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "maximal orders in the design of dense space time lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on fast decodable algebraic space time codes")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")

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)