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 "optimization of mimo device to device networks via matrix fractional programming a minorization maximization approach"):
  Abstract: Interference management is a fundamental issue in device-to-device (D2D) communications whenever the transmitter-and-receiver pairs are located in close proximity and frequencies are fully reused, so active links may severely interfere with each other. This paper devises an optimization strategy named FPLinQ to coordinate the link scheduling decisions among the interfering links, along with power control and beamforming. The key enabler is a novel optimization method called matrix fractional programming (FP) that generalizes previous scalar and vector forms of FP in allowing multiple data streams per link. From a theoretical perspective, this paper provides a deeper understanding of FP by showing a connection to the minorization-maximization (MM) algorithm. From an application perspective, this paper shows that as compared to the existing methods for coordinating scheduling in the D2D network, such as FlashLinQ, ITLinQ, and ITLinQ+, the proposed FPLinQ approach is more general in allowing multiple antennas at both the transmitters and the receivers, and further in allowing arbitrary and multiple possible associations between the devices via matching. Numerical results show that FPLinQ significantly outperforms the previous state-of-the-art in a typical D2D communication environment.

Includes members:
  Member "a centralized metropolitan scale radio resource management scheme":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coordinated scheduling and spectrum sharing via matrix fractional programming")
  Member "fractional programming for communication systems part i power control and beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "fractional programming for communication systems part ii uplink scheduling via matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint sparse beamforming and power control for large scale das with network assistant full duplex")
  Member "optimality of treating interference as noise a combinatorial perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "fast resource scheduling in hetnets with d2d support":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coordinated scheduling and spectrum sharing via matrix fractional programming")
  Member "traffic driven spectrum allocation in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "delay optimal biased user association in heterogeneous networks")
  Member "distributed algorithms for spectrum allocation power control routing and congestion control in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coordinated scheduling and spectrum sharing via matrix fractional programming")

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)