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: "on the performance of mrc receiver with unknown timing mismatch a large scale analysis"
  Abstract: There has been extensive research on large scale multi-user multiple-input multiple-output (MU-MIMO) systems recently. Researchers have shown that there are great opportunities in this area, however, there are many obstacles in the way to achieve full potential of using large number of receive antennas. One of the main issues, which will be investigated thoroughly in this paper, is timing asynchrony among signals of different users. Most of the works in the literature, assume that received signals are perfectly aligned which is not practical. We show that, neglecting the asynchrony can significantly degrade the performance of existing designs, particularly maximum ratio combining (MRC). We quantify the uplink achievable rates obtained by MRC receiver with perfect channel state information (CSI) and imperfect CSI while the system is impaired by unknown time delays among received signals. We then use these results to design new algorithms in order to alleviate the effects of timing mismatch. We also analyze the performance of introduced receiver design, which is called MRC-ZF, with perfect and imperfect CSI. For performing MRC-ZF, the only required information is the distribution of timing mismatch which circumvents the necessity of time delay acquisition or synchronization. To verify our analytical results, we present extensive simulation results which thoroughly investigate the performance of the traditional MRC receiver and the introduced MRC-ZF receiver.

Connected through hyperedge HE-1 (induced by source paper "a new codebook design for analog beamforming in millimeter wave communication"):
  with members:
    - "investigating robustness and interpretability of link prediction via adversarial modifications"
    - "partition pruning parallelization aware pruning for deep neural networks"
    - "age of information in multiple sensing"
    - "on the age of information in erasure channels with feedback"
    - "generating user friendly explanations for loan denials using gans"
    - "hybrid precoder and combiner design with low resolution phase shifters in mmwave mimo systems"
    - "embedding multimodal relational data for knowledge base completion"
    - "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems"

Connected through hyperedge HE-2 (induced by source paper "novel time asynchronous noma schemes for downlink transmissions"):
  with members:
    - "interference mitigation using asynchronous transmission and sampling diversity"
    - "the application of mimo to non orthogonal multiple access"
    - "asynchronous orthogonal differential decoding for multiple access 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)