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 "novel subcarrier pair based opportunistic df protocol for cooperative downlink ofdma"):
  Abstract: A novel subcarrier-pair based opportunistic DF protocol is proposed for cooperative downlink OFDMA transmission aided by a decode-and-forward (DF) relay. Specifically, user message bits are transmitted in two consecutive equal-duration time slots. A subcarrier in the first slot can be paired with a subcarrier in the second slot for the DF relay-aided transmission to a user. In particular, the source and the relay can transmit simultaneously to implement beamforming at the subcarrier in the second slot for the relay-aided transmission. Each unpaired subcarrier in either the first or second slot is used by the source for direct transmission to a user without the relay's assistance. The sum rate maximized resource allocation (RA) problem is addressed for this protocol under a total power constraint. It is shown that the novel protocol leads to a maximum sum rate greater than or equal to that for a benchmark one, which does not allow the source to implement beamforming at the subcarrier in the second slot for the relay-aided transmission. Then, a polynomial-complexity RA algorithm is developed to find an (at least approximately) optimum resource allocation (i.e., source/relay power, subcarrier pairing and assignment to users) for either the proposed or benchmark protocol. Numerical experiments illustrate that the novel protocol can lead to a greater sum rate than the benchmark one.

Includes members:
  Member "weighted sum rate maximization for downlink ofdma with subcarrier pair based opportunistic df relaying":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the optimum energy efficiency for flat fading channels with rate dependent circuit power")
  Member "power minimization for ofdm transmission with subcarrier pair based opportunistic df relaying":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted sum rate maximization for downlink ofdma with subcarrier pair based opportunistic df relaying")
  Member "wsr maximized resource allocation in multiple df relays aided ofdma downlink transmission":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient resource allocation for time varying ofdma relay systems with hybrid energy supplies")
  Member "joint subcarrier pairing and power allocation for ofdm transmission with decode and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subcarrier pairing as channel gain tailoring joint resource allocation for relay assisted secure ofdma with untrusted users")
  Member "sum rate maximized resource allocation in multiple df relays aided ofdm transmission":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation for secure gaussian parallel relay channels with finite length coding and discrete constellations")

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)