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 "shifted inverse determinant sums and new bounds for the dmt of space time lattice codes"):
  Abstract: This paper considers shifted inverse determinant sums arising from the union bound of the pairwise error probability for space-time codes in multiple-antenna fading channels. Previous work by Vehkalahti et al. focused on the approximation of these sums for low multiplexing gains, providing a complete classification of the inverse determinant sums as a function of constellation size for the most well-known algebraic space-time codes. This work aims at building a general framework for the study of the shifted sums for all multiplexing gains. New bounds obtained using dyadic summing techniques suggest that the behavior of the shifted sums does characterize many properties of a lattice code such as the diversity-multiplexing gain trade-off, both under maximum-likelihood decoding and infinite lattice naive decoding. Moreover, these bounds allow to characterize the signal-to-noise ratio thresholds corresponding to different diversity gains.

Includes members:
  Member "a new design criterion for spherically shaped division algebra based space time codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a non commutative analogue of the odlyzko bounds and bounds on performance for space time lattice codes")
  Member "inverse determinant sums and connections between fading channel information theory and algebra":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the dmt classification of real and quaternionic lattice codes")
  Member "an error probability approach to mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "on the limitations of the naive lattice decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)