human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "partitioning of distributed mimo systems based on overhead considerations"
  Abstract: Distributed-Multiple Input Multiple Output (D-MIMO) networks is a promising enabler to address the challenges of high traffic demand in future wireless networks. A limiting factor that is directly related to the performance of these systems is the overhead signaling required for distributing data and control information among the network elements. In this paper, the concept of orthogonal partitioning is extended to D-MIMO networks employing joint multi-user beamforming, aiming to maximize the effective sum-rate, i.e., the actual transmitted information data. Furthermore, in order to comply with practical requirements, the overhead subframe size is considered to be constrained. In this context, a novel formulation of constrained orthogonal partitioning is introduced as an elegant Knapsack optimization problem, which allows the derivation of quick and accurate solutions. Several numerical results give insight into the capabilities of D-MIMO networks and the actual sum-rate scaling under overhead constraints.

Connected through hyperedge HE-1 (induced by source paper "spatial resources optimization in distributed mimo networks with limited data sharing"):
  with members:
    - "joint base station clustering and beamformer design for partial coordinated transmission in heterogenous networks"
    - "airsync enabling distributed multiuser mimo with full spatial multiplexing"
    - "user partitioning for less overhead in mimo interference channels"
    - "linear precoding in cooperative mimo cellular networks with limited coordination clusters"

Question: Please tell me which class the center node 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)