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 "achievable sum rates of half and full duplex bidirectional ofdm communication links"):
  Abstract: While full-duplex (FD) transmission has the potential to double system capacity, its substantial benefit can be offset by the self-interference and nonideality of practical transceivers. In this paper, we investigate the achievable sum rates (ASRs) of half-duplex (HD) and FD transmissions with orthogonal frequency-division multiplexing, where nonideality is taken into consideration. Four transmission strategies are considered, namely, HD with uniform power allocation (UPA), HD with non-UPA (NUPA), FD with UPA, and FD with NUPA. For each of the four transmission strategies, an optimization problem is formulated to maximize its ASR, and a (suboptimal/optimal) solution with low complexity is accordingly derived. Performance evaluations and comparisons are conducted for three typical channels, namely, symmetric frequency-flat/selective and asymmetric frequency-selective channels. Results show that the proposed solutions for both HD and FD transmissions can achieve near-optimal performances. For FD transmissions, the optimal solution can be obtained under typical conditions. In addition, several observations are made on the ASR performances of HD and FD transmissions.

Includes members:
  Member "optimal signaling of miso full duplex two way wireless channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "signaling design of two way mimo full duplex channel optimality under imperfect transmit front end chain")
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "rate gain region and design tradeoffs for full duplex wireless communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on low latency towards 5g ran core network and caching solutions")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "understanding the impact of phase noise on active cancellation in wireless full duplex":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "full duplex bidirectional mimo achievable rates under limited dynamic range":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")

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)