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: "distributed space time block codes for the mimo multiple access channel"
  Abstract: In this work, the Multiple transmit antennas Multiple Access Channel is considered. A construction of a family of distributed space-time codes for this channel is proposed. No Channel Side Information at the transmitters is assumed and users are not allowed to cooperate together. It is shown that the proposed code achieves the Diversity Multiplexing Tradeoff of the channel. As an example, we consider the two-user MIMO-MAC channel. Simulation results show the significant gain offered by the new coding scheme compared to an orthogonal transmission scheme, e.g. time sharing.

Connected through hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends"):
  with members:
    - "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "secure massive mimo transmission with an active eavesdropper"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "space time encoded miso broadcast channel with outdated csit an error rate and diversity performance analysis"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "differential distributed space time coding with imperfect synchronization in frequency selective channels"

Connected through hyperedge HE-2 (induced by source paper "an error event sensitive tradeoff between rate and coding gain in mimo mac"):
  with members:
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"
    - "remarks on the criteria of constructing mimo mac dmt optimal codes"
    - "performance of mmse mimo receivers a large n analysis for correlated channels"
    - "on the decay of the determinants of multiuser mimo lattice codes"
    - "maximal orders in the design of dense space time lattice codes"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-3 (induced by source paper "distributed space time codes for the amplify and forward multiple access relay channel"):
  with members:
    - "a case for amplify forward relaying in the block fading multi access channel"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels"

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)