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 "full duplex heterogeneous networks with decoupled user association rate analysis and traffic scheduling"):
  Abstract: Full-duplex (FD) transmission in a point-to-point (P2P) link, wherein bidirectional traffic flows simultaneously share the same spectrum, has the capability of doubling the link rate by completely removing self-interferences. However, the rate gain of FD transmission in an interference-limited network is not as clear as a P2P link due to the interferences induced by complex FD and half-duplex (HD) transmission behaviors in the network. To thoroughly investigate the achievable link rates of users and base stations (BSs) in a heterogeneous network (HetNet) with decoupled user association, a general approach is proposed to model a HetNet in which all BSs and users can perform HD or FD transmission depending on their traffic patterns. We first characterize the decoupled rate-optimal user association scheme and use it to define the downlink and uplink rates in the HetNet. The tight lower bounds on the link rates of the FD users and BSs are found in a neat form that characterizes general channel fading, user and BS intensities and imperfect self-interference cancellation. These bounds outline the rate regions of the FD users that inspire proposing the opportunistic FD scheduling algorithms maximizing the sum rate of each bidirectional traffic and stabilize each of the queues in the HetNet.

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 "downlink and uplink decoupling in two tier heterogeneous networks with multi antenna base stations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "treating interference as noise in cellular networks a stochastic geometry approach")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "fundamentals of the downlink green coverage and energy efficiency in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "modeling and performance analysis in cache enabled millimeter wave hetnets with access and backhaul integration")
  Member "traffic management for heterogeneous networks with opportunistic unlicensed spectrum sharing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "smart contract based secure spectrum sharing in multi operators wireless communication networks")
  Member "full duplex mimo small cell networks with interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "on the limits of coexisting coverage and capacity in multi rat heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamentals of simultaneous wireless information and power transmission in heterogeneous networks a cell load perspective")
  Member "random cell association and void probability in poisson distributed cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mmwave uav networks with multi cell association performance limit and optimization")

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)