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 "multi user mimo scheduling in the fourth generation cellular uplink"):
  Abstract: We consider Multi-User MIMO (MU-MIMO) scheduling in the 3GPP LTE-Advanced (3GPP LTE-A) cellular uplink. The 3GPP LTE-A uplink allows for precoded multi-stream (precoded MIMO) transmission from each scheduled user and also allows flexible multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource. However, exploiting these features is made challenging by certain practical constraints that have been imposed in order to maintain a low signaling overhead. We show that while the scheduling problem in the 3GPP LTE-A cellular uplink is NP-hard, it can be formulated as the maximization of a submodular set function subject to one matroid and multiple knapsack constraints. We then propose constant-factor polynomial-time approximation algorithms and demonstrate their superior performance via simulations.

Includes members:
  Member "multi user scheduling in the 3gpp lte cellular uplink":
    also connected through other hyperedges:
      (none)
  Member "sub modularity and antenna selection in mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reversible computation in wireless communications")
  Member "efficient submodular function maximization under linear packing constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "costly circuits submodular schedules hybrid switch scheduling for data centers")
  Member "on k column sparse packing programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random order contention resolution schemes")
  Member "limited feedback based block diagonalization for the mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo amplify and forward precoding for networked control systems")
  Member "message passing resource allocation for the uplink of multicarrier systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed resource allocation for relay aided device to device communication a message passing approach")
  Member "joint beamforming for multiaccess mimo systems with finite rate feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interference alignment under limited feedback for mimo interference channels")
  Member "a tight lower bound to the outage probability of discrete input block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time varying space only codes for coded mimo")

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)