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: "capacity region bounds and resource allocation for two way ofdm relay channels"
  Abstract: In this paper, we consider two-way orthogonal frequency division multiplexing (OFDM) relay channels, where the direct link between the two terminal nodes is too weak to be used for data transmission. The widely known per-subcarrier decode-and-forward (DF) relay strategy, treats each subcarrier as a separate channel, and performs independent channel coding over each subcarrier. We show that this per-subcarrier DF relay strategy is only a suboptimal DF relay strategy, and present a multi-subcarrier DF relay strategy which utilizes cross-subcarrier channel coding to achieve a larger rate region. We then propose an optimal resource allocation algorithm to characterize the achievable rate region of the multi-subcarrier DF relay strategy. The computational complexity of this algorithm is much smaller than that of standard Lagrangian duality optimization algorithms. We further analyze the asymptotic performance of two-way relay strategies including the above two DF relay strategies and an amplify-and-forward (AF) relay strategy. The analysis shows that the multi-subcarrier DF relay strategy tends to achieve the capacity region of the two-way OFDM relay channels in the low signal-to-noise ratio (SNR) regime, while the AF relay strategy tends to achieve the multiplexing gain region of the two-way OFDM relay channels in the high SNR regime. Numerical results are provided to justify all the analytical results and the efficacy of the proposed optimal resource allocation algorithm.

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)