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: "harnessing self interference in full duplex relaying an analog filter and forward approach"
  Abstract: This paper studies a full-duplex filter-and-forward (FD-FF) relay system in frequency-selective channels. Conventionally, the loop-back signal at the FD relay is treated as harmful self-interference and needs to be significantly suppressed via both analog- and digital-domain cancellation. However, the performance of the conventional self-interference cancellation approach is fundamentally limited due to the quantization error induced by the analog-to-digital converter (ADC) with limited dynamic range. In this paper, we consider an analog filter-and-forward design to help avoid the quantization error, and surprisingly show that the maximum achievable rate of such an FD-FF relay system is in fact regardless of the loop-back channel at the FD relay. We characterize the maximum achievable rate of this channel by jointly optimizing the transmit power allocation over frequency at the source and the frequency response of the filter at the relay, subject to their individual power constraints. Although this problem is non-convex, we obtain its optimal solution by applying the Lagrange duality method. By simulations it is shown that the proposed joint source and relay optimization achieves rate gains over other heuristic designs, and is also advantageous over the conventional approach by cancelling the relay loop-back signal as self-interference, especially when the residual self-interference after cancellation is still significant.

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)