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: "integer forcing and forward transceiver design for mimo multipair two way relaying"
  Abstract: In this paper, we propose a new transmission scheme, called integer forcing-and-forward (IFF), for communications among multipair multiple-antenna users in which each pair exchanges their messages with the help of a single multiple-antenna relay in the multiple-access and broadcast phases. The proposed scheme utilizes integer forcing linear receiver (IFLR) at the relay, which uses equations, i.e., linear integer combinations of messages, to harness intrapair interference. Accordingly, we propose the design of a mean square error (MSE)-based transceiver, including precoder and projection matrices for the relay and users, assuming that perfect channel state information (CSI) is available. In this regard, in the multiple-access phase, we introduce two new MSE criteria for the related precoding and filter designs, i.e., the sum of the equations MSE (Sum-Equation MSE) and the maximum of the equations MSE (Max-Equation MSE), to exploit the equations in the relay. In addition, the convergence of the proposed criteria is proven as well. Moreover, in the broadcast phase, we use the two traditional MSE criteria, i.e., the sum of the users% mean square errors (Sum MSE) and the maximum of the users% mean square errors (Max MSE), to design the related precoding and filters for recovering the relay%s equations by the users. Then, we consider a more practical scenario with imperfect CSI. For this case, the IFLR receiver is modified, and another transceiver design is proposed, which takes into account the effect of channel estimation error. We evaluate the performance of our proposed strategy and compare the results with the conventional amplify-and-forward (AF) and denoise-and-forward (DF) strategies for the same scenario. The results indicate the substantial superiority of the proposed strategy in terms of outage probability and sum rate.

Connected through hyperedge HE-1 (induced by source paper "integer forcing message recovering in interference channels"):
  with members:
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "simplified compute and forward and its performance analysis"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

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)