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 "coalition game based full duplex concurrent scheduling in millimeter wave wireless backhaul network"):
  Abstract: With the development of self-interference (SI) cancelation technology, full-duplex (FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot (TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game (FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm can achieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.

Includes members:
  Member "device to device communications enabled energy efficient multicast scheduling in mmwave small cells":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "principal component analysis based broadband hybrid precoding for millimeter wave massive mimo systems")
  Member "qos aware full duplex concurrent scheduling for millimeter wave wireless backhaul networks":
    also connected through other hyperedges:
      (none)
  Member "full duplex amplify and forward relaying power and location optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sub channel allocation for device to device underlaying full duplex mmwave small cells using coalition formation games")
  Member "hierarchical codebook design for beamforming training in millimeter wave communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "edge cache assisted secure low latency millimeter wave transmission")
  Member "boosting spatial reuse via multiple path multihop scheduling for directional mmwave wpans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient power control of train ground mmwave communication for high speed trains")
  Member "exploiting device to device communications in joint scheduling of access and backhaul for mmwave small cells":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sub channel allocation for device to device underlaying full duplex mmwave small cells using coalition formation games")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")

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)