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 "capacity analysis for full duplex self backhauled small cells"):
  Abstract: Full duplex (FD) communication enables simultaneous transmission and reception on the same frequency band. Though it has the potential of doubling the throughput on isolated links, in reality, higher interference and asymmetric traffic demands in the uplink and downlink could significantly reduce the gains of FD operations. In this paper, we consider the application of FD operation in self-backhauled small cells, where multiple FD capable small cell base stations (SBS) are wirelessly backhauled by a FD capable macro-cell BS (MBS). To increase the capacity of the backhaul link, the MBS is equipped with multiple antennas to enable space division multiple access (SDMA). A scheduling method using back-pressure algorithm and geometric programming is proposed for link selection and interference mitigation. Simulation results show that with FD SDMA backhaul links, the proposed scheduler almost doubles throughput under asymmetric traffic demand and various network conditions.

Includes members:
  Member "exploiting full half duplex user relaying in noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "scheduling and power allocation in self backhauled full duplex small cells":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integrated access and backhaul optimization for millimeter wave heterogeneous networks")
  Member "full duplex multi antenna relay assisted cooperative non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "outage analysis of cooperative noma using maximum ratio combining at intersections")
  Member "joint beamforming design and power allocation for full duplex noma cognitive relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "antenna selection in full duplex cooperative noma systems")
  Member "joint backhaul access analysis of full duplex self backhauling heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "sum rate analysis and optimization of self backhauling based full duplex radio access system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "environment aware minimum cost wireless backhaul network planning with full duplex links")
  Member "analysis of massive mimo enabled downlink wireless backhauling for full duplex small cells":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "optimal multiuser transmit beamforming a difficult problem with a simple solution structure":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "massive mimo has unlimited capacity")

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.NI(Networking and Internet Architecture)