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 "environment aware minimum cost wireless backhaul network planning with full duplex links"):
  Abstract: In this work, we address the joint design of the wireless backhauling network topology as well as the frequency/power allocation on the wireless links, where nodes are capable of full-duplex (FD) operation. The proposed joint design enables the coexistence of multiple wireless links at the same channel, resulting in an enhanced spectral efficiency. Moreover, it enables the usage of FD capability when/where it is gainful. In this regard, a mixed-integer-linear-program (MILP) is proposed, aiming at a minimum cost design for the wireless backhaul network, considering the required rate demand at each base station. Moreover, a re-tunning algorithm is proposed which reacts to the slight changes in the network condition, e.g., channel attenuation or rate demand, by adjusting the transmit power at the wireless links. In this regard, a successive inner approximation (SIA)- based design is proposed, where in each step a convex subproblem is solved. Numerical simulations show a reduction in the overall network cost via the utilization of the proposed designs, thanks to the coexistence of multiple wireless links on the same channel due to the FD capability.

Includes members:
  Member "hardware impairments aware transceiver design for full duplex amplify and forward mimo relaying":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "hardware impairments aware transceiver design for bidirectional full duplex mimo ofdm systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate splitting for massive mimo multi carrier system using full duplex decode and forward relay with hardware impairments")
  Member "sum rate analysis and optimization of self backhauling based full duplex radio access system":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity analysis for full duplex self backhauled small cells")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "a survey of energy efficient techniques for 5g networks and challenges ahead":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "hardware impairments aware transceiver for full duplex massive mimo relaying":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "intelligent reflecting surface enhanced wireless network two timescale beamforming optimization")
  Member "full duplex mimo small cell networks performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the stochastic geometry analyses of cellular networks with alpha stable self similarity")
  Member "small cell in band wireless backhaul in massive mimo systems a cooperation of next generation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "integrated access and backhaul optimization for millimeter wave heterogeneous networks")

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)