human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "performance evaluation of user scheduling for full duplex small cells in ultra dense networks"
  Abstract: Full-duplex (FD) communication is an emerging technology that can potentially double the throughput of cellular networks. Preliminary studies in single-cell or small FD network deployments have revealed promising rate gains using selfinterference cancellation (SIC) techniques and receive processing. Nevertheless, the system-level performance gains of FD small cells in ultra-dense networks (UDNs) have not been fully investigated yet. In this paper, we evaluate the performance of resource allocation in ultra-dense FD small-cell networks using spatial stochastic models for the network layout and 3GPP channel models. More specifically, we consider various UDN scenarios and assess the performance of different low-complexity userscheduling schemes and power allocation between uplink and downlink. We also provide useful insights into the effect of the SIC capability on the network throughput.

Connected through hyperedge HE-1 (induced by source paper "low complexity full duplex mimo novel analog cancellation architectures and transceiver design"):
  with members:
    - "joint design of multi tap analog cancellation and digital beamforming for reduced complexity full duplex mimo systems"
    - "user scheduling and optimal power allocation for full duplex cellular networks"
    - "optimal low complexity self interference cancellation for full duplex mimo small cells"
    - "softnull many antenna full duplex wireless via digital beamforming"
    - "hybrid beamforming for massive mimo a survey"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-2 (induced by source paper "resource allocation in heterogenous full duplex ofdma networks design and analysis"):
  with members:
    - "resource allocation in ofdma networks with half duplex and imperfect full duplex users"
    - "all digital self interference cancellation technique for full duplex systems"
    - "analog baseband cancellation for full duplex an experiment driven analysis"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-3 (induced by source paper "resource optimization and power allocation in in band full duplex ibfd enabled non orthogonal multiple access networks"):
  with members:
    - "user selection and power allocation in full duplex multicell networks"
    - "sub channel assignment power allocation and user scheduling for non orthogonal multiple access networks"
    - "a survey of downlink non orthogonal multiple access for 5g wireless communication networks"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "resource allocation in ofdma networks with half duplex and imperfect full duplex users"
    - "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems"
    - "matching theory for future wireless networks fundamentals and applications"
    - "hybrid full half duplex system analysis in heterogeneous wireless networks"

Connected through hyperedge HE-4 (induced by source paper "user scheduling and optimal power allocation for full duplex cellular networks"):
  with members:
    - "full duplex mimo small cell networks performance analysis"
    - "experiment driven characterization of full duplex wireless systems"

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