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 "joint user scheduling and power optimization in full duplex cells with successive interference cancellation"):
  Abstract: This paper considers a cellular system with a full-duplex base station and half-duplex users. The base station can activate one user in uplink or downlink (half-duplex mode), or two different users one in each direction simultaneously (full-duplex mode). Simultaneous transmissions in uplink and downlink causes self-interference at the base station and uplink-to-downlink interference at the downlink user. Although uplink-to-downlink interference is typically treated as noise, it is shown that successive interference decoding and cancellation (SIC mode) can lead to significant improvement in network utility, especially when user distribution is concentrated around a few hotspots. The proposed temporal fair user scheduling algorithm and corresponding power optimization utilizes full-duplex and SIC modes as well as half-duplex transmissions based on their impact on network utility. Simulation results reveal that the proposed strategy can achieve up to 95% average cell throughput improvement in typical indoor scenarios with respect to a conventional network in which the base station is half-duplex.

Includes members:
  Member "user selection and power allocation in full duplex multicell networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal centralized dynamic time division duplex")
  Member "joint cell muting and user scheduling in multi cell networks with temporal fairness":
    also connected through other hyperedges:
      (none)
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")

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)