human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "optimal power allocation for two way decode and forward ofdm relay networks"):
  Abstract: This paper presents a novel two-way decode-and-forward (DF) relay strategy for Orthogonal Frequency Division Multiplexing (OFDM) relay networks. This DF relay strategy employs multi-subcarrier joint channel coding to leverage frequency selective fading, and thus can achieve a higher data rate than the conventional per-subcarrier DF relay strategies. We further propose a low-complexity, optimal power allocation strategy to maximize the data rate of the proposed relay strategy. Simulation results suggest that our strategy obtains a substantial gain over the per-subcarrier DF relay strategies, and also outperforms the amplify-and-forward (AF) relay strategy in a wide signal-to-noise-ratio (SNR) region.

Includes members:
  Member "optimal real time spectrum sharing between cooperative relay and ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity region bounds and resource allocation for two way ofdm relay channels")
  Member "joint subcarrier pairing and power allocation for ofdm transmission with decode and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subcarrier pairing as channel gain tailoring joint resource allocation for relay assisted secure ofdma with untrusted users")
  Member "resource allocation for wireless fading relay channels max min solution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")

Question: Please tell me which class the source paper 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)