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 "an error event sensitive tradeoff between rate and coding gain in mimo mac"):
  Abstract: This paper investigates the design of codes for multiple-input multiple-output (MIMO) multiple access channel (MAC). If a joint maximum-likelihood decoding is to be performed at the receiver, then every MIMO-MAC code can be regarded as a single-user code, where the minimum determinant criterion proposed by Tarokh  et al.  is useful for designing such codes and for upper bounding the maximum pairwise error probability (PEP), whenever the codes are of finite rate and operate in finite signal-to-noise ratio range. Unlike the case of single-user codes where the minimum determinant can be lower bounded by a fixed constant as code-rate grows, it was proved by Lahtonen  et al.  that the minimum determinant of MIMO-MAC codes decays as a function of the rates. This decay phenomenon is further investigated in this paper, and upper bounds for the decays of minimum determinant corresponding to each error event are provided. Lower bounds for the optimal decay are established and are based on an explicit construction of codes using algebraic number theory and Diophantine approximation. For some error profiles, the constructed codes are shown to meet the aforementioned upper bounds, hence they are optimal finite-rate codes in terms of PEPs associated with such error events. An asymptotic diversity-multiplexing gain tradeoff (DMT) analysis of the proposed codes is also given. It is shown that these codes are DMT optimal when the values of multiplexing gains are small.

Includes members:
  Member "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution")
  Member "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution")
  Member "remarks on the criteria of constructing mimo mac dmt optimal codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space time storage codes for wireless distributed storage systems")
  Member "performance of mmse mimo receivers a large n analysis for correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fifty years of mimo detection the road to large scale mimos")
  Member "on the decay of the determinants of multiuser mimo lattice codes":
    also connected through other hyperedges:
      (none)
  Member "distributed space time block codes for the mimo multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  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 "diversity multiplexing tradeoff in selective fading multiple access mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the achievable diversity multiplexing tradeoff in interference 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)