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: "performance analysis of multiple antenna multi user detection"
  Abstract: We derive the diversity order of some multiple antenna multi-user cancellation and detection schemes. The common property of these detection methods is the usage of Alamouti and quasi-orthogonal space-time block codes. For detecting $J$ users each having $N$ transmit antennas, these schemes require only $J$ antennas at the receiver. Our analysis shows that when having $M$ receive antennas, the array-processing schemes provide the diversity order of $N(M-J+1)$. In addition, our results prove that regardless of the number of users or receive antennas, when using maximum-likelihood decoding we get the full transmit and receive diversities, i.e. $NM$, similar to the no-interference scenario.

Connected through hyperedge HE-1 (induced by source paper "on designs of full diversity space time block codes for two user mimo interference channels"):
  with members:
    - "high rate and full diversity space time block codes with low complexity partial interference cancellation group decoding"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "full diversity codes for miso systems equipped with linear or ml detectors"
    - "on full diversity space time block codes with partial interference cancellation group decoding"

Connected through hyperedge HE-2 (induced by source paper "interference cancellation at the relay for multi user wireless cooperative networks"):
  with members:
    - "multi user transmissions for relay networks with linear complexity"
    - "power bandwidth tradeoff in dense multi antenna relay networks"

Connected through hyperedge HE-3 (induced by source paper "multisource transmission for wireless relay networks with linear complexity"):
  with members:
    - "interference cancellation at the relay for multi user wireless cooperative networks"
    - "power bandwidth tradeoff in dense multi antenna relay networks"

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)